Unique Sorted Associative Container concept. More...

#include <dox/tag/concept/stl/assoc_container.hpp>

Inheritance diagram for concept::stl::unique_sorted_associative_container:

Public Types
typedef strict_weak_ordering	key_compare
	The type of functor used to compare keys.
typedef strict_weak_ordering	value_compare
	The type of functor used to compare values.
typedef bidirectional_iterator	iterator
	The type used to iterate through the contents of the container.
typedef bidirectional_iterator	const_iterator
	The const type used to iterate through the contents of the container.
typedef arbitrary	key_type
	The type used to identify elements.
Iterator Types
typedef std::reverse_iterator < iterator >	reverse_iterator
	A reverse_iterator adaptor for an iterator.
typedef std::reverse_iterator < const_iterator >	const_reverse_iterator
	A reverse_iterator adaptor for a const_iterator.
Basic Types
typedef assignable	value_type
	The type of the object the container holds.
typedef value_type *	pointer
	The type that serves as a pointer to value_type.
typedef value_type &	reference
	The type that serves as a reference to value_type.
typedef value_type const *	const_pointer
	The type that serves as a const pointer to value_type.
typedef value_type const &	const_reference
	The type that serves as a pointer to value_type.
typedef size_t	size_type
	The unsigned type used to represent the size of the container.
typedef ptrdiff_t	difference_type
	The signed integral type used to represent the distance between iterators.
Public Member Functions
key_compare const &	key_comp () const
iterator	upper_bound (key_type const &key)
const_iterator	lower_bound (key_type const &key)
size_type	erase (key_type const &key)
	Erase an element.
void	erase (iterator itr)
	Erase an element.
void	erase (iterator f, iterator l)
	Erase a range of elements.
void	clear ()
	Erase all elements.
iterator	find (key_type const &key)
	Find an element.
const_iterator	find (key_type const &key) const
	Find an element.
size_type	count (key_type const &key) const
	Count the number of elements with a given key.
std::pair< iterator, iterator >	equal_range (key_type const &key)
	Find all elements matching a given key.
std::pair< const_iterator, const_iterator >	equal_range (key_type const &key) const
	Find all elements matching a given key.
std::pair< iterator, bool >	insert (const_reference obj)
	Insert an element into the container.
void	insert (input_iterator f, input_iterator l)
	Insert a range of elements [f,l) into the container.
size_type	count (key_type const &key) const
	Count the number of elements with a given key.
std::pair< iterator, iterator >	equal_range (key_type const &key)
	Find all elements matching a given key.
std::pair< const_iterator, const_iterator >	equal_range (key_type const &key) const
	Find all elements matching a given key.
Iterator Methods
reverse_iterator	rbegin ()
	Get an iterator to the reverse beginning.
const_reverse_iterator	rbegin () const
	Get an iterator to the reverse beginning.
reverse_iterator	rend ()
	Get an iterator to the reverse end.
const_reverse_iterator	rend () const
	Get an iterator to the reverse beginning.
Comparison Methods
bool	operator== (equality_comparable const &e)
	Equality operator.
Comparison Methods
bool	operator< (less_than_comparable const &l)
	Less-than operator.
Constructors/Destructors
void	swap (container &c)
	Swap method.
Iterator Methods
iterator	begin ()
	Get an iterator to the beginning.
const_iterator	begin () const
	Get an iterator to the beginning.
iterator	end ()
	Get an iterator to the end.
const_iterator	end () const
	Get an iterator to the end.
Size Methods
size_type	size () const
	Get the size of the container.
size_type	max_size () const
	Get the maximum size of the container.
bool	empty () const
	Check if the container is empty.
Related Functions
(Note that these are not member functions.)
void	swap (assignable &a1, assignable &a2)
	Global swap.

Detailed Description

Unique Sorted Associative Container concept.

Member Typedef Documentation

typedef bidirectional_iterator concept::stl::sorted_associative_container::const_iterator [inherited]

The const type used to iterate through the contents of the container.

Reimplemented from concept::stl::reversible_container.

typedef value_type const* concept::stl::container::const_pointer [inherited]

The type that serves as a const pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef value_type const& concept::stl::container::const_reference [inherited]

The type that serves as a pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef std::reverse_iterator<const_iterator> concept::stl::reversible_container::const_reverse_iterator [inherited]

A reverse_iterator adaptor for a const_iterator.

typedef ptrdiff_t concept::stl::container::difference_type [inherited]

The signed integral type used to represent the distance between iterators.

typedef bidirectional_iterator concept::stl::sorted_associative_container::iterator [inherited]

The type used to iterate through the contents of the container.

Reimplemented from concept::stl::reversible_container.

typedef strict_weak_ordering concept::stl::sorted_associative_container::key_compare [inherited]

The type of functor used to compare keys.

typedef arbitrary concept::stl::associative_container::key_type [inherited]

The type used to identify elements.

Reimplemented in concept::stl::simple_associative_container, and concept::ash::hash_matrix.

typedef value_type* concept::stl::container::pointer [inherited]

The type that serves as a pointer to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef value_type& concept::stl::container::reference [inherited]

The type that serves as a reference to value_type.

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

typedef std::reverse_iterator<iterator> concept::stl::reversible_container::reverse_iterator [inherited]

A reverse_iterator adaptor for an iterator.

typedef size_t concept::stl::container::size_type [inherited]

The unsigned type used to represent the size of the container.

Reimplemented in concept::ash::hash_matrix.

typedef strict_weak_ordering concept::stl::sorted_associative_container::value_compare [inherited]

The type of functor used to compare values.

typedef assignable concept::stl::container::value_type [inherited]

The type of the object the container holds.

Must be Assignable .

Reimplemented in concept::stl::pair_associative_container, and concept::ash::hash_matrix.

Member Function Documentation

iterator concept::stl::container::begin ( ) [inherited]

Get an iterator to the beginning.

Returns:: An iterator to the beginning of the container.

const_iterator concept::stl::container::begin ( ) const [inherited]

Get an iterator to the beginning.

Returns:: A const_iterator to the beginning of the container.

void concept::stl::associative_container::clear ( ) [inherited]

Erase all elements.

Reimplemented in concept::tr1::unordered_associative_container.

size_type concept::stl::associative_container::count ( key_type const & key ) const [inherited]

Count the number of elements with a given key.

Parameters:

key	The key to search for.

Returns:: The number of elements matching key.

Reimplemented in concept::stl::unique_associative_container.

size_type concept::stl::unique_associative_container::count ( key_type const & key ) const [inherited]

Count the number of elements with a given key.

Parameters:

key	The key to search for.

Returns:: The number of elements matching key. Because this is a Unique Associative Container , the return value will be 0 or 1.

Reimplemented from concept::stl::associative_container.

bool concept::stl::container::empty ( ) const [inherited]

Check if the container is empty.

Returns:: True if the container is empty.

iterator concept::stl::container::end ( ) [inherited]

Get an iterator to the end.

Returns:: An iterator to the end of the container.

const_iterator concept::stl::container::end ( ) const [inherited]

Get an iterator to the end.

Returns:: A const_iterator to the end of the container.

std::pair<iterator, iterator> concept::stl::associative_container::equal_range ( key_type const & key ) [inherited]

Find all elements matching a given key.

Parameters:

key	The key to search for.

Returns:: A pair of iterators for the range of elements [first,second).

Reimplemented in concept::stl::unique_associative_container, and concept::tr1::unordered_associative_container.

std::pair<const_iterator, const_iterator> concept::stl::associative_container::equal_range ( key_type const & key ) const [inherited]

Find all elements matching a given key.

Parameters:

key	The key to search for.

Returns:: A pair of const_iterators for the range of elements [first,second).

Reimplemented in concept::stl::unique_associative_container, and concept::tr1::unordered_associative_container.

std::pair<iterator, iterator> concept::stl::unique_associative_container::equal_range ( key_type const & key ) [inherited]

Find all elements matching a given key.

Parameters:

key	The key to search for.

Returns:: A pair of iterators for the range of elements [first,second). Because this is a Unique Associative Container , the first iterator points to the element, or to the end() if not found. The second iterator points to 1 past the first, or to the end().

Reimplemented from concept::stl::associative_container.

std::pair<const_iterator, const_iterator> concept::stl::unique_associative_container::equal_range ( key_type const & key ) const [inherited]

Find all elements matching a given key.

Parameters:

key	The key to search for.

Returns:: A pair of const_iterators for the range of elements [first,second). Because this is a Unique Associative Container , the first const_iterator points to the element, or to the end() if not found. The second const_iterator points to 1 past the first, or to the end().

Reimplemented from concept::stl::associative_container.

size_type concept::stl::associative_container::erase ( key_type const & key ) [inherited]

Erase an element.

Parameters:

key	The key of the element to erase.

Returns:: The number of erased elements.

Reimplemented in concept::tr1::unordered_associative_container.

void concept::stl::associative_container::erase ( iterator itr ) [inherited]

Erase an element.

Parameters:

itr	An iterator pointing to the element to erase.

Reimplemented in concept::tr1::unordered_associative_container, and concept::tr1::unordered_associative_container.

void concept::stl::associative_container::erase	(	iterator	f,
		iterator	l
	)		`[inherited]`

Erase a range of elements.

Parameters:

f	The beginning of the range to erase.
l	The end of the range to erase.

Reimplemented in concept::tr1::unordered_associative_container, and concept::tr1::unordered_associative_container.

iterator concept::stl::associative_container::find ( key_type const & key ) [inherited]

Find an element.

Parameters:

key	The key of the element to search for.

Returns:: An iterator to the element, or to the end() if not found.

Reimplemented in concept::tr1::unordered_associative_container.

const_iterator concept::stl::associative_container::find ( key_type const & key ) const [inherited]

Find an element.

Parameters:

key	The key of the element to search for.

Returns:: A const_iterator to the element, or to the end() if not found.

Reimplemented in concept::tr1::unordered_associative_container.

std::pair<iterator, bool> concept::stl::unique_associative_container::insert ( const_reference obj ) [inherited]

Insert an element into the container.

Parameters:

obj	The element to insert.

Returns:: An iterator and a bool. The iterator points to the inserted element, or to another with the same key if one is already in the container. The bool is true if the element was inserted, and false in the case of a duplicate key.

void concept::stl::unique_associative_container::insert	(	input_iterator	f,
		input_iterator	l
	)		`[inherited]`

Insert a range of elements [f,l) into the container.

Parameters:

f	The beginning of the range to insert.
l	The end of the range to insert.

Elements with duplicate keys will be ignored.

size_type concept::stl::container::max_size ( ) const [inherited]

Get the maximum size of the container.

Returns:: The maximum number of elements the container can hold.

bool concept::stl::less_than_comparable::operator< ( less_than_comparable const & l ) [inherited]

Less-than operator.

bool concept::stl::equality_comparable::operator== ( equality_comparable const & e ) [inherited]

Equality operator.

reverse_iterator concept::stl::reversible_container::rbegin ( ) [inherited]

Get an iterator to the reverse beginning.

Returns:: A reverse_iterator pointing to the beginning of the reversed container.

const_reverse_iterator concept::stl::reversible_container::rbegin ( ) const [inherited]

Get an iterator to the reverse beginning.

Returns:: A const_reverse_iterator pointing to the beginning of the reversed container.

reverse_iterator concept::stl::reversible_container::rend ( ) [inherited]

Get an iterator to the reverse end.

Returns:: A reverse_iterator pointing to the end of the reversed container.

const_reverse_iterator concept::stl::reversible_container::rend ( ) const [inherited]

Get an iterator to the reverse beginning.

Returns:: A const_reverse_iterator pointing to the beginning of the reversed container.

size_type concept::stl::container::size ( ) const [inherited]

Get the size of the container.

Returns:: The number of elements in the container.

void concept::stl::container::swap ( container & c ) [inherited]

Swap method.

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

dox/tag/concept/stl/assoc_container.hpp

Public Types

Public Member Functions

Related Functions

Detailed Description

Member Typedef Documentation

Member Function Documentation