Lines Matching defs:first
477 : first(other_first), second(other_second) {}
478 explicit MapPair(const Key& other_first) : first(other_first), second() {}
480 : first(other.first), second(other.second) {}
487 return std::pair<T1, T2>(first, second);
490 const Key first;
504 // assert(m0.begin()->first == m1.begin()->first); // Bug!
543 Map(const InputIt& first, const InputIt& last, bool old_style = true)
548 insert(first, last);
617 // not cast away constness". So first the maybe const pointer is casted to
806 // Advance through buckets, looking for the first that isn't empty.
947 iterator find(const Key& k) { return iterator(FindHelper(k).first); }
948 const_iterator find(const Key& k) const { return FindHelper(k).first; }
954 if (p.first.node_ != NULL)
955 return std::make_pair(iterator(p.first), false);
973 if (p.first.node_ != NULL)
974 return std::make_pair(iterator(p.first), false);
990 return insert(kv).first->value();
1101 .first,
1528 if (find(key) != end()) assert(key == find(key)->first);
1562 iterator it = find(value.first);
1568 value.first, CreateValueTypeInternal(value))).first), true);
1572 elements_->insert(value.first);
1574 p.first->value() = CreateValueTypeInternal(value);
1576 return std::pair<iterator, bool>(iterator(p.first), p.second);
1580 void insert(InputIt first, InputIt last) {
1581 for (InputIt it = first; it != last; ++it) {
1582 iterator exist_it = find(it->first);
1584 operator[](it->first) = it->second;
1608 void erase(iterator first, iterator last) {
1609 while (first != last) {
1610 first = erase(first);
1643 Arena::CreateInArenaStorage(const_cast<Key*>(&value->first), arena_);
1645 const_cast<Key&>(value->first) = key;
1656 Arena::CreateInArenaStorage(const_cast<Key*>(&p->first), arena_);
1658 const_cast<Key&>(p->first) = value.first;