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   iterator upper_bound(const K& k) { return map_.upper_bound(k); }  in upper_bound()
82   const_iterator upper_bound(const K& k) const { return map_.upper_bound(k); }  in upper_bound()
84   size_type count(const K& k) const { return map_.count(k); }  in count()
87   V Get(const K& k) const {  in Get()
94   iterator Put(const K& k, const V& v) {  in Put()
99   iterator Put(const K& k, V&& v) {  in Put()
106   iterator PutBefore(const_iterator pos, const K& k, const V& v) {  in PutBefore()
112   iterator PutBefore(const_iterator pos, const K& k, V&& v) {  in PutBefore()
122   iterator Overwrite(const K& k, const V& v) {  in Overwrite()
132   V& GetOrCreate(const K& k, CreateFn create) {  in GetOrCreate()
143   iterator FindOrAdd(const K& k, const V& v) {  in FindOrAdd()
148   iterator FindOrAdd(const K& k) {  in FindOrAdd()