|
__attribute__
((always_inline)) explicit Protected(ARGS &&... args)
|
Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >
|
|
|
_roots
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
_size
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
添加
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
AllocBucket
(Index &index)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
AllocNode
(Index &index)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
Append
(typename ByValueParam< T >::type v)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::Append
(const T &key)
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
|
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::Append
(const PAIR &pair)
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
|
|
AppendAll
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
AppendAllImpl
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
AppendAllInverse
(COLLECTION2 &&other)
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
BaseCollection
(ARGS &&... args)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
explicit
|
|
Begin
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Begin
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Bucket
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
BurstTrieMap
()
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
BurstTrieMap
(Pool &&a)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
explicit
protected
|
|
BurstTrieMap
(const Pool &a)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
explicit
protected
|
|
BurstTrieMap
(BurstTrieMap &&src)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
BurstTrieSet
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
BurstTrieSet
(BurstTrieSet &&src)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ClearRoots
()
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
Collection
(ARGS &&... args)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
explicit
|
|
ConstIterator
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ConstKeyIterator
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
ConstValueIterator
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
Contains
(T value) const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Contains
(typename ByValueParam< T >::type v) const
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::Contains
(const PAIR &pair) const
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
|
|
ContainsAll
(COLLECTION2 &&other) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
ContainsAllImpl
(COLLECTION2 &&other, OverloadRank0) const
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
CopyFrom
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
CopyFromImpl
(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >::CopyFromImpl
(MAP &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank1)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
CopyNodes
(Index &dest, const BurstTrieMap &srcMap, Index src)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
DestructNodes
(Index idx)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
End
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
End
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Erase
(T value)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Erase
(const Iterator &it)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Erase
(const IteratorTemplate< false, SUPER > &position, Int eraseCnt=1)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
Find
(K key)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Find
(K key) const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Find
(typename ByValueParam< T >::type v)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Find
(typename ByValueParam< T >::type v) const
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::Find
(T key)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::Find
(T key) const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
FindFloor
(T key)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
FindFloor
(T key) const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
FindIndex
(typename ByValueParam< T >::type v) const
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
FindValue
(T key) const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
FindValue
(T key)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
Flush
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
ForEach
(FN &&callback) const
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
ForEach
(FN &&callback)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
FreeBucket
(Index i)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
FreeNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
GetBucket
(Index i)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
GetCount
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetDepth
() const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
GetDepthImpl
(Index idx) const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
GetHashCode
() const
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
GetKeys
()
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
GetKeys
() const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
GetMap
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetMap
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetMapKey
(const T &key)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
static
|
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >::GetMapKey
(const PAIR &pair)
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
static
|
|
GetMemorySize
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetMemorySizeImpl
(Index idx) const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
GetNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
GetOperationCountForSearch
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
GetValues
()
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
GetValues
() const
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
GROUP_MASK
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
static
|
|
GROUP_SIZE
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
static
|
|
索引
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
Insert
() const
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Insert
(T value, Bool &added=BoolLValue())
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Insert
(T key, const UnitType &value, Bool &created=BoolLValue())
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::Insert
(T key, UnitType &&value, Bool &created=BoolLValue())
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
InsertEntry
(T key, Bool &created=BoolLValue())
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
InsertKey
(T value, Bool &added=BoolLValue())
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
Intersect
(const COLLECTION2 &other)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
IntersectImpl
(COLLECTION2 &&other, OverloadRank0)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
Intersects
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
IsBurstTrieMap
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
IsBurstTrieSet
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
IsCollection
typedef
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
IsEmpty
() const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
IsEqual
(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
IsEqualImpl
(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
IsNode
(Index i)
|
PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >
|
protected
static
|
|
IsPopulated
() const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
Iterator
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
KeyIterator
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
KeyType
typedef
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
KIND
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
static
|
|
MapBase
(ARGS &&... args)
|
MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
explicit
protected
|
|
MapBase0
(ARGS &&... args)
|
MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
explicit
protected
|
|
MapType
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
MapType
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
MAX_LEN
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
static
|
|
MAXON_DISALLOW_COPY_AND_ASSIGN
(BurstTrieSet)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
MAXON_OPERATOR_MOVE_ASSIGNMENT
(BurstTrieSet)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::MAXON_OPERATOR_MOVE_ASSIGNMENT
(BurstTrieMap)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
节点
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
operator MapImpl< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool > & >
()
|
MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
operator MapImpl< const BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool > & >
() const
|
MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
operator SetImpl< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > & >
()
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
operator SetImpl< const BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > & >
() const
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
operator ValueReceiver< const T & >
()
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
operator ValueReceiver< T && >
()
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
operator ValueReceiver< typename std::conditional< STD_IS_REPLACEMENT
(scalar, T)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
operator!=
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
operator==
(const COLLECTION2 &other) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
Pool
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
Pool
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
private
|
|
重置
()
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase
(ARGS &&... args)
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
explicit
|
|
SetBase0
(ARGS &&... args)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
explicit
|
|
SetCapacityHint
(Int, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
|
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >::SetCapacityHint
(Int, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
|
|
SetType
typedef
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
Subtract
(COLLECTION2 &&other)
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
SubtractImpl
(COLLECTION2 &&other, OverloadRank0)
|
SetBase0< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
Super
typedef
|
BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >
|
private
|
|
ToMap
()
|
MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
ToMap
() const
|
MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, PointerBurstTriePool >, T, UnitType, PointerBurstTriePool< BurstTrieNode< GROUP_BITS, PointerBurstTriePool< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare >
|
protected
|
|
ToSet
()
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
ToSet
() const
|
SetBase< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > >, DefaultCompare >
|
|
|
ToString
(const FormatStatement *formatStatement=nullptr) const
|
BaseCollection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
type
()
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
ValueIterator
typedef
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
|
VALUETYPE
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
ValueType
typedef
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
VariadicAppend
()
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
VariadicAppend
(V &&value, VALUES &&... rest)
|
Collection< BurstTrieSet< T, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >, T, Protected< BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool > > >
|
|
|
~BurstTrieMap
()
|
BurstTrieMap< T, UnitType, 4, 16, BURSTTRIE_SORT::LINEAR_SEARCH, PointerBurstTriePool >
|
protected
|
