40   typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator;  typedef
61   iterator begin() { return map_.begin(); }  in begin()
63   iterator end() { return map_.end(); }  in end()
71   iterator erase(iterator it) { return map_.erase(it); }  in erase()
74   iterator find(const K& k) { return map_.find(k); }  in find()
77   iterator lower_bound(const K& k) { return map_.lower_bound(k); }  in lower_bound()
90   iterator Put(const K& k, const V& v) {  in Put()
91     std::pair<iterator, bool> result = map_.emplace(k, v);  in Put()
97   iterator PutBefore(iterator pos, const K& k, const V& v) {  in PutBefore()
100     DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));  in PutBefore()
108     std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));  in Overwrite()