31#ifndef ETL_REFERENCE_FLAT_MULTISET_INCLUDED
32#define ETL_REFERENCE_FLAT_MULTISET_INCLUDED
99 template <
typename T,
typename TKeyCompare = etl::less<T> >
105 typedef T value_type;
136 : ilookup(
other.ilookup)
142 ilookup =
other.ilookup;
189 return lhs.ilookup ==
rhs.ilookup;
199 typename lookup_t::iterator ilookup;
219 : ilookup(
other.ilookup)
224 : ilookup(
other.ilookup)
230 ilookup =
other.ilookup;
236 ilookup =
other.ilookup;
283 return lhs.ilookup ==
rhs.ilookup;
293 typename lookup_t::const_iterator ilookup;
302 typedef ETL_OR_STD::reverse_iterator<iterator> reverse_iterator;
303 typedef ETL_OR_STD::reverse_iterator<const_iterator> const_reverse_iterator;
304 typedef typename etl::iterator_traits<iterator>::difference_type difference_type;
366 return reverse_iterator(lookup.
rbegin());
375 return const_reverse_iterator(lookup.
rbegin());
384 return reverse_iterator(lookup.
rend());
391 const_reverse_iterator
rend()
const
393 return const_reverse_iterator(lookup.
rend());
402 return const_reverse_iterator(lookup.
crbegin());
409 const_reverse_iterator
crend()
const
411 return const_reverse_iterator(lookup.
crend());
421 template <
typename TIterator>
424#if ETL_IS_DEBUG_BUILD
425 difference_type
d = etl::distance(first, last);
431 while (first != last)
443 ETL_OR_STD::pair<iterator, bool>
insert(value_type& value)
445 ETL_OR_STD::pair<iterator, bool> result(
end(),
false);
456 result.second =
true;
477 return insert(value).first;
487 template <
class TIterator>
490 while (first != last)
504 ETL_OR_STD::pair<iterator, iterator> range =
equal_range(key);
506 if (range.first ==
end())
512 size_t d = etl::distance(range.first, range.second);
513 erase(range.first, range.second);
525 if (range.first ==
end())
531 size_t d = etl::distance(range.first, range.second);
532 erase(range.first, range.second);
565 return lookup.
erase(first.ilookup, last.ilookup);
609 if (!key_compare()(*itr, key) && !key_compare()(key, *itr))
650 const_iterator
find(
const K& key)
const
656 if (!key_compare()(*itr, key) && !key_compare()(key, *itr))
677 ETL_OR_STD::pair<const_iterator, const_iterator> range =
equal_range(key);
679 return etl::distance(range.first, range.second);
685 size_t count(
const K& key)
const
687 ETL_OR_STD::pair<const_iterator, const_iterator> range =
equal_range(key);
689 return etl::distance(range.first, range.second);
782 ETL_OR_STD::pair<iterator, iterator>
equal_range(
const K& key)
810 ETL_OR_STD::pair<const_iterator, const_iterator>
equal_range(parameter_t key)
const
821 return lookup.
size();
830 return lookup.
empty();
839 return lookup.
full();
886 ETL_OR_STD::pair<iterator, bool> result(
end(),
false);
895 result.second =
true;
905 result.second =
true;
924#if defined(ETL_POLYMORPHIC_REFERENCE_FLAT_MULTISET) || defined(ETL_POLYMORPHIC_CONTAINERS)
941 template <
typename TKey, const
size_t MAX_SIZE_,
typename TKeyCompare = etl::less<TKey> >
946 static ETL_CONSTANT
size_t MAX_SIZE =
MAX_SIZE_;
973 template <
typename TIterator>
994 template <
typename TKey, const
size_t MAX_SIZE_,
typename TCompare>
995 ETL_CONSTANT
size_t reference_flat_multiset<TKey, MAX_SIZE_, TCompare>::MAX_SIZE;
1000#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
1001 template <
typename... T>
1002 reference_flat_multiset(T...)->reference_flat_multiset<
etl::nth_type_t<0, T...>,
sizeof...(T)>;
1008#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
1009 template <
typename TKey,
typename TKeyCompare = etl::less<TKey>,
typename... T>
1023 template <
typename T,
typename TKeyCompare>
1026 return (
lhs.size() ==
rhs.size()) && etl::equal(
lhs.begin(),
lhs.end(),
rhs.begin());
1036 template <
typename T,
typename TKeyCompare>
Definition reference_flat_multiset.h:57
Definition reference_flat_multiset.h:71
Definition reference_flat_multiset.h:85
Definition reference_flat_multiset.h:204
Definition reference_flat_multiset.h:121
Definition reference_flat_multiset.h:101
iterator upper_bound(parameter_t key)
Definition reference_flat_multiset.h:736
iterator erase(const_iterator first, const_iterator last)
Definition reference_flat_multiset.h:563
iterator erase(iterator i_element)
Definition reference_flat_multiset.h:542
iterator erase(const_iterator i_element)
Definition reference_flat_multiset.h:551
size_t count(parameter_t key) const
Definition reference_flat_multiset.h:675
const_iterator begin() const
Definition reference_flat_multiset.h:319
ETL_OR_STD::pair< iterator, bool > insert_at(iterator i_element, reference value)
Definition reference_flat_multiset.h:884
iterator begin()
Definition reference_flat_multiset.h:310
const_iterator find(parameter_t key) const
Definition reference_flat_multiset.h:628
~ireference_flat_multiset()
Destructor.
Definition reference_flat_multiset.h:931
const_iterator upper_bound(parameter_t key) const
Definition reference_flat_multiset.h:755
ireference_flat_multiset(lookup_t &lookup_)
Constructor.
Definition reference_flat_multiset.h:874
ETL_OR_STD::pair< const_iterator, const_iterator > equal_range(parameter_t key) const
Definition reference_flat_multiset.h:810
reverse_iterator rbegin()
Definition reference_flat_multiset.h:364
size_t erase(parameter_t key)
Definition reference_flat_multiset.h:502
bool empty() const
Definition reference_flat_multiset.h:828
const_iterator end() const
Definition reference_flat_multiset.h:337
reverse_iterator rend()
Definition reference_flat_multiset.h:382
iterator insert(const_iterator, value_type &value)
Definition reference_flat_multiset.h:475
ETL_OR_STD::pair< iterator, bool > insert(value_type &value)
Definition reference_flat_multiset.h:443
size_t available() const
Definition reference_flat_multiset.h:864
void insert(TIterator first, TIterator last)
Definition reference_flat_multiset.h:488
iterator find(parameter_t key)
Definition reference_flat_multiset.h:581
size_type size() const
Definition reference_flat_multiset.h:819
const_iterator lower_bound(parameter_t key) const
Definition reference_flat_multiset.h:717
bool contains(parameter_t key) const
Check if the map contains the key.
Definition reference_flat_multiset.h:791
bool full() const
Definition reference_flat_multiset.h:837
void clear()
Clears the reference_flat_multiset.
Definition reference_flat_multiset.h:571
iterator end()
Definition reference_flat_multiset.h:328
const_reverse_iterator rbegin() const
Definition reference_flat_multiset.h:373
iterator lower_bound(parameter_t key)
Definition reference_flat_multiset.h:698
ETL_OR_STD::pair< iterator, iterator > equal_range(parameter_t key)
Definition reference_flat_multiset.h:774
size_type capacity() const
Definition reference_flat_multiset.h:846
const_reverse_iterator crbegin() const
Definition reference_flat_multiset.h:400
const_reverse_iterator crend() const
Definition reference_flat_multiset.h:409
const_iterator cend() const
Definition reference_flat_multiset.h:355
const_reverse_iterator rend() const
Definition reference_flat_multiset.h:391
size_type max_size() const
Definition reference_flat_multiset.h:855
void assign(TIterator first, TIterator last)
Definition reference_flat_multiset.h:422
const_iterator cbegin() const
Definition reference_flat_multiset.h:346
Definition reference_flat_multiset.h:943
reference_flat_multiset(const reference_flat_multiset &other)
Copy constructor.
Definition reference_flat_multiset.h:961
~reference_flat_multiset()
Destructor.
Definition reference_flat_multiset.h:983
reference_flat_multiset()
Constructor.
Definition reference_flat_multiset.h:953
reference_flat_multiset(TIterator first, TIterator last)
Definition reference_flat_multiset.h:974
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
T2 second
second is a copy of the second object
Definition utility.h:169
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