Lines Matching refs:it
40 // For hash_[multi]set, it is important that this deletes behind the iterator
41 // because the hash_set may call the hash function on the iterator when it is
74 // in the case it's given a null pointer.
121 auto it = std::find(container.begin(), container.end(), value);
122 DCHECK(it != container.end()); // Must exist.
123 return std::distance(container.begin(), it);
129 auto it = std::find(container.begin(), container.end(), value);
130 DCHECK(it != container.end()); // Must exist.
131 container.erase(it);
137 auto it = std::find(container.begin(), container.end(), old_value);
138 DCHECK(it != container.end()); // Must exist.
139 *it = new_value;
142 // Search for an element with the specified value and return true if it was found, false otherwise.
148 auto it = std::find(start, container.end(), value);
149 return it != container.end();