Loading...
Searching...
No Matches
flat_set.h
Go to the documentation of this file.
/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
Copyright(c) 2015 John Wellbelove
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
#ifndef ETL_FLAT_SET_INCLUDED
#define ETL_FLAT_SET_INCLUDED
#include "platform.h"
#include "initializer_list.h"
#include "nth_type.h"
#include "placement_new.h"
#include "pool.h"
#include "reference_flat_set.h"
#include "type_traits.h"
#include "private/comparator_is_transparent.h"
//*****************************************************************************
//*****************************************************************************
namespace etl
{
//***************************************************************************
//***************************************************************************
template <typename T, typename TKeyCompare = etl::less<T> >
class iflat_set : private etl::ireference_flat_set<T, TKeyCompare>
{
private:
typedef etl::ireference_flat_set<T, TKeyCompare> refset_t;
typedef typename refset_t::lookup_t lookup_t;
typedef etl::ipool storage_t;
typedef const T& key_parameter_t;
public:
typedef T key_type;
typedef T value_type;
typedef TKeyCompare key_compare;
typedef value_type& reference;
typedef const value_type& const_reference;
#if ETL_USING_CPP11
typedef value_type&& rvalue_reference;
#endif
typedef value_type* pointer;
typedef const value_type* const_pointer;
typedef size_t size_type;
typedef typename refset_t::iterator iterator;
typedef typename refset_t::const_iterator const_iterator;
typedef ETL_OR_STD::reverse_iterator<iterator> reverse_iterator;
typedef ETL_OR_STD::reverse_iterator<const_iterator> const_reverse_iterator;
typedef typename etl::iterator_traits<iterator>::difference_type difference_type;
public:
//*********************************************************************
//*********************************************************************
iterator begin()
{
return refset_t::begin();
}
//*********************************************************************
//*********************************************************************
const_iterator begin() const
{
return refset_t::begin();
}
//*********************************************************************
//*********************************************************************
iterator end()
{
return refset_t::end();
}
//*********************************************************************
//*********************************************************************
const_iterator end() const
{
return refset_t::end();
}
//*********************************************************************
//*********************************************************************
const_iterator cbegin() const
{
return refset_t::cbegin();
}
//*********************************************************************
//*********************************************************************
const_iterator cend() const
{
return refset_t::cend();
}
//*********************************************************************
//*********************************************************************
reverse_iterator rbegin()
{
return refset_t::rbegin();
}
//*********************************************************************
//*********************************************************************
const_reverse_iterator rbegin() const
{
return refset_t::rbegin();
}
//*********************************************************************
//*********************************************************************
reverse_iterator rend()
{
return refset_t::rend();
}
//*********************************************************************
//*********************************************************************
const_reverse_iterator rend() const
{
return refset_t::rend();
}
//*********************************************************************
//*********************************************************************
const_reverse_iterator crbegin() const
{
return refset_t::crbegin();
}
//*********************************************************************
//*********************************************************************
const_reverse_iterator crend() const
{
return refset_t::crend();
}
//*********************************************************************
//*********************************************************************
template <typename TIterator>
void assign(TIterator first, TIterator last)
{
#if ETL_IS_DEBUG_BUILD
difference_type d = etl::distance(first, last);
ETL_ASSERT(d <= difference_type(capacity()), ETL_ERROR(flat_set_full));
#endif
clear();
while (first != last)
{
insert(*first);
++first;
}
}
//*********************************************************************
//*********************************************************************
ETL_OR_STD::pair<iterator, bool> insert(const_reference value)
{
iterator i_element = lower_bound(value);
ETL_OR_STD::pair<iterator, bool> result(i_element, false);
// Doesn't already exist?
if ((i_element == end()) || compare(value, *i_element))
{
ETL_ASSERT(!refset_t::full(), ETL_ERROR(flat_set_full));
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(value);
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
return result;
}
#if ETL_USING_CPP11
//*********************************************************************
//*********************************************************************
ETL_OR_STD::pair<iterator, bool> insert(rvalue_reference value)
{
iterator i_element = lower_bound(value);
ETL_OR_STD::pair<iterator, bool> result(i_element, false);
// Doesn't already exist?
if ((i_element == end()) || compare(value, *i_element))
{
ETL_ASSERT(!refset_t::full(), ETL_ERROR(flat_set_full));
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(etl::move(value));
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
return result;
}
#endif
//*********************************************************************
//*********************************************************************
iterator insert(const_iterator /*position*/, const_reference value)
{
return insert(value).first;
}
#if ETL_USING_CPP11
//*********************************************************************
//*********************************************************************
iterator insert(const_iterator /*position*/, rvalue_reference value)
{
return insert(etl::move(value)).first;
}
#endif
//*********************************************************************
//*********************************************************************
template <class TIterator>
void insert(TIterator first, TIterator last)
{
while (first != last)
{
insert(*first);
++first;
}
}
//*************************************************************************
//*************************************************************************
ETL_OR_STD::pair<iterator, bool> emplace(const_reference value)
{
return insert(value);
}
//*************************************************************************
//*************************************************************************
#if ETL_USING_CPP11 && ETL_NOT_USING_STLPORT && !defined(ETL_FLAT_SET_FORCE_CPP03_IMPLEMENTATION)
template <typename... Args>
ETL_OR_STD::pair<iterator, bool> emplace(Args&&... args)
{
if (full())
{
// A duplicate key does not require a free slot, so emplacing it is not
// a capacity failure. Construct a temporary to obtain its key and only
// emit flat_set_full if the key is not already present. This keeps
// emplace consistent with insert when the set is full.
value_type temp_value(etl::forward<Args>(args)...);
iterator position = find(temp_value);
if (position == end())
{
ETL_ASSERT_FAIL(ETL_ERROR(flat_set_full));
return ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return ETL_OR_STD::pair<iterator, bool>(position, false);
}
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(etl::forward<Args>(args)...);
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(i_element, false);
}
return result;
}
#else
//*************************************************************************
//*************************************************************************
ETL_OR_STD::pair<iterator, bool> emplace()
{
ETL_ASSERT(!full(), ETL_ERROR(flat_set_full));
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type();
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1>
ETL_OR_STD::pair<iterator, bool> emplace(const T1& value1)
{
ETL_ASSERT(!full(), ETL_ERROR(flat_set_full));
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(value1);
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2>
ETL_OR_STD::pair<iterator, bool> emplace(const T1& value1, const T2& value2)
{
ETL_ASSERT(!full(), ETL_ERROR(flat_set_full));
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(value1, value2);
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2, typename T3>
ETL_OR_STD::pair<iterator, bool> emplace(const T1& value1, const T2& value2, const T3& value3)
{
ETL_ASSERT(!full(), ETL_ERROR(flat_set_full));
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(value1, value2, value3);
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return result;
}
//*************************************************************************
//*************************************************************************
template <typename T1, typename T2, typename T3, typename T4>
ETL_OR_STD::pair<iterator, bool> emplace(const T1& value1, const T2& value2, const T3& value3, const T4& value4)
{
ETL_ASSERT(!full(), ETL_ERROR(flat_set_full));
ETL_OR_STD::pair<iterator, bool> result;
// Create it.
value_type* pvalue = storage.allocate<value_type>();
::new (pvalue) value_type(value1, value2, value3, value4);
iterator i_element = lower_bound(*pvalue);
// Doesn't already exist?
if ((i_element == end()) || compare(*pvalue, *i_element))
{
ETL_INCREMENT_DEBUG_COUNT;
result = refset_t::insert_at(i_element, *pvalue);
}
else
{
// Destroy it.
pvalue->~value_type();
storage.release(pvalue);
result = ETL_OR_STD::pair<iterator, bool>(end(), false);
}
return result;
}
#endif
//*********************************************************************
//*********************************************************************
size_t erase(key_parameter_t key)
{
iterator i_element = find(key);
if (i_element == end())
{
return 0;
}
else
{
etl::destroy_at(etl::addressof(*i_element));
storage.release(etl::addressof(*i_element));
refset_t::erase(i_element);
ETL_DECREMENT_DEBUG_COUNT;
return 1;
}
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
size_t erase(K&& key)
{
iterator i_element = find(etl::forward<K>(key));
if (i_element == end())
{
return 0;
}
else
{
etl::destroy_at(etl::addressof(*i_element));
storage.release(etl::addressof(*i_element));
refset_t::erase(i_element);
ETL_DECREMENT_DEBUG_COUNT;
return 1;
}
}
#endif
//*********************************************************************
//*********************************************************************
iterator erase(iterator i_element)
{
etl::destroy_at(etl::addressof(*i_element));
storage.release(etl::addressof(*i_element));
ETL_DECREMENT_DEBUG_COUNT;
return refset_t::erase(i_element);
}
//*********************************************************************
//*********************************************************************
iterator erase(const_iterator i_element)
{
etl::destroy_at(etl::addressof(*i_element));
storage.release(etl::addressof(*i_element));
ETL_DECREMENT_DEBUG_COUNT;
return refset_t::erase(i_element);
}
//*********************************************************************
//*********************************************************************
iterator erase(const_iterator first, const_iterator last)
{
const_iterator itr = first;
while (itr != last)
{
etl::destroy_at(etl::addressof(*itr));
storage.release(etl::addressof(*itr));
++itr;
ETL_DECREMENT_DEBUG_COUNT;
}
return refset_t::erase(first, last);
}
//*************************************************************************
//*************************************************************************
void clear()
{
if ETL_IF_CONSTEXPR (etl::is_trivially_destructible<value_type>::value)
{
storage.release_all();
}
else
{
iterator itr = begin();
while (itr != end())
{
etl::destroy_at(etl::addressof(*itr));
storage.release(etl::addressof(*itr));
++itr;
ETL_DECREMENT_DEBUG_COUNT;
}
}
ETL_RESET_DEBUG_COUNT;
refset_t::clear();
}
//*********************************************************************
//*********************************************************************
iterator find(key_parameter_t key)
{
return refset_t::find(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
iterator find(const K& key)
{
return refset_t::find(key);
}
#endif
//*********************************************************************
//*********************************************************************
const_iterator find(key_parameter_t key) const
{
return refset_t::find(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
const_iterator find(const K& key) const
{
return refset_t::find(key);
}
#endif
//*********************************************************************
//*********************************************************************
size_t count(key_parameter_t key) const
{
return refset_t::count(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
size_t count(const K& key) const
{
return refset_t::count(key);
}
#endif
//*********************************************************************
//*********************************************************************
iterator lower_bound(key_parameter_t key)
{
return refset_t::lower_bound(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
iterator lower_bound(const K& key)
{
return refset_t::lower_bound(key);
}
#endif
//*********************************************************************
//*********************************************************************
const_iterator lower_bound(key_parameter_t key) const
{
return refset_t::lower_bound(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
const_iterator lower_bound(const K& key) const
{
return refset_t::lower_bound(key);
}
#endif
//*********************************************************************
//*********************************************************************
iterator upper_bound(key_parameter_t key)
{
return refset_t::upper_bound(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
iterator upper_bound(const K& key)
{
return refset_t::upper_bound(key);
}
#endif
//*********************************************************************
//*********************************************************************
const_iterator upper_bound(key_parameter_t key) const
{
return refset_t::upper_bound(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
const_iterator upper_bound(const K& key) const
{
return refset_t::upper_bound(key);
}
#endif
//*********************************************************************
//*********************************************************************
ETL_OR_STD::pair<iterator, iterator> equal_range(key_parameter_t key)
{
return refset_t::equal_range(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
ETL_OR_STD::pair<iterator, iterator> equal_range(const K& key)
{
return refset_t::equal_range(key);
}
#endif
//*********************************************************************
//*********************************************************************
ETL_OR_STD::pair<const_iterator, const_iterator> equal_range(key_parameter_t key) const
{
return refset_t::upper_bound(key);
}
#if ETL_USING_CPP11
//*********************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
ETL_OR_STD::pair<const_iterator, const_iterator> equal_range(const K& key) const
{
return refset_t::upper_bound(key);
}
#endif
//*************************************************************************
//*************************************************************************
bool contains(key_parameter_t key) const
{
return find(key) != end();
}
#if ETL_USING_CPP11
//*************************************************************************
template <typename K, typename KC = TKeyCompare, etl::enable_if_t<comparator_is_transparent<KC>::value, int> = 0>
bool contains(const K& k) const
{
return find(k) != end();
}
#endif
//*************************************************************************
//*************************************************************************
iflat_set& operator=(const iflat_set& rhs)
{
if (&rhs != this)
{
assign(rhs.cbegin(), rhs.cend());
}
return *this;
}
#if ETL_USING_CPP11
//*************************************************************************
//*************************************************************************
iflat_set& operator=(iflat_set&& rhs)
{
move_container(etl::move(rhs));
return *this;
}
#endif
//*************************************************************************
//*************************************************************************
size_type size() const
{
return refset_t::size();
}
//*************************************************************************
//*************************************************************************
bool empty() const
{
return refset_t::empty();
}
//*************************************************************************
//*************************************************************************
bool full() const
{
return refset_t::full();
}
//*************************************************************************
//*************************************************************************
size_type capacity() const
{
return refset_t::capacity();
}
//*************************************************************************
//*************************************************************************
size_type max_size() const
{
return refset_t::max_size();
}
//*************************************************************************
//*************************************************************************
size_t available() const
{
return refset_t::available();
}
protected:
//*********************************************************************
//*********************************************************************
iflat_set(lookup_t& lookup_, storage_t& storage_)
: refset_t(lookup_)
, storage(storage_)
{
}
#if ETL_USING_CPP11
//*************************************************************************
//*************************************************************************
void move_container(iflat_set&& rhs)
{
if (&rhs != this)
{
this->clear();
etl::iflat_set<T, TKeyCompare>::iterator first = rhs.begin();
etl::iflat_set<T, TKeyCompare>::iterator last = rhs.end();
// Move all of the elements.
while (first != last)
{
typename etl::iflat_set<T, TKeyCompare>::iterator temp = first;
++temp;
this->insert(etl::move(*first));
first = temp;
}
}
}
#endif
private:
// Disable copy construction.
iflat_set(const iflat_set&);
storage_t& storage;
TKeyCompare compare;
ETL_DECLARE_DEBUG_COUNT;
//*************************************************************************
//*************************************************************************
#if defined(ETL_POLYMORPHIC_FLAT_SET) || defined(ETL_POLYMORPHIC_CONTAINERS)
public:
virtual ~iflat_set() {}
#else
protected:
~iflat_set() {}
#endif
};
//***************************************************************************
//***************************************************************************
template <typename T, typename TKeyCompare>
bool operator==(const etl::iflat_set<T, TKeyCompare>& lhs, const etl::iflat_set<T, TKeyCompare>& rhs)
{
return (lhs.size() == rhs.size()) && etl::equal(lhs.begin(), lhs.end(), rhs.begin());
}
//***************************************************************************
//***************************************************************************
template <typename T, typename TKeyCompare>
bool operator!=(const etl::iflat_set<T, TKeyCompare>& lhs, const etl::iflat_set<T, TKeyCompare>& rhs)
{
return !(lhs == rhs);
}
//***************************************************************************
//***************************************************************************
template <typename T, const size_t MAX_SIZE_, typename TCompare = etl::less<T> >
class flat_set : public etl::iflat_set<T, TCompare>
{
public:
static ETL_CONSTANT size_t MAX_SIZE = MAX_SIZE_;
//*************************************************************************
//*************************************************************************
flat_set()
: etl::iflat_set<T, TCompare>(lookup, storage)
{
}
//*************************************************************************
//*************************************************************************
flat_set(const flat_set& other)
: etl::iflat_set<T, TCompare>(lookup, storage)
{
this->assign(other.cbegin(), other.cend());
}
#if ETL_USING_CPP11
//*************************************************************************
//*************************************************************************
flat_set(flat_set&& other)
: etl::iflat_set<T, TCompare>(lookup, storage)
{
if (&other != this)
{
this->move_container(etl::move(other));
}
}
#endif
//*************************************************************************
//*************************************************************************
template <typename TIterator>
flat_set(TIterator first, TIterator last)
: etl::iflat_set<T, TCompare>(lookup, storage)
{
this->assign(first, last);
}
#if ETL_HAS_INITIALIZER_LIST
//*************************************************************************
//*************************************************************************
flat_set(std::initializer_list<T> init)
: etl::iflat_set<T, TCompare>(lookup, storage)
{
this->assign(init.begin(), init.end());
}
#endif
//*************************************************************************
//*************************************************************************
~flat_set()
{
this->clear();
}
//*************************************************************************
//*************************************************************************
flat_set& operator=(const flat_set& rhs)
{
if (&rhs != this)
{
this->assign(rhs.cbegin(), rhs.cend());
}
return *this;
}
#if ETL_USING_CPP11
//*************************************************************************
//*************************************************************************
flat_set& operator=(flat_set&& rhs)
{
if (&rhs != this)
{
this->move_container(etl::move(rhs));
}
return *this;
}
#endif
private:
typedef typename etl::iflat_set<T, TCompare>::value_type node_t;
// The pool of nodes.
etl::pool<node_t, MAX_SIZE> storage;
// The vector that stores pointers to the nodes.
etl::vector<node_t*, MAX_SIZE> lookup;
};
template <typename T, const size_t MAX_SIZE_, typename TCompare>
ETL_CONSTANT size_t flat_set<T, MAX_SIZE_, TCompare>::MAX_SIZE;
//*************************************************************************
//*************************************************************************
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
template <typename... T>
flat_set(T...) -> flat_set<etl::nth_type_t<0, T...>, sizeof...(T)>;
#endif
//*************************************************************************
//*************************************************************************
#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
template <typename TKey, typename TKeyCompare = etl::less<TKey>, typename... T>
constexpr auto make_flat_set(T&&... keys) -> etl::flat_set<TKey, sizeof...(T), TKeyCompare>
{
return {etl::forward<T>(keys)...};
}
#endif
} // namespace etl
#endif
etl::flat_set_full
Definition reference_flat_set.h:71
etl::ireference_flat_set
Definition reference_flat_set.h:102
etl::ireference_flat_set< T, TKeyCompare >::capacity
size_type capacity() const
Definition reference_flat_set.h:852
etl::ireference_flat_set< T, TKeyCompare >::insert_at
ETL_OR_STD::pair< iterator, bool > insert_at(iterator i_element, reference value)
Definition reference_flat_set.h:890
etl::ireference_flat_set< T, TKeyCompare >::available
size_t available() const
Definition reference_flat_set.h:870
etl::ireference_flat_set< T, TKeyCompare >::upper_bound
iterator upper_bound(parameter_t key)
Definition reference_flat_set.h:733
etl::ireference_flat_set< T, TKeyCompare >::crbegin
const_reverse_iterator crbegin() const
Definition reference_flat_set.h:404
etl::ireference_flat_set< T, TKeyCompare >::begin
iterator begin()
Definition reference_flat_set.h:308
etl::ireference_flat_set< T, TKeyCompare >::erase
size_t erase(parameter_t key)
Definition reference_flat_set.h:505
etl::ireference_flat_set< T, TKeyCompare >::end
iterator end()
Definition reference_flat_set.h:326
etl::ireference_flat_set< T, TKeyCompare >::equal_range
ETL_OR_STD::pair< iterator, iterator > equal_range(parameter_t key)
Definition reference_flat_set.h:771
etl::ireference_flat_set< T, TKeyCompare >::cend
const_iterator cend() const
Definition reference_flat_set.h:353
etl::ireference_flat_set< T, TKeyCompare >::cbegin
const_iterator cbegin() const
Definition reference_flat_set.h:344
etl::ireference_flat_set< T, TKeyCompare >::find
iterator find(parameter_t key)
Definition reference_flat_set.h:582
etl::ireference_flat_set< T, TKeyCompare >::max_size
size_type max_size() const
Definition reference_flat_set.h:861
etl::ireference_flat_set< T, TKeyCompare >::crend
const_reverse_iterator crend() const
Definition reference_flat_set.h:414
etl::ireference_flat_set< T, TKeyCompare >::empty
bool empty() const
Definition reference_flat_set.h:834
etl::ireference_flat_set< T, TKeyCompare >::size
size_type size() const
Definition reference_flat_set.h:825
etl::ireference_flat_set< T, TKeyCompare >::rbegin
reverse_iterator rbegin()
Definition reference_flat_set.h:363
etl::ireference_flat_set< T, TKeyCompare >::count
size_t count(parameter_t key) const
Definition reference_flat_set.h:676
etl::ireference_flat_set::full
bool full() const
Definition reference_flat_set.h:843
etl::ireference_flat_set< T, TKeyCompare >::clear
void clear()
Definition reference_flat_set.h:572
etl::ireference_flat_set< T, TKeyCompare >::lower_bound
iterator lower_bound(parameter_t key)
Definition reference_flat_set.h:695
etl::ireference_flat_set< T, TKeyCompare >::rend
reverse_iterator rend()
Definition reference_flat_set.h:383
comparator_is_transparent.h
etl::const_iterator
ETL_ASSERT
#define ETL_ASSERT(b, e)
Definition error_handler.h:511
etl::iflat_set::cbegin
const_iterator cbegin() const
Definition flat_set.h:134
etl::iflat_set::insert
iterator insert(const_iterator, const_reference value)
Definition flat_set.h:290
etl::iflat_set::~iflat_set
~iflat_set()
Destructor.
Definition flat_set.h:996
etl::iflat_set::upper_bound
iterator upper_bound(key_parameter_t key)
Definition flat_set.h:767
etl::iflat_set::available
size_t available() const
Definition flat_set.h:929
etl::flat_set::flat_set
flat_set()
Constructor.
Definition flat_set.h:1043
etl::iflat_set::erase
size_t erase(key_parameter_t key)
Definition flat_set.h:555
etl::iflat_set::begin
iterator begin()
Definition flat_set.h:98
etl::iflat_set::iflat_set
iflat_set(lookup_t &lookup_, storage_t &storage_)
Constructor.
Definition flat_set.h:939
etl::iflat_set::begin
const_iterator begin() const
Definition flat_set.h:107
etl::iflat_set::crbegin
const_reverse_iterator crbegin() const
Definition flat_set.h:190
etl::iflat_set::erase
iterator erase(iterator i_element)
Definition flat_set.h:599
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace(const T1 &value1)
Emplaces a value to the set.
Definition flat_set.h:421
etl::iflat_set::max_size
size_type max_size() const
Definition flat_set.h:920
etl::iflat_set::find
iterator find(key_parameter_t key)
Definition flat_set.h:672
etl::iflat_set::equal_range
ETL_OR_STD::pair< iterator, iterator > equal_range(key_parameter_t key)
Definition flat_set.h:805
etl::iflat_set::capacity
size_type capacity() const
Definition flat_set.h:911
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace(const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4)
Emplaces a value to the set.
Definition flat_set.h:520
etl::iflat_set::count
size_t count(key_parameter_t key) const
Definition flat_set.h:710
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace(const_reference value)
Emplaces a value to the set.
Definition flat_set.h:330
etl::iflat_set::erase
iterator erase(const_iterator first, const_iterator last)
Definition flat_set.h:626
etl::iflat_set::lower_bound
iterator lower_bound(key_parameter_t key)
Definition flat_set.h:729
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace()
Emplaces a value to the set.
Definition flat_set.h:388
etl::iflat_set::empty
bool empty() const
Definition flat_set.h:893
etl::iflat_set::find
const_iterator find(key_parameter_t key) const
Definition flat_set.h:691
etl::flat_set::~flat_set
~flat_set()
Destructor.
Definition flat_set.h:1098
etl::iflat_set::operator=
iflat_set & operator=(const iflat_set &rhs)
Assignment operator.
Definition flat_set.h:858
etl::iflat_set::end
const_iterator end() const
Definition flat_set.h:125
etl::iflat_set::full
bool full() const
Definition flat_set.h:902
etl::iflat_set::end
iterator end()
Definition flat_set.h:116
etl::iflat_set::contains
bool contains(key_parameter_t key) const
Check if the map contains the key.
Definition flat_set.h:841
etl::iflat_set::erase
iterator erase(const_iterator i_element)
Definition flat_set.h:611
etl::iflat_set::insert
ETL_OR_STD::pair< iterator, bool > insert(const_reference value)
Definition flat_set.h:235
etl::iflat_set::rbegin
const_reverse_iterator rbegin() const
Definition flat_set.h:162
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace(const T1 &value1, const T2 &value2)
Emplaces a value to the set.
Definition flat_set.h:454
etl::iflat_set::insert
void insert(TIterator first, TIterator last)
Definition flat_set.h:318
etl::iflat_set::crend
const_reverse_iterator crend() const
Definition flat_set.h:199
etl::iflat_set::assign
void assign(TIterator first, TIterator last)
Definition flat_set.h:213
etl::iflat_set::rend
reverse_iterator rend()
Definition flat_set.h:171
etl::flat_set::operator=
flat_set & operator=(const flat_set &rhs)
Assignment operator.
Definition flat_set.h:1106
etl::flat_set::flat_set
flat_set(const flat_set &other)
Copy constructor.
Definition flat_set.h:1051
etl::iflat_set::size
size_type size() const
Definition flat_set.h:884
etl::iflat_set::lower_bound
const_iterator lower_bound(key_parameter_t key) const
Definition flat_set.h:748
etl::iflat_set::rbegin
reverse_iterator rbegin()
Definition flat_set.h:152
etl::iflat_set::upper_bound
const_iterator upper_bound(key_parameter_t key) const
Definition flat_set.h:786
etl::iflat_set::rend
const_reverse_iterator rend() const
Definition flat_set.h:180
etl::iflat_set::cend
const_iterator cend() const
Definition flat_set.h:143
etl::iflat_set::equal_range
ETL_OR_STD::pair< const_iterator, const_iterator > equal_range(key_parameter_t key) const
Definition flat_set.h:824
etl::iflat_set::emplace
ETL_OR_STD::pair< iterator, bool > emplace(const T1 &value1, const T2 &value2, const T3 &value3)
Emplaces a value to the set.
Definition flat_set.h:487
etl::flat_set::flat_set
flat_set(TIterator first, TIterator last)
Definition flat_set.h:1078
etl::iflat_set::clear
void clear()
Clears the flat_set.
Definition flat_set.h:644
etl::flat_set
Definition flat_set.h:1035
etl::iflat_set
Definition flat_set.h:62
etl::addressof
ETL_CONSTEXPR17 etl::enable_if<!etl::is_same< T, etl::nullptr_t >::value, T >::type * addressof(T &t)
Definition addressof.h:52
etl::destroy_at
etl::enable_if< etl::is_trivially_destructible< T >::value, void >::type destroy_at(T *)
Definition memory.h:1819
etl::ipool::allocate
T * allocate()
Definition ipool.h:334
etl::ipool::release
void release(const void *const p_object)
Definition ipool.h:461
etl::ipool
Definition ipool.h:110
initializer_list.h
etl
Definition absolute.h:40
etl::operator==
ETL_CONSTEXPR14 bool operator==(const etl::array< T, SIZE > &lhs, const etl::array< T, SIZE > &rhs)
Definition array.h:1078
etl::operator!=
ETL_CONSTEXPR14 bool operator!=(const etl::array< T, SIZE > &lhs, const etl::array< T, SIZE > &rhs)
Definition array.h:1090
placement_new.h
platform.h
pool.h
reference_flat_set.h
etl::compare
Definition compare.h:51
etl::value_type
etl::iterator
iterator
Definition iterator.h:482
type_traits.h