|
| unordered_multiset (const THash &hash=THash(), const TKeyEqual &equal=TKeyEqual()) |
| Default constructor.
|
|
| unordered_multiset (const unordered_multiset &other) |
| Copy constructor.
|
|
template<typename TIterator > |
| unordered_multiset (TIterator first_, TIterator last_, const THash &hash=THash(), const TKeyEqual &equal=TKeyEqual()) |
|
| ~unordered_multiset () |
| Destructor.
|
|
unordered_multiset & | operator= (const unordered_multiset &rhs) |
| Assignment operator.
|
|
iterator | begin () |
|
const_iterator | begin () const |
|
local_iterator | begin (size_t i) |
|
const_local_iterator | begin (size_t i) const |
|
const_iterator | cbegin () const |
|
const_local_iterator | cbegin (size_t i) const |
|
iterator | end () |
|
const_iterator | end () const |
|
local_iterator | end (size_t i) |
|
const_local_iterator | end (size_t i) const |
|
const_iterator | cend () const |
|
const_local_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_) |
|
ETL_OR_STD::pair< iterator, bool > | insert (const_reference key) |
|
iterator | insert (const_iterator, const_reference key) |
|
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_multiset.
|
|
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_multiset.
|
|
size_type | max_size () const |
| Gets the maximum possible size of the unordered_multiset.
|
|
size_type | capacity () const |
| Gets the maximum possible size of the unordered_multiset.
|
|
bool | empty () const |
| Checks to see if the unordered_multiset is empty.
|
|
bool | full () const |
| Checks to see if the unordered_multiset is full.
|
|
size_t | available () const |
|
float | load_factor () const |
|
hasher | hash_function () const |
|
key_equal | key_eq () const |
|
iunordered_multiset & | operator= (const iunordered_multiset &rhs) |
| Assignment operator.
|
|
template<typename TKey, const size_t MAX_SIZE_, size_t MAX_BUCKETS_ = MAX_SIZE_, typename THash = etl::hash<TKey>, typename TKeyEqual = etl::equal_to<TKey>>
class etl::unordered_multiset< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >
A templated unordered_multiset implementation that uses a fixed size buffer.
template<typename TKey , const size_t MAX_SIZE_, size_t MAX_BUCKETS_ = MAX_SIZE_, typename THash = etl::hash<TKey>, typename TKeyEqual = etl::equal_to<TKey>>
template<typename TIterator >
etl::unordered_multiset< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual >::unordered_multiset |
( |
TIterator |
first_, |
|
|
TIterator |
last_, |
|
|
const THash & |
hash = THash() , |
|
|
const TKeyEqual & |
equal = TKeyEqual() |
|
) |
| |
|
inline |
Constructor, from an iterator range.
- Template Parameters
-
TIterator | The iterator type. |
- Parameters
-
first | The iterator to the first element. |
last | The iterator to the last element + 1. |