|
| | set ()=default |
| |
| template<typename _InputIterator > |
| | set (_InputIterator __first, _InputIterator __last) |
| |
| template<typename _InputIterator > |
| | set (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type()) |
| |
| template<typename _InputIterator > |
| | set (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
| |
| | set (const _Compare &__comp, const allocator_type &__a=allocator_type()) |
| |
| | set (const allocator_type &__a) |
| |
| | set (const set &)=default |
| |
| | set (const set &__x, const allocator_type &__a) |
| |
| | set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) |
| |
| | set (initializer_list< value_type > __l, const allocator_type &__a) |
| |
| | set (set &&)=default |
| |
| | set (set &&__x, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal()) |
| |
| | ~set ()=default |
| |
| iterator | begin () const noexcept |
| |
| iterator | cbegin () const noexcept |
| |
| iterator | cend () const noexcept |
| |
| void | clear () noexcept |
| |
| reverse_iterator | crbegin () const noexcept |
| |
| reverse_iterator | crend () const noexcept |
| |
| template<typename... _Args> |
| std::pair< iterator, bool > | emplace (_Args &&... __args) |
| |
| template<typename... _Args> |
| iterator | emplace_hint (const_iterator __pos, _Args &&... __args) |
| |
| bool | empty () const noexcept |
| |
| iterator | end () const noexcept |
| |
| size_type | erase (const key_type &__x) |
| |
| _GLIBCXX_ABI_TAG_CXX11 iterator | erase (const_iterator __first, const_iterator __last) |
| |
| _GLIBCXX_ABI_TAG_CXX11 iterator | erase (const_iterator __position) |
| |
| allocator_type | get_allocator () const noexcept |
| |
| template<typename _InputIterator > |
| void | insert (_InputIterator __first, _InputIterator __last) |
| |
| std::pair< iterator, bool > | insert (const value_type &__x) |
| |
| iterator | insert (const_iterator __position, const value_type &__x) |
| |
|
iterator | insert (const_iterator __position, value_type &&__x) |
| |
| void | insert (initializer_list< value_type > __l) |
| |
|
std::pair< iterator, bool > | insert (value_type &&__x) |
| |
| key_compare | key_comp () const |
| |
| size_type | max_size () const noexcept |
| |
| set & | operator= (const set &)=default |
| |
| set & | operator= (initializer_list< value_type > __l) |
| |
| set & | operator= (set &&)=default |
| |
| reverse_iterator | rbegin () const noexcept |
| |
| reverse_iterator | rend () const noexcept |
| |
| size_type | size () const noexcept |
| |
| void | swap (set &__x) noexcept(/*conditional */) |
| |
| value_compare | value_comp () const |
| |
|
| size_type | count (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x)) |
| |
|
| iterator | find (const key_type &__x) |
| |
| const_iterator | find (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | find (const _Kt &__x) -> decltype(iterator{_M_t._M_find_tr(__x)}) |
| |
| template<typename _Kt > |
| auto | find (const _Kt &__x) const -> decltype(const_iterator{_M_t._M_find_tr(__x)}) |
| |
|
| iterator | lower_bound (const key_type &__x) |
| |
| const_iterator | lower_bound (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) |
| |
| template<typename _Kt > |
| auto | lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) |
| |
|
| iterator | upper_bound (const key_type &__x) |
| |
| const_iterator | upper_bound (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) |
| |
| template<typename _Kt > |
| auto | upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) |
| |
|
| std::pair< iterator, iterator > | equal_range (const key_type &__x) |
| |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
| |
| template<typename _Kt > |
| auto | equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x))) |
| |
| template<typename _Kt > |
| auto | equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x))) |
| |
|
|
template<typename _K1 , typename _C1 , typename _A1 > |
| bool | operator< (const set< _K1, _C1, _A1 > &, const set< _K1, _C1, _A1 > &) |
| |
|
template<typename _K1 , typename _C1 , typename _A1 > |
| bool | operator== (const set< _K1, _C1, _A1 > &, const set< _K1, _C1, _A1 > &) |
| |
template<typename _Key, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
class std::set< _Key, _Compare, _Alloc >
A standard container made up of unique keys, which can be retrieved in logarithmic time.
- Template Parameters
-
| _Key | Type of key objects. |
| _Compare | Comparison function object type, defaults to less<_Key>. |
| _Alloc | Allocator type, defaults to allocator<_Key>. |
Meets the requirements of a container, a reversible container, and an associative container (using unique keys).
Sets support bidirectional iterators.
The private tree data is declared exactly the same way for set and multiset; the distinction is made entirely in how the tree functions are called (*_unique versus *_equal, same as the standard).
Definition at line 94 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _InputIterator >
| std::set< _Key, _Compare, _Alloc >::set |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last |
|
) |
| |
|
inline |
Builds a set from a range.
- Parameters
-
| __first | An input iterator. |
| __last | An input iterator. |
Create a set consisting of copies of the elements from [__first,__last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last)).
Definition at line 191 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _InputIterator >
Builds a set from a range.
- Parameters
-
| __first | An input iterator. |
| __last | An input iterator. |
| __comp | A comparison functor. |
| __a | An allocator object. |
Create a set consisting of copies of the elements from [__first,__last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last)).
Definition at line 208 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
| void std::set< _Key, _Compare, _Alloc >::clear |
( |
| ) |
|
|
inlinenoexcept |
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.
Definition at line 733 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::set< _Key, _Compare, _Alloc >::count |
( |
const _Kt & |
__x | ) |
const -> decltype(_M_t._M_count_tr(__x))
|
|
inline |
Finds the number of elements.
- Parameters
-
- 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).
Definition at line 754 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename... _Args>
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.
Definition at line 462 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename... _Args>
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).
Definition at line 488 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
Finds a subsequence matching given key.
- Parameters
-
- 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.
Definition at line 908 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::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
-
- 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.
Definition at line 914 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
Finds a subsequence matching given key.
- Parameters
-
- 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.
Definition at line 898 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
Finds a subsequence matching given key.
- Parameters
-
- 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.
Definition at line 902 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 684 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 706 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 654 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::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.
Definition at line 804 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::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.
Definition at line 810 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 794 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 798 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _InputIterator >
| void std::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.
Definition at line 566 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 509 of file stl_set.h.
References std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second.
Referenced by std::set< _Key, _Compare, _Alloc >::insert().
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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).
Definition at line 546 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
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.
Definition at line 578 of file stl_set.h.
References std::set< _Key, _Compare, _Alloc >::insert().
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::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
-
- 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.
Definition at line 839 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
template<typename _Kt >
| auto std::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
-
- 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.
Definition at line 845 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
Finds the beginning of a subsequence matching given key.
- Parameters
-
- 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.
Definition at line 829 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
Finds the beginning of a subsequence matching given key.
- Parameters
-
- 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.
Definition at line 833 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
Set list assignment operator.
- Parameters
-
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.
Definition at line 316 of file stl_set.h.
template<typename _Key , typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<_Key>>
| void std::set< _Key, _Compare, _Alloc >::swap |
( |
set< _Key, _Compare, _Alloc > & |
__x | ) |
|
|
inlinenoexcept |
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.
Definition at line 441 of file stl_set.h.
1.9.1