Lines Matching refs:map_
48 : map_(cmp, allocator) {
52 map_ = rhs.map_;
56 allocator_type get_allocator() const { return map_.get_allocator(); }
57 key_compare key_comp() const { return map_.key_comp(); }
58 value_compare value_comp() const { return map_.value_comp(); }
60 iterator begin() { return map_.begin(); }
61 const_iterator begin() const { return map_.begin(); }
62 iterator end() { return map_.end(); }
63 const_iterator end() const { return map_.end(); }
65 bool empty() const { return map_.empty(); }
66 size_type size() const { return map_.size(); }
68 void swap(Self& other) { map_.swap(other.map_); }
69 void clear() { map_.clear(); }
70 iterator erase(iterator it) { return map_.erase(it); }
71 size_type erase(const K& k) { return map_.erase(k); }
73 iterator find(const K& k) { return map_.find(k); }
74 const_iterator find(const K& k) const { return map_.find(k); }
76 iterator lower_bound(const K& k) { return map_.lower_bound(k); }
77 const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); }
79 size_type count(const K& k) const { return map_.count(k); }
83 const_iterator it = map_.find(k);
84 DCHECK(it != map_.end());
90 std::pair<iterator, bool> result = map_.emplace(k, v);
98 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));
99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));
100 return map_.emplace_hint(pos, k, v);
107 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));
115 return map_ == rhs.map_;
119 ::std::map<K, V, Comparator, Allocator> map_;
