1 // Multimap implementation -*- C++ -*-
3 // Copyright (C) 2001-2015 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_CONTAINER
69 * @brief A standard container made up of (key,value) pairs, which can be
70 * retrieved based on a key, in logarithmic time.
72 * @ingroup associative_containers
74 * @tparam _Key Type of key objects.
75 * @tparam _Tp Type of mapped objects.
76 * @tparam _Compare Comparison function object type, defaults to less<_Key>.
77 * @tparam _Alloc Allocator type, defaults to
78 * allocator<pair<const _Key, _Tp>.
80 * Meets the requirements of a <a href="tables.html#65">container</a>, a
81 * <a href="tables.html#66">reversible container</a>, and an
82 * <a href="tables.html#69">associative container</a> (using equivalent
83 * keys). For a @c multimap<Key,T> the key_type is Key, the mapped_type
84 * is T, and the value_type is std::pair<const Key,T>.
86 * Multimaps support bidirectional iterators.
88 * The private tree data is declared exactly the same way for map and
89 * multimap; the distinction is made entirely in how the tree functions are
90 * called (*_unique versus *_equal, same as the standard).
92 template <typename _Key
, typename _Tp
,
93 typename _Compare
= std::less
<_Key
>,
94 typename _Alloc
= std::allocator
<std::pair
<const _Key
, _Tp
> > >
98 typedef _Key key_type
;
99 typedef _Tp mapped_type
;
100 typedef std::pair
<const _Key
, _Tp
> value_type
;
101 typedef _Compare key_compare
;
102 typedef _Alloc allocator_type
;
105 // concept requirements
106 typedef typename
_Alloc::value_type _Alloc_value_type
;
107 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
108 __glibcxx_class_requires4(_Compare
, bool, _Key
, _Key
,
109 _BinaryFunctionConcept
)
110 __glibcxx_class_requires2(value_type
, _Alloc_value_type
, _SameTypeConcept
)
114 : public std::binary_function
<value_type
, value_type
, bool>
116 friend class multimap
<_Key
, _Tp
, _Compare
, _Alloc
>;
120 value_compare(_Compare __c
)
124 bool operator()(const value_type
& __x
, const value_type
& __y
) const
125 { return comp(__x
.first
, __y
.first
); }
129 /// This turns a red-black tree into a [multi]map.
130 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
131 rebind
<value_type
>::other _Pair_alloc_type
;
133 typedef _Rb_tree
<key_type
, value_type
, _Select1st
<value_type
>,
134 key_compare
, _Pair_alloc_type
> _Rep_type
;
135 /// The actual tree structure.
138 typedef __gnu_cxx::__alloc_traits
<_Pair_alloc_type
> _Alloc_traits
;
141 // many of these are specified differently in ISO, but the following are
142 // "functionally equivalent"
143 typedef typename
_Alloc_traits::pointer pointer
;
144 typedef typename
_Alloc_traits::const_pointer const_pointer
;
145 typedef typename
_Alloc_traits::reference reference
;
146 typedef typename
_Alloc_traits::const_reference const_reference
;
147 typedef typename
_Rep_type::iterator iterator
;
148 typedef typename
_Rep_type::const_iterator const_iterator
;
149 typedef typename
_Rep_type::size_type size_type
;
150 typedef typename
_Rep_type::difference_type difference_type
;
151 typedef typename
_Rep_type::reverse_iterator reverse_iterator
;
152 typedef typename
_Rep_type::const_reverse_iterator const_reverse_iterator
;
154 // [23.3.2] construct/copy/destroy
155 // (get_allocator() is also listed in this section)
158 * @brief Default constructor creates no elements.
164 * @brief Creates a %multimap with no elements.
165 * @param __comp A comparison object.
166 * @param __a An allocator object.
169 multimap(const _Compare
& __comp
,
170 const allocator_type
& __a
= allocator_type())
171 : _M_t(__comp
, _Pair_alloc_type(__a
)) { }
174 * @brief %Multimap copy constructor.
175 * @param __x A %multimap of identical element and allocator types.
177 * The newly-created %multimap uses a copy of the allocation object
180 multimap(const multimap
& __x
)
183 #if __cplusplus >= 201103L
185 * @brief %Multimap move constructor.
186 * @param __x A %multimap of identical element and allocator types.
188 * The newly-created %multimap contains the exact contents of @a __x.
189 * The contents of @a __x are a valid, but unspecified %multimap.
191 multimap(multimap
&& __x
)
192 noexcept(is_nothrow_copy_constructible
<_Compare
>::value
)
193 : _M_t(std::move(__x
._M_t
)) { }
196 * @brief Builds a %multimap from an initializer_list.
197 * @param __l An initializer_list.
198 * @param __comp A comparison functor.
199 * @param __a An allocator object.
201 * Create a %multimap consisting of copies of the elements from
202 * the initializer_list. This is linear in N if the list is already
203 * sorted, and NlogN otherwise (where N is @a __l.size()).
205 multimap(initializer_list
<value_type
> __l
,
206 const _Compare
& __comp
= _Compare(),
207 const allocator_type
& __a
= allocator_type())
208 : _M_t(__comp
, _Pair_alloc_type(__a
))
209 { _M_t
._M_insert_equal(__l
.begin(), __l
.end()); }
211 /// Allocator-extended default constructor.
213 multimap(const allocator_type
& __a
)
214 : _M_t(_Compare(), _Pair_alloc_type(__a
)) { }
216 /// Allocator-extended copy constructor.
217 multimap(const multimap
& __m
, const allocator_type
& __a
)
218 : _M_t(__m
._M_t
, _Pair_alloc_type(__a
)) { }
220 /// Allocator-extended move constructor.
221 multimap(multimap
&& __m
, const allocator_type
& __a
)
222 noexcept(is_nothrow_copy_constructible
<_Compare
>::value
223 && _Alloc_traits::_S_always_equal())
224 : _M_t(std::move(__m
._M_t
), _Pair_alloc_type(__a
)) { }
226 /// Allocator-extended initialier-list constructor.
227 multimap(initializer_list
<value_type
> __l
, const allocator_type
& __a
)
228 : _M_t(_Compare(), _Pair_alloc_type(__a
))
229 { _M_t
._M_insert_equal(__l
.begin(), __l
.end()); }
231 /// Allocator-extended range constructor.
232 template<typename _InputIterator
>
233 multimap(_InputIterator __first
, _InputIterator __last
,
234 const allocator_type
& __a
)
235 : _M_t(_Compare(), _Pair_alloc_type(__a
))
236 { _M_t
._M_insert_equal(__first
, __last
); }
240 * @brief Builds a %multimap from a range.
241 * @param __first An input iterator.
242 * @param __last An input iterator.
244 * Create a %multimap consisting of copies of the elements from
245 * [__first,__last). This is linear in N if the range is already sorted,
246 * and NlogN otherwise (where N is distance(__first,__last)).
248 template<typename _InputIterator
>
249 multimap(_InputIterator __first
, _InputIterator __last
)
251 { _M_t
._M_insert_equal(__first
, __last
); }
254 * @brief Builds a %multimap from a range.
255 * @param __first An input iterator.
256 * @param __last An input iterator.
257 * @param __comp A comparison functor.
258 * @param __a An allocator object.
260 * Create a %multimap consisting of copies of the elements from
261 * [__first,__last). This is linear in N if the range is already sorted,
262 * and NlogN otherwise (where N is distance(__first,__last)).
264 template<typename _InputIterator
>
265 multimap(_InputIterator __first
, _InputIterator __last
,
266 const _Compare
& __comp
,
267 const allocator_type
& __a
= allocator_type())
268 : _M_t(__comp
, _Pair_alloc_type(__a
))
269 { _M_t
._M_insert_equal(__first
, __last
); }
271 // FIXME There is no dtor declared, but we should have something generated
272 // by Doxygen. I don't know what tags to add to this paragraph to make
275 * The dtor only erases the elements, and note that if the elements
276 * themselves are pointers, the pointed-to memory is not touched in any
277 * way. Managing the pointer is the user's responsibility.
281 * @brief %Multimap assignment operator.
282 * @param __x A %multimap of identical element and allocator types.
284 * All the elements of @a __x are copied, but unlike the copy
285 * constructor, the allocator object is not copied.
288 operator=(const multimap
& __x
)
294 #if __cplusplus >= 201103L
295 /// Move assignment operator.
297 operator=(multimap
&&) = default;
300 * @brief %Multimap list assignment operator.
301 * @param __l An initializer_list.
303 * This function fills a %multimap with copies of the elements
304 * in the initializer list @a __l.
306 * Note that the assignment completely changes the %multimap and
307 * that the resulting %multimap's size is the same as the number
308 * of elements assigned. Old data may be lost.
311 operator=(initializer_list
<value_type
> __l
)
313 _M_t
._M_assign_equal(__l
.begin(), __l
.end());
318 /// Get a copy of the memory allocation object.
320 get_allocator() const _GLIBCXX_NOEXCEPT
321 { return allocator_type(_M_t
.get_allocator()); }
325 * Returns a read/write iterator that points to the first pair in the
326 * %multimap. Iteration is done in ascending order according to the
330 begin() _GLIBCXX_NOEXCEPT
331 { return _M_t
.begin(); }
334 * Returns a read-only (constant) iterator that points to the first pair
335 * in the %multimap. Iteration is done in ascending order according to
339 begin() const _GLIBCXX_NOEXCEPT
340 { return _M_t
.begin(); }
343 * Returns a read/write iterator that points one past the last pair in
344 * the %multimap. Iteration is done in ascending order according to the
348 end() _GLIBCXX_NOEXCEPT
349 { return _M_t
.end(); }
352 * Returns a read-only (constant) iterator that points one past the last
353 * pair in the %multimap. Iteration is done in ascending order according
357 end() const _GLIBCXX_NOEXCEPT
358 { return _M_t
.end(); }
361 * Returns a read/write reverse iterator that points to the last pair in
362 * the %multimap. Iteration is done in descending order according to the
366 rbegin() _GLIBCXX_NOEXCEPT
367 { return _M_t
.rbegin(); }
370 * Returns a read-only (constant) reverse iterator that points to the
371 * last pair in the %multimap. Iteration is done in descending order
372 * according to the keys.
374 const_reverse_iterator
375 rbegin() const _GLIBCXX_NOEXCEPT
376 { return _M_t
.rbegin(); }
379 * Returns a read/write reverse iterator that points to one before the
380 * first pair in the %multimap. Iteration is done in descending order
381 * according to the keys.
384 rend() _GLIBCXX_NOEXCEPT
385 { return _M_t
.rend(); }
388 * Returns a read-only (constant) reverse iterator that points to one
389 * before the first pair in the %multimap. Iteration is done in
390 * descending order according to the keys.
392 const_reverse_iterator
393 rend() const _GLIBCXX_NOEXCEPT
394 { return _M_t
.rend(); }
396 #if __cplusplus >= 201103L
398 * Returns a read-only (constant) iterator that points to the first pair
399 * in the %multimap. Iteration is done in ascending order according to
403 cbegin() const noexcept
404 { return _M_t
.begin(); }
407 * Returns a read-only (constant) iterator that points one past the last
408 * pair in the %multimap. Iteration is done in ascending order according
412 cend() const noexcept
413 { return _M_t
.end(); }
416 * Returns a read-only (constant) reverse iterator that points to the
417 * last pair in the %multimap. Iteration is done in descending order
418 * according to the keys.
420 const_reverse_iterator
421 crbegin() const noexcept
422 { return _M_t
.rbegin(); }
425 * Returns a read-only (constant) reverse iterator that points to one
426 * before the first pair in the %multimap. Iteration is done in
427 * descending order according to the keys.
429 const_reverse_iterator
430 crend() const noexcept
431 { return _M_t
.rend(); }
435 /** Returns true if the %multimap is empty. */
437 empty() const _GLIBCXX_NOEXCEPT
438 { return _M_t
.empty(); }
440 /** Returns the size of the %multimap. */
442 size() const _GLIBCXX_NOEXCEPT
443 { return _M_t
.size(); }
445 /** Returns the maximum size of the %multimap. */
447 max_size() const _GLIBCXX_NOEXCEPT
448 { return _M_t
.max_size(); }
451 #if __cplusplus >= 201103L
453 * @brief Build and insert a std::pair into the %multimap.
455 * @param __args Arguments used to generate a new pair instance (see
456 * std::piecewise_contruct for passing arguments to each
457 * part of the pair constructor).
459 * @return An iterator that points to the inserted (key,value) pair.
461 * This function builds and inserts a (key, value) %pair into the
463 * Contrary to a std::map the %multimap does not rely on unique keys and
464 * thus multiple pairs with the same key can be inserted.
466 * Insertion requires logarithmic time.
468 template<typename
... _Args
>
470 emplace(_Args
&&... __args
)
471 { return _M_t
._M_emplace_equal(std::forward
<_Args
>(__args
)...); }
474 * @brief Builds and inserts a std::pair into the %multimap.
476 * @param __pos An iterator that serves as a hint as to where the pair
477 * should be inserted.
478 * @param __args Arguments used to generate a new pair instance (see
479 * std::piecewise_contruct for passing arguments to each
480 * part of the pair constructor).
481 * @return An iterator that points to the inserted (key,value) pair.
483 * This function inserts a (key, value) pair into the %multimap.
484 * Contrary to a std::map the %multimap does not rely on unique keys and
485 * thus multiple pairs with the same key can be inserted.
486 * Note that the first parameter is only a hint and can potentially
487 * improve the performance of the insertion process. A bad hint would
488 * cause no gains in efficiency.
490 * For more on @a hinting, see:
491 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
493 * Insertion requires logarithmic time (if the hint is not taken).
495 template<typename
... _Args
>
497 emplace_hint(const_iterator __pos
, _Args
&&... __args
)
499 return _M_t
._M_emplace_hint_equal(__pos
,
500 std::forward
<_Args
>(__args
)...);
505 * @brief Inserts a std::pair into the %multimap.
506 * @param __x Pair to be inserted (see std::make_pair for easy creation
508 * @return An iterator that points to the inserted (key,value) pair.
510 * This function inserts a (key, value) pair into the %multimap.
511 * Contrary to a std::map the %multimap does not rely on unique keys and
512 * thus multiple pairs with the same key can be inserted.
514 * Insertion requires logarithmic time.
517 insert(const value_type
& __x
)
518 { return _M_t
._M_insert_equal(__x
); }
520 #if __cplusplus >= 201103L
521 template<typename _Pair
, typename
= typename
522 std::enable_if
<std::is_constructible
<value_type
,
523 _Pair
&&>::value
>::type
>
526 { return _M_t
._M_insert_equal(std::forward
<_Pair
>(__x
)); }
530 * @brief Inserts a std::pair into the %multimap.
531 * @param __position An iterator that serves as a hint as to where the
532 * pair should be inserted.
533 * @param __x Pair to be inserted (see std::make_pair for easy creation
535 * @return An iterator that points to the inserted (key,value) pair.
537 * This function inserts a (key, value) pair into the %multimap.
538 * Contrary to a std::map the %multimap does not rely on unique keys and
539 * thus multiple pairs with the same key can be inserted.
540 * Note that the first parameter is only a hint and can potentially
541 * improve the performance of the insertion process. A bad hint would
542 * cause no gains in efficiency.
544 * For more on @a hinting, see:
545 * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
547 * Insertion requires logarithmic time (if the hint is not taken).
550 #if __cplusplus >= 201103L
551 insert(const_iterator __position
, const value_type
& __x
)
553 insert(iterator __position
, const value_type
& __x
)
555 { return _M_t
._M_insert_equal_(__position
, __x
); }
557 #if __cplusplus >= 201103L
558 template<typename _Pair
, typename
= typename
559 std::enable_if
<std::is_constructible
<value_type
,
560 _Pair
&&>::value
>::type
>
562 insert(const_iterator __position
, _Pair
&& __x
)
563 { return _M_t
._M_insert_equal_(__position
,
564 std::forward
<_Pair
>(__x
)); }
568 * @brief A template function that attempts to insert a range
570 * @param __first Iterator pointing to the start of the range to be
572 * @param __last Iterator pointing to the end of the range.
574 * Complexity similar to that of the range constructor.
576 template<typename _InputIterator
>
578 insert(_InputIterator __first
, _InputIterator __last
)
579 { _M_t
._M_insert_equal(__first
, __last
); }
581 #if __cplusplus >= 201103L
583 * @brief Attempts to insert a list of std::pairs into the %multimap.
584 * @param __l A std::initializer_list<value_type> of pairs to be
587 * Complexity similar to that of the range constructor.
590 insert(initializer_list
<value_type
> __l
)
591 { this->insert(__l
.begin(), __l
.end()); }
594 #if __cplusplus >= 201103L
595 // _GLIBCXX_RESOLVE_LIB_DEFECTS
596 // DR 130. Associative erase should return an iterator.
598 * @brief Erases an element from a %multimap.
599 * @param __position An iterator pointing to the element to be erased.
600 * @return An iterator pointing to the element immediately following
601 * @a position prior to the element being erased. If no such
602 * element exists, end() is returned.
604 * This function erases an element, pointed to by the given iterator,
605 * from a %multimap. Note that this function only erases the element,
606 * and that if the element is itself a pointer, the pointed-to memory is
607 * not touched in any way. Managing the pointer is the user's
611 erase(const_iterator __position
)
612 { return _M_t
.erase(__position
); }
615 _GLIBCXX_ABI_TAG_CXX11
617 erase(iterator __position
)
618 { return _M_t
.erase(__position
); }
621 * @brief Erases an element from a %multimap.
622 * @param __position An iterator pointing to the element to be erased.
624 * This function erases an element, pointed to by the given iterator,
625 * from a %multimap. Note that this function only erases the element,
626 * and that if the element is itself a pointer, the pointed-to memory is
627 * not touched in any way. Managing the pointer is the user's
631 erase(iterator __position
)
632 { _M_t
.erase(__position
); }
636 * @brief Erases elements according to the provided key.
637 * @param __x Key of element to be erased.
638 * @return The number of elements erased.
640 * This function erases all elements located by the given key from a
642 * Note that this function only erases the element, and that if
643 * the element is itself a pointer, the pointed-to memory is not touched
644 * in any way. Managing the pointer is the user's responsibility.
647 erase(const key_type
& __x
)
648 { return _M_t
.erase(__x
); }
650 #if __cplusplus >= 201103L
651 // _GLIBCXX_RESOLVE_LIB_DEFECTS
652 // DR 130. Associative erase should return an iterator.
654 * @brief Erases a [first,last) range of elements from a %multimap.
655 * @param __first Iterator pointing to the start of the range to be
657 * @param __last Iterator pointing to the end of the range to be
659 * @return The iterator @a __last.
661 * This function erases a sequence of elements from a %multimap.
662 * Note that this function only erases the elements, and that if
663 * the elements themselves are pointers, the pointed-to memory is not
664 * touched in any way. Managing the pointer is the user's
668 erase(const_iterator __first
, const_iterator __last
)
669 { return _M_t
.erase(__first
, __last
); }
671 // _GLIBCXX_RESOLVE_LIB_DEFECTS
672 // DR 130. Associative erase should return an iterator.
674 * @brief Erases a [first,last) range of elements from a %multimap.
675 * @param __first Iterator pointing to the start of the range to be
677 * @param __last Iterator pointing to the end of the range to
680 * This function erases a sequence of elements from a %multimap.
681 * Note that this function only erases the elements, and that if
682 * the elements themselves are pointers, the pointed-to memory is not
683 * touched in any way. Managing the pointer is the user's
687 erase(iterator __first
, iterator __last
)
688 { _M_t
.erase(__first
, __last
); }
692 * @brief Swaps data with another %multimap.
693 * @param __x A %multimap of the same element and allocator types.
695 * This exchanges the elements between two multimaps in constant time.
696 * (It is only swapping a pointer, an integer, and an instance of
697 * the @c Compare type (which itself is often stateless and empty), so it
698 * should be quite fast.)
699 * Note that the global std::swap() function is specialized such that
700 * std::swap(m1,m2) will feed to this function.
704 #if __cplusplus >= 201103L
705 noexcept(_Alloc_traits::_S_nothrow_swap())
707 { _M_t
.swap(__x
._M_t
); }
710 * Erases all elements in a %multimap. Note that this function only
711 * erases the elements, and that if the elements themselves are pointers,
712 * the pointed-to memory is not touched in any way. Managing the pointer
713 * is the user's responsibility.
716 clear() _GLIBCXX_NOEXCEPT
721 * Returns the key comparison object out of which the %multimap
726 { return _M_t
.key_comp(); }
729 * Returns a value comparison object, built from the key comparison
730 * object out of which the %multimap was constructed.
734 { return value_compare(_M_t
.key_comp()); }
736 // multimap operations
740 * @brief Tries to locate an element in a %multimap.
741 * @param __x Key of (key, value) pair to be located.
742 * @return Iterator pointing to sought-after element,
743 * or end() if not found.
745 * This function takes a key and tries to locate the element with which
746 * the key matches. If successful the function returns an iterator
747 * pointing to the sought after %pair. If unsuccessful it returns the
748 * past-the-end ( @c end() ) iterator.
751 find(const key_type
& __x
)
752 { return _M_t
.find(__x
); }
754 #if __cplusplus > 201103L
755 template<typename _Kt
>
757 find(const _Kt
& __x
) -> decltype(_M_t
._M_find_tr(__x
))
758 { return _M_t
._M_find_tr(__x
); }
764 * @brief Tries to locate an element in a %multimap.
765 * @param __x Key of (key, value) pair to be located.
766 * @return Read-only (constant) iterator pointing to sought-after
767 * element, or end() if not found.
769 * This function takes a key and tries to locate the element with which
770 * the key matches. If successful the function returns a constant
771 * iterator pointing to the sought after %pair. If unsuccessful it
772 * returns the past-the-end ( @c end() ) iterator.
775 find(const key_type
& __x
) const
776 { return _M_t
.find(__x
); }
778 #if __cplusplus > 201103L
779 template<typename _Kt
>
781 find(const _Kt
& __x
) const -> decltype(_M_t
._M_find_tr(__x
))
782 { return _M_t
._M_find_tr(__x
); }
788 * @brief Finds the number of elements with given key.
789 * @param __x Key of (key, value) pairs to be located.
790 * @return Number of elements with specified key.
793 count(const key_type
& __x
) const
794 { return _M_t
.count(__x
); }
796 #if __cplusplus > 201103L
797 template<typename _Kt
>
799 count(const _Kt
& __x
) const -> decltype(_M_t
._M_count_tr(__x
))
800 { return _M_t
._M_count_tr(__x
); }
806 * @brief Finds the beginning of a subsequence matching given key.
807 * @param __x Key of (key, value) pair to be located.
808 * @return Iterator pointing to first element equal to or greater
809 * than key, or end().
811 * This function returns the first element of a subsequence of elements
812 * that matches the given key. If unsuccessful it returns an iterator
813 * pointing to the first element that has a greater value than given key
814 * or end() if no such element exists.
817 lower_bound(const key_type
& __x
)
818 { return _M_t
.lower_bound(__x
); }
820 #if __cplusplus > 201103L
821 template<typename _Kt
>
823 lower_bound(const _Kt
& __x
)
824 -> decltype(_M_t
._M_lower_bound_tr(__x
))
825 { return _M_t
._M_lower_bound_tr(__x
); }
831 * @brief Finds the beginning of a subsequence matching given key.
832 * @param __x Key of (key, value) pair to be located.
833 * @return Read-only (constant) iterator pointing to first element
834 * equal to or greater than key, or end().
836 * This function returns the first element of a subsequence of
837 * elements that matches the given key. If unsuccessful the
838 * iterator will point to the next greatest element or, if no
839 * such greater element exists, to end().
842 lower_bound(const key_type
& __x
) const
843 { return _M_t
.lower_bound(__x
); }
845 #if __cplusplus > 201103L
846 template<typename _Kt
>
848 lower_bound(const _Kt
& __x
) const
849 -> decltype(_M_t
._M_lower_bound_tr(__x
))
850 { return _M_t
._M_lower_bound_tr(__x
); }
856 * @brief Finds the end of a subsequence matching given key.
857 * @param __x Key of (key, value) pair to be located.
858 * @return Iterator pointing to the first element
859 * greater than key, or end().
862 upper_bound(const key_type
& __x
)
863 { return _M_t
.upper_bound(__x
); }
865 #if __cplusplus > 201103L
866 template<typename _Kt
>
868 upper_bound(const _Kt
& __x
)
869 -> decltype(_M_t
._M_upper_bound_tr(__x
))
870 { return _M_t
._M_upper_bound_tr(__x
); }
876 * @brief Finds the end of a subsequence matching given key.
877 * @param __x Key of (key, value) pair to be located.
878 * @return Read-only (constant) iterator pointing to first iterator
879 * greater than key, or end().
882 upper_bound(const key_type
& __x
) const
883 { return _M_t
.upper_bound(__x
); }
885 #if __cplusplus > 201103L
886 template<typename _Kt
>
888 upper_bound(const _Kt
& __x
) const
889 -> decltype(_M_t
._M_upper_bound_tr(__x
))
890 { return _M_t
._M_upper_bound_tr(__x
); }
896 * @brief Finds a subsequence matching given key.
897 * @param __x Key of (key, value) pairs to be located.
898 * @return Pair of iterators that possibly points to the subsequence
899 * matching given key.
901 * This function is equivalent to
903 * std::make_pair(c.lower_bound(val),
904 * c.upper_bound(val))
906 * (but is faster than making the calls separately).
908 std::pair
<iterator
, iterator
>
909 equal_range(const key_type
& __x
)
910 { return _M_t
.equal_range(__x
); }
912 #if __cplusplus > 201103L
913 template<typename _Kt
>
915 equal_range(const _Kt
& __x
)
916 -> decltype(_M_t
._M_equal_range_tr(__x
))
917 { return _M_t
._M_equal_range_tr(__x
); }
923 * @brief Finds a subsequence matching given key.
924 * @param __x Key of (key, value) pairs to be located.
925 * @return Pair of read-only (constant) iterators that possibly points
926 * to the subsequence matching given key.
928 * This function is equivalent to
930 * std::make_pair(c.lower_bound(val),
931 * c.upper_bound(val))
933 * (but is faster than making the calls separately).
935 std::pair
<const_iterator
, const_iterator
>
936 equal_range(const key_type
& __x
) const
937 { return _M_t
.equal_range(__x
); }
939 #if __cplusplus > 201103L
940 template<typename _Kt
>
942 equal_range(const _Kt
& __x
) const
943 -> decltype(_M_t
._M_equal_range_tr(__x
))
944 { return _M_t
._M_equal_range_tr(__x
); }
948 template<typename _K1
, typename _T1
, typename _C1
, typename _A1
>
950 operator==(const multimap
<_K1
, _T1
, _C1
, _A1
>&,
951 const multimap
<_K1
, _T1
, _C1
, _A1
>&);
953 template<typename _K1
, typename _T1
, typename _C1
, typename _A1
>
955 operator<(const multimap
<_K1
, _T1
, _C1
, _A1
>&,
956 const multimap
<_K1
, _T1
, _C1
, _A1
>&);
960 * @brief Multimap equality comparison.
961 * @param __x A %multimap.
962 * @param __y A %multimap of the same type as @a __x.
963 * @return True iff the size and elements of the maps are equal.
965 * This is an equivalence relation. It is linear in the size of the
966 * multimaps. Multimaps are considered equivalent if their sizes are equal,
967 * and if corresponding elements compare equal.
969 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
971 operator==(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
972 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
973 { return __x
._M_t
== __y
._M_t
; }
976 * @brief Multimap ordering relation.
977 * @param __x A %multimap.
978 * @param __y A %multimap of the same type as @a __x.
979 * @return True iff @a x is lexicographically less than @a y.
981 * This is a total ordering relation. It is linear in the size of the
982 * multimaps. The elements must be comparable with @c <.
984 * See std::lexicographical_compare() for how the determination is made.
986 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
988 operator<(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
989 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
990 { return __x
._M_t
< __y
._M_t
; }
992 /// Based on operator==
993 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
995 operator!=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
996 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
997 { return !(__x
== __y
); }
999 /// Based on operator<
1000 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1002 operator>(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1003 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1004 { return __y
< __x
; }
1006 /// Based on operator<
1007 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1009 operator<=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1010 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1011 { return !(__y
< __x
); }
1013 /// Based on operator<
1014 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1016 operator>=(const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1017 const multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1018 { return !(__x
< __y
); }
1020 /// See std::multimap::swap().
1021 template<typename _Key
, typename _Tp
, typename _Compare
, typename _Alloc
>
1023 swap(multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __x
,
1024 multimap
<_Key
, _Tp
, _Compare
, _Alloc
>& __y
)
1027 _GLIBCXX_END_NAMESPACE_CONTAINER
1030 #endif /* _STL_MULTIMAP_H */