| __attribute__((always_inline)) explicit Protected(ARGS &&... args) | Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > | |
| _roots | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| _size | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| Append(typename ByValueParam< T >::type v) | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::Append(const T &key) | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | |
| Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::Append(const PAIR &pair) | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| AppendAllInverse(COLLECTION2 &&other) | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| BaseCollection(ARGS &&... args) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| BurstTrieMap() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| BurstTrieMap(Pool &&a) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | explicitprotected |
| BurstTrieMap(const Pool &a) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | explicitprotected |
| BurstTrieMap(BurstTrieMap &&src) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| Collection(ARGS &&... args) | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | explicit |
| ConstIterator typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| ConstKeyIterator typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| ConstValueIterator typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| Contains(T value) const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare >::Contains(typename ByValueParam< T >::type v) const | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::Contains(const PAIR &pair) const | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | |
| ContainsAll(COLLECTION2 &&other) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) const | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE) | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >::CopyFromImpl(MAP &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank1) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| CopyNodes(Index &dest, const BurstTrieMap &srcMap, Index src) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| DestructNodes(Index idx) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare >::Erase(const IteratorTemplate< false, SUPER > &position, Int eraseCnt=1) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Find(typename ByValueParam< T >::type v) | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| Find(typename ByValueParam< T >::type v) const | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::Find(T key) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::Find(T key) const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| FindFloor(T key) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| FindFloor(T key) const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| FindIndex(typename ByValueParam< T >::type v) const | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| FindValue(T key) const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| FindValue(T key) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| Flush() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| ForEach(FN &&callback) | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| GetCount() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetDepth() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetDepthImpl(Index idx) const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| GetHashCode() const | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| GetKeys() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetKeys() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | static |
| BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > >::GetMapKey(const PAIR &pair) | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | static |
| GetMemorySize() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetMemorySizeImpl(Index idx) const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| GetOperationCountForSearch() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetValues() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GetValues() const | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| GROUP_MASK | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protectedstatic |
| GROUP_SIZE | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protectedstatic |
| Index typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare >::Insert(T key, const UnitType &value, Bool &created=BoolLValue()) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare >::Insert(T key, UnitType &&value, Bool &created=BoolLValue()) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| InsertEntry(T key, Bool &created=BoolLValue()) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| InsertKey(T value, Bool &added=BoolLValue()) | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Intersect(const COLLECTION2 &other) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| IntersectImpl(COLLECTION2 &&other, OverloadRank0) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| Intersects(const COLLECTION2 &other) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| IsEmpty() const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| IsPopulated() const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| Iterator typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| KeyIterator typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| KeyType typedef | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| KIND | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | static |
| MapBase(ARGS &&... args) | MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | explicitprotected |
| MapBase0(ARGS &&... args) | MapBase0< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | explicitprotected |
| MapType typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| MapType | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| MAX_LEN | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protectedstatic |
| 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare >::MAXON_OPERATOR_MOVE_ASSIGNMENT(BurstTrieMap) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Node typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| operator MapImpl< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() | MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| operator MapImpl< const BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() const | MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| operator SetImpl< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() | SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| operator SetImpl< const BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() const | SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| operator ValueReceiver< const T & >() | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| operator ValueReceiver< T && >() | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| operator ValueReceiver< typename std::conditional< std::is_scalar< T >::value, T, DummyParamType & >::type >() | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| operator!=(const COLLECTION2 &other) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| operator==(const COLLECTION2 &other) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| Pool typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| Pool | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| Reset() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| SetBase(ARGS &&... args) | SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | explicit |
| SetBase0(ARGS &&... args) | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | explicit |
| SetCapacityHint(Int, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| SetType typedef | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| Subtract(COLLECTION2 &&other) | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| SubtractImpl(COLLECTION2 &&other, OverloadRank0) | SetBase0< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| Super typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| ToMap() | MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| ToMap() const | MapBase< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, UnitType, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< T, UnitType, BUCKET_SIZE > >, DefaultCompare > | protected |
| ToSet() | SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| ToSet() const | SetBase< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > >, DefaultCompare > | |
| ToString(const FormatStatement *formatStatement) const | BaseCollection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| ValueIterator typedef | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |
| ValueType typedef | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| VariadicAppend() | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| VariadicAppend(V &&value, VALUES &&... rest) | Collection< BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, T, Protected< BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > > > | |
| ~BurstTrieMap() | BurstTrieMap< T, UnitType, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | protected |