80   size_type erase(const key_type& k) { return map_.erase(k); }  in erase()
83   node_type extract(const key_type& k) { return map_.extract(k); }  in extract()
91   template<typename Kv> iterator find(const Kv& k) { return map_.find(k); }  in find()
92   template<typename Kv> const_iterator find(const Kv& k) const { return map_.find(k); }  in find()
94   template<typename Kv> iterator lower_bound(const Kv& k) { return map_.lower_bound(k); }  in lower_bound()
95   template<typename Kv> const_iterator lower_bound(const Kv& k) const {  in lower_bound()
99   template<typename Kv> iterator upper_bound(const Kv& k) { return map_.upper_bound(k); }  in upper_bound()
100   template<typename Kv> const_iterator upper_bound(const Kv& k) const {  in upper_bound()
104   template<typename Kv> size_type count(const Kv& k) const { return map_.count(k); }  in count()
107   V Get(const K& k) const {  in Get()
114   iterator Put(const K& k, const V& v) {  in Put()
119   iterator Put(const K& k, V&& v) {  in Put()
126   iterator PutBefore(const_iterator pos, const K& k, const V& v) {  in PutBefore()
132   iterator PutBefore(const_iterator pos, const K& k, V&& v) {  in PutBefore()
142   iterator Overwrite(const K& k, const V& v) {  in Overwrite()
152   V& GetOrCreate(const K& k, CreateFn&& create) {  in GetOrCreate()
163   iterator FindOrAdd(const K& k, const V& v) {  in FindOrAdd()
168   iterator FindOrAdd(const K& k) {  in FindOrAdd()