HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR > Member List

This is the complete list of members for HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >, including all inherited members.

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() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Begin()HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Collection(ARGS &&... args)Collection< COLLECTION, VALUETYPE, SUPER >explicit
ConstIterator typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Contains(typename ByValueParam< T >::type value) constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Contains(const KEY &key) constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >::Contains(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
ContainsAll(COLLECTION2 &&other) constBaseCollection< COLLECTION, SUPER >
ContainsAllImpl(COLLECTION2 &&other, OverloadRank0) constSetBase0< 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() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
End()HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Erase(const T &value)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Erase(const Entry *entry)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Erase(const Iterator &it)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Find(const KEY &key)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Find(const KEY &key) constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >::Find(typename ByValueParam< VALUETYPE >::type v)Collection< COLLECTION, VALUETYPE, SUPER >
SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >::Find(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
FindIndex(typename ByValueParam< VALUETYPE >::type v) constCollection< COLLECTION, VALUETYPE, SUPER >
Flush()HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
ForEach(FN &&callback) constCollection< COLLECTION, VALUETYPE, SUPER >
ForEach(FN &&callback)Collection< COLLECTION, VALUETYPE, SUPER >
GetCount() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetHashCode() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetMap()HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetMap() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetMapKey(const VALUETYPE &key)Collection< COLLECTION, VALUETYPE, SUPER >static
GetMemorySize() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetOperationCountForSearch() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
GetUniqueHashCode() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
HashSet(const ALLOCATOR &alloc)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >explicit
HashSet()=defaultHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
HashSet(HashSet &&src)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Insert() constHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Insert(const T &value, Bool &added=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Insert(T &&value, Bool &added=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertCtor(KEY &&key, C &&constructor, Bool &created=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertEntry(const K &key, Bool &created=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertEntry(K &&key, Bool &created=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertEntry(KEY &&key, Bool &created=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertKey(const T &value, Bool &added=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertKey(T &&value, Bool &added=BoolLValue())HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
InsertLambda(KEY &&key, LAMBDA &&lambda)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
Intersect(const COLLECTION2 &other)BaseCollection< COLLECTION, SUPER >
IntersectImpl(SET &&set, OverloadRank0)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >::IntersectImpl(COLLECTION2 &&other, OverloadRank0)BaseCollection< COLLECTION, SUPER >
Intersects(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
IsBaseArray typedefBaseCollection< COLLECTION, SUPER >
IsCollection typedefBaseCollection< COLLECTION, SUPER >
IsEmpty() constBaseCollection< COLLECTION, SUPER >
IsEqual(const COLLECTION2 &other, COMPARE &&cmp=COMPARE()) constBaseCollection< COLLECTION, SUPER >
IsEqualImpl(const COLLECTION2 &other, COMPARE &&cmp, OverloadRank0) constSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
IsHashMap typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
IsHashSet typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
IsPopulated() constBaseCollection< COLLECTION, SUPER >
Iterator typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
KINDSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >static
MapType typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
MapTypeHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
MAXON_DISALLOW_COPY_AND_ASSIGN(HashSet)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >private
MAXON_OPERATOR_MOVE_ASSIGNMENT(HashSet)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
operator SetImpl< const HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > & >() constSetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >
operator SetImpl< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > & >()SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, 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) constBaseCollection< COLLECTION, SUPER >
operator==(const COLLECTION2 &other) constBaseCollection< COLLECTION, SUPER >
Reset()HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
ResizeTable(Int capacity)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
SetBase(ARGS &&... args)SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >explicit
SetBase0(ARGS &&... args)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >explicit
SetCapacityHint(Int capacity, COLLECTION_RESIZE_FLAGS resizeFlags=COLLECTION_RESIZE_FLAGS::ON_GROW_RESERVE_CAPACITY)HashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
SetType typedefSetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Subtract(COLLECTION2 &&other)BaseCollection< COLLECTION, SUPER >
SubtractImpl(COLLECTION2 &&other, OverloadRank0)SetBase0< COLLECTION, VALUETYPE, SUPER, HASH >
Super typedefHashSet< T, HASH, ENTRY_HANDLER, ALLOCATOR, MODE, INITIAL_CAPACITY, LOAD_FACTOR, ENTRY_ALLOCATOR >
ToSet()SetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >
ToSet() constSetBase< HashSet< T, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator >, T, Protected< HashMap< T, UnitType, DefaultCompare, HashMapKeyValuePair, DefaultAllocator, HASHMAP_MODE::DEFAULT, 16,(HASHMAP_MODE::DEFAULT==HASHMAP_MODE::SYNCHRONIZED) ? 0 :10, DefaultAllocator > >, DefaultCompare >
ToString(const FormatStatement *formatStatement=nullptr) constBaseCollection< COLLECTION, SUPER >
type()Collection< COLLECTION, VALUETYPE, SUPER >
ValueType typedefCollection< COLLECTION, VALUETYPE, SUPER >
VALUETYPECollection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend()Collection< COLLECTION, VALUETYPE, SUPER >
VariadicAppend(V &&value, VALUES &&... rest)Collection< COLLECTION, VALUETYPE, SUPER >