Definition at line 163 of file TrieRawHashMap.cpp.
◆ create()
std::unique_ptr< ImplType > llvm::ThreadSafeTrieRawHashMapBase::ImplType::create |
( |
size_t | StartBit, |
|
|
size_t | NumBits ) |
|
inlinestatic |
◆ getRoot()
TrieSubtrie * llvm::ThreadSafeTrieRawHashMapBase::ImplType::getRoot |
( |
| ) |
|
|
inline |
◆ operator delete()
void llvm::ThreadSafeTrieRawHashMapBase::ImplType::operator delete |
( |
void * | Ptr | ) |
|
|
inline |
◆ operator new()
void * llvm::ThreadSafeTrieRawHashMapBase::ImplType::operator new |
( |
size_t | Size | ) |
|
|
inlinestatic |
◆ save()
TrieSubtrie * llvm::ThreadSafeTrieRawHashMapBase::ImplType::save |
( |
std::unique_ptr< TrieSubtrie > | S | ) |
|
|
inline |
◆ TrailingObjects
◆ ContentAlloc
FIXME: This should take a function that allocates and constructs the content lazily (taking the hash as a separate parameter), in case of collision.
Definition at line 201 of file TrieRawHashMap.cpp.
The documentation for this class was generated from the following file: