Open Search
    BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > Member List

    This is the complete list of members for BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, including all inherited members.

    _rootsBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    _sizeBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    Append(const KEYTYPE &key)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    Append(const PAIR &pair)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    AppendAllInverse(COLLECTION2 &&other)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    BaseCollection(ARGS &&... args)BaseCollection< COLLECTION, SUPER >explicit
    Begin()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Begin() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Bucket typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    BurstTrieMap()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    BurstTrieMap(Pool &&a)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >explicit
    BurstTrieMap(const Pool &a)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >explicit
    BurstTrieMap(BurstTrieMap &&src)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    BurstTrieMapUtils classBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >friend
    ClearRoots()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    ConstIterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    ConstKeyIterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    ConstValueIterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Contains(typename ByValueParam< KEYTYPE >::type key) constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    Contains(const PAIR &pair) constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    ContainsAll(COLLECTION2 &&other) constBaseCollection< COLLECTION, SUPER >
    ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)BaseCollection< COLLECTION, SUPER >
    CopyFromImpl(MAP &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank1)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    MapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >::CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    CopyNodes(Index &dest, const BurstTrieMap &srcMap, Index src)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    DestructNodes(Index idx)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    End()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    End() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Erase(K key)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Erase(const IteratorTemplate< false, SUPER > &position, Int eraseCnt=1)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Find(K key)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Find(K key) constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    FindFloor(K key)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    FindFloor(K key) constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    FindValue(K key) constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    FindValue(K key)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Flush()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetCount() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetDepth() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetDepthImpl(Index idx) constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    GetHashCode() constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    GetKeys()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetKeys() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetMapKey(const KEYTYPE &key)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >static
    GetMapKey(const PAIR &pair)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >static
    GetMemorySize() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetMemorySizeImpl(Index idx) constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    GetOperationCountForSearch() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetUniqueHashCode() constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    GetValues()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GetValues() constBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    GROUP_MASKBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >static
    GROUP_SIZEBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >static
    Index typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Insert(K key, const V &value, Bool &created=BoolLValue())BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Insert(K key, V &&value, Bool &created=BoolLValue())BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    InsertEntry(K key, Bool &created=BoolLValue())BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    InsertKey(K key, Bool &created=BoolLValue())BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Intersect(const COLLECTION2 &other)BaseCollection< COLLECTION, SUPER >
    IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< COLLECTION, SUPER >
    Intersects(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
    IsBaseArray typedefBaseCollection< COLLECTION, SUPER >
    IsBurstTrieMap typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    IsCollection typedefBaseCollection< COLLECTION, SUPER >
    IsEmpty() constBaseCollection< COLLECTION, SUPER >
    IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) constBaseCollection< COLLECTION, SUPER >
    IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) constMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    IsPopulated() constBaseCollection< COLLECTION, SUPER >
    Iterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    KeyIterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    KeyType typedefMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    KINDMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >static
    MapBase(ARGS &&... args)MapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >explicit
    MapBase0(ARGS &&... args)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >explicit
    MapType typedefMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    MAX_LENBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >static
    MAXON_DISALLOW_COPY_AND_ASSIGN(BurstTrieMap)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    MAXON_OPERATOR_MOVE_ASSIGNMENT(BurstTrieMap)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Node typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    operator MapImpl< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > & >()MapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
    operator MapImpl< const BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > & >() constMapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
    operator!=(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
    operator==(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
    Pool typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    PoolBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >private
    Reset()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    SetCapacityHint(Int, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
    SubtractImpl(COLLECTION2 &&other, OverloadRank0)MapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    Super typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    ToMap()MapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
    ToMap() constMapBase< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
    ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
    ValueIterator typedefBurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
    ValueType typedefMapBase0< COLLECTION, KEYTYPE, VALUETYPE, SUPER, HASH >
    ~BurstTrieMap()BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >