Lines Matching defs:first
21 // extracts the key as the first element of a pair.
25 return p.first;
62 // flat_map(InputIterator first, InputIterator last,
111 // void insert(InputIterator first, InputIterator last,
123 // iterator erase(const_iterator first, const_iterator& last);
183 flat_map(InputIterator first,
203 // Takes the first if there are duplicates in the initializer list.
249 flat_map<Key, Mapped, Compare>::flat_map(InputIterator first,
253 : tree(first, last, dupe_handling, comp) {}
278 // from first creating a flat_map and then move assigning it. This most
291 if (found == tree::end() || tree::key_comp()(key, found->first))
300 if (found == tree::end() || tree::key_comp()(key, found->first))
312 result.first->second = std::forward<M>(obj);
324 result.first->second = std::forward<M>(obj);
325 return result.first;
349 .first;