|
|
| DenseMap (unsigned InitialReserve=0) |
| | Create a DenseMap wth an optional InitialReserve that guarantee that this number of elements can be inserted in the map without grow()
|
| |
|
| DenseMap (const DenseMap &other) |
| |
|
| DenseMap (DenseMap &&other) |
| |
|
template<typename InputIt > |
| | DenseMap (const InputIt &I, const InputIt &E) |
| |
|
| DenseMap (std::initializer_list< typename BaseT::value_type > Vals) |
| |
|
void | swap (DenseMap &RHS) |
| |
|
DenseMap & | operator= (const DenseMap &other) |
| |
|
DenseMap & | operator= (DenseMap &&other) |
| |
|
void | copyFrom (const DenseMap &other) |
| |
|
void | init (unsigned InitNumEntries) |
| |
|
void | grow (unsigned AtLeast) |
| |
|
void | shrink_and_clear () |
| |
|
iterator | begin () |
| |
|
const_iterator | begin () const |
| |
|
iterator | end () |
| |
|
const_iterator | end () const |
| |
|
LLVM_NODISCARD bool | empty () const |
| |
|
unsigned | size () const |
| |
|
void | reserve (size_type NumEntries) |
| | Grow the densemap so that it can contain at least NumEntries items before resizing again.
|
| |
|
void | clear () |
| |
|
size_type | count (const_arg_type_t< KeyT > Val) const |
| | Return 1 if the specified key is in the map, 0 otherwise.
|
| |
|
iterator | find (const_arg_type_t< KeyT > Val) |
| |
|
const_iterator | find (const_arg_type_t< KeyT > Val) const |
| |
| iterator | find_as (const LookupKeyT &Val) |
| | Alternate version of find() which allows a different, and possibly less expensive, key type. More...
|
| |
|
const_iterator | find_as (const LookupKeyT &Val) const |
| |
|
ValueT | lookup (const_arg_type_t< KeyT > Val) const |
| | lookup - Return the entry for the specified key, or a default constructed value if no such entry exists.
|
| |
|
std::pair< iterator, bool > | insert (const std::pair< KeyT, ValueT > &KV) |
| |
|
std::pair< iterator, bool > | insert (std::pair< KeyT, ValueT > &&KV) |
| |
|
void | insert (InputIt I, InputIt E) |
| | insert - Range insertion of pairs.
|
| |
|
std::pair< iterator, bool > | try_emplace (KeyT &&Key, Ts &&... Args) |
| |
|
std::pair< iterator, bool > | try_emplace (const KeyT &Key, Ts &&... Args) |
| |
| std::pair< iterator, bool > | insert_as (std::pair< KeyT, ValueT > &&KV, const LookupKeyT &Val) |
| | Alternate version of insert() which allows a different, and possibly less expensive, key type. More...
|
| |
|
bool | erase (const KeyT &Val) |
| |
|
void | erase (iterator I) |
| |
|
value_type & | FindAndConstruct (const KeyT &Key) |
| |
|
value_type & | FindAndConstruct (KeyT &&Key) |
| |
|
ValueT & | operator[] (const KeyT &Key) |
| |
|
ValueT & | operator[] (KeyT &&Key) |
| |
| bool | isPointerIntoBucketsArray (const void *Ptr) const |
| | isPointerIntoBucketsArray - Return true if the specified pointer points somewhere into the DenseMap's array of buckets (i.e. More...
|
| |
| const void * | getPointerIntoBucketsArray () const |
| | getPointerIntoBucketsArray() - Return an opaque pointer into the buckets array. More...
|
| |
| size_t | getMemorySize () const |
| | Return the approximate size (in bytes) of the actual map. More...
|
| |
|
void | incrementEpoch () |
| | Calling incrementEpoch invalidates all handles pointing into the calling instance.
|
| |
|
| ~DebugEpochBase () |
| | The destructor calls incrementEpoch to make use-after-free bugs more likely to crash deterministically.
|
| |
|
|
using | size_type = unsigned |
| |
|
using | key_type = KeyT |
| |
|
using | mapped_type = ValueT |
| |
|
using | value_type = BucketT |
| |
|
using | iterator = DenseMapIterator< KeyT, ValueT, KeyInfoT, BucketT > |
| |
|
using | const_iterator = DenseMapIterator< KeyT, ValueT, KeyInfoT, BucketT, true > |
| |
|
void | destroyAll () |
| |
|
void | initEmpty () |
| |
|
unsigned | getMinBucketToReserveForEntries (unsigned NumEntries) |
| | Returns the number of buckets to allocate to ensure that the DenseMap can accommodate NumEntries without need to grow().
|
| |
|
void | moveFromOldBuckets (BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) |
| |
|
void | copyFrom (const DenseMapBase< OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT > &other) |
| |
|
static unsigned | getHashValue (const KeyT &Val) |
| |
|
static unsigned | getHashValue (const LookupKeyT &Val) |
| |
|
static const KeyT | getEmptyKey () |
| |
|
static const KeyT | getTombstoneKey () |
| |