60#if __cplusplus >= 201103L
64namespace std _GLIBCXX_VISIBILITY(default)
66_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
88 template<
typename _Key,
typename _Compare = std::less<_Key>,
89 typename _Alloc = std::allocator<_Key> >
93 typedef typename _Alloc::value_type _Alloc_value_type;
94 __glibcxx_class_requires(
_Key, _SGIAssignableConcept)
95 __glibcxx_class_requires4(_Compare,
bool,
_Key,
_Key,
96 _BinaryFunctionConcept)
97 __glibcxx_class_requires2(
_Key, _Alloc_value_type, _SameTypeConcept)
105 typedef _Compare key_compare;
106 typedef _Compare value_compare;
107 typedef _Alloc allocator_type;
112 rebind<_Key>::other _Key_alloc_type;
115 key_compare, _Key_alloc_type> _Rep_type;
124 typedef typename _Alloc_traits::const_pointer const_pointer;
125 typedef typename _Alloc_traits::reference reference;
126 typedef typename _Alloc_traits::const_reference const_reference;
134 typedef typename _Rep_type::size_type size_type;
154 set(
const _Compare& __comp,
155 const allocator_type& __a = allocator_type())
156 : _M_t(__comp, _Key_alloc_type(__a)) { }
168 template<
typename _InputIterator>
171 { _M_t._M_insert_unique(__first, __last); }
185 template<
typename _InputIterator>
187 const _Compare& __comp,
188 const allocator_type& __a = allocator_type())
189 : _M_t(__comp, _Key_alloc_type(__a))
190 { _M_t._M_insert_unique(__first, __last); }
202#if __cplusplus >= 201103L
212 : _M_t(
std::move(__x._M_t)) { }
225 const _Compare& __comp = _Compare(),
226 const allocator_type& __a = allocator_type())
227 : _M_t(__comp, _Key_alloc_type(__a))
228 { _M_t._M_insert_unique(
__l.begin(),
__l.end()); }
232 set(
const allocator_type& __a)
233 : _M_t(_Compare(), _Key_alloc_type(__a)) { }
236 set(
const set& __x,
const allocator_type& __a)
237 : _M_t(__x._M_t, _Key_alloc_type(__a)) { }
240 set(
set&& __x,
const allocator_type& __a)
242 && _Alloc_traits::_S_always_equal())
243 : _M_t(
std::move(__x._M_t), _Key_alloc_type(__a)) { }
247 : _M_t(_Compare(), _Key_alloc_type(__a))
248 { _M_t._M_insert_unique(
__l.begin(),
__l.end()); }
251 template<
typename _InputIterator>
253 const allocator_type& __a)
254 : _M_t(_Compare(), _Key_alloc_type(__a))
255 { _M_t._M_insert_unique(__first, __last); }
272#if __cplusplus >= 201103L
291 _M_t._M_assign_unique(
__l.begin(),
__l.end());
301 {
return _M_t.key_comp(); }
305 {
return _M_t.key_comp(); }
309 {
return allocator_type(_M_t.get_allocator()); }
318 {
return _M_t.begin(); }
327 {
return _M_t.end(); }
336 {
return _M_t.rbegin(); }
345 {
return _M_t.rend(); }
347#if __cplusplus >= 201103L
355 {
return _M_t.begin(); }
364 {
return _M_t.end(); }
373 {
return _M_t.rbegin(); }
382 {
return _M_t.rend(); }
388 {
return _M_t.empty(); }
393 {
return _M_t.size(); }
398 {
return _M_t.max_size(); }
414 { _M_t.swap(__x._M_t); }
417#if __cplusplus >= 201103L
431 template<
typename...
_Args>
457 template<
typename...
_Args>
461 return _M_t._M_emplace_hint_unique(
__pos,
483 _M_t._M_insert_unique(__x);
487#if __cplusplus >= 201103L
492 _M_t._M_insert_unique(std::move(__x));
518 {
return _M_t._M_insert_unique_(
__position, __x); }
520#if __cplusplus >= 201103L
523 {
return _M_t._M_insert_unique_(
__position, std::move(__x)); }
535 template<
typename _InputIterator>
538 { _M_t._M_insert_unique(__first, __last); }
540#if __cplusplus >= 201103L
550 { this->
insert(__l.begin(),
__l.end()); }
553#if __cplusplus >= 201103L
569 _GLIBCXX_ABI_TAG_CXX11
602 {
return _M_t.erase(__x); }
604#if __cplusplus >= 201103L
621 _GLIBCXX_ABI_TAG_CXX11
624 {
return _M_t.erase(__first, __last); }
640 { _M_t.erase(__first, __last); }
666 {
return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
668#if __cplusplus > 201103L
669 template<
typename _Kt>
672 ->
decltype(_M_t._M_count_tr(__x))
673 {
return _M_t._M_count_tr(__x); }
693 {
return _M_t.find(__x); }
697 {
return _M_t.find(__x); }
699#if __cplusplus > 201103L
700 template<
typename _Kt>
703 ->
decltype(iterator{_M_t._M_find_tr(__x)})
704 {
return iterator{_M_t._M_find_tr(__x)}; }
706 template<
typename _Kt>
708 find(
const _Kt& __x)
const
709 ->
decltype(const_iterator{_M_t._M_find_tr(__x)})
710 {
return const_iterator{_M_t._M_find_tr(__x)}; }
728 {
return _M_t.lower_bound(__x); }
732 {
return _M_t.lower_bound(__x); }
734#if __cplusplus > 201103L
735 template<
typename _Kt>
738 ->
decltype(iterator(_M_t._M_lower_bound_tr(__x)))
739 {
return iterator(_M_t._M_lower_bound_tr(__x)); }
741 template<
typename _Kt>
744 ->
decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
745 {
return const_iterator(_M_t._M_lower_bound_tr(__x)); }
758 {
return _M_t.upper_bound(__x); }
762 {
return _M_t.upper_bound(__x); }
764#if __cplusplus > 201103L
765 template<
typename _Kt>
768 ->
decltype(iterator(_M_t._M_upper_bound_tr(__x)))
769 {
return iterator(_M_t._M_upper_bound_tr(__x)); }
771 template<
typename _Kt>
774 ->
decltype(iterator(_M_t._M_upper_bound_tr(__x)))
775 {
return const_iterator(_M_t._M_upper_bound_tr(__x)); }
797 {
return _M_t.equal_range(__x); }
801 {
return _M_t.equal_range(__x); }
803#if __cplusplus > 201103L
804 template<
typename _Kt>
807 ->
decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
808 {
return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
810 template<
typename _Kt>
813 ->
decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)))
814 {
return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); }
818 template<
typename _K1,
typename _C1,
typename _A1>
820 operator==(
const set<_K1, _C1, _A1>&,
const set<_K1, _C1, _A1>&);
822 template<
typename _K1,
typename _C1,
typename _A1>
824 operator<(
const set<_K1, _C1, _A1>&,
const set<_K1, _C1, _A1>&);
838 template<
typename _Key,
typename _Compare,
typename _Alloc>
842 {
return __x._M_t ==
__y._M_t; }
855 template<
typename _Key,
typename _Compare,
typename _Alloc>
859 {
return __x._M_t <
__y._M_t; }
862 template<
typename _Key,
typename _Compare,
typename _Alloc>
866 {
return !(__x ==
__y); }
869 template<
typename _Key,
typename _Compare,
typename _Alloc>
873 {
return __y < __x; }
876 template<
typename _Key,
typename _Compare,
typename _Alloc>
880 {
return !(
__y < __x); }
883 template<
typename _Key,
typename _Compare,
typename _Alloc>
887 {
return !(__x <
__y); }
890 template<
typename _Key,
typename _Compare,
typename _Alloc>
896_GLIBCXX_END_NAMESPACE_CONTAINER
ISO C++ entities toplevel namespace is std.
A standard container made up of unique keys, which can be retrieved in logarithmic time.
set(const set &__x, const allocator_type &__a)
Allocator-extended copy constructor.
set(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
Builds a set from a range.
set & operator=(const set &__x)
Set assignment operator.
size_type count(const key_type &__x) const
Finds the number of elements.
set & operator=(initializer_list< value_type > __l)
Set list assignment operator.
_GLIBCXX_ABI_TAG_CXX11 iterator erase(const_iterator __position)
Erases an element from a set.
void swap(set &__x) noexcept(/*conditional */)
Swaps data with another set.
value_compare value_comp() const
Returns the comparison object with which the set was constructed.
iterator cbegin() const noexcept
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the set.
set(const set &__x)
Set copy constructor.
set(_InputIterator __first, _InputIterator __last)
Builds a set from a range.
set(set &&__x) noexcept(is_nothrow_copy_constructible< _Compare >::value)
Set move constructor
iterator cend() const noexcept
set(set &&__x, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())
Allocator-extended move constructor.
set() noexcept(/*conditional */)
Default constructor creates no elements.
iterator end() const noexcept
size_type max_size() const noexcept
Returns the maximum size of the set.
_Key key_type
Public typedefs.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert an element into the set.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
set(const allocator_type &__a)
Allocator-extended default constructor.
std::pair< iterator, bool > emplace(_Args &&... __args)
Attempts to build and insert an element into the set.
key_compare key_comp() const
Returns the comparison object with which the set was constructed.
reverse_iterator rbegin() const noexcept
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
_GLIBCXX_ABI_TAG_CXX11 iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from a set.
reverse_iterator crbegin() const noexcept
set(initializer_list< value_type > __l, const allocator_type &__a)
Allocator-extended initialier-list constructor.
_Alloc_traits::pointer pointer
Iterator-related typedefs.
size_type size() const noexcept
Returns the size of the set.
reverse_iterator crend() const noexcept
iterator insert(const_iterator __position, const value_type &__x)
Attempts to insert an element into the set.
set(_InputIterator __first, _InputIterator __last, const allocator_type &__a)
Allocator-extended range constructor.
set(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
Builds a set from an initializer_list.
allocator_type get_allocator() const noexcept
Returns the allocator object with which the set was constructed.
iterator upper_bound(const key_type &__x)
Finds the end of a subsequence matching given key.
iterator lower_bound(const key_type &__x)
Finds the beginning of a subsequence matching given key.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to insert an element into the set.
iterator begin() const noexcept
set(const _Compare &__comp, const allocator_type &__a=allocator_type())
Creates a set with no elements.
iterator find(const key_type &__x)
Tries to locate an element in a set.
set & operator=(set &&)=default
Move assignment operator.
bool empty() const noexcept
Returns true if the set is empty.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
reverse_iterator rend() const noexcept
Uniform interface to C++98 and C++11 allocators.