42     map_ = rhs.map_;
46   iterator begin() { return map_.begin(); }  in begin()
47   const_iterator begin() const { return map_.begin(); }  in begin()
48   iterator end() { return map_.end(); }  in end()
49   const_iterator end() const { return map_.end(); }  in end()
51   bool empty() const { return map_.empty(); }  in empty()
52   size_type size() const { return map_.size(); }  in size()
54   void clear() { map_.clear(); }  in clear()
55   void erase(iterator it) { map_.erase(it); }  in erase()
56   size_type erase(const K& k) { return map_.erase(k); }  in erase()
58   iterator find(const K& k) { return map_.find(k); }  in find()
59   const_iterator find(const K& k) const { return map_.find(k); }  in find()
61   size_type count(const K& k) const { return map_.count(k); }  in count()
65     const_iterator it = map_.find(k);  in Get()
66     DCHECK(it != map_.end());  in Get()
72     std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));  in Put()
80     std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v));  in Overwrite()
88     return map_ == rhs.map_;  in Equals()
92   ::std::map<K, V, Comparator, Allocator> map_;