#include <Set.h>

Collaboration diagram for TSet< InElementType, KeyFuncs, Allocator >:

Classes
class	FElementCompareClass

class	TBaseIterator

class	TBaseKeyIterator

class	TConstIterator

class	TConstKeyIterator

class	TIterator

class	TKeyIterator

Public Types
typedef InElementType	ElementType

typedef KeyFuncs	KeyFuncsType

typedef Allocator	AllocatorType

using	SizeType = typename Allocator::SparseArrayAllocator::ElementAllocator::SizeType

using	TRangedForConstIterator = TBaseIterator<true, true>

using	TRangedForIterator = TBaseIterator<false, true>

Public Member Functions
FORCEINLINE	TSet ()

FORCEINLINE	TSet (const TSet &Copy)

FORCEINLINE	TSet (const TArray< ElementType > &InArray)

FORCEINLINE	TSet (TArray< ElementType > &&InArray)

FORCEINLINE	~TSet ()

TSet &	operator= (const TSet &Copy)

	TSet (std::initializer_list< ElementType > InitList)

	TSet (TSet &&Other)

TSet &	operator= (TSet &&Other)

template<typename OtherAllocator >
	TSet (TSet< ElementType, KeyFuncs, OtherAllocator > &&Other)

template<typename OtherAllocator >
	TSet (const TSet< ElementType, KeyFuncs, OtherAllocator > &Other)

template<typename OtherAllocator >
TSet &	operator= (TSet< ElementType, KeyFuncs, OtherAllocator > &&Other)

template<typename OtherAllocator >
TSet &	operator= (const TSet< ElementType, KeyFuncs, OtherAllocator > &Other)

TSet &	operator= (std::initializer_list< ElementType > InitList)

void	Empty (int32 ExpectedNumElements=0)

void	Reset ()

FORCEINLINE void	Shrink ()

FORCEINLINE void	Compact ()

FORCEINLINE void	CompactStable ()

FORCEINLINE void	Reserve (int32 Number)

FORCEINLINE void	Relax ()

FORCEINLINE SIZE_T	GetAllocatedSize (void) const

FORCEINLINE void	CountBytes (FArchive &Ar) const

bool	IsEmpty () const

FORCEINLINE int32	Num () const

FORCEINLINE int32	GetMaxIndex () const

FORCEINLINE bool	IsValidId (FSetElementId Id) const

FORCEINLINE ElementType &	operator[] (FSetElementId Id)

FORCEINLINE const ElementType &	operator[] (FSetElementId Id) const

FORCEINLINE FSetElementId	Add (const InElementType &InElement, bool *bIsAlreadyInSetPtr=nullptr)

FORCEINLINE FSetElementId	Add (InElementType &&InElement, bool *bIsAlreadyInSetPtr=nullptr)

FORCEINLINE ElementType &	FindOrAdd (const InElementType &InElement, bool *bIsAlreadyInSetPtr=nullptr)

FORCEINLINE ElementType &	FindOrAdd (InElementType &&InElement, bool *bIsAlreadyInSetPtr=nullptr)

FORCEINLINE FSetElementId	AddByHash (uint32 KeyHash, const InElementType &InElement, bool *bIsAlreadyInSetPtr=nullptr)

FORCEINLINE FSetElementId	AddByHash (uint32 KeyHash, InElementType &&InElement, bool *bIsAlreadyInSetPtr=nullptr)

template<typename ElementReferenceType >
ElementType &	FindOrAddByHash (uint32 KeyHash, ElementReferenceType &&InElement, bool *bIsAlreadyInSetPtr=nullptr)

template<typename ArgsType = ElementType>
FSetElementId	Emplace (ArgsType &&Args, bool *bIsAlreadyInSetPtr=nullptr)

template<typename ArgsType = ElementType>
FSetElementId	EmplaceByHash (uint32 KeyHash, ArgsType &&Args, bool *bIsAlreadyInSetPtr=nullptr)

template<typename ViewSizeType >
void	Append (TArrayView< ElementType, ViewSizeType > InElements)

template<typename ViewSizeType >
void	Append (TArrayView< const ElementType, ViewSizeType > InElements)

template<typename ArrayAllocator >
void	Append (const TArray< ElementType, ArrayAllocator > &InElements)

template<typename ArrayAllocator >
void	Append (TArray< ElementType, ArrayAllocator > &&InElements)

template<typename OtherAllocator >
void	Append (const TSet< ElementType, KeyFuncs, OtherAllocator > &OtherSet)

template<typename OtherAllocator >
void	Append (TSet< ElementType, KeyFuncs, OtherAllocator > &&OtherSet)

void	Append (std::initializer_list< ElementType > InitList)

void	Remove (FSetElementId ElementId)

FSetElementId	FindId (KeyInitType Key) const

template<typename ComparableKey >
FSetElementId	FindIdByHash (uint32 KeyHash, const ComparableKey &Key) const

FORCEINLINE ElementType *	Find (KeyInitType Key)

FORCEINLINE const ElementType *	Find (KeyInitType Key) const

template<typename ComparableKey >
ElementType *	FindByHash (uint32 KeyHash, const ComparableKey &Key)

template<typename ComparableKey >
const ElementType *	FindByHash (uint32 KeyHash, const ComparableKey &Key) const

int32	Remove (KeyInitType Key)

template<typename ComparableKey >
int32	RemoveByHash (uint32 KeyHash, const ComparableKey &Key)

FORCEINLINE bool	Contains (KeyInitType Key) const

template<typename ComparableKey >
FORCEINLINE bool	ContainsByHash (uint32 KeyHash, const ComparableKey &Key) const

template<typename PREDICATE_CLASS >
void	Sort (const PREDICATE_CLASS &Predicate)

template<typename PREDICATE_CLASS >
void	StableSort (const PREDICATE_CLASS &Predicate)

void	SortFreeList ()

void	Dump (FOutputDevice &Ar)

bool	VerifyHashElementsKey (KeyInitType Key)

void	DumpHashElements (FOutputDevice &Ar)

TSet	Intersect (const TSet &OtherSet) const

TSet	Union (const TSet &OtherSet) const

TSet	Difference (const TSet &OtherSet) const

bool	Includes (const TSet< ElementType, KeyFuncs, Allocator > &OtherSet) const

TArray< ElementType >	Array () const

FORCEINLINE void	CheckAddress (const ElementType *Addr) const

template<typename OtherKeyFuncs , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>
TSet &	operator= (TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, Allocator > &&Other)

template<typename OtherKeyFuncs , typename OtherAllocator , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>
TSet &	operator= (const TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, OtherAllocator > &Other)

template<typename OtherKeyFuncs , typename OtherAllocator , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>
void	Append (const TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, OtherAllocator > &OtherSet)

template<typename OtherKeyFuncs , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>
void	Append (TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, Allocator > &&OtherSet)

void	WriteMemoryImage (FMemoryImageWriter &Writer) const

void	CopyUnfrozen (const FMemoryUnfreezeContent &Context, void *Dst) const

FORCEINLINE TIterator	CreateIterator ()

FORCEINLINE TConstIterator	CreateConstIterator () const

FORCEINLINE TRangedForIterator	begin ()

FORCEINLINE TRangedForConstIterator	begin () const

FORCEINLINE TRangedForIterator	end ()

FORCEINLINE TRangedForConstIterator	end () const

Static Public Member Functions
static void	AppendHash (const FPlatformTypeLayoutParameters &LayoutParams, FSHA1 &Hasher)

Private Types
typedef KeyFuncs::KeyInitType	KeyInitType

typedef KeyFuncs::ElementInitType	ElementInitType

typedef TSetElement< InElementType >	SetElementType

using	ElementArrayType = TSparseArray<SetElementType, typename Allocator::SparseArrayAllocator>

using	HashType = typename Allocator::HashAllocator::template ForElementType<FSetElementId>

Private Member Functions
bool	TryReplaceExisting (uint32 KeyHash, SetElementType &Element, SizeType &InOutElementIndex, bool *bIsAlreadyInSetPtr)

FORCEINLINE void	RehashOrLink (uint32 KeyHash, SetElementType &Element, SizeType ElementIndex)

void	RemoveByIndex (SizeType ElementIndex)

template<typename ComparableKey >
SizeType	FindIndexByHash (uint32 KeyHash, const ComparableKey &Key) const

template<typename ComparableKey >
FORCEINLINE int32	RemoveImpl (uint32 KeyHash, const ComparableKey &Key)

FORCEINLINE FSetElementId &	GetTypedHash (int32 HashIndex) const

FORCEINLINE void	LinkElement (SizeType ElementIndex, const SetElementType &Element, uint32 KeyHash) const

FORCEINLINE void	HashElement (SizeType ElementIndex, const SetElementType &Element) const

void	UnhashElements ()

FORCEINLINE bool	ShouldRehash (int32 NumHashedElements, int32 DesiredHashSize, bool bAllowShrinking=false) const

bool	ConditionalRehash (int32 NumHashedElements, bool bAllowShrinking=false) const

void	Rehash () const

Static Private Member Functions
template<typename SetType >
static FORCEINLINE void	Move (SetType &ToSet, SetType &FromSet)

Private Attributes
ElementArrayType	Elements

HashType	Hash

int32	HashSize

Friends
template<typename , typename >
class	TScriptSet

struct	TSetPrivateFriend

Detailed Description

template<typename InElementType, typename KeyFuncs, typename Allocator>
class TSet< InElementType, KeyFuncs, Allocator >

A set with an optional KeyFuncs parameters for customizing how the elements are compared and searched.
E.g. You can specify a mapping from elements to keys if you want to find elements by specifying a subset of the element type. It uses a TSparseArray of the elements, and also links the elements into a hash with a number of buckets proportional to the number of elements. Addition, removal, and finding are O(1).

The ByHash() functions are somewhat dangerous but particularly useful in two scenarios: – Heterogeneous lookup to avoid creating expensive keys like FString when looking up by const TCHAR*. You must ensure the hash is calculated in the same way as ElementType is hashed. If possible put both ComparableKey and ElementType hash functions next to each other in the same header to avoid bugs when the ElementType hash function is changed. – Reducing contention around hash tables protected by a lock. It is often important to incur the cache misses of reading key data and doing the hashing before acquiring the lock.

Definition at line 281 of file Set.h.

Member Typedef Documentation

◆ AllocatorType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef Allocator TSet< InElementType, KeyFuncs, Allocator >::AllocatorType

Definition at line 286 of file Set.h.

◆ ElementArrayType

template<typename InElementType , typename KeyFuncs , typename Allocator >

using TSet< InElementType, KeyFuncs, Allocator >::ElementArrayType = TSparseArray<SetElementType, typename Allocator::SparseArrayAllocator>

private

Definition at line 1376 of file Set.h.

◆ ElementInitType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef KeyFuncs::ElementInitType TSet< InElementType, KeyFuncs, Allocator >::ElementInitType

private

Definition at line 297 of file Set.h.

◆ ElementType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef InElementType TSet< InElementType, KeyFuncs, Allocator >::ElementType

Definition at line 284 of file Set.h.

◆ HashType

template<typename InElementType , typename KeyFuncs , typename Allocator >

using TSet< InElementType, KeyFuncs, Allocator >::HashType = typename Allocator::HashAllocator::template ForElementType<FSetElementId>

private

Definition at line 1377 of file Set.h.

◆ KeyFuncsType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef KeyFuncs TSet< InElementType, KeyFuncs, Allocator >::KeyFuncsType

Definition at line 285 of file Set.h.

◆ KeyInitType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef KeyFuncs::KeyInitType TSet< InElementType, KeyFuncs, Allocator >::KeyInitType

private

Definition at line 296 of file Set.h.

◆ SetElementType

template<typename InElementType , typename KeyFuncs , typename Allocator >

typedef TSetElement<InElementType> TSet< InElementType, KeyFuncs, Allocator >::SetElementType

private

Definition at line 299 of file Set.h.

◆ SizeType

template<typename InElementType , typename KeyFuncs , typename Allocator >

using TSet< InElementType, KeyFuncs, Allocator >::SizeType = typename Allocator::SparseArrayAllocator::ElementAllocator::SizeType

Definition at line 288 of file Set.h.

◆ TRangedForConstIterator

template<typename InElementType , typename KeyFuncs , typename Allocator >

using TSet< InElementType, KeyFuncs, Allocator >::TRangedForConstIterator = TBaseIterator<true, true>

Definition at line 1710 of file Set.h.

◆ TRangedForIterator

template<typename InElementType , typename KeyFuncs , typename Allocator >

using TSet< InElementType, KeyFuncs, Allocator >::TRangedForIterator = TBaseIterator<false, true>

Definition at line 1711 of file Set.h.

Constructor & Destructor Documentation

◆ TSet() [1/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TSet< InElementType, KeyFuncs, Allocator >::TSet ( )

inline

Initialization constructor.

Definition at line 303 of file Set.h.

◆ TSet() [2/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TSet< InElementType, KeyFuncs, Allocator >::TSet ( const TSet< InElementType, KeyFuncs, Allocator > & Copy )

inline

Copy constructor.

Definition at line 308 of file Set.h.

◆ TSet() [3/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TSet< InElementType, KeyFuncs, Allocator >::TSet ( const TArray< ElementType > & InArray )

inlineexplicit

Definition at line 314 of file Set.h.

◆ TSet() [4/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TSet< InElementType, KeyFuncs, Allocator >::TSet ( TArray< ElementType > && InArray )

inlineexplicit

Definition at line 320 of file Set.h.

◆ ~TSet()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TSet< InElementType, KeyFuncs, Allocator >::~TSet ( )

inline

Destructor.

Definition at line 327 of file Set.h.

◆ TSet() [5/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet< InElementType, KeyFuncs, Allocator >::TSet ( std::initializer_list< ElementType > InitList )

inline

Initializer list constructor.

Definition at line 363 of file Set.h.

◆ TSet() [6/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet< InElementType, KeyFuncs, Allocator >::TSet ( TSet< InElementType, KeyFuncs, Allocator > && Other )

inline

Move constructor.

Definition at line 370 of file Set.h.

◆ TSet() [7/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

TSet< InElementType, KeyFuncs, Allocator >::TSet ( TSet< ElementType, KeyFuncs, OtherAllocator > && Other )

inline

Constructor for moving elements from a TSet with a different SetAllocator

Definition at line 389 of file Set.h.

◆ TSet() [8/8]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

TSet< InElementType, KeyFuncs, Allocator >::TSet ( const TSet< ElementType, KeyFuncs, OtherAllocator > & Other )

inline

Constructor for copying elements from a TSet with a different SetAllocator

Definition at line 397 of file Set.h.

Member Function Documentation

◆ Add() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE FSetElementId TSet< InElementType, KeyFuncs, Allocator >::Add	(	const InElementType &	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set.

Parameters

InElement	Element to add to set
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A pointer to the element stored in the set.

Definition at line 596 of file Set.h.

◆ Add() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE FSetElementId TSet< InElementType, KeyFuncs, Allocator >::Add	(	InElementType &&	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Definition at line 597 of file Set.h.

◆ AddByHash() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE FSetElementId TSet< InElementType, KeyFuncs, Allocator >::AddByHash	(	uint32	KeyHash,
		const InElementType &	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set.

See also: Class documentation section on ByHash() functions

Parameters

InElement	Element to add to set
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A handle to the element stored in the set

Definition at line 623 of file Set.h.

◆ AddByHash() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE FSetElementId TSet< InElementType, KeyFuncs, Allocator >::AddByHash	(	uint32	KeyHash,
		InElementType &&	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Definition at line 627 of file Set.h.

◆ Append() [1/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ArrayAllocator >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( const TArray< ElementType, ArrayAllocator > & InElements )

inline

Definition at line 774 of file Set.h.

◆ Append() [2/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( const TSet< ElementType, KeyFuncs, OtherAllocator > & OtherSet )

inline

Add all items from another set to our set (union without creating a new set)

Parameters

OtherSet - The other set of items to add.

Definition at line 799 of file Set.h.

◆ Append() [3/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherKeyFuncs , typename OtherAllocator , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>

void TSet< InElementType, KeyFuncs, Allocator >::Append ( const TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, OtherAllocator > & OtherSet )

inline

Add all items from another set to our set (union without creating a new set) Compatible element type version.

Parameters

OtherSet - The other set of items to add.

Definition at line 1327 of file Set.h.

◆ Append() [4/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( std::initializer_list< ElementType > InitList )

inline

Definition at line 819 of file Set.h.

◆ Append() [5/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ArrayAllocator >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( TArray< ElementType, ArrayAllocator > && InElements )

inline

Definition at line 784 of file Set.h.

◆ Append() [6/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ViewSizeType >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( TArrayView< const ElementType, ViewSizeType > InElements )

inline

Definition at line 764 of file Set.h.

◆ Append() [7/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ViewSizeType >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( TArrayView< ElementType, ViewSizeType > InElements )

inline

Definition at line 754 of file Set.h.

◆ Append() [8/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

void TSet< InElementType, KeyFuncs, Allocator >::Append ( TSet< ElementType, KeyFuncs, OtherAllocator > && OtherSet )

inline

Definition at line 809 of file Set.h.

◆ Append() [9/9]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherKeyFuncs , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>

void TSet< InElementType, KeyFuncs, Allocator >::Append ( TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, Allocator > && OtherSet )

inline

Add all items from another set to our set (union without creating a new set) Compatible element type version.

Parameters

OtherSet - The other set of items to add.

Definition at line 1347 of file Set.h.

◆ AppendHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

static void TSet< InElementType, KeyFuncs, Allocator >::AppendHash	(	const FPlatformTypeLayoutParameters &	LayoutParams,
		FSHA1 &	Hasher )

inlinestatic

Definition at line 1418 of file Set.h.

◆ Array()

template<typename InElementType , typename KeyFuncs , typename Allocator >

TArray< ElementType > TSet< InElementType, KeyFuncs, Allocator >::Array ( ) const

inline

Returns: a TArray of the elements

Definition at line 1254 of file Set.h.

◆ begin() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TRangedForIterator TSet< InElementType, KeyFuncs, Allocator >::begin ( )

inline

DO NOT USE DIRECTLY STL-like iterators to enable range-based for loop support.

Definition at line 1769 of file Set.h.

◆ begin() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TRangedForConstIterator TSet< InElementType, KeyFuncs, Allocator >::begin ( ) const

inline

Definition at line 1770 of file Set.h.

◆ CheckAddress()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::CheckAddress ( const ElementType * Addr ) const

inline

Checks that the specified address is not part of an element within the container. Used for implementations to check that reference arguments aren't going to be invalidated by possible reallocation.

Parameters

Addr	The address to check.

Definition at line 1271 of file Set.h.

◆ Compact()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::Compact ( )

inline

Compacts the allocated elements into a contiguous range.

Definition at line 476 of file Set.h.

◆ CompactStable()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::CompactStable ( )

inline

Compacts the allocated elements into a contiguous range. Does not change the iteration order of the elements.

Definition at line 486 of file Set.h.

◆ ConditionalRehash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

bool TSet< InElementType, KeyFuncs, Allocator >::ConditionalRehash	(	int32	NumHashedElements,
		bool	bAllowShrinking = false ) const

inlineprivate

Checks if the hash has an appropriate number of buckets, and if not resizes it.

Parameters

NumHashedElements	- The number of elements to size the hash for.
bAllowShrinking	- true if the hash is allowed to shrink.

Returns: true if the set was rehashed.

Definition at line 1491 of file Set.h.

◆ Contains()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE bool TSet< InElementType, KeyFuncs, Allocator >::Contains ( KeyInitType Key ) const

inline

Checks if the element contains an element with the given key.

Parameters

Key	- The key to check for.

Returns: true if the set contains an element with the given key.

Definition at line 1050 of file Set.h.

◆ ContainsByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

FORCEINLINE bool TSet< InElementType, KeyFuncs, Allocator >::ContainsByHash	(	uint32	KeyHash,
		const ComparableKey &	Key ) const

inline

Checks if the element contains an element with the given key.

See also: Class documentation section on ByHash() functions

Definition at line 1061 of file Set.h.

◆ CopyUnfrozen()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::CopyUnfrozen	(	const FMemoryUnfreezeContent &	Context,
		void *	Dst ) const

inline

Definition at line 1400 of file Set.h.

◆ CountBytes()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::CountBytes ( FArchive & Ar ) const

inline

Tracks the container's memory use through an archive.

Definition at line 535 of file Set.h.

◆ CreateConstIterator()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TConstIterator TSet< InElementType, KeyFuncs, Allocator >::CreateConstIterator ( ) const

inline

Creates a const iterator for the contents of this set

Definition at line 1757 of file Set.h.

◆ CreateIterator()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TIterator TSet< InElementType, KeyFuncs, Allocator >::CreateIterator ( )

inline

Creates an iterator for the contents of this set

Definition at line 1751 of file Set.h.

◆ Difference()

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet TSet< InElementType, KeyFuncs, Allocator >::Difference ( const TSet< InElementType, KeyFuncs, Allocator > & OtherSet ) const

inline

Returns: the complement of two sets. (A not in B where A is this and B is Other)

Definition at line 1209 of file Set.h.

◆ Dump()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Dump ( FOutputDevice & Ar )

inline

Describes the set's contents through an output device.

Parameters

Ar	- The output device to describe the set's contents through.

Definition at line 1108 of file Set.h.

◆ DumpHashElements()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::DumpHashElements ( FOutputDevice & Ar )

inline

Definition at line 1147 of file Set.h.

◆ Emplace()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ArgsType = ElementType>

FSetElementId TSet< InElementType, KeyFuncs, Allocator >::Emplace	(	ArgsType &&	Args,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set.

Parameters

Args	The argument(s) to be forwarded to the set element's constructor.
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A handle to the element stored in the set.

Definition at line 713 of file Set.h.

◆ EmplaceByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ArgsType = ElementType>

FSetElementId TSet< InElementType, KeyFuncs, Allocator >::EmplaceByHash	(	uint32	KeyHash,
		ArgsType &&	Args,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set.

See also: Class documentation section on ByHash() functions

Parameters

Args	The argument(s) to be forwarded to the set element's constructor.
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A handle to the element stored in the set.

Definition at line 738 of file Set.h.

◆ Empty()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Empty ( int32 ExpectedNumElements = 0 )

inline

Removes all elements from the set, potentially leaving space allocated for an expected number of elements about to be added.

Parameters

ExpectedNumElements - The number of elements about to be added to the set.

Definition at line 433 of file Set.h.

◆ end() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TRangedForIterator TSet< InElementType, KeyFuncs, Allocator >::end ( )

inline

Definition at line 1771 of file Set.h.

◆ end() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE TRangedForConstIterator TSet< InElementType, KeyFuncs, Allocator >::end ( ) const

inline

Definition at line 1772 of file Set.h.

◆ Find() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE ElementType * TSet< InElementType, KeyFuncs, Allocator >::Find ( KeyInitType Key )

inline

Finds an element with the given key in the set.

Parameters

Key	- The key to search for.

Returns: A pointer to an element with the given key. If no element in the set has the given key, this will return NULL.

Definition at line 928 of file Set.h.

◆ Find() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE const ElementType * TSet< InElementType, KeyFuncs, Allocator >::Find ( KeyInitType Key ) const

inline

Finds an element with the given key in the set.

Parameters

Key	- The key to search for.

Returns: A const pointer to an element with the given key. If no element in the set has the given key, this will return NULL.

Definition at line 946 of file Set.h.

◆ FindByHash() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

ElementType * TSet< InElementType, KeyFuncs, Allocator >::FindByHash	(	uint32	KeyHash,
		const ComparableKey &	Key )

inline

Finds an element with a pre-calculated hash and a key that can be compared to KeyType.

See also: Class documentation section on ByHash() functions

Returns: A pointer to the contained element or nullptr.

Definition at line 957 of file Set.h.

◆ FindByHash() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

const ElementType * TSet< InElementType, KeyFuncs, Allocator >::FindByHash	(	uint32	KeyHash,
		const ComparableKey &	Key ) const

inline

Definition at line 971 of file Set.h.

◆ FindId()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FSetElementId TSet< InElementType, KeyFuncs, Allocator >::FindId ( KeyInitType Key ) const

inline

Finds an element with the given key in the set.

Parameters

Key	- The key to search for.

Returns: The id of the set element matching the given key, or the NULL id if none matches.

Definition at line 905 of file Set.h.

◆ FindIdByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

FSetElementId TSet< InElementType, KeyFuncs, Allocator >::FindIdByHash	(	uint32	KeyHash,
		const ComparableKey &	Key ) const

inline

Finds an element with a pre-calculated hash and a key that can be compared to KeyType

See also: Class documentation section on ByHash() functions

Returns: The element id that matches the key and hash or an invalid element id

Definition at line 916 of file Set.h.

◆ FindIndexByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

SizeType TSet< InElementType, KeyFuncs, Allocator >::FindIndexByHash	(	uint32	KeyHash,
		const ComparableKey &	Key ) const

inlineprivate

Finds an element with a pre-calculated hash and a key that can be compared to KeyType

See also: Class documentation section on ByHash() functions

Returns: The element id that matches the key and hash or an invalid element id

Definition at line 873 of file Set.h.

◆ FindOrAdd() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE ElementType & TSet< InElementType, KeyFuncs, Allocator >::FindOrAdd	(	const InElementType &	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set if not already present and returns a reference to the added or existing element.

Parameters

InElement	Element to add to set
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A reference to the element stored in the set.

Definition at line 606 of file Set.h.

◆ FindOrAdd() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE ElementType & TSet< InElementType, KeyFuncs, Allocator >::FindOrAdd	(	InElementType &&	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Definition at line 610 of file Set.h.

◆ FindOrAddByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ElementReferenceType >

ElementType & TSet< InElementType, KeyFuncs, Allocator >::FindOrAddByHash	(	uint32	KeyHash,
		ElementReferenceType &&	InElement,
		bool *	bIsAlreadyInSetPtr = nullptr )

inline

Adds an element to the set if not already present and returns a reference to the added or existing element.

See also: Class documentation section on ByHash() functions

Parameters

InElement	Element to add to set
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A reference to the element stored in the set

Definition at line 641 of file Set.h.

◆ GetAllocatedSize()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE SIZE_T TSet< InElementType, KeyFuncs, Allocator >::GetAllocatedSize ( void ) const

inline

Helper function to return the amount of memory allocated by this container Only returns the size of allocations made directly by the container, not the elements themselves.

Returns: number of bytes allocated by this container

Definition at line 529 of file Set.h.

◆ GetMaxIndex()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE int32 TSet< InElementType, KeyFuncs, Allocator >::GetMaxIndex ( ) const

inline

Definition at line 558 of file Set.h.

◆ GetTypedHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE FSetElementId & TSet< InElementType, KeyFuncs, Allocator >::GetTypedHash ( int32 HashIndex ) const

inlineprivate

Definition at line 1425 of file Set.h.

◆ HashElement()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::HashElement	(	SizeType	ElementIndex,
		const SetElementType &	Element ) const

inlineprivate

Hashes and links an added element to the hash chain.

Definition at line 1442 of file Set.h.

◆ Includes()

template<typename InElementType , typename KeyFuncs , typename Allocator >

bool TSet< InElementType, KeyFuncs, Allocator >::Includes ( const TSet< ElementType, KeyFuncs, Allocator > & OtherSet ) const

inline

Determine whether the specified set is entirely included within this set

Parameters

OtherSet Set to check

Returns: True if the other set is entirely included in this set, false if it is not

Definition at line 1231 of file Set.h.

◆ Intersect()

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet TSet< InElementType, KeyFuncs, Allocator >::Intersect ( const TSet< InElementType, KeyFuncs, Allocator > & OtherSet ) const

inline

Returns: the intersection of two sets. (A AND B)

Definition at line 1172 of file Set.h.

◆ IsEmpty()

template<typename InElementType , typename KeyFuncs , typename Allocator >

bool TSet< InElementType, KeyFuncs, Allocator >::IsEmpty ( ) const

inline

Returns true if the sets is empty and contains no elements.

Returns: True if the set is empty.

See also: Num

Definition at line 547 of file Set.h.

◆ IsValidId()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE bool TSet< InElementType, KeyFuncs, Allocator >::IsValidId ( FSetElementId Id ) const

inline

Checks whether an element id is valid.

Parameters

Id	- The element id to check.

Returns: true if the element identifier refers to a valid element in this set.

Definition at line 568 of file Set.h.

◆ LinkElement()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::LinkElement	(	SizeType	ElementIndex,
		const SetElementType &	Element,
		uint32	KeyHash ) const

inlineprivate

Links an added element to the hash chain.

Definition at line 1431 of file Set.h.

◆ Move()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename SetType >

static FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::Move	(	SetType &	ToSet,
		SetType &	FromSet )

inlinestaticprivate

Definition at line 351 of file Set.h.

◆ Num()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE int32 TSet< InElementType, KeyFuncs, Allocator >::Num ( ) const

inline

Returns: the number of elements.

Definition at line 553 of file Set.h.

◆ operator=() [1/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( const TSet< InElementType, KeyFuncs, Allocator > & Copy )

inline

Assignment operator.

Definition at line 333 of file Set.h.

◆ operator=() [2/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( const TSet< ElementType, KeyFuncs, OtherAllocator > & Other )

inline

Assignment operator for copying elements from a TSet with a different SetAllocator

Definition at line 414 of file Set.h.

◆ operator=() [3/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherKeyFuncs , typename OtherAllocator , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( const TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, OtherAllocator > & Other )

inline

Assignment operator. First deletes all currently contained elements and then copies from other set. Compatible element type version.

Parameters

Other The source set to assign from.

Definition at line 1308 of file Set.h.

◆ operator=() [4/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( std::initializer_list< ElementType > InitList )

inline

Initializer list assignment operator

Definition at line 422 of file Set.h.

◆ operator=() [5/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( TSet< InElementType, KeyFuncs, Allocator > && Other )

inline

Move assignment operator.

Definition at line 377 of file Set.h.

◆ operator=() [6/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherAllocator >

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( TSet< ElementType, KeyFuncs, OtherAllocator > && Other )

inline

Assignment operator for moving elements from a TSet with a different SetAllocator

Definition at line 405 of file Set.h.

◆ operator=() [7/7]

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename OtherKeyFuncs , typename AliasElementType = ElementType, typename std::enable_if_t< TIsContainerElementTypeCopyable< AliasElementType >::Value > * = nullptr>

TSet & TSet< InElementType, KeyFuncs, Allocator >::operator= ( TSet< typename TContainerElementTypeCompatibility< ElementType >::CopyFromOtherType, OtherKeyFuncs, Allocator > && Other )

inline

Move assignment operator. Compatible element type version.

Parameters

Other Set to assign and move from.

Definition at line 1287 of file Set.h.

◆ operator[]() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE ElementType & TSet< InElementType, KeyFuncs, Allocator >::operator[] ( FSetElementId Id )

inline

Accesses the identified element's value.

Definition at line 578 of file Set.h.

◆ operator[]() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE const ElementType & TSet< InElementType, KeyFuncs, Allocator >::operator[] ( FSetElementId Id ) const

inline

Accesses the identified element's value.

Definition at line 584 of file Set.h.

◆ Rehash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Rehash ( ) const

inlineprivate

Resizes the hash.

Definition at line 1507 of file Set.h.

◆ RehashOrLink()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::RehashOrLink	(	uint32	KeyHash,
		SetElementType &	Element,
		SizeType	ElementIndex )

inlineprivate

Definition at line 694 of file Set.h.

◆ Relax()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::Relax ( )

inline

Relaxes the set's hash to a size strictly bounded by the number of elements in the set.

Definition at line 519 of file Set.h.

◆ Remove() [1/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Remove ( FSetElementId ElementId )

inline

Removes an element from the set.

Parameters

Element - A pointer to the element in the set, as returned by Add or Find.

Definition at line 861 of file Set.h.

◆ Remove() [2/2]

template<typename InElementType , typename KeyFuncs , typename Allocator >

int32 TSet< InElementType, KeyFuncs, Allocator >::Remove ( KeyInitType Key )

inline

Removes all elements from the set matching the specified key.

Parameters

Key	- The key to match elements against.

Returns: The number of elements removed.

Definition at line 1015 of file Set.h.

◆ RemoveByHash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

int32 TSet< InElementType, KeyFuncs, Allocator >::RemoveByHash	(	uint32	KeyHash,
		const ComparableKey &	Key )

inline

Removes all elements from the set matching the specified key.

See also: Class documentation section on ByHash() functions

Parameters

Key	- The key to match elements against.

Returns: The number of elements removed.

Definition at line 1033 of file Set.h.

◆ RemoveByIndex()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::RemoveByIndex ( SizeType ElementIndex )

inlineprivate

Definition at line 829 of file Set.h.

◆ RemoveImpl()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename ComparableKey >

FORCEINLINE int32 TSet< InElementType, KeyFuncs, Allocator >::RemoveImpl	(	uint32	KeyHash,
		const ComparableKey &	Key )

inlineprivate

Definition at line 978 of file Set.h.

◆ Reserve()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::Reserve ( int32 Number )

inline

Preallocates enough memory to contain Number elements

Definition at line 496 of file Set.h.

◆ Reset()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::Reset ( )

inline

Efficiently empties out the set but preserves all allocations and capacities

Definition at line 456 of file Set.h.

◆ ShouldRehash()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE bool TSet< InElementType, KeyFuncs, Allocator >::ShouldRehash	(	int32	NumHashedElements,
		int32	DesiredHashSize,
		bool	bAllowShrinking = false ) const

inlineprivate

Checks if the hash has an appropriate number of buckets, and if it should be resized.

Parameters

NumHashedElements	- The number of elements to size the hash for.
DesiredHashSize	- Desired size if we should rehash.
bAllowShrinking	- true if the hash is allowed to shrink.

Returns: true if the set should berehashed.

Definition at line 1478 of file Set.h.

◆ Shrink()

template<typename InElementType , typename KeyFuncs , typename Allocator >

FORCEINLINE void TSet< InElementType, KeyFuncs, Allocator >::Shrink ( )

inline

Shrinks the set's element storage to avoid slack.

Definition at line 469 of file Set.h.

◆ Sort()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename PREDICATE_CLASS >

void TSet< InElementType, KeyFuncs, Allocator >::Sort ( const PREDICATE_CLASS & Predicate )

inline

Sorts the set's elements using the provided comparison class.

Definition at line 1072 of file Set.h.

◆ SortFreeList()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::SortFreeList ( )

inline

Sort the free element list so that subsequent additions will occur in the lowest available TSparseArray index resulting in tighter packing without moving any existing items. Also useful for some types of determinism.

See also: TSparseArray::SortFreeList() for more info.

Definition at line 1099 of file Set.h.

◆ StableSort()

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename PREDICATE_CLASS >

void TSet< InElementType, KeyFuncs, Allocator >::StableSort ( const PREDICATE_CLASS & Predicate )

inline

Stable sorts the set's elements using the provided comparison class.

Definition at line 1085 of file Set.h.

◆ TryReplaceExisting()

template<typename InElementType , typename KeyFuncs , typename Allocator >

bool TSet< InElementType, KeyFuncs, Allocator >::TryReplaceExisting	(	uint32	KeyHash,
		SetElementType &	Element,
		SizeType &	InOutElementIndex,
		bool *	bIsAlreadyInSetPtr )

inlineprivate

Definition at line 662 of file Set.h.

◆ UnhashElements()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::UnhashElements ( )

inlineprivate

Reset hash buckets to invalid

Reset the whole hash to invalid

Definition at line 1448 of file Set.h.

◆ Union()

template<typename InElementType , typename KeyFuncs , typename Allocator >

TSet TSet< InElementType, KeyFuncs, Allocator >::Union ( const TSet< InElementType, KeyFuncs, Allocator > & OtherSet ) const

inline

Returns: the union of two sets. (A OR B)

Definition at line 1192 of file Set.h.

◆ VerifyHashElementsKey()

template<typename InElementType , typename KeyFuncs , typename Allocator >

bool TSet< InElementType, KeyFuncs, Allocator >::VerifyHashElementsKey ( KeyInitType Key )

inline

Definition at line 1126 of file Set.h.

◆ WriteMemoryImage()

template<typename InElementType , typename KeyFuncs , typename Allocator >

void TSet< InElementType, KeyFuncs, Allocator >::WriteMemoryImage ( FMemoryImageWriter & Writer ) const

inline

Definition at line 1385 of file Set.h.

Friends And Related Symbol Documentation

◆ TScriptSet

template<typename InElementType , typename KeyFuncs , typename Allocator >

template<typename , typename >

friend class TScriptSet

friend

Definition at line 294 of file Set.h.

◆ TSetPrivateFriend

template<typename InElementType , typename KeyFuncs , typename Allocator >

friend struct TSetPrivateFriend

friend

Definition at line 1762 of file Set.h.

Member Data Documentation

◆ Elements

template<typename InElementType , typename KeyFuncs , typename Allocator >

ElementArrayType TSet< InElementType, KeyFuncs, Allocator >::Elements

private

Definition at line 1379 of file Set.h.

◆ Hash

template<typename InElementType , typename KeyFuncs , typename Allocator >

HashType TSet< InElementType, KeyFuncs, Allocator >::Hash

mutableprivate

Definition at line 1381 of file Set.h.

◆ HashSize

template<typename InElementType , typename KeyFuncs , typename Allocator >

int32 TSet< InElementType, KeyFuncs, Allocator >::HashSize

mutableprivate

Definition at line 1382 of file Set.h.

The documentation for this class was generated from the following file:

C:/Users/lachl/Downloads/ArkServerAPI_NEW/ASA/AsaApi/AsaApi/Core/Public/API/UE/Containers/Set.h

Classes

Public Types

Public Member Functions

Static Public Member Functions

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ AllocatorType

◆ ElementArrayType

◆ ElementInitType

◆ ElementType

◆ HashType

◆ KeyFuncsType

◆ KeyInitType

◆ SetElementType

◆ SizeType

◆ TRangedForConstIterator

◆ TRangedForIterator

Constructor & Destructor Documentation

◆ TSet() [1/8]

◆ TSet() [2/8]

◆ TSet() [3/8]

◆ TSet() [4/8]

◆ ~TSet()

◆ TSet() [5/8]

◆ TSet() [6/8]

◆ TSet() [7/8]

◆ TSet() [8/8]

Member Function Documentation

◆ Add() [1/2]

◆ Add() [2/2]

◆ AddByHash() [1/2]

◆ AddByHash() [2/2]

◆ Append() [1/9]

◆ Append() [2/9]

◆ Append() [3/9]

◆ Append() [4/9]

◆ Append() [5/9]

◆ Append() [6/9]

◆ Append() [7/9]

◆ Append() [8/9]

◆ Append() [9/9]

◆ AppendHash()

◆ Array()

◆ begin() [1/2]

◆ begin() [2/2]

◆ CheckAddress()

◆ Compact()

◆ CompactStable()

◆ ConditionalRehash()

◆ Contains()

◆ ContainsByHash()

◆ CopyUnfrozen()

◆ CountBytes()

◆ CreateConstIterator()

◆ CreateIterator()

◆ Difference()

◆ Dump()

◆ DumpHashElements()

◆ Emplace()

◆ EmplaceByHash()

◆ Empty()

◆ end() [1/2]

◆ end() [2/2]

◆ Find() [1/2]

◆ Find() [2/2]

◆ FindByHash() [1/2]

◆ FindByHash() [2/2]

◆ FindId()

◆ FindIdByHash()

◆ FindIndexByHash()

◆ FindOrAdd() [1/2]

◆ FindOrAdd() [2/2]

◆ FindOrAddByHash()

◆ GetAllocatedSize()

◆ GetMaxIndex()