#include <SortedSet.h>

Classes
class	TConstIterator

class	TIterator

Public Types
using	ElementType = InElementType

using	KeyInitType = typename TTypeTraits< ElementType >::ConstPointerType

using	IntrusiveUnsetOptionalStateType = TSortedSet

Public Member Functions
	TSortedSet ()=default

	TSortedSet (TSortedSet &&)=default

	TSortedSet (const TSortedSet &)=default

TSortedSet &	operator= (TSortedSet &&)=default

TSortedSet &	operator= (const TSortedSet &)=default

template<typename OtherArrayAllocator >
	TSortedSet (TSortedSet< InElementType, OtherArrayAllocator, SortPredicate > &&Other)

template<typename OtherArrayAllocator >
	TSortedSet (const TSortedSet< InElementType, OtherArrayAllocator, SortPredicate > &Other)

	TSortedSet (std::initializer_list< ElementType > InitList)

	TSortedSet (FIntrusiveUnsetOptionalState Tag)

bool	operator== (FIntrusiveUnsetOptionalState Tag) const

template<typename OtherArrayAllocator >
TSortedSet &	operator= (TSortedSet< ElementType, OtherArrayAllocator, SortPredicate > &&Other)

template<typename OtherArrayAllocator >
TSortedSet &	operator= (const TSortedSet< ElementType, OtherArrayAllocator, SortPredicate > &Other)

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

UE_FORCEINLINE_HINT bool	operator== (const TSortedSet &Other) const

UE_FORCEINLINE_HINT bool	operator!= (const TSortedSet &Other) const

UE_FORCEINLINE_HINT void	Empty (int32 ExpectedNumElements=0)

UE_FORCEINLINE_HINT void	Reset ()

UE_FORCEINLINE_HINT void	Shrink ()

UE_FORCEINLINE_HINT void	Reserve (int32 Number)

bool	IsEmpty () const

UE_FORCEINLINE_HINT int32	Num () const

UE_FORCEINLINE_HINT int32	Max () const

UE_FORCEINLINE_HINT int32	GetMaxIndex () const

UE_FORCEINLINE_HINT SIZE_T	GetAllocatedSize () const

UE_FORCEINLINE_HINT void	CountBytes (FArchive &Ar) const

UE_FORCEINLINE_HINT FSetElementId	Add (const ElementType &InValue, bool *bIsAlreadyInSetPtr=nullptr)

UE_FORCEINLINE_HINT FSetElementId	Add (ElementType &&InValue, bool *bIsAlreadyInSetPtr=nullptr)

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

UE_FORCEINLINE_HINT int32	Remove (KeyInitType InKey)

UE_FORCEINLINE_HINT ElementType *	Find (KeyInitType Key)

UE_FORCEINLINE_HINT const ElementType *	Find (KeyInitType Key) const

UE_FORCEINLINE_HINT ElementType &	FindOrAdd (const ElementType &InValue, bool *bIsAlreadyInSetPtr=nullptr)

UE_FORCEINLINE_HINT ElementType &	FindOrAdd (ElementType &&InValue, bool *bIsAlreadyInSetPtr=nullptr)

ElementType *	FindArbitraryElement ()

const ElementType *	FindArbitraryElement () const

UE_FORCEINLINE_HINT bool	Contains (KeyInitType Key) const

TArray< ElementType >	Array () const &

TArray< ElementType >	Array () &&

void	Dump (FOutputDevice &Ar)

template<typename OtherArrayAllocator , typename OtherSortPredicate >
void	Append (TSortedSet< ElementType, OtherArrayAllocator, OtherSortPredicate > &&Other)

template<typename OtherArrayAllocator , typename OtherSortPredicate >
void	Append (const TSortedSet< ElementType, OtherArrayAllocator, OtherSortPredicate > &Other)

template<typename OtherArrayAllocator >
void	Append (TArray< ElementType, OtherArrayAllocator > &&Other)

void	Append (TArrayView< const ElementType > Other)

template<typename OtherArrayAllocator >
void	Append (std::initializer_list< ElementType > Other)

UE_FORCEINLINE_HINT bool	IsValidId (FSetElementId Id) const

UE_FORCEINLINE_HINT ElementType &	operator[] (FSetElementId Id)

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

UE_FORCEINLINE_HINT ElementType &	Get (FSetElementId Id)

UE_FORCEINLINE_HINT const ElementType &	Get (FSetElementId Id) const

UE_FORCEINLINE_HINT TIterator	CreateIterator ()

UE_FORCEINLINE_HINT TConstIterator	CreateConstIterator () const

UE_FORCEINLINE_HINT auto	begin ()

UE_FORCEINLINE_HINT auto	begin () const

UE_FORCEINLINE_HINT auto	end ()

UE_FORCEINLINE_HINT auto	end () const

Static Public Attributes
static constexpr bool	bHasIntrusiveUnsetOptionalState = true

Friends
template<typename OtherElementType , typename OtherArrayAllocator , typename OtherSortPredicate >
class	TSortedSet

FArchive &	operator (FArchive &Ar, TSortedSet &Set)

Detailed Description

template<typename InElementType, typename ArrayAllocator, typename SortPredicate>
class TSortedSet< InElementType, ArrayAllocator, SortPredicate >

A set of values, implemented as a sorted TArray of elements.

It has a mostly identical interface to TSet and is designed as a drop in replacement. Keys must be unique. It uses half as much memory as TSet and has a smaller static footprint, but adding and removing elements is O(n), and finding is O(Log n). In practice it is faster than TSet for low element counts, and slower as n increases. This set is always kept sorted by key so cannot be sorted manually.

Member Typedef Documentation

◆ ElementType

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

using TSortedSet< InElementType, ArrayAllocator, SortPredicate >::ElementType = InElementType

◆ IntrusiveUnsetOptionalStateType

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

using TSortedSet< InElementType, ArrayAllocator, SortPredicate >::IntrusiveUnsetOptionalStateType = TSortedSet

◆ KeyInitType

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

using TSortedSet< InElementType, ArrayAllocator, SortPredicate >::KeyInitType = typename TTypeTraits<ElementType>::ConstPointerType

Constructor & Destructor Documentation

◆ TSortedSet() [1/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( )

default

◆ TSortedSet() [2/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( TSortedSet< InElementType, ArrayAllocator, SortPredicate > && )

default

◆ TSortedSet() [3/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( const TSortedSet< InElementType, ArrayAllocator, SortPredicate > & )

default

◆ TSortedSet() [4/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( TSortedSet< InElementType, OtherArrayAllocator, SortPredicate > && Other )

inline

Constructor for moving elements from a TSortedSet with a different ArrayAllocator.

◆ TSortedSet() [5/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( const TSortedSet< InElementType, OtherArrayAllocator, SortPredicate > & Other )

inline

Constructor for copying elements from a TSortedSet with a different ArrayAllocator.

◆ TSortedSet() [6/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( std::initializer_list< ElementType > InitList )

inline

Constructor which gets its elements from a native initializer list

◆ TSortedSet() [7/7]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet< InElementType, ArrayAllocator, SortPredicate >::TSortedSet ( FIntrusiveUnsetOptionalState Tag )

inlineexplicit

Member Function Documentation

◆ Add() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT FSetElementId TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Add	(	const ElementType &	InValue,
		bool *	bIsAlreadyInSetPtr = `nullptr`
	)

inline

Adds an element to the set.

Parameters

InValue	The value to add.
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A handle to the value in the set (only valid until the next change to the set).

◆ Add() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT FSetElementId TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Add	(	ElementType &&	InValue,
		bool *	bIsAlreadyInSetPtr = `nullptr`
	)

inline

◆ Append() [1/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator , typename OtherSortPredicate >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Append ( const TSortedSet< ElementType, OtherArrayAllocator, OtherSortPredicate > & Other )

inline

◆ Append() [2/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Append ( std::initializer_list< ElementType > Other )

inline

◆ Append() [3/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Append ( TArray< ElementType, OtherArrayAllocator > && Other )

inline

◆ Append() [4/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Append ( TArrayView< const ElementType > Other )

inline

◆ Append() [5/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator , typename OtherSortPredicate >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Append ( TSortedSet< ElementType, OtherArrayAllocator, OtherSortPredicate > && Other )

inline

Adds all items from another set into our set (if any elements are in both, the value from the other set wins). If the source is an rvalue container, the elements will be moved and the container will be left empty.

Parameters

Other The range of elements to add.

◆ Array() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TArray< ElementType > TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Array ( ) &&

inline

◆ Array() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TArray< ElementType > TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Array ( ) const &

inline

Returns a TArray of the elements.

◆ begin() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT auto TSortedSet< InElementType, ArrayAllocator, SortPredicate >::begin ( )

inline

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

◆ begin() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT auto TSortedSet< InElementType, ArrayAllocator, SortPredicate >::begin ( ) const

inline

◆ Contains()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Contains ( KeyInitType Key ) const

inline

Checks if set contains the specified key.

Parameters

Key	The key to check for.

Returns: true if the set contains the key.

◆ CountBytes()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::CountBytes ( FArchive & Ar ) const

inline

Tracks the container's memory use through an archive.

◆ CreateConstIterator()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT TConstIterator TSortedSet< InElementType, ArrayAllocator, SortPredicate >::CreateConstIterator ( ) const

inline

Creates a const iterator over all the elements in this set

◆ CreateIterator()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT TIterator TSortedSet< InElementType, ArrayAllocator, SortPredicate >::CreateIterator ( )

inline

Creates an iterator over all the elements in this set

◆ Dump()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::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.

◆ Emplace()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename InitArgType = ElementType>

FSetElementId TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Emplace	(	InitArgType &&	InInitArg,
		bool *	bIsAlreadyInSetPtr = `nullptr`
	)

inline

Adds an element to the set.

Parameters

InInitArg	The argument 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 value in the set (only valid until the next change to the set).

◆ Empty()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::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.

◆ end() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT auto TSortedSet< InElementType, ArrayAllocator, SortPredicate >::end ( )

inline

◆ end() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT auto TSortedSet< InElementType, ArrayAllocator, SortPredicate >::end ( ) const

inline

◆ Find() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT ElementType * TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Find ( KeyInitType Key )

inline

Returns the value associated with a specified key.

Parameters

Key	The key to search for.

Returns: A pointer to the value associated with the specified key, or nullptr if the key isn't contained in this set. The pointer (only valid until the next change to any key in the set).

◆ Find() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT const ElementType * TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Find ( KeyInitType Key ) const

inline

◆ FindArbitraryElement() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

ElementType * TSortedSet< InElementType, ArrayAllocator, SortPredicate >::FindArbitraryElement ( )

inline

Finds any element in the set and returns a pointer to it. Callers should not depend on particular patterns in the behavior of this function.

Returns: A pointer to an arbitrary element, or nullptr if the container is empty.

◆ FindArbitraryElement() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

const ElementType * TSortedSet< InElementType, ArrayAllocator, SortPredicate >::FindArbitraryElement ( ) const

inline

◆ FindOrAdd() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::FindOrAdd	(	const ElementType &	InValue,
		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

InValue	The value to add.
bIsAlreadyInSetPtr	[out] Optional pointer to bool that will be set depending on whether element is already in set

Returns: A handle to the value in the set (only valid until the next change to the set).

◆ FindOrAdd() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::FindOrAdd	(	ElementType &&	InValue,
		bool *	bIsAlreadyInSetPtr = `nullptr`
	)

inline

◆ Get() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Get ( FSetElementId Id )

inline

◆ Get() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT const ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Get ( FSetElementId Id ) const

inline

◆ GetAllocatedSize()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT SIZE_T TSortedSet< InElementType, ArrayAllocator, SortPredicate >::GetAllocatedSize ( ) 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.

◆ GetMaxIndex()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT int32 TSortedSet< InElementType, ArrayAllocator, SortPredicate >::GetMaxIndex ( ) const

inline

Returns: The non-inclusive maximum index of elements in the set.

◆ IsEmpty()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::IsEmpty ( ) const

inline

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

Returns: True if the set is empty.

See also: Num

◆ IsValidId()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::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.

◆ Max()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT int32 TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Max ( ) const

inline

Returns: The number of elements the set can hold before reallocation.

◆ Num()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT int32 TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Num ( ) const

inline

Returns: The number of elements in the set.

◆ operator!=()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator!= ( const TSortedSet< InElementType, ArrayAllocator, SortPredicate > & Other ) const

inline

Inequality operator. This is efficient because elements are always sorted.

◆ operator=() [1/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator= ( const TSortedSet< InElementType, ArrayAllocator, SortPredicate > & )

default

◆ operator=() [2/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

TSortedSet & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator= ( const TSortedSet< ElementType, OtherArrayAllocator, SortPredicate > & Other )

inline

Assignment operator for copying elements from a TSortedSet with a different ArrayAllocator.

◆ operator=() [3/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator= ( std::initializer_list< ElementType > InitList )

inline

Assignment operator which gets its elements from a native initializer list

◆ operator=() [4/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

TSortedSet & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator= ( TSortedSet< InElementType, ArrayAllocator, SortPredicate > && )

default

◆ operator=() [5/5]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherArrayAllocator >

TSortedSet & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator= ( TSortedSet< ElementType, OtherArrayAllocator, SortPredicate > && Other )

inline

Assignment operator for moving elements from a TSortedSet with a different ArrayAllocator.

◆ operator==() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator== ( const TSortedSet< InElementType, ArrayAllocator, SortPredicate > & Other ) const

inline

Equality operator. This is efficient because elements are always sorted.

◆ operator==() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator== ( FIntrusiveUnsetOptionalState Tag ) const

inline

◆ operator[]() [1/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator[] ( FSetElementId Id )

inline

◆ operator[]() [2/2]

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT const ElementType & TSortedSet< InElementType, ArrayAllocator, SortPredicate >::operator[] ( FSetElementId Id ) const

inline

◆ Remove()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT int32 TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Remove ( KeyInitType InKey )

inline

Removes all elements from the set matching the specified key.

Parameters

InKey The key to match elements against.

Returns: The number of elements removed.

◆ Reserve()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Reserve ( int32 Number )

inline

Preallocates enough memory to contain Number elements.

◆ Reset()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Reset ( )

inline

Efficiently empties out the set but preserves all allocations and capacities.

◆ Shrink()

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

UE_FORCEINLINE_HINT void TSortedSet< InElementType, ArrayAllocator, SortPredicate >::Shrink ( )

inline

Shrinks the set to avoid slack.

Friends And Related Symbol Documentation

◆ operator

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

FArchive & operator	(	FArchive &	Ar,
		TSortedSet< InElementType, ArrayAllocator, SortPredicate > &	Set
	)

friend

◆ TSortedSet

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

template<typename OtherElementType , typename OtherArrayAllocator , typename OtherSortPredicate >

friend class TSortedSet

friend

Member Data Documentation

◆ bHasIntrusiveUnsetOptionalState

template<typename InElementType , typename ArrayAllocator , typename SortPredicate >

constexpr bool TSortedSet< InElementType, ArrayAllocator, SortPredicate >::bHasIntrusiveUnsetOptionalState = true

staticconstexpr

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

Engine/Source/Runtime/Core/Public/Containers/SortedSet.h

Classes

Public Types

Public Member Functions

Static Public Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ ElementType

◆ IntrusiveUnsetOptionalStateType

◆ KeyInitType

Constructor & Destructor Documentation

◆ TSortedSet() [1/7]

◆ TSortedSet() [2/7]

◆ TSortedSet() [3/7]

◆ TSortedSet() [4/7]

◆ TSortedSet() [5/7]

◆ TSortedSet() [6/7]

◆ TSortedSet() [7/7]

Member Function Documentation

◆ Add() [1/2]

◆ Add() [2/2]

◆ Append() [1/5]

◆ Append() [2/5]

◆ Append() [3/5]

◆ Append() [4/5]

◆ Append() [5/5]

◆ Array() [1/2]

◆ Array() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ Contains()

◆ CountBytes()

◆ CreateConstIterator()

◆ CreateIterator()

◆ Dump()

◆ Emplace()

◆ Empty()

◆ end() [1/2]

◆ end() [2/2]

◆ Find() [1/2]

◆ Find() [2/2]

◆ FindArbitraryElement() [1/2]

◆ FindArbitraryElement() [2/2]

◆ FindOrAdd() [1/2]

◆ FindOrAdd() [2/2]

◆ Get() [1/2]

◆ Get() [2/2]

◆ GetAllocatedSize()

◆ GetMaxIndex()

◆ IsEmpty()

◆ IsValidId()

◆ Max()

◆ Num()

◆ operator!=()

◆ operator=() [1/5]

◆ operator=() [2/5]

◆ operator=() [3/5]

◆ operator=() [4/5]

◆ operator=() [5/5]

◆ operator==() [1/2]

◆ operator==() [2/2]

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ Remove()

◆ Reserve()

◆ Reset()

◆ Shrink()

Friends And Related Symbol Documentation

◆ operator

◆ TSortedSet

Member Data Documentation

◆ bHasIntrusiveUnsetOptionalState