|
_roots
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
_size
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
添加
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
AllocBucket
(Index &index)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
AllocNode
(Index &index)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
Append
(const K &key)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
Append
(const PAIR &pair)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
AppendAll
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
AppendAllImpl
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
AppendAllInverse
(COLLECTION2 &&other)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
BaseCollection
(ARGS &&... args)
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
explicit
|
|
Begin
()
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Begin
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Bucket
typedef
|
BurstTrieMap< 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
class
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
friend
|
|
ClearRoots
()
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
ConstIterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ConstKeyIterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ConstValueIterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Contains
(typename ByValueParam< K >::type key) const
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
Contains
(const PAIR &pair) const
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
ContainsAll
(COLLECTION2 &&other) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
ContainsAllImpl
(COLLECTION2 &&other, OverloadRank0) const
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
CopyFrom
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
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< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
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
() const
|
BurstTrieMap< 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) const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
FindFloor
(K key)
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
FindFloor
(K key) const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
FindValue
(K key) const
|
BurstTrieMap< 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 >
|
|
|
FreeBucket
(Index i)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
FreeNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
GetBucket
(Index i)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
GetCount
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetDepth
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetDepthImpl
(Index idx) const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
GetHashCode
() const
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
GetKeys
()
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetKeys
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetMapKey
(const K &key)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
static
|
|
GetMapKey
(const PAIR &pair)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
static
|
|
GetMemorySize
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetMemorySizeImpl
(Index idx) const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
GetNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
GetOperationCountForSearch
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetValues
()
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetValues
() const
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GROUP_MASK
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
static
|
|
GROUP_SIZE
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
static
|
|
索引
typedef
|
BurstTrieMap< 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< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
IntersectImpl
(COLLECTION2 &&other, OverloadRank0)
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
Intersects
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
IsBurstTrieMap
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
IsCollection
typedef
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
IsEmpty
() const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
IsEqual
(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
IsEqualImpl
(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
IsNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >
|
static
|
|
IsPopulated
() const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
Iterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
KeyIterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
KeyType
typedef
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
KIND
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
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< 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
|
|
MapType
typedef
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
MAX_LEN
|
BurstTrieMap< 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 >
|
|
|
节点
typedef
|
BurstTrieMap< 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 > & >
() const
|
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!=
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
operator==
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
Pool
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Pool
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
重置
()
|
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< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
SubtractImpl
(COLLECTION2 &&other, OverloadRank0)
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
Super
typedef
|
BurstTrieMap< 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
() const
|
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 >
|
|
|
ToString
(const FormatStatement *formatStatement=nullptr) const
|
BaseCollection< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > > >
|
|
|
ValueIterator
typedef
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ValueType
typedef
|
MapBase0< BurstTrieMap< K, V, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, K, V, PointerBurstTriePool< BurstTrieNode< 4, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< K, V, 16 > >, DefaultCompare >
|
|
|
~BurstTrieMap
()
|
BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
