Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | // -*- C++ -*- |
| 2 | //===----------------------------- map ------------------------------------===// |
| 3 | // |
Howard Hinnant | c566dc3 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 4 | // The LLVM Compiler Infrastructure |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 5 | // |
Howard Hinnant | ee11c31 | 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 | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 8 | // |
| 9 | //===----------------------------------------------------------------------===// |
| 10 | |
| 11 | #ifndef _LIBCPP_MAP |
| 12 | #define _LIBCPP_MAP |
| 13 | |
| 14 | /* |
| 15 | |
| 16 | map synopsis |
| 17 | |
| 18 | namespace std |
| 19 | { |
| 20 | |
| 21 | template <class Key, class T, class Compare = less<Key>, |
| 22 | class Allocator = allocator<pair<const Key, T>>> |
| 23 | class map |
| 24 | { |
| 25 | public: |
| 26 | // types: |
| 27 | typedef Key key_type; |
| 28 | typedef T mapped_type; |
| 29 | typedef pair<const key_type, mapped_type> value_type; |
| 30 | typedef Compare key_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::pointer pointer; |
| 35 | typedef typename allocator_type::const_pointer const_pointer; |
| 36 | typedef typename allocator_type::size_type size_type; |
| 37 | typedef typename allocator_type::difference_type difference_type; |
| 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 | class value_compare |
| 45 | : public binary_function<value_type, value_type, bool> |
| 46 | { |
| 47 | friend class map; |
| 48 | protected: |
| 49 | key_compare comp; |
| 50 | |
| 51 | value_compare(key_compare c); |
| 52 | public: |
| 53 | bool operator()(const value_type& x, const value_type& y) const; |
| 54 | }; |
| 55 | |
| 56 | // construct/copy/destroy: |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 57 | map() |
| 58 | noexcept( |
| 59 | is_nothrow_default_constructible<allocator_type>::value && |
| 60 | is_nothrow_default_constructible<key_compare>::value && |
| 61 | is_nothrow_copy_constructible<key_compare>::value); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 62 | explicit map(const key_compare& comp); |
| 63 | map(const key_compare& comp, const allocator_type& a); |
| 64 | template <class InputIterator> |
| 65 | map(InputIterator first, InputIterator last, |
| 66 | const key_compare& comp = key_compare()); |
| 67 | template <class InputIterator> |
| 68 | map(InputIterator first, InputIterator last, |
| 69 | const key_compare& comp, const allocator_type& a); |
| 70 | map(const map& m); |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 71 | map(map&& m) |
| 72 | noexcept( |
| 73 | is_nothrow_move_constructible<allocator_type>::value && |
| 74 | is_nothrow_move_constructible<key_compare>::value); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 75 | explicit map(const allocator_type& a); |
| 76 | map(const map& m, const allocator_type& a); |
| 77 | map(map&& m, const allocator_type& a); |
| 78 | map(initializer_list<value_type> il, const key_compare& comp = key_compare()); |
| 79 | map(initializer_list<value_type> il, const key_compare& comp, const allocator_type& a); |
| 80 | ~map(); |
| 81 | |
| 82 | map& operator=(const map& m); |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 83 | map& operator=(map&& m) |
| 84 | noexcept( |
| 85 | allocator_type::propagate_on_container_move_assignment::value && |
| 86 | is_nothrow_move_assignable<allocator_type>::value && |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 87 | is_nothrow_move_assignable<key_compare>::value); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 88 | map& operator=(initializer_list<value_type> il); |
| 89 | |
| 90 | // iterators: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 91 | iterator begin() noexcept; |
| 92 | const_iterator begin() const noexcept; |
| 93 | iterator end() noexcept; |
| 94 | const_iterator end() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 95 | |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 96 | reverse_iterator rbegin() noexcept; |
| 97 | const_reverse_iterator rbegin() const noexcept; |
| 98 | reverse_iterator rend() noexcept; |
| 99 | const_reverse_iterator rend() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 100 | |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 101 | const_iterator cbegin() const noexcept; |
| 102 | const_iterator cend() const noexcept; |
| 103 | const_reverse_iterator crbegin() const noexcept; |
| 104 | const_reverse_iterator crend() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 105 | |
| 106 | // capacity: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 107 | bool empty() const noexcept; |
| 108 | size_type size() const noexcept; |
| 109 | size_type max_size() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 110 | |
| 111 | // element access: |
| 112 | mapped_type& operator[](const key_type& k); |
| 113 | mapped_type& operator[](key_type&& k); |
| 114 | |
| 115 | mapped_type& at(const key_type& k); |
| 116 | const mapped_type& at(const key_type& k) const; |
| 117 | |
| 118 | // modifiers: |
| 119 | template <class... Args> |
| 120 | pair<iterator, bool> emplace(Args&&... args); |
| 121 | template <class... Args> |
| 122 | iterator emplace_hint(const_iterator position, Args&&... args); |
| 123 | pair<iterator, bool> insert(const value_type& v); |
| 124 | template <class P> |
| 125 | pair<iterator, bool> insert(P&& p); |
| 126 | iterator insert(const_iterator position, const value_type& v); |
| 127 | template <class P> |
| 128 | iterator insert(const_iterator position, P&& p); |
| 129 | template <class InputIterator> |
| 130 | void insert(InputIterator first, InputIterator last); |
| 131 | void insert(initializer_list<value_type> il); |
| 132 | |
| 133 | iterator erase(const_iterator position); |
| 134 | size_type erase(const key_type& k); |
| 135 | iterator erase(const_iterator first, const_iterator last); |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 136 | void clear() noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 137 | |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 138 | void swap(map& m) |
| 139 | noexcept( |
| 140 | __is_nothrow_swappable<key_compare>::value && |
| 141 | (!allocator_type::propagate_on_container_swap::value || |
| 142 | __is_nothrow_swappable<allocator_type>::value)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 143 | |
| 144 | // observers: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 145 | allocator_type get_allocator() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 146 | key_compare key_comp() const; |
| 147 | value_compare value_comp() const; |
| 148 | |
| 149 | // map operations: |
| 150 | iterator find(const key_type& k); |
| 151 | const_iterator find(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 152 | template<typename K> |
| 153 | iterator find(const K& x); // C++14 |
| 154 | template<typename K> |
| 155 | const_iterator find(const K& x) const; // C++14 |
| 156 | template<typename K> |
| 157 | size_type count(const K& x) const; |
| 158 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 159 | size_type count(const key_type& k) const; |
| 160 | iterator lower_bound(const key_type& k); |
| 161 | const_iterator lower_bound(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 162 | template<typename K> |
| 163 | iterator lower_bound(const K& x); // C++14 |
| 164 | template<typename K> |
| 165 | const_iterator lower_bound(const K& x) const; // C++14 |
| 166 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 167 | iterator upper_bound(const key_type& k); |
| 168 | const_iterator upper_bound(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 169 | template<typename K> |
| 170 | iterator upper_bound(const K& x); // C++14 |
| 171 | template<typename K> |
| 172 | const_iterator upper_bound(const K& x) const; // C++14 |
| 173 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 174 | pair<iterator,iterator> equal_range(const key_type& k); |
| 175 | pair<const_iterator,const_iterator> equal_range(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 176 | template<typename K> |
| 177 | pair<iterator,iterator> equal_range(const K& x); // C++14 |
| 178 | template<typename K> |
| 179 | pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14 |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 180 | }; |
| 181 | |
| 182 | template <class Key, class T, class Compare, class Allocator> |
| 183 | bool |
| 184 | operator==(const map<Key, T, Compare, Allocator>& x, |
| 185 | const map<Key, T, Compare, Allocator>& y); |
| 186 | |
| 187 | template <class Key, class T, class Compare, class Allocator> |
| 188 | bool |
| 189 | operator< (const map<Key, T, Compare, Allocator>& x, |
| 190 | const map<Key, T, Compare, Allocator>& y); |
| 191 | |
| 192 | template <class Key, class T, class Compare, class Allocator> |
| 193 | bool |
| 194 | operator!=(const map<Key, T, Compare, Allocator>& x, |
| 195 | const map<Key, T, Compare, Allocator>& y); |
| 196 | |
| 197 | template <class Key, class T, class Compare, class Allocator> |
| 198 | bool |
| 199 | operator> (const map<Key, T, Compare, Allocator>& x, |
| 200 | const map<Key, T, Compare, Allocator>& y); |
| 201 | |
| 202 | template <class Key, class T, class Compare, class Allocator> |
| 203 | bool |
| 204 | operator>=(const map<Key, T, Compare, Allocator>& x, |
| 205 | const map<Key, T, Compare, Allocator>& y); |
| 206 | |
| 207 | template <class Key, class T, class Compare, class Allocator> |
| 208 | bool |
| 209 | operator<=(const map<Key, T, Compare, Allocator>& x, |
| 210 | const map<Key, T, Compare, Allocator>& y); |
| 211 | |
| 212 | // specialized algorithms: |
| 213 | template <class Key, class T, class Compare, class Allocator> |
| 214 | void |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 215 | swap(map<Key, T, Compare, Allocator>& x, map<Key, T, Compare, Allocator>& y) |
| 216 | noexcept(noexcept(x.swap(y))); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 217 | |
| 218 | template <class Key, class T, class Compare = less<Key>, |
| 219 | class Allocator = allocator<pair<const Key, T>>> |
| 220 | class multimap |
| 221 | { |
| 222 | public: |
| 223 | // types: |
| 224 | typedef Key key_type; |
| 225 | typedef T mapped_type; |
| 226 | typedef pair<const key_type,mapped_type> value_type; |
| 227 | typedef Compare key_compare; |
| 228 | typedef Allocator allocator_type; |
| 229 | typedef typename allocator_type::reference reference; |
| 230 | typedef typename allocator_type::const_reference const_reference; |
| 231 | typedef typename allocator_type::size_type size_type; |
| 232 | typedef typename allocator_type::difference_type difference_type; |
| 233 | typedef typename allocator_type::pointer pointer; |
| 234 | typedef typename allocator_type::const_pointer const_pointer; |
| 235 | |
| 236 | typedef implementation-defined iterator; |
| 237 | typedef implementation-defined const_iterator; |
| 238 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 239 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
| 240 | |
| 241 | class value_compare |
| 242 | : public binary_function<value_type,value_type,bool> |
| 243 | { |
| 244 | friend class multimap; |
| 245 | protected: |
| 246 | key_compare comp; |
| 247 | value_compare(key_compare c); |
| 248 | public: |
| 249 | bool operator()(const value_type& x, const value_type& y) const; |
| 250 | }; |
| 251 | |
| 252 | // construct/copy/destroy: |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 253 | multimap() |
| 254 | noexcept( |
| 255 | is_nothrow_default_constructible<allocator_type>::value && |
| 256 | is_nothrow_default_constructible<key_compare>::value && |
| 257 | is_nothrow_copy_constructible<key_compare>::value); |
| 258 | explicit multimap(const key_compare& comp); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 259 | multimap(const key_compare& comp, const allocator_type& a); |
| 260 | template <class InputIterator> |
| 261 | multimap(InputIterator first, InputIterator last, const key_compare& comp); |
| 262 | template <class InputIterator> |
| 263 | multimap(InputIterator first, InputIterator last, const key_compare& comp, |
| 264 | const allocator_type& a); |
| 265 | multimap(const multimap& m); |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 266 | multimap(multimap&& m) |
| 267 | noexcept( |
| 268 | is_nothrow_move_constructible<allocator_type>::value && |
| 269 | is_nothrow_move_constructible<key_compare>::value); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 270 | explicit multimap(const allocator_type& a); |
| 271 | multimap(const multimap& m, const allocator_type& a); |
| 272 | multimap(multimap&& m, const allocator_type& a); |
| 273 | multimap(initializer_list<value_type> il, const key_compare& comp = key_compare()); |
| 274 | multimap(initializer_list<value_type> il, const key_compare& comp, |
| 275 | const allocator_type& a); |
| 276 | ~multimap(); |
| 277 | |
| 278 | multimap& operator=(const multimap& m); |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 279 | multimap& operator=(multimap&& m) |
| 280 | noexcept( |
| 281 | allocator_type::propagate_on_container_move_assignment::value && |
| 282 | is_nothrow_move_assignable<allocator_type>::value && |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 283 | is_nothrow_move_assignable<key_compare>::value); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 284 | multimap& operator=(initializer_list<value_type> il); |
| 285 | |
| 286 | // iterators: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 287 | iterator begin() noexcept; |
| 288 | const_iterator begin() const noexcept; |
| 289 | iterator end() noexcept; |
| 290 | const_iterator end() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 291 | |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 292 | reverse_iterator rbegin() noexcept; |
| 293 | const_reverse_iterator rbegin() const noexcept; |
| 294 | reverse_iterator rend() noexcept; |
| 295 | const_reverse_iterator rend() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 296 | |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 297 | const_iterator cbegin() const noexcept; |
| 298 | const_iterator cend() const noexcept; |
| 299 | const_reverse_iterator crbegin() const noexcept; |
| 300 | const_reverse_iterator crend() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 301 | |
| 302 | // capacity: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 303 | bool empty() const noexcept; |
| 304 | size_type size() const noexcept; |
| 305 | size_type max_size() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 306 | |
| 307 | // modifiers: |
| 308 | template <class... Args> |
| 309 | iterator emplace(Args&&... args); |
| 310 | template <class... Args> |
| 311 | iterator emplace_hint(const_iterator position, Args&&... args); |
| 312 | iterator insert(const value_type& v); |
| 313 | template <class P> |
| 314 | iterator insert(P&& p); |
| 315 | iterator insert(const_iterator position, const value_type& v); |
| 316 | template <class P> |
| 317 | iterator insert(const_iterator position, P&& p); |
| 318 | template <class InputIterator> |
| 319 | void insert(InputIterator first, InputIterator last); |
| 320 | void insert(initializer_list<value_type> il); |
| 321 | |
| 322 | iterator erase(const_iterator position); |
| 323 | size_type erase(const key_type& k); |
| 324 | iterator erase(const_iterator first, const_iterator last); |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 325 | void clear() noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 326 | |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 327 | void swap(multimap& m) |
| 328 | noexcept( |
| 329 | __is_nothrow_swappable<key_compare>::value && |
| 330 | (!allocator_type::propagate_on_container_swap::value || |
| 331 | __is_nothrow_swappable<allocator_type>::value)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 332 | |
| 333 | // observers: |
Howard Hinnant | f95f4f5 | 2011-06-04 15:22:34 +0000 | [diff] [blame] | 334 | allocator_type get_allocator() const noexcept; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 335 | key_compare key_comp() const; |
| 336 | value_compare value_comp() const; |
| 337 | |
| 338 | // map operations: |
| 339 | iterator find(const key_type& k); |
| 340 | const_iterator find(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 341 | template<typename K> |
| 342 | iterator find(const K& x); // C++14 |
| 343 | template<typename K> |
| 344 | const_iterator find(const K& x) const; // C++14 |
| 345 | template<typename K> |
| 346 | size_type count(const K& x) const; |
| 347 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 348 | size_type count(const key_type& k) const; |
| 349 | iterator lower_bound(const key_type& k); |
| 350 | const_iterator lower_bound(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 351 | template<typename K> |
| 352 | iterator lower_bound(const K& x); // C++14 |
| 353 | template<typename K> |
| 354 | const_iterator lower_bound(const K& x) const; // C++14 |
| 355 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 356 | iterator upper_bound(const key_type& k); |
| 357 | const_iterator upper_bound(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 358 | template<typename K> |
| 359 | iterator upper_bound(const K& x); // C++14 |
| 360 | template<typename K> |
| 361 | const_iterator upper_bound(const K& x) const; // C++14 |
| 362 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 363 | pair<iterator,iterator> equal_range(const key_type& k); |
| 364 | pair<const_iterator,const_iterator> equal_range(const key_type& k) const; |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 365 | template<typename K> |
| 366 | pair<iterator,iterator> equal_range(const K& x); // C++14 |
| 367 | template<typename K> |
| 368 | pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14 |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 369 | }; |
| 370 | |
| 371 | template <class Key, class T, class Compare, class Allocator> |
| 372 | bool |
| 373 | operator==(const multimap<Key, T, Compare, Allocator>& x, |
| 374 | const multimap<Key, T, Compare, Allocator>& y); |
| 375 | |
| 376 | template <class Key, class T, class Compare, class Allocator> |
| 377 | bool |
| 378 | operator< (const multimap<Key, T, Compare, Allocator>& x, |
| 379 | const multimap<Key, T, Compare, Allocator>& y); |
| 380 | |
| 381 | template <class Key, class T, class Compare, class Allocator> |
| 382 | bool |
| 383 | operator!=(const multimap<Key, T, Compare, Allocator>& x, |
| 384 | const multimap<Key, T, Compare, Allocator>& y); |
| 385 | |
| 386 | template <class Key, class T, class Compare, class Allocator> |
| 387 | bool |
| 388 | operator> (const multimap<Key, T, Compare, Allocator>& x, |
| 389 | const multimap<Key, T, Compare, Allocator>& y); |
| 390 | |
| 391 | template <class Key, class T, class Compare, class Allocator> |
| 392 | bool |
| 393 | operator>=(const multimap<Key, T, Compare, Allocator>& x, |
| 394 | const multimap<Key, T, Compare, Allocator>& y); |
| 395 | |
| 396 | template <class Key, class T, class Compare, class Allocator> |
| 397 | bool |
| 398 | operator<=(const multimap<Key, T, Compare, Allocator>& x, |
| 399 | const multimap<Key, T, Compare, Allocator>& y); |
| 400 | |
| 401 | // specialized algorithms: |
| 402 | template <class Key, class T, class Compare, class Allocator> |
| 403 | void |
| 404 | swap(multimap<Key, T, Compare, Allocator>& x, |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 405 | multimap<Key, T, Compare, Allocator>& y) |
| 406 | noexcept(noexcept(x.swap(y))); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 407 | |
| 408 | } // std |
| 409 | |
| 410 | */ |
| 411 | |
| 412 | #include <__config> |
| 413 | #include <__tree> |
| 414 | #include <iterator> |
| 415 | #include <memory> |
| 416 | #include <utility> |
| 417 | #include <functional> |
| 418 | #include <initializer_list> |
| 419 | |
Howard Hinnant | aaaa52b | 2011-10-17 20:05:10 +0000 | [diff] [blame] | 420 | #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 421 | #pragma GCC system_header |
Howard Hinnant | aaaa52b | 2011-10-17 20:05:10 +0000 | [diff] [blame] | 422 | #endif |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 423 | |
| 424 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 425 | |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 426 | template <class _Key, class _CP, class _Compare, bool = is_empty<_Compare>::value |
Howard Hinnant | d0aabf8 | 2011-12-11 20:31:33 +0000 | [diff] [blame] | 427 | #if __has_feature(is_final) |
| 428 | && !__is_final(_Compare) |
| 429 | #endif |
| 430 | > |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 431 | class __map_value_compare |
| 432 | : private _Compare |
| 433 | { |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 434 | public: |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 435 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 436 | __map_value_compare() |
| 437 | _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value) |
| 438 | : _Compare() {} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 439 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 440 | __map_value_compare(_Compare c) |
| 441 | _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value) |
| 442 | : _Compare(c) {} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 443 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 444 | const _Compare& key_comp() const _NOEXCEPT {return *this;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 445 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 446 | bool operator()(const _CP& __x, const _CP& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 447 | {return static_cast<const _Compare&>(*this)(__x.__cc.first, __y.__cc.first);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 448 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 449 | bool operator()(const _CP& __x, const _Key& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 450 | {return static_cast<const _Compare&>(*this)(__x.__cc.first, __y);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 451 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 452 | bool operator()(const _Key& __x, const _CP& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 453 | {return static_cast<const _Compare&>(*this)(__x, __y.__cc.first);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 454 | |
| 455 | #if _LIBCPP_STD_VER > 11 |
| 456 | template <typename _K2> |
| 457 | _LIBCPP_INLINE_VISIBILITY |
| 458 | typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type |
| 459 | operator () ( const _K2& __x, const _CP& __y ) const |
| 460 | {return static_cast<const _Compare&>(*this) (__x, __y.__cc.first);} |
| 461 | |
| 462 | template <typename _K2> |
| 463 | _LIBCPP_INLINE_VISIBILITY |
| 464 | typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type |
| 465 | operator () (const _CP& __x, const _K2& __y) const |
| 466 | {return static_cast<const _Compare&>(*this) (__x.__cc.first, __y);} |
| 467 | #endif |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 468 | }; |
| 469 | |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 470 | template <class _Key, class _CP, class _Compare> |
| 471 | class __map_value_compare<_Key, _CP, _Compare, false> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 472 | { |
| 473 | _Compare comp; |
| 474 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 475 | public: |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 476 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 477 | __map_value_compare() |
| 478 | _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value) |
| 479 | : comp() {} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 480 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 481 | __map_value_compare(_Compare c) |
| 482 | _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value) |
| 483 | : comp(c) {} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 484 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 485 | const _Compare& key_comp() const _NOEXCEPT {return comp;} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 486 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 487 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 488 | bool operator()(const _CP& __x, const _CP& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 489 | {return comp(__x.__cc.first, __y.__cc.first);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 490 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 491 | bool operator()(const _CP& __x, const _Key& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 492 | {return comp(__x.__cc.first, __y);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 493 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 494 | bool operator()(const _Key& __x, const _CP& __y) const |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 495 | {return comp(__x, __y.__cc.first);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 496 | |
| 497 | #if _LIBCPP_STD_VER > 11 |
| 498 | template <typename _K2> |
| 499 | _LIBCPP_INLINE_VISIBILITY |
| 500 | typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type |
| 501 | operator () ( const _K2& __x, const _CP& __y ) const |
| 502 | {return comp (__x, __y.__cc.first);} |
| 503 | |
| 504 | template <typename _K2> |
| 505 | _LIBCPP_INLINE_VISIBILITY |
| 506 | typename enable_if<__is_transparent<_Compare, _K2>::value, bool>::type |
| 507 | operator () (const _CP& __x, const _K2& __y) const |
| 508 | {return comp (__x.__cc.first, __y);} |
| 509 | #endif |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 510 | }; |
| 511 | |
| 512 | template <class _Allocator> |
| 513 | class __map_node_destructor |
| 514 | { |
| 515 | typedef _Allocator allocator_type; |
| 516 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 517 | typedef typename __alloc_traits::value_type::value_type value_type; |
| 518 | public: |
| 519 | typedef typename __alloc_traits::pointer pointer; |
| 520 | private: |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 521 | typedef typename value_type::value_type::first_type first_type; |
| 522 | typedef typename value_type::value_type::second_type second_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 523 | |
| 524 | allocator_type& __na_; |
| 525 | |
| 526 | __map_node_destructor& operator=(const __map_node_destructor&); |
| 527 | |
| 528 | public: |
| 529 | bool __first_constructed; |
| 530 | bool __second_constructed; |
| 531 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 532 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 533 | explicit __map_node_destructor(allocator_type& __na) _NOEXCEPT |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 534 | : __na_(__na), |
| 535 | __first_constructed(false), |
| 536 | __second_constructed(false) |
| 537 | {} |
| 538 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 539 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 540 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 541 | __map_node_destructor(__tree_node_destructor<allocator_type>&& __x) _NOEXCEPT |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 542 | : __na_(__x.__na_), |
| 543 | __first_constructed(__x.__value_constructed), |
| 544 | __second_constructed(__x.__value_constructed) |
| 545 | { |
| 546 | __x.__value_constructed = false; |
| 547 | } |
Howard Hinnant | 5dc8911 | 2010-09-04 23:46:48 +0000 | [diff] [blame] | 548 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 549 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 550 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 551 | void operator()(pointer __p) _NOEXCEPT |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 552 | { |
| 553 | if (__second_constructed) |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 554 | __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__cc.second)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 555 | if (__first_constructed) |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 556 | __alloc_traits::destroy(__na_, _VSTD::addressof(__p->__value_.__cc.first)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 557 | if (__p) |
| 558 | __alloc_traits::deallocate(__na_, __p, 1); |
| 559 | } |
| 560 | }; |
| 561 | |
Howard Hinnant | 944510a | 2011-06-14 19:58:17 +0000 | [diff] [blame] | 562 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 563 | class map; |
| 564 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 565 | class multimap; |
| 566 | template <class _TreeIterator> class __map_const_iterator; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 567 | |
| 568 | template <class _TreeIterator> |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 569 | class _LIBCPP_TYPE_VIS_ONLY __map_iterator |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 570 | { |
| 571 | _TreeIterator __i_; |
| 572 | |
| 573 | typedef typename _TreeIterator::__pointer_traits __pointer_traits; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 574 | typedef const typename _TreeIterator::value_type::value_type::first_type __key_type; |
| 575 | typedef typename _TreeIterator::value_type::value_type::second_type __mapped_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 576 | public: |
| 577 | typedef bidirectional_iterator_tag iterator_category; |
Howard Hinnant | b2e8a42 | 2011-02-27 18:02:02 +0000 | [diff] [blame] | 578 | typedef pair<__key_type, __mapped_type> value_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 579 | typedef typename _TreeIterator::difference_type difference_type; |
| 580 | typedef value_type& reference; |
| 581 | typedef typename __pointer_traits::template |
| 582 | #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES |
| 583 | rebind<value_type> |
| 584 | #else |
| 585 | rebind<value_type>::other |
| 586 | #endif |
| 587 | pointer; |
| 588 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 589 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 590 | __map_iterator() _NOEXCEPT {} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 591 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 592 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 593 | __map_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 594 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 595 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 596 | reference operator*() const {return __i_->__cc;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 597 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 598 | pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__cc);} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 599 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 600 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 601 | __map_iterator& operator++() {++__i_; return *this;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 602 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 603 | __map_iterator operator++(int) |
| 604 | { |
| 605 | __map_iterator __t(*this); |
| 606 | ++(*this); |
| 607 | return __t; |
| 608 | } |
| 609 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 610 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 611 | __map_iterator& operator--() {--__i_; return *this;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 612 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 613 | __map_iterator operator--(int) |
| 614 | { |
| 615 | __map_iterator __t(*this); |
| 616 | --(*this); |
| 617 | return __t; |
| 618 | } |
| 619 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 620 | friend _LIBCPP_INLINE_VISIBILITY |
| 621 | bool operator==(const __map_iterator& __x, const __map_iterator& __y) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 622 | {return __x.__i_ == __y.__i_;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 623 | friend |
| 624 | _LIBCPP_INLINE_VISIBILITY |
| 625 | bool operator!=(const __map_iterator& __x, const __map_iterator& __y) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 626 | {return __x.__i_ != __y.__i_;} |
| 627 | |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 628 | template <class, class, class, class> friend class _LIBCPP_TYPE_VIS_ONLY map; |
| 629 | template <class, class, class, class> friend class _LIBCPP_TYPE_VIS_ONLY multimap; |
| 630 | template <class> friend class _LIBCPP_TYPE_VIS_ONLY __map_const_iterator; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 631 | }; |
| 632 | |
| 633 | template <class _TreeIterator> |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 634 | class _LIBCPP_TYPE_VIS_ONLY __map_const_iterator |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 635 | { |
| 636 | _TreeIterator __i_; |
| 637 | |
| 638 | typedef typename _TreeIterator::__pointer_traits __pointer_traits; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 639 | typedef const typename _TreeIterator::value_type::value_type::first_type __key_type; |
| 640 | typedef typename _TreeIterator::value_type::value_type::second_type __mapped_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 641 | public: |
| 642 | typedef bidirectional_iterator_tag iterator_category; |
Howard Hinnant | b2e8a42 | 2011-02-27 18:02:02 +0000 | [diff] [blame] | 643 | typedef pair<__key_type, __mapped_type> value_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 644 | typedef typename _TreeIterator::difference_type difference_type; |
| 645 | typedef const value_type& reference; |
| 646 | typedef typename __pointer_traits::template |
| 647 | #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES |
Howard Hinnant | 73f3c8a | 2011-04-11 02:18:41 +0000 | [diff] [blame] | 648 | rebind<const value_type> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 649 | #else |
Howard Hinnant | 73f3c8a | 2011-04-11 02:18:41 +0000 | [diff] [blame] | 650 | rebind<const value_type>::other |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 651 | #endif |
| 652 | pointer; |
| 653 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 654 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 655 | __map_const_iterator() _NOEXCEPT {} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 656 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 657 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 658 | __map_const_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 659 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 660 | __map_const_iterator( |
| 661 | __map_iterator<typename _TreeIterator::__non_const_iterator> __i) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 662 | _NOEXCEPT |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 663 | : __i_(__i.__i_) {} |
| 664 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 665 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 666 | reference operator*() const {return __i_->__cc;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 667 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 668 | pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__cc);} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 669 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 670 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 671 | __map_const_iterator& operator++() {++__i_; return *this;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 672 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 673 | __map_const_iterator operator++(int) |
| 674 | { |
| 675 | __map_const_iterator __t(*this); |
| 676 | ++(*this); |
| 677 | return __t; |
| 678 | } |
| 679 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 680 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 681 | __map_const_iterator& operator--() {--__i_; return *this;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 682 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 683 | __map_const_iterator operator--(int) |
| 684 | { |
| 685 | __map_const_iterator __t(*this); |
| 686 | --(*this); |
| 687 | return __t; |
| 688 | } |
| 689 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 690 | friend _LIBCPP_INLINE_VISIBILITY |
| 691 | bool operator==(const __map_const_iterator& __x, const __map_const_iterator& __y) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 692 | {return __x.__i_ == __y.__i_;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 693 | friend _LIBCPP_INLINE_VISIBILITY |
| 694 | bool operator!=(const __map_const_iterator& __x, const __map_const_iterator& __y) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 695 | {return __x.__i_ != __y.__i_;} |
| 696 | |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 697 | template <class, class, class, class> friend class _LIBCPP_TYPE_VIS_ONLY map; |
| 698 | template <class, class, class, class> friend class _LIBCPP_TYPE_VIS_ONLY multimap; |
| 699 | template <class, class, class> friend class _LIBCPP_TYPE_VIS_ONLY __tree_const_iterator; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 700 | }; |
| 701 | |
| 702 | template <class _Key, class _Tp, class _Compare = less<_Key>, |
| 703 | class _Allocator = allocator<pair<const _Key, _Tp> > > |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 704 | class _LIBCPP_TYPE_VIS_ONLY map |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 705 | { |
| 706 | public: |
| 707 | // types: |
| 708 | typedef _Key key_type; |
| 709 | typedef _Tp mapped_type; |
| 710 | typedef pair<const key_type, mapped_type> value_type; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 711 | typedef pair<key_type, mapped_type> __nc_value_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 712 | typedef _Compare key_compare; |
| 713 | typedef _Allocator allocator_type; |
| 714 | typedef value_type& reference; |
| 715 | typedef const value_type& const_reference; |
| 716 | |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 717 | class _LIBCPP_TYPE_VIS_ONLY value_compare |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 718 | : public binary_function<value_type, value_type, bool> |
| 719 | { |
| 720 | friend class map; |
| 721 | protected: |
| 722 | key_compare comp; |
| 723 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 724 | _LIBCPP_INLINE_VISIBILITY value_compare(key_compare c) : comp(c) {} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 725 | public: |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 726 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 727 | bool operator()(const value_type& __x, const value_type& __y) const |
| 728 | {return comp(__x.first, __y.first);} |
| 729 | }; |
| 730 | |
| 731 | private: |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 732 | |
| 733 | #if __cplusplus >= 201103L |
| 734 | union __value_type |
| 735 | { |
| 736 | typedef typename map::value_type value_type; |
| 737 | typedef typename map::__nc_value_type __nc_value_type; |
| 738 | value_type __cc; |
| 739 | __nc_value_type __nc; |
| 740 | |
| 741 | template <class ..._Args> |
| 742 | __value_type(_Args&& ...__args) |
| 743 | : __cc(std::forward<_Args>(__args)...) {} |
| 744 | |
| 745 | __value_type(const __value_type& __v) |
| 746 | : __cc(std::move(__v.__cc)) {} |
| 747 | |
| 748 | __value_type(__value_type&& __v) |
| 749 | : __nc(std::move(__v.__nc)) {} |
| 750 | |
| 751 | __value_type& operator=(const __value_type& __v) |
| 752 | {__nc = __v.__cc; return *this;} |
| 753 | |
| 754 | __value_type& operator=(__value_type&& __v) |
| 755 | {__nc = std::move(__v.__nc); return *this;} |
| 756 | |
| 757 | ~__value_type() {__cc.~value_type();} |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 758 | }; |
| 759 | #else |
| 760 | struct __value_type |
| 761 | { |
| 762 | typedef typename map::value_type value_type; |
| 763 | value_type __cc; |
| 764 | |
| 765 | __value_type() {} |
| 766 | |
| 767 | template <class _A0> |
| 768 | __value_type(const _A0& __a0) |
| 769 | : __cc(__a0) {} |
| 770 | |
| 771 | template <class _A0, class _A1> |
| 772 | __value_type(const _A0& __a0, const _A1& __a1) |
| 773 | : __cc(__a0, __a1) {} |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 774 | }; |
| 775 | #endif |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 776 | typedef __map_value_compare<key_type, __value_type, key_compare> __vc; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 777 | typedef typename allocator_traits<allocator_type>::template |
| 778 | #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES |
| 779 | rebind_alloc<__value_type> |
| 780 | #else |
| 781 | rebind_alloc<__value_type>::other |
| 782 | #endif |
| 783 | __allocator_type; |
| 784 | typedef __tree<__value_type, __vc, __allocator_type> __base; |
| 785 | typedef typename __base::__node_traits __node_traits; |
| 786 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 787 | |
| 788 | __base __tree_; |
| 789 | |
| 790 | public: |
| 791 | typedef typename __alloc_traits::pointer pointer; |
| 792 | typedef typename __alloc_traits::const_pointer const_pointer; |
| 793 | typedef typename __alloc_traits::size_type size_type; |
| 794 | typedef typename __alloc_traits::difference_type difference_type; |
| 795 | typedef __map_iterator<typename __base::iterator> iterator; |
| 796 | typedef __map_const_iterator<typename __base::const_iterator> const_iterator; |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 797 | typedef _VSTD::reverse_iterator<iterator> reverse_iterator; |
| 798 | typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 799 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 800 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 801 | explicit map(const key_compare& __comp = key_compare()) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 802 | _NOEXCEPT_( |
| 803 | is_nothrow_default_constructible<allocator_type>::value && |
| 804 | is_nothrow_default_constructible<key_compare>::value && |
| 805 | is_nothrow_copy_constructible<key_compare>::value) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 806 | : __tree_(__vc(__comp)) {} |
| 807 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 808 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 809 | explicit map(const key_compare& __comp, const allocator_type& __a) |
| 810 | : __tree_(__vc(__comp), __a) {} |
| 811 | |
| 812 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 813 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 814 | map(_InputIterator __f, _InputIterator __l, |
| 815 | const key_compare& __comp = key_compare()) |
| 816 | : __tree_(__vc(__comp)) |
| 817 | { |
| 818 | insert(__f, __l); |
| 819 | } |
| 820 | |
| 821 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 822 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 823 | map(_InputIterator __f, _InputIterator __l, |
| 824 | const key_compare& __comp, const allocator_type& __a) |
| 825 | : __tree_(__vc(__comp), __a) |
| 826 | { |
| 827 | insert(__f, __l); |
| 828 | } |
| 829 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 830 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 831 | map(const map& __m) |
| 832 | : __tree_(__m.__tree_) |
| 833 | { |
| 834 | insert(__m.begin(), __m.end()); |
| 835 | } |
| 836 | |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 837 | _LIBCPP_INLINE_VISIBILITY |
| 838 | map& operator=(const map& __m) |
| 839 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 840 | #if __cplusplus >= 201103L |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 841 | __tree_ = __m.__tree_; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 842 | #else |
| 843 | __tree_.clear(); |
| 844 | __tree_.value_comp() = __m.__tree_.value_comp(); |
| 845 | __tree_.__copy_assign_alloc(__m.__tree_); |
| 846 | insert(__m.begin(), __m.end()); |
| 847 | #endif |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 848 | return *this; |
| 849 | } |
| 850 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 851 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 852 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 853 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 854 | map(map&& __m) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 855 | _NOEXCEPT_(is_nothrow_move_constructible<__base>::value) |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 856 | : __tree_(_VSTD::move(__m.__tree_)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 857 | { |
| 858 | } |
| 859 | |
| 860 | map(map&& __m, const allocator_type& __a); |
| 861 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 862 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 863 | map& operator=(map&& __m) |
| 864 | _NOEXCEPT_(is_nothrow_move_assignable<__base>::value) |
| 865 | { |
| 866 | __tree_ = _VSTD::move(__m.__tree_); |
| 867 | return *this; |
| 868 | } |
| 869 | |
| 870 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| 871 | |
| 872 | #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 873 | |
| 874 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 875 | map(initializer_list<value_type> __il, const key_compare& __comp = key_compare()) |
| 876 | : __tree_(__vc(__comp)) |
| 877 | { |
| 878 | insert(__il.begin(), __il.end()); |
| 879 | } |
| 880 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 881 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 882 | map(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a) |
| 883 | : __tree_(__vc(__comp), __a) |
| 884 | { |
| 885 | insert(__il.begin(), __il.end()); |
| 886 | } |
| 887 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 888 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 889 | map& operator=(initializer_list<value_type> __il) |
| 890 | { |
| 891 | __tree_.__assign_unique(__il.begin(), __il.end()); |
| 892 | return *this; |
| 893 | } |
| 894 | |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 895 | #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 896 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 897 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 898 | explicit map(const allocator_type& __a) |
| 899 | : __tree_(__a) |
| 900 | { |
| 901 | } |
| 902 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 903 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 904 | map(const map& __m, const allocator_type& __a) |
| 905 | : __tree_(__m.__tree_.value_comp(), __a) |
| 906 | { |
| 907 | insert(__m.begin(), __m.end()); |
| 908 | } |
| 909 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 910 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 911 | iterator begin() _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 912 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 913 | const_iterator begin() const _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 914 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 915 | iterator end() _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 916 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 917 | const_iterator end() const _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 918 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 919 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 920 | reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 921 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 922 | const_reverse_iterator rbegin() const _NOEXCEPT |
| 923 | {return const_reverse_iterator(end());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 924 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 925 | reverse_iterator rend() _NOEXCEPT |
| 926 | {return reverse_iterator(begin());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 927 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 928 | const_reverse_iterator rend() const _NOEXCEPT |
| 929 | {return const_reverse_iterator(begin());} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 930 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 931 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 932 | const_iterator cbegin() const _NOEXCEPT {return begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 933 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 934 | const_iterator cend() const _NOEXCEPT {return end();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 935 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 936 | const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 937 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 938 | const_reverse_iterator crend() const _NOEXCEPT {return rend();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 939 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 940 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 941 | bool empty() const _NOEXCEPT {return __tree_.size() == 0;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 942 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 943 | size_type size() const _NOEXCEPT {return __tree_.size();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 944 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 945 | size_type max_size() const _NOEXCEPT {return __tree_.max_size();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 946 | |
| 947 | mapped_type& operator[](const key_type& __k); |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 948 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 949 | mapped_type& operator[](key_type&& __k); |
| 950 | #endif |
| 951 | |
| 952 | mapped_type& at(const key_type& __k); |
| 953 | const mapped_type& at(const key_type& __k) const; |
| 954 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 955 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 956 | allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 957 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 958 | key_compare key_comp() const {return __tree_.value_comp().key_comp();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 959 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 960 | value_compare value_comp() const {return value_compare(__tree_.value_comp().key_comp());} |
| 961 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 962 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 963 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
| 964 | |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 965 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 966 | pair<iterator, bool> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 967 | emplace(_Args&& ...__args); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 968 | |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 969 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 970 | iterator |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 971 | emplace_hint(const_iterator __p, _Args&& ...__args); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 972 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 973 | #endif // _LIBCPP_HAS_NO_VARIADICS |
| 974 | |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 975 | template <class _Pp, |
| 976 | class = typename enable_if<is_constructible<value_type, _Pp>::value>::type> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 977 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 978 | pair<iterator, bool> insert(_Pp&& __p) |
| 979 | {return __tree_.__insert_unique(_VSTD::forward<_Pp>(__p));} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 980 | |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 981 | template <class _Pp, |
| 982 | class = typename enable_if<is_constructible<value_type, _Pp>::value>::type> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 983 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 984 | iterator insert(const_iterator __pos, _Pp&& __p) |
| 985 | {return __tree_.__insert_unique(__pos.__i_, _VSTD::forward<_Pp>(__p));} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 986 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 987 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 988 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 989 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 990 | pair<iterator, bool> |
| 991 | insert(const value_type& __v) {return __tree_.__insert_unique(__v);} |
| 992 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 993 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 994 | iterator |
| 995 | insert(const_iterator __p, const value_type& __v) |
| 996 | {return __tree_.__insert_unique(__p.__i_, __v);} |
| 997 | |
| 998 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 999 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1000 | void insert(_InputIterator __f, _InputIterator __l) |
| 1001 | { |
| 1002 | for (const_iterator __e = cend(); __f != __l; ++__f) |
| 1003 | insert(__e.__i_, *__f); |
| 1004 | } |
| 1005 | |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1006 | #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 1007 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1008 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1009 | void insert(initializer_list<value_type> __il) |
| 1010 | {insert(__il.begin(), __il.end());} |
| 1011 | |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1012 | #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 1013 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1014 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1015 | iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1016 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1017 | size_type erase(const key_type& __k) |
| 1018 | {return __tree_.__erase_unique(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1019 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1020 | iterator erase(const_iterator __f, const_iterator __l) |
| 1021 | {return __tree_.erase(__f.__i_, __l.__i_);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1022 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1023 | void clear() _NOEXCEPT {__tree_.clear();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1024 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1025 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1026 | void swap(map& __m) |
| 1027 | _NOEXCEPT_(__is_nothrow_swappable<__base>::value) |
| 1028 | {__tree_.swap(__m.__tree_);} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1029 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1030 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1031 | iterator find(const key_type& __k) {return __tree_.find(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1032 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1033 | const_iterator find(const key_type& __k) const {return __tree_.find(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1034 | #if _LIBCPP_STD_VER > 11 |
| 1035 | template <typename _K2> |
| 1036 | _LIBCPP_INLINE_VISIBILITY |
| 1037 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1038 | find(const _K2& __k) {return __tree_.find(__k);} |
| 1039 | template <typename _K2> |
| 1040 | _LIBCPP_INLINE_VISIBILITY |
| 1041 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1042 | find(const _K2& __k) const {return __tree_.find(__k);} |
| 1043 | #endif |
| 1044 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1045 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1046 | size_type count(const key_type& __k) const |
| 1047 | {return __tree_.__count_unique(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1048 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1049 | iterator lower_bound(const key_type& __k) |
| 1050 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1051 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1052 | const_iterator lower_bound(const key_type& __k) const |
| 1053 | {return __tree_.lower_bound(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1054 | #if _LIBCPP_STD_VER > 11 |
| 1055 | template <typename _K2> |
| 1056 | _LIBCPP_INLINE_VISIBILITY |
| 1057 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1058 | lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} |
| 1059 | |
| 1060 | template <typename _K2> |
| 1061 | _LIBCPP_INLINE_VISIBILITY |
| 1062 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1063 | lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);} |
| 1064 | #endif |
| 1065 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1066 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1067 | iterator upper_bound(const key_type& __k) |
| 1068 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1069 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1070 | const_iterator upper_bound(const key_type& __k) const |
| 1071 | {return __tree_.upper_bound(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1072 | #if _LIBCPP_STD_VER > 11 |
| 1073 | template <typename _K2> |
| 1074 | _LIBCPP_INLINE_VISIBILITY |
| 1075 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1076 | upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);} |
| 1077 | template <typename _K2> |
| 1078 | _LIBCPP_INLINE_VISIBILITY |
| 1079 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1080 | upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);} |
| 1081 | #endif |
| 1082 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1083 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1084 | pair<iterator,iterator> equal_range(const key_type& __k) |
| 1085 | {return __tree_.__equal_range_unique(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1086 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1087 | pair<const_iterator,const_iterator> equal_range(const key_type& __k) const |
| 1088 | {return __tree_.__equal_range_unique(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1089 | #if _LIBCPP_STD_VER > 11 |
| 1090 | template <typename _K2> |
| 1091 | _LIBCPP_INLINE_VISIBILITY |
| 1092 | typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type |
| 1093 | equal_range(const _K2& __k) {return __tree_.__equal_range_unique(__k);} |
| 1094 | template <typename _K2> |
| 1095 | _LIBCPP_INLINE_VISIBILITY |
| 1096 | typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::type |
| 1097 | equal_range(const _K2& __k) const {return __tree_.__equal_range_unique(__k);} |
| 1098 | #endif |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1099 | |
| 1100 | private: |
| 1101 | typedef typename __base::__node __node; |
| 1102 | typedef typename __base::__node_allocator __node_allocator; |
| 1103 | typedef typename __base::__node_pointer __node_pointer; |
| 1104 | typedef typename __base::__node_const_pointer __node_const_pointer; |
| 1105 | typedef typename __base::__node_base_pointer __node_base_pointer; |
| 1106 | typedef typename __base::__node_base_const_pointer __node_base_const_pointer; |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1107 | typedef __map_node_destructor<__node_allocator> _Dp; |
| 1108 | typedef unique_ptr<__node, _Dp> __node_holder; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1109 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1110 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1111 | __node_holder __construct_node(); |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1112 | template <class _A0> |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1113 | __node_holder __construct_node(_A0&& __a0); |
| 1114 | __node_holder __construct_node_with_key(key_type&& __k); |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1115 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1116 | template <class _A0, class _A1, class ..._Args> |
| 1117 | __node_holder __construct_node(_A0&& __a0, _A1&& __a1, _Args&& ...__args); |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1118 | #endif // _LIBCPP_HAS_NO_VARIADICS |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1119 | #endif |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1120 | __node_holder __construct_node_with_key(const key_type& __k); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1121 | |
| 1122 | __node_base_pointer& |
| 1123 | __find_equal_key(__node_base_pointer& __parent, const key_type& __k); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1124 | __node_base_const_pointer |
| 1125 | __find_equal_key(__node_base_const_pointer& __parent, const key_type& __k) const; |
| 1126 | }; |
| 1127 | |
| 1128 | // Find place to insert if __k doesn't exist |
| 1129 | // Set __parent to parent of null leaf |
| 1130 | // Return reference to null leaf |
| 1131 | // If __k exists, set parent to node of __k and return reference to node of __k |
| 1132 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1133 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_base_pointer& |
| 1134 | map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_pointer& __parent, |
| 1135 | const key_type& __k) |
| 1136 | { |
| 1137 | __node_pointer __nd = __tree_.__root(); |
| 1138 | if (__nd != nullptr) |
| 1139 | { |
| 1140 | while (true) |
| 1141 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1142 | if (__tree_.value_comp().key_comp()(__k, __nd->__value_.__cc.first)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1143 | { |
| 1144 | if (__nd->__left_ != nullptr) |
| 1145 | __nd = static_cast<__node_pointer>(__nd->__left_); |
| 1146 | else |
| 1147 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1148 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1149 | return __parent->__left_; |
| 1150 | } |
| 1151 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1152 | else if (__tree_.value_comp().key_comp()(__nd->__value_.__cc.first, __k)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1153 | { |
| 1154 | if (__nd->__right_ != nullptr) |
| 1155 | __nd = static_cast<__node_pointer>(__nd->__right_); |
| 1156 | else |
| 1157 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1158 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1159 | return __parent->__right_; |
| 1160 | } |
| 1161 | } |
| 1162 | else |
| 1163 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1164 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1165 | return __parent; |
| 1166 | } |
| 1167 | } |
| 1168 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1169 | __parent = static_cast<__node_base_pointer>(__tree_.__end_node()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1170 | return __parent->__left_; |
| 1171 | } |
| 1172 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1173 | // Find __k |
| 1174 | // Set __parent to parent of null leaf and |
| 1175 | // return reference to null leaf iv __k does not exist. |
| 1176 | // If __k exists, set parent to node of __k and return reference to node of __k |
| 1177 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1178 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_base_const_pointer |
| 1179 | map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_const_pointer& __parent, |
| 1180 | const key_type& __k) const |
| 1181 | { |
| 1182 | __node_const_pointer __nd = __tree_.__root(); |
| 1183 | if (__nd != nullptr) |
| 1184 | { |
| 1185 | while (true) |
| 1186 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1187 | if (__tree_.value_comp().key_comp()(__k, __nd->__value_.__cc.first)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1188 | { |
| 1189 | if (__nd->__left_ != nullptr) |
| 1190 | __nd = static_cast<__node_pointer>(__nd->__left_); |
| 1191 | else |
| 1192 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1193 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1194 | return const_cast<const __node_base_const_pointer&>(__parent->__left_); |
| 1195 | } |
| 1196 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1197 | else if (__tree_.value_comp().key_comp()(__nd->__value_.__cc.first, __k)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1198 | { |
| 1199 | if (__nd->__right_ != nullptr) |
| 1200 | __nd = static_cast<__node_pointer>(__nd->__right_); |
| 1201 | else |
| 1202 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1203 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1204 | return const_cast<const __node_base_const_pointer&>(__parent->__right_); |
| 1205 | } |
| 1206 | } |
| 1207 | else |
| 1208 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1209 | __parent = static_cast<__node_base_pointer>(__nd); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1210 | return __parent; |
| 1211 | } |
| 1212 | } |
| 1213 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1214 | __parent = static_cast<__node_base_pointer>(__tree_.__end_node()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1215 | return const_cast<const __node_base_const_pointer&>(__parent->__left_); |
| 1216 | } |
| 1217 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1218 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1219 | |
| 1220 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1221 | map<_Key, _Tp, _Compare, _Allocator>::map(map&& __m, const allocator_type& __a) |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1222 | : __tree_(_VSTD::move(__m.__tree_), __a) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1223 | { |
| 1224 | if (__a != __m.get_allocator()) |
| 1225 | { |
| 1226 | const_iterator __e = cend(); |
| 1227 | while (!__m.empty()) |
| 1228 | __tree_.__insert_unique(__e.__i_, |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1229 | _VSTD::move(__m.__tree_.remove(__m.begin().__i_)->__value_)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1230 | } |
| 1231 | } |
| 1232 | |
| 1233 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1234 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder |
| 1235 | map<_Key, _Tp, _Compare, _Allocator>::__construct_node() |
| 1236 | { |
| 1237 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1238 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1239 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1240 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1241 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1242 | __h.get_deleter().__second_constructed = true; |
| 1243 | return __h; |
| 1244 | } |
| 1245 | |
| 1246 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1247 | template <class _A0> |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1248 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1249 | map<_Key, _Tp, _Compare, _Allocator>::__construct_node(_A0&& __a0) |
| 1250 | { |
| 1251 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1252 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1253 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_), _VSTD::forward<_A0>(__a0)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1254 | __h.get_deleter().__first_constructed = true; |
| 1255 | __h.get_deleter().__second_constructed = true; |
| 1256 | return __h; |
| 1257 | } |
| 1258 | |
| 1259 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1260 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder |
| 1261 | map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(key_type&& __k) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1262 | { |
| 1263 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1264 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1265 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), _VSTD::move(__k)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1266 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1267 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second)); |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1268 | __h.get_deleter().__second_constructed = true; |
Howard Hinnant | a31e968 | 2013-08-22 18:29:50 +0000 | [diff] [blame^] | 1269 | return __h; |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1270 | } |
| 1271 | |
| 1272 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
| 1273 | |
| 1274 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1275 | template <class _A0, class _A1, class ..._Args> |
| 1276 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder |
| 1277 | map<_Key, _Tp, _Compare, _Allocator>::__construct_node(_A0&& __a0, _A1&& __a1, _Args&& ...__args) |
| 1278 | { |
| 1279 | __node_allocator& __na = __tree_.__node_alloc(); |
| 1280 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
| 1281 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_), |
| 1282 | _VSTD::forward<_A0>(__a0), _VSTD::forward<_A1>(__a1), |
| 1283 | _VSTD::forward<_Args>(__args)...); |
| 1284 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1285 | __h.get_deleter().__second_constructed = true; |
| 1286 | return __h; |
| 1287 | } |
| 1288 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1289 | #endif // _LIBCPP_HAS_NO_VARIADICS |
| 1290 | |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1291 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1292 | |
| 1293 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1294 | typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1295 | map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1296 | { |
| 1297 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1298 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1299 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), __k); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1300 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1301 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1302 | __h.get_deleter().__second_constructed = true; |
Howard Hinnant | a31e968 | 2013-08-22 18:29:50 +0000 | [diff] [blame^] | 1303 | return _VSTD::move(__h); // explicitly moved for C++03 |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1304 | } |
| 1305 | |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1306 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1307 | _Tp& |
| 1308 | map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k) |
| 1309 | { |
| 1310 | __node_base_pointer __parent; |
| 1311 | __node_base_pointer& __child = __find_equal_key(__parent, __k); |
| 1312 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 1313 | if (__child == nullptr) |
| 1314 | { |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1315 | __node_holder __h = __construct_node_with_key(__k); |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1316 | __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1317 | __r = __h.release(); |
| 1318 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1319 | return __r->__value_.__cc.second; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1320 | } |
| 1321 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1322 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1323 | |
| 1324 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1325 | _Tp& |
| 1326 | map<_Key, _Tp, _Compare, _Allocator>::operator[](key_type&& __k) |
| 1327 | { |
| 1328 | __node_base_pointer __parent; |
| 1329 | __node_base_pointer& __child = __find_equal_key(__parent, __k); |
| 1330 | __node_pointer __r = static_cast<__node_pointer>(__child); |
| 1331 | if (__child == nullptr) |
| 1332 | { |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1333 | __node_holder __h = __construct_node_with_key(_VSTD::move(__k)); |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1334 | __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1335 | __r = __h.release(); |
| 1336 | } |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1337 | return __r->__value_.__cc.second; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1338 | } |
| 1339 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1340 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1341 | |
| 1342 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1343 | _Tp& |
| 1344 | map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) |
| 1345 | { |
| 1346 | __node_base_pointer __parent; |
| 1347 | __node_base_pointer& __child = __find_equal_key(__parent, __k); |
Howard Hinnant | 72f7358 | 2010-08-11 17:04:31 +0000 | [diff] [blame] | 1348 | #ifndef _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1349 | if (__child == nullptr) |
| 1350 | throw out_of_range("map::at: key not found"); |
Howard Hinnant | 3b6579a | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 1351 | #endif // _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1352 | return static_cast<__node_pointer>(__child)->__value_.__cc.second; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1353 | } |
| 1354 | |
| 1355 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1356 | const _Tp& |
| 1357 | map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const |
| 1358 | { |
| 1359 | __node_base_const_pointer __parent; |
| 1360 | __node_base_const_pointer __child = __find_equal_key(__parent, __k); |
Howard Hinnant | 72f7358 | 2010-08-11 17:04:31 +0000 | [diff] [blame] | 1361 | #ifndef _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1362 | if (__child == nullptr) |
| 1363 | throw out_of_range("map::at: key not found"); |
Howard Hinnant | 3b6579a | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 1364 | #endif // _LIBCPP_NO_EXCEPTIONS |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1365 | return static_cast<__node_const_pointer>(__child)->__value_.__cc.second; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1366 | } |
| 1367 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1368 | #if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1369 | |
| 1370 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1371 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1372 | pair<typename map<_Key, _Tp, _Compare, _Allocator>::iterator, bool> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1373 | map<_Key, _Tp, _Compare, _Allocator>::emplace(_Args&& ...__args) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1374 | { |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1375 | __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1376 | pair<iterator, bool> __r = __tree_.__node_insert_unique(__h.get()); |
| 1377 | if (__r.second) |
| 1378 | __h.release(); |
| 1379 | return __r; |
| 1380 | } |
| 1381 | |
| 1382 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1383 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1384 | typename map<_Key, _Tp, _Compare, _Allocator>::iterator |
| 1385 | map<_Key, _Tp, _Compare, _Allocator>::emplace_hint(const_iterator __p, |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1386 | _Args&& ...__args) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1387 | { |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1388 | __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1389 | iterator __r = __tree_.__node_insert_unique(__p.__i_, __h.get()); |
| 1390 | if (__r.__i_.__ptr_ == __h.get()) |
| 1391 | __h.release(); |
| 1392 | return __r; |
| 1393 | } |
| 1394 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1395 | #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1396 | |
| 1397 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1398 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1399 | bool |
| 1400 | operator==(const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1401 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1402 | { |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1403 | return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1404 | } |
| 1405 | |
| 1406 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1407 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1408 | bool |
| 1409 | operator< (const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1410 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1411 | { |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1412 | return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1413 | } |
| 1414 | |
| 1415 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1416 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1417 | bool |
| 1418 | operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1419 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1420 | { |
| 1421 | return !(__x == __y); |
| 1422 | } |
| 1423 | |
| 1424 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1425 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1426 | bool |
| 1427 | operator> (const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1428 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1429 | { |
| 1430 | return __y < __x; |
| 1431 | } |
| 1432 | |
| 1433 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1434 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1435 | bool |
| 1436 | operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1437 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1438 | { |
| 1439 | return !(__x < __y); |
| 1440 | } |
| 1441 | |
| 1442 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1443 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1444 | bool |
| 1445 | operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1446 | const map<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1447 | { |
| 1448 | return !(__y < __x); |
| 1449 | } |
| 1450 | |
| 1451 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1452 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1453 | void |
| 1454 | swap(map<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1455 | map<_Key, _Tp, _Compare, _Allocator>& __y) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1456 | _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1457 | { |
| 1458 | __x.swap(__y); |
| 1459 | } |
| 1460 | |
| 1461 | template <class _Key, class _Tp, class _Compare = less<_Key>, |
| 1462 | class _Allocator = allocator<pair<const _Key, _Tp> > > |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 1463 | class _LIBCPP_TYPE_VIS_ONLY multimap |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1464 | { |
| 1465 | public: |
| 1466 | // types: |
| 1467 | typedef _Key key_type; |
| 1468 | typedef _Tp mapped_type; |
| 1469 | typedef pair<const key_type, mapped_type> value_type; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1470 | typedef pair<key_type, mapped_type> __nc_value_type; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1471 | typedef _Compare key_compare; |
| 1472 | typedef _Allocator allocator_type; |
| 1473 | typedef value_type& reference; |
| 1474 | typedef const value_type& const_reference; |
| 1475 | |
Howard Hinnant | a37d3cf | 2013-08-12 18:38:34 +0000 | [diff] [blame] | 1476 | class _LIBCPP_TYPE_VIS_ONLY value_compare |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1477 | : public binary_function<value_type, value_type, bool> |
| 1478 | { |
| 1479 | friend class multimap; |
| 1480 | protected: |
| 1481 | key_compare comp; |
| 1482 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1483 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1484 | value_compare(key_compare c) : comp(c) {} |
| 1485 | public: |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1486 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1487 | bool operator()(const value_type& __x, const value_type& __y) const |
| 1488 | {return comp(__x.first, __y.first);} |
| 1489 | }; |
| 1490 | |
| 1491 | private: |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1492 | #if __cplusplus >= 201103L |
| 1493 | union __value_type |
| 1494 | { |
| 1495 | typedef typename multimap::value_type value_type; |
| 1496 | typedef typename multimap::__nc_value_type __nc_value_type; |
| 1497 | value_type __cc; |
| 1498 | __nc_value_type __nc; |
| 1499 | |
| 1500 | template <class ..._Args> |
| 1501 | __value_type(_Args&& ...__args) |
| 1502 | : __cc(std::forward<_Args>(__args)...) {} |
| 1503 | |
| 1504 | __value_type(const __value_type& __v) |
| 1505 | : __cc(std::move(__v.__cc)) {} |
| 1506 | |
| 1507 | __value_type(__value_type&& __v) |
| 1508 | : __nc(std::move(__v.__nc)) {} |
| 1509 | |
| 1510 | __value_type& operator=(const __value_type& __v) |
| 1511 | {__nc = __v.__cc; return *this;} |
| 1512 | |
| 1513 | __value_type& operator=(__value_type&& __v) |
| 1514 | {__nc = std::move(__v.__nc); return *this;} |
| 1515 | |
| 1516 | ~__value_type() {__cc.~value_type();} |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1517 | }; |
| 1518 | #else |
| 1519 | struct __value_type |
| 1520 | { |
| 1521 | typedef typename multimap::value_type value_type; |
| 1522 | value_type __cc; |
| 1523 | |
| 1524 | __value_type() {} |
| 1525 | |
| 1526 | template <class _A0> |
| 1527 | __value_type(const _A0& __a0) |
| 1528 | : __cc(__a0) {} |
| 1529 | |
| 1530 | template <class _A0, class _A1> |
| 1531 | __value_type(const _A0& __a0, const _A1& __a1) |
| 1532 | : __cc(__a0, __a1) {} |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1533 | }; |
| 1534 | #endif |
Howard Hinnant | 90b9159 | 2013-07-05 18:06:00 +0000 | [diff] [blame] | 1535 | typedef __map_value_compare<key_type, __value_type, key_compare> __vc; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1536 | typedef typename allocator_traits<allocator_type>::template |
| 1537 | #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES |
| 1538 | rebind_alloc<__value_type> |
| 1539 | #else |
| 1540 | rebind_alloc<__value_type>::other |
| 1541 | #endif |
| 1542 | __allocator_type; |
| 1543 | typedef __tree<__value_type, __vc, __allocator_type> __base; |
| 1544 | typedef typename __base::__node_traits __node_traits; |
| 1545 | typedef allocator_traits<allocator_type> __alloc_traits; |
| 1546 | |
| 1547 | __base __tree_; |
| 1548 | |
| 1549 | public: |
| 1550 | typedef typename __alloc_traits::pointer pointer; |
| 1551 | typedef typename __alloc_traits::const_pointer const_pointer; |
| 1552 | typedef typename __alloc_traits::size_type size_type; |
| 1553 | typedef typename __alloc_traits::difference_type difference_type; |
| 1554 | typedef __map_iterator<typename __base::iterator> iterator; |
| 1555 | typedef __map_const_iterator<typename __base::const_iterator> const_iterator; |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1556 | typedef _VSTD::reverse_iterator<iterator> reverse_iterator; |
| 1557 | typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1558 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1559 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1560 | explicit multimap(const key_compare& __comp = key_compare()) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1561 | _NOEXCEPT_( |
| 1562 | is_nothrow_default_constructible<allocator_type>::value && |
| 1563 | is_nothrow_default_constructible<key_compare>::value && |
| 1564 | is_nothrow_copy_constructible<key_compare>::value) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1565 | : __tree_(__vc(__comp)) {} |
| 1566 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1567 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1568 | explicit multimap(const key_compare& __comp, const allocator_type& __a) |
| 1569 | : __tree_(__vc(__comp), __a) {} |
| 1570 | |
| 1571 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1572 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1573 | multimap(_InputIterator __f, _InputIterator __l, |
| 1574 | const key_compare& __comp = key_compare()) |
| 1575 | : __tree_(__vc(__comp)) |
| 1576 | { |
| 1577 | insert(__f, __l); |
| 1578 | } |
| 1579 | |
| 1580 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1581 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1582 | multimap(_InputIterator __f, _InputIterator __l, |
| 1583 | const key_compare& __comp, const allocator_type& __a) |
| 1584 | : __tree_(__vc(__comp), __a) |
| 1585 | { |
| 1586 | insert(__f, __l); |
| 1587 | } |
| 1588 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1589 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1590 | multimap(const multimap& __m) |
| 1591 | : __tree_(__m.__tree_.value_comp(), |
| 1592 | __alloc_traits::select_on_container_copy_construction(__m.__tree_.__alloc())) |
| 1593 | { |
| 1594 | insert(__m.begin(), __m.end()); |
| 1595 | } |
| 1596 | |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 1597 | _LIBCPP_INLINE_VISIBILITY |
| 1598 | multimap& operator=(const multimap& __m) |
| 1599 | { |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1600 | #if __cplusplus >= 201103L |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 1601 | __tree_ = __m.__tree_; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1602 | #else |
| 1603 | __tree_.clear(); |
| 1604 | __tree_.value_comp() = __m.__tree_.value_comp(); |
| 1605 | __tree_.__copy_assign_alloc(__m.__tree_); |
| 1606 | insert(__m.begin(), __m.end()); |
| 1607 | #endif |
Howard Hinnant | d3a657f | 2011-07-01 19:24:36 +0000 | [diff] [blame] | 1608 | return *this; |
| 1609 | } |
| 1610 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1611 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1612 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1613 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1614 | multimap(multimap&& __m) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1615 | _NOEXCEPT_(is_nothrow_move_constructible<__base>::value) |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1616 | : __tree_(_VSTD::move(__m.__tree_)) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1617 | { |
| 1618 | } |
| 1619 | |
| 1620 | multimap(multimap&& __m, const allocator_type& __a); |
| 1621 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1622 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1623 | multimap& operator=(multimap&& __m) |
| 1624 | _NOEXCEPT_(is_nothrow_move_assignable<__base>::value) |
| 1625 | { |
| 1626 | __tree_ = _VSTD::move(__m.__tree_); |
| 1627 | return *this; |
| 1628 | } |
| 1629 | |
| 1630 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| 1631 | |
| 1632 | #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 1633 | |
| 1634 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1635 | multimap(initializer_list<value_type> __il, const key_compare& __comp = key_compare()) |
| 1636 | : __tree_(__vc(__comp)) |
| 1637 | { |
| 1638 | insert(__il.begin(), __il.end()); |
| 1639 | } |
| 1640 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1641 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1642 | multimap(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a) |
| 1643 | : __tree_(__vc(__comp), __a) |
| 1644 | { |
| 1645 | insert(__il.begin(), __il.end()); |
| 1646 | } |
| 1647 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1648 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1649 | multimap& operator=(initializer_list<value_type> __il) |
| 1650 | { |
| 1651 | __tree_.__assign_multi(__il.begin(), __il.end()); |
| 1652 | return *this; |
| 1653 | } |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1654 | |
| 1655 | #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1656 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1657 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1658 | explicit multimap(const allocator_type& __a) |
| 1659 | : __tree_(__a) |
| 1660 | { |
| 1661 | } |
| 1662 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1663 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1664 | multimap(const multimap& __m, const allocator_type& __a) |
| 1665 | : __tree_(__m.__tree_.value_comp(), __a) |
| 1666 | { |
| 1667 | insert(__m.begin(), __m.end()); |
| 1668 | } |
| 1669 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1670 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1671 | iterator begin() _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1672 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1673 | const_iterator begin() const _NOEXCEPT {return __tree_.begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1674 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1675 | iterator end() _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1676 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1677 | const_iterator end() const _NOEXCEPT {return __tree_.end();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1678 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1679 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1680 | reverse_iterator rbegin() _NOEXCEPT {return reverse_iterator(end());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1681 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1682 | const_reverse_iterator rbegin() const _NOEXCEPT |
| 1683 | {return const_reverse_iterator(end());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1684 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1685 | reverse_iterator rend() _NOEXCEPT {return reverse_iterator(begin());} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1686 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1687 | const_reverse_iterator rend() const _NOEXCEPT |
| 1688 | {return const_reverse_iterator(begin());} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1689 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1690 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1691 | const_iterator cbegin() const _NOEXCEPT {return begin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1692 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1693 | const_iterator cend() const _NOEXCEPT {return end();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1694 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1695 | const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1696 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1697 | const_reverse_iterator crend() const _NOEXCEPT {return rend();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1698 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1699 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1700 | bool empty() const _NOEXCEPT {return __tree_.size() == 0;} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1701 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1702 | size_type size() const _NOEXCEPT {return __tree_.size();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1703 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1704 | size_type max_size() const _NOEXCEPT {return __tree_.max_size();} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1705 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1706 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1707 | allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1708 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1709 | key_compare key_comp() const {return __tree_.value_comp().key_comp();} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1710 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1711 | value_compare value_comp() const |
| 1712 | {return value_compare(__tree_.value_comp().key_comp());} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1713 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1714 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1715 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
| 1716 | |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1717 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1718 | iterator |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1719 | emplace(_Args&& ...__args); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1720 | |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1721 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1722 | iterator |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1723 | emplace_hint(const_iterator __p, _Args&& ...__args); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1724 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1725 | #endif // _LIBCPP_HAS_NO_VARIADICS |
| 1726 | |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1727 | template <class _Pp, |
| 1728 | class = typename enable_if<is_constructible<value_type, _Pp>::value>::type> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1729 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1730 | iterator insert(_Pp&& __p) |
| 1731 | {return __tree_.__insert_multi(_VSTD::forward<_Pp>(__p));} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1732 | |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1733 | template <class _Pp, |
| 1734 | class = typename enable_if<is_constructible<value_type, _Pp>::value>::type> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1735 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1736 | iterator insert(const_iterator __pos, _Pp&& __p) |
| 1737 | {return __tree_.__insert_multi(__pos.__i_, _VSTD::forward<_Pp>(__p));} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1738 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1739 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1740 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1741 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1742 | iterator insert(const value_type& __v) {return __tree_.__insert_multi(__v);} |
| 1743 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1744 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1745 | iterator insert(const_iterator __p, const value_type& __v) |
| 1746 | {return __tree_.__insert_multi(__p.__i_, __v);} |
| 1747 | |
| 1748 | template <class _InputIterator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1749 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1750 | void insert(_InputIterator __f, _InputIterator __l) |
| 1751 | { |
| 1752 | for (const_iterator __e = cend(); __f != __l; ++__f) |
| 1753 | __tree_.__insert_multi(__e.__i_, *__f); |
| 1754 | } |
| 1755 | |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1756 | #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 1757 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1758 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1759 | void insert(initializer_list<value_type> __il) |
| 1760 | {insert(__il.begin(), __il.end());} |
| 1761 | |
Howard Hinnant | 3371179 | 2011-08-12 21:56:02 +0000 | [diff] [blame] | 1762 | #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS |
| 1763 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1764 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1765 | iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1766 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1767 | size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1768 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1769 | iterator erase(const_iterator __f, const_iterator __l) |
| 1770 | {return __tree_.erase(__f.__i_, __l.__i_);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1771 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1772 | void clear() {__tree_.clear();} |
| 1773 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1774 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 1775 | void swap(multimap& __m) |
| 1776 | _NOEXCEPT_(__is_nothrow_swappable<__base>::value) |
| 1777 | {__tree_.swap(__m.__tree_);} |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1778 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1779 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1780 | iterator find(const key_type& __k) {return __tree_.find(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1781 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1782 | const_iterator find(const key_type& __k) const {return __tree_.find(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1783 | #if _LIBCPP_STD_VER > 11 |
| 1784 | template <typename _K2> |
| 1785 | _LIBCPP_INLINE_VISIBILITY |
| 1786 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1787 | find(const _K2& __k) {return __tree_.find(__k);} |
| 1788 | template <typename _K2> |
| 1789 | _LIBCPP_INLINE_VISIBILITY |
| 1790 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1791 | find(const _K2& __k) const {return __tree_.find(__k);} |
| 1792 | #endif |
| 1793 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1794 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1795 | size_type count(const key_type& __k) const |
| 1796 | {return __tree_.__count_multi(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1797 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1798 | iterator lower_bound(const key_type& __k) |
| 1799 | {return __tree_.lower_bound(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1800 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1801 | const_iterator lower_bound(const key_type& __k) const |
| 1802 | {return __tree_.lower_bound(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1803 | #if _LIBCPP_STD_VER > 11 |
| 1804 | template <typename _K2> |
| 1805 | _LIBCPP_INLINE_VISIBILITY |
| 1806 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1807 | lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} |
| 1808 | |
| 1809 | template <typename _K2> |
| 1810 | _LIBCPP_INLINE_VISIBILITY |
| 1811 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1812 | lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);} |
| 1813 | #endif |
| 1814 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1815 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1816 | iterator upper_bound(const key_type& __k) |
| 1817 | {return __tree_.upper_bound(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1818 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1819 | const_iterator upper_bound(const key_type& __k) const |
| 1820 | {return __tree_.upper_bound(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1821 | #if _LIBCPP_STD_VER > 11 |
| 1822 | template <typename _K2> |
| 1823 | _LIBCPP_INLINE_VISIBILITY |
| 1824 | typename enable_if<__is_transparent<_Compare, _K2>::value,iterator>::type |
| 1825 | upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);} |
| 1826 | template <typename _K2> |
| 1827 | _LIBCPP_INLINE_VISIBILITY |
| 1828 | typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type |
| 1829 | upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);} |
| 1830 | #endif |
| 1831 | |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1832 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1833 | pair<iterator,iterator> equal_range(const key_type& __k) |
| 1834 | {return __tree_.__equal_range_multi(__k);} |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1835 | _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1836 | pair<const_iterator,const_iterator> equal_range(const key_type& __k) const |
| 1837 | {return __tree_.__equal_range_multi(__k);} |
Marshall Clow | ebb5732 | 2013-08-13 22:18:47 +0000 | [diff] [blame] | 1838 | #if _LIBCPP_STD_VER > 11 |
| 1839 | template <typename _K2> |
| 1840 | _LIBCPP_INLINE_VISIBILITY |
| 1841 | typename enable_if<__is_transparent<_Compare, _K2>::value,pair<iterator,iterator>>::type |
| 1842 | equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);} |
| 1843 | template <typename _K2> |
| 1844 | _LIBCPP_INLINE_VISIBILITY |
| 1845 | typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::type |
| 1846 | equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);} |
| 1847 | #endif |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1848 | |
| 1849 | private: |
| 1850 | typedef typename __base::__node __node; |
| 1851 | typedef typename __base::__node_allocator __node_allocator; |
| 1852 | typedef typename __base::__node_pointer __node_pointer; |
| 1853 | typedef typename __base::__node_const_pointer __node_const_pointer; |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1854 | typedef __map_node_destructor<__node_allocator> _Dp; |
| 1855 | typedef unique_ptr<__node, _Dp> __node_holder; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1856 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1857 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1858 | __node_holder __construct_node(); |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1859 | template <class _A0> |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1860 | __node_holder |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1861 | __construct_node(_A0&& __a0); |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1862 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1863 | template <class _A0, class _A1, class ..._Args> |
| 1864 | __node_holder __construct_node(_A0&& __a0, _A1&& __a1, _Args&& ...__args); |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1865 | #endif // _LIBCPP_HAS_NO_VARIADICS |
| 1866 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1867 | }; |
| 1868 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1869 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1870 | |
| 1871 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1872 | multimap<_Key, _Tp, _Compare, _Allocator>::multimap(multimap&& __m, const allocator_type& __a) |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1873 | : __tree_(_VSTD::move(__m.__tree_), __a) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1874 | { |
| 1875 | if (__a != __m.get_allocator()) |
| 1876 | { |
| 1877 | const_iterator __e = cend(); |
| 1878 | while (!__m.empty()) |
| 1879 | __tree_.__insert_multi(__e.__i_, |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1880 | _VSTD::move(__m.__tree_.remove(__m.begin().__i_)->__value_)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1881 | } |
| 1882 | } |
| 1883 | |
| 1884 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1885 | typename multimap<_Key, _Tp, _Compare, _Allocator>::__node_holder |
| 1886 | multimap<_Key, _Tp, _Compare, _Allocator>::__construct_node() |
| 1887 | { |
| 1888 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1889 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1890 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1891 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | 2d0046b | 2013-06-19 21:29:40 +0000 | [diff] [blame] | 1892 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1893 | __h.get_deleter().__second_constructed = true; |
| 1894 | return __h; |
| 1895 | } |
| 1896 | |
| 1897 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1898 | template <class _A0> |
Howard Hinnant | ac7e748 | 2013-07-04 20:59:16 +0000 | [diff] [blame] | 1899 | typename multimap<_Key, _Tp, _Compare, _Allocator>::__node_holder |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1900 | multimap<_Key, _Tp, _Compare, _Allocator>::__construct_node(_A0&& __a0) |
| 1901 | { |
| 1902 | __node_allocator& __na = __tree_.__node_alloc(); |
Howard Hinnant | c834c51 | 2011-11-29 18:15:50 +0000 | [diff] [blame] | 1903 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1904 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_), _VSTD::forward<_A0>(__a0)); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1905 | __h.get_deleter().__first_constructed = true; |
| 1906 | __h.get_deleter().__second_constructed = true; |
| 1907 | return __h; |
| 1908 | } |
| 1909 | |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1910 | #ifndef _LIBCPP_HAS_NO_VARIADICS |
| 1911 | |
| 1912 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
| 1913 | template <class _A0, class _A1, class ..._Args> |
| 1914 | typename multimap<_Key, _Tp, _Compare, _Allocator>::__node_holder |
| 1915 | multimap<_Key, _Tp, _Compare, _Allocator>::__construct_node(_A0&& __a0, _A1&& __a1, _Args&& ...__args) |
| 1916 | { |
| 1917 | __node_allocator& __na = __tree_.__node_alloc(); |
| 1918 | __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); |
| 1919 | __node_traits::construct(__na, _VSTD::addressof(__h->__value_), |
| 1920 | _VSTD::forward<_A0>(__a0), _VSTD::forward<_A1>(__a1), |
| 1921 | _VSTD::forward<_Args>(__args)...); |
| 1922 | __h.get_deleter().__first_constructed = true; |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1923 | __h.get_deleter().__second_constructed = true; |
| 1924 | return __h; |
| 1925 | } |
| 1926 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1927 | #endif // _LIBCPP_HAS_NO_VARIADICS |
| 1928 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1929 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1930 | #if !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1931 | |
| 1932 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1933 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1934 | typename multimap<_Key, _Tp, _Compare, _Allocator>::iterator |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1935 | multimap<_Key, _Tp, _Compare, _Allocator>::emplace(_Args&& ...__args) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1936 | { |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1937 | __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1938 | iterator __r = __tree_.__node_insert_multi(__h.get()); |
| 1939 | __h.release(); |
| 1940 | return __r; |
| 1941 | } |
| 1942 | |
| 1943 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1944 | template <class ..._Args> |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1945 | typename multimap<_Key, _Tp, _Compare, _Allocator>::iterator |
| 1946 | multimap<_Key, _Tp, _Compare, _Allocator>::emplace_hint(const_iterator __p, |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1947 | _Args&& ...__args) |
| 1948 | { |
Howard Hinnant | 29eb9b8 | 2012-05-25 22:04:21 +0000 | [diff] [blame] | 1949 | __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1950 | iterator __r = __tree_.__node_insert_multi(__p.__i_, __h.get()); |
| 1951 | __h.release(); |
| 1952 | return __r; |
| 1953 | } |
| 1954 | |
Howard Hinnant | 74279a5 | 2010-09-04 23:28:19 +0000 | [diff] [blame] | 1955 | #endif // !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES) && !defined(_LIBCPP_HAS_NO_VARIADICS) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1956 | |
| 1957 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1958 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1959 | bool |
| 1960 | operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1961 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1962 | { |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1963 | return __x.size() == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1964 | } |
| 1965 | |
| 1966 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1967 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1968 | bool |
| 1969 | operator< (const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1970 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1971 | { |
Howard Hinnant | b1ad5a8 | 2011-06-30 21:18:19 +0000 | [diff] [blame] | 1972 | return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1973 | } |
| 1974 | |
| 1975 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1976 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1977 | bool |
| 1978 | operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1979 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1980 | { |
| 1981 | return !(__x == __y); |
| 1982 | } |
| 1983 | |
| 1984 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1985 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1986 | bool |
| 1987 | operator> (const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1988 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1989 | { |
| 1990 | return __y < __x; |
| 1991 | } |
| 1992 | |
| 1993 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 1994 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1995 | bool |
| 1996 | operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 1997 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 1998 | { |
| 1999 | return !(__x < __y); |
| 2000 | } |
| 2001 | |
| 2002 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 2003 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 2004 | bool |
| 2005 | operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 2006 | const multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
| 2007 | { |
| 2008 | return !(__y < __x); |
| 2009 | } |
| 2010 | |
| 2011 | template <class _Key, class _Tp, class _Compare, class _Allocator> |
Howard Hinnant | 756c69b | 2010-09-22 16:48:34 +0000 | [diff] [blame] | 2012 | inline _LIBCPP_INLINE_VISIBILITY |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 2013 | void |
| 2014 | swap(multimap<_Key, _Tp, _Compare, _Allocator>& __x, |
| 2015 | multimap<_Key, _Tp, _Compare, _Allocator>& __y) |
Howard Hinnant | 2f1ea9c | 2011-06-04 14:31:57 +0000 | [diff] [blame] | 2016 | _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) |
Howard Hinnant | c51e102 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 2017 | { |
| 2018 | __x.swap(__y); |
| 2019 | } |
| 2020 | |
| 2021 | _LIBCPP_END_NAMESPACE_STD |
| 2022 | |
| 2023 | #endif // _LIBCPP_MAP |