31#ifndef ETL_UNORDERED_MAP_INCLUDED
32#define ETL_UNORDERED_MAP_INCLUDED
125 template <
typename TKey,
typename T,
typename THash = etl::hash<TKey>,
typename TKeyEqual = etl::equal_to<TKey> >
130 typedef ETL_OR_STD::pair<const TKey, T> value_type;
136 typedef value_type& reference;
137 typedef const value_type& const_reference;
141 typedef value_type* pointer;
142 typedef const value_type* const_pointer;
164 value_type key_value_pair;
186 typedef typename bucket_t::iterator local_iterator;
187 typedef typename bucket_t::const_iterator const_local_iterator;
199 typedef typename iunordered_map::reference reference;
200 typedef typename iunordered_map::const_reference const_reference;
201 typedef typename iunordered_map::pointer pointer;
202 typedef typename iunordered_map::const_pointer const_pointer;
215 : pbuckets_end(
other.pbuckets_end)
216 , pbucket(
other.pbucket)
227 if (inode == pbucket->end())
231 while ((pbucket != pbuckets_end) && (pbucket->empty()))
237 if (pbucket != pbuckets_end)
239 inode = pbucket->begin();
257 pbuckets_end =
other.pbuckets_end;
258 pbucket =
other.pbucket;
266 return inode->key_value_pair;
272 return &(inode->key_value_pair);
278 return &(inode->key_value_pair);
306 return rhs.inode == inode;
316 bucket_t* get_bucket_list_iterator()
322 local_iterator get_local_iterator()
329 local_iterator inode;
342 typedef typename iunordered_map::reference reference;
343 typedef typename iunordered_map::const_reference const_reference;
344 typedef typename iunordered_map::pointer pointer;
345 typedef typename iunordered_map::const_pointer const_pointer;
358 : pbuckets_end(
other.pbuckets_end)
359 , pbucket(
other.pbucket)
366 : pbuckets_end(
other.pbuckets_end)
367 , pbucket(
other.pbucket)
378 if (inode == pbucket->end())
382 while ((pbucket != pbuckets_end) && (pbucket->empty()))
388 if (pbucket != pbuckets_end)
390 inode = pbucket->begin();
408 pbuckets_end =
other.pbuckets_end;
409 pbucket =
other.pbucket;
417 return inode->key_value_pair;
423 return &(inode->key_value_pair);
429 return &(inode->key_value_pair);
457 return rhs.inode == inode;
467 bucket_t* get_bucket_list_iterator()
473 local_iterator get_local_iterator()
480 local_iterator inode;
483 typedef typename etl::iterator_traits<iterator>::difference_type difference_type;
491 return iterator((pbuckets + number_of_buckets), first, first->begin());
500 return const_iterator((pbuckets + number_of_buckets), first, first->begin());
509 return const_iterator((pbuckets + number_of_buckets), first, first->begin());
518 return pbuckets[
i].begin();
525 const_local_iterator
begin(
size_t i)
const
527 return pbuckets[
i].cbegin();
536 return pbuckets[
i].cbegin();
545 return iterator((pbuckets + number_of_buckets), last, last->end());
554 return const_iterator((pbuckets + number_of_buckets), last, last->end());
563 return const_iterator((pbuckets + number_of_buckets), last, last->end());
572 return pbuckets[
i].end();
579 const_local_iterator
end(
size_t i)
const
581 return pbuckets[
i].cend();
588 const_local_iterator
cend(
size_t i)
const
590 return pbuckets[
i].cend();
599 return key_hash_function(key) % number_of_buckets;
608 size_t index =
bucket(key);
610 return etl::distance(pbuckets[index].
begin(), pbuckets[index].
end());
619 return number_of_buckets;
628 return number_of_buckets;
643 local_iterator inode = pbucket->begin();
646 while (inode != pbucket->end())
649 if (key_equal_function(key, inode->key_value_pair.first))
652 return inode->key_value_pair.second;
662 node_t* node = allocate_data_node();
664 ::new ((
void*)
etl::addressof(node->key_value_pair.first)) key_type(
etl::move(key));
665 ::new ((
void*)
etl::
addressof(node->key_value_pair.second)) mapped_type();
666 ETL_INCREMENT_DEBUG_COUNT;
668 pbucket->insert_after(pbucket->before_begin(), *node);
670 adjust_first_last_markers_after_insert(pbucket);
672 return pbucket->
begin()->key_value_pair.second;
687 local_iterator inode = pbucket->begin();
690 while (inode != pbucket->end())
693 if (key_equal_function(key, inode->key_value_pair.
first))
696 return inode->key_value_pair.
second;
710 ETL_INCREMENT_DEBUG_COUNT;
712 pbucket->insert_after(pbucket->before_begin(), *
node);
714 adjust_first_last_markers_after_insert(pbucket);
716 return pbucket->begin()->key_value_pair.
second;
731 local_iterator inode = pbucket->begin();
734 while (inode != pbucket->end())
737 if (key_equal_function(key, inode->key_value_pair.
first))
740 return inode->key_value_pair.
second;
751 return begin()->second;
766 local_iterator inode = pbucket->begin();
769 while (inode != pbucket->end())
772 if (key_equal_function(key, inode->key_value_pair.
first))
775 return inode->key_value_pair.
second;
786 return begin()->second;
796 template <
typename TIterator>
799#if ETL_IS_DEBUG_BUILD
819 ETL_OR_STD::pair<iterator, bool>
insert(const_reference key_value_pair)
821 ETL_OR_STD::pair<iterator, bool> result(
end(),
false);
831 bucket_t* pbucket = pbuckets + index;
841 ETL_INCREMENT_DEBUG_COUNT;
846 adjust_first_last_markers_after_insert(pbucket);
848 result.first =
iterator((pbuckets + number_of_buckets), pbucket, pbucket->begin());
849 result.second =
true;
855 local_iterator inode =
bucket.begin();
857 while (inode !=
bucket.end())
860 if (key_equal_function(inode->key_value_pair.first, key))
870 if (inode ==
bucket.end())
876 ETL_INCREMENT_DEBUG_COUNT;
880 adjust_first_last_markers_after_insert(&
bucket);
884 result.second =
true;
899 ETL_OR_STD::pair<iterator, bool> result(
end(),
false);
903 const key_type& key = key_value_pair.
first;
909 bucket_t* pbucket = pbuckets + index;
910 bucket_t&
bucket = *pbucket;
916 node_t*
node = allocate_data_node();
919 ETL_INCREMENT_DEBUG_COUNT;
924 adjust_first_last_markers_after_insert(pbucket);
926 result.first =
iterator((pbuckets + number_of_buckets), pbucket, pbucket->
begin());
927 result.second =
true;
933 local_iterator inode =
bucket.begin();
935 while (inode !=
bucket.end())
938 if (key_equal_function(inode->key_value_pair.first, key))
948 if (inode == bucket.end())
951 node_t* node = allocate_data_node();
953 ::new ((
void*)
etl::addressof(node->key_value_pair)) value_type(
etl::move(key_value_pair));
954 ETL_INCREMENT_DEBUG_COUNT;
957 bucket.insert_after(inode_previous, *node);
958 adjust_first_last_markers_after_insert(&bucket);
961 result.first = iterator((pbuckets + number_of_buckets), pbucket, inode_previous);
962 result.second = true;
978 return insert(key_value_pair).first;
990 return insert(etl::move(key_value_pair)).first;
1001 template <
class TIterator>
1087 local_iterator
iprevious = pbucket->before_begin();
1089 local_iterator
iend =
last_.get_local_iterator();
1115 }
while (pbucket->empty());
1141 return (
find(key) ==
end()) ? 0 : 1;
1153 bucket_t* pbucket = pbuckets + index;
1160 local_iterator inode =
bucket.begin();
1163 while (inode !=
iend)
1166 if (key_equal_function(key, inode->key_value_pair.
first))
1168 return iterator((pbuckets + number_of_buckets), pbucket, inode);
1187 bucket_t* pbucket = pbuckets + index;
1194 local_iterator inode =
bucket.begin();
1197 while (inode !=
iend)
1200 if (key_equal_function(key, inode->key_value_pair.
first))
1202 return iterator((pbuckets + number_of_buckets), pbucket, inode);
1230 return ETL_OR_STD::pair<iterator, iterator>(
f,
l);
1251 return ETL_OR_STD::pair<const_iterator, const_iterator>(
f,
l);
1259 return pnodepool->
size();
1283 return pnodepool->
empty();
1291 return pnodepool->
full();
1318 return key_hash_function;
1327 return key_equal_function;
1338 key_hash_function =
rhs.hash_function();
1339 key_equal_function =
rhs.key_eq();
1355 key_hash_function =
rhs.hash_function();
1356 key_equal_function =
rhs.key_eq();
1357 this->move(
rhs.begin(),
rhs.end());
1388 for (
size_t i = 0
UL;
i < number_of_buckets; ++
i)
1395 local_iterator it =
bucket.begin();
1397 while (it !=
bucket.end())
1400 it->key_value_pair.~value_type();
1401 ETL_DECREMENT_DEBUG_COUNT;
1440 node_t* allocate_data_node()
1442 node_t* (
etl::ipool::*func)() = &etl::ipool::allocate<node_t>;
1443 return (pnodepool->*func)();
1449 void adjust_first_last_markers_after_insert(bucket_t* pbucket)
1458 if (pbucket < first)
1462 else if (pbucket > last)
1472 void adjust_first_last_markers_after_erase(bucket_t* pbucket)
1481 if (pbucket == first)
1484 while (first->empty())
1489 else if (pbucket == last)
1493 bucket_t* pend = last;
1497 while (pbucket != pend)
1499 if (!pbucket->empty())
1513 local_iterator delete_data_node(local_iterator iprevious, local_iterator icurrent, bucket_t& bucket)
1515 local_iterator inext = bucket.erase_after(iprevious);
1516 icurrent->key_value_pair.~value_type();
1517 pnodepool->
release(&*icurrent);
1518 adjust_first_last_markers_after_erase(&bucket);
1519 ETL_DECREMENT_DEBUG_COUNT;
1534 const size_t number_of_buckets;
1541 hasher key_hash_function;
1544 key_equal key_equal_function;
1547 ETL_DECLARE_DEBUG_COUNT;
1552#if defined(ETL_POLYMORPHIC_UNORDERED_MAP) || defined(ETL_POLYMORPHIC_CONTAINERS)
1572 template <
typename TKey,
typename T,
typename THash,
typename TKeyEqual>
1592 ETL_OR_STD::pair<itr_t, itr_t> range =
rhs.equal_range(key);
1594 if (range.first !=
rhs.end())
1620 template <
typename TKey,
typename T,
typename THash,
typename TKeyEqual>
1630 template <
typename TKey,
typename TValue, const
size_t MAX_SIZE_, const
size_t MAX_BUCKETS_ = MAX_SIZE_,
typename THash = etl::hash<TKey>,
typename TKeyEqual = etl::equal_to<TKey> >
1639 static ETL_CONSTANT
size_t MAX_SIZE =
MAX_SIZE_;
1679 template <
typename TIterator>
1686#if ETL_HAS_INITIALIZER_LIST
1693 base::assign(
init.begin(),
init.end());
1710 base::operator=(
rhs);
1720 base::operator=(etl::move(
rhs));
1731 typename base::bucket_t buckets[MAX_BUCKETS_];
1737#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST
1738 template <
typename... TPairs>
1739 unordered_map(TPairs...) -> unordered_map<
typename etl::nth_type_t<0, TPairs...>::first_type,
1747#if ETL_USING_CPP11 && ETL_HAS_INITIALIZER_LIST
1748 template <
typename TKey,
typename T,
typename THash = etl::hash<TKey>,
typename TKeyEqual = etl::equal_to<TKey>,
typename... TPairs>
1749 constexpr auto make_unordered_map(TPairs&&... pairs) ->
etl::unordered_map<TKey, T,
sizeof...(TPairs),
sizeof...(TPairs), THash, TKeyEqual>
Definition unordered_map.h:334
Definition unordered_map.h:191
A templated unordered_map implementation that uses a fixed size buffer.
Definition unordered_map.h:1632
unordered_map(const unordered_map &other)
Copy constructor.
Definition unordered_map.h:1653
unordered_map(const THash &hash=THash(), const TKeyEqual &equal=TKeyEqual())
Default constructor.
Definition unordered_map.h:1645
~unordered_map()
Destructor.
Definition unordered_map.h:1700
unordered_map(TIterator first_, TIterator last_, const THash &hash=THash(), const TKeyEqual &equal=TKeyEqual())
Definition unordered_map.h:1680
ETL_CONSTEXPR14 bool operator==(const etl::expected< TValue, TError > &lhs, const etl::expected< TValue2, TError2 > &rhs)
Equivalence operators.
Definition expected.h:966
#define ETL_ASSERT(b, e)
Definition error_handler.h:316
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
size_t size() const
Returns the number of allocated items in the pool.
Definition ipool.h:293
bool empty() const
Definition ipool.h:302
void release_all()
Release all objects in the pool.
Definition ipool.h:248
bool full() const
Definition ipool.h:311
size_t max_size() const
Returns the maximum number of items in the pool.
Definition ipool.h:269
void release(const void *const p_object)
Definition ipool.h:239
size_t available() const
Returns the number of free items in the pool.
Definition ipool.h:285
float load_factor() const
Definition unordered_map.h:1307
iterator erase(const_iterator first_, const_iterator last_)
Definition unordered_map.h:1075
size_type get_bucket_index(const_key_reference key) const
Definition unordered_map.h:597
iterator begin()
Definition unordered_map.h:489
void initialise()
Initialise the unordered_map.
Definition unordered_map.h:1383
const_iterator find(const_key_reference key) const
Definition unordered_map.h:1183
size_type size() const
Gets the size of the unordered_map.
Definition unordered_map.h:1257
const_local_iterator cend(size_t i) const
Definition unordered_map.h:588
~iunordered_map()
Destructor.
Definition unordered_map.h:1559
iterator end()
Definition unordered_map.h:543
size_t available() const
Definition unordered_map.h:1298
local_iterator end(size_t i)
Definition unordered_map.h:570
hasher hash_function() const
Definition unordered_map.h:1316
const_local_iterator cbegin(size_t i) const
Definition unordered_map.h:534
local_iterator begin(size_t i)
Definition unordered_map.h:516
const_local_iterator end(size_t i) const
Definition unordered_map.h:579
iunordered_map & operator=(const iunordered_map &rhs)
Assignment operator.
Definition unordered_map.h:1333
size_type bucket_size(const_key_reference key) const
Definition unordered_map.h:606
void insert(TIterator first_, TIterator last_)
Definition unordered_map.h:1002
size_type max_bucket_count() const
Definition unordered_map.h:617
const_iterator end() const
Definition unordered_map.h:552
mapped_reference operator[](const_key_reference key)
Definition unordered_map.h:681
bool full() const
Checks to see if the unordered_map is full.
Definition unordered_map.h:1289
size_t count(const_key_reference key) const
Definition unordered_map.h:1139
iterator find(const_key_reference key)
Definition unordered_map.h:1149
ETL_OR_STD::pair< const_iterator, const_iterator > equal_range(const_key_reference key) const
Definition unordered_map.h:1241
const_iterator begin() const
Definition unordered_map.h:498
ETL_OR_STD::pair< iterator, iterator > equal_range(const_key_reference key)
Definition unordered_map.h:1220
void clear()
Clears the unordered_map.
Definition unordered_map.h:1129
iterator erase(const_iterator ielement)
Definition unordered_map.h:1047
iunordered_map(pool_t &node_pool_, bucket_t *pbuckets_, size_t number_of_buckets_, hasher key_hash_function_, key_equal key_equal_function_)
Constructor.
Definition unordered_map.h:1369
const_local_iterator begin(size_t i) const
Definition unordered_map.h:525
bool empty() const
Checks to see if the unordered_map is empty.
Definition unordered_map.h:1281
key_equal key_eq() const
Definition unordered_map.h:1325
mapped_reference at(const_key_reference key)
Definition unordered_map.h:725
size_t erase(const_key_reference key)
Definition unordered_map.h:1016
const key_type & const_key_reference
Defines the parameter types.
Definition unordered_map.h:146
size_type capacity() const
Gets the maximum possible size of the unordered_map.
Definition unordered_map.h:1273
size_type bucket_count() const
Definition unordered_map.h:626
const_iterator cend() const
Definition unordered_map.h:561
iterator insert(const_iterator, const_reference key_value_pair)
Definition unordered_map.h:976
const_mapped_reference at(const_key_reference key) const
Definition unordered_map.h:760
size_type max_size() const
Gets the maximum possible size of the unordered_map.
Definition unordered_map.h:1265
ETL_OR_STD::pair< iterator, bool > insert(const_reference key_value_pair)
Definition unordered_map.h:819
void assign(TIterator first_, TIterator last_)
Definition unordered_map.h:797
const_iterator cbegin() const
Definition unordered_map.h:507
Definition unordered_map.h:127
Definition unordered_map.h:70
Definition unordered_map.h:84
Definition unordered_map.h:111
Definition unordered_map.h:98
bitset_ext
Definition absolute.h:38
A forward link.
Definition intrusive_links.h:88
iterator
Definition iterator.h:399
Definition unordered_map.h:158
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