#include <SortedVectorSet.hpp>

Public Types
typedef T	key_type

typedef T	data_type

typedef T	value_type

typedef Compare	key_compare

typedef Compare	value_compare

typedef container_t::pointer	pointer

typedef container_t::const_pointer	const_pointer

typedef container_t::reference	reference

typedef container_t::const_reference	const_reference

typedef container_t::iterator	iterator

typedef container_t::const_iterator	const_iterator

typedef container_t::reverse_iterator	reverse_iterator

typedef container_t::const_reverse_iterator	const_reverse_iterator

typedef container_t::size_type	size_type

typedef container_t::difference_type	difference_type

Public Member Functions
	SortedVectorSet ()

	SortedVectorSet (container_t *toWrap)

template<class InputIterator >
	SortedVectorSet (InputIterator first, InputIterator last)

const_iterator	begin () const

const_iterator	end () const

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

bool	empty () const

size_type	size () const

size_type	max_size () const

void	swap (SortedVectorSet< T, Compare > &x)

std::pair< iterator, bool >	insert (const value_type &x)

iterator	insert (iterator, const value_type &x)

template<class InputIterator >
void	insert (InputIterator first, InputIterator last)

iterator	erase (iterator position)

size_type	erase (const key_type &x)

iterator	erase (iterator first, iterator last)

void	clear ()

iterator	find (const key_type &x)

const_iterator	find (const key_type &x) const

size_type	count (const key_type &x) const

iterator	lower_bound (const key_type &x)

const_iterator	lower_bound (const key_type &x) const

iterator	upper_bound (const key_type &x)

const_iterator	upper_bound (const key_type &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

Private Types
typedef std::vector< T >	container_t

Static Private Member Functions
static bool	equivalent (const key_type &x, const key_type &y)

Private Attributes
COWReference< container_t >	m_impl

Friends
bool	operator== (const SortedVectorSet< T, Compare > &x, const SortedVectorSet< T, Compare > &y)

bool	operator< (const SortedVectorSet< T, Compare > &x, const SortedVectorSet< T, Compare > &y)

Detailed Description

template<class T, class Compare = std::less<T>>
class BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >

Definition at line 81 of file SortedVectorSet.hpp.

Member Typedef Documentation

◆ const_iterator

template<class T , class Compare = std::less<T>>

typedef container_t::const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::const_iterator

Definition at line 114 of file SortedVectorSet.hpp.

◆ const_pointer

template<class T , class Compare = std::less<T>>

typedef container_t::const_pointer BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::const_pointer

Definition at line 110 of file SortedVectorSet.hpp.

◆ const_reference

template<class T , class Compare = std::less<T>>

typedef container_t::const_reference BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::const_reference

Definition at line 112 of file SortedVectorSet.hpp.

◆ const_reverse_iterator

template<class T , class Compare = std::less<T>>

typedef container_t::const_reverse_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::const_reverse_iterator

Definition at line 116 of file SortedVectorSet.hpp.

◆ container_t

template<class T , class Compare = std::less<T>>

typedef std::vector<T> BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::container_t

private

Definition at line 94 of file SortedVectorSet.hpp.

◆ data_type

template<class T , class Compare = std::less<T>>

typedef T BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::data_type

Definition at line 105 of file SortedVectorSet.hpp.

◆ difference_type

template<class T , class Compare = std::less<T>>

typedef container_t::difference_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::difference_type

Definition at line 118 of file SortedVectorSet.hpp.

◆ iterator

template<class T , class Compare = std::less<T>>

typedef container_t::iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::iterator

Definition at line 113 of file SortedVectorSet.hpp.

◆ key_compare

template<class T , class Compare = std::less<T>>

typedef Compare BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::key_compare

Definition at line 107 of file SortedVectorSet.hpp.

◆ key_type

template<class T , class Compare = std::less<T>>

typedef T BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::key_type

Definition at line 104 of file SortedVectorSet.hpp.

◆ pointer

template<class T , class Compare = std::less<T>>

typedef container_t::pointer BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::pointer

Definition at line 109 of file SortedVectorSet.hpp.

◆ reference

template<class T , class Compare = std::less<T>>

typedef container_t::reference BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::reference

Definition at line 111 of file SortedVectorSet.hpp.

◆ reverse_iterator

template<class T , class Compare = std::less<T>>

typedef container_t::reverse_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::reverse_iterator

Definition at line 115 of file SortedVectorSet.hpp.

◆ size_type

template<class T , class Compare = std::less<T>>

typedef container_t::size_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::size_type

Definition at line 117 of file SortedVectorSet.hpp.

◆ value_compare

template<class T , class Compare = std::less<T>>

typedef Compare BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::value_compare

Definition at line 108 of file SortedVectorSet.hpp.

◆ value_type

template<class T , class Compare = std::less<T>>

typedef T BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::value_type

Definition at line 106 of file SortedVectorSet.hpp.

Constructor & Destructor Documentation

◆ SortedVectorSet() [1/3]

template<class T , class Compare = std::less<T>>

BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::SortedVectorSet ( )

inline

Definition at line 119 of file SortedVectorSet.hpp.

◆ SortedVectorSet() [2/3]

template<class T , class Compare = std::less<T>>

BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::SortedVectorSet ( container_t * toWrap )

inlineexplicit

Definition at line 120 of file SortedVectorSet.hpp.

◆ SortedVectorSet() [3/3]

template<class T , class Compare = std::less<T>>

template<class InputIterator >

BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::SortedVectorSet	(	InputIterator	first,
		InputIterator	last
	)

inline

Definition at line 126 of file SortedVectorSet.hpp.

Member Function Documentation

◆ begin()

template<class T , class Compare = std::less<T>>

const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::begin ( ) const

inline

Definition at line 132 of file SortedVectorSet.hpp.

◆ clear()

template<class T , class Compare = std::less<T>>

void BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::clear ( )

inline

Definition at line 187 of file SortedVectorSet.hpp.

◆ count()

template<class T , class Compare = std::less<T>>

size_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::count ( const key_type & x ) const

inline

Definition at line 215 of file SortedVectorSet.hpp.

◆ empty()

template<class T , class Compare = std::less<T>>

bool BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::empty ( ) const

inline

Definition at line 136 of file SortedVectorSet.hpp.

◆ end()

template<class T , class Compare = std::less<T>>

const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::end ( ) const

inline

Definition at line 133 of file SortedVectorSet.hpp.

◆ equal_range() [1/2]

template<class T , class Compare = std::less<T>>

std::pair<iterator, iterator> BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::equal_range ( const key_type & x )

inline

Definition at line 244 of file SortedVectorSet.hpp.

◆ equal_range() [2/2]

template<class T , class Compare = std::less<T>>

std::pair<const_iterator, const_iterator> BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::equal_range ( const key_type & x ) const

inline

Definition at line 250 of file SortedVectorSet.hpp.

◆ equivalent()

template<class T , class Compare = std::less<T>>

static bool BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::equivalent	(	const key_type &	x,
		const key_type &	y
	)

inlinestaticprivate

Definition at line 261 of file SortedVectorSet.hpp.

◆ erase() [1/3]

template<class T , class Compare = std::less<T>>

size_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::erase ( const key_type & x )

inline

Definition at line 170 of file SortedVectorSet.hpp.

◆ erase() [2/3]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::erase	(	iterator	first,
		iterator	last
	)

inline

Definition at line 183 of file SortedVectorSet.hpp.

◆ erase() [3/3]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::erase ( iterator position )

inline

Definition at line 166 of file SortedVectorSet.hpp.

◆ find() [1/2]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::find ( const key_type & x )

inline

Definition at line 191 of file SortedVectorSet.hpp.

◆ find() [2/2]

template<class T , class Compare = std::less<T>>

const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::find ( const key_type & x ) const

inline

Definition at line 203 of file SortedVectorSet.hpp.

◆ insert() [1/3]

template<class T , class Compare = std::less<T>>

std::pair<iterator, bool> BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::insert ( const value_type & x )

inline

Definition at line 143 of file SortedVectorSet.hpp.

Referenced by BLOCXX_NAMESPACE::SortedVectorSet< BLOCXX_NAMESPACE::String >::SortedVectorSet().

◆ insert() [2/3]

template<class T , class Compare = std::less<T>>

template<class InputIterator >

void BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::insert	(	InputIterator	first,
		InputIterator	last
	)

inline

Definition at line 160 of file SortedVectorSet.hpp.

◆ insert() [3/3]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::insert	(	iterator	,
		const value_type &	x
	)

inline

Definition at line 155 of file SortedVectorSet.hpp.

◆ lower_bound() [1/2]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::lower_bound ( const key_type & x )

inline

Definition at line 226 of file SortedVectorSet.hpp.

◆ lower_bound() [2/2]

template<class T , class Compare = std::less<T>>

const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::lower_bound ( const key_type & x ) const

inline

Definition at line 230 of file SortedVectorSet.hpp.

◆ max_size()

template<class T , class Compare = std::less<T>>

size_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::max_size ( ) const

inline

Definition at line 138 of file SortedVectorSet.hpp.

◆ rbegin()

template<class T , class Compare = std::less<T>>

const_reverse_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::rbegin ( ) const

inline

Definition at line 134 of file SortedVectorSet.hpp.

◆ rend()

template<class T , class Compare = std::less<T>>

const_reverse_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::rend ( ) const

inline

Definition at line 135 of file SortedVectorSet.hpp.

◆ size()

template<class T , class Compare = std::less<T>>

size_type BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::size ( ) const

inline

Definition at line 137 of file SortedVectorSet.hpp.

◆ swap()

template<class T , class Compare = std::less<T>>

void BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::swap ( SortedVectorSet< T, Compare > & x )

inline

Definition at line 139 of file SortedVectorSet.hpp.

◆ upper_bound() [1/2]

template<class T , class Compare = std::less<T>>

iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::upper_bound ( const key_type & x )

inline

Definition at line 234 of file SortedVectorSet.hpp.

◆ upper_bound() [2/2]

template<class T , class Compare = std::less<T>>

const_iterator BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::upper_bound ( const key_type & x ) const

inline

Definition at line 238 of file SortedVectorSet.hpp.

Friends And Related Function Documentation

◆ operator<

template<class T , class Compare = std::less<T>>

bool operator<	(	const SortedVectorSet< T, Compare > &	x,
		const SortedVectorSet< T, Compare > &	y
	)

friend

Definition at line 274 of file SortedVectorSet.hpp.

◆ operator==

template<class T , class Compare = std::less<T>>

bool operator==	(	const SortedVectorSet< T, Compare > &	x,
		const SortedVectorSet< T, Compare > &	y
	)

friend

Definition at line 268 of file SortedVectorSet.hpp.

Member Data Documentation

◆ m_impl

template<class T , class Compare = std::less<T>>

COWReference<container_t> BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >::m_impl

private

Definition at line 99 of file SortedVectorSet.hpp.

Referenced by BLOCXX_NAMESPACE::SortedVectorSet< BLOCXX_NAMESPACE::String >::count(), BLOCXX_NAMESPACE::SortedVectorSet< BLOCXX_NAMESPACE::String >::insert(), and BLOCXX_NAMESPACE::SortedVectorSet< BLOCXX_NAMESPACE::String >::SortedVectorSet().

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

SortedVectorSet.hpp

Public Types

Public Member Functions

Private Types

Static Private Member Functions

Private Attributes

Friends

Detailed Description

template<class T, class Compare = std::less<T>> class BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >

Member Typedef Documentation

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ container_t

◆ data_type

◆ difference_type

◆ iterator

◆ key_compare

◆ key_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ SortedVectorSet() [1/3]

◆ SortedVectorSet() [2/3]

◆ SortedVectorSet() [3/3]

Member Function Documentation

◆ begin()

◆ clear()

◆ count()

◆ empty()

◆ end()

◆ equal_range() [1/2]

◆ equal_range() [2/2]

◆ equivalent()

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find() [1/2]

◆ find() [2/2]

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ lower_bound() [1/2]

◆ lower_bound() [2/2]

◆ max_size()

◆ rbegin()

◆ rend()

◆ size()

◆ swap()

◆ upper_bound() [1/2]

◆ upper_bound() [2/2]

Friends And Related Function Documentation

◆ operator<

◆ operator==

Member Data Documentation

◆ m_impl

template<class T, class Compare = std::less<T>>
class BLOCXX_NAMESPACE::SortedVectorSet< T, Compare >