40   typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator;  typedef
62   iterator begin() { return map_.begin(); }  in begin()
64   iterator end() { return map_.end(); }  in end()
72   iterator erase(iterator it) { return map_.erase(it); }  in erase()
75   iterator find(const K& k) { return map_.find(k); }  in find()
78   iterator lower_bound(const K& k) { return map_.lower_bound(k); }  in lower_bound()
81   iterator upper_bound(const K& k) { return map_.upper_bound(k); }  in upper_bound()
94   iterator Put(const K& k, const V& v) {  in Put()
95     std::pair<iterator, bool> result = map_.emplace(k, v);  in Put()
99   iterator Put(const K& k, V&& v) {  in Put()
100     std::pair<iterator, bool> result = map_.emplace(k, std::move(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()
123     std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));  in Overwrite()
143   iterator FindOrAdd(const K& k, const V& v) {  in FindOrAdd()
144     iterator it = find(k);  in FindOrAdd()
148   iterator FindOrAdd(const K& k) {  in FindOrAdd()
149     iterator it = find(k);  in FindOrAdd()
158   std::pair<iterator, bool> emplace(Args&&... args) {  in emplace()