Lines Matching refs:map_

50     : map_(cmp, allocator) {  in map_()  function
54 map_ = rhs.map_;
58 allocator_type get_allocator() const { return map_.get_allocator(); } in get_allocator()
59 key_compare key_comp() const { return map_.key_comp(); } in key_comp()
60 value_compare value_comp() const { return map_.value_comp(); } in value_comp()
62 iterator begin() { return map_.begin(); } in begin()
63 const_iterator begin() const { return map_.begin(); } in begin()
64 iterator end() { return map_.end(); } in end()
65 const_iterator end() const { return map_.end(); } in end()
67 bool empty() const { return map_.empty(); } in empty()
68 size_type size() const { return map_.size(); } in size()
70 void swap(Self& other) { map_.swap(other.map_); } in swap()
71 void clear() { map_.clear(); } in clear()
72 iterator erase(iterator it) { return map_.erase(it); } in erase()
73 template<typename Kv> size_type erase(const Kv& k) { return map_.erase(k); } in erase()
75 template<typename Kv> iterator find(const Kv& k) { return map_.find(k); } in find()
76 template<typename Kv> const_iterator find(const Kv& k) const { return map_.find(k); } in find()
78 template<typename Kv> iterator lower_bound(const Kv& k) { return map_.lower_bound(k); } in lower_bound()
80 return map_.lower_bound(k); in lower_bound()
83 template<typename Kv> iterator upper_bound(const Kv& k) { return map_.upper_bound(k); } in upper_bound()
85 return map_.upper_bound(k); in upper_bound()
88 template<typename Kv> size_type count(const Kv& k) const { return map_.count(k); } in count()
92 const_iterator it = map_.find(k); in Get()
93 DCHECK(it != map_.end()); in Get()
99 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
104 std::pair<iterator, bool> result = map_.emplace(k, std::move(v)); in Put()
112 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
113 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
114 return map_.emplace_hint(pos, k, v); in PutBefore()
118 DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first)); in PutBefore()
119 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); in PutBefore()
120 return map_.emplace_hint(pos, k, std::move(v)); in PutBefore()
127 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v)); in Overwrite()
158 return map_ == rhs.map_; in Equals()
163 return map_.emplace(std::forward<Args>(args)...); in emplace()
167 ::std::map<K, V, Comparator, Allocator> map_;