Unique version of an associative container. More...

Inherits concepts::AssociativeContainer_concept.

Public Types
typedef mapped_type size_type	erase (const key_type &k)
	Type of values indexed by keys.
Public Member Functions
pair< iterator, bool >	insert (value_type &t)
	Inserts t into a if and only if a does not already contain an element whose key is the same as the key of t.
iterator	find (const key_type &k)
	Return an iterator to the element associated to the given key.
size_type	count (const key_type &)
	Return number of elements associated with the given key.
value_type &	operator[] (const key_type &k)
	Access the element identified by the given key.
iterator	begin ()
	Return an iterator that points at the first element.
iterator	end ()
	Return an iterator that points "after" the last element.
size_type	size ()
	Return number of elements in the container.
size_type	max_size ()
	Return maximum number of elements in the container.
bool	empty ()
	Return true if the container is empty.
Public Attributes
typedef	key_type
	Type of keys of this container.
typedef	value_type
	Type of elements of the container.
typedef	iterator
	Type of the iterators returned by begin() and end().
typedef	size_type
	Type of the element-counts returned by size() and maxsize().

Detailed Description

Unique version of an associative container.

Sorted Associative Containers use an ordering relation on their keys; two keys are considered to be equivalent if neither one is less than the other.

Member Typedef Documentation

typedef mapped_type size_type concepts::AssociativeContainer_concept::erase(const key_type &k) [inherited]

Type of values indexed by keys.

Erase value associated to the given key

Member Function Documentation

iterator concepts::Container_concept::begin ( ) [inherited]

Return an iterator that points at the first element.

size_type concepts::AssociativeContainer_concept::count ( const key_type & ) [inherited]

Return number of elements associated with the given key.

bool concepts::Container_concept::empty ( ) [inline, inherited]

Return true if the container is empty.

iterator concepts::Container_concept::end ( ) [inherited]

Return an iterator that points "after" the last element.

I.e. dereferencing this iterator does not need to work, but (equality) comparison to any iterator that has finished iterating over all elements of the container should yield true

iterator concepts::AssociativeContainer_concept::find ( const key_type & k ) [inherited]

Return an iterator to the element associated to the given key.

pair<iterator, bool> concepts::UniqueAssociativeContainer_concept::insert ( value_type & t )

Inserts t into a if and only if a does not already contain an element whose key is the same as the key of t.

The return value contains an iterator to the element (if the bool is true) or to an already contained element with the same key (if the bool is false) in which case the element was not inserted.

size_type concepts::Container_concept::max_size ( ) [inherited]

Return maximum number of elements in the container.

If the container is not limited in size, return 0.

value_type& concepts::AssociativeContainer_concept::operator[] ( const key_type & k ) [inherited]

Access the element identified by the given key.

size_type concepts::Container_concept::size ( ) [inherited]

Return number of elements in the container.