73   size_type erase(const K& k) { return map_.erase(k); }  in erase()
75   iterator find(const K& k) { return map_.find(k); }  in find()
76   const_iterator find(const K& k) const { return map_.find(k); }  in find()
78   iterator lower_bound(const K& k) { return map_.lower_bound(k); }  in lower_bound()
79   const_iterator lower_bound(const K& k) const { return map_.lower_bound(k); }  in lower_bound()
81   size_type count(const K& k) const { return map_.count(k); }  in count()
84   V Get(const K& k) const {  in Get()
91   iterator Put(const K& k, const V& v) {  in Put()
96   iterator Put(const K& k, V&& v) {  in Put()
103   iterator PutBefore(const_iterator pos, const K& k, const V& v) {  in PutBefore()
109   iterator PutBefore(const_iterator pos, const K& k, V&& v) {  in PutBefore()
119   iterator Overwrite(const K& k, const V& v) {  in Overwrite()
129   V GetOrCreate(const K& k, CreateFn create) {  in GetOrCreate()