61 #if __cplusplus >= 201103L 66 namespace std _GLIBCXX_VISIBILITY(default)
68 _GLIBCXX_BEGIN_NAMESPACE_VERSION
69 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
71 template <
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
98 template <
typename _Key,
typename _Tp,
typename _Compare = std::less<_Key>,
99 typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
103 typedef _Key key_type;
104 typedef _Tp mapped_type;
106 typedef _Compare key_compare;
107 typedef _Alloc allocator_type;
110 #ifdef _GLIBCXX_CONCEPT_CHECKS 112 typedef typename _Alloc::value_type _Alloc_value_type;
113 # if __cplusplus < 201103L 114 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
116 __glibcxx_class_requires4(_Compare,
bool, _Key, _Key,
117 _BinaryFunctionConcept)
118 __glibcxx_class_requires2(
value_type, _Alloc_value_type, _SameTypeConcept)
121 #if __cplusplus >= 201103L 122 #if __cplusplus > 201703L || defined __STRICT_ANSI__ 124 "std::map must have the same value_type as its allocator");
132 friend class map<_Key, _Tp, _Compare, _Alloc>;
136 value_compare(_Compare __c)
147 rebind<value_type>::other _Pair_alloc_type;
149 typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
150 key_compare, _Pair_alloc_type> _Rep_type;
160 typedef typename _Alloc_traits::pointer pointer;
161 typedef typename _Alloc_traits::const_pointer const_pointer;
162 typedef typename _Alloc_traits::reference reference;
163 typedef typename _Alloc_traits::const_reference const_reference;
164 typedef typename _Rep_type::iterator iterator;
165 typedef typename _Rep_type::const_iterator const_iterator;
166 typedef typename _Rep_type::size_type size_type;
167 typedef typename _Rep_type::difference_type difference_type;
171 #if __cplusplus > 201402L 182 #if __cplusplus < 201103L 194 map(
const _Compare& __comp,
195 const allocator_type& __a = allocator_type())
196 : _M_t(__comp, _Pair_alloc_type(__a)) { }
203 #if __cplusplus < 201103L 207 map(
const map&) =
default;
229 const _Compare& __comp = _Compare(),
230 const allocator_type& __a = allocator_type())
231 : _M_t(__comp, _Pair_alloc_type(__a))
232 { _M_t._M_insert_range_unique(__l.begin(), __l.end()); }
236 map(
const allocator_type& __a)
237 : _M_t(_Pair_alloc_type(__a)) { }
240 map(
const map& __m,
const allocator_type& __a)
241 : _M_t(__m._M_t, _Pair_alloc_type(__a)) { }
244 map(
map&& __m,
const allocator_type& __a)
246 && _Alloc_traits::_S_always_equal())
247 : _M_t(
std::
move(__m._M_t), _Pair_alloc_type(__a)) { }
251 : _M_t(_Pair_alloc_type(__a))
252 { _M_t._M_insert_range_unique(__l.begin(), __l.end()); }
255 template<
typename _InputIterator>
256 map(_InputIterator __first, _InputIterator __last,
257 const allocator_type& __a)
258 : _M_t(_Pair_alloc_type(__a))
259 { _M_t._M_insert_range_unique(__first, __last); }
272 template<
typename _InputIterator>
273 map(_InputIterator __first, _InputIterator __last)
275 { _M_t._M_insert_range_unique(__first, __last); }
289 template<
typename _InputIterator>
290 map(_InputIterator __first, _InputIterator __last,
291 const _Compare& __comp,
292 const allocator_type& __a = allocator_type())
293 : _M_t(__comp, _Pair_alloc_type(__a))
294 { _M_t._M_insert_range_unique(__first, __last); }
296 #if __cplusplus >= 201103L 310 #if __cplusplus < 201103L 339 _M_t._M_assign_unique(__l.begin(), __l.end());
347 {
return allocator_type(_M_t.get_allocator()); }
357 {
return _M_t.begin(); }
366 {
return _M_t.begin(); }
375 {
return _M_t.end(); }
383 end() const _GLIBCXX_NOEXCEPT
384 {
return _M_t.end(); }
393 {
return _M_t.rbegin(); }
400 const_reverse_iterator
402 {
return _M_t.rbegin(); }
411 {
return _M_t.rend(); }
418 const_reverse_iterator
420 {
return _M_t.rend(); }
422 #if __cplusplus >= 201103L 430 {
return _M_t.begin(); }
439 {
return _M_t.end(); }
446 const_reverse_iterator
448 {
return _M_t.rbegin(); }
455 const_reverse_iterator
457 {
return _M_t.rend(); }
464 _GLIBCXX_NODISCARD
bool 466 {
return _M_t.empty(); }
471 {
return _M_t.size(); }
476 {
return _M_t.max_size(); }
495 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
500 #if __cplusplus >= 201103L 507 return (*__i).second;
510 #if __cplusplus >= 201103L 515 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
523 return (*__i).second;
537 at(
const key_type& __k)
541 __throw_out_of_range(__N(
"map::at"));
542 return (*__i).second;
546 at(
const key_type& __k)
const 550 __throw_out_of_range(__N(
"map::at"));
551 return (*__i).second;
555 #if __cplusplus >= 201103L 574 template<
typename... _Args>
577 {
return _M_t._M_emplace_unique(std::forward<_Args>(__args)...); }
604 template<
typename... _Args>
608 return _M_t._M_emplace_hint_unique(__pos,
609 std::forward<_Args>(__args)...);
613 #if __cplusplus > 201402L 618 __glibcxx_assert(__pos !=
end());
619 return _M_t.extract(__pos);
625 {
return _M_t.extract(__x); }
630 {
return _M_t._M_reinsert_node_unique(
std::move(__nh)); }
634 insert(const_iterator __hint, node_type&& __nh)
635 {
return _M_t._M_reinsert_node_hint_unique(__hint,
std::move(__nh)); }
637 template<
typename,
typename>
638 friend struct std::_Rb_tree_merge_helper;
640 template<
typename _Cmp2>
644 using _Merge_helper = _Rb_tree_merge_helper<map, _Cmp2>;
645 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
648 template<
typename _Cmp2>
650 merge(map<_Key, _Tp, _Cmp2, _Alloc>&& __source)
653 template<
typename _Cmp2>
655 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>& __source)
657 using _Merge_helper = _Rb_tree_merge_helper<map, _Cmp2>;
658 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
661 template<
typename _Cmp2>
663 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>&& __source)
667 #if __cplusplus > 201402L 668 #define __cpp_lib_map_try_emplace 201411 689 template <
typename... _Args>
699 std::forward<_Args>(__args)...));
706 template <
typename... _Args>
716 std::forward<_Args>(__args)...));
749 template <
typename... _Args>
755 auto __true_hint = _M_t._M_get_insert_hint_unique_pos(__hint, __k);
756 if (__true_hint.second)
761 std::forward<_Args>(__args)...));
763 __i = iterator(__true_hint.first);
768 template <
typename... _Args>
770 try_emplace(const_iterator __hint, key_type&& __k, _Args&&... __args)
773 auto __true_hint = _M_t._M_get_insert_hint_unique_pos(__hint, __k);
774 if (__true_hint.second)
779 std::forward<_Args>(__args)...));
804 {
return _M_t._M_insert_unique(__x); }
806 #if __cplusplus >= 201103L 811 {
return _M_t._M_insert_unique(
std::move(__x)); }
813 template<
typename _Pair>
814 __enable_if_t<is_constructible<value_type, _Pair>::value,
817 {
return _M_t._M_emplace_unique(std::forward<_Pair>(__x)); }
821 #if __cplusplus >= 201103L 831 {
insert(__list.begin(), __list.end()); }
859 #if __cplusplus >= 201103L 864 {
return _M_t._M_insert_unique_(__position, __x); }
866 #if __cplusplus >= 201103L 871 {
return _M_t._M_insert_unique_(__position,
std::move(__x)); }
873 template<
typename _Pair>
874 __enable_if_t<is_constructible<value_type, _Pair>::value,
iterator>
875 insert(const_iterator __position, _Pair&& __x)
877 return _M_t._M_emplace_hint_unique(__position,
878 std::forward<_Pair>(__x));
891 template<
typename _InputIterator>
893 insert(_InputIterator __first, _InputIterator __last)
894 { _M_t._M_insert_range_unique(__first, __last); }
896 #if __cplusplus > 201402L 916 template <
typename _Obj>
926 std::forward<_Obj>(__obj)));
929 (*__i).second = std::forward<_Obj>(__obj);
934 template <
typename _Obj>
944 std::forward<_Obj>(__obj)));
947 (*__i).second = std::forward<_Obj>(__obj);
971 template <
typename _Obj>
974 const key_type& __k, _Obj&& __obj)
977 auto __true_hint = _M_t._M_get_insert_hint_unique_pos(__hint, __k);
978 if (__true_hint.second)
984 std::forward<_Obj>(__obj)));
986 __i = iterator(__true_hint.first);
987 (*__i).second = std::forward<_Obj>(__obj);
992 template <
typename _Obj>
997 auto __true_hint = _M_t._M_get_insert_hint_unique_pos(__hint, __k);
998 if (__true_hint.second)
1004 std::forward<_Obj>(__obj)));
1006 __i = iterator(__true_hint.first);
1007 (*__i).second = std::forward<_Obj>(__obj);
1012 #if __cplusplus >= 201103L 1032 {
return _M_t.erase(__position); }
1035 _GLIBCXX_ABI_TAG_CXX11
1038 {
return _M_t.erase(__position); }
1053 { _M_t.erase(__position); }
1069 {
return _M_t.erase(__x); }
1071 #if __cplusplus >= 201103L 1088 erase(const_iterator __first, const_iterator __last)
1089 {
return _M_t.erase(__first, __last); }
1105 { _M_t.erase(__first, __last); }
1123 _GLIBCXX_NOEXCEPT_IF(__is_nothrow_swappable<_Compare>::value)
1124 { _M_t.swap(__x._M_t); }
1143 {
return _M_t.key_comp(); }
1151 {
return value_compare(_M_t.key_comp()); }
1170 {
return _M_t.find(__x); }
1172 #if __cplusplus > 201103L 1173 template<
typename _Kt>
1175 find(
const _Kt& __x) -> decltype(_M_t._M_find_tr(__x))
1176 {
return _M_t._M_find_tr(__x); }
1195 {
return _M_t.find(__x); }
1197 #if __cplusplus > 201103L 1198 template<
typename _Kt>
1200 find(
const _Kt& __x)
const -> decltype(_M_t._M_find_tr(__x))
1201 {
return _M_t._M_find_tr(__x); }
1216 {
return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
1218 #if __cplusplus > 201103L 1219 template<
typename _Kt>
1221 count(
const _Kt& __x)
const -> decltype(_M_t._M_count_tr(__x))
1222 {
return _M_t._M_count_tr(__x); }
1226 #if __cplusplus > 201703L 1234 contains(
const key_type& __x)
const 1235 {
return _M_t.find(__x) != _M_t.end(); }
1237 template<
typename _Kt>
1239 contains(
const _Kt& __x)
const 1240 -> decltype(_M_t._M_find_tr(__x), void(),
true)
1241 {
return _M_t._M_find_tr(__x) != _M_t.end(); }
1259 {
return _M_t.lower_bound(__x); }
1261 #if __cplusplus > 201103L 1262 template<
typename _Kt>
1265 -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
1266 {
return iterator(_M_t._M_lower_bound_tr(__x)); }
1284 {
return _M_t.lower_bound(__x); }
1286 #if __cplusplus > 201103L 1287 template<
typename _Kt>
1290 -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
1291 {
return const_iterator(_M_t._M_lower_bound_tr(__x)); }
1304 {
return _M_t.upper_bound(__x); }
1306 #if __cplusplus > 201103L 1307 template<
typename _Kt>
1310 -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
1311 {
return iterator(_M_t._M_upper_bound_tr(__x)); }
1324 {
return _M_t.upper_bound(__x); }
1326 #if __cplusplus > 201103L 1327 template<
typename _Kt>
1330 -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))
1331 {
return const_iterator(_M_t._M_upper_bound_tr(__x)); }
1353 {
return _M_t.equal_range(__x); }
1355 #if __cplusplus > 201103L 1356 template<
typename _Kt>
1382 {
return _M_t.equal_range(__x); }
1384 #if __cplusplus > 201103L 1385 template<
typename _Kt>
1389 _M_t._M_equal_range_tr(__x)))
1392 _M_t._M_equal_range_tr(__x));
1397 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
1402 #if __cpp_lib_three_way_comparison 1403 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
1404 friend __detail::__synth3way_t<pair<const _K1, _T1>>
1408 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
1410 operator<(const map<_K1, _T1, _C1, _A1>&,
1416 #if __cpp_deduction_guides >= 201606 1418 template<
typename _InputIterator,
1419 typename _Compare = less<__iter_key_t<_InputIterator>>,
1420 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
1421 typename = _RequireInputIter<_InputIterator>,
1422 typename = _RequireNotAllocator<_Compare>,
1423 typename = _RequireAllocator<_Allocator>>
1424 map(_InputIterator, _InputIterator,
1425 _Compare = _Compare(), _Allocator = _Allocator())
1426 -> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
1427 _Compare, _Allocator>;
1429 template<
typename _Key,
typename _Tp,
typename _Compare = less<_Key>,
1430 typename _Allocator = allocator<pair<const _Key, _Tp>>,
1431 typename = _RequireNotAllocator<_Compare>,
1432 typename = _RequireAllocator<_Allocator>>
1433 map(initializer_list<pair<_Key, _Tp>>,
1434 _Compare = _Compare(), _Allocator = _Allocator())
1435 -> map<_Key, _Tp, _Compare, _Allocator>;
1437 template <
typename _InputIterator,
typename _Allocator,
1438 typename = _RequireInputIter<_InputIterator>,
1439 typename = _RequireAllocator<_Allocator>>
1440 map(_InputIterator, _InputIterator, _Allocator)
1441 -> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
1442 less<__iter_key_t<_InputIterator>>, _Allocator>;
1444 template<
typename _Key,
typename _Tp,
typename _Allocator,
1445 typename = _RequireAllocator<_Allocator>>
1446 map(initializer_list<pair<_Key, _Tp>>, _Allocator)
1447 -> map<_Key, _Tp, less<_Key>, _Allocator>;
1449 #endif // deduction guides 1461 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1465 {
return __x._M_t == __y._M_t; }
1467 #if __cpp_lib_three_way_comparison 1482 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1483 inline __detail::__synth3way_t<pair<const _Key, _Tp>>
1484 operator<=>(
const map<_Key, _Tp, _Compare, _Alloc>& __x,
1485 const map<_Key, _Tp, _Compare, _Alloc>& __y)
1486 {
return __x._M_t <=> __y._M_t; }
1499 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1501 operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
1503 {
return __x._M_t < __y._M_t; }
1506 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1510 {
return !(__x == __y); }
1513 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1517 {
return __y < __x; }
1520 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1522 operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
1524 {
return !(__y < __x); }
1527 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1531 {
return !(__x < __y); }
1532 #endif // three-way comparison 1535 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1539 _GLIBCXX_NOEXCEPT_IF(noexcept(__x.swap(__y)))
1542 _GLIBCXX_END_NAMESPACE_CONTAINER
1544 #if __cplusplus > 201402L 1546 template<
typename _Key,
typename _Val,
typename _Cmp1,
typename _Alloc,
1549 _Rb_tree_merge_helper<_GLIBCXX_STD_C::map<_Key, _Val, _Cmp1, _Alloc>,
1553 friend class _GLIBCXX_STD_C::map<_Key, _Val, _Cmp1, _Alloc>;
1556 _S_get_tree(_GLIBCXX_STD_C::map<_Key, _Val, _Cmp2, _Alloc>& __map)
1557 {
return __map._M_t; }
1560 _S_get_tree(_GLIBCXX_STD_C::multimap<_Key, _Val, _Cmp2, _Alloc>& __map)
1561 {
return __map._M_t; }
1565 _GLIBCXX_END_NAMESPACE_VERSION
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to map data.
auto count(const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
Finds the number of elements with given key.
size_type max_size() const noexcept
const_iterator find(const key_type &__x) const
Tries to locate an element in a map.
map(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
Builds a map from a range.
A standard container made up of (key,value) pairs, which can be retrieved based on a key...
size_type count(const key_type &__x) const
Finds the number of elements with given key.
map(map &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())
Allocator-extended move constructor.
map(_InputIterator __first, _InputIterator __last, const allocator_type &__a)
Allocator-extended range constructor.
map & operator=(const map &)=default
Map assignment operator.
const_iterator begin() const noexcept
is_nothrow_copy_constructible
iterator erase(const_iterator __first, const_iterator __last)
Erases a [first,last) range of elements from a map.
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.
value_compare value_comp() const
iterator insert_or_assign(const_iterator __hint, const key_type &__k, _Obj &&__obj)
Attempts to insert or assign a std::pair into the map.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
map(const _Compare &__comp, const allocator_type &__a=allocator_type())
Creates a map with no elements.
pair< iterator, bool > try_emplace(const key_type &__k, _Args &&... __args)
Attempts to build and insert a std::pair into the map.
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.
map(initializer_list< value_type > __l, const allocator_type &__a)
Allocator-extended initialier-list constructor.
iterator insert(const_iterator __position, const value_type &__x)
Attempts to insert a std::pair into the map.
auto upper_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
Finds the end of a subsequence matching given key.
const_iterator upper_bound(const key_type &__x) const
Finds the end of a subsequence matching given key.
map(const map &__m, const allocator_type &__a)
Allocator-extended copy constructor.
Struct holding two objects of arbitrary type.
constexpr piecewise_construct_t piecewise_construct
Tag for piecewise construction of std::pair objects.
iterator begin() noexcept
constexpr tuple< _Elements &&... > forward_as_tuple(_Elements &&... __args) noexcept
std::forward_as_tuple
void insert(std::initializer_list< value_type > __list)
Attempts to insert a list of std::pairs into the map.
map()=default
Default constructor creates no elements.
reverse_iterator rbegin() noexcept
node_type extract(const key_type &__x)
Extract a node.
auto find(const _Kt &__x) -> decltype(_M_t._M_find_tr(__x))
Tries to locate an element in a map.
__enable_if_t< is_constructible< value_type, _Pair >::value, pair< iterator, bool > > insert(_Pair &&__x)
Attempts to insert a std::pair into the map.
bool empty() const noexcept
const_reverse_iterator rend() const noexcept
iterator try_emplace(const_iterator __hint, const key_type &__k, _Args &&... __args)
Attempts to build and insert a std::pair into the map.
const_iterator lower_bound(const key_type &__x) const
Finds the beginning of a subsequence matching given key.
auto find(const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x))
Tries to locate an element in a map.
iterator insert(const_iterator __position, value_type &&__x)
Attempts to insert a std::pair into the map.
__enable_if_t< is_constructible< value_type, _Pair >::value, iterator > insert(const_iterator __position, _Pair &&__x)
Attempts to insert a std::pair into the map.
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.
iterator upper_bound(const key_type &__x)
Finds the end of a subsequence matching given key.
size_type size() const noexcept
map(const allocator_type &__a)
Allocator-extended default constructor.
std::pair< iterator, bool > emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the map.
iterator erase(const_iterator __position)
Erases an element from a map.
auto lower_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
Finds the beginning of a subsequence matching given key.
void insert(_InputIterator __first, _InputIterator __last)
Template function that attempts to insert a range of elements.
std::pair< iterator, bool > insert(value_type &&__x)
Attempts to insert a std::pair into the map.
node_type extract(const_iterator __pos)
Extract a node.
iterator find(const key_type &__x)
Tries to locate an element in a map.
const_reverse_iterator rbegin() const noexcept
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
iterator insert(const_iterator __hint, node_type &&__nh)
Re-insert an extracted node.
_T1 first
The first member.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the map.
pair< iterator, bool > insert_or_assign(const key_type &__k, _Obj &&__obj)
Attempts to insert or assign a std::pair into the map.
mapped_type & at(const key_type &__k)
Access to map data.
insert_return_type insert(node_type &&__nh)
Re-insert an extracted node.
_GLIBCXX_ABI_TAG_CXX11 iterator erase(iterator __position)
Erases an element from a map.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
void swap(map &__x) noexcept(/*conditional */)
Swaps data with another map.
map(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
Builds a map from an initializer_list.
iterator lower_bound(const key_type &__x)
Finds the beginning of a subsequence matching given key.
const_reverse_iterator crbegin() const noexcept
ISO C++ entities toplevel namespace is std.
auto equal_range(const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
Finds a subsequence matching given key.
map(_InputIterator __first, _InputIterator __last)
Builds a map from a range.
const_iterator cbegin() const noexcept
const_iterator cend() const noexcept
Node handle type for maps.
Uniform interface to C++98 and C++11 allocators.
const_reverse_iterator crend() const noexcept
map & operator=(initializer_list< value_type > __l)
Map list assignment operator.
key_compare key_comp() const
const_iterator end() const noexcept
reverse_iterator rend() noexcept
Return type of insert(node_handle&&) on unique maps/sets.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the map.
Primary class template, tuple.
A standard container made up of (key,value) pairs, which can be retrieved based on a key...
allocator_type get_allocator() const noexcept
Get a copy of the memory allocation object.