| Add(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| Append(typename ByValueParam< VALUETYPE >::type v) | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| AppendAll(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| AppendAllImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, Bool overwrite, OverloadRank0) | BaseCollection< COLLECTION, SUPER > | |
| BaseCollection(ARGS &&... args) | BaseCollection< COLLECTION, SUPER > | explicit |
| Begin() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Begin() | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| BurstTrieSet() | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| BurstTrieSet(BurstTrieSet &&src) | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Collection(ARGS &&... args) | Collection< COLLECTION, VALUETYPE, SUPER > | explicit |
| ConstIterator typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| 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< VALUETYPE >::type v) const | Collection< COLLECTION, VALUETYPE, SUPER > | |
| ContainsAll(COLLECTION2 &&other) const | BaseCollection< COLLECTION, SUPER > | |
| ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) const | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| CopyFrom(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::FIT_TO_SIZE) | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| CopyFromImpl(COLLECTION2 &&other, COLLECTION_RESIZE_FLAGS resizeFlags, OverloadRank0) | BaseCollection< COLLECTION, SUPER > | |
| 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 > | |
| 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< VALUETYPE >::type v) | Collection< COLLECTION, VALUETYPE, SUPER > | |
| 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< VALUETYPE >::type v) const | Collection< COLLECTION, VALUETYPE, SUPER > | |
| FindIndex(typename ByValueParam< VALUETYPE >::type v) const | Collection< COLLECTION, VALUETYPE, SUPER > | |
| Flush() | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| ForEach(FN &&callback) const | Collection< COLLECTION, VALUETYPE, SUPER > | |
| ForEach(FN &&callback) | Collection< COLLECTION, VALUETYPE, SUPER > | |
| GetCount() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| GetHashCode() const | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| GetMap() | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| GetMap() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| GetMapKey(const VALUETYPE &key) | Collection< COLLECTION, VALUETYPE, SUPER > | static |
| GetMemorySize() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| GetOperationCountForSearch() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| GetUniqueHashCode() const | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| Insert() const | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Insert(T value, Bool &added=BoolLValue()) | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| InsertKey(T value, Bool &added=BoolLValue()) | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| Intersect(const COLLECTION2 &other) | BaseCollection< COLLECTION, SUPER > | |
| IntersectImpl(COLLECTION2 &&other, OverloadRank0) | BaseCollection< COLLECTION, SUPER > | |
| Intersects(const COLLECTION2 &other) const | BaseCollection< COLLECTION, SUPER > | |
| IsBaseArray typedef | BaseCollection< COLLECTION, SUPER > | |
| IsBurstTrieMap typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| IsBurstTrieSet typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| IsCollection typedef | BaseCollection< COLLECTION, SUPER > | |
| IsEmpty() const | BaseCollection< COLLECTION, SUPER > | |
| IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) const | BaseCollection< COLLECTION, SUPER > | |
| IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) const | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| IsPopulated() const | BaseCollection< COLLECTION, SUPER > | |
| Iterator typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| KIND | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | static |
| MapType typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| MapType | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| 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 > | |
| 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 VALUETYPE & >() | Collection< COLLECTION, VALUETYPE, SUPER > | |
| operator ValueReceiver< typename std::conditional< STD_IS_REPLACEMENT(scalar, VALUETYPE) | Collection< COLLECTION, VALUETYPE, SUPER > | |
| operator ValueReceiver< VALUETYPE && >() | Collection< COLLECTION, VALUETYPE, SUPER > | |
| operator!=(const COLLECTION2 &other) const | BaseCollection< COLLECTION, SUPER > | |
| operator==(const COLLECTION2 &other) const | BaseCollection< COLLECTION, SUPER > | |
| Reset() | 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< COLLECTION, VALUETYPE, SUPER, HASH > | explicit |
| SetCapacityHint(Int, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY) | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | |
| SetType typedef | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| Subtract(COLLECTION2 &&other) | BaseCollection< COLLECTION, SUPER > | |
| SubtractImpl(COLLECTION2 &&other, OverloadRank0) | SetBase0< COLLECTION, VALUETYPE, SUPER, HASH > | |
| Super typedef | BurstTrieSet< T, GROUP_BITS, BUCKET_SIZE, SORT, POOL > | private |
| 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< COLLECTION, SUPER > | |
| type() | Collection< COLLECTION, VALUETYPE, SUPER > | |
| VALUETYPE | Collection< COLLECTION, VALUETYPE, SUPER > | |
| ValueType typedef | Collection< COLLECTION, VALUETYPE, SUPER > | |
| VariadicAppend() | Collection< COLLECTION, VALUETYPE, SUPER > | |
| VariadicAppend(V &&value, VALUES &&... rest) | Collection< COLLECTION, VALUETYPE, SUPER > | |