template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::begin()const[inline],[noexcept]
Returns a read-only (constant) iterator that points to the first element in the set. Iteration is done in
ascending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::cbegin()const[inline],[noexcept]
Returns a read-only (constant) iterator that points to the first element in the set. Iteration is done in
ascending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::cend()const[inline],[noexcept]
Returns a read-only (constant) iterator that points one past the last element in the set. Iteration is
done in ascending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>voidstd::set<_Key,_Compare,_Alloc>::clear()[inline],[noexcept]
Erases all elements in a set. Note that this function only erases the elements, and that if the elements
themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the
user's responsibility.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::contains(const_Kt&__x)const->decltype(_M_t._M_find_tr(__x),void(),true)
[inline]"
Finds whether an element with the given key exists.
Parameters__x Key of elements to be located.
Returns
True if there is an element with the specified key.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>boolstd::set<_Key,_Compare,_Alloc>::contains(constkey_type&__x)const[inline]
Finds whether an element with the given key exists.
Parameters__x Key of elements to be located.
Returns
True if there is an element with the specified key.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::count(const_Kt&__x)const->decltype(_M_t._M_count_tr(__x))
[inline]"
Finds the number of elements.
Parameters__x Element to located.
Returns
Number of elements with specified key.
This function only makes sense for multisets; for set the result will either be 0 (not present) or 1
(present).
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>size_typestd::set<_Key,_Compare,_Alloc>::count(constkey_type&__x)const[inline]
Finds the number of elements.
Parameters__x Element to located.
Returns
Number of elements with specified key.
This function only makes sense for multisets; for set the result will either be 0 (not present) or 1
(present).
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>reverse_iteratorstd::set<_Key,_Compare,_Alloc>::crbegin()const[inline],[noexcept]
Returns a read-only (constant) iterator that points to the last element in the set. Iteration is done in
descending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>reverse_iteratorstd::set<_Key,_Compare,_Alloc>::crend()const[inline],[noexcept]
Returns a read-only (constant) reverse iterator that points to the last pair in the set. Iteration is
done in descending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename..._Args>std::pair<iterator,bool>std::set<_Key,_Compare,_Alloc>::emplace(_Args&&...__args)[inline]
Attempts to build and insert an element into the set.
Parameters__args Arguments used to generate an element.
Returns
A pair, of which the first element is an iterator that points to the possibly inserted element, and
the second is a bool that is true if the element was actually inserted.
This function attempts to build and insert an element into the set. A set relies on unique keys and thus
an element is only inserted if it is not already present in the set.
Insertion requires logarithmic time.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename..._Args>iteratorstd::set<_Key,_Compare,_Alloc>::emplace_hint(const_iterator__pos,_Args&&...__args)[inline]
Attempts to insert an element into the set.
Parameters__pos An iterator that serves as a hint as to where the element should be inserted.
__args Arguments used to generate the element to be inserted.
Returns
An iterator that points to the element with key equivalent to the one generated from __args (may or
may not be the element itself).
This function is not concerned about whether the insertion took place, and thus does not return a boolean
like the single-argument emplace() does. Note that the first parameter is only a hint and can potentially
improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
For more on hinting, see:
https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires logarithmic time (if the hint is not taken).
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>boolstd::set<_Key,_Compare,_Alloc>::empty()const[inline],[noexcept]
Returns true if the set is empty.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::end()const[inline],[noexcept]
Returns a read-only (constant) iterator that points one past the last element in the set. Iteration is
done in ascending order according to the keys.
Referenced by std::set<_Key,_Compare,_Alloc>::extract().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::equal_range(const_Kt&__x)->decltype(pair<iterator,iterator>(_M_t._M_equal_range_tr(__x)))
[inline]"
Finds a subsequence matching given key.
Parameters__x Key to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::equal_range(const_Kt&__x)const->decltype(pair<iterator,iterator>(_M_t._M_equal_range_tr(__x)))
[inline]"
Finds a subsequence matching given key.
Parameters__x Key to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>std::pair<iterator,iterator>std::set<_Key,_Compare,_Alloc>::equal_range(constkey_type&__x)[inline]
Finds a subsequence matching given key.
Parameters__x Key to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>std::pair<const_iterator,const_iterator>std::set<_Key,_Compare,_Alloc>::equal_range(constkey_type&__x)const[inline]
Finds a subsequence matching given key.
Parameters__x Key to be located.
Returns
Pair of iterators that possibly points to the subsequence matching given key.
This function is equivalent to
std::make_pair(c.lower_bound(val),
c.upper_bound(val))
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>size_typestd::set<_Key,_Compare,_Alloc>::erase(constkey_type&__x)[inline]
Erases elements according to the provided key.
Parameters__x Key of element to be erased.
Returns
The number of elements erased.
This function erases all the elements located by the given key from a set. Note that this function only
erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in
any way. Managing the pointer is the user's responsibility.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>_GLIBCXX_ABI_TAG_CXX11iteratorstd::set<_Key,_Compare,_Alloc>::erase(const_iterator__first,const_iterator__last)[inline]
Erases a [__first,__last) range of elements from a set.
Parameters__first Iterator pointing to the start of the range to be erased.
__last Iterator pointing to the end of the range to be erased.
Returns
The iterator __last.
This function erases a sequence of elements from a set. Note that this function only erases the element,
and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing
the pointer is the user's responsibility.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>_GLIBCXX_ABI_TAG_CXX11iteratorstd::set<_Key,_Compare,_Alloc>::erase(const_iterator__position)[inline]
Erases an element from a set.
Parameters__position An iterator pointing to the element to be erased.
Returns
An iterator pointing to the element immediately following __position prior to the element being
erased. If no such element exists, end() is returned.
This function erases an element, pointed to by the given iterator, from a set. Note that this function
only erases the element, and that if the element is itself a pointer, the pointed-to memory is not
touched in any way. Managing the pointer is the user's responsibility.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>node_typestd::set<_Key,_Compare,_Alloc>::extract(constkey_type&__x)[inline]
Extract a node.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>node_typestd::set<_Key,_Compare,_Alloc>::extract(const_iterator__pos)[inline]
Extract a node.
References std::set<_Key,_Compare,_Alloc>::end().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::find(const_Kt&__x)->decltype(iterator{_M_t._M_find_tr(__x)})
[inline]"
Tries to locate an element in a set.
Parameters__x Element to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the
function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
the-end ( end() ) iterator.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::find(const_Kt&__x)const->decltype(const_iterator{_M_t._M_find_tr(__x)})
[inline]"
Tries to locate an element in a set.
Parameters__x Element to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the
function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
the-end ( end() ) iterator.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::find(constkey_type&__x)[inline]
Tries to locate an element in a set.
Parameters__x Element to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the
function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
the-end ( end() ) iterator.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>const_iteratorstd::set<_Key,_Compare,_Alloc>::find(constkey_type&__x)const[inline]
Tries to locate an element in a set.
Parameters__x Element to be located.
Returns
Iterator pointing to sought-after element, or end() if not found.
This function takes a key and tries to locate the element with which the key matches. If successful the
function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
the-end ( end() ) iterator.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>allocator_typestd::set<_Key,_Compare,_Alloc>::get_allocator()const[inline],[noexcept]
Returns the allocator object with which the set was constructed.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_InputIterator>voidstd::set<_Key,_Compare,_Alloc>::insert(_InputIterator__first,_InputIterator__last)[inline]
A template function that attempts to insert a range of elements.
Parameters__first Iterator pointing to the start of the range to be inserted.
__last Iterator pointing to the end of the range.
Complexity similar to that of the range constructor.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>std::pair<iterator,bool>std::set<_Key,_Compare,_Alloc>::insert(constvalue_type&__x)[inline]
Attempts to insert an element into the set.
Parameters__x Element to be inserted.
Returns
A pair, of which the first element is an iterator that points to the possibly inserted element, and
the second is a bool that is true if the element was actually inserted.
This function attempts to insert an element into the set. A set relies on unique keys and thus an element
is only inserted if it is not already present in the set.
Insertion requires logarithmic time.
Referenced by std::set<_Key,_Compare,_Alloc>::insert().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::insert(const_iterator__hint,node_type&&__nh)[inline]
Re-insert an extracted node.
References std::move().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::insert(const_iterator__position,constvalue_type&__x)[inline]
Attempts to insert an element into the set.
Parameters__position An iterator that serves as a hint as to where the element should be inserted.
__x Element to be inserted.
Returns
An iterator that points to the element with key of __x (may or may not be the element passed in).
This function is not concerned about whether the insertion took place, and thus does not return a boolean
like the single-argument insert() does. Note that the first parameter is only a hint and can potentially
improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
For more on hinting, see:
https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints
Insertion requires logarithmic time (if the hint is not taken).
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>voidstd::set<_Key,_Compare,_Alloc>::insert(initializer_list<value_type>__l)[inline]
Attempts to insert a list of elements into the set.
Parameters__l A std::initializer_list<value_type> of elements to be inserted.
Complexity similar to that of the range constructor.
References std::set<_Key,_Compare,_Alloc>::insert().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>insert_return_typestd::set<_Key,_Compare,_Alloc>::insert(node_type&&__nh)[inline]
Re-insert an extracted node.
References std::move().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>key_comparestd::set<_Key,_Compare,_Alloc>::key_comp()const[inline]
Returns the comparison object with which the set was constructed.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::lower_bound(const_Kt&__x)->decltype(iterator(_M_t._M_lower_bound_tr(__x)))
[inline]"
Finds the beginning of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If
unsuccessful it returns an iterator pointing to the first element that has a greater value than given key
or end() if no such element exists.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::lower_bound(const_Kt&__x)const->decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
[inline]"
Finds the beginning of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If
unsuccessful it returns an iterator pointing to the first element that has a greater value than given key
or end() if no such element exists.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::lower_bound(constkey_type&__x)[inline]
Finds the beginning of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If
unsuccessful it returns an iterator pointing to the first element that has a greater value than given key
or end() if no such element exists.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>const_iteratorstd::set<_Key,_Compare,_Alloc>::lower_bound(constkey_type&__x)const[inline]
Finds the beginning of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to first element equal to or greater than key, or end().
This function returns the first element of a subsequence of elements that matches the given key. If
unsuccessful it returns an iterator pointing to the first element that has a greater value than given key
or end() if no such element exists.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>size_typestd::set<_Key,_Compare,_Alloc>::max_size()const[inline],[noexcept]
Returns the maximum size of the set.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>set&std::set<_Key,_Compare,_Alloc>::operator=(constset<_Key,_Compare,_Alloc>&)[default]
Set assignment operator. Whether the allocator is copied depends on the allocator traits.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>set&std::set<_Key,_Compare,_Alloc>::operator=(initializer_list<value_type>__l)[inline]
Set list assignment operator.
Parameters__l An initializer_list.
This function fills a set with copies of the elements in the initializer list __l.
Note that the assignment completely changes the set and that the resulting set's size is the same as the
number of elements assigned.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>set&std::set<_Key,_Compare,_Alloc>::operator=(set<_Key,_Compare,_Alloc>&&)[default]
Move assignment operator.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>reverse_iteratorstd::set<_Key,_Compare,_Alloc>::rbegin()const[inline],[noexcept]
Returns a read-only (constant) iterator that points to the last element in the set. Iteration is done in
descending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>reverse_iteratorstd::set<_Key,_Compare,_Alloc>::rend()const[inline],[noexcept]
Returns a read-only (constant) reverse iterator that points to the last pair in the set. Iteration is
done in descending order according to the keys.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>size_typestd::set<_Key,_Compare,_Alloc>::size()const[inline],[noexcept]
Returns the size of the set.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>voidstd::set<_Key,_Compare,_Alloc>::swap(set<_Key,_Compare,_Alloc>&__x)[inline],[noexcept]
Swaps data with another set.
Parameters__x A set of the same element and allocator types.
This exchanges the elements between two sets in constant time. (It is only swapping a pointer, an
integer, and an instance of the Compare type (which itself is often stateless and empty), so it should be
quite fast.) Note that the global std::swap() function is specialized such that std::swap(s1,s2) will
feed to this function.
Whether the allocators are swapped depends on the allocator traits.
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::upper_bound(const_Kt&__x)->decltype(iterator(_M_t._M_upper_bound_tr(__x)))
[inline]"
Finds the end of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>template<typename_Kt>autostd::set<_Key,_Compare,_Alloc>::upper_bound(const_Kt&__x)const->decltype(iterator(_M_t._M_upper_bound_tr(__x)))
[inline]"
Finds the end of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>iteratorstd::set<_Key,_Compare,_Alloc>::upper_bound(constkey_type&__x)[inline]
Finds the end of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>const_iteratorstd::set<_Key,_Compare,_Alloc>::upper_bound(constkey_type&__x)const[inline]
Finds the end of a subsequence matching given key.
Parameters__x Key to be located.
Returns
Iterator pointing to the first element greater than key, or end().
template<typename_Key,typename_Compare=std::less<_Key>,typename_Alloc=std::allocator<_Key>>value_comparestd::set<_Key,_Compare,_Alloc>::value_comp()const[inline]
Returns the comparison object with which the set was constructed.
Install Now
PNG Icons
