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_SET_H_ | 5 #ifndef BASE_CONTAINERS_FLAT_SET_H_ |
6 #define BASE_CONTAINERS_FLAT_SET_H_ | 6 #define BASE_CONTAINERS_FLAT_SET_H_ |
7 | 7 |
8 #include <functional> | 8 #include <functional> |
9 | 9 |
10 #include "base/containers/flat_tree.h" | 10 #include "base/containers/flat_tree.h" |
(...skipping 66 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
77 // reverse_iterator rbegin(); | 77 // reverse_iterator rbegin(); |
78 // const reverse_iterator rbegin() const; | 78 // const reverse_iterator rbegin() const; |
79 // const_reverse_iterator crbegin() const; | 79 // const_reverse_iterator crbegin() const; |
80 // reverse_iterator rend(); | 80 // reverse_iterator rend(); |
81 // const_reverse_iterator rend() const; | 81 // const_reverse_iterator rend() const; |
82 // const_reverse_iterator crend() const; | 82 // const_reverse_iterator crend() const; |
83 // | 83 // |
84 // Insert and accessor functions: | 84 // Insert and accessor functions: |
85 // pair<iterator, bool> insert(const Key&); | 85 // pair<iterator, bool> insert(const Key&); |
86 // pair<iterator, bool> insert(Key&&); | 86 // pair<iterator, bool> insert(Key&&); |
| 87 // void insert(InputIterator first, InputIterator last, |
| 88 // FlatContainerDupes); |
87 // pair<iterator, bool> emplace(Args&&...); | 89 // pair<iterator, bool> emplace(Args&&...); |
88 // iterator emplace_hint(const_iterator, Args&&...); | 90 // iterator emplace_hint(const_iterator, Args&&...); |
89 // | 91 // |
90 // Erase functions: | 92 // Erase functions: |
91 // iterator erase(const_iterator); | 93 // iterator erase(const_iterator); |
92 // iterator erase(const_iterator first, const_iterator& last); | 94 // iterator erase(const_iterator first, const_iterator& last); |
93 // size_t erase(const Key& key) | 95 // size_t erase(const Key& key) |
94 // | 96 // |
95 // Comparators (see std::set documentation). | 97 // Comparators (see std::set documentation). |
96 // key_compare key_comp() const; | 98 // key_compare key_comp() const; |
(...skipping 23 matching lines...) Expand all Loading... |
120 template <class Key, class Compare = std::less<Key>> | 122 template <class Key, class Compare = std::less<Key>> |
121 using flat_set = typename ::base::internal::flat_tree< | 123 using flat_set = typename ::base::internal::flat_tree< |
122 Key, | 124 Key, |
123 Key, | 125 Key, |
124 ::base::internal::GetKeyFromValueIdentity<Key>, | 126 ::base::internal::GetKeyFromValueIdentity<Key>, |
125 Compare>; | 127 Compare>; |
126 | 128 |
127 } // namespace base | 129 } // namespace base |
128 | 130 |
129 #endif // BASE_CONTAINERS_FLAT_SET_H_ | 131 #endif // BASE_CONTAINERS_FLAT_SET_H_ |
OLD | NEW |