Definition at line 48 of file set.h.
|
Public typedefs.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Iterator-related typedefs.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Default constructor creates no elements.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Builds a set from a range.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Set copy constructor.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Detach all iterators, leaving them singular. Referenced by __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base(). |
|
Detach all singular iterators.
Referenced by std::__debug::deque< _Tp, _Allocator >::erase(), and std::__debug::list< _Tp, _Allocator >::resize(). |
|
For use in _Safe_sequence. |
|
|
Invalidates all iterators |
|
Revalidates all attached singular iterators. This method may be used to validate iterators that were invalidated before (but for some reasion, such as an exception, need to become valid again). Referenced by std::__debug::deque< _Tp, _Allocator >::erase(). |
|
Swap this sequence with the given sequence. This operation also swaps ownership of the iterators, so that when the operation is complete all iterators that originally referenced one container now reference the other container. Referenced by std::__debug::vector< _Tp, _Allocator >::swap(), __gnu_debug::basic_string< _CharT, _Traits, _Allocator >::swap(), std::__debug::set< _Key, _Compare, _Allocator >::swap(), std::__debug::multiset< _Key, _Compare, _Allocator >::swap(), std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >::swap(), std::__debug::map< _Key, _Tp, _Compare, _Allocator >::swap(), __gnu_cxx::__debug::hash_set< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >::swap(), __gnu_cxx::__debug::hash_multimap< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(), and __gnu_cxx::__debug::hash_map< _Value, _Tp, _HashFcn, _EqualKey, _Alloc >::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Returns a read/write iterator that points to the first element in the set. Iteration is done in ascending order according to the keys. Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 112 of file set.h. References std::set< _Key, _Compare, _Allocator >::begin(). |
|
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 responsibilty. Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 210 of file set.h. References std::__debug::set< _Key, _Compare, _Allocator >::begin(), std::__debug::set< _Key, _Compare, _Allocator >::end(), and std::__debug::set< _Key, _Compare, _Allocator >::erase(). |
|
Finds the number of elements.
Definition at line 411 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::end(), and std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::find(). |
|
Returns true if the set is empty.
Definition at line 261 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::empty(). |
|
Returns a read/write iterator that points one past the last element in the set. Iteration is done in ascending order according to the keys. Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 120 of file set.h. References std::set< _Key, _Compare, _Allocator >::end(). |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multisets. Definition at line 491 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::equal_range(). |
|
Erases a [first,last) range of elements from a set.
Definition at line 387 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::erase(). |
|
Erases elements according to the provided key.
Definition at line 372 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::erase(). |
|
Erases an element from a set.
Definition at line 357 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::erase(). Referenced by std::__debug::set< _Key, _Compare, _Allocator >::erase(). |
|
Tries to locate an element in a set.
end() ) iterator.
Definition at line 429 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::find(). Referenced by std::__debug::set< _Key, _Compare, _Allocator >::find(). |
|
Returns the allocator object with which the set was constructed.
Definition at line 222 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::get_allocator(). |
|
Attempts to insert an element into the set.
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting". Insertion requires logarithmic time (if the hint is not taken). Definition at line 331 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_unique(). |
|
Attempts to insert an element into the set.
Insertion requires logarithmic time. Definition at line 304 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_insert_unique(), std::pair< _T1, _T2 >::first, and std::pair< _T1, _T2 >::second. Referenced by std::__debug::set< _Key, _Compare, _Allocator >::insert(). |
|
A template function that attemps to insert a range of elements.
Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 163 of file set.h. References __glibcxx_check_valid_range, and std::set< _Key, _Compare, _Allocator >::insert(). |
|
Returns the comparison object with which the set was constructed.
Definition at line 214 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::key_comp(). |
|
Finds the beginning of a subsequence matching given key.
Definition at line 450 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::lower_bound(). Referenced by std::__debug::set< _Key, _Compare, _Allocator >::lower_bound(). |
|
Returns the maximum size of the set.
Definition at line 271 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::max_size(). |
|
Set assignment operator.
Reimplemented from std::set< _Key, _Compare, _Allocator >. |
|
Returns a read/write reverse iterator that points to the last element in the set. Iteration is done in descending order according to the keys. Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 128 of file set.h. References std::__debug::set< _Key, _Compare, _Allocator >::end(). |
|
Returns a read-only (constant) reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys. Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 136 of file set.h. References std::__debug::set< _Key, _Compare, _Allocator >::begin(). |
|
Returns the size of the set.
Definition at line 266 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::size(). |
|
Swaps data with another set.
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.
Reimplemented from std::set< _Key, _Compare, _Allocator >. Definition at line 203 of file set.h. References __gnu_debug::_Safe_sequence_base::_M_swap(), and std::swap(). Referenced by std::__debug::swap(). |
|
Finds the end of a subsequence matching given key.
Definition at line 466 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::upper_bound(). Referenced by std::__debug::set< _Key, _Compare, _Allocator >::upper_bound(). |
|
Returns the comparison object with which the set was constructed.
Definition at line 218 of file stl_set.h. References std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::key_comp(). |
|
The list of constant iterators that reference this container.
Definition at line 171 of file safe_base.h. Referenced by __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The list of mutable iterators that reference this container.
Definition at line 168 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence< _Sequence >::_M_invalidate_if(), __gnu_debug::_Safe_iterator< _Iterator, _Sequence >::_M_invalidate_single(), and __gnu_debug::_Safe_sequence< _Sequence >::_M_transfer_iter(). |
|
The container version number. This number may never be 0.
Definition at line 174 of file safe_base.h. Referenced by __gnu_debug::_Safe_sequence_base::_M_invalidate_all(). |