![]() |
Arene Base
Fundamental Utilities For Safety Critical C++
|
A reference class to an inline_map object, with size-erased type. More...

Public Types | |
| using | compare_type = Compare |
| compare type of the map | |
| using | const_iterator = inline_map_reference_iterator<map_base_type, true> |
| const iterator type of the underlying map | |
| using | const_ops_type = inline_map_reference_detail::const_operations<map_base_type> |
| alias to const operations type | |
| using | const_reverse_iterator = ::arene::base::reverse_iterator<const_iterator> |
The type of an iterator that provides const access to the elements and iterates in reverse through the elements. | |
| using | iterator = inline_map_reference_iterator<map_base_type, false> |
| iterator type of a reference to the map | |
| using | key_type = Key |
| key type of the map | |
| using | map_base_type = inline_map_detail::inline_map_base<Key, Value, Compare> |
| alias to the map base class | |
| using | mapped_type = Value |
| mapped type of the map | |
| using | ops_type = inline_map_reference_detail::operations<map_base_type> |
| alias to non-const operations type | |
| using | reverse_iterator = ::arene::base::reverse_iterator<iterator> |
The type of an iterator that provides non- const access to the elements and iterates in reverse through the elements. | |
| using | size_type = typename map_base_type::size_type |
| size type of the map | |
| using | value_type = std::pair<Key const, Value> |
| value type of the map | |
Public Member Functions | |
| template<std::size_t Capacity, bool AreExceptionsEnabled = detail::are_exceptions_enabled::value, constraints< std::enable_if_t< AreExceptionsEnabled > > = nullptr> | |
| inline_map_reference (inline_map< Key, Value, Capacity, Compare > &map) noexcept | |
construct an inline_map_reference of a map | |
| template<std::size_t Capacity, bool AreExceptionsEnabled = detail::are_exceptions_enabled::value, constraints< std::enable_if_t<!AreExceptionsEnabled > > = nullptr> | |
| inline_map_reference (inline_map< Key, Value, Capacity, Compare > &map) noexcept | |
construct an inline_map_reference of a map | |
| template<std::size_t Capacity> | |
| inline_map_reference (inline_map< Key, Value, Capacity, Compare > const &&)=delete | |
construct an inline_map_reference of a map | |
| template<bool AreExceptionsEnabled = detail::are_exceptions_enabled::value, constraints< std::enable_if_t< AreExceptionsEnabled > > = nullptr> | |
| auto | at (key_type const &key) const noexcept(false) -> |
| obtain a reference to the mapped value for the specified key | |
| auto | begin () const noexcept -> |
| obtain an iterator referring to the beginning of the sorted range of elements | |
| auto | clear () const noexcept -> |
destroy all elements in the assocaited inline_map | |
| auto | const_ops_ptr () const noexcept -> const_ops_type const * |
| obtain a pointer to the const operations | |
| auto | end () const noexcept -> |
| obtain an iterator referring to one past the last element in the sorted range of elements | |
| auto | equal_range (key_type const &key) const noexcept(comparison_is_noexcept) -> |
| find the sequence of elements whose keys compare equivalent to a given key | |
| auto | erase (const_iterator first, const_iterator last) const noexcept -> |
| remove elements in the specified range | |
| auto | erase (const_iterator pos) const noexcept -> |
| remove the element at the specified position | |
| auto | erase (key_type const &key) const noexcept(comparison_is_noexcept) -> |
| remove element with the corresponding key, if there is one | |
| auto | find (key_type const &key) const noexcept(comparison_is_noexcept) -> |
| obtain an iterator to the first element with a given key | |
| auto | insert (value_type const &value) const noexcept(false) -> |
| insert an element in the map | |
| auto | insert_or_assign (key_type const &key, mapped_type const &mapped) const noexcept(false) -> |
| insert an element in the map or update an existing element | |
| auto | lower_bound (key_type const &key) const noexcept(comparison_is_noexcept) -> |
| find the first element which is not less than a given key | |
| auto | map_ptr () const noexcept -> map_base_type * |
| obtain a pointer to the map base | |
| auto | operator[] (key_type const &key) const noexcept(false) -> |
| obtain a reference to the mapped value for the specified key | |
| auto | ops_ptr () const noexcept -> ops_type const * |
| obtain a pointer to the non-const operations | |
| auto | upper_bound (key_type const &key) const noexcept(comparison_is_noexcept) -> |
| find the first element which is greater than a given key | |
A reference class to an inline_map object, with size-erased type.
| Key | The key type for the map |
| Value | The mapped type for the map |
| Compare | The comparison function |
Key | using arene::base::inline_map_reference< Key, Value, Compare >::compare_type = Compare |
compare type of the map
| using arene::base::inline_map_reference< Key, Value, Compare >::const_iterator = inline_map_reference_iterator<map_base_type, true> |
const iterator type of the underlying map
| using arene::base::inline_map_reference< Key, Value, Compare >::const_ops_type = inline_map_reference_detail::const_operations<map_base_type> |
alias to const operations type
| using arene::base::inline_map_reference< Key, Value, Compare >::const_reverse_iterator = ::arene::base::reverse_iterator<const_iterator> |
The type of an iterator that provides const access to the elements and iterates in reverse through the elements.
| using arene::base::inline_map_reference< Key, Value, Compare >::iterator = inline_map_reference_iterator<map_base_type, false> |
iterator type of a reference to the map
| using arene::base::inline_map_reference< Key, Value, Compare >::key_type = Key |
key type of the map
| using arene::base::inline_map_reference< Key, Value, Compare >::map_base_type = inline_map_detail::inline_map_base<Key, Value, Compare> |
alias to the map base class
| using arene::base::inline_map_reference< Key, Value, Compare >::mapped_type = Value |
mapped type of the map
| using arene::base::inline_map_reference< Key, Value, Compare >::ops_type = inline_map_reference_detail::operations<map_base_type> |
alias to non-const operations type
| using arene::base::inline_map_reference< Key, Value, Compare >::reverse_iterator = ::arene::base::reverse_iterator<iterator> |
The type of an iterator that provides non- const access to the elements and iterates in reverse through the elements.
| using arene::base::inline_map_reference< Key, Value, Compare >::size_type = typename map_base_type::size_type |
size type of the map
| using arene::base::inline_map_reference< Key, Value, Compare >::value_type = std::pair<Key const, Value> |
value type of the map
|
inlineexplicitnoexcept |
construct an inline_map_reference of a map
| Capacity | capacity of the inline_map |
| map | inline_map to reference |
|
inlineexplicitnoexcept |
construct an inline_map_reference of a map
| Capacity | capacity of the inline_map |
| map | inline_map to reference |
|
explicitdelete |
construct an inline_map_reference of a map
| Capacity | capacity of the inline_map |
Deleted overload for rvalue references.
|
inline |
obtain a reference to the mapped value for the specified key
| key | the key to search for |
| std::out_of_range | if contains(key) is false |
| any | exception thrown by the comparisons |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
obtain a pointer to the const operations
|
inlinenoexcept |
obtain an iterator referring to one past the last element in the sorted range of elements
|
inlinenoexcept |
find the sequence of elements whose keys compare equivalent to a given key
| key | the key to search for |
[first, second) have keys which compare equal to key if there was a key equivalent to key in the map. Otherwise both iterators will be end().
|
inlinenoexcept |
remove elements in the specified range
| first | beginning of the range of elements to remove |
| last | end of the range of elements to remove |
[first, last) is a valid range in map
|
inlinenoexcept |
remove the element at the specified position
| pos | iterator referring to the element to remove |
pos must be a dereferencable iterator referring to an element in map
|
inlinenoexcept |
remove element with the corresponding key, if there is one
| key | The key to erase |
end if there is no element was removed
|
inlinenoexcept |
obtain an iterator to the first element with a given key
| key | the key to search for |
key, or end() if the element is not found
|
inline |
insert an element in the map
| value | the value to insert |
Copy constructs the provided value into the new element if an appropriate element does not already exist.
value.first, and whose second element is a boolean with a value of true if the element was inserted or false if not.contains(value.first) is true, or size() < Capacity of the inline_map | any | exception thrown by the comparisons, or the copy constructor of value_type |
|
inline |
insert an element in the map or update an existing element
| key | the key for which to insert or assign an element |
| mapped | the value to associate with key |
If key is contained in the inline_map, updates the associated value by copy-assigning mapped. If key is not contained in the inline_map, constructs a new element in the inline_map by copying key and mapped.
true if the element was inserted and false if not.contains(key) is true, or size() < Capacity of the inline_map | any | exception thrown by the comparisons, the move constructor of key_type or the constructor or assignment operator of value_type |
|
inlinenoexcept |
find the first element which is not less than a given key
| key | the key to search for |
key, or end() if there is no such element
|
inlinenoexcept |
obtain a pointer to the map base
|
inline |
obtain a reference to the mapped value for the specified key
| key | the key to search for |
key did not exist in the map, then a default constructed mapped_type is inserted into the map at key and a reference to it is returned.| anny | exception thrown by the comparisons, and exception throw by the copy-constructor of key_type, or the default-constructor of mapped_type |
size() < Capacity if contains(key) is false
|
inlinenoexcept |
obtain a pointer to the non-const operations
|
inlinenoexcept |
find the first element which is greater than a given key
| key | the key to search for |
key, or end() if there is no such element