| _roots | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| _size | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| Append(const K &key) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| Append(const PAIR &pair) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0) | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| AppendAllInverse(COLLECTION2 &&other) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| BaseCollection(ARGS &&... args) | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| Contains(const PAIR &pair) const | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| ContainsAll(COLLECTION2 &&other) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) const | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE) | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| CopyFromImpl(MAP &&src, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank1) | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare >::CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0) | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| 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 > | |
| 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | static |
| GetMapKey(const PAIR &pair) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, 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 |
| 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 |
| Index 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| IntersectImpl(COLLECTION2 &&other, OverloadRank0) | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| Intersects(const COLLECTION2 &other) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| IsBurstTrieMap typedef | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| IsCollection typedef | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| IsEmpty() const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| IsPopulated() const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| 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, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| KIND | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | static |
| MapBase(ARGS &&... args) | MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | explicit |
| MapBase0(ARGS &&... args) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | explicit |
| MapType typedef | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, 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 > | |
| Node typedef | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| operator MapImpl< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() | MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| operator MapImpl< const BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > & >() const | MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| operator!=(const COLLECTION2 &other) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| operator==(const COLLECTION2 &other) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| Pool typedef | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Pool | BurstTrieMap< 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< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| SubtractImpl(COLLECTION2 &&other, OverloadRank0) | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| Super typedef | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| ToMap() | MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| ToMap() const | MapBase< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| ToString(const FormatStatement *formatStatement) const | BaseCollection< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > > > | |
| ValueIterator typedef | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| ValueType typedef | MapBase0< BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL >, K, V, POOL< BurstTrieNode< GROUP_BITS, POOL< Int, Int >::Index >, BurstTrieBucket< K, V, BUCKET_SIZE > >, DefaultCompare > | |
| ~BurstTrieMap() | BurstTrieMap< K, V, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |