Embedded Template Library 1.0
Loading...
Searching...
No Matches
etl::unordered_multiset< TKey, MAX_SIZE_, MAX_BUCKETS_, THash, TKeyEqual > Class Template Reference

A templated unordered_multiset implementation that uses a fixed size buffer. More...

#include <unordered_multiset.h>

Public Member Functions

 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_multisetoperator= (const unordered_multiset &rhs)
 Assignment operator.
Public Member Functions inherited from etl::iunordered_multiset< TKey, THash, TKeyEqual >
iterator begin ()
const_iterator begin () const
const_iterator cbegin () const
local_iterator begin (size_t i)
const_local_iterator begin (size_t i) const
const_local_iterator cbegin (size_t i) const
iterator end ()
const_iterator end () const
const_iterator cend () const
local_iterator end (size_t i)
const_local_iterator end (size_t i) 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
template<typename TIterator>
void assign (TIterator first_, TIterator last_)
ETL_OR_STD::pair< iterator, bool > insert (const_reference key)
iterator insert (const_iterator, const_reference key)
template<class TIterator>
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, iteratorequal_range (key_parameter_t key)
ETL_OR_STD::pair< const_iterator, const_iteratorequal_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_multisetoperator= (const iunordered_multiset &rhs)
 Assignment operator.
bool contains (key_parameter_t key) const
 Check if the unordered_multiset contains the key.

Static Public Attributes

static ETL_CONSTANT size_t MAX_SIZE = MAX_SIZE_
static ETL_CONSTANT size_t MAX_BUCKETS = MAX_BUCKETS_

Additional Inherited Members

Public Types inherited from etl::iunordered_multiset< TKey, THash, TKeyEqual >
typedef TKey value_type
typedef TKey key_type
typedef THash hasher
typedef TKeyEqual 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 const TKey & key_parameter_t
typedef etl::forward_link< 0 > link_t
typedef bucket_t::iterator local_iterator
typedef bucket_t::const_iterator const_local_iterator
typedef etl::iterator_traits< iterator >::difference_type difference_type
Protected Types inherited from etl::iunordered_multiset< TKey, THash, TKeyEqual >
typedef etl::intrusive_forward_list< node_t, link_t > bucket_t
typedef etl::ipool pool_t
Protected Member Functions inherited from etl::iunordered_multiset< TKey, THash, TKeyEqual >
 iunordered_multiset (pool_t &node_pool_, bucket_t *pbuckets_, size_t number_of_buckets_, hasher key_hash_function_, key_equal key_equal_function_)
 Constructor.
void initialise ()
 Initialise the unordered_multiset.
 ~iunordered_multiset ()
 Destructor.

Detailed Description

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.

Constructor & Destructor Documentation

◆ unordered_multiset()

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
TIteratorThe iterator type.
Parameters
firstThe iterator to the first element.
lastThe iterator to the last element + 1.

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