OLD | NEW |
1 // Copyright 2017 The Chromium Authors. All rights reserved. | 1 // Copyright 2017 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_FLAT_MAP_H_ | 5 #ifndef BASE_CONTAINERS_FLAT_MAP_H_ |
6 #define BASE_CONTAINERS_FLAT_MAP_H_ | 6 #define BASE_CONTAINERS_FLAT_MAP_H_ |
7 | 7 |
8 #include <utility> | 8 #include <utility> |
9 | 9 |
10 #include "base/containers/flat_tree.h" | 10 #include "base/containers/flat_tree.h" |
(...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
91 // const_reverse_iterator crbegin() const; | 91 // const_reverse_iterator crbegin() const; |
92 // reverse_iterator rend(); | 92 // reverse_iterator rend(); |
93 // const_reverse_iterator rend() const; | 93 // const_reverse_iterator rend() const; |
94 // const_reverse_iterator crend() const; | 94 // const_reverse_iterator crend() const; |
95 // | 95 // |
96 // Insert and accessor functions: | 96 // Insert and accessor functions: |
97 // Mapped& operator[](const Key&); | 97 // Mapped& operator[](const Key&); |
98 // Mapped& operator[](Key&&); | 98 // Mapped& operator[](Key&&); |
99 // pair<iterator, bool> insert(const pair<Key, Mapped>&); | 99 // pair<iterator, bool> insert(const pair<Key, Mapped>&); |
100 // pair<iterator, bool> insert(pair<Key, Mapped>&&); | 100 // pair<iterator, bool> insert(pair<Key, Mapped>&&); |
| 101 // void insert(InputIterator first, InputIterator last, |
| 102 // FlatContainerDupes); |
101 // pair<iterator, bool> emplace(Args&&...); | 103 // pair<iterator, bool> emplace(Args&&...); |
102 // iterator emplace_hint(const_iterator, Args&&...); | 104 // iterator emplace_hint(const_iterator, Args&&...); |
103 // | 105 // |
104 // Erase functions: | 106 // Erase functions: |
105 // iterator erase(const_iterator); | 107 // iterator erase(const_iterator); |
106 // iterator erase(const_iterator first, const_iterator& last); | 108 // iterator erase(const_iterator first, const_iterator& last); |
107 // size_t erase(const Key& key) | 109 // size_t erase(const Key& key) |
108 // | 110 // |
109 // Comparators (see std::map documentation). | 111 // Comparators (see std::map documentation). |
110 // key_compare key_comp() const; | 112 // key_compare key_comp() const; |
(...skipping 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
297 // General operations. | 299 // General operations. |
298 | 300 |
299 template <class Key, class Mapped, class Compare> | 301 template <class Key, class Mapped, class Compare> |
300 void flat_map<Key, Mapped, Compare>::swap(flat_map& other) { | 302 void flat_map<Key, Mapped, Compare>::swap(flat_map& other) { |
301 tree::swap(other); | 303 tree::swap(other); |
302 } | 304 } |
303 | 305 |
304 } // namespace base | 306 } // namespace base |
305 | 307 |
306 #endif // BASE_CONTAINERS_FLAT_MAP_H_ | 308 #endif // BASE_CONTAINERS_FLAT_MAP_H_ |
OLD | NEW |