1 // Multimap implementation -*- C++ -*-
3 // Copyright (C) 2001-2018 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
39 * Copyright (c) 1996,1997
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_multimap.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{map}
56 #ifndef _STL_MULTIMAP_H
57 #define _STL_MULTIMAP_H 1
59 #include <bits/concept_check.h>
60 #if __cplusplus >= 201103L
61 #include <initializer_list>
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
>
73 * @brief A standard container made up of (key,value) pairs, which can be
74 * retrieved based on a key, in logarithmic time.
76 * @ingroup associative_containers
78 * @tparam _Key Type of key objects.
79 * @tparam _Tp Type of mapped objects.
80 * @tparam _Compare Comparison function object type, defaults to less<_Key>.
81 * @tparam _Alloc Allocator type, defaults to
82 * allocator<pair<const _Key, _Tp>.
84 * Meets the requirements of a <a href="tables.html#65">container</a>, a
85 * <a href="tables.html#66">reversible container</a>, and an
86 * <a href="tables.html#69">associative container</a> (using equivalent
87 * keys). For a @c multimap<Key,T> the key_type is Key, the mapped_type
88 * is T, and the value_type is std::pair<const Key,T>.
90 * Multimaps support bidirectional iterators.
92 * The private tree data is declared exactly the same way for map and
93 * multimap; the distinction is made entirely in how the tree functions are
94 * called (*_unique versus *_equal, same as the standard).
96 template <typename _Key
, typename _Tp
,
97 typename _Compare
= std::less
<_Key
>,
98 typename _Alloc
= std::allocator
<std::pair
<const _Key
, _Tp
> > >
102 typedef _Key key_type
;
103 typedef _Tp mapped_type
;
104 typedef std::pair
<const _Key
, _Tp
> value_type
;
105 typedef _Compare key_compare
;
106 typedef _Alloc allocator_type
;
109 #ifdef _GLIBCXX_CONCEPT_CHECKS
110 // concept requirements
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");
127 : public std::binary_function
<value_type
, value_type
, bool>
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
); }
142 /// This turns a red-black tree into a [multi]map.
143 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
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
;
148 /// The actual tree structure.
151 typedef __gnu_cxx::__alloc_traits
<_Pair_alloc_type
> _Alloc_traits
;
154 // many of these are specified differently in ISO, but the following are
155 // "functionally equivalent"
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
;
171 // [23.3.2] construct/copy/destroy
172 // (get_allocator() is also listed in this section)
175 * @brief Default constructor creates no elements.
177 #if __cplusplus < 201103L
178 multimap() : _M_t() { }
180 multimap() = default;
184 * @brief Creates a %multimap with no elements.
185 * @param __comp A comparison object.
186 * @param __a An allocator object.
189 multimap(const _Compare
& __comp
,
190 const allocator_type
& __a
= allocator_type())
191 : _M_t(__comp
, _Pair_alloc_type(__a
)) { }
194 * @brief %Multimap copy constructor.
196 * Whether the allocator is copied depends on the allocator traits.
198 #if __cplusplus < 201103L
199 multimap(const multimap
& __x
)
202 multimap(const multimap
&) = default;
205 * @brief %Multimap move constructor.
207 * The newly-created %multimap contains the exact contents of the
208 * moved instance. The moved instance is a valid, but unspecified
211 multimap(multimap
&&) = default;
214 * @brief Builds a %multimap from an initializer_list.
215 * @param __l An initializer_list.
216 * @param __comp A comparison functor.
217 * @param __a An allocator object.
219 * Create a %multimap consisting of copies of the elements from
220 * the initializer_list. This is linear in N if the list is already
221 * sorted, and NlogN otherwise (where N is @a __l.size()).
223 multimap(initializer_list
<value_type
> __l
,
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()); }
229 /// Allocator-extended default constructor.
231 multimap(const allocator_type
& __a
)
232 : _M_t(_Pair_alloc_type(__a
)) { }
234 /// Allocator-extended copy constructor.
235 multimap(const multimap
& __m
, const allocator_type
& __a
)
236 : _M_t(__m
._M_t
, _Pair_alloc_type(__a
)) { }
238 /// Allocator-extended move constructor.
239 multimap(multimap
&& __m
, const allocator_type
& __a
)
240 noexcept(is_nothrow_copy_constructible
<_Compare
>::value
241 && _Alloc_traits::_S_always_equal())
242 : _M_t(std::move(__m
._M_t
), _Pair_alloc_type(__a
)) { }
244 /// Allocator-extended initialier-list constructor.
245 multimap(initializer_list
<value_type
> __l
, const allocator_type
& __a
)
246 : _M_t(_Pair_alloc_type(__a
))
247 { _M_t
._M_insert_equal(__l
.begin(), __l
.end()); }
249 /// Allocator-extended range constructor.
250 template<typename _InputIterator
>
251 multimap(_InputIterator __first
, _InputIterator __last
,
252 const allocator_type
& __a
)
253 : _M_t(_Pair_alloc_type(__a
))
254 { _M_t
._M_insert_equal(__first
, __last
); }
258 * @brief Builds a %multimap from a range.
259 * @param __first An input iterator.
260 * @param __last An input iterator.
262 * Create a %multimap consisting of copies of the elements from
263 * [__first,__last). This is linear in N if the range is already sorted,
264 * and NlogN otherwise (where N is distance(__first,__last)).
266 template<typename _InputIterator
>
267 multimap(_InputIterator __first
, _InputIterator __last
)
269 { _M_t
._M_insert_equal(__first
, __last
); }
272 * @brief Builds a %multimap from a range.
273 * @param __first An input iterator.
274 * @param __last An input iterator.
275 * @param __comp A comparison functor.
276 * @param __a An allocator object.
278 * Create a %multimap consisting of copies of the elements from
279 * [__first,__last). This is linear in N if the range is already sorted,
280 * and NlogN otherwise (where N is distance(__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
291 * The dtor only erases the elements, and note that if the elements
292 * themselves are pointers, the pointed-to memory is not touched in any
293 * way. Managing the pointer is the user's responsibility.
295 ~multimap() = default;
299 * @brief %Multimap assignment operator.
301 * Whether the allocator is copied depends on the allocator traits.
303 #if __cplusplus < 201103L
305 operator=(const multimap
& __x
)
312 operator=(const multimap
&) = default;
314 /// Move assignment operator.
316 operator=(multimap
&&) = default;
319 * @brief %Multimap list assignment operator.
320 * @param __l An initializer_list.
322 * This function fills a %multimap with copies of the elements
323 * in the initializer list @a __l.
325 * Note that the assignment completely changes the %multimap and
326 * that the resulting %multimap's size is the same as the number
327 * of elements assigned.
330 operator=(initializer_list
<value_type
> __l
)
332 _M_t
._M_assign_equal(__l
.begin(), __l
.end());
337 /// Get a copy of the memory allocation object.
339 get_allocator() const _GLIBCXX_NOEXCEPT
340 { return allocator_type(_M_t
.get_allocator()); }
344 * Returns a read/write iterator that points to the first pair in the
345 * %multimap. Iteration is done in ascending order according to the
349 begin() _GLIBCXX_NOEXCEPT
350 { return _M_t
.begin(); }
353 * Returns a read-only (constant) iterator that points to the first pair
354 * in the %multimap. Iteration is done in ascending order according to
358 begin() const _GLIBCXX_NOEXCEPT
359 { return _M_t
.begin(); }
362 * Returns a read/write iterator that points one past the last pair in
363 * the %multimap. Iteration is done in ascending order according to the
367 end() _GLIBCXX_NOEXCEPT
368 { return _M_t
.end(); }
371 * Returns a read-only (constant) iterator that points one past the last
372 * pair in the %multimap. Iteration is done in ascending order according
376 end() const _GLIBCXX_NOEXCEPT
377 { return _M_t
.end(); }
380 * Returns a read/write reverse iterator that points to the last pair in
381 * the %multimap. Iteration is done in descending order according to the
385 rbegin() _GLIBCXX_NOEXCEPT
386 { return _M_t
.rbegin(); }
389 * Returns a read-only (constant) reverse iterator that points to the
390 * last pair in the %multimap. Iteration is done in descending order
391 * according to the keys.
393 const_reverse_iterator
394 rbegin() const _GLIBCXX_NOEXCEPT
395 { return _M_t
.rbegin(); }
398 * Returns a read/write reverse iterator that points to one before the
399 * first pair in the %multimap. Iteration is done in descending order
400 * according to the keys.
403 rend() _GLIBCXX_NOEXCEPT
404 { return _M_t
.rend(); }
407 * Returns a read-only (constant) reverse iterator that points to one
408 * before the first pair in the %multimap. Iteration is done in
409 * descending order according to the keys.
411 const_reverse_iterator
412 rend() const _GLIBCXX_NOEXCEPT
413 { return _M_t
.rend(); }
415 #if __cplusplus >= 201103L
417 * Returns a read-only (constant) iterator that points to the first pair
418 * in the %multimap. Iteration is done in ascending order according to
422 cbegin() const noexcept
423 { return _M_t
.begin(); }
426 * Returns a read-only (constant) iterator that points one past the last
427 * pair in the %multimap. Iteration is done in ascending order according
431 cend() const noexcept
432 { return _M_t
.end(); }
435 * Returns a read-only (constant) reverse iterator that points to the
436 * last pair in the %multimap. Iteration is done in descending order
437 * according to the keys.
439 const_reverse_iterator
440 crbegin() const noexcept
441 { return _M_t
.rbegin(); }
444 * Returns a read-only (constant) reverse iterator that points to one
445 * before the first pair in the %multimap. Iteration is done in
446 * descending order according to the keys.
448 const_reverse_iterator
449 crend() const noexcept
450 { return _M_t
.rend(); }
454 /** Returns true if the %multimap is empty. */
456 empty() const _GLIBCXX_NOEXCEPT
457 { return _M_t
.empty(); }
459 /** Returns the size of the %multimap. */
461 size() const _GLIBCXX_NOEXCEPT
462 { return _M_t
.size(); }
464 /** Returns the maximum size of the %multimap. */
466 max_size() const _GLIBCXX_NOEXCEPT
467 { return _M_t
.max_size(); }
470 #if __cplusplus >= 201103L
472 * @brief Build and insert a std::pair into the %multimap.
474 * @param __args Arguments used to generate a new pair instance (see
475 * std::piecewise_contruct for passing arguments to each
476 * part of the pair constructor).
478 * @return An iterator that points to the inserted (key,value) pair.
480 * This function builds and inserts a (key, value) %pair into the
482 * Contrary to a std::map the %multimap does not rely on unique keys and
483 * thus multiple pairs with the same key can be inserted.
485 * Insertion requires logarithmic time.
487 template<typename
... _Args
>
489 emplace(_Args
&&... __args
)
490 { return _M_t
._M_emplace_equal(std::forward
<_Args
>(__args
)...); }
493 * @brief Builds and inserts a std::pair into the %multimap.
495 * @param __pos An iterator that serves as a hint as to where the pair
496 * should be inserted.
497 * @param __args Arguments used to generate a new pair instance (see
498 * std::piecewise_contruct for passing arguments to each
499 * part of the pair constructor).
500 * @return An iterator that points to the inserted (key,value) pair.
502 * This function inserts a (key, value) pair into the %multimap.
503 * Contrary to a std::map the %multimap does not rely on unique keys and
504 * thus multiple pairs with the same key can be inserted.
505 * Note that the first parameter is only a hint and can potentially
506 * improve the performance of the insertion process. A bad hint would
507 * cause no gains in efficiency.
509 * For more on @a hinting, see:
510 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
512 * Insertion requires logarithmic time (if the hint is not taken).
514 template<typename
... _Args
>
516 emplace_hint(const_iterator __pos
, _Args
&&... __args
)
518 return _M_t
._M_emplace_hint_equal(__pos
,
519 std::forward
<_Args
>(__args
)...);
524 * @brief Inserts a std::pair into the %multimap.
525 * @param __x Pair to be inserted (see std::make_pair for easy creation
527 * @return An iterator that points to the inserted (key,value) pair.
529 * This function inserts a (key, value) pair into the %multimap.
530 * Contrary to a std::map the %multimap does not rely on unique keys and
531 * thus multiple pairs with the same key can be inserted.
533 * Insertion requires logarithmic time.
537 insert(const value_type
& __x
)
538 { return _M_t
._M_insert_equal(__x
); }
540 #if __cplusplus >= 201103L
541 // _GLIBCXX_RESOLVE_LIB_DEFECTS
542 // 2354. Unnecessary copying when inserting into maps with braced-init
544 insert(value_type
&& __x
)
545 { return _M_t
._M_insert_equal(std::move(__x
)); }
547 template<typename _Pair
>
548 __enable_if_t
<is_constructible
<value_type
, _Pair
>::value
, iterator
>
550 { return _M_t
._M_emplace_equal(std::forward
<_Pair
>(__x
)); }
555 * @brief Inserts a std::pair into the %multimap.
556 * @param __position An iterator that serves as a hint as to where the
557 * pair should be inserted.
558 * @param __x Pair to be inserted (see std::make_pair for easy creation
560 * @return An iterator that points to the inserted (key,value) pair.
562 * This function inserts a (key, value) pair into the %multimap.
563 * Contrary to a std::map the %multimap does not rely on unique keys and
564 * thus multiple pairs with the same key can be inserted.
565 * Note that the first parameter is only a hint and can potentially
566 * improve the performance of the insertion process. A bad hint would
567 * cause no gains in efficiency.
569 * For more on @a hinting, see:
570 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
572 * Insertion requires logarithmic time (if the hint is not taken).
576 #if __cplusplus >= 201103L
577 insert(const_iterator __position
, const value_type
& __x
)
579 insert(iterator __position
, const value_type
& __x
)
581 { return _M_t
._M_insert_equal_(__position
, __x
); }
583 #if __cplusplus >= 201103L
584 // _GLIBCXX_RESOLVE_LIB_DEFECTS
585 // 2354. Unnecessary copying when inserting into maps with braced-init
587 insert(const_iterator __position
, value_type
&& __x
)
588 { return _M_t
._M_insert_equal_(__position
, std::move(__x
)); }
590 template<typename _Pair
>
591 __enable_if_t
<is_constructible
<value_type
, _Pair
&&>::value
, iterator
>
592 insert(const_iterator __position
, _Pair
&& __x
)
594 return _M_t
._M_emplace_hint_equal(__position
,
595 std::forward
<_Pair
>(__x
));
601 * @brief A template function that attempts to insert a range
603 * @param __first Iterator pointing to the start of the range to be
605 * @param __last Iterator pointing to the end of the range.
607 * Complexity similar to that of the range constructor.
609 template<typename _InputIterator
>
611 insert(_InputIterator __first
, _InputIterator __last
)
612 { _M_t
._M_insert_equal(__first
, __last
); }
614 #if __cplusplus >= 201103L
616 * @brief Attempts to insert a list of std::pairs into the %multimap.
617 * @param __l A std::initializer_list<value_type> of pairs to be
620 * Complexity similar to that of the range constructor.
623 insert(initializer_list
<value_type
> __l
)
624 { this->insert(__l
.begin(), __l
.end()); }
627 #if __cplusplus > 201402L
630 extract(const_iterator __pos
)
632 __glibcxx_assert(__pos
!= end());
633 return _M_t
.extract(__pos
);
638 extract(const key_type
& __x
)
639 { return _M_t
.extract(__x
); }
641 /// Re-insert an extracted node.
643 insert(node_type
&& __nh
)
644 { return _M_t
._M_reinsert_node_equal(std::move(__nh
)); }
646 /// Re-insert an extracted node.
648 insert(const_iterator __hint
, node_type
&& __nh
)
649 { return _M_t
._M_reinsert_node_hint_equal(__hint
, std::move(__nh
)); }
651 template<typename
, typename
>
652 friend class std::_Rb_tree_merge_helper
;
654 template<typename _C2
>
656 merge(multimap
<_Key
, _Tp
, _C2
, _Alloc
>& __source
)
658 using _Merge_helper
= _Rb_tree_merge_helper
<multimap
, _C2
>;
659 _M_t
._M_merge_equal(_Merge_helper::_S_get_tree(__source
));
662 template<typename _C2
>
664 merge(multimap
<_Key
, _Tp
, _C2
, _Alloc
>&& __source
)
667 template<typename _C2
>
669 merge(map
<_Key
, _Tp
, _C2
, _Alloc
>& __source
)
671 using _Merge_helper
= _Rb_tree_merge_helper
<multimap
, _C2
>;
672 _M_t
._M_merge_equal(_Merge_helper::_S_get_tree(__source
));
675 template<typename _C2
>
677 merge(map
<_Key
, _Tp
, _C2
, _Alloc
>&& __source
)
681 #if __cplusplus >= 201103L
682 // _GLIBCXX_RESOLVE_LIB_DEFECTS
683 // DR 130. Associative erase should return an iterator.
685 * @brief Erases an element from a %multimap.
686 * @param __position An iterator pointing to the element to be erased.
687 * @return An iterator pointing to the element immediately following
688 * @a position prior to the element being erased. If no such
689 * element exists, end() is returned.
691 * This function erases an element, pointed to by the given iterator,
692 * from a %multimap. Note that this function only erases the element,
693 * and that if the element is itself a pointer, the pointed-to memory is
694 * not touched in any way. Managing the pointer is the user's
700 erase(const_iterator __position
)
701 { return _M_t
.erase(__position
); }
704 _GLIBCXX_ABI_TAG_CXX11
706 erase(iterator __position
)
707 { return _M_t
.erase(__position
); }
711 * @brief Erases an element from a %multimap.
712 * @param __position An iterator pointing to the element to be erased.
714 * This function erases an element, pointed to by the given iterator,
715 * from a %multimap. Note that this function only erases the element,
716 * and that if the element is itself a pointer, the pointed-to memory is
717 * not touched in any way. Managing the pointer is the user's
721 erase(iterator __position
)
722 { _M_t
.erase(__position
); }
726 * @brief Erases elements according to the provided key.
727 * @param __x Key of element to be erased.
728 * @return The number of elements erased.
730 * This function erases all elements located by the given key from a
732 * Note that this function only erases the element, and that if
733 * the element is itself a pointer, the pointed-to memory is not touched
734 * in any way. Managing the pointer is the user's responsibility.
737 erase(const key_type
& __x
)
738 { return _M_t
.erase(__x
); }
740 #if __cplusplus >= 201103L
741 // _GLIBCXX_RESOLVE_LIB_DEFECTS
742 // DR 130. Associative erase should return an iterator.
744 * @brief Erases a [first,last) range of elements from a %multimap.
745 * @param __first Iterator pointing to the start of the range to be
747 * @param __last Iterator pointing to the end of the range to be
749 * @return The iterator @a __last.
751 * This function erases a sequence of elements from a %multimap.
752 * Note that this function only erases the elements, and that if
753 * the elements themselves are pointers, the pointed-to memory is not
754 * touched in any way. Managing the pointer is the user's
758 erase(const_iterator __first
, const_iterator __last
)
759 { return _M_t
.erase(__first
, __last
); }
761 // _GLIBCXX_RESOLVE_LIB_DEFECTS
762 // DR 130. Associative erase should return an iterator.
764 * @brief Erases a [first,last) range of elements from a %multimap.
765 * @param __first Iterator pointing to the start of the range to be
767 * @param __last Iterator pointing to the end of the range to
770 * This function erases a sequence of elements from a %multimap.
771 * Note that this function only erases the elements, and that if
772 * the elements themselves are pointers, the pointed-to memory is not
773 * touched in any way. Managing the pointer is the user's
777 erase(iterator __first
, iterator __last
)
778 { _M_t
.erase(__first
, __last
); }
782 * @brief Swaps data with another %multimap.
783 * @param __x A %multimap of the same element and allocator types.
785 * This exchanges the elements between two multimaps in constant time.
786 * (It is only swapping a pointer, an integer, and an instance of
787 * the @c Compare type (which itself is often stateless and empty), so it
788 * should be quite fast.)
789 * Note that the global std::swap() function is specialized such that
790 * std::swap(m1,m2) will feed to this function.
792 * Whether the allocators are swapped depends on the allocator traits.
796 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable
<_Compare
>::value
)
797 { _M_t
.swap(__x
._M_t
); }
800 * Erases all elements in a %multimap. Note that this function only
801 * erases the elements, and that if the elements themselves are pointers,
802 * the pointed-to memory is not touched in any way. Managing the pointer
803 * is the user's responsibility.
806 clear() _GLIBCXX_NOEXCEPT
811 * Returns the key comparison object out of which the %multimap
816 { return _M_t
.key_comp(); }
819 * Returns a value comparison object, built from the key comparison
820 * object out of which the %multimap was constructed.
824 { return value_compare(_M_t
.key_comp()); }
826 // multimap operations
830 * @brief Tries to locate an element in a %multimap.
831 * @param __x Key of (key, value) pair to be located.
832 * @return Iterator pointing to sought-after element,
833 * or end() if not found.
835 * This function takes a key and tries to locate the element with which
836 * the key matches. If successful the function returns an iterator
837 * pointing to the sought after %pair. If unsuccessful it returns the
838 * past-the-end ( @c end() ) iterator.
841 find(const key_type
& __x
)
842 { return _M_t
.find(__x
); }
844 #if __cplusplus > 201103L
845 template<typename _Kt
>
847 find(const _Kt
& __x
) -> decltype(_M_t
._M_find_tr(__x
))
848 { return _M_t
._M_find_tr(__x
); }
854 * @brief Tries to locate an element in a %multimap.
855 * @param __x Key of (key, value) pair to be located.
856 * @return Read-only (constant) iterator pointing to sought-after
857 * element, or end() if not found.
859 * This function takes a key and tries to locate the element with which
860 * the key matches. If successful the function returns a constant
861 * iterator pointing to the sought after %pair. If unsuccessful it
862 * returns the past-the-end ( @c end() ) iterator.
865 find(const key_type
& __x
) const
866 { return _M_t
.find(__x
); }
868 #if __cplusplus > 201103L
869 template<typename _Kt
>
871 find(const _Kt
& __x
) const -> decltype(_M_t
._M_find_tr(__x
))
872 { return _M_t
._M_find_tr(__x
); }
878 * @brief Finds the number of elements with given key.
879 * @param __x Key of (key, value) pairs to be located.
880 * @return Number of elements with specified key.
883 count(const key_type
& __x
) const
884 { return _M_t
.count(__x
); }
886 #if __cplusplus > 201103L
887 template<typename _Kt
>
889 count(const _Kt
& __x
) const -> decltype(_M_t
._M_count_tr(__x
))
890 { return _M_t
._M_count_tr(__x
); }
894 #if __cplusplus > 201703L
897 * @brief Finds whether an element with the given key exists.
898 * @param __x Key of (key, value) pairs to be located.
899 * @return True if there is any element with the specified key.
902 contains(const key_type
& __x
) const
903 { return _M_t
.find(__x
) != _M_t
.end(); }
905 template<typename _Kt
>
907 contains(const _Kt
& __x
) const
908 -> decltype(_M_t
._M_find_tr(__x
), void(), true)
909 { return _M_t
._M_find_tr(__x
) != _M_t
.end(); }
915 * @brief Finds the beginning of a subsequence matching given key.
916 * @param __x Key of (key, value) pair to be located.
917 * @return Iterator pointing to first element equal to or greater
918 * than key, or end().
920 * This function returns the first element of a subsequence of elements
921 * that matches the given key. If unsuccessful it returns an iterator
922 * pointing to the first element that has a greater value than given key
923 * or end() if no such element exists.
926 lower_bound(const key_type
& __x
)
927 { return _M_t
.lower_bound(__x
); }
929 #if __cplusplus > 201103L
930 template<typename _Kt
>
932 lower_bound(const _Kt
& __x
)
933 -> decltype(iterator(_M_t
._M_lower_bound_tr(__x
)))
934 { return iterator(_M_t
._M_lower_bound_tr(__x
)); }
940 * @brief Finds the beginning of a subsequence matching given key.
941 * @param __x Key of (key, value) pair to be located.
942 * @return Read-only (constant) iterator pointing to first element
943 * equal to or greater than key, or end().
945 * This function returns the first element of a subsequence of
946 * elements that matches the given key. If unsuccessful the
947 * iterator will point to the next greatest element or, if no
948 * such greater element exists, to end().
951 lower_bound(const key_type
& __x
) const
952 { return _M_t
.lower_bound(__x
); }
954 #if __cplusplus > 201103L
955 template<typename _Kt
>
957 lower_bound(const _Kt
& __x
) const
958 -> decltype(const_iterator(_M_t
._M_lower_bound_tr(__x
)))
959 { return const_iterator(_M_t
._M_lower_bound_tr(__x
)); }
965 * @brief Finds the end of a subsequence matching given key.
966 * @param __x Key of (key, value) pair to be located.
967 * @return Iterator pointing to the first element
968 * greater than key, or end().
971 upper_bound(const key_type
& __x
)
972 { return _M_t
.upper_bound(__x
); }
974 #if __cplusplus > 201103L
975 template<typename _Kt
>
977 upper_bound(const _Kt
& __x
)
978 -> decltype(iterator(_M_t
._M_upper_bound_tr(__x
)))
979 { return iterator(_M_t
._M_upper_bound_tr(__x
)); }
985 * @brief Finds the end of a subsequence matching given key.
986 * @param __x Key of (key, value) pair to be located.
987 * @return Read-only (constant) iterator pointing to first iterator
988 * greater than key, or end().
991 upper_bound(const key_type
& __x
) const
992 { return _M_t
.upper_bound(__x
); }
994 #if __cplusplus > 201103L
995 template<typename _Kt
>
997 upper_bound(const _Kt
& __x
) const
998 -> decltype(const_iterator(_M_t
._M_upper_bound_tr(__x
)))
999 { return const_iterator(_M_t
._M_upper_bound_tr(__x
)); }
1005 * @brief Finds a subsequence matching given key.
1006 * @param __x Key of (key, value) pairs to be located.
1007 * @return Pair of iterators that possibly points to the subsequence
1008 * matching given key.
1010 * This function is equivalent to
1012 * std::make_pair(c.lower_bound(val),
1013 * c.upper_bound(val))
1015 * (but is faster than making the calls separately).
1017 std::pair
<iterator
, iterator
>
1018 equal_range(const key_type
& __x
)
1019 { return _M_t
.equal_range(__x
); }
1021 #if __cplusplus > 201103L
1022 template<typename _Kt
>
1024 equal_range(const _Kt
& __x
)
1025 -> decltype(pair
<iterator
, iterator
>(_M_t
._M_equal_range_tr(__x
)))
1026 { return pair
<iterator
, iterator
>(_M_t
._M_equal_range_tr(__x
)); }
1032 * @brief Finds a subsequence matching given key.
1033 * @param __x Key of (key, value) pairs to be located.
1034 * @return Pair of read-only (constant) iterators that possibly points
1035 * to the subsequence matching given key.
1037 * This function is equivalent to
1039 * std::make_pair(c.lower_bound(val),
1040 * c.upper_bound(val))
1042 * (but is faster than making the calls separately).
1044 std::pair
<const_iterator
, const_iterator
>
1045 equal_range(const key_type
& __x
) const
1046 { return _M_t
.equal_range(__x
); }
1048 #if __cplusplus > 201103L
1049 template<typename _Kt
>
1051 equal_range(const _Kt
& __x
) const
1052 -> decltype(pair
<const_iterator
, const_iterator
>(
1053 _M_t
._M_equal_range_tr(__x
)))
1055 return pair
<const_iterator
, const_iterator
>(
1056 _M_t
._M_equal_range_tr(__x
));
1061 template<typename _K1
, typename _T1
, typename _C1
, typename _A1
>
1063 operator==(const multimap
<_K1
, _T1
, _C1
, _A1
>&,
1064 const multimap
<_K1
, _T1
, _C1
, _A1
>&);
1066 template<typename _K1
, typename _T1
, typename _C1
, typename _A1
>
1068 operator<(const multimap
<_K1
, _T1
, _C1
, _A1
>&,
1069 const multimap
<_K1
, _T1
, _C1
, _A1
>&);
1072 #if __cpp_deduction_guides >= 201606
1074 template<typename _InputIterator
,
1075 typename _Compare
= less
<__iter_key_t
<_InputIterator
>>,
1076 typename _Allocator
= allocator
<__iter_to_alloc_t
<_InputIterator
>>,
1077 typename
= _RequireInputIter
<_InputIterator
>,
1078 typename
= _RequireAllocator
<_Allocator
>>
1079 multimap(_InputIterator
, _InputIterator
,
1080 _Compare
= _Compare(), _Allocator
= _Allocator())
1081 -> multimap
<__iter_key_t
<_InputIterator
>, __iter_val_t
<_InputIterator
>,
1082 _Compare
, _Allocator
>;
1084 template<typename _Key
, typename _Tp
, typename _Compare
= less
<_Key
>,
1085 typename _Allocator
= allocator
<pair
<const _Key
, _Tp
>>,
1086 typename
= _RequireAllocator
<_Allocator
>>
1087 multimap(initializer_list
<pair
<_Key
, _Tp
>>,
1088 _Compare
= _Compare(), _Allocator
= _Allocator())
1089 -> multimap
<_Key
, _Tp
, _Compare
, _Allocator
>;
1091 template<typename _InputIterator
, typename _Allocator
,
1092 typename
= _RequireInputIter
<_InputIterator
>,
1093 typename
= _RequireAllocator
<_Allocator
>>
1094 multimap(_InputIterator
, _InputIterator
, _Allocator
)
1095 -> multimap
<__iter_key_t
<_InputIterator
>, __iter_val_t
<_InputIterator
>,
1096 less
<__iter_key_t
<_InputIterator
>>, _Allocator
>;
1098 template<typename _Key
, typename _Tp
, typename _Allocator
,
1099 typename
= _RequireAllocator
<_Allocator
>>
1100 multimap(initializer_list
<pair
<_Key
, _Tp
>>, _Allocator
)
1101 -> multimap
<_Key
, _Tp
, less
<_Key
>, _Allocator
>;
1106 * @brief Multimap equality comparison.
1107 * @param __x A %multimap.
1108 * @param __y A %multimap of the same type as @a __x.
1109 * @return True iff the size and elements of the maps are equal.
1111 * This is an equivalence relation. It is linear in the size of the
1112 * multimaps. Multimaps are considered equivalent if their sizes are equal,
1113 * and if corresponding elements compare equal.
1115 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1117 operator==(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1118 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1119 { return __x
._M_t
== __y
._M_t
; }
1122 * @brief Multimap ordering relation.
1123 * @param __x A %multimap.
1124 * @param __y A %multimap of the same type as @a __x.
1125 * @return True iff @a x is lexicographically less than @a y.
1127 * This is a total ordering relation. It is linear in the size of the
1128 * multimaps. The elements must be comparable with @c <.
1130 * See std::lexicographical_compare() for how the determination is made.
1132 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1134 operator<(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1135 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1136 { return __x
._M_t
< __y
._M_t
; }
1138 /// Based on operator==
1139 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1141 operator!=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1142 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1143 { return !(__x
== __y
); }
1145 /// Based on operator<
1146 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1148 operator>(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1149 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1150 { return __y
< __x
; }
1152 /// Based on operator<
1153 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1155 operator<=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1156 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1157 { return !(__y
< __x
); }
1159 /// Based on operator<
1160 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1162 operator>=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1163 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1164 { return !(__x
< __y
); }
1166 /// See std::multimap::swap().
1167 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1169 swap(multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1170 multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1171 _GLIBCXX_NOEXCEPT_IF(noexcept(__x
.swap(__y
)))
1174 _GLIBCXX_END_NAMESPACE_CONTAINER
1176 #if __cplusplus > 201402L
1177 // Allow std::multimap access to internals of compatible maps.
1178 template<typename _Key
, typename _Val
, typename _Cmp1
, typename _Alloc
,
1181 _Rb_tree_merge_helper
<_GLIBCXX_STD_C::multimap
<_Key
, _Val
, _Cmp1
, _Alloc
>,
1185 friend class _GLIBCXX_STD_C::multimap
<_Key
, _Val
, _Cmp1
, _Alloc
>;
1188 _S_get_tree(_GLIBCXX_STD_C::map
<_Key
, _Val
, _Cmp2
, _Alloc
>& __map
)
1189 { return __map
._M_t
; }
1192 _S_get_tree(_GLIBCXX_STD_C::multimap
<_Key
, _Val
, _Cmp2
, _Alloc
>& __map
)
1193 { return __map
._M_t
; }
1197 _GLIBCXX_END_NAMESPACE_VERSION
1200 #endif /* _STL_MULTIMAP_H */