__gnu_debug_def::set< _Key, _Compare, _Allocator > Class Template Reference

#include <set.h>

Inheritance diagram for __gnu_debug_def::set< _Key, _Compare, _Allocator >:


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 copy constructor.
	set (const _Base &__x)
	~set ()
set< _Key, _Compare, _Allocator > &	operator= (const set< _Key, _Compare, _Allocator > &__x)
	Set assignment operator.
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)
	Attempts to insert an element into the set.
template<typename _InputIterator> void	insert (_InputIterator __first, _InputIterator __last)
	A template function that attemps to insert a range of elements.
void	erase (iterator __position)
	Erases an element from a set.
size_type	erase (const key_type &__x)
	Erases elements according to the provided key.
void	erase (iterator __first, iterator __last)
	Erases a [first,last) range of elements from a set.
void	swap (set< _Key, _Compare, _Allocator > &__x)
	Swaps data with another set.
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
Private Types
typedef _GLIBCXX_STD::set< _Key, _Compare, _Allocator >	_Base
typedef __gnu_debug::_Safe_sequence< set >	_Safe_base
Private Member Functions
void	_M_invalidate_all ()

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
class __gnu_debug_def::set< _Key, _Compare, _Allocator >

Member Typedef Documentation

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _GLIBCXX_STD::set<_Key,_Compare,_Allocator> __gnu_debug_def::set< _Key, _Compare, _Allocator >::_Base [private]

Definition at line 46 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef __gnu_debug::_Safe_sequence<set> __gnu_debug_def::set< _Key, _Compare, _Allocator >::_Safe_base [private]

Definition at line 47 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Allocator __gnu_debug_def::set< _Key, _Compare, _Allocator >::allocator_type

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 55 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Allocator::const_pointer __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_pointer

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 67 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Allocator::const_reference __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_reference

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 57 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef std::reverse_iterator<const_iterator> __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_reverse_iterator

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 69 of file debug/set.h.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::rbegin(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::rend().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Base::difference_type __gnu_debug_def::set< _Key, _Compare, _Allocator >::difference_type

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 65 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Compare __gnu_debug_def::set< _Key, _Compare, _Allocator >::key_compare

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 53 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Key __gnu_debug_def::set< _Key, _Compare, _Allocator >::key_type

Public typedefs.

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 51 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Allocator::pointer __gnu_debug_def::set< _Key, _Compare, _Allocator >::pointer

Iterator-related typedefs.

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 66 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Allocator::reference __gnu_debug_def::set< _Key, _Compare, _Allocator >::reference

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 56 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef std::reverse_iterator<iterator> __gnu_debug_def::set< _Key, _Compare, _Allocator >::reverse_iterator

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 68 of file debug/set.h.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::rbegin(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::rend().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Base::size_type __gnu_debug_def::set< _Key, _Compare, _Allocator >::size_type

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 64 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Compare __gnu_debug_def::set< _Key, _Compare, _Allocator >::value_compare

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 54 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

typedef _Key __gnu_debug_def::set< _Key, _Compare, _Allocator >::value_type

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 52 of file debug/set.h.

Constructor & Destructor Documentation

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

__gnu_debug_def::set< _Key, _Compare, _Allocator >::set ( const _Compare & __comp = _Compare(),

const _Allocator & __a = _Allocator()

) [inline, explicit]

Definition at line 72 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

template<typename _InputIterator>

__gnu_debug_def::set< _Key, _Compare, _Allocator >::set ( _InputIterator __first,

_InputIterator __last,

const _Compare & __comp = _Compare(),

const _Allocator & __a = _Allocator()

) [inline]

Definition at line 77 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

__gnu_debug_def::set< _Key, _Compare, _Allocator >::set ( const set< _Key, _Compare, _Allocator > & __x ) [inline]

Set copy constructor.

Parameters:

x A set of identical element and allocator types.

The newly-created set uses a copy of the allocation object used by x.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 83 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

__gnu_debug_def::set< _Key, _Compare, _Allocator >::~set ( ) [inline]

Definition at line 88 of file debug/set.h.

Member Function Documentation

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const _Base& __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_base ( ) const [inline]

Definition at line 270 of file debug/set.h.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

_Base& __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_base ( ) [inline]

Definition at line 267 of file debug/set.h.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_invalidate_all(), __gnu_debug_def::operator!=(), __gnu_debug_def::operator==(), __gnu_debug_def::operator>(), and __gnu_debug_def::operator>=().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_invalidate_all ( ) [inline, private]

Definition at line 274 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_base(), __gnu_debug::_Safe_sequence< set< _Key, _Compare, _Allocator > >::_M_invalidate_if(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::end().
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::operator=().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::begin ( ) const [inline]

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 _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 106 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::begin ( ) [inline]

Definition at line 102 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::clear(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::rend().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::clear ( ) [inline]

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 _GLIBCXX_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().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::end ( ) const [inline]

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 _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 114 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::end ( ) [inline]

Definition at line 110 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_invalidate_all(), __gnu_debug_def::set< _Key, _Compare, _Allocator >::clear(), __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::rbegin().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

std::pair<const_iterator,const_iterator> __gnu_debug_def::set< _Key, _Compare, _Allocator >::equal_range ( const key_type & __x ) const [inline]

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 257 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator, std::pair< _T1, _T2 >::first, std::make_pair(), and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

std::pair<iterator,iterator> __gnu_debug_def::set< _Key, _Compare, _Allocator >::equal_range ( const key_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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 245 of file debug/set.h.
References std::pair< _T1, _T2 >::first, __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator, std::make_pair(), and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase ( iterator __first,

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.

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 responsibilty.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 186 of file debug/set.h.
References __glibcxx_check_erase_range, and __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

size_type __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase ( const key_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 responsibilty.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 172 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::end(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::find().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase ( iterator __position ) [inline]

Erases an element from a set.

Parameters:

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 responsibilty.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 164 of file debug/set.h.
References __glibcxx_check_erase.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::clear(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::find ( const key_type & __x ) const [inline]

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 219 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::find ( const key_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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 213 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.
Referenced by __gnu_debug_def::set< _Key, _Compare, _Allocator >::erase().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

template<typename _InputIterator>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::insert ( _InputIterator __first,

_InputIterator __last

) [inline]

A template function that attemps 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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 157 of file debug/set.h.
References __glibcxx_check_valid_range.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::insert ( iterator __position,

const value_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.
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).
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 149 of file debug/set.h.
References __glibcxx_check_insert, and __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

std::pair<iterator, bool> __gnu_debug_def::set< _Key, _Compare, _Allocator >::insert ( const value_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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 140 of file debug/set.h.
References std::pair< _T1, _T2 >::first, __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator, and std::pair< _T1, _T2 >::second.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::lower_bound ( const key_type & __x ) const [inline]

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 231 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::lower_bound ( const key_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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 225 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

set<_Key,_Compare,_Allocator>& __gnu_debug_def::set< _Key, _Compare, _Allocator >::operator= ( const set< _Key, _Compare, _Allocator > & __x ) [inline]

Set assignment operator.

Parameters:

x A set of identical element and allocator types.

All the elements of x are copied, but unlike the copy constructor, the allocator object is not copied.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 91 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::_M_invalidate_all().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_reverse_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::rbegin ( ) const [inline]

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 _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 122 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_reverse_iterator, and __gnu_debug_def::set< _Key, _Compare, _Allocator >::end().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

reverse_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::rbegin ( ) [inline]

Definition at line 118 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::end(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::reverse_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_reverse_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::rend ( ) const [inline]

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 _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 130 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::begin(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_reverse_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

reverse_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::rend ( ) [inline]

Definition at line 126 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::begin(), and __gnu_debug_def::set< _Key, _Compare, _Allocator >::reverse_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

void __gnu_debug_def::set< _Key, _Compare, _Allocator >::swap ( set< _Key, _Compare, _Allocator > & __x ) [inline]

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.
Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 197 of file debug/set.h.
References __gnu_debug::_Safe_sequence_base::_M_swap().
Referenced by __gnu_debug_def::swap().

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

const_iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::upper_bound ( const key_type & __x ) const [inline]

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 241 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::const_iterator.

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>

iterator __gnu_debug_def::set< _Key, _Compare, _Allocator >::upper_bound ( const key_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().

Reimplemented from _GLIBCXX_STD::set< _Key, _Compare, _Allocator >.
Definition at line 235 of file debug/set.h.
References __gnu_debug_def::set< _Key, _Compare, _Allocator >::iterator.

The documentation for this class was generated from the following file:

debug/set.h

Generated on Tue Jan 30 17:32:06 2007 for GNU C++ STL by

1.3.6

__gnu_debug_def::set< _Key, _Compare, _Allocator > Class Template Reference

Public Types

Public Member Functions

Private Types

Private Member Functions

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>> class __gnu_debug_def::set< _Key, _Compare, _Allocator >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

template<typename _Key, typename _Compare = std::less<_Key>, typename _Allocator = std::allocator<_Key>>
class __gnu_debug_def::set< _Key, _Compare, _Allocator >