Embedded Template Library 1.0
|
Classes | |
class | etl::unordered_set_exception |
class | etl::unordered_set_full |
class | etl::unordered_set_out_of_range |
class | etl::unordered_set_iterator |
class | etl::iunordered_set< TKey, THash, TKeyEqual > |
Functions | |
template<typename TKey , typename THash , typename TKeyEqual > | |
bool | etl::operator== (const etl::iunordered_set< TKey, THash, TKeyEqual > &lhs, const etl::iunordered_set< TKey, THash, TKeyEqual > &rhs) |
template<typename TKey , typename THash , typename TKeyEqual > | |
bool | etl::operator!= (const etl::iunordered_set< TKey, THash, TKeyEqual > &lhs, const etl::iunordered_set< TKey, THash, TKeyEqual > &rhs) |
A unordered_set with the capacity defined at compile time.
class etl::unordered_set_exception |
Exception for the unordered_set.
Public Member Functions | |
unordered_set_exception (string_type reason_, string_type file_name_, numeric_type line_number_) | |
![]() | |
ETL_CONSTEXPR | exception (string_type reason_, string_type, numeric_type line_) |
Constructor. | |
ETL_CONSTEXPR string_type | what () const |
ETL_CONSTEXPR string_type | file_name () const |
ETL_CONSTEXPR numeric_type | line_number () const |
Additional Inherited Members | |
![]() | |
typedef const char * | string_type |
typedef int | numeric_type |
class etl::unordered_set_full |
Full exception for the unordered_set.
Public Member Functions | |
unordered_set_full (string_type file_name_, numeric_type line_number_) | |
![]() | |
unordered_set_exception (string_type reason_, string_type file_name_, numeric_type line_number_) | |
![]() | |
ETL_CONSTEXPR | exception (string_type reason_, string_type, numeric_type line_) |
Constructor. | |
ETL_CONSTEXPR string_type | what () const |
ETL_CONSTEXPR string_type | file_name () const |
ETL_CONSTEXPR numeric_type | line_number () const |
Additional Inherited Members | |
![]() | |
typedef const char * | string_type |
typedef int | numeric_type |
class etl::unordered_set_out_of_range |
Out of range exception for the unordered_set.
Public Member Functions | |
unordered_set_out_of_range (string_type file_name_, numeric_type line_number_) | |
![]() | |
unordered_set_exception (string_type reason_, string_type file_name_, numeric_type line_number_) | |
![]() | |
ETL_CONSTEXPR | exception (string_type reason_, string_type, numeric_type line_) |
Constructor. | |
ETL_CONSTEXPR string_type | what () const |
ETL_CONSTEXPR string_type | file_name () const |
ETL_CONSTEXPR numeric_type | line_number () const |
Additional Inherited Members | |
![]() | |
typedef const char * | string_type |
typedef int | numeric_type |
class etl::unordered_set_iterator |
Iterator exception for the unordered_set.
Public Member Functions | |
unordered_set_iterator (string_type file_name_, numeric_type line_number_) | |
![]() | |
unordered_set_exception (string_type reason_, string_type file_name_, numeric_type line_number_) | |
![]() | |
ETL_CONSTEXPR | exception (string_type reason_, string_type, numeric_type line_) |
Constructor. | |
ETL_CONSTEXPR string_type | what () const |
ETL_CONSTEXPR string_type | file_name () const |
ETL_CONSTEXPR numeric_type | line_number () const |
Additional Inherited Members | |
![]() | |
typedef const char * | string_type |
typedef int | numeric_type |
class etl::iunordered_set |
The base class for specifically sized unordered_set. Can be used as a reference type for all unordered_set containing a specific type.
|
inline |
Assigns values to the unordered_set. If asserts or exceptions are enabled, emits unordered_set_full if the unordered_set does not have enough free space. If asserts or exceptions are enabled, emits unordered_set_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 unordered_set.
|
inline |
Returns a const_iterator to the beginning of the unordered_set.
|
inline |
Returns an iterator to the beginning of the unordered_set bucket.
|
inline |
Returns a const_iterator to the beginning of the unordered_set bucket.
|
inline |
Returns the number of the buckets the container holds.
|
inline |
Returns the size of the bucket key.
|
inline |
Returns a const_iterator to the beginning of the unordered_set.
|
inline |
Returns a const_iterator to the beginning of the unordered_set bucket.
|
inline |
Returns a const_iterator to the end of the unordered_set.
|
inline |
Returns a const_iterator to the end of the unordered_set bucket.
|
inline |
Counts an element.
key | The key to search for. |
|
inline |
Returns an iterator to the end of the unordered_set.
|
inline |
Returns a const_iterator to the end of the unordered_set.
|
inline |
Returns an iterator to the end of the unordered_set bucket.
|
inline |
Returns a const_iterator to the end of the unordered_set bucket.
|
inline |
Returns a range containing all elements with key 'key' in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
key | The key to search for. |
|
inline |
Returns a range containing all elements with key 'key' in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
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 to by last.
first | Iterator to the first element. |
last | Iterator to the last element. |
|
inline |
Erases an element.
ielement | 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 |
Returns the bucket index for the key.
|
inline |
Returns the function that hashes the keys.
|
inline |
Inserts a value to the unordered_set. If asserts or exceptions are enabled, emits unordered_set_full if the unordered_set is already full.
position | The position to insert at. |
value | The value to insert. |
|
inline |
Inserts a value to the unordered_set. If asserts or exceptions are enabled, emits unordered_set_full if the unordered_set is already full.
value | The value to insert. |
|
inline |
Inserts a range of values to the unordered_set. If asserts or exceptions are enabled, emits unordered_set_full if the unordered_set 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 |
Returns the function that compares the keys.
|
inline |
Returns the load factor = size / bucket_count.
|
inline |
Returns the maximum number of the buckets the container can hold.
bool etl::operator!= | ( | const etl::iunordered_set< TKey, THash, TKeyEqual > & | lhs, |
const etl::iunordered_set< TKey, THash, TKeyEqual > & | rhs | ||
) |
Not equal operator.
lhs | Reference to the first unordered_set. |
rhs | Reference to the second unordered_set. |
bool etl::operator== | ( | const etl::iunordered_set< TKey, THash, TKeyEqual > & | lhs, |
const etl::iunordered_set< TKey, THash, TKeyEqual > & | rhs | ||
) |
Equal operator.
lhs | Reference to the first unordered_set. |
rhs | Reference to the second unordered_set. |