#include <set.h>

Inheritance diagram for std::__debug::set< _Key, _Compare, _Allocator >:

Public Types
typedef _Allocator	allocator_type

typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, set >	const_iterator

typedef _Base::const_pointer	const_pointer

typedef _Base::const_reference	const_reference

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

typedef _Base::difference_type	difference_type

using	insert_return_type = _Node_insert_return< iterator, node_type >

typedef __gnu_debug::_Safe_iterator< _Base_iterator, set >	iterator

typedef _Compare	key_compare

typedef _Key	key_type

using	node_type = typename _Base::node_type

typedef _Base::pointer	pointer

typedef _Base::reference	reference

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef _Base::size_type	size_type

typedef _Compare	value_compare

typedef _Key	value_type

Public Member Functions
	set (_Base_ref __x)

template<typename _InputIterator >
	set (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())

template<typename _InputIterator >
	set (_InputIterator __first, _InputIterator __last, const allocator_type &__a)

	set (const _Compare &__comp, const _Allocator &__a=_Allocator())

	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(noexcept(_Base(std::move(__x), __a)))

const _Base &	_M_base () const noexcept

_Base &	_M_base () noexcept

const_iterator	begin () const noexcept

iterator	begin () noexcept

const_iterator	cbegin () const noexcept

const_iterator	cend () const noexcept

void	clear () noexcept

const_reverse_iterator	crbegin () const noexcept

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

const_iterator	end () const noexcept

iterator	end () noexcept

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< iterator, iterator >	equal_range (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
std::pair< const_iterator, const_iterator >	equal_range (const _Kt &__x) const

std::pair< iterator, iterator >	equal_range (const key_type &__x)

std::pair< const_iterator, const_iterator >	equal_range (const key_type &__x) const

_Base_iterator	erase (_Base_const_iterator __position)

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 &__key)

node_type	extract (const_iterator __position)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	find (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	find (const _Kt &__x) const

iterator	find (const key_type &__x)

const_iterator	find (const key_type &__x) const

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)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	lower_bound (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	lower_bound (const _Kt &__x) const

iterator	lower_bound (const key_type &__x)

const_iterator	lower_bound (const key_type &__x) const

set &	operator= (const set &)=default

set &	operator= (initializer_list< value_type > __l)

set &	operator= (set &&)=default

const_reverse_iterator	rbegin () const noexcept

reverse_iterator	rbegin () noexcept

const_reverse_iterator	rend () const noexcept

reverse_iterator	rend () noexcept

void	swap (set &__x) noexcept(/conditional /)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
iterator	upper_bound (const _Kt &__x)

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator	upper_bound (const _Kt &__x) const

iterator	upper_bound (const key_type &__x)

const_iterator	upper_bound (const key_type &__x) const

Protected Member Functions
void	_M_swap (_Safe_container &__x) noexcept

Friends
template<typename _ItT , typename _SeqT , typename _CatT >
class	::__gnu_debug::_Safe_iterator

Detailed Description

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

Class std::set with safety/checking/debug instrumentation.

Definition at line 44 of file set.h.

Member Typedef Documentation

◆ allocator_type

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

typedef _Allocator std::__debug::set< _Key, _Compare, _Allocator >::allocator_type

Definition at line 77 of file set.h.

◆ const_iterator

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

typedef __gnu_debug::_Safe_iterator<_Base_const_iterator, set> std::__debug::set< _Key, _Compare, _Allocator >::const_iterator

Definition at line 84 of file set.h.

◆ const_pointer

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

typedef _Base::const_pointer std::__debug::set< _Key, _Compare, _Allocator >::const_pointer

Definition at line 89 of file set.h.

◆ const_reference

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

typedef _Base::const_reference std::__debug::set< _Key, _Compare, _Allocator >::const_reference

Definition at line 79 of file set.h.

◆ const_reverse_iterator

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

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

Definition at line 91 of file set.h.

◆ difference_type

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

typedef _Base::difference_type std::__debug::set< _Key, _Compare, _Allocator >::difference_type

Definition at line 87 of file set.h.

◆ insert_return_type

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

using std::__debug::set< _Key, _Compare, _Allocator >::insert_return_type = _Node_insert_return<iterator, node_type>

Definition at line 305 of file set.h.

◆ iterator

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

typedef __gnu_debug::_Safe_iterator<_Base_iterator, set> std::__debug::set< _Key, _Compare, _Allocator >::iterator

Definition at line 82 of file set.h.

◆ key_compare

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

typedef _Compare std::__debug::set< _Key, _Compare, _Allocator >::key_compare

Definition at line 75 of file set.h.

◆ key_type

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

typedef _Key std::__debug::set< _Key, _Compare, _Allocator >::key_type

Definition at line 73 of file set.h.

◆ node_type

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

using std::__debug::set< _Key, _Compare, _Allocator >::node_type = typename _Base::node_type

Definition at line 304 of file set.h.

◆ pointer

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

typedef _Base::pointer std::__debug::set< _Key, _Compare, _Allocator >::pointer

Definition at line 88 of file set.h.

◆ reference

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

typedef _Base::reference std::__debug::set< _Key, _Compare, _Allocator >::reference

Definition at line 78 of file set.h.

◆ reverse_iterator

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

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

Definition at line 90 of file set.h.

◆ size_type

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

typedef _Base::size_type std::__debug::set< _Key, _Compare, _Allocator >::size_type

Definition at line 86 of file set.h.

◆ value_compare

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

typedef _Compare std::__debug::set< _Key, _Compare, _Allocator >::value_compare

Definition at line 76 of file set.h.

◆ value_type

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

typedef _Key std::__debug::set< _Key, _Compare, _Allocator >::value_type

Definition at line 74 of file set.h.

Constructor & Destructor Documentation

◆ set() [1/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set	(	initializer_list< value_type >	__l,
		const _Compare &	__comp = `_Compare()`,
		const allocator_type &	__a = `allocator_type()`
	)

inline

Definition at line 107 of file set.h.

◆ set() [2/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set ( const allocator_type & __a )

inlineexplicit

Definition at line 113 of file set.h.

◆ set() [3/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set	(	const set< _Key, _Compare, _Allocator > &	__x,
		const __type_identity_t< allocator_type > &	__a
	)

inline

Definition at line 116 of file set.h.

◆ set() [4/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set	(	set< _Key, _Compare, _Allocator > &&	__x,
		const __type_identity_t< allocator_type > &	__a
	)

inlinenoexcept

Definition at line 119 of file set.h.

◆ set() [5/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set	(	initializer_list< value_type >	__l,
		const allocator_type &	__a
	)

inline

Definition at line 124 of file set.h.

◆ set() [6/9]

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

template<typename _InputIterator >

std::__debug::set< _Key, _Compare, _Allocator >::set	(	_InputIterator	__first,
		_InputIterator	__last,
		const allocator_type &	__a
	)

inline

Definition at line 128 of file set.h.

◆ set() [7/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set	(	const _Compare &	__comp,
		const _Allocator &	__a = `_Allocator()`
	)

inlineexplicit

Definition at line 137 of file set.h.

◆ set() [8/9]

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

template<typename _InputIterator >

std::__debug::set< _Key, _Compare, _Allocator >::set	(	_InputIterator	__first,
		_InputIterator	__last,
		const _Compare &	__comp = `_Compare()`,
		const _Allocator &	__a = `_Allocator()`
	)

inline

Definition at line 142 of file set.h.

◆ set() [9/9]

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

std::__debug::set< _Key, _Compare, _Allocator >::set ( _Base_ref __x )

inline

Definition at line 150 of file set.h.

Member Function Documentation

◆ _M_base() [1/2]

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

const _Base & std::__debug::set< _Key, _Compare, _Allocator >::_M_base ( ) const

inlinenoexcept

Definition at line 568 of file set.h.

◆ _M_base() [2/2]

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

_Base & std::__debug::set< _Key, _Compare, _Allocator >::_M_base ( )

inlinenoexcept

Definition at line 565 of file set.h.

◆ _M_swap()

template<typename _SafeContainer , typename _Alloc , template< typename > class _SafeBase, bool _IsCxx11AllocatorAware = true>

void __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >::_M_swap ( _Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > & __x )

inlineprotectednoexceptinherited

Definition at line 117 of file safe_container.h.

◆ begin() [1/2]

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::begin ( ) const

inlinenoexcept

Definition at line 177 of file set.h.

◆ begin() [2/2]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::begin ( )

inlinenoexcept

Definition at line 173 of file set.h.

◆ cbegin()

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::cbegin ( ) const

inlinenoexcept

Definition at line 206 of file set.h.

◆ cend()

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::cend ( ) const

inlinenoexcept

Definition at line 210 of file set.h.

◆ clear()

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

void std::__debug::set< _Key, _Compare, _Allocator >::clear ( )

inlinenoexcept

Definition at line 431 of file set.h.

◆ crbegin()

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

const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::crbegin ( ) const

inlinenoexcept

Definition at line 214 of file set.h.

◆ crend()

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

const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::crend ( ) const

inlinenoexcept

Definition at line 218 of file set.h.

◆ emplace()

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

template<typename... _Args>

std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::emplace ( _Args &&... __args )

inline

Definition at line 231 of file set.h.

◆ emplace_hint()

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

template<typename... _Args>

iterator std::__debug::set< _Key, _Compare, _Allocator >::emplace_hint	(	const_iterator	__pos,
		_Args &&...	__args
	)

inline

Definition at line 239 of file set.h.

◆ end() [1/2]

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::end ( ) const

inlinenoexcept

Definition at line 185 of file set.h.

◆ end() [2/2]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::end ( )

inlinenoexcept

Definition at line 181 of file set.h.

◆ equal_range() [1/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

std::pair< iterator, iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const _Kt & __x )

inline

Definition at line 547 of file set.h.

◆ equal_range() [2/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

std::pair< const_iterator, const_iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const _Kt & __x ) const

inline

Definition at line 557 of file set.h.

◆ equal_range() [3/4]

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

std::pair< iterator, iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const key_type & __x )

inline

Definition at line 523 of file set.h.

◆ equal_range() [4/4]

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

std::pair< const_iterator, const_iterator > std::__debug::set< _Key, _Compare, _Allocator >::equal_range ( const key_type & __x ) const

inline

Definition at line 534 of file set.h.

◆ erase() [1/4]

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

_Base_iterator std::__debug::set< _Key, _Compare, _Allocator >::erase ( _Base_const_iterator __position )

inline

Definition at line 352 of file set.h.

◆ erase() [2/4]

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

size_type std::__debug::set< _Key, _Compare, _Allocator >::erase ( const key_type & __x )

inline

Definition at line 369 of file set.h.

◆ erase() [3/4]

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

_GLIBCXX_ABI_TAG_CXX11 iterator std::__debug::set< _Key, _Compare, _Allocator >::erase	(	const_iterator	__first,
		const_iterator	__last
	)

inline

Definition at line 385 of file set.h.

◆ erase() [4/4]

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

_GLIBCXX_ABI_TAG_CXX11 iterator std::__debug::set< _Key, _Compare, _Allocator >::erase ( const_iterator __position )

inline

Definition at line 345 of file set.h.

◆ extract() [1/2]

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

node_type std::__debug::set< _Key, _Compare, _Allocator >::extract ( const key_type & __key )

inline

Definition at line 316 of file set.h.

◆ extract() [2/2]

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

node_type std::__debug::set< _Key, _Compare, _Allocator >::extract ( const_iterator __position )

inline

Definition at line 308 of file set.h.

◆ find() [1/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const _Kt & __x )

inline

Definition at line 457 of file set.h.

◆ find() [2/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const _Kt & __x ) const

inline

Definition at line 464 of file set.h.

◆ find() [3/4]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const key_type & __x )

inline

Definition at line 443 of file set.h.

◆ find() [4/4]

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::find ( const key_type & __x ) const

inline

Definition at line 449 of file set.h.

◆ insert() [1/8]

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

template<typename _InputIterator >

void std::__debug::set< _Key, _Compare, _Allocator >::insert	(	_InputIterator	__first,
		_InputIterator	__last
	)

inline

Definition at line 285 of file set.h.

◆ insert() [2/8]

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

std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::insert ( const value_type & __x )

inline

Definition at line 251 of file set.h.

◆ insert() [3/8]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::insert	(	const_iterator	__hint,
		node_type &&	__nh
	)

inline

Definition at line 333 of file set.h.

◆ insert() [4/8]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::insert	(	const_iterator	__position,
		const value_type &	__x
	)

inline

Definition at line 268 of file set.h.

◆ insert() [5/8]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::insert	(	const_iterator	__position,
		value_type &&	__x
	)

inline

Definition at line 276 of file set.h.

◆ insert() [6/8]

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

void std::__debug::set< _Key, _Compare, _Allocator >::insert ( initializer_list< value_type > __l )

inline

Definition at line 299 of file set.h.

◆ insert() [7/8]

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

insert_return_type std::__debug::set< _Key, _Compare, _Allocator >::insert ( node_type && __nh )

inline

Definition at line 325 of file set.h.

◆ insert() [8/8]

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

std::pair< iterator, bool > std::__debug::set< _Key, _Compare, _Allocator >::insert ( value_type && __x )

inline

Definition at line 260 of file set.h.

◆ lower_bound() [1/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const _Kt & __x )

inline

Definition at line 485 of file set.h.

◆ lower_bound() [2/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const _Kt & __x ) const

inline

Definition at line 492 of file set.h.

◆ lower_bound() [3/4]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const key_type & __x )

inline

Definition at line 471 of file set.h.

◆ lower_bound() [4/4]

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::lower_bound ( const key_type & __x ) const

inline

Definition at line 477 of file set.h.

◆ operator=()

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

set & std::__debug::set< _Key, _Compare, _Allocator >::operator= ( initializer_list< value_type > __l )

inline

Definition at line 161 of file set.h.

◆ rbegin() [1/2]

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

const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rbegin ( ) const

inlinenoexcept

Definition at line 193 of file set.h.

◆ rbegin() [2/2]

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

reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rbegin ( )

inlinenoexcept

Definition at line 189 of file set.h.

◆ rend() [1/2]

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

const_reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rend ( ) const

inlinenoexcept

Definition at line 201 of file set.h.

◆ rend() [2/2]

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

reverse_iterator std::__debug::set< _Key, _Compare, _Allocator >::rend ( )

inlinenoexcept

Definition at line 197 of file set.h.

◆ swap()

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

void std::__debug::set< _Key, _Compare, _Allocator >::swap ( set< _Key, _Compare, _Allocator > & __x )

inlinenoexcept

Definition at line 423 of file set.h.

◆ upper_bound() [1/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const _Kt & __x )

inline

Definition at line 511 of file set.h.

◆ upper_bound() [2/4]

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

template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const _Kt & __x ) const

inline

Definition at line 518 of file set.h.

◆ upper_bound() [3/4]

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

iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const key_type & __x )

inline

Definition at line 497 of file set.h.

◆ upper_bound() [4/4]

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

const_iterator std::__debug::set< _Key, _Compare, _Allocator >::upper_bound ( const key_type & __x ) const

inline

Definition at line 503 of file set.h.

Friends And Related Symbol Documentation

◆ ::__gnu_debug::_Safe_iterator

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

template<typename _ItT , typename _SeqT , typename _CatT >

friend class ::__gnu_debug::_Safe_iterator

friend

Definition at line 59 of file set.h.

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

set.h

Public Types

Public Member Functions

Protected Member Functions

Friends

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ insert_return_type

◆ iterator

◆ key_compare

◆ key_type

◆ node_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ set() [1/9]

◆ set() [2/9]

◆ set() [3/9]

◆ set() [4/9]

◆ set() [5/9]

◆ set() [6/9]

◆ set() [7/9]

◆ set() [8/9]

◆ set() [9/9]

Member Function Documentation

◆ _M_base() [1/2]

◆ _M_base() [2/2]

◆ _M_swap()

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ crbegin()

◆ crend()

◆ emplace()

◆ emplace_hint()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/4]

◆ equal_range() [2/4]

◆ equal_range() [3/4]

◆ equal_range() [4/4]

◆ erase() [1/4]

◆ erase() [2/4]

◆ erase() [3/4]

◆ erase() [4/4]

◆ extract() [1/2]

◆ extract() [2/2]

◆ find() [1/4]

◆ find() [2/4]

◆ find() [3/4]

◆ find() [4/4]

◆ insert() [1/8]

◆ insert() [2/8]

◆ insert() [3/8]

◆ insert() [4/8]

◆ insert() [5/8]

◆ insert() [6/8]

◆ insert() [7/8]

◆ insert() [8/8]

◆ lower_bound() [1/4]

◆ lower_bound() [2/4]

◆ lower_bound() [3/4]

◆ lower_bound() [4/4]

◆ operator=()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ swap()