| OLD | NEW |
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ | 5 #ifndef BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ |
| 6 #define BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ | 6 #define BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ |
| 7 | 7 |
| 8 #include <algorithm> | 8 #include <algorithm> |
| 9 #include <utility> | 9 #include <utility> |
| 10 | 10 |
| (...skipping 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 75 return 1; | 75 return 1; |
| 76 } | 76 } |
| 77 | 77 |
| 78 ScopedPtr take(iterator it) { | 78 ScopedPtr take(iterator it) { |
| 79 DCHECK(it != data_.end()); | 79 DCHECK(it != data_.end()); |
| 80 if (it == data_.end()) | 80 if (it == data_.end()) |
| 81 return ScopedPtr(); | 81 return ScopedPtr(); |
| 82 | 82 |
| 83 ScopedPtr ret(it->second); | 83 ScopedPtr ret(it->second); |
| 84 it->second = NULL; | 84 it->second = NULL; |
| 85 return ret.Pass(); | 85 return ret; |
| 86 } | 86 } |
| 87 | 87 |
| 88 ScopedPtr take(const Key& k) { | 88 ScopedPtr take(const Key& k) { |
| 89 iterator it = find(k); | 89 iterator it = find(k); |
| 90 if (it == data_.end()) | 90 if (it == data_.end()) |
| 91 return ScopedPtr(); | 91 return ScopedPtr(); |
| 92 | 92 |
| 93 return take(it); | 93 return take(it); |
| 94 } | 94 } |
| 95 | 95 |
| 96 ScopedPtr take_and_erase(iterator it) { | 96 ScopedPtr take_and_erase(iterator it) { |
| 97 DCHECK(it != data_.end()); | 97 DCHECK(it != data_.end()); |
| 98 if (it == data_.end()) | 98 if (it == data_.end()) |
| 99 return ScopedPtr(); | 99 return ScopedPtr(); |
| 100 | 100 |
| 101 ScopedPtr ret(it->second); | 101 ScopedPtr ret(it->second); |
| 102 data_.erase(it); | 102 data_.erase(it); |
| 103 return ret.Pass(); | 103 return ret; |
| 104 } | 104 } |
| 105 | 105 |
| 106 ScopedPtr take_and_erase(const Key& k) { | 106 ScopedPtr take_and_erase(const Key& k) { |
| 107 iterator it = find(k); | 107 iterator it = find(k); |
| 108 if (it == data_.end()) | 108 if (it == data_.end()) |
| 109 return ScopedPtr(); | 109 return ScopedPtr(); |
| 110 | 110 |
| 111 return take_and_erase(it); | 111 return take_and_erase(it); |
| 112 } | 112 } |
| 113 | 113 |
| (...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 163 | 163 |
| 164 private: | 164 private: |
| 165 Container data_; | 165 Container data_; |
| 166 | 166 |
| 167 DISALLOW_COPY_AND_ASSIGN(ScopedPtrHashMap); | 167 DISALLOW_COPY_AND_ASSIGN(ScopedPtrHashMap); |
| 168 }; | 168 }; |
| 169 | 169 |
| 170 } // namespace base | 170 } // namespace base |
| 171 | 171 |
| 172 #endif // BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ | 172 #endif // BASE_CONTAINERS_SCOPED_PTR_HASH_MAP_H_ |
| OLD | NEW |