Simple Associative Container concept. More...
#include <dox/tag/concept/stl/assoc_container.hpp>
Public Types | |
typedef value_type | key_type |
The type used to identify elements. | |
typedef const_iterator | iterator |
The type used to iterate through the contents of the container. | |
Iterator Types | |
typedef forward_iterator | const_iterator |
The const type used to iterate through the contents of the container. | |
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 | |
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. | |
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. |
typedef forward_iterator concept::stl::forward_container::const_iterator [inherited] |
The const type used to iterate through the contents of the container.
Reimplemented from concept::stl::container.
Reimplemented in concept::stl::list, concept::stl::reversible_container, concept::stl::sorted_associative_container, and concept::ash::hash_list.
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 ptrdiff_t concept::stl::container::difference_type [inherited] |
The signed integral type used to represent the distance between iterators.
The type used to iterate through the contents of the container.
Reimplemented from concept::stl::forward_container.
The type used to identify elements.
Reimplemented from concept::stl::associative_container.
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 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 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.
iterator concept::stl::container::begin | ( | ) | [inherited] |
Get an iterator to the beginning.
const_iterator concept::stl::container::begin | ( | ) | const [inherited] |
Get an iterator to the beginning.
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.
key | The key to search for. |
key
. Reimplemented in concept::stl::unique_associative_container.
bool concept::stl::container::empty | ( | ) | const [inherited] |
Check if the container is empty.
iterator concept::stl::container::end | ( | ) | [inherited] |
Get an iterator to the end.
const_iterator concept::stl::container::end | ( | ) | const [inherited] |
Get an iterator to the end.
std::pair<iterator, iterator> concept::stl::associative_container::equal_range | ( | key_type const & | key | ) | [inherited] |
Find all elements matching a given key.
key | The key to search for. |
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.
key | The key to search for. |
Reimplemented in concept::stl::unique_associative_container, and concept::tr1::unordered_associative_container.
size_type concept::stl::associative_container::erase | ( | key_type const & | key | ) | [inherited] |
Erase an element.
key | The key of the element to erase. |
Reimplemented in concept::tr1::unordered_associative_container.
void concept::stl::associative_container::erase | ( | iterator | itr | ) | [inherited] |
Erase an element.
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.
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.
key | The key of the element to search for. |
Reimplemented in concept::tr1::unordered_associative_container.
const_iterator concept::stl::associative_container::find | ( | key_type const & | key | ) | const [inherited] |
Find an element.
key | The key of the element to search for. |
Reimplemented in concept::tr1::unordered_associative_container.
size_type concept::stl::container::max_size | ( | ) | const [inherited] |
Get the maximum size of the container.
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.
size_type concept::stl::container::size | ( | ) | const [inherited] |
Get the size of the container.
void concept::stl::container::swap | ( | container & | c | ) | [inherited] |
Swap method.
© 2012 | Licensed under | Hosted by | Generated by 1.7.4 |