61 #if __cplusplus >= 201103L
66 namespace std _GLIBCXX_VISIBILITY(default)
68 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
94 template <
typename _Key,
typename _Tp,
typename _Compare = std::less<_Key>,
95 typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
99 typedef _Key key_type;
100 typedef _Tp mapped_type;
102 typedef _Compare key_compare;
103 typedef _Alloc allocator_type;
107 typedef typename _Alloc::value_type _Alloc_value_type;
108 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
109 __glibcxx_class_requires4(_Compare,
bool, _Key, _Key,
110 _BinaryFunctionConcept)
111 __glibcxx_class_requires2(
value_type, _Alloc_value_type, _SameTypeConcept)
117 friend class map<_Key, _Tp, _Compare, _Alloc>;
121 value_compare(_Compare __c)
131 typedef typename _Alloc::template rebind<value_type>::other
134 typedef _Rb_tree<key_type, value_type, _Select1st<value_type>,
135 key_compare, _Pair_alloc_type> _Rep_type;
143 typedef typename _Pair_alloc_type::pointer pointer;
144 typedef typename _Pair_alloc_type::const_pointer const_pointer;
145 typedef typename _Pair_alloc_type::reference reference;
146 typedef typename _Pair_alloc_type::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;
169 map(
const _Compare& __comp,
170 const allocator_type& __a = allocator_type())
171 : _M_t(__comp, _Pair_alloc_type(__a)) { }
183 #if __cplusplus >= 201103L
193 : _M_t(std::move(__x._M_t)) { }
207 const _Compare& __comp = _Compare(),
208 const allocator_type& __a = allocator_type())
209 : _M_t(__comp, _Pair_alloc_type(__a))
210 { _M_t._M_insert_unique(__l.begin(), __l.end()); }
223 template<
typename _InputIterator>
224 map(_InputIterator __first, _InputIterator __last)
226 { _M_t._M_insert_unique(__first, __last); }
240 template<
typename _InputIterator>
241 map(_InputIterator __first, _InputIterator __last,
242 const _Compare& __comp,
243 const allocator_type& __a = allocator_type())
244 : _M_t(__comp, _Pair_alloc_type(__a))
245 { _M_t._M_insert_unique(__first, __last); }
270 #if __cplusplus >= 201103L
303 this->
insert(__l.begin(), __l.end());
311 {
return allocator_type(_M_t.get_allocator()); }
321 {
return _M_t.begin(); }
330 {
return _M_t.begin(); }
339 {
return _M_t.end(); }
347 end() const _GLIBCXX_NOEXCEPT
348 {
return _M_t.end(); }
357 {
return _M_t.rbegin(); }
364 const_reverse_iterator
366 {
return _M_t.rbegin(); }
375 {
return _M_t.rend(); }
382 const_reverse_iterator
384 {
return _M_t.rend(); }
386 #if __cplusplus >= 201103L
394 {
return _M_t.begin(); }
403 {
return _M_t.end(); }
410 const_reverse_iterator
412 {
return _M_t.rbegin(); }
419 const_reverse_iterator
421 {
return _M_t.rend(); }
430 {
return _M_t.empty(); }
435 {
return _M_t.size(); }
440 {
return _M_t.max_size(); }
459 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
464 #if __cplusplus >= 201103L
471 return (*__i).second;
474 #if __cplusplus >= 201103L
479 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
485 std::forward_as_tuple(std::move(__k)),
487 return (*__i).second;
501 at(
const key_type& __k)
505 __throw_out_of_range(__N(
"map::at"));
506 return (*__i).second;
510 at(
const key_type& __k)
const
514 __throw_out_of_range(__N(
"map::at"));
515 return (*__i).second;
519 #if __cplusplus >= 201103L
538 template<
typename... _Args>
541 {
return _M_t._M_emplace_unique(std::forward<_Args>(__args)...); }
568 template<
typename... _Args>
572 return _M_t._M_emplace_hint_unique(__pos,
573 std::forward<_Args>(__args)...);
595 {
return _M_t._M_insert_unique(__x); }
597 #if __cplusplus >= 201103L
598 template<
typename _Pair,
typename =
typename
600 _Pair&&>::value>::type>
603 {
return _M_t._M_insert_unique(std::forward<_Pair>(__x)); }
606 #if __cplusplus >= 201103L
616 {
insert(__list.begin(), __list.end()); }
643 #if __cplusplus >= 201103L
644 insert(const_iterator __position,
const value_type& __x)
646 insert(iterator __position,
const value_type& __x)
648 {
return _M_t._M_insert_unique_(__position, __x); }
650 #if __cplusplus >= 201103L
651 template<
typename _Pair,
typename =
typename
653 _Pair&&>::value>::type>
655 insert(const_iterator __position, _Pair&& __x)
656 {
return _M_t._M_insert_unique_(__position,
657 std::forward<_Pair>(__x)); }
668 template<
typename _InputIterator>
670 insert(_InputIterator __first, _InputIterator __last)
671 { _M_t._M_insert_unique(__first, __last); }
673 #if __cplusplus >= 201103L
691 {
return _M_t.erase(__position); }
696 {
return _M_t.erase(__position); }
709 erase(iterator __position)
710 { _M_t.erase(__position); }
726 {
return _M_t.erase(__x); }
728 #if __cplusplus >= 201103L
745 erase(const_iterator __first, const_iterator __last)
746 {
return _M_t.erase(__first, __last); }
762 { _M_t.erase(__first, __last); }
778 { _M_t.swap(__x._M_t); }
797 {
return _M_t.key_comp(); }
805 {
return value_compare(_M_t.key_comp()); }
821 {
return _M_t.find(__x); }
835 find(
const key_type& __x)
const
836 {
return _M_t.find(__x); }
848 {
return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
863 {
return _M_t.lower_bound(__x); }
878 {
return _M_t.lower_bound(__x); }
888 {
return _M_t.upper_bound(__x); }
898 {
return _M_t.upper_bound(__x); }
917 {
return _M_t.equal_range(__x); }
936 {
return _M_t.equal_range(__x); }
938 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
943 template<
typename _K1,
typename _T1,
typename _C1,
typename _A1>
945 operator<(const map<_K1, _T1, _C1, _A1>&,
959 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
963 {
return __x._M_t == __y._M_t; }
976 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
978 operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
980 {
return __x._M_t < __y._M_t; }
983 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
987 {
return !(__x == __y); }
990 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
994 {
return __y < __x; }
997 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
999 operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
1001 {
return !(__y < __x); }
1004 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1008 {
return !(__x < __y); }
1011 template<
typename _Key,
typename _Tp,
typename _Compare,
typename _Alloc>
1017 _GLIBCXX_END_NAMESPACE_CONTAINER