- Generated by
1.9.1
|
libstdc++
|
Public Types | |
| using | insert_return_type = typename _Rep_type::insert_return_type |
| using | node_type = typename _Rep_type::node_type |
| typedef _Key | key_type |
| typedef _Key | value_type |
| typedef _Compare | key_compare |
| typedef _Compare | value_compare |
| typedef _Alloc | allocator_type |
| typedef _Alloc_traits::pointer | pointer |
| typedef _Alloc_traits::const_pointer | const_pointer |
| typedef _Alloc_traits::reference | reference |
| typedef _Alloc_traits::const_reference | const_reference |
| typedef _Rep_type::const_iterator | iterator |
| typedef _Rep_type::const_iterator | const_iterator |
| typedef _Rep_type::const_reverse_iterator | reverse_iterator |
| typedef _Rep_type::const_reverse_iterator | const_reverse_iterator |
| typedef _Rep_type::size_type | size_type |
| typedef _Rep_type::difference_type | difference_type |
Public Member Functions | |
| 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 __type_identity_t< 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 __type_identity_t< 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) |
| node_type | extract (const key_type &__x) |
| node_type | extract (const_iterator __pos) |
| 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 __hint, node_type &&__nh) |
| iterator | insert (const_iterator __position, const value_type &__x) |
| iterator | insert (const_iterator __position, value_type &&__x) |
| void | insert (initializer_list< value_type > __l) |
| insert_return_type | insert (node_type &&__nh) |
| std::pair< iterator, bool > | insert (value_type &&__x) |
| key_compare | key_comp () const |
| size_type | max_size () const noexcept |
| template<typename _Compare1 > | |
| void | merge (multiset< _Key, _Compare1, _Alloc > &&__source) |
| template<typename _Compare1 > | |
| void | merge (multiset< _Key, _Compare1, _Alloc > &__source) |
| template<typename _Compare1 > | |
| void | merge (set< _Key, _Compare1, _Alloc > &&__source) |
| template<typename _Compare1 > | |
| void | merge (set< _Key, _Compare1, _Alloc > &__source) |
| 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)) |
| bool | contains (const key_type &__x) const |
| template<typename _Kt > | |
| auto | contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true) |
| 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))) |
Friends | |
| 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 , typename > | |
| struct | std::_Rb_tree_merge_helper |
A standard container made up of unique keys, which can be retrieved in logarithmic time.
| _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).
| typedef _Alloc std::set< _Key, _Compare, _Alloc >::allocator_type |
| typedef _Rep_type::const_iterator std::set< _Key, _Compare, _Alloc >::const_iterator |
| typedef _Alloc_traits::const_pointer std::set< _Key, _Compare, _Alloc >::const_pointer |
| typedef _Alloc_traits::const_reference std::set< _Key, _Compare, _Alloc >::const_reference |
| typedef _Rep_type::const_reverse_iterator std::set< _Key, _Compare, _Alloc >::const_reverse_iterator |
| typedef _Rep_type::difference_type std::set< _Key, _Compare, _Alloc >::difference_type |
| typedef _Compare std::set< _Key, _Compare, _Alloc >::key_compare |
| typedef _Rep_type::const_reverse_iterator std::set< _Key, _Compare, _Alloc >::reverse_iterator |
| typedef _Compare std::set< _Key, _Compare, _Alloc >::value_compare |
| typedef _Key std::set< _Key, _Compare, _Alloc >::value_type |
|
default |
Default constructor creates no elements.
|
inlineexplicit |
|
inline |
Builds a set from a range.
| __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)).
|
inline |
Builds a set from a range.
| __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)).
|
default |
Set copy constructor.
Whether the allocator is copied depends on the allocator traits.
|
default |
Set move constructor
The newly-created set contains the exact contents of the moved instance. The moved instance is a valid, but unspecified, set.
|
inline |
Builds a set from an initializer_list.
| __l | An initializer_list. |
| __comp | A comparison functor. |
| __a | An allocator object. |
Create a set consisting of copies of the elements in the list. This is linear in N if the list is already sorted, and NlogN otherwise (where N is __l.size()).
|
inlineexplicit |
|
inline |
|
inlinenoexcept |
|
inline |
|
inline |
|
default |
The dtor only erases the elements, and note 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.
|
inlinenoexcept |
|
inline |
|
inline |
|
inlinenoexcept |
|
inlinenoexcept |
|
inline |
Attempts to build and insert an element into the set.
| __args | Arguments used to generate an element. |
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.
|
inline |
Attempts to insert an element into the set.
| __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. |
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).
|
inlinenoexcept |
|
inline |
Finds a subsequence matching given key.
| __x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
|
inline |
Finds a subsequence matching given key.
| __x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
|
inline |
Finds a subsequence matching given key.
| __x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
|
inline |
Finds a subsequence matching given key.
| __x | Key to be located. |
This function is equivalent to
(but is faster than making the calls separately).
This function probably only makes sense for multisets.
|
inline |
Erases elements according to the provided key.
| __x | Key of element to be 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.
|
inline |
Erases a [__first,__last) range of elements from a set.
| __first | Iterator pointing to the start of the range to be erased. |
| __last | Iterator pointing to the end of the range to be erased. |
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.
|
inline |
Erases an element from a set.
| __position | An iterator pointing to the element to be erased. |
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.
|
inline |
|
inline |
Tries to locate an element in a set.
| __x | Element to be located. |
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.
|
inline |
Tries to locate an element in a set.
| __x | Element to be located. |
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.
|
inline |
Tries to locate an element in a set.
| __x | Element to be located. |
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.
|
inline |
Tries to locate an element in a set.
| __x | Element to be located. |
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.
|
inlinenoexcept |
|
inline |
|
inline |
Attempts to insert an element into the set.
| __x | Element to be 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().
|
inline |
|
inline |
Attempts to insert an element into the set.
| __position | An iterator that serves as a hint as to where the element should be inserted. |
| __x | Element to be inserted. |
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).
|
inline |
Attempts to insert a list of elements into the set.
| __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().
|
inline |
|
inline |
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key to be located. |
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.
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key to be located. |
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.
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key to be located. |
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.
|
inline |
Finds the beginning of a subsequence matching given key.
| __x | Key to be located. |
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.
|
default |
Set assignment operator.
Whether the allocator is copied depends on the allocator traits.
|
inline |
Set list assignment operator.
| __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.
|
default |
Move assignment operator.
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
Swaps data with another set.
| __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.
|
inline |
|
inline |
1.9.1