Quick Links: |
Provide an open-addressed hash table like Abseil flat_hash_map
.
More...
Go to the source code of this file.
Classes | |
class | bdlc::FlatHashTable_IteratorImp< ENTRY > |
class | bdlc::FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > |
struct | bdlc::FlatHashTable_ImplUtil |
class | bdlc::FlatHashTable_ImplUtil::DestroyEntryArrayProctor< ENTRY_TYPE > |
Namespaces | |
namespace | bdlc |
Functions | |
template<class ENTRY > | |
bool | bdlc::operator== (const class FlatHashTable_IteratorImp< ENTRY > &, const class FlatHashTable_IteratorImp< ENTRY > &) |
template<class ENTRY > | |
bool | bdlc::operator== (const FlatHashTable_IteratorImp< ENTRY > &a, const FlatHashTable_IteratorImp< ENTRY > &b) |
template<class KEY , class ENTRY , class ENTRY_UTIL , class HASH , class EQUAL > | |
bool | bdlc::operator== (const FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &lhs, const FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &rhs) |
template<class KEY , class ENTRY , class ENTRY_UTIL , class HASH , class EQUAL > | |
bool | bdlc::operator!= (const FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &lhs, const FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &rhs) |
template<class KEY , class ENTRY , class ENTRY_UTIL , class HASH , class EQUAL > | |
void | bdlc::swap (FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &a, FlatHashTable< KEY, ENTRY, ENTRY_UTIL, HASH, EQUAL > &b) |