![]() |
Embedded Template Library
1.0
|
A templated unordered_multimap implementation that uses a fixed size buffer. More...
#include <unordered_multimap.h>
Public Member Functions | |
unordered_multimap () | |
Default constructor. | |
unordered_multimap (const unordered_multimap &other) | |
Copy constructor. | |
template<typename TIterator > | |
unordered_multimap (TIterator first_, TIterator last_) | |
~unordered_multimap () | |
Destructor. | |
unordered_multimap & | operator= (const unordered_multimap &rhs) |
Assignment operator. | |
![]() | |
iterator | begin () |
const_iterator | begin () const |
local_iterator | begin (size_t i) |
local_const_iterator | begin (size_t i) const |
const_iterator | cbegin () const |
local_const_iterator | cbegin (size_t i) const |
iterator | end () |
const_iterator | end () const |
local_iterator | end (size_t i) |
local_const_iterator | end (size_t i) const |
const_iterator | cend () const |
local_const_iterator | cend (size_t i) const |
size_type | get_bucket_index (key_parameter_t key) const |
size_type | bucket_size (key_parameter_t key) const |
size_type | max_bucket_count () const |
size_type | bucket_count () const |
void | assign (TIterator first_, TIterator last_) |
iterator | insert (const_reference key_value_pair) |
iterator | insert (const_iterator, const_reference key_value_pair) |
void | insert (TIterator first_, TIterator last_) |
size_t | erase (key_parameter_t key) |
iterator | erase (const_iterator ielement) |
iterator | erase (const_iterator first_, const_iterator last_) |
void | clear () |
Clears the unordered_multimap. | |
size_t | count (key_parameter_t key) const |
iterator | find (key_parameter_t key) |
const_iterator | find (key_parameter_t key) const |
ETL_OR_STD::pair< iterator, iterator > | equal_range (key_parameter_t key) |
ETL_OR_STD::pair< const_iterator, const_iterator > | equal_range (key_parameter_t key) const |
size_type | size () const |
Gets the size of the unordered_multimap. | |
size_type | max_size () const |
Gets the maximum possible size of the unordered_multimap. | |
size_type | capacity () const |
Gets the maximum possible size of the unordered_multimap. | |
bool | empty () const |
Checks to see if the unordered_multimap is empty. | |
bool | full () const |
Checks to see if the unordered_multimap is full. | |
size_t | available () const |
float | load_factor () const |
hasher | hash_function () const |
key_equal | key_eq () const |
iunordered_multimap & | operator= (const iunordered_multimap &rhs) |
Assignment operator. | |
Static Public Attributes | |
static const size_t | MAX_SIZE = MAX_SIZE_ |
static const size_t | MAX_BUCKETS = MAX_BUCKETS_ |
Additional Inherited Members | |
![]() | |
typedef ETL_OR_STD::pair< const TKey, TValue > | value_type |
typedef TKey | key_type |
typedef TValue | mapped_type |
typedef etl::hash< TKey > | hasher |
typedef etl::equal_to< TKey > | key_equal |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef value_type * | pointer |
typedef const value_type * | const_pointer |
typedef size_t | size_type |
typedef etl::parameter_type< TKey >::type | key_parameter_t |
typedef etl::forward_link< 0 > | link_t |
typedef bucket_t::iterator | local_iterator |
typedef bucket_t::const_iterator | local_const_iterator |
typedef etl::iterator_traits< iterator >::difference_type | difference_type |
![]() | |
iunordered_multimap (pool_t &node_pool_, bucket_t *pbuckets_, size_t number_of_buckets_) | |
Constructor. | |
void | initialise () |
Initialise the unordered_multimap. | |
~iunordered_multimap () | |
For library debugging purposes only. More... | |
A templated unordered_multimap implementation that uses a fixed size buffer.
|
inline |
Constructor, from an iterator range.
TIterator | The iterator type. |
first | The iterator to the first element. |
last | The iterator to the last element + 1. |