Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | // -*- C++ -*- |
| 2 | //===---------------------------- set -------------------------------------===// |
| 3 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 4 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 5 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 6 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 7 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 8 | // |
| 9 | //===----------------------------------------------------------------------===// |
| 10 | |
| 11 | #ifndef _LIBCPP_SET |
| 12 | #define _LIBCPP_SET |
| 13 | |
| 14 | /* |
| 15 | |
| 16 | set synopsis |
| 17 | |
| 18 | namespace std |
| 19 | { |
| 20 | |
| 21 | template <class Key, class Compare = less<Key>, |
| 22 | class Allocator = allocator<Key>> |
| 23 | class set |
| 24 | { |
| 25 | public: |
| 26 | // types: |
| 27 | typedef Key key_type; |
| 28 | typedef key_type value_type; |
| 29 | typedef Compare key_compare; |
| 30 | typedef key_compare value_compare; |
| 31 | typedef Allocator allocator_type; |
| 32 | typedef typename allocator_type::reference reference; |
| 33 | typedef typename allocator_type::const_reference const_reference; |
| 34 | typedef typename allocator_type::size_type size_type; |
| 35 | typedef typename allocator_type::difference_type difference_type; |
| 36 | typedef typename allocator_type::pointer pointer; |
| 37 | typedef typename allocator_type::const_pointer const_pointer; |
| 38 | |
| 39 | typedef implementation-defined iterator; |
| 40 | typedef implementation-defined const_iterator; |
| 41 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 42 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
| 43 | |
| 44 | // construct/copy/destroy: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 45 | set() |
| 46 | noexcept( |
| 47 | is_nothrow_default_constructible<allocator_type>::value && |
| 48 | is_nothrow_default_constructible<key_compare>::value && |
| 49 | is_nothrow_copy_constructible<key_compare>::value); |
| 50 | explicit set(const value_compare& comp); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 51 | set(const value_compare& comp, const allocator_type& a); |
| 52 | template <class InputIterator> |
| 53 | set(InputIterator first, InputIterator last, |
| 54 | const value_compare& comp = value_compare()); |
| 55 | template <class InputIterator> |
| 56 | set(InputIterator first, InputIterator last, const value_compare& comp, |
| 57 | const allocator_type& a); |
| 58 | set(const set& s); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 59 | set(set&& s) |
| 60 | noexcept( |
| 61 | is_nothrow_move_constructible<allocator_type>::value && |
| 62 | is_nothrow_move_constructible<key_compare>::value); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 63 | explicit set(const allocator_type& a); |
| 64 | set(const set& s, const allocator_type& a); |
| 65 | set(set&& s, const allocator_type& a); |
| 66 | set(initializer_list<value_type> il, const value_compare& comp = value_compare()); |
| 67 | set(initializer_list<value_type> il, const value_compare& comp, |
| 68 | const allocator_type& a); |
| 69 | ~set(); |
| 70 | |
| 71 | set& operator=(const set& s); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 72 | set& operator=(set&& s) |
| 73 | noexcept( |
| 74 | allocator_type::propagate_on_container_move_assignment::value && |
| 75 | is_nothrow_move_assignable<allocator_type>::value && |
| 76 | is_nothrow_move_assignable<key_compare>::value); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 77 | set& operator=(initializer_list<value_type> il); |
| 78 | |
| 79 | // iterators: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 80 | iterator begin() noexcept; |
| 81 | const_iterator begin() const noexcept; |
| 82 | iterator end() noexcept; |
| 83 | const_iterator end() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 84 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 85 | reverse_iterator rbegin() noexcept; |
| 86 | const_reverse_iterator rbegin() const noexcept; |
| 87 | reverse_iterator rend() noexcept; |
| 88 | const_reverse_iterator rend() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 89 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 90 | const_iterator cbegin() const noexcept; |
| 91 | const_iterator cend() const noexcept; |
| 92 | const_reverse_iterator crbegin() const noexcept; |
| 93 | const_reverse_iterator crend() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 94 | |
| 95 | // capacity: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 96 | bool empty() const noexcept; |
| 97 | size_type size() const noexcept; |
| 98 | size_type max_size() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 99 | |
| 100 | // modifiers: |
| 101 | template <class... Args> |
| 102 | pair<iterator, bool> emplace(Args&&... args); |
| 103 | template <class... Args> |
| 104 | iterator emplace_hint(const_iterator position, Args&&... args); |
| 105 | pair<iterator,bool> insert(const value_type& v); |
| 106 | pair<iterator,bool> insert(value_type&& v); |
| 107 | iterator insert(const_iterator position, const value_type& v); |
| 108 | iterator insert(const_iterator position, value_type&& v); |
| 109 | template <class InputIterator> |
| 110 | void insert(InputIterator first, InputIterator last); |
| 111 | void insert(initializer_list<value_type> il); |
| 112 | |
| 113 | iterator erase(const_iterator position); |
| 114 | size_type erase(const key_type& k); |
| 115 | iterator erase(const_iterator first, const_iterator last); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 116 | void clear() noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 117 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 118 | void swap(set& s) |
| 119 | noexcept( |
| 120 | __is_nothrow_swappable<key_compare>::value && |
| 121 | (!allocator_type::propagate_on_container_swap::value || |
| 122 | __is_nothrow_swappable<allocator_type>::value)); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 123 | |
| 124 | // observers: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 125 | allocator_type get_allocator() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 126 | key_compare key_comp() const; |
| 127 | value_compare value_comp() const; |
| 128 | |
| 129 | // set operations: |
| 130 | iterator find(const key_type& k); |
| 131 | const_iterator find(const key_type& k) const; |
| 132 | size_type count(const key_type& k) const; |
| 133 | iterator lower_bound(const key_type& k); |
| 134 | const_iterator lower_bound(const key_type& k) const; |
| 135 | iterator upper_bound(const key_type& k); |
| 136 | const_iterator upper_bound(const key_type& k) const; |
| 137 | pair<iterator,iterator> equal_range(const key_type& k); |
| 138 | pair<const_iterator,const_iterator> equal_range(const key_type& k) const; |
| 139 | }; |
| 140 | |
| 141 | template <class Key, class Compare, class Allocator> |
| 142 | bool |
| 143 | operator==(const set<Key, Compare, Allocator>& x, |
| 144 | const set<Key, Compare, Allocator>& y); |
| 145 | |
| 146 | template <class Key, class Compare, class Allocator> |
| 147 | bool |
| 148 | operator< (const set<Key, Compare, Allocator>& x, |
| 149 | const set<Key, Compare, Allocator>& y); |
| 150 | |
| 151 | template <class Key, class Compare, class Allocator> |
| 152 | bool |
| 153 | operator!=(const set<Key, Compare, Allocator>& x, |
| 154 | const set<Key, Compare, Allocator>& y); |
| 155 | |
| 156 | template <class Key, class Compare, class Allocator> |
| 157 | bool |
| 158 | operator> (const set<Key, Compare, Allocator>& x, |
| 159 | const set<Key, Compare, Allocator>& y); |
| 160 | |
| 161 | template <class Key, class Compare, class Allocator> |
| 162 | bool |
| 163 | operator>=(const set<Key, Compare, Allocator>& x, |
| 164 | const set<Key, Compare, Allocator>& y); |
| 165 | |
| 166 | template <class Key, class Compare, class Allocator> |
| 167 | bool |
| 168 | operator<=(const set<Key, Compare, Allocator>& x, |
| 169 | const set<Key, Compare, Allocator>& y); |
| 170 | |
| 171 | // specialized algorithms: |
| 172 | template <class Key, class Compare, class Allocator> |
| 173 | void |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 174 | swap(set<Key, Compare, Allocator>& x, set<Key, Compare, Allocator>& y) |
| 175 | noexcept(noexcept(x.swap(y))); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 176 | |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 177 | template <class Key, class Compare = less<Key>, |
| 178 | class Allocator = allocator<Key>> |
| 179 | class multiset |
| 180 | { |
| 181 | public: |
| 182 | // types: |
| 183 | typedef Key key_type; |
| 184 | typedef key_type value_type; |
| 185 | typedef Compare key_compare; |
| 186 | typedef key_compare value_compare; |
| 187 | typedef Allocator allocator_type; |
| 188 | typedef typename allocator_type::reference reference; |
| 189 | typedef typename allocator_type::const_reference const_reference; |
| 190 | typedef typename allocator_type::size_type size_type; |
| 191 | typedef typename allocator_type::difference_type difference_type; |
| 192 | typedef typename allocator_type::pointer pointer; |
| 193 | typedef typename allocator_type::const_pointer const_pointer; |
| 194 | |
| 195 | typedef implementation-defined iterator; |
| 196 | typedef implementation-defined const_iterator; |
| 197 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 198 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
| 199 | |
| 200 | // construct/copy/destroy: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 201 | multiset() |
| 202 | noexcept( |
| 203 | is_nothrow_default_constructible<allocator_type>::value && |
| 204 | is_nothrow_default_constructible<key_compare>::value && |
| 205 | is_nothrow_copy_constructible<key_compare>::value); |
| 206 | explicit multiset(const value_compare& comp); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 207 | multiset(const value_compare& comp, const allocator_type& a); |
| 208 | template <class InputIterator> |
| 209 | multiset(InputIterator first, InputIterator last, |
| 210 | const value_compare& comp = value_compare()); |
| 211 | template <class InputIterator> |
| 212 | multiset(InputIterator first, InputIterator last, |
| 213 | const value_compare& comp, const allocator_type& a); |
| 214 | multiset(const multiset& s); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 215 | multiset(multiset&& s) |
| 216 | noexcept( |
| 217 | is_nothrow_move_constructible<allocator_type>::value && |
| 218 | is_nothrow_move_constructible<key_compare>::value); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 219 | explicit multiset(const allocator_type& a); |
| 220 | multiset(const multiset& s, const allocator_type& a); |
| 221 | multiset(multiset&& s, const allocator_type& a); |
| 222 | multiset(initializer_list<value_type> il, const value_compare& comp = value_compare()); |
| 223 | multiset(initializer_list<value_type> il, const value_compare& comp, |
| 224 | const allocator_type& a); |
| 225 | ~multiset(); |
| 226 | |
| 227 | multiset& operator=(const multiset& s); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 228 | multiset& operator=(multiset&& s) |
| 229 | noexcept( |
| 230 | allocator_type::propagate_on_container_move_assignment::value && |
| 231 | is_nothrow_move_assignable<allocator_type>::value && |
| 232 | is_nothrow_move_assignable<key_compare>::value); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 233 | multiset& operator=(initializer_list<value_type> il); |
| 234 | |
| 235 | // iterators: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 236 | iterator begin() noexcept; |
| 237 | const_iterator begin() const noexcept; |
| 238 | iterator end() noexcept; |
| 239 | const_iterator end() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 240 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 241 | reverse_iterator rbegin() noexcept; |
| 242 | const_reverse_iterator rbegin() const noexcept; |
| 243 | reverse_iterator rend() noexcept; |
| 244 | const_reverse_iterator rend() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 245 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 246 | const_iterator cbegin() const noexcept; |
| 247 | const_iterator cend() const noexcept; |
| 248 | const_reverse_iterator crbegin() const noexcept; |
| 249 | const_reverse_iterator crend() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 250 | |
| 251 | // capacity: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 252 | bool empty() const noexcept; |
| 253 | size_type size() const noexcept; |
| 254 | size_type max_size() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 255 | |
| 256 | // modifiers: |
| 257 | template <class... Args> |
| 258 | iterator emplace(Args&&... args); |
| 259 | template <class... Args> |
| 260 | iterator emplace_hint(const_iterator position, Args&&... args); |
| 261 | iterator insert(const value_type& v); |
| 262 | iterator insert(value_type&& v); |
| 263 | iterator insert(const_iterator position, const value_type& v); |
| 264 | iterator insert(const_iterator position, value_type&& v); |
| 265 | template <class InputIterator> |
| 266 | void insert(InputIterator first, InputIterator last); |
| 267 | void insert(initializer_list<value_type> il); |
| 268 | |
| 269 | iterator erase(const_iterator position); |
| 270 | size_type erase(const key_type& k); |
| 271 | iterator erase(const_iterator first, const_iterator last); |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 272 | void clear() noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 273 | |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 274 | void swap(multiset& s) |
| 275 | noexcept( |
| 276 | __is_nothrow_swappable<key_compare>::value && |
| 277 | (!allocator_type::propagate_on_container_swap::value || |
| 278 | __is_nothrow_swappable<allocator_type>::value)); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 279 | |
| 280 | // observers: |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 281 | allocator_type get_allocator() const noexcept; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 282 | key_compare key_comp() const; |
| 283 | value_compare value_comp() const; |
| 284 | |
| 285 | // set operations: |
| 286 | iterator find(const key_type& k); |
| 287 | const_iterator find(const key_type& k) const; |
| 288 | size_type count(const key_type& k) const; |
| 289 | iterator lower_bound(const key_type& k); |
| 290 | const_iterator lower_bound(const key_type& k) const; |
| 291 | iterator upper_bound(const key_type& k); |
| 292 | const_iterator upper_bound(const key_type& k) const; |
| 293 | pair<iterator,iterator> equal_range(const key_type& k); |
| 294 | pair<const_iterator,const_iterator> equal_range(const key_type& k) const; |
| 295 | }; |
| 296 | |
| 297 | template <class Key, class Compare, class Allocator> |
| 298 | bool |
| 299 | operator==(const multiset<Key, Compare, Allocator>& x, |
| 300 | const multiset<Key, Compare, Allocator>& y); |
| 301 | |
| 302 | template <class Key, class Compare, class Allocator> |
| 303 | bool |
| 304 | operator< (const multiset<Key, Compare, Allocator>& x, |
| 305 | const multiset<Key, Compare, Allocator>& y); |
| 306 | |
| 307 | template <class Key, class Compare, class Allocator> |
| 308 | bool |
| 309 | operator!=(const multiset<Key, Compare, Allocator>& x, |
| 310 | const multiset<Key, Compare, Allocator>& y); |
| 311 | |
| 312 | template <class Key, class Compare, class Allocator> |
| 313 | bool |
| 314 | operator> (const multiset<Key, Compare, Allocator>& x, |
| 315 | const multiset<Key, Compare, Allocator>& y); |
| 316 | |
| 317 | template <class Key, class Compare, class Allocator> |
| 318 | bool |
| 319 | operator>=(const multiset<Key, Compare, Allocator>& x, |
| 320 | const multiset<Key, Compare, Allocator>& y); |
| 321 | |
| 322 | template <class Key, class Compare, class Allocator> |
| 323 | bool |
| 324 | operator<=(const multiset<Key, Compare, Allocator>& x, |
| 325 | const multiset<Key, Compare, Allocator>& y); |
| 326 | |
| 327 | // specialized algorithms: |
| 328 | template <class Key, class Compare, class Allocator> |
| 329 | void |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 330 | swap(multiset<Key, Compare, Allocator>& x, multiset<Key, Compare, Allocator>& y) |
| 331 | noexcept(noexcept(x.swap(y))); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 332 | |
| 333 | } // std |
| 334 | |
| 335 | */ |
| 336 | |
| 337 | #include <__config> |
| 338 | #include <__tree> |
| 339 | #include <functional> |
| 340 | |
| 341 | #pragma GCC system_header |
| 342 | |
| 343 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 344 | |
| 345 | template <class _Key, class _Compare = less<_Key>, |
| 346 | class _Allocator = allocator<_Key> > |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 347 | class _LIBCPP_VISIBLE set |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 348 | { |
| 349 | public: |
| 350 | // types: |
| 351 | typedef _Key key_type; |
| 352 | typedef key_type value_type; |
| 353 | typedef _Compare key_compare; |
| 354 | typedef key_compare value_compare; |
| 355 | typedef _Allocator allocator_type; |
| 356 | typedef value_type& reference; |
| 357 | typedef const value_type& const_reference; |
| 358 | |
| 359 | private: |
| 360 | typedef __tree<value_type, value_compare, allocator_type> __base; |
| 361 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 362 | typedef typename __base::__node_holder __node_holder; |
| 363 | |
| 364 | __base __tree_; |
| 365 | |
| 366 | public: |
| 367 | typedef typename __base::pointer pointer; |
| 368 | typedef typename __base::const_pointer const_pointer; |
| 369 | typedef typename __base::size_type size_type; |
| 370 | typedef typename __base::difference_type difference_type; |
| 371 | typedef typename __base::const_iterator iterator; |
| 372 | typedef typename __base::const_iterator const_iterator; |
| 373 | typedef _STD::reverse_iterator<iterator> reverse_iterator; |
| 374 | typedef _STD::reverse_iterator<const_iterator> const_reverse_iterator; |
| 375 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 376 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 377 | explicit set(const value_compare& __comp = value_compare()) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 378 | _NOEXCEPT_( |
| 379 | is_nothrow_default_constructible<allocator_type>::value && |
| 380 | is_nothrow_default_constructible<key_compare>::value && |
| 381 | is_nothrow_copy_constructible<key_compare>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 382 | : __tree_(__comp) {} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 383 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 384 | set(const value_compare& __comp, const allocator_type& __a) |
| 385 | : __tree_(__comp, __a) {} |
| 386 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 387 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 388 | set(_InputIterator __f, _InputIterator __l, |
| 389 | const value_compare& __comp = value_compare()) |
| 390 | : __tree_(__comp) |
| 391 | { |
| 392 | insert(__f, __l); |
| 393 | } |
| 394 | |
| 395 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 396 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 397 | set(_InputIterator __f, _InputIterator __l, const value_compare& __comp, |
| 398 | const allocator_type& __a) |
| 399 | : __tree_(__comp, __a) |
| 400 | { |
| 401 | insert(__f, __l); |
| 402 | } |
| 403 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 404 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 405 | set(const set& __s) |
| 406 | : __tree_(__s.__tree_) |
| 407 | { |
| 408 | insert(__s.begin(), __s.end()); |
| 409 | } |
| 410 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 411 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 412 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 413 | set(set&& __s) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 414 | _NOEXCEPT_(is_nothrow_move_constructible<__base>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 415 | : __tree_(_STD::move(__s.__tree_)) {} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 416 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 417 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 418 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 419 | explicit set(const allocator_type& __a) |
| 420 | : __tree_(__a) {} |
| 421 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 422 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 423 | set(const set& __s, const allocator_type& __a) |
| 424 | : __tree_(__s.__tree_.value_comp(), __a) |
| 425 | { |
| 426 | insert(__s.begin(), __s.end()); |
| 427 | } |
| 428 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 429 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 430 | set(set&& __s, const allocator_type& __a); |
| 431 | #endif |
| 432 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 433 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 434 | set(initializer_list<value_type> __il, const value_compare& __comp = value_compare()) |
| 435 | : __tree_(__comp) |
| 436 | { |
| 437 | insert(__il.begin(), __il.end()); |
| 438 | } |
| 439 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 440 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 441 | set(initializer_list<value_type> __il, const value_compare& __comp, |
| 442 | const allocator_type& __a) |
| 443 | : __tree_(__comp, __a) |
| 444 | { |
| 445 | insert(__il.begin(), __il.end()); |
| 446 | } |
| 447 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 448 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 449 | set& operator=(initializer_list<value_type> __il) |
| 450 | { |
| 451 | __tree_.__assign_unique(__il.begin(), __il.end()); |
| 452 | return *this; |
| 453 | } |
| 454 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 455 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 456 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 457 | set& operator=(set&& __s) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 458 | _NOEXCEPT_(is_nothrow_move_assignable<__base>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 459 | { |
| 460 | __tree_ = _STD::move(__s.__tree_); |
| 461 | return *this; |
| 462 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 463 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 464 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 465 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 466 | iterator begin() _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 467 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 468 | const_iterator begin() const _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 469 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 470 | iterator end() _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 471 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 472 | const_iterator end() const _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 473 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 474 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 475 | reverse_iterator rbegin() _NOEXCEPT |
| 476 | {return reverse_iterator(end());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 477 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 478 | const_reverse_iterator rbegin() const _NOEXCEPT |
| 479 | {return const_reverse_iterator(end());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 480 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 481 | reverse_iterator rend() _NOEXCEPT |
| 482 | {return reverse_iterator(begin());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 483 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 484 | const_reverse_iterator rend() const _NOEXCEPT |
| 485 | {return const_reverse_iterator(begin());} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 486 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 487 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 488 | const_iterator cbegin() const _NOEXCEPT {return begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 489 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 490 | const_iterator cend() const _NOEXCEPT {return end();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 491 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 492 | const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 493 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 494 | const_reverse_iterator crend() const _NOEXCEPT {return rend();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 495 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 496 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 497 | bool empty() const _NOEXCEPT {return __tree_.size() == 0;} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 498 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 499 | size_type size() const _NOEXCEPT {return __tree_.size();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 500 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 501 | size_type max_size() const _NOEXCEPT {return __tree_.max_size();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 502 | |
| 503 | // modifiers: |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 504 | #if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 505 | template <class... _Args> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 506 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 507 | pair<iterator, bool> emplace(_Args&&... __args) |
| 508 | {return __tree_.__emplace_unique(_STD::forward<_Args>(__args)...);} |
| 509 | template <class... _Args> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 510 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 511 | iterator emplace_hint(const_iterator __p, _Args&&... __args) |
| 512 | {return __tree_.__emplace_hint_unique(__p, _STD::forward<_Args>(__args)...);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 513 | #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 514 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 515 | pair<iterator,bool> insert(const value_type& __v) |
| 516 | {return __tree_.__insert_unique(__v);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 517 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 518 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 519 | pair<iterator,bool> insert(value_type&& __v) |
| 520 | {return __tree_.__insert_unique(_STD::move(__v));} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 521 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 522 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 523 | iterator insert(const_iterator __p, const value_type& __v) |
| 524 | {return __tree_.__insert_unique(__p, __v);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 525 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 526 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 527 | iterator insert(const_iterator __p, value_type&& __v) |
| 528 | {return __tree_.__insert_unique(__p, _STD::move(__v));} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 529 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 530 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 531 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 532 | void insert(_InputIterator __f, _InputIterator __l) |
| 533 | { |
| 534 | for (const_iterator __e = cend(); __f != __l; ++__f) |
| 535 | __tree_.__insert_unique(__e, *__f); |
| 536 | } |
| 537 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 538 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 539 | void insert(initializer_list<value_type> __il) |
| 540 | {insert(__il.begin(), __il.end());} |
| 541 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 542 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 543 | iterator erase(const_iterator __p) {return __tree_.erase(__p);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 544 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 545 | size_type erase(const key_type& __k) |
| 546 | {return __tree_.__erase_unique(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 547 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 548 | iterator erase(const_iterator __f, const_iterator __l) |
| 549 | {return __tree_.erase(__f, __l);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 550 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 551 | void clear() _NOEXCEPT {__tree_.clear();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 552 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 553 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 554 | void swap(set& __s) _NOEXCEPT_(__is_nothrow_swappable<__base>::value) |
| 555 | {__tree_.swap(__s.__tree_);} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 556 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 557 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 558 | allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 559 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 560 | key_compare key_comp() const {return __tree_.value_comp();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 561 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 562 | value_compare value_comp() const {return __tree_.value_comp();} |
| 563 | |
| 564 | // set operations: |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 565 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 566 | iterator find(const key_type& __k) {return __tree_.find(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 567 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 568 | const_iterator find(const key_type& __k) const {return __tree_.find(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 569 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 570 | size_type count(const key_type& __k) const |
| 571 | {return __tree_.__count_unique(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 572 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 573 | iterator lower_bound(const key_type& __k) |
| 574 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 575 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 576 | const_iterator lower_bound(const key_type& __k) const |
| 577 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 578 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 579 | iterator upper_bound(const key_type& __k) |
| 580 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 581 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 582 | const_iterator upper_bound(const key_type& __k) const |
| 583 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 584 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 585 | pair<iterator,iterator> equal_range(const key_type& __k) |
| 586 | {return __tree_.__equal_range_unique(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 587 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 588 | pair<const_iterator,const_iterator> equal_range(const key_type& __k) const |
| 589 | {return __tree_.__equal_range_unique(__k);} |
| 590 | }; |
| 591 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 592 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 593 | |
| 594 | template <class _Key, class _Compare, class _Allocator> |
| 595 | set<_Key, _Compare, _Allocator>::set(set&& __s, const allocator_type& __a) |
| 596 | : __tree_(_STD::move(__s.__tree_), __a) |
| 597 | { |
| 598 | if (__a != __s.get_allocator()) |
| 599 | { |
| 600 | const_iterator __e = cend(); |
| 601 | while (!__s.empty()) |
| 602 | insert(__e, _STD::move(__s.__tree_.remove(__s.begin())->__value_)); |
| 603 | } |
| 604 | } |
| 605 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 606 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 607 | |
| 608 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 609 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 610 | bool |
| 611 | operator==(const set<_Key, _Compare, _Allocator>& __x, |
| 612 | const set<_Key, _Compare, _Allocator>& __y) |
| 613 | { |
| 614 | return __x.size() == __y.size() && _STD::equal(__x.begin(), __x.end(), __y.begin()); |
| 615 | } |
| 616 | |
| 617 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 618 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 619 | bool |
| 620 | operator< (const set<_Key, _Compare, _Allocator>& __x, |
| 621 | const set<_Key, _Compare, _Allocator>& __y) |
| 622 | { |
| 623 | return _STD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); |
| 624 | } |
| 625 | |
| 626 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 627 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 628 | bool |
| 629 | operator!=(const set<_Key, _Compare, _Allocator>& __x, |
| 630 | const set<_Key, _Compare, _Allocator>& __y) |
| 631 | { |
| 632 | return !(__x == __y); |
| 633 | } |
| 634 | |
| 635 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 636 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 637 | bool |
| 638 | operator> (const set<_Key, _Compare, _Allocator>& __x, |
| 639 | const set<_Key, _Compare, _Allocator>& __y) |
| 640 | { |
| 641 | return __y < __x; |
| 642 | } |
| 643 | |
| 644 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 645 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 646 | bool |
| 647 | operator>=(const set<_Key, _Compare, _Allocator>& __x, |
| 648 | const set<_Key, _Compare, _Allocator>& __y) |
| 649 | { |
| 650 | return !(__x < __y); |
| 651 | } |
| 652 | |
| 653 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 654 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 655 | bool |
| 656 | operator<=(const set<_Key, _Compare, _Allocator>& __x, |
| 657 | const set<_Key, _Compare, _Allocator>& __y) |
| 658 | { |
| 659 | return !(__y < __x); |
| 660 | } |
| 661 | |
| 662 | // specialized algorithms: |
| 663 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 664 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 665 | void |
| 666 | swap(set<_Key, _Compare, _Allocator>& __x, |
| 667 | set<_Key, _Compare, _Allocator>& __y) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 668 | _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 669 | { |
| 670 | __x.swap(__y); |
| 671 | } |
| 672 | |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 673 | template <class _Key, class _Compare = less<_Key>, |
| 674 | class _Allocator = allocator<_Key> > |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 675 | class _LIBCPP_VISIBLE multiset |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 676 | { |
| 677 | public: |
| 678 | // types: |
| 679 | typedef _Key key_type; |
| 680 | typedef key_type value_type; |
| 681 | typedef _Compare key_compare; |
| 682 | typedef key_compare value_compare; |
| 683 | typedef _Allocator allocator_type; |
| 684 | typedef value_type& reference; |
| 685 | typedef const value_type& const_reference; |
| 686 | |
| 687 | private: |
| 688 | typedef __tree<value_type, value_compare, allocator_type> __base; |
| 689 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 690 | typedef typename __base::__node_holder __node_holder; |
| 691 | |
| 692 | __base __tree_; |
| 693 | |
| 694 | public: |
| 695 | typedef typename __base::pointer pointer; |
| 696 | typedef typename __base::const_pointer const_pointer; |
| 697 | typedef typename __base::size_type size_type; |
| 698 | typedef typename __base::difference_type difference_type; |
| 699 | typedef typename __base::const_iterator iterator; |
| 700 | typedef typename __base::const_iterator const_iterator; |
| 701 | typedef _STD::reverse_iterator<iterator> reverse_iterator; |
| 702 | typedef _STD::reverse_iterator<const_iterator> const_reverse_iterator; |
| 703 | |
| 704 | // construct/copy/destroy: |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 705 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 706 | explicit multiset(const value_compare& __comp = value_compare()) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 707 | _NOEXCEPT_( |
| 708 | is_nothrow_default_constructible<allocator_type>::value && |
| 709 | is_nothrow_default_constructible<key_compare>::value && |
| 710 | is_nothrow_copy_constructible<key_compare>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 711 | : __tree_(__comp) {} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 712 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 713 | multiset(const value_compare& __comp, const allocator_type& __a) |
| 714 | : __tree_(__comp, __a) {} |
| 715 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 716 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 717 | multiset(_InputIterator __f, _InputIterator __l, |
| 718 | const value_compare& __comp = value_compare()) |
| 719 | : __tree_(__comp) |
| 720 | { |
| 721 | insert(__f, __l); |
| 722 | } |
| 723 | |
| 724 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 725 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 726 | multiset(_InputIterator __f, _InputIterator __l, |
| 727 | const value_compare& __comp, const allocator_type& __a) |
| 728 | : __tree_(__comp, __a) |
| 729 | { |
| 730 | insert(__f, __l); |
| 731 | } |
| 732 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 733 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 734 | multiset(const multiset& __s) |
| 735 | : __tree_(__s.__tree_.value_comp(), |
| 736 | __alloc_traits::select_on_container_copy_construction(__s.__tree_.__alloc())) |
| 737 | { |
| 738 | insert(__s.begin(), __s.end()); |
| 739 | } |
| 740 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 741 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 742 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 743 | multiset(multiset&& __s) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 744 | _NOEXCEPT_(is_nothrow_move_constructible<__base>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 745 | : __tree_(_STD::move(__s.__tree_)) {} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 746 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 747 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 748 | explicit multiset(const allocator_type& __a) |
| 749 | : __tree_(__a) {} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 750 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 751 | multiset(const multiset& __s, const allocator_type& __a) |
| 752 | : __tree_(__s.__tree_.value_comp(), __a) |
| 753 | { |
| 754 | insert(__s.begin(), __s.end()); |
| 755 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 756 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 757 | multiset(multiset&& __s, const allocator_type& __a); |
| 758 | #endif |
| 759 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 760 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 761 | multiset(initializer_list<value_type> __il, const value_compare& __comp = value_compare()) |
| 762 | : __tree_(__comp) |
| 763 | { |
| 764 | insert(__il.begin(), __il.end()); |
| 765 | } |
| 766 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 767 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 768 | multiset(initializer_list<value_type> __il, const value_compare& __comp, |
| 769 | const allocator_type& __a) |
| 770 | : __tree_(__comp, __a) |
| 771 | { |
| 772 | insert(__il.begin(), __il.end()); |
| 773 | } |
| 774 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 775 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 776 | multiset& operator=(initializer_list<value_type> __il) |
| 777 | { |
| 778 | __tree_.__assign_multi(__il.begin(), __il.end()); |
| 779 | return *this; |
| 780 | } |
| 781 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 782 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 783 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 784 | multiset& operator=(multiset&& __s) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 785 | _NOEXCEPT_(is_nothrow_move_assignable<__base>::value) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 786 | { |
| 787 | __tree_ = _STD::move(__s.__tree_); |
| 788 | return *this; |
| 789 | } |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 790 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 791 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 792 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 793 | iterator begin() _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 794 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 795 | const_iterator begin() const _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 796 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 797 | iterator end() _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 798 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 799 | const_iterator end() const _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 800 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 801 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 802 | reverse_iterator rbegin() _NOEXCEPT |
| 803 | {return reverse_iterator(end());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 804 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 805 | const_reverse_iterator rbegin() const _NOEXCEPT |
| 806 | {return const_reverse_iterator(end());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 807 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 808 | reverse_iterator rend() _NOEXCEPT |
| 809 | {return reverse_iterator(begin());} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 810 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 811 | const_reverse_iterator rend() const _NOEXCEPT |
| 812 | {return const_reverse_iterator(begin());} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 813 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 814 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 815 | const_iterator cbegin() const _NOEXCEPT {return begin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 816 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 817 | const_iterator cend() const _NOEXCEPT {return end();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 818 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 819 | const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 820 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 821 | const_reverse_iterator crend() const _NOEXCEPT {return rend();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 822 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 823 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 824 | bool empty() const _NOEXCEPT {return __tree_.size() == 0;} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 825 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 826 | size_type size() const _NOEXCEPT {return __tree_.size();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 827 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 828 | size_type max_size() const _NOEXCEPT {return __tree_.max_size();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 829 | |
| 830 | // modifiers: |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 831 | #if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 832 | template <class... _Args> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 833 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 834 | iterator emplace(_Args&&... __args) |
| 835 | {return __tree_.__emplace_multi(_STD::forward<_Args>(__args)...);} |
| 836 | template <class... _Args> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 837 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 838 | iterator emplace_hint(const_iterator __p, _Args&&... __args) |
| 839 | {return __tree_.__emplace_hint_multi(__p, _STD::forward<_Args>(__args)...);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 840 | #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 841 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 842 | iterator insert(const value_type& __v) |
| 843 | {return __tree_.__insert_multi(__v);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 844 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 845 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 846 | iterator insert(value_type&& __v) |
| 847 | {return __tree_.__insert_multi(_STD::move(__v));} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 848 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 849 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 850 | iterator insert(const_iterator __p, const value_type& __v) |
| 851 | {return __tree_.__insert_multi(__p, __v);} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 852 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 853 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 854 | iterator insert(const_iterator __p, value_type&& __v) |
| 855 | {return __tree_.__insert_multi(_STD::move(__v));} |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 856 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 857 | template <class _InputIterator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 858 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 859 | void insert(_InputIterator __f, _InputIterator __l) |
| 860 | { |
| 861 | for (const_iterator __e = cend(); __f != __l; ++__f) |
| 862 | __tree_.__insert_multi(__e, *__f); |
| 863 | } |
| 864 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 865 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 866 | void insert(initializer_list<value_type> __il) |
| 867 | {insert(__il.begin(), __il.end());} |
| 868 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 869 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 870 | iterator erase(const_iterator __p) {return __tree_.erase(__p);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 871 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 872 | size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 873 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 874 | iterator erase(const_iterator __f, const_iterator __l) |
| 875 | {return __tree_.erase(__f, __l);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 876 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 877 | void clear() _NOEXCEPT {__tree_.clear();} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 878 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 879 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 880 | void swap(multiset& __s) |
| 881 | _NOEXCEPT_(__is_nothrow_swappable<__base>::value) |
| 882 | {__tree_.swap(__s.__tree_);} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 883 | |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 884 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 885 | allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 886 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 887 | key_compare key_comp() const {return __tree_.value_comp();} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 888 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 889 | value_compare value_comp() const {return __tree_.value_comp();} |
| 890 | |
| 891 | // set operations: |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 892 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 893 | iterator find(const key_type& __k) {return __tree_.find(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 894 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 895 | const_iterator find(const key_type& __k) const {return __tree_.find(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 896 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 897 | size_type count(const key_type& __k) const |
| 898 | {return __tree_.__count_multi(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 899 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 900 | iterator lower_bound(const key_type& __k) |
| 901 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 902 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 903 | const_iterator lower_bound(const key_type& __k) const |
| 904 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 905 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 906 | iterator upper_bound(const key_type& __k) |
| 907 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 908 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 909 | const_iterator upper_bound(const key_type& __k) const |
| 910 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 911 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 912 | pair<iterator,iterator> equal_range(const key_type& __k) |
| 913 | {return __tree_.__equal_range_multi(__k);} |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 914 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 915 | pair<const_iterator,const_iterator> equal_range(const key_type& __k) const |
| 916 | {return __tree_.__equal_range_multi(__k);} |
| 917 | }; |
| 918 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 919 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 920 | |
| 921 | template <class _Key, class _Compare, class _Allocator> |
| 922 | multiset<_Key, _Compare, _Allocator>::multiset(multiset&& __s, const allocator_type& __a) |
| 923 | : __tree_(_STD::move(__s.__tree_), __a) |
| 924 | { |
| 925 | if (__a != __s.get_allocator()) |
| 926 | { |
| 927 | const_iterator __e = cend(); |
| 928 | while (!__s.empty()) |
| 929 | insert(__e, _STD::move(__s.__tree_.remove(__s.begin())->__value_)); |
| 930 | } |
| 931 | } |
| 932 | |
Howard Hinnant | 73d21a4 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 933 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 934 | |
| 935 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 936 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 937 | bool |
| 938 | operator==(const multiset<_Key, _Compare, _Allocator>& __x, |
| 939 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 940 | { |
| 941 | return __x.size() == __y.size() && _STD::equal(__x.begin(), __x.end(), __y.begin()); |
| 942 | } |
| 943 | |
| 944 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 945 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 946 | bool |
| 947 | operator< (const multiset<_Key, _Compare, _Allocator>& __x, |
| 948 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 949 | { |
| 950 | return _STD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); |
| 951 | } |
| 952 | |
| 953 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 954 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 955 | bool |
| 956 | operator!=(const multiset<_Key, _Compare, _Allocator>& __x, |
| 957 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 958 | { |
| 959 | return !(__x == __y); |
| 960 | } |
| 961 | |
| 962 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 963 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 964 | bool |
| 965 | operator> (const multiset<_Key, _Compare, _Allocator>& __x, |
| 966 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 967 | { |
| 968 | return __y < __x; |
| 969 | } |
| 970 | |
| 971 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 972 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 973 | bool |
| 974 | operator>=(const multiset<_Key, _Compare, _Allocator>& __x, |
| 975 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 976 | { |
| 977 | return !(__x < __y); |
| 978 | } |
| 979 | |
| 980 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 981 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 982 | bool |
| 983 | operator<=(const multiset<_Key, _Compare, _Allocator>& __x, |
| 984 | const multiset<_Key, _Compare, _Allocator>& __y) |
| 985 | { |
| 986 | return !(__y < __x); |
| 987 | } |
| 988 | |
| 989 | template <class _Key, class _Compare, class _Allocator> |
Howard Hinnant | 28c97e6 | 2010-09-23 16:27:36 +0000 | [diff] [blame] | 990 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 991 | void |
| 992 | swap(multiset<_Key, _Compare, _Allocator>& __x, |
| 993 | multiset<_Key, _Compare, _Allocator>& __y) |
Howard Hinnant | b2e2a8f | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 994 | _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 995 | { |
| 996 | __x.swap(__y); |
| 997 | } |
| 998 | |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 999 | _LIBCPP_END_NAMESPACE_STD |
| 1000 | |
| 1001 | #endif // _LIBCPP_SET |