Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef CC_SCOPED_PTR_HASH_MAP_H_ | 5 #ifndef CC_SCOPED_PTR_HASH_MAP_H_ |
| 6 #define CC_SCOPED_PTR_HASH_MAP_H_ | 6 #define CC_SCOPED_PTR_HASH_MAP_H_ |
| 7 | 7 |
| 8 #include "base/basictypes.h" | 8 #include "base/basictypes.h" |
| 9 #include "base/hash_tables.h" | 9 #include "base/hash_tables.h" |
| 10 #include "base/stl_util.h" | 10 #include "base/stl_util.h" |
| (...skipping 104 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 115 } | 115 } |
| 116 | 116 |
| 117 inline bool contains(const Key& k) const { return data_.count(k); } | 117 inline bool contains(const Key& k) const { return data_.count(k); } |
| 118 | 118 |
| 119 inline void clear() { STLDeleteValues(&data_); } | 119 inline void clear() { STLDeleteValues(&data_); } |
| 120 | 120 |
| 121 inline const_iterator find(const Key& k) const { return data_.find(k); } | 121 inline const_iterator find(const Key& k) const { return data_.find(k); } |
| 122 inline iterator find(const Key& k) { return data_.find(k); } | 122 inline iterator find(const Key& k) { return data_.find(k); } |
| 123 | 123 |
| 124 inline size_t count(const Key& k) const { return data_.count(k); } | 124 inline size_t count(const Key& k) const { return data_.count(k); } |
| 125 inline pair<const_iterator, const_iterator> equal_range(const Key& k) const { | 125 inline std::pair<const_iterator, const_iterator> equal_range( |
|
jamesr
2012/09/26 00:00:21
hah, whoops! guessing this just wasn't referenced
danakj
2012/09/26 00:03:50
I think removing some header that was using std::p
| |
| 126 const Key& k) const { | |
| 126 return data_.equal_range(k); | 127 return data_.equal_range(k); |
| 127 } | 128 } |
| 128 inline pair<iterator, iterator> equal_range(const Key& k) { | 129 inline std::pair<iterator, iterator> equal_range(const Key& k) { |
| 129 return data_.equal_range(k); | 130 return data_.equal_range(k); |
| 130 } | 131 } |
| 131 | 132 |
| 132 inline size_t size() const { return data_.size(); } | 133 inline size_t size() const { return data_.size(); } |
| 133 inline size_t max_size() const { return data_.max_size(); } | 134 inline size_t max_size() const { return data_.max_size(); } |
| 134 | 135 |
| 135 inline bool empty() const { return data_.empty(); } | 136 inline bool empty() const { return data_.empty(); } |
| 136 | 137 |
| 137 inline size_t bucket_count() const { return data_.bucket_count(); } | 138 inline size_t bucket_count() const { return data_.bucket_count(); } |
| 138 inline void resize(size_t size) const { return data_.resize(size); } | 139 inline void resize(size_t size) const { return data_.resize(size); } |
| 139 | 140 |
| 140 inline hasher hash_funct() const { return data_.hash_funct(); } | 141 inline hasher hash_funct() const { return data_.hash_funct(); } |
| 141 inline key_equal key_eq() const { return data_.key_eq(); } | 142 inline key_equal key_eq() const { return data_.key_eq(); } |
| 142 | 143 |
| 143 inline iterator begin() { return data_.begin(); } | 144 inline iterator begin() { return data_.begin(); } |
| 144 inline const_iterator begin() const { return data_.begin(); } | 145 inline const_iterator begin() const { return data_.begin(); } |
| 145 inline iterator end() { return data_.end(); } | 146 inline iterator end() { return data_.end(); } |
| 146 inline const_iterator end() const { return data_.end(); } | 147 inline const_iterator end() const { return data_.end(); } |
| 147 | 148 |
| 148 private: | 149 private: |
| 149 Container data_; | 150 Container data_; |
| 150 | 151 |
| 151 DISALLOW_COPY_AND_ASSIGN(ScopedPtrHashMap); | 152 DISALLOW_COPY_AND_ASSIGN(ScopedPtrHashMap); |
| 152 }; | 153 }; |
| 153 | 154 |
| 154 } // namespace cc | 155 } // namespace cc |
| 155 | 156 |
| 156 #endif // CC_SCOPED_PTR_HASH_MAP_H_ | 157 #endif // CC_SCOPED_PTR_HASH_MAP_H_ |
| OLD | NEW |