Keyed-access vector with key subset map for each client class. More...

#include <ClassKeyVector.hh>

Collaboration diagram for utility::keys::ClassKeyVector< K, T, C >:

Public Types
typedef K	key_type
typedef Vector::value_type	value_type
typedef Vector::reference	reference
typedef Vector::const_reference	const_reference
typedef Vector::pointer	pointer
typedef Vector::const_pointer	const_pointer
typedef Vector::iterator	iterator
typedef Vector::const_iterator	const_iterator
typedef Vector::reverse_iterator	reverse_iterator
typedef Vector::const_reverse_iterator	const_reverse_iterator
typedef Vector::size_type	size_type
typedef Vector::index_type	index_type
typedef Vector::difference_type	difference_type
typedef Vector::allocator_type	allocator_type
typedef C	client_type
typedef K	Key
typedef Vector::Value	Value
typedef Vector::Reference	Reference
typedef Vector::ConstReference	ConstReference
typedef Vector::Pointer	Pointer
typedef Vector::ConstPointer	ConstPointer
typedef Vector::Iterator	Iterator
typedef Vector::ConstIterator	ConstIterator
typedef Vector::ReverseIterator	ReverseIterator
typedef Vector::ConstReverseIterator	ConstReverseIterator
typedef Vector::Size	Size
typedef Vector::Index	Index
typedef Vector::Difference	Difference
typedef Vector::Allocator	Allocator
typedef C	Client
Public Member Functions
	ClassKeyVector ()
	Default constructor.
	ClassKeyVector (ClassKeyVector const &a)
	Copy constructor.
	ClassKeyVector (Size const num)
	Size constructor.
	ClassKeyVector (Size const num, Value const &value)
	Uniform value constructor.
template<typename InputIterator >
	ClassKeyVector (InputIterator const beg, InputIterator const end)
	Iterator range constructor.
	~ClassKeyVector ()
	Destructor.
ClassKeyVector &	operator= (ClassKeyVector const &a)
	Copy assignment.
ClassKeyVector &	operator= (Value const &value)
	Uniform value assignment to current elements.
ClassKeyVector &	assign (Key const &key, Value const &value)
	Assign a value to an element with a key.
void	assign (Size const num, Value const &value)
	Uniform value assignment.
template<typename InputIterator >
void	assign (InputIterator const beg, InputIterator const end)
	Iterator assignment.
ClassKeyVector &	add (Key const &key)
	Add an element with a key if not present: Activate key if inactive.
Iterator	insert (Iterator const pos, Value const &value)
	Insert an element at an iterator position.
void	insert (Iterator const pos, Size const num, Value const &value)
	Insert num copies of an element at an iterator position.
template<typename InputIterator >
void	insert (Iterator const pos, InputIterator const beg, InputIterator const end)
	Insert elements from iterator range [beg,end) at an iterator position.
void	push_back (Value const &value)
	Appends an element.
Iterator	erase (Iterator const pos)
	Erase an element at an iterator position.
Iterator	erase (Iterator const beg, Iterator const end)
	Erase elements in the iterator range [beg,end)
void	pop_back ()
	Removes the last element.
void	resize (Size const num)
	Resize: Default construct new elements.
void	resize (Size const num, Value const &value)
	Resize: Assign given value to new elements.
void	reserve (Size const num)
	Reserve space for a given number of elements.
void	shrink ()
	Shrink the vector to remove unused capacity.
template<typename Compare >
void	sort (Compare compare)
	Sort the vector with a given predicate.
void	swap (ClassKeyVector &a)
	swap( ClassKeyVector )
void	clear ()
	Clear the vector.
Size	size () const
	Size.
bool	empty () const
	Empty?
Size	max_size () const
	Max size.
Size	capacity () const
	Capacity.
ConstReference	front () const
	Front element.
Reference	front ()
	Front element.
ConstReference	back () const
	Back element.
Reference	back ()
	Back element.
bool	has (Key const &key) const
	Is an element with a key present?
ConstIterator	find (Key const &key) const
	Iterator to element with a key.
Iterator	find (Key const &key)
	Iterator to element with a key.
Reference	operator() (Key const &key)
	ClassKeyVector( key )
ConstReference	operator[] (Key const &key) const
	ClassKeyVector[ key ] const.
Reference	operator[] (Key const &key)
	ClassKeyVector[ key ].
ConstReference	at (Key const &key) const
	Element at index key: Bounds checked.
Reference	at (Key const &key)
	Element at index key: Bounds checked.
ConstReference	operator[] (Index const &i) const
	ClassKeyVector[ index ] const.
Reference	operator[] (Index const &i)
	ClassKeyVector[ index ].
ConstIterator	begin () const
	Begin iterator.
Iterator	begin ()
	Begin iterator.
ConstIterator	end () const
	End iterator.
Iterator	end ()
	End iterator.
ConstReverseIterator	rbegin () const
	Begin reverse iterator.
ReverseIterator	rbegin ()
	Begin reverse iterator.
ConstReverseIterator	rend () const
	End reverse iterator.
ReverseIterator	rend ()
	End reverse iterator.
Static Public Member Functions
static Index const &	index (Key const &key)
	Index of a key.
static bool	active (Key const &key)
	Is a key active?
static bool	inactive (Key const &key)
	Is a key inactive?
static void	activate (Key const &key)
	Activate a key if inactive.
Friends
void	swap (ClassKeyVector &a, ClassKeyVector &b)
	swap( ClassKeyVector, ClassKeyVector )
bool	operator== (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector == ClassKeyVector.
bool	operator!= (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector != ClassKeyVector.
bool	operator< (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector < ClassKeyVector.
bool	operator> (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector > ClassKeyVector.
bool	operator<= (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector <= ClassKeyVector.
bool	operator>= (ClassKeyVector const &a, ClassKeyVector const &b)
	ClassKeyVector >= ClassKeyVector.