Lines Matching refs:map_
50 : map_(cmp, allocator) {
54 map_ = rhs.map_;
58 allocator_type get_allocator() const { return map_.get_allocator(); }
59 key_compare key_comp() const { return map_.key_comp(); }
60 value_compare value_comp() const { return map_.value_comp(); }
62 iterator begin() { return map_.begin(); }
63 const_iterator begin() const { return map_.begin(); }
64 iterator end() { return map_.end(); }
65 const_iterator end() const { return map_.end(); }
67 bool empty() const { return map_.empty(); }
68 size_type size() const { return map_.size(); }
70 void swap(Self& other) { map_.swap(other.map_); }
71 void clear() { map_.clear(); }
72 iterator erase(iterator it) { return map_.erase(it); }
73 size_type erase(const K& k) { return map_.erase(k); }
75 iterator find(const K& k) { return map_.find(k); }
76 const_iterator find(const K& k) const { return map_.find(k); }
78 iterator lower_bound(const K& k) { return map_.lower_bound(k); }
79 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); }
81 size_type count(const K& k) const { return map_.count(k); }
85 const_iterator it = map_.find(k);
86 DCHECK(it != map_.end());
92 std::pair<iterator, bool> result = map_.emplace(k, v);
97 std::pair<iterator, bool> result = map_.emplace(k, std::move(v));
105 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));
106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
107 return map_.emplace_hint(pos, k, v);
111 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));
112 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
113 return map_.emplace_hint(pos, k, std::move(v));
120 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));
141 return map_ == rhs.map_;
145 ::std::map<K, V, Comparator, Allocator> map_;
