71   size_type erase(const K& k) { return map_.erase(k); }  in erase()  argument
73   iterator find(const K& k) { return map_.find(k); }  in find()  argument
74   const_iterator find(const K& k) const { return map_.find(k); }  in find()  argument
76   iterator lower_bound(const K& k) { return map_.lower_bound(k); }  in lower_bound()  argument
77   const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); }  in lower_bound()  argument
79   size_type count(const K& k) const { return map_.count(k); }  in count()  argument
82   V Get(const K& k) const {  in Get()  argument
83     const_iterator it = map_.find(k);  in Get()
89   iterator Put(const K& k, const V& v) {  in Put()  argument
90     std::pair<iterator, bool> result = map_.emplace(k, v);  in Put()
96   iterator PutBefore(iterator pos, const K& k, const V& v) {  in PutBefore()  argument
98     DCHECK(pos == map_.end() || map_.key_comp()(k, pos->first));  in PutBefore()
99     DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));  in PutBefore()
100     return map_.emplace_hint(pos, k, v);  in PutBefore()
106   void Overwrite(const K& k, const V& v) {  in Overwrite()  argument
107     std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));  in Overwrite()