_GLIBCXX_STD::set< _Key, _Compare, _Alloc > Class Template Reference

A standard container made up of unique keys, which can be retrieved in logarithmic time. More...

#include <stl_set.h>

List of all members.

Public Types
typedef _Key_alloc_type::pointer	pointer
	Iterator-related typedefs.
typedef _Key_alloc_type::const_pointer	const_pointer
typedef _Key_alloc_type::reference	reference
typedef _Key_alloc_type::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 constructor creates no elements.
	set (const _Compare &__comp, const allocator_type &__a=allocator_type())
	Default constructor creates no elements.
template<class _InputIterator>
	set (_InputIterator __first, _InputIterator __last)
	Builds a set from a range.
template<class _InputIterator>
	set (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
	Builds a set from a range.
	set (const set< _Key, _Compare, _Alloc > &__x)
	Set copy constructor.
set< _Key, _Compare, _Alloc > &	operator= (const set< _Key, _Compare, _Alloc > &__x)
	Set assignment operator.
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.
iterator	begin () const
iterator	end () const
reverse_iterator	rbegin () const
reverse_iterator	rend () const
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, _Alloc > &__x)
	Swaps data with another set.
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<class _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	clear ()
size_type	count (const key_type &__x) const
	Finds the number of elements.
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
Private Types
typedef _Alloc::value_type	_Alloc_value_type
typedef _Compare	key_compare
typedef _Compare	value_compare
typedef _Alloc	allocator_type
typedef _Alloc::template rebind< _Key >::other	_Key_alloc_type
typedef _Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Key_alloc_type >	_Rep_type
Private Member Functions
	__glibcxx_class_requires (_Key, _SGIAssignableConcept) __glibcxx_class_requires4(_Compare
Private Attributes
	bool
	_Key
_BinaryFunctionConcept __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept) public typedef _Key	value_type
_Rep_type	_M_t
Friends
template<class _K1, class _C1, class _A1>
bool	operator== (const set< _K1, _C1, _A1 > &, const set< _K1, _C1, _A1 > &)
template<class _K1, class _C1, class _A1>
bool	operator< (const set< _K1, _C1, _A1 > &, const set< _K1, _C1, _A1 > &)

---

Detailed Description

template<class _Key, class _Compare, class _Alloc>
class _GLIBCXX_STD::set< _Key, _Compare, _Alloc >

A standard container made up of unique keys, which can be retrieved in logarithmic time.

Meets the requirements of a container, a reversible container, and an associative container (using unique keys).

Sets support bidirectional iterators.

Parameters:

	Key	Type of key objects.
	Compare	Comparison function object type, defaults to less<Key>.
	Alloc	Allocator type, defaults to allocator<Key>.

Definition at line 107 of file stl_set.h.

---

Member Typedef Documentation

template<class _Key, class _Compare, class _Alloc>

typedef _Alloc::value_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_Alloc_value_type [private]

Definition at line 110 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Alloc::template rebind<_Key>::other _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_Key_alloc_type [private]

Definition at line 128 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rb_tree<key_type, value_type, _Identity<value_type>, key_compare, _Key_alloc_type> _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_Rep_type [private]

Definition at line 131 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Alloc _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::allocator_type [private]

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 124 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::const_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::const_iterator

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 145 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Key_alloc_type::const_pointer _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::const_pointer

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 138 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Key_alloc_type::const_reference _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::const_reference

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 140 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::const_reverse_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::const_reverse_iterator

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 147 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::difference_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::difference_type

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 149 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::const_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::iterator

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 144 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Compare _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::key_compare [private]

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 122 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Key_alloc_type::pointer _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::pointer

Iterator-related typedefs.

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 137 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Key_alloc_type::reference _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::reference

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 139 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::const_reverse_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::reverse_iterator

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 146 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Rep_type::size_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::size_type

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 148 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

typedef _Compare _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::value_compare [private]

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 123 of file stl_set.h.

---

Constructor & Destructor Documentation

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::set

(

)

[inline]

Default constructor creates no elements.

Definition at line 154 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::set	(	const _Compare &	__comp,
		const allocator_type &	__a = allocator_type()
	)			[inline, explicit]

Default constructor creates no elements.

Parameters:

	comp	Comparator to use.
	a	Allocator to use.

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 164 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

template<class _InputIterator>

_GLIBCXX_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 178 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

template<class _InputIterator>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::set	(	_InputIterator	__first,
		_InputIterator	__last,
		const _Compare &	__comp,
		const allocator_type &	__a = allocator_type()
	)			[inline]

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

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 194 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::set

(

const set< _Key, _Compare, _Alloc > &

__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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 207 of file stl_set.h.

---

Member Function Documentation

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::__glibcxx_class_requires	(	_Key	,
		_SGIAssignableConcept
	)			[private]

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 244 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

void _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 411 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

size_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::count

(

const key_type &

__x

)

const [inline]

Finds the number of elements.

Parameters:

x

Element to located.

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 425 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

bool _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::empty

(

)

const [inline]

Returns true if the set is empty.

Definition at line 275 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 252 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

std::pair<const_iterator, const_iterator> _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::equal_range

(

const key_type &

__x

)

const [inline]

Definition at line 509 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

std::pair<iterator, iterator> _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 505 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

void _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 401 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

size_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 386 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

void _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 371 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

const_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::find

(

const key_type &

__x

)

const [inline]

Definition at line 447 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 443 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

allocator_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::get_allocator

(

)

const [inline]

Returns the allocator object with which the set was constructed.

Definition at line 236 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

template<class _InputIterator>

void _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 358 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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).

Definition at line 345 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

std::pair<iterator,bool> _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 318 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

key_compare _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::key_comp

(

)

const [inline]

Returns the comparison object with which the set was constructed.

Definition at line 228 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

const_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::lower_bound

(

const key_type &

__x

)

const [inline]

Definition at line 468 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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.

Definition at line 464 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

size_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::max_size

(

)

const [inline]

Returns the maximum size of the set.

Definition at line 285 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

set<_Key,_Compare,_Alloc>& _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::operator=

(

const set< _Key, _Compare, _Alloc > &

__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.

Definition at line 218 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

reverse_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 261 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

reverse_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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 in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 270 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

size_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::size

(

)

const [inline]

Returns the size of the set.

Definition at line 280 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

void _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::swap

(

set< _Key, _Compare, _Alloc > &

__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.

Definition at line 300 of file stl_set.h.

Referenced by _GLIBCXX_STD::swap().

template<class _Key, class _Compare, class _Alloc>

const_iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::upper_bound

(

const key_type &

__x

)

const [inline]

Definition at line 484 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

iterator _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::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().

Definition at line 480 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

value_compare _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::value_comp

(

)

const [inline]

Returns the comparison object with which the set was constructed.

Definition at line 232 of file stl_set.h.

---

Friends And Related Function Documentation

template<class _Key, class _Compare, class _Alloc>

template<class _K1, class _C1, class _A1>

bool operator<	(	const set< _K1, _C1, _A1 > &	,
		const set< _K1, _C1, _A1 > &
	)			[friend]

template<class _Key, class _Compare, class _Alloc>

template<class _K1, class _C1, class _A1>

bool operator==	(	const set< _K1, _C1, _A1 > &	,
		const set< _K1, _C1, _A1 > &
	)			[friend]

---

Member Data Documentation

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_Key [private]

Definition at line 112 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

_Rep_type _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::_M_t [private]

Definition at line 132 of file stl_set.h.

Referenced by _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::begin(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::clear(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::count(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::empty(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::end(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::equal_range(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::erase(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::find(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::get_allocator(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::insert(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::key_comp(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::lower_bound(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::max_size(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::operator=(), _GLIBCXX_STD::operator==(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::rbegin(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::rend(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::set(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::size(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::swap(), _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::upper_bound(), and _GLIBCXX_STD::set< _Key, _Compare, _Allocator >::value_comp().

template<class _Key, class _Compare, class _Alloc>

_GLIBCXX_STD::set< _Key, _Compare, _Alloc >::bool [private]

Definition at line 112 of file stl_set.h.

template<class _Key, class _Compare, class _Alloc>

_BinaryFunctionConcept __glibcxx_class_requires2 (_Key, _Alloc_value_type, _SameTypeConcept) public typedef _Key _GLIBCXX_STD::set< _Key, _Compare, _Alloc >::value_type [private]

Reimplemented in __gnu_debug_def::set< _Key, _Compare, _Allocator >.

Definition at line 114 of file stl_set.h.

---

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

• stl_set.h

---