From 3ad39e9878310e5317ee73c9b353c1e2c1c5c4ee Mon Sep 17 00:00:00 2001 From: Richard Qin Date: Sat, 11 Jul 2026 22:48:30 +0800 Subject: lib: establish Zircon libc++ and KTL foundation --- third_party/libcxx/include/c++/v1/map | 2183 +++++++++++++++++++++++++++++++++ 1 file changed, 2183 insertions(+) create mode 100644 third_party/libcxx/include/c++/v1/map (limited to 'third_party/libcxx/include/c++/v1/map') diff --git a/third_party/libcxx/include/c++/v1/map b/third_party/libcxx/include/c++/v1/map new file mode 100644 index 0000000..b7031ae --- /dev/null +++ b/third_party/libcxx/include/c++/v1/map @@ -0,0 +1,2183 @@ +// -*- C++ -*- +//===----------------------------------------------------------------------===// +// +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception +// +//===----------------------------------------------------------------------===// + +#ifndef _LIBCPP_MAP +#define _LIBCPP_MAP + +/* + + map synopsis + +namespace std +{ + +template , + class Allocator = allocator>> +class map +{ +public: + // types: + typedef Key key_type; + typedef T mapped_type; + typedef pair value_type; + typedef Compare key_compare; + typedef Allocator allocator_type; + typedef typename allocator_type::reference reference; + typedef typename allocator_type::const_reference const_reference; + typedef typename allocator_type::pointer pointer; + typedef typename allocator_type::const_pointer const_pointer; + typedef typename allocator_type::size_type size_type; + typedef typename allocator_type::difference_type difference_type; + + typedef implementation-defined iterator; + typedef implementation-defined const_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef unspecified node_type; // C++17 + typedef INSERT_RETURN_TYPE insert_return_type; // C++17 + + class value_compare + { + friend class map; + protected: + key_compare comp; + + value_compare(key_compare c); + public: + typedef bool result_type; // deprecated in C++17, removed in C++20 + typedef value_type first_argument_type; // deprecated in C++17, removed in C++20 + typedef value_type second_argument_type; // deprecated in C++17, removed in C++20 + bool operator()(const value_type& x, const value_type& y) const; + }; + + // construct/copy/destroy: + map() + noexcept( + is_nothrow_default_constructible::value && + is_nothrow_default_constructible::value && + is_nothrow_copy_constructible::value); + explicit map(const key_compare& comp); + map(const key_compare& comp, const allocator_type& a); + template + map(InputIterator first, InputIterator last, + const key_compare& comp = key_compare()); + template + map(InputIterator first, InputIterator last, + const key_compare& comp, const allocator_type& a); + template R> + map(from_range_t, R&& rg, const Compare& comp = Compare(), const Allocator& = Allocator()); // C++23 + map(const map& m); + map(map&& m) + noexcept( + is_nothrow_move_constructible::value && + is_nothrow_move_constructible::value); + explicit map(const allocator_type& a); + map(const map& m, const allocator_type& a); + map(map&& m, const allocator_type& a); + map(initializer_list il, const key_compare& comp = key_compare()); + map(initializer_list il, const key_compare& comp, const allocator_type& a); + template + map(InputIterator first, InputIterator last, const allocator_type& a) + : map(first, last, Compare(), a) {} // C++14 + template R> + map(from_range_t, R&& rg, const Allocator& a)) + : map(from_range, std::forward(rg), Compare(), a) { } // C++23 + map(initializer_list il, const allocator_type& a) + : map(il, Compare(), a) {} // C++14 + ~map(); + + map& operator=(const map& m); + map& operator=(map&& m) + noexcept( + allocator_type::propagate_on_container_move_assignment::value && + is_nothrow_move_assignable::value && + is_nothrow_move_assignable::value); + map& operator=(initializer_list il); + + // iterators: + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + + // capacity: + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + + // element access: + mapped_type& operator[](const key_type& k); + mapped_type& operator[](key_type&& k); + + mapped_type& at(const key_type& k); + const mapped_type& at(const key_type& k) const; + + // modifiers: + template + pair emplace(Args&&... args); + template + iterator emplace_hint(const_iterator position, Args&&... args); + pair insert(const value_type& v); + pair insert( value_type&& v); // C++17 + template + pair insert(P&& p); + iterator insert(const_iterator position, const value_type& v); + iterator insert(const_iterator position, value_type&& v); // C++17 + template + iterator insert(const_iterator position, P&& p); + template + void insert(InputIterator first, InputIterator last); + template R> + void insert_range(R&& rg); // C++23 + void insert(initializer_list il); + + node_type extract(const_iterator position); // C++17 + node_type extract(const key_type& x); // C++17 + insert_return_type insert(node_type&& nh); // C++17 + iterator insert(const_iterator hint, node_type&& nh); // C++17 + + template + pair try_emplace(const key_type& k, Args&&... args); // C++17 + template + pair try_emplace(key_type&& k, Args&&... args); // C++17 + template + iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); // C++17 + template + iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); // C++17 + template + pair insert_or_assign(const key_type& k, M&& obj); // C++17 + template + pair insert_or_assign(key_type&& k, M&& obj); // C++17 + template + iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); // C++17 + template + iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); // C++17 + + iterator erase(const_iterator position); + iterator erase(iterator position); // C++14 + size_type erase(const key_type& k); + iterator erase(const_iterator first, const_iterator last); + void clear() noexcept; + + template + void merge(map& source); // C++17 + template + void merge(map&& source); // C++17 + template + void merge(multimap& source); // C++17 + template + void merge(multimap&& source); // C++17 + + void swap(map& m) + noexcept(allocator_traits::is_always_equal::value && + is_nothrow_swappable::value); // C++17 + + // observers: + allocator_type get_allocator() const noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + + // map operations: + iterator find(const key_type& k); + const_iterator find(const key_type& k) const; + template + iterator find(const K& x); // C++14 + template + const_iterator find(const K& x) const; // C++14 + + template + size_type count(const K& x) const; // C++14 + size_type count(const key_type& k) const; + + bool contains(const key_type& x) const; // C++20 + template bool contains(const K& x) const; // C++20 + + iterator lower_bound(const key_type& k); + const_iterator lower_bound(const key_type& k) const; + template + iterator lower_bound(const K& x); // C++14 + template + const_iterator lower_bound(const K& x) const; // C++14 + + iterator upper_bound(const key_type& k); + const_iterator upper_bound(const key_type& k) const; + template + iterator upper_bound(const K& x); // C++14 + template + const_iterator upper_bound(const K& x) const; // C++14 + + pair equal_range(const key_type& k); + pair equal_range(const key_type& k) const; + template + pair equal_range(const K& x); // C++14 + template + pair equal_range(const K& x) const; // C++14 +}; + +template >, + class Allocator = allocator>> +map(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator()) + -> map, iter_val_t, Compare, Allocator>; // C++17 + +template, + class Allocator = allocator>> + map(from_range_t, R&&, Compare = Compare(), Allocator = Allocator()) + -> map, range-mapped-type, Compare, Allocator>; // C++23 + +template, + class Allocator = allocator>> +map(initializer_list>, Compare = Compare(), Allocator = Allocator()) + -> map; // C++17 + +template +map(InputIterator, InputIterator, Allocator) + -> map, iter_val_t, less>, + Allocator>; // C++17 + +template + map(from_range_t, R&&, Allocator) + -> map, range-mapped-type, less>, Allocator>; // C++23 + +template +map(initializer_list>, Allocator) -> map, Allocator>; // C++17 + +template +bool +operator==(const map& x, + const map& y); + +template +bool +operator< (const map& x, + const map& y); // removed in C++20 + +template +bool +operator!=(const map& x, + const map& y); // removed in C++20 + +template +bool +operator> (const map& x, + const map& y); // removed in C++20 + +template +bool +operator>=(const map& x, + const map& y); // removed in C++20 + +template +bool +operator<=(const map& x, + const map& y); // removed in C++20 + +template + synth-three-way-result> + operator<=>(const map& x, + const map& y); // since C++20 + +// specialized algorithms: +template +void +swap(map& x, map& y) + noexcept(noexcept(x.swap(y))); + +template +typename map::size_type +erase_if(map& c, Predicate pred); // C++20 + + +template , + class Allocator = allocator>> +class multimap +{ +public: + // types: + typedef Key key_type; + typedef T mapped_type; + typedef pair value_type; + typedef Compare key_compare; + typedef Allocator allocator_type; + typedef typename allocator_type::reference reference; + typedef typename allocator_type::const_reference const_reference; + typedef typename allocator_type::size_type size_type; + typedef typename allocator_type::difference_type difference_type; + typedef typename allocator_type::pointer pointer; + typedef typename allocator_type::const_pointer const_pointer; + + typedef implementation-defined iterator; + typedef implementation-defined const_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + typedef unspecified node_type; // C++17 + + class value_compare + { + friend class multimap; + protected: + key_compare comp; + value_compare(key_compare c); + public: + typedef bool result_type; // deprecated in C++17, removed in C++20 + typedef value_type first_argument_type; // deprecated in C++17, removed in C++20 + typedef value_type second_argument_type; // deprecated in C++17, removed in C++20 + bool operator()(const value_type& x, const value_type& y) const; + }; + + // construct/copy/destroy: + multimap() + noexcept( + is_nothrow_default_constructible::value && + is_nothrow_default_constructible::value && + is_nothrow_copy_constructible::value); + explicit multimap(const key_compare& comp); + multimap(const key_compare& comp, const allocator_type& a); + template + multimap(InputIterator first, InputIterator last, const key_compare& comp); + template + multimap(InputIterator first, InputIterator last, const key_compare& comp, + const allocator_type& a); + template R> + multimap(from_range_t, R&& rg, + const Compare& comp = Compare(), const Allocator& = Allocator()); // C++23 + multimap(const multimap& m); + multimap(multimap&& m) + noexcept( + is_nothrow_move_constructible::value && + is_nothrow_move_constructible::value); + explicit multimap(const allocator_type& a); + multimap(const multimap& m, const allocator_type& a); + multimap(multimap&& m, const allocator_type& a); + multimap(initializer_list il, const key_compare& comp = key_compare()); + multimap(initializer_list il, const key_compare& comp, + const allocator_type& a); + template + multimap(InputIterator first, InputIterator last, const allocator_type& a) + : multimap(first, last, Compare(), a) {} // C++14 + template R> + multimap(from_range_t, R&& rg, const Allocator& a)) + : multimap(from_range, std::forward(rg), Compare(), a) { } // C++23 + multimap(initializer_list il, const allocator_type& a) + : multimap(il, Compare(), a) {} // C++14 + ~multimap(); + + multimap& operator=(const multimap& m); + multimap& operator=(multimap&& m) + noexcept( + allocator_type::propagate_on_container_move_assignment::value && + is_nothrow_move_assignable::value && + is_nothrow_move_assignable::value); + multimap& operator=(initializer_list il); + + // iterators: + iterator begin() noexcept; + const_iterator begin() const noexcept; + iterator end() noexcept; + const_iterator end() const noexcept; + + reverse_iterator rbegin() noexcept; + const_reverse_iterator rbegin() const noexcept; + reverse_iterator rend() noexcept; + const_reverse_iterator rend() const noexcept; + + const_iterator cbegin() const noexcept; + const_iterator cend() const noexcept; + const_reverse_iterator crbegin() const noexcept; + const_reverse_iterator crend() const noexcept; + + // capacity: + bool empty() const noexcept; + size_type size() const noexcept; + size_type max_size() const noexcept; + + // modifiers: + template + iterator emplace(Args&&... args); + template + iterator emplace_hint(const_iterator position, Args&&... args); + iterator insert(const value_type& v); + iterator insert( value_type&& v); // C++17 + template + iterator insert(P&& p); + iterator insert(const_iterator position, const value_type& v); + iterator insert(const_iterator position, value_type&& v); // C++17 + template + iterator insert(const_iterator position, P&& p); + template + void insert(InputIterator first, InputIterator last); + template R> + void insert_range(R&& rg); // C++23 + void insert(initializer_list il); + + node_type extract(const_iterator position); // C++17 + node_type extract(const key_type& x); // C++17 + iterator insert(node_type&& nh); // C++17 + iterator insert(const_iterator hint, node_type&& nh); // C++17 + + iterator erase(const_iterator position); + iterator erase(iterator position); // C++14 + size_type erase(const key_type& k); + iterator erase(const_iterator first, const_iterator last); + void clear() noexcept; + + template + void merge(multimap& source); // C++17 + template + void merge(multimap&& source); // C++17 + template + void merge(map& source); // C++17 + template + void merge(map&& source); // C++17 + + void swap(multimap& m) + noexcept(allocator_traits::is_always_equal::value && + is_nothrow_swappable::value); // C++17 + + // observers: + allocator_type get_allocator() const noexcept; + key_compare key_comp() const; + value_compare value_comp() const; + + // map operations: + iterator find(const key_type& k); + const_iterator find(const key_type& k) const; + template + iterator find(const K& x); // C++14 + template + const_iterator find(const K& x) const; // C++14 + + template + size_type count(const K& x) const; // C++14 + size_type count(const key_type& k) const; + + bool contains(const key_type& x) const; // C++20 + template bool contains(const K& x) const; // C++20 + + iterator lower_bound(const key_type& k); + const_iterator lower_bound(const key_type& k) const; + template + iterator lower_bound(const K& x); // C++14 + template + const_iterator lower_bound(const K& x) const; // C++14 + + iterator upper_bound(const key_type& k); + const_iterator upper_bound(const key_type& k) const; + template + iterator upper_bound(const K& x); // C++14 + template + const_iterator upper_bound(const K& x) const; // C++14 + + pair equal_range(const key_type& k); + pair equal_range(const key_type& k) const; + template + pair equal_range(const K& x); // C++14 + template + pair equal_range(const K& x) const; // C++14 +}; + +template >, + class Allocator = allocator>> +multimap(InputIterator, InputIterator, Compare = Compare(), Allocator = Allocator()) + -> multimap, iter_val_t, Compare, Allocator>; // C++17 + +template>, + class Allocator = allocator>> + multimap(from_range_t, R&&, Compare = Compare(), Allocator = Allocator()) + -> multimap, range-mapped-type, Compare, Allocator>; // C++23 + +template, + class Allocator = allocator>> +multimap(initializer_list>, Compare = Compare(), Allocator = Allocator()) + -> multimap; // C++17 + +template +multimap(InputIterator, InputIterator, Allocator) + -> multimap, iter_val_t, + less>, Allocator>; // C++17 + +template + multimap(from_range_t, R&&, Allocator) + -> multimap, range-mapped-type, less>, Allocator>; // C++23 + +template +multimap(initializer_list>, Allocator) + -> multimap, Allocator>; // C++17 + +template +bool +operator==(const multimap& x, + const multimap& y); + +template +bool +operator< (const multimap& x, + const multimap& y); // removed in C++20 + +template +bool +operator!=(const multimap& x, + const multimap& y); // removed in C++20 + +template +bool +operator> (const multimap& x, + const multimap& y); // removed in C++20 + +template +bool +operator>=(const multimap& x, + const multimap& y); // removed in C++20 + +template +bool +operator<=(const multimap& x, + const multimap& y); // removed in C++20 + +template + synth-three-way-result> + operator<=>(const multimap& x, + const multimap& y); // since c++20 + +// specialized algorithms: +template +void +swap(multimap& x, + multimap& y) + noexcept(noexcept(x.swap(y))); + +template +typename multimap::size_type +erase_if(multimap& c, Predicate pred); // C++20 + +} // std + +*/ + +#if __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) +# include <__cxx03/map> +#else +# include <__algorithm/equal.h> +# include <__algorithm/lexicographical_compare.h> +# include <__algorithm/lexicographical_compare_three_way.h> +# include <__algorithm/specialized_algorithms.h> +# include <__assert> +# include <__config> +# include <__functional/binary_function.h> +# include <__functional/is_transparent.h> +# include <__functional/operations.h> +# include <__iterator/erase_if_container.h> +# include <__iterator/iterator_traits.h> +# include <__iterator/ranges_iterator_traits.h> +# include <__iterator/reverse_iterator.h> +# include <__memory/addressof.h> +# include <__memory/allocator.h> +# include <__memory/allocator_traits.h> +# include <__memory/compressed_pair.h> +# include <__memory/pointer_traits.h> +# include <__memory/unique_ptr.h> +# include <__memory_resource/polymorphic_allocator.h> +# include <__node_handle> +# include <__ranges/access.h> +# include <__ranges/concepts.h> +# include <__ranges/container_compatible_range.h> +# include <__ranges/from_range.h> +# include <__tree> +# include <__type_traits/container_traits.h> +# include <__type_traits/is_allocator.h> +# include <__type_traits/make_transparent.h> +# include <__type_traits/remove_const.h> +# include <__type_traits/type_identity.h> +# include <__utility/forward.h> +# include <__utility/lazy_synth_three_way_comparator.h> +# include <__utility/pair.h> +# include <__utility/piecewise_construct.h> +# include <__utility/swap.h> +# include +# include +# include + +// standard-mandated includes + +// [iterator.range] +# include <__iterator/access.h> +# include <__iterator/data.h> +# include <__iterator/empty.h> +# include <__iterator/reverse_access.h> +# include <__iterator/size.h> + +// [associative.map.syn] +# include +# include + +# if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) +# pragma GCC system_header +# endif + +_LIBCPP_PUSH_MACROS +# include <__undef_macros> + +_LIBCPP_BEGIN_NAMESPACE_STD + +template +class __map_value_compare { + _LIBCPP_COMPRESSED_ELEMENT(_Compare, __comp_); + +public: + _LIBCPP_HIDE_FROM_ABI __map_value_compare() _NOEXCEPT_(is_nothrow_default_constructible<_Compare>::value) + : __comp_() {} + _LIBCPP_HIDE_FROM_ABI __map_value_compare(_Compare __c) _NOEXCEPT_(is_nothrow_copy_constructible<_Compare>::value) + : __comp_(__c) {} + _LIBCPP_HIDE_FROM_ABI const _Compare& key_comp() const _NOEXCEPT { return __comp_; } + + _LIBCPP_HIDE_FROM_ABI bool operator()(const _CP& __x, const _CP& __y) const { return __comp_(__x.first, __y.first); } + _LIBCPP_HIDE_FROM_ABI bool operator()(const _CP& __x, const _Key& __y) const { return __comp_(__x.first, __y); } + _LIBCPP_HIDE_FROM_ABI bool operator()(const _Key& __x, const _CP& __y) const { return __comp_(__x, __y.first); } + _LIBCPP_HIDE_FROM_ABI void swap(__map_value_compare& __y) _NOEXCEPT_(__is_nothrow_swappable_v<_Compare>) { + using std::swap; + swap(__comp_, __y.__comp_); + } + +# if _LIBCPP_STD_VER >= 14 + template + _LIBCPP_HIDE_FROM_ABI bool operator()(const _K2& __x, const _CP& __y) const { + return __comp_(__x, __y.first); + } + + template + _LIBCPP_HIDE_FROM_ABI bool operator()(const _CP& __x, const _K2& __y) const { + return __comp_(__x.first, __y); + } +# endif +}; + +template +struct __make_transparent<_Key, __map_value_compare<_Key, _MapValueT, _Compare> > { + using type _LIBCPP_NODEBUG = __map_value_compare<_Key, _MapValueT, __make_transparent_t<_Key, _Compare> >; +}; + +# if _LIBCPP_STD_VER >= 14 +template +struct __lazy_synth_three_way_comparator<__map_value_compare<_Key, _MapValueT, _Compare>, _MapValueT, _MapValueT> { + __lazy_synth_three_way_comparator<_Compare, _Key, _Key> __comp_; + + __lazy_synth_three_way_comparator( + _LIBCPP_CTOR_LIFETIMEBOUND const __map_value_compare<_Key, _MapValueT, _Compare>& __comp) + : __comp_(__comp.key_comp()) {} + + _LIBCPP_HIDE_FROM_ABI auto + operator()(_LIBCPP_LIFETIMEBOUND const _MapValueT& __lhs, _LIBCPP_LIFETIMEBOUND const _MapValueT& __rhs) const { + return __comp_(__lhs.first, __rhs.first); + } +}; + +template +struct __lazy_synth_three_way_comparator<__map_value_compare<_Key, _MapValueT, _Compare>, _TransparentKey, _MapValueT> { + __lazy_synth_three_way_comparator<_Compare, _TransparentKey, _Key> __comp_; + + __lazy_synth_three_way_comparator( + _LIBCPP_CTOR_LIFETIMEBOUND const __map_value_compare<_Key, _MapValueT, _Compare>& __comp) + : __comp_(__comp.key_comp()) {} + + _LIBCPP_HIDE_FROM_ABI auto + operator()(_LIBCPP_LIFETIMEBOUND const _TransparentKey& __lhs, _LIBCPP_LIFETIMEBOUND const _MapValueT& __rhs) const { + return __comp_(__lhs, __rhs.first); + } +}; + +template +struct __lazy_synth_three_way_comparator<__map_value_compare<_Key, _MapValueT, _Compare>, _MapValueT, _TransparentKey> { + __lazy_synth_three_way_comparator<_Compare, _Key, _TransparentKey> __comp_; + + __lazy_synth_three_way_comparator( + _LIBCPP_CTOR_LIFETIMEBOUND const __map_value_compare<_Key, _MapValueT, _Compare>& __comp) + : __comp_(__comp.key_comp()) {} + + _LIBCPP_HIDE_FROM_ABI auto + operator()(_LIBCPP_LIFETIMEBOUND const _MapValueT& __lhs, _LIBCPP_LIFETIMEBOUND const _TransparentKey& __rhs) const { + return __comp_(__lhs.first, __rhs); + } +}; +# endif // _LIBCPP_STD_VER >= 14 + +template +inline _LIBCPP_HIDE_FROM_ABI void +swap(__map_value_compare<_Key, _CP, _Compare>& __x, __map_value_compare<_Key, _CP, _Compare>& __y) + _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +template +class __map_node_destructor { + typedef _Allocator allocator_type; + typedef allocator_traits __alloc_traits; + +public: + typedef typename __alloc_traits::pointer pointer; + +private: + allocator_type& __na_; + +public: + bool __first_constructed; + bool __second_constructed; + + _LIBCPP_HIDE_FROM_ABI explicit __map_node_destructor(allocator_type& __na) _NOEXCEPT + : __na_(__na), + __first_constructed(false), + __second_constructed(false) {} + +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI __map_node_destructor(__tree_node_destructor&& __x) _NOEXCEPT + : __na_(__x.__na_), + __first_constructed(__x.__value_constructed), + __second_constructed(__x.__value_constructed) { + __x.__value_constructed = false; + } +# endif // _LIBCPP_CXX03_LANG + + __map_node_destructor& operator=(const __map_node_destructor&) = delete; + + _LIBCPP_HIDE_FROM_ABI void operator()(pointer __p) _NOEXCEPT { + if (__second_constructed) + __alloc_traits::destroy(__na_, std::addressof(__p->__get_value().second)); + if (__first_constructed) + __alloc_traits::destroy(__na_, std::addressof(__p->__get_value().first)); + if (__p) + __alloc_traits::deallocate(__na_, __p, 1); + } +}; + +template +struct __value_type; + +template +class __map_iterator { + _TreeIterator __i_; + +public: + using iterator_category = bidirectional_iterator_tag; + using value_type = typename _TreeIterator::value_type; + using difference_type = typename _TreeIterator::difference_type; + using reference = value_type&; + using pointer = typename _TreeIterator::pointer; + + _LIBCPP_HIDE_FROM_ABI __map_iterator() _NOEXCEPT {} + + _LIBCPP_HIDE_FROM_ABI __map_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {} + + _LIBCPP_HIDE_FROM_ABI reference operator*() const { return *__i_; } + _LIBCPP_HIDE_FROM_ABI pointer operator->() const { return pointer_traits::pointer_to(*__i_); } + + _LIBCPP_HIDE_FROM_ABI __map_iterator& operator++() { + ++__i_; + return *this; + } + _LIBCPP_HIDE_FROM_ABI __map_iterator operator++(int) { + __map_iterator __t(*this); + ++(*this); + return __t; + } + + _LIBCPP_HIDE_FROM_ABI __map_iterator& operator--() { + --__i_; + return *this; + } + _LIBCPP_HIDE_FROM_ABI __map_iterator operator--(int) { + __map_iterator __t(*this); + --(*this); + return __t; + } + + friend _LIBCPP_HIDE_FROM_ABI bool operator==(const __map_iterator& __x, const __map_iterator& __y) { + return __x.__i_ == __y.__i_; + } + friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const __map_iterator& __x, const __map_iterator& __y) { + return __x.__i_ != __y.__i_; + } + + template + friend class map; + template + friend class multimap; + template + friend class __map_const_iterator; + + template + friend struct __specialized_algorithm; +}; + +# ifndef _LIBCPP_CXX03_LANG +template +struct __specialized_algorithm<_Alg, __iterator_pair<__map_iterator<_TreeIterator>, __map_iterator<_TreeIterator>>> { + using __base _LIBCPP_NODEBUG = __specialized_algorithm<_Alg, __iterator_pair<_TreeIterator, _TreeIterator>>; + + static const bool __has_algorithm = __base::__has_algorithm; + + using __iterator _LIBCPP_NODEBUG = __map_iterator<_TreeIterator>; + + template + _LIBCPP_HIDE_FROM_ABI static void operator()(__iterator __first, __iterator __last, _Args&&... __args) { + __base()(__first.__i_, __last.__i_, std::forward<_Args>(__args)...); + } +}; +# endif + +template +class __map_const_iterator { + _TreeIterator __i_; + +public: + using iterator_category = bidirectional_iterator_tag; + using value_type = typename _TreeIterator::value_type; + using difference_type = typename _TreeIterator::difference_type; + using reference = const value_type&; + using pointer = typename _TreeIterator::pointer; + + _LIBCPP_HIDE_FROM_ABI __map_const_iterator() _NOEXCEPT {} + + _LIBCPP_HIDE_FROM_ABI __map_const_iterator(_TreeIterator __i) _NOEXCEPT : __i_(__i) {} + _LIBCPP_HIDE_FROM_ABI + __map_const_iterator(__map_iterator< typename _TreeIterator::__non_const_iterator> __i) _NOEXCEPT : __i_(__i.__i_) {} + + _LIBCPP_HIDE_FROM_ABI reference operator*() const { return *__i_; } + _LIBCPP_HIDE_FROM_ABI pointer operator->() const { return pointer_traits::pointer_to(*__i_); } + + _LIBCPP_HIDE_FROM_ABI __map_const_iterator& operator++() { + ++__i_; + return *this; + } + _LIBCPP_HIDE_FROM_ABI __map_const_iterator operator++(int) { + __map_const_iterator __t(*this); + ++(*this); + return __t; + } + + _LIBCPP_HIDE_FROM_ABI __map_const_iterator& operator--() { + --__i_; + return *this; + } + _LIBCPP_HIDE_FROM_ABI __map_const_iterator operator--(int) { + __map_const_iterator __t(*this); + --(*this); + return __t; + } + + friend _LIBCPP_HIDE_FROM_ABI bool operator==(const __map_const_iterator& __x, const __map_const_iterator& __y) { + return __x.__i_ == __y.__i_; + } + friend _LIBCPP_HIDE_FROM_ABI bool operator!=(const __map_const_iterator& __x, const __map_const_iterator& __y) { + return __x.__i_ != __y.__i_; + } + + template + friend class map; + template + friend class multimap; + template + friend class __tree_const_iterator; + + template + friend struct __specialized_algorithm; +}; + +# ifndef _LIBCPP_CXX03_LANG +template +struct __specialized_algorithm< + _Alg, + __iterator_pair<__map_const_iterator<_TreeIterator>, __map_const_iterator<_TreeIterator>>> { + using __base _LIBCPP_NODEBUG = __specialized_algorithm<_Alg, __iterator_pair<_TreeIterator, _TreeIterator>>; + + static const bool __has_algorithm = __base::__has_algorithm; + + using __iterator _LIBCPP_NODEBUG = __map_const_iterator<_TreeIterator>; + + template + _LIBCPP_HIDE_FROM_ABI static void operator()(__iterator __first, __iterator __last, _Args&&... __args) { + __base()(__first.__i_, __last.__i_, std::forward<_Args>(__args)...); + } +}; +# endif + +template , class _Allocator = allocator > > +class multimap; + +template , class _Allocator = allocator > > +class map { +public: + // types: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef pair value_type; + typedef __type_identity_t<_Compare> key_compare; + typedef __type_identity_t<_Allocator> allocator_type; + typedef value_type& reference; + typedef const value_type& const_reference; + + static_assert(is_same::value, + "Allocator::value_type must be same type as value_type"); + + class value_compare : public __binary_function { + friend class map; + + protected: + key_compare comp; + + _LIBCPP_HIDE_FROM_ABI value_compare(key_compare __c) : comp(__c) {} + + public: + _LIBCPP_HIDE_FROM_ABI bool operator()(const value_type& __x, const value_type& __y) const { + return comp(__x.first, __y.first); + } + }; + +private: + typedef std::__value_type __value_type; + typedef __map_value_compare __vc; + typedef __tree<__value_type, __vc, allocator_type> __base; + typedef typename __base::__node_traits __node_traits; + typedef allocator_traits __alloc_traits; + + static_assert(__check_valid_allocator::value, ""); + + __base __tree_; + +public: + typedef typename __alloc_traits::pointer pointer; + typedef typename __alloc_traits::const_pointer const_pointer; + typedef typename __alloc_traits::size_type size_type; + typedef typename __alloc_traits::difference_type difference_type; + typedef __map_iterator iterator; + typedef __map_const_iterator const_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + +# if _LIBCPP_STD_VER >= 17 + typedef __map_node_handle node_type; + typedef __insert_return_type insert_return_type; +# endif + + template + friend class map; + template + friend class multimap; + + _LIBCPP_HIDE_FROM_ABI map() _NOEXCEPT_( + is_nothrow_default_constructible::value&& is_nothrow_default_constructible::value&& + is_nothrow_copy_constructible::value) + : __tree_(__vc(key_compare())) {} + + _LIBCPP_HIDE_FROM_ABI explicit map(const key_compare& __comp) _NOEXCEPT_( + is_nothrow_default_constructible::value&& is_nothrow_copy_constructible::value) + : __tree_(__vc(__comp)) {} + + _LIBCPP_HIDE_FROM_ABI explicit map(const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {} + + template + _LIBCPP_HIDE_FROM_ABI map(_InputIterator __f, _InputIterator __l, const key_compare& __comp = key_compare()) + : __tree_(__vc(__comp)) { + insert(__f, __l); + } + + template + _LIBCPP_HIDE_FROM_ABI + map(_InputIterator __f, _InputIterator __l, const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert(__f, __l); + } + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI + map(from_range_t, + _Range&& __range, + const key_compare& __comp = key_compare(), + const allocator_type& __a = allocator_type()) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert_range(std::forward<_Range>(__range)); + } +# endif + +# if _LIBCPP_STD_VER >= 14 + template + _LIBCPP_HIDE_FROM_ABI map(_InputIterator __f, _InputIterator __l, const allocator_type& __a) + : map(__f, __l, key_compare(), __a) {} +# endif + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI map(from_range_t, _Range&& __range, const allocator_type& __a) + : map(from_range, std::forward<_Range>(__range), key_compare(), __a) {} +# endif + + _LIBCPP_HIDE_FROM_ABI map(const map& __m) = default; + + _LIBCPP_HIDE_FROM_ABI map& operator=(const map& __m) = default; + +# ifndef _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI map(map&& __m) = default; + + _LIBCPP_HIDE_FROM_ABI map(map&& __m, const allocator_type& __a) : __tree_(std::move(__m.__tree_), __a) {} + + _LIBCPP_HIDE_FROM_ABI map& operator=(map&& __m) = default; + + _LIBCPP_HIDE_FROM_ABI map(initializer_list __il, const key_compare& __comp = key_compare()) + : __tree_(__vc(__comp)) { + insert(__il.begin(), __il.end()); + } + + _LIBCPP_HIDE_FROM_ABI map(initializer_list __il, const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert(__il.begin(), __il.end()); + } + +# if _LIBCPP_STD_VER >= 14 + _LIBCPP_HIDE_FROM_ABI map(initializer_list __il, const allocator_type& __a) + : map(__il, key_compare(), __a) {} +# endif + + _LIBCPP_HIDE_FROM_ABI map& operator=(initializer_list __il) { + clear(); + insert(__il.begin(), __il.end()); + return *this; + } + +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI explicit map(const allocator_type& __a) : __tree_(typename __base::allocator_type(__a)) {} + + _LIBCPP_HIDE_FROM_ABI map(const map& __m, const allocator_type& __alloc) : __tree_(__m.__tree_, __alloc) {} + + _LIBCPP_HIDE_FROM_ABI ~map() { static_assert(sizeof(std::__diagnose_non_const_comparator<_Key, _Compare>()), ""); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return __tree_.begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return __tree_.begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { return __tree_.end(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return __tree_.end(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { + return const_reverse_iterator(end()); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { + return const_reverse_iterator(begin()); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { return __tree_.size() == 0; } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __tree_.size(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT { return __tree_.max_size(); } + + _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](const key_type& __k); +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI mapped_type& operator[](key_type&& __k); +# endif + + template >, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI mapped_type& at(_Arg&& __arg) { + auto [_, __child] = __tree_.__find_equal(__arg); + if (__child == nullptr) + std::__throw_out_of_range("map::at: key not found"); + return static_cast<__node_pointer>(__child)->__get_value().second; + } + + template >, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const mapped_type& at(_Arg&& __arg) const { + auto [_, __child] = __tree_.__find_equal(__arg); + if (__child == nullptr) + std::__throw_out_of_range("map::at: key not found"); + return static_cast<__node_pointer>(__child)->__get_value().second; + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI mapped_type& at(const key_type& __k); + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const mapped_type& at(const key_type& __k) const; + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { + return allocator_type(__tree_.__alloc()); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI key_compare key_comp() const { return __tree_.value_comp().key_comp(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI value_compare value_comp() const { + return value_compare(__tree_.value_comp().key_comp()); + } + +# ifndef _LIBCPP_CXX03_LANG + template + _LIBCPP_HIDE_FROM_ABI pair emplace(_Args&&... __args) { + return __tree_.__emplace_unique(std::forward<_Args>(__args)...); + } + + template + _LIBCPP_HIDE_FROM_ABI iterator emplace_hint(const_iterator __p, _Args&&... __args) { + return __tree_.__emplace_hint_unique(__p.__i_, std::forward<_Args>(__args)...).first; + } + + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI pair insert(_Pp&& __p) { + return __tree_.__emplace_unique(std::forward<_Pp>(__p)); + } + + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __pos, _Pp&& __p) { + return __tree_.__emplace_hint_unique(__pos.__i_, std::forward<_Pp>(__p)).first; + } + +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI pair insert(const value_type& __v) { return __tree_.__emplace_unique(__v); } + + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v) { + return __tree_.__emplace_hint_unique(__p.__i_, __v).first; + } + +# ifndef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI pair insert(value_type&& __v) { + return __tree_.__emplace_unique(std::move(__v)); + } + + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v) { + return __tree_.__emplace_hint_unique(__p.__i_, std::move(__v)).first; + } + + _LIBCPP_HIDE_FROM_ABI void insert(initializer_list __il) { insert(__il.begin(), __il.end()); } +# endif + + template + _LIBCPP_HIDE_FROM_ABI void insert(_InputIterator __first, _InputIterator __last) { + __tree_.__insert_range_unique(__first, __last); + } + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI void insert_range(_Range&& __range) { + __tree_.__insert_range_unique(ranges::begin(__range), ranges::end(__range)); + } +# endif + +# if _LIBCPP_STD_VER >= 17 + + template + _LIBCPP_HIDE_FROM_ABI pair try_emplace(const key_type& __k, _Args&&... __args) { + return __tree_.__emplace_unique( + std::piecewise_construct, std::forward_as_tuple(__k), std::forward_as_tuple(std::forward<_Args>(__args)...)); + } + + template + _LIBCPP_HIDE_FROM_ABI pair try_emplace(key_type&& __k, _Args&&... __args) { + return __tree_.__emplace_unique( + std::piecewise_construct, + std::forward_as_tuple(std::move(__k)), + std::forward_as_tuple(std::forward<_Args>(__args)...)); + } + + template + _LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args) { + return __tree_ + .__emplace_hint_unique( + __h.__i_, + std::piecewise_construct, + std::forward_as_tuple(__k), + std::forward_as_tuple(std::forward<_Args>(__args)...)) + .first; + } + + template + _LIBCPP_HIDE_FROM_ABI iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args) { + return __tree_ + .__emplace_hint_unique( + __h.__i_, + std::piecewise_construct, + std::forward_as_tuple(std::move(__k)), + std::forward_as_tuple(std::forward<_Args>(__args)...)) + .first; + } + + template + _LIBCPP_HIDE_FROM_ABI pair insert_or_assign(const key_type& __k, _Vp&& __v) { + auto __result = __tree_.__emplace_unique(__k, std::forward<_Vp>(__v)); + auto& [__iter, __inserted] = __result; + if (!__inserted) + __iter->second = std::forward<_Vp>(__v); + return __result; + } + + template + _LIBCPP_HIDE_FROM_ABI pair insert_or_assign(key_type&& __k, _Vp&& __v) { + auto __result = __tree_.__emplace_unique(std::move(__k), std::forward<_Vp>(__v)); + auto& [__iter, __inserted] = __result; + if (!__inserted) + __iter->second = std::forward<_Vp>(__v); + return __result; + } + + template + _LIBCPP_HIDE_FROM_ABI iterator insert_or_assign(const_iterator __h, const key_type& __k, _Vp&& __v) { + auto [__r, __inserted] = __tree_.__emplace_hint_unique(__h.__i_, __k, std::forward<_Vp>(__v)); + + if (!__inserted) + __r->second = std::forward<_Vp>(__v); + + return __r; + } + + template + _LIBCPP_HIDE_FROM_ABI iterator insert_or_assign(const_iterator __h, key_type&& __k, _Vp&& __v) { + auto [__r, __inserted] = __tree_.__emplace_hint_unique(__h.__i_, std::move(__k), std::forward<_Vp>(__v)); + + if (!__inserted) + __r->second = std::forward<_Vp>(__v); + + return __r; + } + +# endif // _LIBCPP_STD_VER >= 17 + + _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p) { return __tree_.erase(__p.__i_); } + _LIBCPP_HIDE_FROM_ABI iterator erase(iterator __p) { return __tree_.erase(__p.__i_); } + _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_unique(__k); } + _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l) { + return __tree_.erase(__f.__i_, __l.__i_); + } + _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { __tree_.clear(); } + +# if _LIBCPP_STD_VER >= 17 + _LIBCPP_HIDE_FROM_ABI insert_return_type insert(node_type&& __nh) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR(__nh.empty() || __nh.get_allocator() == get_allocator(), + "node_type with incompatible allocator passed to map::insert()"); + return __tree_.template __node_handle_insert_unique< node_type, insert_return_type>(std::move(__nh)); + } + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, node_type&& __nh) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR(__nh.empty() || __nh.get_allocator() == get_allocator(), + "node_type with incompatible allocator passed to map::insert()"); + return __tree_.template __node_handle_insert_unique(__hint.__i_, std::move(__nh)); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI node_type extract(key_type const& __key) { + return __tree_.template __node_handle_extract(__key); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) { + return __tree_.template __node_handle_extract(__it.__i_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(map& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + __tree_.__node_handle_merge_unique(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(map&& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + __tree_.__node_handle_merge_unique(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(multimap& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + __tree_.__node_handle_merge_unique(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(multimap&& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + __tree_.__node_handle_merge_unique(__source.__tree_); + } +# endif + + _LIBCPP_HIDE_FROM_ABI void swap(map& __m) _NOEXCEPT_(__is_nothrow_swappable_v<__base>) { __tree_.swap(__m.__tree_); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); } +# if _LIBCPP_STD_VER >= 14 + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) { + return __tree_.find(__k); + } + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const { + return __tree_.find(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { + return __tree_.__count_unique(__k); + } +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const { + return __tree_.__count_multi(__k); + } +# endif + +# if _LIBCPP_STD_VER >= 20 + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); } + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool contains(const _K2& __k) const { + return find(__k) != end(); + } +# endif // _LIBCPP_STD_VER >= 20 + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { + return __tree_.__lower_bound_unique(__k); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { + return __tree_.__lower_bound_unique(__k); + } + + // The transparent versions of the lookup functions use the _multi version, since a non-element key is allowed to + // match multiple elements. +# if _LIBCPP_STD_VER >= 14 + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const _K2& __k) { + return __tree_.__lower_bound_multi(__k); + } + + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _K2& __k) const { + return __tree_.__lower_bound_multi(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __k) { + return __tree_.__upper_bound_unique(__k); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const key_type& __k) const { + return __tree_.__upper_bound_unique(__k); + } + +# if _LIBCPP_STD_VER >= 14 + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const _K2& __k) { + return __tree_.__upper_bound_multi(__k); + } + template || __is_transparently_comparable_v<_Comp, key_type, _K2>, int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _K2& __k) const { + return __tree_.__upper_bound_multi(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const key_type& __k) { + return __tree_.__equal_range_unique(__k); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const key_type& __k) const { + return __tree_.__equal_range_unique(__k); + } +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const _K2& __k) { + return __tree_.__equal_range_multi(__k); + } + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const _K2& __k) const { + return __tree_.__equal_range_multi(__k); + } +# endif + +private: + typedef typename __base::__node __node; + typedef typename __base::__node_allocator __node_allocator; + typedef typename __base::__node_pointer __node_pointer; + typedef typename __base::__node_base_pointer __node_base_pointer; + + typedef __map_node_destructor<__node_allocator> _Dp; + typedef unique_ptr<__node, _Dp> __node_holder; + +# ifdef _LIBCPP_CXX03_LANG + _LIBCPP_HIDE_FROM_ABI __node_holder __construct_node_with_key(const key_type& __k); +# endif + + friend struct __specialized_algorithm<_Algorithm::__for_each, __single_range >; +}; + +# if _LIBCPP_STD_VER >= 17 +template >, + class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value, void>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +map(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator()) + -> map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Compare, _Allocator>; + +# if _LIBCPP_STD_VER >= 23 +template >, + class _Allocator = allocator<__range_to_alloc_type<_Range>>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +map(from_range_t, _Range&&, _Compare = _Compare(), _Allocator = _Allocator()) + -> map<__range_key_type<_Range>, __range_mapped_type<_Range>, _Compare, _Allocator>; +# endif + +template >, + class _Allocator = allocator>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +map(initializer_list>, _Compare = _Compare(), _Allocator = _Allocator()) + -> map, _Tp, _Compare, _Allocator>; + +template ::value, void>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +map(_InputIterator, _InputIterator, _Allocator) + -> map<__iter_key_type<_InputIterator>, + __iter_mapped_type<_InputIterator>, + less<__iter_key_type<_InputIterator>>, + _Allocator>; + +# if _LIBCPP_STD_VER >= 23 +template >> +map(from_range_t, _Range&&, _Allocator) + -> map<__range_key_type<_Range>, __range_mapped_type<_Range>, less<__range_key_type<_Range>>, _Allocator>; +# endif + +template >> +map(initializer_list>, _Allocator) + -> map, _Tp, less>, _Allocator>; +# endif + +# if _LIBCPP_STD_VER >= 14 +template +struct __specialized_algorithm<_Algorithm::__for_each, __single_range>> { + using __map _LIBCPP_NODEBUG = map<_Key, _Tp, _Compare, _Allocator>; + + static const bool __has_algorithm = true; + + template + _LIBCPP_HIDE_FROM_ABI static auto operator()(_Map&& __map, _Func __func, _Proj __proj) { + auto [_, __func2] = __specialized_algorithm<_Algorithm::__for_each, __single_range>()( + __map.__tree_, std::move(__func), std::move(__proj)); + return std::make_pair(__map.end(), std::move(__func2)); + } +}; +# endif + +# ifndef _LIBCPP_CXX03_LANG +template +_Tp& map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k) { + return __tree_.__emplace_unique(std::piecewise_construct, std::forward_as_tuple(__k), std::forward_as_tuple()) + .first->second; +} + +template +_Tp& map<_Key, _Tp, _Compare, _Allocator>::operator[](key_type&& __k) { + return __tree_ + .__emplace_unique(std::piecewise_construct, std::forward_as_tuple(std::move(__k)), std::forward_as_tuple()) + .first->second; +} + +# else // _LIBCPP_CXX03_LANG + +template +typename map<_Key, _Tp, _Compare, _Allocator>::__node_holder +map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k) { + __node_allocator& __na = __tree_.__node_alloc(); + __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na)); + __node_traits::construct(__na, std::addressof(__h->__get_value().first), __k); + __h.get_deleter().__first_constructed = true; + __node_traits::construct(__na, std::addressof(__h->__get_value().second)); + __h.get_deleter().__second_constructed = true; + return __h; +} + +template +_Tp& map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k) { + auto [__parent, __child] = __tree_.__find_equal(__k); + __node_pointer __r = static_cast<__node_pointer>(__child); + if (__child == nullptr) { + __node_holder __h = __construct_node_with_key(__k); + __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); + __r = __h.release(); + } + return __r->__get_value().second; +} + +# endif // _LIBCPP_CXX03_LANG + +template +_Tp& map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) { + auto [_, __child] = __tree_.__find_equal(__k); + if (__child == nullptr) + std::__throw_out_of_range("map::at: key not found"); + return static_cast<__node_pointer>(__child)->__get_value().second; +} + +template +const _Tp& map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const { + auto [_, __child] = __tree_.__find_equal(__k); + if (__child == nullptr) + std::__throw_out_of_range("map::at: key not found"); + return static_cast<__node_pointer>(__child)->__get_value().second; +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator==(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return __x.size() == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin()); +} + +# if _LIBCPP_STD_VER <= 17 + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator<(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__x == __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator>(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return __y < __x; +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__x < __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__y < __x); +} + +# else // #if _LIBCPP_STD_VER <= 17 + +template +_LIBCPP_HIDE_FROM_ABI __synth_three_way_result> +operator<=>(const map<_Key, _Tp, _Compare, _Allocator>& __x, const map<_Key, _Tp, _Compare, _Allocator>& __y) { + return std::lexicographical_compare_three_way(__x.begin(), __x.end(), __y.begin(), __y.end(), std::__synth_three_way); +} + +# endif // #if _LIBCPP_STD_VER <= 17 + +template +inline _LIBCPP_HIDE_FROM_ABI void +swap(map<_Key, _Tp, _Compare, _Allocator>& __x, map<_Key, _Tp, _Compare, _Allocator>& __y) + _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +# if _LIBCPP_STD_VER >= 20 +template +inline _LIBCPP_HIDE_FROM_ABI typename map<_Key, _Tp, _Compare, _Allocator>::size_type +erase_if(map<_Key, _Tp, _Compare, _Allocator>& __c, _Predicate __pred) { + return std::__libcpp_erase_if_container(__c, __pred); +} +# endif + +template +struct __container_traits > { + // http://eel.is/c++draft/associative.reqmts.except#2 + // For associative containers, if an exception is thrown by any operation from within + // an insert or emplace function inserting a single element, the insertion has no effect. + static _LIBCPP_CONSTEXPR const bool __emplacement_has_strong_exception_safety_guarantee = true; + + static _LIBCPP_CONSTEXPR const bool __reservable = false; +}; + +template +class multimap { +public: + // types: + typedef _Key key_type; + typedef _Tp mapped_type; + typedef pair value_type; + typedef __type_identity_t<_Compare> key_compare; + typedef __type_identity_t<_Allocator> allocator_type; + typedef value_type& reference; + typedef const value_type& const_reference; + + static_assert(__check_valid_allocator::value, ""); + static_assert(is_same::value, + "Allocator::value_type must be same type as value_type"); + + class value_compare : public __binary_function { + friend class multimap; + + protected: + key_compare comp; + + _LIBCPP_HIDE_FROM_ABI value_compare(key_compare __c) : comp(__c) {} + + public: + _LIBCPP_HIDE_FROM_ABI bool operator()(const value_type& __x, const value_type& __y) const { + return comp(__x.first, __y.first); + } + }; + +private: + typedef std::__value_type __value_type; + typedef __map_value_compare __vc; + typedef __tree<__value_type, __vc, allocator_type> __base; + typedef typename __base::__node_traits __node_traits; + typedef allocator_traits __alloc_traits; + + __base __tree_; + +public: + typedef typename __alloc_traits::pointer pointer; + typedef typename __alloc_traits::const_pointer const_pointer; + typedef typename __alloc_traits::size_type size_type; + typedef typename __alloc_traits::difference_type difference_type; + typedef __map_iterator iterator; + typedef __map_const_iterator const_iterator; + typedef std::reverse_iterator reverse_iterator; + typedef std::reverse_iterator const_reverse_iterator; + +# if _LIBCPP_STD_VER >= 17 + typedef __map_node_handle node_type; +# endif + + template + friend class map; + template + friend class multimap; + + _LIBCPP_HIDE_FROM_ABI multimap() _NOEXCEPT_( + is_nothrow_default_constructible::value&& is_nothrow_default_constructible::value&& + is_nothrow_copy_constructible::value) + : __tree_(__vc(key_compare())) {} + + _LIBCPP_HIDE_FROM_ABI explicit multimap(const key_compare& __comp) _NOEXCEPT_( + is_nothrow_default_constructible::value&& is_nothrow_copy_constructible::value) + : __tree_(__vc(__comp)) {} + + _LIBCPP_HIDE_FROM_ABI explicit multimap(const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) {} + + template + _LIBCPP_HIDE_FROM_ABI multimap(_InputIterator __f, _InputIterator __l, const key_compare& __comp = key_compare()) + : __tree_(__vc(__comp)) { + insert(__f, __l); + } + + template + _LIBCPP_HIDE_FROM_ABI + multimap(_InputIterator __f, _InputIterator __l, const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert(__f, __l); + } + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI + multimap(from_range_t, + _Range&& __range, + const key_compare& __comp = key_compare(), + const allocator_type& __a = allocator_type()) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert_range(std::forward<_Range>(__range)); + } +# endif + +# if _LIBCPP_STD_VER >= 14 + template + _LIBCPP_HIDE_FROM_ABI multimap(_InputIterator __f, _InputIterator __l, const allocator_type& __a) + : multimap(__f, __l, key_compare(), __a) {} +# endif + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI multimap(from_range_t, _Range&& __range, const allocator_type& __a) + : multimap(from_range, std::forward<_Range>(__range), key_compare(), __a) {} +# endif + + _LIBCPP_HIDE_FROM_ABI multimap(const multimap& __m) = default; + + _LIBCPP_HIDE_FROM_ABI multimap& operator=(const multimap& __m) = default; + +# ifndef _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI multimap(multimap&& __m) = default; + + _LIBCPP_HIDE_FROM_ABI multimap(multimap&& __m, const allocator_type& __a) : __tree_(std::move(__m.__tree_), __a) {} + + _LIBCPP_HIDE_FROM_ABI multimap& operator=(multimap&& __m) = default; + + _LIBCPP_HIDE_FROM_ABI multimap(initializer_list __il, const key_compare& __comp = key_compare()) + : __tree_(__vc(__comp)) { + insert(__il.begin(), __il.end()); + } + + _LIBCPP_HIDE_FROM_ABI + multimap(initializer_list __il, const key_compare& __comp, const allocator_type& __a) + : __tree_(__vc(__comp), typename __base::allocator_type(__a)) { + insert(__il.begin(), __il.end()); + } + +# if _LIBCPP_STD_VER >= 14 + _LIBCPP_HIDE_FROM_ABI multimap(initializer_list __il, const allocator_type& __a) + : multimap(__il, key_compare(), __a) {} +# endif + + _LIBCPP_HIDE_FROM_ABI multimap& operator=(initializer_list __il) { + clear(); + insert(__il.begin(), __il.end()); + return *this; + } + +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI explicit multimap(const allocator_type& __a) : __tree_(typename __base::allocator_type(__a)) {} + + _LIBCPP_HIDE_FROM_ABI multimap(const multimap& __m, const allocator_type& __a) : __tree_(__m.__tree_, __a) {} + + _LIBCPP_HIDE_FROM_ABI ~multimap() { + static_assert(sizeof(std::__diagnose_non_const_comparator<_Key, _Compare>()), ""); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator begin() _NOEXCEPT { return __tree_.begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return __tree_.begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator end() _NOEXCEPT { return __tree_.end(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return __tree_.end(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reverse_iterator rbegin() _NOEXCEPT { return reverse_iterator(end()); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rbegin() const _NOEXCEPT { + return const_reverse_iterator(end()); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI reverse_iterator rend() _NOEXCEPT { return reverse_iterator(begin()); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator rend() const _NOEXCEPT { + return const_reverse_iterator(begin()); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crbegin() const _NOEXCEPT { return rbegin(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_reverse_iterator crend() const _NOEXCEPT { return rend(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool empty() const _NOEXCEPT { return __tree_.size() == 0; } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __tree_.size(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type max_size() const _NOEXCEPT { return __tree_.max_size(); } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI allocator_type get_allocator() const _NOEXCEPT { + return allocator_type(__tree_.__alloc()); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI key_compare key_comp() const { return __tree_.value_comp().key_comp(); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI value_compare value_comp() const { + return value_compare(__tree_.value_comp().key_comp()); + } + +# ifndef _LIBCPP_CXX03_LANG + + template + _LIBCPP_HIDE_FROM_ABI iterator emplace(_Args&&... __args) { + return __tree_.__emplace_multi(std::forward<_Args>(__args)...); + } + + template + _LIBCPP_HIDE_FROM_ABI iterator emplace_hint(const_iterator __p, _Args&&... __args) { + return __tree_.__emplace_hint_multi(__p.__i_, std::forward<_Args>(__args)...); + } + + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI iterator insert(_Pp&& __p) { + return __tree_.__emplace_multi(std::forward<_Pp>(__p)); + } + + template ::value, int> = 0> + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __pos, _Pp&& __p) { + return __tree_.__emplace_hint_multi(__pos.__i_, std::forward<_Pp>(__p)); + } + + _LIBCPP_HIDE_FROM_ABI iterator insert(value_type&& __v) { return __tree_.__emplace_multi(std::move(__v)); } + + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v) { + return __tree_.__emplace_hint_multi(__p.__i_, std::move(__v)); + } + + _LIBCPP_HIDE_FROM_ABI void insert(initializer_list __il) { insert(__il.begin(), __il.end()); } + +# endif // _LIBCPP_CXX03_LANG + + _LIBCPP_HIDE_FROM_ABI iterator insert(const value_type& __v) { return __tree_.__emplace_multi(__v); } + + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v) { + return __tree_.__emplace_hint_multi(__p.__i_, __v); + } + + template + _LIBCPP_HIDE_FROM_ABI void insert(_InputIterator __f, _InputIterator __l) { + __tree_.__insert_range_multi(__f, __l); + } + +# if _LIBCPP_STD_VER >= 23 + template <_ContainerCompatibleRange _Range> + _LIBCPP_HIDE_FROM_ABI void insert_range(_Range&& __range) { + __tree_.__insert_range_multi(ranges::begin(__range), ranges::end(__range)); + } +# endif + + _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p) { return __tree_.erase(__p.__i_); } + _LIBCPP_HIDE_FROM_ABI iterator erase(iterator __p) { return __tree_.erase(__p.__i_); } + _LIBCPP_HIDE_FROM_ABI size_type erase(const key_type& __k) { return __tree_.__erase_multi(__k); } + _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l) { + return __tree_.erase(__f.__i_, __l.__i_); + } + +# if _LIBCPP_STD_VER >= 17 + _LIBCPP_HIDE_FROM_ABI iterator insert(node_type&& __nh) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR(__nh.empty() || __nh.get_allocator() == get_allocator(), + "node_type with incompatible allocator passed to multimap::insert()"); + return __tree_.template __node_handle_insert_multi(std::move(__nh)); + } + _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, node_type&& __nh) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR(__nh.empty() || __nh.get_allocator() == get_allocator(), + "node_type with incompatible allocator passed to multimap::insert()"); + return __tree_.template __node_handle_insert_multi(__hint.__i_, std::move(__nh)); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI node_type extract(key_type const& __key) { + return __tree_.template __node_handle_extract(__key); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) { + return __tree_.template __node_handle_extract(__it.__i_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(multimap& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + return __tree_.__node_handle_merge_multi(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(multimap&& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + return __tree_.__node_handle_merge_multi(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(map& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + return __tree_.__node_handle_merge_multi(__source.__tree_); + } + template + _LIBCPP_HIDE_FROM_ABI void merge(map&& __source) { + _LIBCPP_ASSERT_COMPATIBLE_ALLOCATOR( + __source.get_allocator() == get_allocator(), "merging container with incompatible allocator"); + return __tree_.__node_handle_merge_multi(__source.__tree_); + } +# endif + + _LIBCPP_HIDE_FROM_ABI void clear() _NOEXCEPT { __tree_.clear(); } + + _LIBCPP_HIDE_FROM_ABI void swap(multimap& __m) _NOEXCEPT_(__is_nothrow_swappable_v<__base>) { + __tree_.swap(__m.__tree_); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator find(const key_type& __k) { return __tree_.find(__k); } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); } +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator find(const _K2& __k) { + return __tree_.find(__k); + } + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const { + return __tree_.find(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type count(const key_type& __k) const { + return __tree_.__count_multi(__k); + } +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI size_type count(const _K2& __k) const { + return __tree_.__count_multi(__k); + } +# endif + +# if _LIBCPP_STD_VER >= 20 + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool contains(const key_type& __k) const { return find(__k) != end(); } + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI bool contains(const _K2& __k) const { + return find(__k) != end(); + } +# endif // _LIBCPP_STD_VER >= 20 + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { + return __tree_.__lower_bound_multi(__k); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { + return __tree_.__lower_bound_multi(__k); + } + +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const _K2& __k) { + return __tree_.__lower_bound_multi(__k); + } + + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _K2& __k) const { + return __tree_.__lower_bound_multi(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const key_type& __k) { + return __tree_.__upper_bound_multi(__k); + } + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const key_type& __k) const { + return __tree_.__upper_bound_multi(__k); + } + +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const _K2& __k) { + return __tree_.__upper_bound_multi(__k); + } + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _K2& __k) const { + return __tree_.__upper_bound_multi(__k); + } +# endif + + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const key_type& __k) { + return __tree_.__equal_range_multi(__k); + } + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const key_type& __k) const { + return __tree_.__equal_range_multi(__k); + } +# if _LIBCPP_STD_VER >= 14 + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const _K2& __k) { + return __tree_.__equal_range_multi(__k); + } + template , int> = 0> + [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI pair equal_range(const _K2& __k) const { + return __tree_.__equal_range_multi(__k); + } +# endif + +private: + typedef typename __base::__node __node; + typedef typename __base::__node_allocator __node_allocator; + typedef typename __base::__node_pointer __node_pointer; + + typedef __map_node_destructor<__node_allocator> _Dp; + typedef unique_ptr<__node, _Dp> __node_holder; + + friend struct __specialized_algorithm<_Algorithm::__for_each, __single_range >; +}; + +# if _LIBCPP_STD_VER >= 17 +template >, + class _Allocator = allocator<__iter_to_alloc_type<_InputIterator>>, + class = enable_if_t<__has_input_iterator_category<_InputIterator>::value, void>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +multimap(_InputIterator, _InputIterator, _Compare = _Compare(), _Allocator = _Allocator()) + -> multimap<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Compare, _Allocator>; + +# if _LIBCPP_STD_VER >= 23 +template >, + class _Allocator = allocator<__range_to_alloc_type<_Range>>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +multimap(from_range_t, _Range&&, _Compare = _Compare(), _Allocator = _Allocator()) + -> multimap<__range_key_type<_Range>, __range_mapped_type<_Range>, _Compare, _Allocator>; +# endif + +template >, + class _Allocator = allocator>, + class = enable_if_t>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +multimap(initializer_list>, _Compare = _Compare(), _Allocator = _Allocator()) + -> multimap, _Tp, _Compare, _Allocator>; + +template ::value, void>, + class = enable_if_t<__is_allocator_v<_Allocator>>> +multimap(_InputIterator, _InputIterator, _Allocator) + -> multimap<__iter_key_type<_InputIterator>, + __iter_mapped_type<_InputIterator>, + less<__iter_key_type<_InputIterator>>, + _Allocator>; + +# if _LIBCPP_STD_VER >= 23 +template >> +multimap(from_range_t, _Range&&, _Allocator) + -> multimap<__range_key_type<_Range>, __range_mapped_type<_Range>, less<__range_key_type<_Range>>, _Allocator>; +# endif + +template >> +multimap(initializer_list>, _Allocator) + -> multimap, _Tp, less>, _Allocator>; +# endif + +# if _LIBCPP_STD_VER >= 14 +template +struct __specialized_algorithm<_Algorithm::__for_each, __single_range>> { + using __map _LIBCPP_NODEBUG = multimap<_Key, _Tp, _Compare, _Allocator>; + + static const bool __has_algorithm = true; + + template + _LIBCPP_HIDE_FROM_ABI static auto operator()(_Map&& __map, _Func __func, _Proj __proj) { + auto [_, __func2] = __specialized_algorithm<_Algorithm::__for_each, __single_range>()( + __map.__tree_, std::move(__func), std::move(__proj)); + return std::make_pair(__map.end(), std::move(__func2)); + } +}; +# endif + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return __x.size() == __y.size() && std::equal(__x.begin(), __x.end(), __y.begin()); +} + +# if _LIBCPP_STD_VER <= 17 + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator<(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return std::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end()); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__x == __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator>(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return __y < __x; +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__x < __y); +} + +template +inline _LIBCPP_HIDE_FROM_ABI bool +operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return !(__y < __x); +} + +# else // #if _LIBCPP_STD_VER <= 17 + +template +_LIBCPP_HIDE_FROM_ABI __synth_three_way_result> +operator<=>(const multimap<_Key, _Tp, _Compare, _Allocator>& __x, + const multimap<_Key, _Tp, _Compare, _Allocator>& __y) { + return std::lexicographical_compare_three_way(__x.begin(), __x.end(), __y.begin(), __y.end(), __synth_three_way); +} + +# endif // #if _LIBCPP_STD_VER <= 17 + +template +inline _LIBCPP_HIDE_FROM_ABI void +swap(multimap<_Key, _Tp, _Compare, _Allocator>& __x, multimap<_Key, _Tp, _Compare, _Allocator>& __y) + _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y))) { + __x.swap(__y); +} + +# if _LIBCPP_STD_VER >= 20 +template +inline _LIBCPP_HIDE_FROM_ABI typename multimap<_Key, _Tp, _Compare, _Allocator>::size_type +erase_if(multimap<_Key, _Tp, _Compare, _Allocator>& __c, _Predicate __pred) { + return std::__libcpp_erase_if_container(__c, __pred); +} +# endif + +template +struct __container_traits > { + // http://eel.is/c++draft/associative.reqmts.except#2 + // For associative containers, if an exception is thrown by any operation from within + // an insert or emplace function inserting a single element, the insertion has no effect. + static _LIBCPP_CONSTEXPR const bool __emplacement_has_strong_exception_safety_guarantee = true; + + static _LIBCPP_CONSTEXPR const bool __reservable = false; +}; + +_LIBCPP_END_NAMESPACE_STD + +# if _LIBCPP_STD_VER >= 17 +_LIBCPP_BEGIN_NAMESPACE_STD +namespace pmr { +template > +using map _LIBCPP_AVAILABILITY_PMR = + std::map<_KeyT, _ValueT, _CompareT, polymorphic_allocator>>; + +template > +using multimap _LIBCPP_AVAILABILITY_PMR = + std::multimap<_KeyT, _ValueT, _CompareT, polymorphic_allocator>>; +} // namespace pmr +_LIBCPP_END_NAMESPACE_STD +# endif + +_LIBCPP_POP_MACROS + +# if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 +# include +# include +# include +# include +# include +# include +# endif +#endif // __cplusplus < 201103L && defined(_LIBCPP_USE_FROZEN_CXX03_HEADERS) + +#endif // _LIBCPP_MAP -- cgit v1.2.3