4a88884b39
* Add ranges * Initial Hugo setup * Work in progress * Added selection for local or remote site * Updated to 'light' theme * Changed to using Hextra Hugo theme * Changed to using Hextra Hugo theme * Changed to Hextra Hugo theme * Change to Hextra Hugo theme * Updated Hugo setup. * Updated Hugo setup. # Conflicts: # docs/releases/_index.md * Work in progress * Added new fonts Added new documentation * Latest documentation updates * Latest documentation updates # Conflicts: # docs/containers/array.md # docs/containers/array_view.md # docs/containers/array_wrapper.md # docs/containers/bip_buffer_spsc_atomic.md # docs/containers/bitset.md # docs/containers/indirect_vector.md # docs/containers/vector.md # docs/getting-started/compilers.md * Added bloom_filter markdown doc * Added more documentation Updated CSS for light and dark modes * Fixed some menus Added mode documentation files * Updated CSS rules Added badges to home page Added uniqur_ptr + pool tutorial * Fixed formatting on the home page markdown Modified light amd dark code formatting * Updated unique_ptr-with-pool * Added container and shared message tutorials * Updates to documentation * Added const_multimap * Updated source-formatting.md * Added initial raw text files form Web site editor * Innore coverage build directory * Exported raw text documentation files from the web site editor * Hugo updates * Added Hugo intalation and markdown descriptions * More addition to the documentation * Added closure.md and updates to delegate.md * Added format.md * Added documentation for etl::delegate_observable, etl::function, Base64 codec * Added io_port documentation * Added basic_format_spec * Added documentation for string_stream and string utilities. * Added more documentation Updated the documentation CSS * Added documentation for clocks, day, duration * Added more documentation for chrono classes Updated callouts * More chrono documentation * Completed chrono documentation * Maths functions documentation * Completed maths documentation * Completed maths documentation * Completed maths documentation * Completed maths documentation * Added multiple documentation files * Added iterator.md * Added debug_count.md and versions.md * Added debug_count.md and versions.md * Added more documentation * More documentation * Added some design pattern documentation Modified some of the layout files Modified the About documentation * Converted more documentation pages Modified the site CSS * Added more documentation Moced some documentation files to new directories * Added more documentation Tweaks to CSS * Added callback_timer_deferred_locked documentation * Added callback_timer_locked documentation * More documentation updates * More documentation updates * More documentation updates * New documentation files. Harmonised file name format * New documentation files. * Multiple document updates * Multiple document updates * Final conversion of web pages * Updates before PR * Updates before PR * Updates before PR # Conflicts: # docs/blog/_index.md * Final pre PR updates * Updates to message framework documentation * Renamed directory * Fix spelling * Added author and date to blog files Moved documentation files merged from development * Fixed 'Description' typo * Fix typos # Conflicts: # docs/IO/io_port.md # docs/containers/sets/const-multiset.md # docs/containers/sets/const-set.md # docs/maths/correlation.md # docs/maths/gamma.md * Renamed two files to lower case * Minor renaming * Added author and date * Updated callout on bresenham_line.md Added support for showing the ETL version on the documentation first page, by copying the version.txt file as a hugo asset. Updated the Python 'update_release.py' to copy 'version.txt' * Replace space in filename with hyphen. Added more information to hugo-commands.md * Replace space in filename with hyphen. Added more information to hugo-commands.md # Conflicts: # docs/getting-started/view-the-docs-locally/hugo-commands.md * Added a link to pseudo_moving_average.md * Updated title pages for groups * Fixed missing 404 for non-existent pages * Fixed coordinate variable names in the 'Calculating the intersection' example --------- Co-authored-by: Roland Reichwein <Roland.Reichwein@bmw.de> Co-authored-by: John Wellbelove <john.wellbelove@etlcpp.com> Co-authored-by: John Wellbelove <john.wellbelove@etlcpp.co.uk>
8.6 KiB
| title |
|---|
| reference_flat_multiset |
{{< callout type="info">}}
Header: reference_flat_multiset.h
Similar to: std::multiset
{{< /callout >}}
A fixed capacity set based on a sorted vector.
The container stores references to objects, rather than the objects themselves.
The container is an associative lookup table with O(N) insertion and erase, and O(log N) search.
This container is best used for tables that are occasionally updated and spend most of their time being searched.
The interface is most similar to std::set.
Uses etl::less as the default key comparison method.
etl::reference_flat_set<typename T, const size_t SIZE, TCompare = etl::less>
Inherits from etl::ireference_flat_set<T, TCompare>.
etl::ireference_flat_set may be used as a size independent pointer or reference type for any etl::reference_flat_set instance.
Template deduction guides
C++17 and above
template <typename... T> etl::reference_flat_set(T...)
Example
etl::reference_flat_setdata{ 0, 1, 2, 3, 4, 5, 6, 7 }; Defines data as a set of int/int pairs, of length 8, containing the supplied data.
Make template
C++11 and above template constexpr auto make_reference_flat_set(T&&... values)
Example
auto data = etl::make_reference_flat_set(0, 1, 2, 3, 4, 5, 6, 7);
Member types
key_type T
value_type T
size_type size_t
difference_type ptrdiff_t
reference value_type&
const_reference const value_type&
pointer value_type*
const_pointer const value_type*
iterator Random access iterator
const_iterator Constant random access iterator
reverse_iterator ETL_OR_STD:reverse_iterator<iterator>
const_reverse_iterator ETL_OR_STD::reverse_iterator<const_iterator>
Constructor
etl::flat_set<T, SIZE, TCompare>();
Description
etl::flat_set(const flat_set& other)
Description
template <typename TIterator>
etl::flat_set<T, SIZE, TCompare>(TIterator begin, TIterator end);
Description
If the set is full then raises an etl::reference_flat_set_full.
If asserts or exceptions are not enabled then undefined behaviour occurs.
Iterators
iterator begin()
const_iterator begin() const
const_iterator cbegin() const
Description
Returns an iterator to the beginning of the set.
iterator end()
const_iterator end() const
const_iterator cend() const
Description
Returns an iterator to the end of the set.
iterator rbegin()
const_iterator rbegin() const
const_iterator crbegin() const
Description
Returns a reverse iterator to the beginning of the set.
iterator rend()
const_iterator rend() const
const_iterator crend() const
Description
Returns a reverse iterator to the end of the set.
Capacity
bool empty() const
Description
Returns true if the size of the set is zero, otherwise false.
bool full() const
Description
Returns true if the size of the lookup is SIZE, otherwise false.
size_t size() const
Description
Returns the size of the lookup.
size_t max_size() const
Description
Returns the maximum possible size of the set.
size_t available() const
Description
Returns the remaining available capacity in the set.
Modifiers
flat_set& operator = (const flat_set& rhs)
Description
Copies the data from another flat set.
ETL_OR_STD::pair<iterator, bool> insert(const value_type& value)
iterator insert(iterator position, const value_type& value)
Description
template <typename TIterator>
void insert(TIterator first, TIterator last)
Description
Inserts values in to the set.
If the set is full then raises an etl::reference_flat_set_full.
If asserts or exceptions are not enabled then undefined behaviour occurs.
size_t erase(const value_type& key)
void erase(iterator i_element)
void erase(iterator first, iterator last)
Description
Erases values in the set.
Iterators are not checked for validity.
Since: 20.21.0
template <typename K>
size_t erase(K&& key)
Description
Erases values in the map.
void clear()
Description
Clears the lookup to a size of zero.
Search
find
iterator find(const value_type& key)
const_iterator find(const value_type& key) const
Description
Finds the element that contains key, or end() if not found,
template <typename K>
iterator find(const K& key)
const_iterator find(const K& key) const
Description
Finds the element that contains key, or end() if not found,
C++11 or above.
For comparators that define is_transparent.
Since: 20.21.0
lower_bound
iterator lower_bound(const value_type& key)
const_iterator lower_bound(const value_type& key) const
Description
Returns an iterator pointing to the first element in the container whose key is not considered to go before key (i.e., either it is equivalent or goes after).
Since: 20.21.0 C++11 or above
template <typename K>
iterator lower_bound(const K& key)
const_iterator lower_bound(const K& key) const
Description
Returns an iterator pointing to the first element in the container whose key is not considered to go before key (i.e., either it is equivalent or goes after).
C++11 or above.
For comparators that define is_transparent.
Since: 20.21.0
upper_bound
iterator upper_bound(const value_type& key)
const_iterator upper_bound(const value_type& key) const
Description
Returns an iterator pointing to the first element in the container whose key is considered to go after key.
template <typename K>
iterator upper_bound(const K& key)
const_iterator upper_bound(const K& key) const
Description
Returns an iterator pointing to the first element in the container whose key is considered to go after key.
C++11 or above.
For comparators that define is_transparent.
Since: 20.21.0
equal_range
ETL_OR_STD::pair<iterator, iterator> equal_range(const value_type& key)
ETL_OR_STD::pair<const_iterator, const_iterator> equal_range(const value_type& key) const
Description
Returns the bounds of a range that includes all the elements in the container which have a key equivalent to key.
template <typename K>
pair<iterator, iterator> equal_range(const K& key)
pair<const_iterator, const_iterator> equal_range(const K& key) const
Description
Returns the bounds of a range that includes all the elements in the container which have a key equivalent to key.
C++11 or above.
For comparators that define is_transparent.
Since: 20.21.0
contains
bool contains(const value_type& key) const
Description
Check if the container contains the key.
Since: 20.21.0 C++11 or above For comparators that define is_transparent.
template <typename K>
bool contains(const K& k) const
Description
Check if the container contains the key.
Since: 20.21.0 C++11 or above For comparators that define is_transparent.
Non-member functions
Lexicographically comparisons
operator ==
Description
true if the contents of the maps are equal, otherwise false.
operator !=
Description
true if the contents of the maps are not equal, otherwise false.
How it works
Reference flat sets are different from the normal version in that the elements are not copied, but linked directly.
This means that the lifetime of the element inserted must be as great as that of the set that contains it.
Unlike most other reference containers, the set has a finite capacity.
Flat sets are usually implemented internally as a sorted vector of values. Whilst this makes searching fast, it can have a detrimental effect when items are inserted into a container that stores complex, non-trivial values.
As Inserting requires that all of the items above the insert position must be shifted, this can become an expensive operation for larger containers.
To improve insertion performance ETL reference flat sets are implemented as vectors of pointers to values, sorted by value. An insertion will involve a copy of a range of pointers; an operation that can be made very fast.
The downside is that access to an item via an iterator will involve one indirection and the overhead of the container will be one pointer per item. A normal flat set implementation does not have this overhead.