31#ifndef ETL_REFERENCE_FLAT_SET_INCLUDED
32#define ETL_REFERENCE_FLAT_SET_INCLUDED
100 template <
typename T,
typename TKeyCompare = etl::less<T> >
106 typedef T value_type;
108 typedef value_type& reference;
138 : ilookup(
other.ilookup)
144 ilookup =
other.ilookup;
191 return lhs.ilookup ==
rhs.ilookup;
201 typename lookup_t::iterator ilookup;
221 : ilookup(
other.ilookup)
226 : ilookup(
other.ilookup)
232 ilookup =
other.ilookup;
238 ilookup =
other.ilookup;
285 return lhs.ilookup ==
rhs.ilookup;
295 typename lookup_t::const_iterator ilookup;
304 typedef ETL_OR_STD::reverse_iterator<iterator> reverse_iterator;
305 typedef ETL_OR_STD::reverse_iterator<const_iterator> const_reverse_iterator;
306 typedef typename etl::iterator_traits<iterator>::difference_type difference_type;
368 return reverse_iterator(lookup.
rbegin());
377 return const_reverse_iterator(lookup.
rbegin());
386 return reverse_iterator(lookup.
rend());
393 const_reverse_iterator
rend()
const
395 return const_reverse_iterator(lookup.
rend());
404 return const_reverse_iterator(lookup.
crbegin());
411 const_reverse_iterator
crend()
const
413 return const_reverse_iterator(lookup.
crend());
423 template <
typename TIterator>
426#if ETL_IS_DEBUG_BUILD
427 difference_type
d = etl::distance(first, last);
433 while (first != last)
445 ETL_OR_STD::pair<iterator, bool>
insert(reference value)
460 return insert(value).first;
470 template <
class TIterator>
473 while (first != last)
513 lookup.
erase(i_element.ilookup);
546 return lookup.
erase(first.ilookup, last.ilookup);
590 if (!key_compare()(*itr, key) && !key_compare()(key, *itr))
631 const_iterator
find(
const K& key)
const
637 if (!key_compare()(*itr, key) && !key_compare()(key, *itr))
658 return (
find(key) ==
end()) ? 0 : 1;
664 size_t count(
const K& key)
const
666 return (
find(key) ==
end()) ? 0 : 1;
759 ETL_OR_STD::pair<iterator, iterator>
equal_range(
const K& key)
770 ETL_OR_STD::pair<const_iterator, const_iterator>
equal_range(parameter_t key)
const
778 ETL_OR_STD::pair<const_iterator, const_iterator>
equal_range(
const K& key)
const
807 return lookup.
size();
816 return lookup.
empty();
825 return lookup.
full();
872 ETL_OR_STD::pair<iterator, bool> result(
end(),
false);
881 result.second =
true;
894 result.second =
true;
914#if defined(ETL_POLYMORPHIC_REFERENCE_FLAT_SET) || defined(ETL_POLYMORPHIC_CONTAINERS)
931 template <
typename TKey, const
size_t MAX_SIZE_,
typename TKeyCompare = etl::less<TKey> >
936 static ETL_CONSTANT
size_t MAX_SIZE =
MAX_SIZE_;
963 template <
typename TIterator>
984 template <
typename TKey, const
size_t MAX_SIZE_,
typename TCompare>
985 ETL_CONSTANT
size_t reference_flat_set<TKey, MAX_SIZE_, TCompare>::MAX_SIZE;
990#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
991 template <
typename... T>
992 reference_flat_set(T...) -> reference_flat_set<
etl::nth_type_t<0, T...>,
sizeof...(T)>;
998#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
999 template <
typename TKey,
typename TKeyCompare = etl::less<TKey>,
typename... T>
1000 constexpr auto make_reference_flat_set(T&&... keys) ->
etl::reference_flat_set<TKey,
sizeof...(T), TKeyCompare>
1013 template <
typename T,
typename TKeyCompare>
1016 return (
lhs.size() ==
rhs.size()) && etl::equal(
lhs.begin(),
lhs.end(),
rhs.begin());
1026 template <
typename T,
typename TKeyCompare>
Definition reference_flat_set.h:58
Definition reference_flat_set.h:72
Definition reference_flat_set.h:86
Definition reference_flat_set.h:206
Definition reference_flat_set.h:122
Definition reference_flat_set.h:102
const_iterator lower_bound(parameter_t key) const
Definition reference_flat_set.h:694
~ireference_flat_set()
Destructor.
Definition reference_flat_set.h:921
size_type capacity() const
Definition reference_flat_set.h:832
ETL_OR_STD::pair< iterator, bool > insert_at(iterator i_element, reference value)
Definition reference_flat_set.h:870
size_t available() const
Definition reference_flat_set.h:850
ETL_OR_STD::pair< iterator, bool > insert(reference value)
Definition reference_flat_set.h:445
const_iterator begin() const
Definition reference_flat_set.h:321
iterator upper_bound(parameter_t key)
Definition reference_flat_set.h:713
const_iterator find(parameter_t key) const
Definition reference_flat_set.h:609
iterator erase(iterator i_element)
Definition reference_flat_set.h:523
void assign(TIterator first, TIterator last)
Definition reference_flat_set.h:424
iterator erase(const_iterator first, const_iterator last)
Definition reference_flat_set.h:544
const_reverse_iterator rend() const
Definition reference_flat_set.h:393
const_reverse_iterator crbegin() const
Definition reference_flat_set.h:402
const_iterator end() const
Definition reference_flat_set.h:339
iterator begin()
Definition reference_flat_set.h:312
size_t erase(parameter_t key)
Definition reference_flat_set.h:485
bool contains(parameter_t key) const
Check if the set contains the key.
Definition reference_flat_set.h:787
iterator insert(const_iterator, reference value)
Definition reference_flat_set.h:458
iterator end()
Definition reference_flat_set.h:330
ETL_OR_STD::pair< const_iterator, const_iterator > equal_range(parameter_t key) const
Definition reference_flat_set.h:770
ETL_OR_STD::pair< iterator, iterator > equal_range(parameter_t key)
Definition reference_flat_set.h:751
const_iterator upper_bound(parameter_t key) const
Definition reference_flat_set.h:732
const_iterator cend() const
Definition reference_flat_set.h:357
const_iterator cbegin() const
Definition reference_flat_set.h:348
iterator find(parameter_t key)
Definition reference_flat_set.h:562
const_reverse_iterator rbegin() const
Definition reference_flat_set.h:375
size_type max_size() const
Definition reference_flat_set.h:841
const_reverse_iterator crend() const
Definition reference_flat_set.h:411
bool empty() const
Definition reference_flat_set.h:814
size_type size() const
Definition reference_flat_set.h:805
reverse_iterator rbegin()
Definition reference_flat_set.h:366
ireference_flat_set(lookup_t &lookup_)
Constructor.
Definition reference_flat_set.h:860
size_t count(parameter_t key) const
Definition reference_flat_set.h:656
void insert(TIterator first, TIterator last)
Definition reference_flat_set.h:471
bool full() const
Definition reference_flat_set.h:823
void clear()
Clears the reference_flat_set.
Definition reference_flat_set.h:552
iterator erase(const_iterator i_element)
Definition reference_flat_set.h:532
iterator lower_bound(parameter_t key)
Definition reference_flat_set.h:675
reverse_iterator rend()
Definition reference_flat_set.h:384
Definition reference_flat_set.h:933
reference_flat_set(TIterator first, TIterator last)
Definition reference_flat_set.h:964
reference_flat_set(const reference_flat_set &other)
Copy constructor.
Definition reference_flat_set.h:951
reference_flat_set()
Constructor.
Definition reference_flat_set.h:943
~reference_flat_set()
Destructor.
Definition reference_flat_set.h:973
ETL_CONSTEXPR14 bool operator==(const etl::expected< TValue, TError > &lhs, const etl::expected< TValue2, TError2 > &rhs)
Equivalence operators.
Definition expected.h:968
#define ETL_ASSERT(b, e)
Definition error_handler.h:356
Definition exception.h:47
ETL_CONSTEXPR17 etl::enable_if<!etl::is_same< T, etl::nullptr_t >::value, T >::type * addressof(T &t)
Definition addressof.h:52
iterator begin()
Definition vector.h:100
size_type max_size() const
Definition vector_base.h:140
void push_back(const_reference value)
Definition vector.h:435
const_reverse_iterator crbegin() const
Definition vector.h:190
reverse_iterator rend()
Definition vector.h:172
size_type capacity() const
Definition vector_base.h:131
const_iterator cend() const
Definition vector.h:145
void clear()
Clears the vector.
Definition vector.h:417
iterator end()
Definition vector.h:118
const_reverse_iterator crend() const
Definition vector.h:199
const_iterator cbegin() const
Definition vector.h:136
bool full() const
Definition vector.h:996
size_type size() const
Definition vector.h:978
iterator erase(iterator i_element)
Definition vector.h:884
bool empty() const
Definition vector.h:987
size_t available() const
Definition vector.h:1005
reverse_iterator rbegin()
Definition vector.h:154
iterator insert(const_iterator position, const_reference value)
Definition vector.h:579
bitset_ext
Definition absolute.h:38
bool operator!=(const etl::array< T, SIZE > &lhs, const etl::array< T, SIZE > &rhs)
Definition array.h:654
bool operator==(const etl::array< T, SIZE > &lhs, const etl::array< T, SIZE > &rhs)
Definition array.h:642
iterator
Definition iterator.h:399
pair holds two objects of arbitrary type
Definition utility.h:164
T1 first
first is a copy of the first object
Definition utility.h:168
etl::conditional< etl::is_fundamental< T >::value||etl::is_pointer< T >::value, T, constT & >::type type
By default fundamental and pointer types are passed by value.
Definition parameter_type.h:48