Public Types | |
typedef Key | key_type |
Public typedefs. | |
typedef Key | value_type |
typedef Compare | key_compare |
typedef Compare | value_compare |
typedef Allocator | allocator_type |
typedef Allocator::reference | reference |
typedef Allocator::const_reference | const_reference |
typedef __gnu_debug::Safe_iterator< typename Base::iterator, set > | iterator |
typedef __gnu_debug::Safe_iterator< typename Base::const_iterator, set > | const_iterator |
typedef Base::size_type | size_type |
typedef Base::difference_type | difference_type |
typedef Allocator::pointer | pointer |
Iterator-related typedefs. | |
typedef Allocator::const_pointer | const_pointer |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
Public Member Functions | |
set (const Compare &comp=Compare(), const Allocator &a=Allocator()) | |
template<typename InputIterator> | |
set (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &a=Allocator()) | |
set (const set< Key, Compare, Allocator > &x) | |
set (const Base &x) | |
~set () | |
set< Key, Compare, Allocator > & | operator= (const set< Key, Compare, Allocator > &x) |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
std::pair< iterator, bool > | insert (const value_type &x) |
Attempts to insert an element into the set. | |
iterator | insert (iterator position, const value_type &x) |
template<typename InputIterator> | |
void | insert (InputIterator first, InputIterator last) |
A template function that attemps to insert a range of elements. | |
void | erase (iterator position) |
size_type | erase (const key_type &x) |
Erases elements according to the provided key. | |
void | erase (iterator first, iterator last) |
void | swap (set< Key, Compare, Allocator > &x) |
void | clear () |
iterator | find (const key_type &x) |
Tries to locate an element in a set. | |
const_iterator | find (const key_type &x) const |
iterator | lower_bound (const key_type &x) |
Finds the beginning of a subsequence matching given key. | |
const_iterator | lower_bound (const key_type &x) const |
iterator | upper_bound (const key_type &x) |
Finds the end of a subsequence matching given key. | |
const_iterator | upper_bound (const key_type &x) const |
std::pair< iterator, iterator > | equal_range (const key_type &x) |
Finds a subsequence matching given key. | |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &x) const |
Base & | M_base () |
const Base & | M_base () const |
key_compare | key_comp () const |
Returns the comparison object with which the set was constructed. | |
value_compare | value_comp () const |
Returns the comparison object with which the set was constructed. | |
allocator_type | get_allocator () const |
Returns the allocator object with which the set was constructed. | |
bool | empty () const |
Returns true if the set is empty. | |
size_type | size () const |
Returns the size of the set. | |
size_type | max_size () const |
Returns the maximum size of the set. | |
void | swap (set< Key, Compare, Allocator > &x) |
Swaps data with another set. | |
iterator | insert (iterator position, const value_type &x) |
Attempts to insert an element into the set. | |
void | erase (iterator position) |
Erases an element from a set. | |
void | erase (iterator first, iterator last) |
Erases a [first,last) range of elements from a set. | |
size_type | count (const key_type &x) const |
Finds the number of elements. | |
void | M_invalidate_if (Predicate pred) |
void | M_transfer_iter (const Safe_iterator< Iterator, set< Key, Compare, Allocator > > &x) |
void | M_invalidate_all () const |
Public Attributes | |
Safe_iterator_base * | M_iterators |
The list of mutable iterators that reference this container. | |
Safe_iterator_base * | M_const_iterators |
The list of constant iterators that reference this container. | |
unsigned int | M_version |
The container version number. This number may never be 0. | |
Protected Member Functions | |
void | M_detach_all () |
void | M_detach_singular () |
void | M_revalidate_singular () |
void | M_swap (Safe_sequence_base &x) |
Private Types | |
typedef std::set< Key, Compare, Allocator > | Base |
typedef __gnu_debug::Safe_sequence< set > | Safe_base |
Private Member Functions | |
void | M_invalidate_all () |
Definition at line 42 of file debug/set.h.
|
Public typedefs.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 51 of file debug/set.h. |
|
Iterator-related typedefs.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 66 of file debug/set.h. |
|
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 106 of file debug/set.h. |
|
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 204 of file debug/set.h. References __gnu_debug_def::set< Key, Compare, Allocator >::begin(), __gnu_debug_def::set< Key, Compare, Allocator >::end(), and __gnu_debug_def::set< Key, Compare, Allocator >::erase(). |
|
Finds the number of elements.
|
|
Returns true if the set is 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 114 of file debug/set.h. |
|
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. Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 245 of file debug/set.h. References std::equal_range(), std::pair< T1, T2 >::first, std::make_pair(), and std::pair< T1, T2 >::second. |
|
Erases a [first,last) range of elements from a set.
|
|
Erases an element from a set.
|
|
Erases elements according to the provided key.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 172 of file debug/set.h. References __gnu_debug::Safe_iterator< Iterator, Sequence >::base(), __gnu_debug_def::set< Key, Compare, Allocator >::end(), and __gnu_debug_def::set< Key, Compare, Allocator >::find(). |
|
Tries to locate an element in a set.
end() ) iterator.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 213 of file debug/set.h. References std::find(). Referenced by __gnu_debug_def::set< Key, Compare, Allocator >::erase(). |
|
Returns the allocator object with which the set was constructed.
|
|
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). |
|
A template function that attemps to insert a range of elements.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 157 of file debug/set.h. |
|
Attempts to insert an element into the set.
Insertion requires logarithmic time. Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 140 of file debug/set.h. References std::pair< T1, T2 >::first, and std::pair< T1, T2 >::second. |
|
Returns the comparison object with which the set was constructed.
Definition at line 222 of file stl_set.h. References std::set< Key, Compare, Alloc >::key_comp(). |
|
Finds the beginning of a subsequence matching given key.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 225 of file debug/set.h. References std::lower_bound(). |
|
Detach all iterators, leaving them singular. |
|
Detach all singular iterators.
|
|
Invalidates all iterators. Definition at line 202 of file safe_base.h. |
|
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). |
|
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. Definition at line 172 of file debug.cc. References __gnu_debug::swap(). |
|
Transfers all iterators that reference this memory location to this sequence from whatever sequence they are attached to. |
|
Returns the maximum size of the set.
|
|
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 122 of file debug/set.h. References __gnu_debug_def::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 130 of file debug/set.h. References __gnu_debug_def::set< Key, Compare, Allocator >::begin(). |
|
Returns the size of the set.
|
|
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.
|
|
Finds the end of a subsequence matching given key.
Reimplemented from std::set< Key, Compare, Allocator >. Definition at line 235 of file debug/set.h. References std::upper_bound(). |
|
Returns the comparison object with which the set was constructed.
|
|
The list of constant iterators that reference this container.
Definition at line 156 of file safe_base.h. |
|
The list of mutable iterators that reference this container.
Definition at line 153 of file safe_base.h. |
|
The container version number. This number may never be 0.
Definition at line 159 of file safe_base.h. |