sequential_mapper.h
Go to the documentation of this file.
302 static std::pair<const_itr_t, const_itr_t> equal_range(const container_t& container, const key_t& key)
356 static std::pair<itr_t, bool> insert_key_value(container_t& container, const key_t& key, const value_t& value)
The array_range class provides a view into an underlying data structure with lower and upper limits.
Definition array_range.h:64
const_iterator end()
Returns an iterator to the element following the last element of the range.
const_iterator begin()
Returns an iterator to the first element of the range.
Definition access_levels.h:34
detail::enum_data< Enum_Type > value(string_view, Enum_Type value)
The value function should be used to add a mapping from enum name to value during the registration pr...
The sequential_container_mapper class is a class template to access an associative container via one ...
Definition sequential_mapper.h:189
typename T::key_type key_t
An alias to the key type.
Definition sequential_mapper.h:196
static std::pair< itr_t, bool > insert_key_value(container_t &container, const key_t &key, const value_t &value)
Inserts a key-value into the container.
Definition sequential_mapper.h:356
static itr_t end(container_t &container)
Returns an iterator to the element following the last element of the container.
Definition sequential_mapper.h:254
static std::pair< const_itr_t, const_itr_t > equal_range(const container_t &container, const key_t &key)
Returns a range containing all elements with the given key in the container.
Definition sequential_mapper.h:302
static itr_t begin(container_t &container)
Returns an iterator to the first element of the container.
Definition sequential_mapper.h:236
static void clear(container_t &container)
Removes all elements from the container.
Definition sequential_mapper.h:312
static std::pair< itr_t, bool > insert_key(container_t &container, const key_t &key)
Inserts a key into the container.
Definition sequential_mapper.h:346
static const key_t & get_key(const const_itr_t &itr)
Returns the current iterator's key as a const reference.
Definition sequential_mapper.h:208
static const_itr_t find(const container_t &container, const key_t &key)
Finds an element with key equivalent to key and returns its iterator.
Definition sequential_mapper.h:280
static std::pair< itr_t, itr_t > equal_range(container_t &container, const key_t &key)
Returns a range containing all elements with the given key in the container.
Definition sequential_mapper.h:292
static const value_t & get_value(const const_itr_t &itr)
Returns the current iterator's value as const reference.
Definition sequential_mapper.h:226
typename T::const_iterator const_itr_t
An alias delcaration to the const iterator.
Definition sequential_mapper.h:201
typename T::mapped_type value_t
Definition sequential_mapper.h:197
typename T::iterator itr_t
An alias delcaration to the iterator.
Definition sequential_mapper.h:200
static std::size_t get_size(const container_t &container)
Returns the number of elements in the container.
Definition sequential_mapper.h:328
static itr_t find(container_t &container, const key_t &key)
Finds an element with key equivalent to key and returns its iterator.
Definition sequential_mapper.h:272
static const_itr_t end(const container_t &container)
Returns an iterator to the element following the last element of the container.
Definition sequential_mapper.h:262
static bool is_empty(const container_t &container)
Returns the number of elements in the container.
Definition sequential_mapper.h:320
static value_t & get_value(itr_t &itr)
Returns the current iterator's value as reference.
Definition sequential_mapper.h:218
static const_itr_t begin(const container_t &container)
Returns an iterator to the first element of the container.
Definition sequential_mapper.h:244
static std::size_t erase(container_t &container, const key_t &key)
Removes the element (if one exists) with the key equivalent to key.
Definition sequential_mapper.h:336
Generated on Fri Jan 26 2024 00:00:00 for rttr - 0.9.7 by doxygen.