|
LLVM 24.0.0git
|
Lock-free thread-safe hash-mapped trie. More...
#include "llvm/ADT/TrieRawHashMap.h"
Classes | |
| class | const_pointer |
| class | LazyValueConstructor |
| class | pointer |
| struct | value_type |
Public Types | |
| using | HashT = std::array<uint8_t, NumHashBytes> |
| using | HashType = HashT |
Lock-free thread-safe hash-mapped trie.
Definition at line 185 of file TrieRawHashMap.h.
| using llvm::ThreadSafeTrieRawHashMap< T, NumHashBytes >::HashT = std::array<uint8_t, NumHashBytes> |
Definition at line 187 of file TrieRawHashMap.h.
| using llvm::ThreadSafeTrieRawHashMap< T, NumHashBytes >::HashType = HashT |
Definition at line 218 of file TrieRawHashMap.h.
|
inline |
Definition at line 356 of file TrieRawHashMap.h.
|
inline |
Definition at line 363 of file TrieRawHashMap.h.
|
default |
|
delete |
| LLVM_DUMP_METHOD void llvm::ThreadSafeTrieRawHashMapBase::dump | ( | ) | const |
|
inline |
Definition at line 346 of file TrieRawHashMap.h.
|
inline |
Definition at line 351 of file TrieRawHashMap.h.
|
inline |
Definition at line 341 of file TrieRawHashMap.h.
|
inline |
Definition at line 335 of file TrieRawHashMap.h.
|
inline |
Definition at line 330 of file TrieRawHashMap.h.
|
inline |
Insert with a hint.
Default-constructed hint will work, but it's recommended to start with a lookup to avoid overhead in object creation if it already exists.
Definition at line 320 of file TrieRawHashMap.h.
Referenced by llvm::ThreadSafeTrieRawHashMap< DataT, sizeof(HashType)>::insert(), llvm::ThreadSafeTrieRawHashMap< DataT, sizeof(HashType)>::insert(), and llvm::ThreadSafeTrieRawHashMap< DataT, sizeof(HashType)>::insertLazy().
|
inline |
Definition at line 92 of file TrieRawHashMap.h.
|
delete |
|
delete |
| LLVM_ABI void llvm::ThreadSafeTrieRawHashMapBase::print | ( | raw_ostream & | OS | ) | const |