56 #ifndef _STL_MULTIMAP_H 57 #define _STL_MULTIMAP_H 1 60 #if __cplusplus >= 201103L 64 namespace std _GLIBCXX_VISIBILITY(default)
66 _GLIBCXX_BEGIN_NAMESPACE_VERSION
67 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
69 template <
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
96 template <
typename _Key,
typename _Tp,
102 typedef _Key key_type;
103 typedef _Tp mapped_type;
105 typedef _Compare key_compare;
106 typedef _Alloc allocator_type;
109 #ifdef _GLIBCXX_CONCEPT_CHECKS 111 typedef typename _Alloc::value_type _Alloc_value_type;
112 # if __cplusplus < 201103L 113 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
115 __glibcxx_class_requires4(_Compare,
bool, _Key, _Key,
116 _BinaryFunctionConcept)
117 __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept)
120 #if __cplusplus >= 201103L && defined(__STRICT_ANSI__) 121 static_assert(is_same<typename _Alloc::value_type, value_type>::value,
122 "std::multimap must have the same value_type as its allocator");
129 friend class multimap<_Key, _Tp, _Compare, _Alloc>;
133 value_compare(_Compare __c)
137 bool operator()(
const value_type& __x,
const value_type& __y)
const 138 {
return comp(__x.first, __y.first); }
144 rebind<value_type>::other _Pair_alloc_type;
146 typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
147 key_compare, _Pair_alloc_type> _Rep_type;
156 typedef typename _Alloc_traits::pointer pointer;
157 typedef typename _Alloc_traits::const_pointer const_pointer;
158 typedef typename _Alloc_traits::reference reference;
159 typedef typename _Alloc_traits::const_reference const_reference;
160 typedef typename _Rep_type::iterator iterator;
161 typedef typename _Rep_type::const_iterator const_iterator;
162 typedef typename _Rep_type::size_type size_type;
163 typedef typename _Rep_type::difference_type difference_type;
164 typedef typename _Rep_type::reverse_iterator reverse_iterator;
165 typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
167 #if __cplusplus > 201402L 168 using node_type =
typename _Rep_type::node_type;
177 #if __cplusplus < 201103L 190 const allocator_type& __a = allocator_type())
191 : _M_t(__comp, _Pair_alloc_type(__a)) { }
198 #if __cplusplus < 201103L 224 const _Compare& __comp = _Compare(),
225 const allocator_type& __a = allocator_type())
226 : _M_t(__comp, _Pair_alloc_type(__a))
227 { _M_t._M_insert_equal(__l.begin(), __l.end()); }
232 : _M_t(_Compare(), _Pair_alloc_type(__a)) { }
236 : _M_t(__m._M_t, _Pair_alloc_type(__a)) { }
241 && _Alloc_traits::_S_always_equal())
242 : _M_t(
std::move(__m._M_t), _Pair_alloc_type(__a)) { }
246 : _M_t(_Compare(), _Pair_alloc_type(__a))
247 { _M_t._M_insert_equal(__l.begin(), __l.end()); }
250 template<
typename _InputIterator>
251 multimap(_InputIterator __first, _InputIterator __last,
252 const allocator_type& __a)
253 : _M_t(_Compare(), _Pair_alloc_type(__a))
254 { _M_t._M_insert_equal(__first, __last); }
266 template<
typename _InputIterator>
267 multimap(_InputIterator __first, _InputIterator __last)
269 { _M_t._M_insert_equal(__first, __last); }
282 template<
typename _InputIterator>
283 multimap(_InputIterator __first, _InputIterator __last,
284 const _Compare& __comp,
285 const allocator_type& __a = allocator_type())
286 : _M_t(__comp, _Pair_alloc_type(__a))
287 { _M_t._M_insert_equal(__first, __last); }
289 #if __cplusplus >= 201103L 303 #if __cplusplus < 201103L 332 _M_t._M_assign_equal(__l.begin(), __l.end());
340 {
return allocator_type(_M_t.get_allocator()); }
350 {
return _M_t.begin(); }
359 {
return _M_t.begin(); }
368 {
return _M_t.end(); }
376 end() const _GLIBCXX_NOEXCEPT
377 {
return _M_t.end(); }
386 {
return _M_t.rbegin(); }
393 const_reverse_iterator
395 {
return _M_t.rbegin(); }
404 {
return _M_t.rend(); }
411 const_reverse_iterator
413 {
return _M_t.rend(); }
415 #if __cplusplus >= 201103L 423 {
return _M_t.begin(); }
432 {
return _M_t.end(); }
439 const_reverse_iterator
441 {
return _M_t.rbegin(); }
448 const_reverse_iterator
450 {
return _M_t.rend(); }
457 {
return _M_t.empty(); }
462 {
return _M_t.size(); }
467 {
return _M_t.max_size(); }
470 #if __cplusplus >= 201103L 487 template<
typename... _Args>
490 {
return _M_t._M_emplace_equal(std::forward<_Args>(__args)...); }
514 template<
typename... _Args>
518 return _M_t._M_emplace_hint_equal(__pos,
519 std::forward<_Args>(__args)...);
538 {
return _M_t._M_insert_equal(__x); }
540 #if __cplusplus >= 201103L 545 {
return _M_t._M_insert_equal(std::move(__x)); }
547 template<
typename _Pair,
typename =
typename 549 _Pair&&>::value>::type>
552 {
return _M_t._M_insert_equal(std::forward<_Pair>(__x)); }
578 #if __cplusplus >= 201103L 583 {
return _M_t._M_insert_equal_(__position, __x); }
585 #if __cplusplus >= 201103L 590 {
return _M_t._M_insert_equal_(__position, std::move(__x)); }
592 template<
typename _Pair,
typename =
typename 594 _Pair&&>::value>::type>
596 insert(const_iterator __position, _Pair&& __x)
597 {
return _M_t._M_insert_equal_(__position,
598 std::forward<_Pair>(__x)); }
611 template<
typename _InputIterator>
613 insert(_InputIterator __first, _InputIterator __last)
614 { _M_t._M_insert_equal(__first, __last); }
616 #if __cplusplus >= 201103L 626 { this->
insert(__l.begin(), __l.end()); }
629 #if __cplusplus > 201402L 632 extract(const_iterator __pos)
634 __glibcxx_assert(__pos !=
end());
635 return _M_t.extract(__pos);
640 extract(
const key_type& __x)
641 {
return _M_t.extract(__x); }
646 {
return _M_t._M_reinsert_node_equal(std::move(__nh)); }
650 insert(const_iterator __hint, node_type&& __nh)
651 {
return _M_t._M_reinsert_node_hint_equal(__hint, std::move(__nh)); }
653 template<
typename,
typename>
654 friend class std::_Rb_tree_merge_helper;
656 template<
typename _C2>
658 merge(multimap<_Key, _Tp, _C2, _Alloc>& __source)
660 using _Merge_helper = _Rb_tree_merge_helper<multimap, _C2>;
661 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
664 template<
typename _C2>
666 merge(multimap<_Key, _Tp, _C2, _Alloc>&& __source)
669 template<
typename _C2>
671 merge(map<_Key, _Tp, _C2, _Alloc>& __source)
673 using _Merge_helper = _Rb_tree_merge_helper<multimap, _C2>;
674 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
677 template<
typename _C2>
679 merge(map<_Key, _Tp, _C2, _Alloc>&& __source)
683 #if __cplusplus >= 201103L 703 {
return _M_t.erase(__position); }
706 _GLIBCXX_ABI_TAG_CXX11
709 {
return _M_t.erase(__position); }
724 { _M_t.erase(__position); }
740 {
return _M_t.erase(__x); }
742 #if __cplusplus >= 201103L 760 erase(const_iterator __first, const_iterator __last)
761 {
return _M_t.erase(__first, __last); }
780 { _M_t.erase(__first, __last); }
798 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)
799 { _M_t.swap(__x._M_t); }
818 {
return _M_t.key_comp(); }
826 {
return value_compare(_M_t.key_comp()); }
844 {
return _M_t.find(__x); }
846 #if __cplusplus > 201103L 847 template<
typename _Kt>
849 find(
const _Kt& __x) -> decltype(_M_t._M_find_tr(__x))
850 {
return _M_t._M_find_tr(__x); }
867 find(
const key_type& __x)
const 868 {
return _M_t.find(__x); }
870 #if __cplusplus > 201103L 871 template<
typename _Kt>
873 find(
const _Kt& __x)
const -> decltype(_M_t._M_find_tr(__x))
874 {
return _M_t._M_find_tr(__x); }
886 {
return _M_t.count(__x); }
888 #if __cplusplus > 201103L 889 template<
typename _Kt>
891 count(
const _Kt& __x)
const -> decltype(_M_t._M_count_tr(__x))
892 {
return _M_t._M_count_tr(__x); }
910 {
return _M_t.lower_bound(__x); }
912 #if __cplusplus > 201103L 913 template<
typename _Kt>
916 -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
917 {
return iterator(_M_t._M_lower_bound_tr(__x)); }
935 {
return _M_t.lower_bound(__x); }
937 #if __cplusplus > 201103L 938 template<
typename _Kt>
941 -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
942 {
return const_iterator(_M_t._M_lower_bound_tr(__x)); }
955 {
return _M_t.upper_bound(__x); }
957 #if __cplusplus > 201103L 958 template<
typename _Kt>
961 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
962 {
return iterator(_M_t._M_upper_bound_tr(__x)); }
975 {
return _M_t.upper_bound(__x); }
977 #if __cplusplus > 201103L 978 template<
typename _Kt>
981 -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
982 {
return const_iterator(_M_t._M_upper_bound_tr(__x)); }
1002 {
return _M_t.equal_range(__x); }
1004 #if __cplusplus > 201103L 1005 template<
typename _Kt>
1029 {
return _M_t.equal_range(__x); }
1031 #if __cplusplus > 201103L 1032 template<
typename _Kt>
1036 _M_t._M_equal_range_tr(__x)))
1039 _M_t._M_equal_range_tr(__x));
1044 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
1049 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
1051 operator<(const multimap<_K1, _T1, _C1, _A1>&,
1055 #if __cpp_deduction_guides >= 201606 1057 template<
typename _InputIterator,
1058 typename _Compare = less<__iter_key_t<_InputIterator>>,
1059 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
1060 typename = _RequireInputIter<_InputIterator>,
1061 typename = _RequireAllocator<_Allocator>>
1062 multimap(_InputIterator, _InputIterator,
1063 _Compare = _Compare(), _Allocator = _Allocator())
1064 -> multimap<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
1065 _Compare, _Allocator>;
1067 template<
typename _Key,
typename _Tp,
typename _Compare = less<_Key>,
1068 typename _Allocator = allocator<pair<const _Key, _Tp>>,
1069 typename = _RequireAllocator<_Allocator>>
1070 multimap(initializer_list<pair<_Key, _Tp>>,
1071 _Compare = _Compare(), _Allocator = _Allocator())
1072 -> multimap<_Key, _Tp, _Compare, _Allocator>;
1074 template<
typename _InputIterator,
typename _Allocator,
1075 typename = _RequireInputIter<_InputIterator>,
1076 typename = _RequireAllocator<_Allocator>>
1077 multimap(_InputIterator, _InputIterator, _Allocator)
1078 -> multimap<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
1079 less<__iter_key_t<_InputIterator>>, _Allocator>;
1081 template<
typename _Key,
typename _Tp,
typename _Allocator,
1082 typename = _RequireAllocator<_Allocator>>
1083 multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
1084 -> multimap<_Key, _Tp, less<_Key>, _Allocator>;
1098 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1102 {
return __x._M_t == __y._M_t; }
1115 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1117 operator<(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
1119 {
return __x._M_t < __y._M_t; }
1122 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1126 {
return !(__x == __y); }
1129 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1133 {
return __y < __x; }
1136 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1138 operator<=(const multimap<_Key, _Tp, _Compare, _Alloc>& __x,
1140 {
return !(__y < __x); }
1143 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1147 {
return !(__x < __y); }
1150 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1154 _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))
1157 _GLIBCXX_END_NAMESPACE_CONTAINER
1159 #if __cplusplus > 201402L 1161 template<
typename _Key,
typename _Val,
typename _Cmp1,
typename _Alloc,
1164 _Rb_tree_merge_helper<_GLIBCXX_STD_C::multimap<_Key, _Val, _Cmp1, _Alloc>,
1168 friend class _GLIBCXX_STD_C::multimap<_Key, _Val, _Cmp1, _Alloc>;
1171 _S_get_tree(_GLIBCXX_STD_C::map<_Key, _Val, _Cmp2, _Alloc>& __map)
1172 {
return __map._M_t; }
1175 _S_get_tree(_GLIBCXX_STD_C::multimap<_Key, _Val, _Cmp2, _Alloc>& __map)
1176 {
return __map._M_t; }
1180 _GLIBCXX_END_NAMESPACE_VERSION
const_iterator upper_bound(const key_type &__x) const
Finds the end of a subsequence matching given key.
reverse_iterator rend() noexcept
iterator insert(_Pair &&__x)
Inserts a std::pair into the multimap.
iterator insert(value_type &&__x)
Inserts a std::pair into the multimap.
allocator_type get_allocator() const noexcept
Get a copy of the memory allocation object.
size_type count(const key_type &__x) const
Finds the number of elements with given key.
bool empty() const noexcept
reverse_iterator rbegin() noexcept
auto lower_bound(const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
Finds the beginning of a subsequence matching given key.
Define a member typedef type only if a boolean constant is true.
auto find(const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x))
Tries to locate an element in a multimap.
const_iterator lower_bound(const key_type &__x) const
Finds the beginning of a subsequence matching given key.
const_iterator cend() const noexcept
auto equal_range(const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
Finds a subsequence matching given key.
void swap(multimap &__x) noexcept(/*conditional */)
Swaps data with another multimap.
key_compare key_comp() const
multimap(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
Builds a multimap from a range.
iterator upper_bound(const key_type &__x)
Finds the end of a subsequence matching given key.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
multimap(const _Compare &__comp, const allocator_type &__a=allocator_type())
Creates a multimap with no elements.
iterator emplace(_Args &&... __args)
Build and insert a std::pair into the multimap.
const_iterator find(const key_type &__x) const
Tries to locate an element in a multimap.
iterator insert(const_iterator __position, _Pair &&__x)
Inserts a std::pair into the multimap.
const_iterator end() const noexcept
const_reverse_iterator crbegin() const noexcept
is_nothrow_copy_constructible
const_reverse_iterator rend() const noexcept
const_iterator begin() const noexcept
multimap(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
Builds a multimap from an initializer_list.
auto find(const _Kt &__x) -> decltype(_M_t._M_find_tr(__x))
Tries to locate an element in a multimap.
size_type size() const noexcept
const_reverse_iterator crend() const noexcept
One of the comparison functors.
size_type max_size() const noexcept
ISO C++ entities toplevel namespace is std.
Uniform interface to C++98 and C++11 allocators.
iterator find(const key_type &__x)
Tries to locate an element in a multimap.
const_reverse_iterator rbegin() const noexcept
The standard allocator, as per [20.4].
multimap(initializer_list< value_type > __l, const allocator_type &__a)
Allocator-extended initialier-list constructor.
const_iterator cbegin() const noexcept
iterator lower_bound(const key_type &__x)
Finds the beginning of a subsequence matching given key.
A standard container made up of (key,value) pairs, which can be retrieved based on a key...
iterator insert(const_iterator __position, const value_type &__x)
Inserts a std::pair into the multimap.
iterator begin() noexcept
value_compare value_comp() const
multimap(multimap &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())
Allocator-extended move constructor.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Builds and inserts a std::pair into the multimap.
auto equal_range(const _Kt &__x) const -> decltype(pair< const_iterator, const_iterator >(_M_t._M_equal_range_tr(__x)))
Finds a subsequence matching given key.
auto upper_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
Finds the end of a subsequence matching given key.
auto lower_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
Finds the beginning of a subsequence matching given key.
multimap & operator=(const multimap &)=default
Multimap assignment operator.
multimap(_InputIterator __first, _InputIterator __last, const allocator_type &__a)
Allocator-extended range constructor.
iterator insert(const value_type &__x)
Inserts a std::pair into the multimap.
_GLIBCXX_ABI_TAG_CXX11 iterator erase(iterator __position)
Erases an element from a multimap.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
Struct holding two objects of arbitrary type.
iterator insert(const_iterator __position, value_type &&__x)
Inserts a std::pair into the multimap.
auto count(const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
Finds the number of elements with given key.
multimap & operator=(initializer_list< value_type > __l)
Multimap list assignment operator.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of std::pairs into the multimap.
auto upper_bound(const _Kt &__x) const -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
Finds the end of a subsequence matching given key.
multimap(const multimap &__m, const allocator_type &__a)
Allocator-extended copy constructor.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [first,last) range of elements from a multimap.
multimap(_InputIterator __first, _InputIterator __last)
Builds a multimap from a range.
iterator erase(const_iterator __position)
Erases an element from a multimap.
multimap(const allocator_type &__a)
Allocator-extended default constructor.
multimap()=default
Default constructor creates no elements.