Lines Matching refs:first
49 ordered_map(It first, It last, const Allocator& alloc = Allocator())
50 : Container{first, last, alloc} {}
58 if (m_compare(it->first, key))
73 if (m_compare(it->first, key))
84 return emplace(key, T{}).first->second;
91 return emplace(std::forward<KeyType>(key), T{}).first->second;
110 if (m_compare(it->first, key))
125 if (m_compare(it->first, key))
138 if (m_compare(it->first, key))
153 if (m_compare(it->first, key))
166 if (m_compare(it->first, key))
187 if (m_compare(it->first, key))
207 iterator erase(iterator first, iterator last)
209 if (first == last)
211 return first;
214 const auto elements_affected = std::distance(first, last);
215 const auto offset = std::distance(Container::begin(), first);
221 // to first. We will need this later.
225 // first last
228 // We start at first and re-construct (viz. copy) the elements from
229 // the back of the vector. Example for first iteration:
237 for (auto it = first; std::next(it, elements_affected) != Container::end(); ++it)
245 // first last
252 // first last
254 // first is now pointing past the last deleted element, but we cannot
264 if (m_compare(it->first, key))
278 if (m_compare(it->first, key))
290 if (m_compare(it->first, key))
304 if (m_compare(it->first, key))
316 if (m_compare(it->first, key))
326 return emplace(value.first, std::move(value.second));
333 if (m_compare(it->first, value.first))
347 void insert(InputIt first, InputIt last)
349 for (auto it = first; it != last; ++it)