Embedded Template Library 1.0
|
#include <reference_flat_multiset.h>
Classes | |
class | const_iterator |
class | iterator |
Public Types | |
typedef T | key_type |
typedef T | value_type |
typedef TKeyCompare | key_compare |
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_OR_STD::reverse_iterator< iterator > | reverse_iterator |
typedef ETL_OR_STD::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef etl::iterator_traits< iterator >::difference_type | difference_type |
Protected Types | |
typedef etl::ivector< value_type * > | lookup_t |
typedef etl::parameter_type< T >::type | parameter_t |
Protected Member Functions | |
ireference_flat_multiset (lookup_t &lookup_) | |
Constructor. | |
ETL_OR_STD::pair< iterator, bool > | insert_at (iterator i_element, reference value) |
~ireference_flat_multiset () | |
Destructor. | |
The base class for specifically sized reference_flat_multisets. Can be used as a reference type for all reference_flat_multisets containing a specific type.
|
inline |
Assigns values to the reference_flat_multiset. If asserts or exceptions are enabled, emits reference_flat_multiset_full if the reference_flat_multiset does not have enough free space. If asserts or exceptions are enabled, emits reference_flat_multiset_iterator if the iterators are reversed.
first | The iterator to the first element. |
last | The iterator to the last element + 1. |
|
inline |
Returns the remaining capacity.
|
inline |
Returns an iterator to the beginning of the reference_flat_multiset.
|
inline |
Returns a const_iterator to the beginning of the reference_flat_multiset.
|
inline |
Returns the capacity of the reference_flat_multiset.
|
inline |
Returns a const_iterator to the beginning of the reference_flat_multiset.
|
inline |
Returns a const_iterator to the end of the reference_flat_multiset.
|
inline |
Counts an element.
key | The key to search for. |
|
inline |
Returns a const reverse iterator to the reverse beginning of the reference_flat_multiset.
|
inline |
Returns a const reverse iterator to the end + 1 of the reference_flat_multiset.
|
inline |
Checks the 'empty' state of the reference_flat_multiset.
|
inline |
Returns an iterator to the end of the reference_flat_multiset.
|
inline |
Returns a const_iterator to the end of the reference_flat_multiset.
|
inline |
Finds the range of equal elements of a key
key | The key to search for. |
|
inline |
Finds the range of equal elements of a key
key | The key to search for. |
|
inline |
Erases a range of elements. The range includes all the elements between first and last, including the element pointed by first, but not the one pointed by last.
first | Iterator to the first element. |
last | Iterator to the last element. |
|
inline |
Erases an element.
i_element | Iterator to the element. |
|
inline |
Erases an element.
i_element | Iterator to the element. |
|
inline |
Erases an element.
key | The key to erase. |
|
inline |
Finds an element.
key | The key to search for. |
|
inline |
Finds an element.
key | The key to search for. |
|
inline |
Checks the 'full' state of the reference_flat_multiset.
|
inline |
Inserts a value to the reference_flat_multiset. If asserts or exceptions are enabled, emits reference_flat_multiset_full if the reference_flat_multiset is already full.
position | The position to insert at. |
value | The value to insert. |
|
inline |
Inserts a range of values to the reference_flat_multiset. If asserts or exceptions are enabled, emits reference_flat_multiset_full if the reference_flat_multiset does not have enough free space.
position | The position to insert at. |
first | The first element to add. |
last | The last + 1 element to add. |
|
inline |
Inserts a value to the reference_flat_multiset. If asserts or exceptions are enabled, emits reference_flat_multiset_full if the reference_flat_multiset is already full.
value | The value to insert. |
|
inlineprotected |
Inserts a value to the reference_flat_set.
i_element | The place to insert. |
value | The value to insert. |
|
inline |
Finds the lower bound of a key
key | The key to search for. |
|
inline |
Finds the lower bound of a key
key | The key to search for. |
|
inline |
Returns the maximum possible size of the reference_flat_multiset.
|
inline |
Returns an reverse iterator to the reverse beginning of the reference_flat_multiset.
|
inline |
Returns a const reverse iterator to the reverse beginning of the reference_flat_multiset.
|
inline |
Returns a reverse iterator to the end + 1 of the reference_flat_multiset.
|
inline |
Returns a const reverse iterator to the end + 1 of the reference_flat_multiset.
|
inline |
Gets the current size of the reference_flat_multiset.
|
inline |
Finds the upper bound of a key
key | The key to search for. |
|
inline |
Finds the upper bound of a key
key | The key to search for. |