bsl::set< KEY, COMPARATOR, ALLOCATOR > Class Template Reference [Component bslstl_set]

#include <bslstl_set.h>

List of all members.

Classes
class	DataWrapper
Public Types
typedef KEY	key_type
typedef KEY	value_type
typedef COMPARATOR	key_compare
typedef COMPARATOR	value_compare
typedef ALLOCATOR	allocator_type
typedef value_type &	reference
typedef const value_type &	const_reference
typedef AllocatorTraits::size_type	size_type
typedef AllocatorTraits::difference_type	difference_type
typedef AllocatorTraits::pointer	pointer
typedef AllocatorTraits::const_pointer	const_pointer
typedef BloombergLP::bslstl::TreeIterator < const value_type, Node, difference_type >	iterator
typedef BloombergLP::bslstl::TreeIterator < const value_type, Node, difference_type >	const_iterator
typedef bsl::reverse_iterator < iterator >	reverse_iterator
typedef bsl::reverse_iterator < const_iterator >	const_reverse_iterator
Public Member Functions
	set ()
	set (const COMPARATOR &comparator, const ALLOCATOR &basicAllocator=ALLOCATOR())
	set (const ALLOCATOR &basicAllocator)
	set (const set &original)
	set (BloombergLP::bslmf::MovableRef< set > original)
	set (const set &original, const typename type_identity< ALLOCATOR >::type &basicAllocator)
	set (BloombergLP::bslmf::MovableRef< set > original, const typename type_identity< ALLOCATOR >::type &basicAllocator)
template<class INPUT_ITERATOR >
	set (INPUT_ITERATOR first, INPUT_ITERATOR last, const COMPARATOR &comparator=COMPARATOR(), const ALLOCATOR &basicAllocator=ALLOCATOR())
template<class INPUT_ITERATOR >
	set (INPUT_ITERATOR first, INPUT_ITERATOR last, const ALLOCATOR &basicAllocator)
	set (std::initializer_list< KEY > values, const COMPARATOR &comparator=COMPARATOR(), const ALLOCATOR &basicAllocator=ALLOCATOR())
	set (std::initializer_list< KEY > values, const ALLOCATOR &basicAllocator)
	~set ()
set &	operator= (const set &rhs)
set &operator=(BloombergLP::bslmf::MovableRef < set > rhs) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION(AllocatorTraits set &	operator= (std::initializer_list< KEY > values)
iterator	begin () BSLS_KEYWORD_NOEXCEPT
iterator	end () BSLS_KEYWORD_NOEXCEPT
reverse_iterator	rbegin () BSLS_KEYWORD_NOEXCEPT
reverse_iterator	rend () BSLS_KEYWORD_NOEXCEPT
pair< iterator, bool >	insert (const value_type &value)
pair< iterator, bool >	insert (BloombergLP::bslmf::MovableRef< value_type > value)
iterator	insert (const_iterator hint, const value_type &value)
iterator	insert (const_iterator hint, BloombergLP::bslmf::MovableRef< value_type > value)
template<class INPUT_ITERATOR >
void	insert (INPUT_ITERATOR first, INPUT_ITERATOR last)
void	insert (std::initializer_list< KEY > values)
template<class... Args>
pair< iterator, bool >	emplace (Args &&...arguments)
template<class... Args>
iterator	emplace_hint (const_iterator hint, Args &&...arguments)
iterator	erase (const_iterator position)
size_type	erase (const key_type &key)
iterator	erase (const_iterator first, const_iterator last)
iterator	find (const key_type &key)
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, iterator >::type	find (const LOOKUP_KEY &key)
iterator	lower_bound (const key_type &key)
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, iterator >::type	lower_bound (const LOOKUP_KEY &key)
iterator	upper_bound (const key_type &key)
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, iterator >::type	upper_bound (const LOOKUP_KEY &key)
pair< iterator, iterator >	equal_range (const key_type &key)
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, pair< iterator, iterator > >::type	equal_range (const LOOKUP_KEY &key)
allocator_type	get_allocator () const BSLS_KEYWORD_NOEXCEPT
const_iterator	begin () const BSLS_KEYWORD_NOEXCEPT
const_iterator	end () const BSLS_KEYWORD_NOEXCEPT
const_reverse_iterator	rbegin () const BSLS_KEYWORD_NOEXCEPT
const_reverse_iterator	rend () const BSLS_KEYWORD_NOEXCEPT
const_iterator	cbegin () const BSLS_KEYWORD_NOEXCEPT
const_iterator	cend () const BSLS_KEYWORD_NOEXCEPT
const_reverse_iterator	crbegin () const BSLS_KEYWORD_NOEXCEPT
const_reverse_iterator	crend () const BSLS_KEYWORD_NOEXCEPT
bool	empty () const BSLS_KEYWORD_NOEXCEPT
size_type	size () const BSLS_KEYWORD_NOEXCEPT
size_type	max_size () const BSLS_KEYWORD_NOEXCEPT
key_compare	key_comp () const
value_compare	value_comp () const
const_iterator	find (const key_type &key) const
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, const_iterator > ::type	find (const LOOKUP_KEY &key) const
size_type	count (const key_type &key) const
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, size_type >::type	count (const LOOKUP_KEY &key) const
const_iterator	lower_bound (const key_type &key) const
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, const_iterator > ::type	lower_bound (const LOOKUP_KEY &key) const
const_iterator	upper_bound (const key_type &key) const
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, const_iterator > ::type	upper_bound (const LOOKUP_KEY &key) const
pair< const_iterator, const_iterator >	equal_range (const key_type &key) const
template<class LOOKUP_KEY >
bsl::enable_if < BloombergLP::bslmf::IsTransparentPredicate < COMPARATOR, LOOKUP_KEY > ::value, pair< const_iterator, const_iterator > >::type	equal_range (const LOOKUP_KEY &key) const
Public Attributes
void swap(set &other) BSLS_KEYWORD_NOEXCEPT_SPECIFICATION(AllocatorTraits void	clear () BSLS_KEYWORD_NOEXCEPT

---

Detailed Description

template<class KEY, class COMPARATOR = std::less<KEY>, class ALLOCATOR = allocator<KEY>>
class bsl::set< KEY, COMPARATOR, ALLOCATOR >

This class template implements a value-semantic container type holding an ordered sequence of unique keys (of the template parameter type, KEY).

This class:

• supports a complete set of value-semantic operations except for BDEX serialization
• is exception-neutral (agnostic except for the at method)
• is alias-safe
• is const thread-safe

For terminology see bsldoc_glossary.

See Component bslstl_set

---

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

• bslstl_set.h