Lines Matching defs:data_
38 data_.swap(other.data_);
50 return data_.insert(std::make_pair(key, data.release())).first;
56 data_.insert(std::make_pair(key, data.get()));
64 data_.erase(it);
68 iterator it = data_.find(k);
69 if (it == data_.end())
76 DCHECK(it != data_.end());
77 if (it == data_.end())
87 if (it == data_.end())
94 DCHECK(it != data_.end());
95 if (it == data_.end())
99 data_.erase(it);
105 if (it == data_.end())
120 inline bool contains(const Key& k) const { return data_.count(k) > 0; }
122 inline void clear() { STLDeleteValues(&data_); }
124 inline const_iterator find(const Key& k) const { return data_.find(k); }
125 inline iterator find(const Key& k) { return data_.find(k); }
127 inline size_t count(const Key& k) const { return data_.count(k); }
130 return data_.equal_range(k);
133 return data_.equal_range(k);
136 inline size_t size() const { return data_.size(); }
137 inline size_t max_size() const { return data_.max_size(); }
139 inline bool empty() const { return data_.empty(); }
141 inline size_t bucket_count() const { return data_.bucket_count(); }
142 inline void resize(size_t size) { return data_.resize(size); }
144 inline iterator begin() { return data_.begin(); }
145 inline const_iterator begin() const { return data_.begin(); }
146 inline iterator end() { return data_.end(); }
147 inline const_iterator end() const { return data_.end(); }
150 Container data_;