code: template<typename IterBeginType, typename IterEndType, typename SizeType, typename OperatorType> static void ReinterpretRangeContiguous ( IterBeginType Iter, IterEndType IterEnd, SizeType Size, OperatorType Operator )


module: Core

code: template<typename IterBeginType, typename IterEndType, typename OperatorType> static void ReinterpretRange ( IterBeginType Iter, IterEndType IterEnd, OperatorType Operator )


className: ReinterpretType

code: typedef InElementType ReinterpretType


className: TContainerElementTypeCompatibility

description: Temporary compatibility mechanism to be used solely for the purpose of raw pointers to wrapped pointers. Specialization and use of this type is not supported beyond the specific instances in ObjectPtr.h. These types and the container methods that leverage them will be removed in a future release.

code: template<typename InElementType> struct TContainerElementTypeCompatibility


className: HashabilityCheck

description: If this line fails to compile then your key doesn't have a GetTypeHash() overload.

code: typedef decltype(GetTypeHash(DeclVal< const [KeyType](API\Runtime\Core\Containers\BaseKeyFuncs\KeyType) >())) HashabilityCheck


className: TDefaultMapHashableKeyFuncs

code: template<typename KeyType, typename ValueType, bool bInAllowDuplicateKeys> struct TDefaultMapHashableKeyFuncs : public [TDefaultMapKeyFuncs< KeyType, ValueType, bInAllowDuplicateKeys >](API\Runtime\Core\Containers\TDefaultMapKeyFuncs)


className: ElementInitType

code: typedef const [TPairInitializer](API\Runtime\Core\Containers\TPairInitializer)< typename [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< [KeyType](API\Runtime\Core\Containers\BaseKeyFuncs\KeyType) >::ConstInitType, typename [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< ValueType >::ConstInitType > & ElementInitType


code: static uint32 GetKeyHash ( [KeyInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\KeyInitType) Key )


code: template<typename ComparableKey> static uint32 GetKeyHash ( ComparableKey Key )


code: static [KeyInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\KeyInitType) GetSetKey ( [ElementInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\ElementInitType) Element )


className: KeyInitType

code: typedef [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< [KeyType](API\Runtime\Core\Containers\BaseKeyFuncs\KeyType) >::ConstPointerType KeyInitType


code: static bool Matches ( [KeyInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\KeyInitType) A, [KeyInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\KeyInitType) B )


code: template<typename ComparableKey> static bool Matches ( [KeyInitType](API\Runtime\Core\Containers\TDefaultMapKeyFuncs\KeyInitType) A, ComparableKey B )


className: TDefaultMapKeyFuncs

description: Defines how the map's pairs are hashed.

code: template<typename KeyType, typename ValueType, bool bInAllowDuplicateKeys> struct TDefaultMapKeyFuncs : public [BaseKeyFuncs< TPair< KeyType, ValueType >, KeyType, bInAllowDuplicateKeys >](API\Runtime\Core\Containers\BaseKeyFuncs)


className: AllocatorType

code: typedef InAllocatorType AllocatorType


description: STL IteratorType model compliance methods.


className: ElementAllocatorType

code: typedef typename [TChooseClass](API\Runtime\Core\Templates\TChooseClass)< AllocatorType::NeedsElementType, typename AllocatorType::template ForElementType< [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) >, typename AllocatorType::ForAnyElementType >::Result ElementAllocatorType


className: ConstIteratorType

code: typedef [UE::Deque::Private::TIterator](API\Runtime\Core\Containers\TIterator_1)< const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType), [SizeType](API\Runtime\Core\Containers\TDeque\SizeType) > ConstIteratorType


className: ElementType

code: typedef InElementType ElementType


description: Constructs an element in place using the parameter arguments and adds it at the front of the queue. This method returns a reference to the constructed element.

code: template<typename... ArgsType> [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & EmplaceFirst ( ArgsType &&... Args )


description: Constructs an element in place using the parameter arguments and adds it at the back of the queue. This method returns a reference to the constructed element.

code: template<typename... ArgsType> [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & EmplaceLast ( ArgsType &&... Args )


description: Empties the queue effectively destroying all contained elements and releases any acquired storage.

code: void Empty()


code: const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & First() const


description:
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.
Number of bytes allocated by this container.

code: SIZE_T GetAllocatedSize() const


code: const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & Last() const


code: [TDeque](API\Runtime\Core\Containers\TDeque) & operator= ( [TDeque](API\Runtime\Core\Containers\TDeque) && Other )


code: [TDeque](API\Runtime\Core\Containers\TDeque) & operator= ( const [TDeque](API\Runtime\Core\Containers\TDeque) & Other )


code: [TDeque](API\Runtime\Core\Containers\TDeque) & operator= ( std::initializer_list< [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) > InList )


description: TDequecomparison operators.

code: bool operator== ( const [TDeque](API\Runtime\Core\Containers\TDeque) & Right ) const


code: const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & operator[] ( [SizeType](API\Runtime\Core\Containers\TDeque\SizeType) Index ) const


code: bool operator!= ( const [TDeque](API\Runtime\Core\Containers\TDeque) & Right ) const


code: [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & operator[] ( [SizeType](API\Runtime\Core\Containers\TDeque\SizeType) Index )


description: Removes the element at the front of the queue. This method requires a non-empty queue.

code: void PopFirst()


description: Removes the element at the back of the queue. This method requires a non-empty queue.

code: void PopLast()


description: Adds the parameter element at the front of the queue.

code: void PushFirst ( const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & Element )


code: void PushFirst ( [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) && Element )


code: void PushLast ( [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) && Element )


description: Adds the parameter element at the back of the queue.

code: void PushLast ( const [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & Element )


description: Reserves storage for the parameter element count.

code: void Reserve ( [SizeType](API\Runtime\Core\Containers\TDeque\SizeType) InCount )


description: Destroys all contained elements but doesn't release the container's storage.

code: void Reset()


className: SizeType

code: typedef typename InAllocatorType::SizeType SizeType


description: Removes the element at the front of the queue if existent after copying it to the parameter out value.

code: bool TryPopFirst ( [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & OutValue )


description: Removes the element at the back of the queue if existent after copying it to the parameter out value.

code: bool TryPopLast ( [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) & OutValue )


code: TDeque ( [TDeque](API\Runtime\Core\Containers\TDeque) && Other )


code: TDeque ( const [TDeque](API\Runtime\Core\Containers\TDeque) & Other )


code: TDeque ( std::initializer_list< [ElementType](API\Runtime\Core\Containers\TDeque\ElementType) > InList )


className: TDeque

description: A dynamically sized sequential queue of arbitrary size.

code: template<typename InElementType, typename InAllocatorType> class TDeque


code: bool operator!= ( const [TDereferencingIterator](API\Runtime\Core\Containers\TDereferencingIterator) & Rhs ) const


code: TDereferencingIterator ( IteratorType InIter )


className: TDereferencingIterator

code: template<typename ElementType, typename IteratorType> struct TDereferencingIterator


className: TDisambiguater

description: Used to disambiguate methods that are overloaded for all possible subtypes of aTUnionwhere the subtypes may not be distinct.

code: template<uint32> struct TDisambiguater


description: Add an entry to the current map. Can fail if another thread has inserted a matching object, in which case another call toFind()should succeed

code: bool Add ( const KeyType & Key, const ValueType & Value )


code: bool Add ( const KeyType & Key, const ValueType & Value, const uint32 LockFlags )


code: uint32 ApplyLock ( uint32 CurrentFlags, uint32 NewFlags )


description: Reference to the current map


description: Discard all items left in the backfill and swap the current & backfill pointers

code: int32 Discard()


code: template<typename DeleteFunc> int32 Discard ( DeleteFunc Func )


description: Discard all items in the backfill and swap the current & backfill pointers

code: template<typename DeleteFunc> int32 Discard ( uint32 InCurrentLockFlags, uint32 & OutNewLockFlags, DeleteFunc Func )


description: Returns true and sets OutType to the value with the associated key if it exists.

code: bool Find ( const KeyType & Key, ValueType & OutType )


description: InFlags represents the currently locked state of the object, OutFlags the state after the find operation has completed. Caller should be sure to unlock this object with OutFlags

code: bool Find ( const KeyType & Key, ValueType & OutType, uint32 InCurrentLockFlags, uint32 & OutLockFlags )


description: Checks for the entry in our current map, and if not found the backfill. If the entry is in the backfill it is moved to the current map so it will not be discarded when DiscardUnusedEntries is called

code: bool InternalFindWhileLocked ( const KeyType & Key, ValueType & OutType, uint32 InCurrentLockFlags, uint32 & OutFlags )


className: Flags

code: enum Flags { ReadLock = (1 << 0), WriteLock = (1 << 1), WriteLockOnAddFail = (1 << 2), }


className: LockFlags

description: Flags used when callingFind()

code: struct LockFlags


description: Returns the total number of items in the cache

code: int32 Num()


description: Access to the internal locking object

code: FRWLock & RWLock()


className: TypedMap

code: typedef [TMap](API\Runtime\Core\Containers\TMap)< KeyType, ValueType > TypedMap


className: TDiscardableKeyValueCache

description: This results in most recently used items being retained and older/unused items being evicted. The more often Swap is called the shorter the lifespan for items

code: template<class KeyType, class ValueType> class TDiscardableKeyValueCache

BackfillMap

type: TypedMap*

LockObject

type: FRWLock

type: TypedMap


code: bool AddHead ( [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NewNode )


description: RemoveNode

code: bool AddHead ( const ElementType & InElement )


description: RemoveNode

code: bool AddTail ( const ElementType & InElement )


code: bool AddTail ( [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NewNode )


code: bool Contains ( const ElementType & InElement )


description:
Finds the node corresponding to the value specified
a pointer to the node that contains the value specified, or nullptr of the value couldn't be found

code: [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * FindNode ( const ElementType & InElement )


description: Removes all nodes from the list.

code: void Empty()


description: GetTail

code: [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * GetHead() const


description: GetHead

code: [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * GetTail() const


description: RemoveNode

code: bool InsertNode ( const ElementType & InElement, [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NodeToInsertBefore )


code: bool InsertNode ( [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NewNode, [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NodeToInsertBefore )


description: Num

code: bool IsEmpty() const


description:
Returns the number of items in the list.
Item count.

code: int32 Num() const


description: InsertNode

code: void RemoveNode ( [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode) * NodeToRemove, bool bDeleteNode )


description: InsertNode

code: void RemoveNode ( const ElementType & InElement )


description: Updates the size reported byNum(). Child classes can use this function to conveniently hook into list additions/removals.

code: virtual void SetListSize ( int32 NewListSize )


className: TConstIterator

code: typedef [TDoubleLinkedListIterator](API\Runtime\Core\Containers\TDoubleLinkedListIterator)< [TDoubleLinkedListNode](API\Runtime\Core\Containers\TDoubleLinkedList\TDoubleLinkedListNode), const ElementType > TConstIterator


code: const TDoubleLinkedListNode &42; GetNextNode&40;&41; const


code: const TDoubleLinkedListNode &42; GetPrevNode&40;&41; const


code: const ElementType & GetValue&40;&41; const


description: Constructor

code: TDoubleLinkedListNode &40; const ElementType & InValue &41;


className: TIterator

description: Used to iterate over the elements of a linked list.


className: TDoubleLinkedListNode

code: class TDoubleLinkedListNode

NextNode

type: TDoubleLinkedLi...

Value

type: ElementType


description: Constructors.

code: TDoubleLinkedList()


code: TDoubleLinkedList &40; const TDoubleLinkedList & &41;


description: Destructor

code: virtual ~TDoubleLinkedList()


className: TDoubleLinkedList

description: TIntrusiveDoubleLinkedList

code: template<class ElementType> class TDoubleLinkedList


description: Accessors.

code: ElementType & operator->() const


description: Conversion to "bool" returning true if the iterator is valid.

code: operator bool() const


code: bool operator== ( const [TDoubleLinkedListIterator](API\Runtime\Core\Containers\TDoubleLinkedListIterator) & Rhs ) const


code: bool operator!= ( const [TDoubleLinkedListIterator](API\Runtime\Core\Containers\TDoubleLinkedListIterator) & Rhs ) const


code: [TDoubleLinkedListIterator](API\Runtime\Core\Containers\TDoubleLinkedListIterator) operator-- ( int )


code: [TDoubleLinkedListIterator](API\Runtime\Core\Containers\TDoubleLinkedListIterator) operator++ ( int )


code: TDoubleLinkedListIterator ( NodeType * StartingNode )


className: TDoubleLinkedListIterator

code: template<class NodeType, class ElementType> class TDoubleLinkedListIterator


className: Check

code: typedef [TEnumAsByte_EnumClass](API\Runtime\Core\Containers\TEnumAsByte_EnumClass)< [TIsEnumClass](API\Runtime\Core\Templates\TIsEnumClass)< TEnum >::Value > Check


description:
Gets the integer enumeration value.
The enumeration value.

code: uint8 GetIntValue() const


description:
Gets the enumeration value.
The enumeration value.

code: TEnum GetValue() const


code: [TEnumAsByte](API\Runtime\Core\Containers\TEnumAsByte) & operator= ( const [TEnumAsByte](API\Runtime\Core\Containers\TEnumAsByte) & )


className: TEnumAsByte::operator TEnum

description: Implicit conversion to TEnum.

code: operator TEnum() const


description:
Compares two enumeration values for equality.
true if the two values are equal, false otherwise.

code: bool operator== ( [TEnumAsByte](API\Runtime\Core\Containers\TEnumAsByte) InValue ) const


code: bool operator== ( TEnum InValue ) const


code: TEnumAsByte ( const [TEnumAsByte](API\Runtime\Core\Containers\TEnumAsByte) & )


description: Constructor, initialize to the enum value.

code: TEnumAsByte ( TEnum InValue )


description: Constructor, initialize to the int32 value.

code: TEnumAsByte ( uint8 InValue )


code: TEnumAsByte ( int32 InValue )


description: TEnumAsByte_EnumClass< false >


className: TEnumAsByte

description: Template to store enumeration values as bytes in a type-safe way.

code: template<class TEnum> class TEnumAsByte


className: TEnumAsByte_EnumClass< false >

description: Deprecated*TEnumAsByteis not intended for use with enum classes - please derive your enum class from uint8 instead.

code: template<> struct TEnumAsByte_EnumClass< false >


className: ForAnyElementType

code: typedef void ForAnyElementType


code: SizeType CalculateSlackGrow &40; SizeType NumElements, SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


code: SizeType CalculateSlackReserve &40; SizeType NumElements, SIZE_T NumBytesPerElement &41; const


code: SizeType CalculateSlackShrink &40; SizeType NumElements, SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


code: ElementType &42; GetAllocation&40;&41; const


code: SIZE_T GetAllocatedSize &40; SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


description: Moves the state of another allocator into this one. Assumes that the allocator is currently empty, i.e. memory may be allocated but any existing elements have already been destructed (if necessary).

code: void MoveToEmpty &40; ForElementType & Other &41;


code: void ResizeAllocation &40; SizeType PreviousNumElements, SizeType NumElements, SIZE_T NumBytesPerElement &41;


code: ForElementType &40; const ForElementType & &41;


description: Default constructor.


className: ForElementType

code: template<typename ElementType> class ForElementType


className: NeedsElementType

code: enum { NeedsElementType = true }


className: RequireRangeCheck

code: enum { RequireRangeCheck = true }


className: TFixedAllocator

description: The fixed allocation policy allocates up to a specified number of elements in the same allocation as the container. It's like the inline allocator, except it doesn't provide secondary storage when the inline storage has been filled.

code: template<uint32 NumInlineElements> class TFixedAllocator


className: HashAllocator

code: typedef [TFixedAllocator](API\Runtime\Core\Containers\TFixedAllocator)< NumInlineHashBuckets > HashAllocator


description: Computes the number of hash buckets to use for a given number of elements.

code: static uint32 GetNumberOfHashBuckets ( uint32 NumHashedElements )


className: NumInlineHashBuckets

code: enum { NumInlineHashBuckets = (NumInlineElements + AverageNumberOfElementsPerHashBucket - 1) / AverageNumberOfElementsPerHashBucket }


className: SparseArrayAllocator

code: typedef [TFixedSparseArrayAllocator](API\Runtime\Core\Containers\TFixedSparseArrayAllocator)< NumInlineElements > SparseArrayAllocator


className: TFixedSetAllocator

description: An inline set allocator that doesn't have any secondary storage.

code: template<uint32 NumInlineElements, uint32 AverageNumberOfElementsPerHashBucket, uint32 MinNumberOfHashedElements> class TFixedSetAllocator


className: BitArrayAllocator

code: typedef [TFixedAllocator](API\Runtime\Core\Containers\TFixedAllocator)< InlineBitArrayDWORDs > BitArrayAllocator


className: ElementAllocator

code: typedef [TFixedAllocator](API\Runtime\Core\Containers\TFixedAllocator)< NumInlineElements > ElementAllocator


className: InlineBitArrayDWORDs

description: The size to allocate inline for the bit array.

code: enum { InlineBitArrayDWORDs = (NumInlineElements + ((int32)32) - 1) / ((int32)32) }


className: TFixedSparseArrayAllocator

description: An inline sparse array allocator that doesn't have any secondary storage.

code: template<uint32 NumInlineElements> class TFixedSparseArrayAllocator


className: TGetTypeLayoutHelper<                          FSetElementId >::Do

code: static const FTypeLayoutDesc & Do &40; const FSetElementId & &41;


className: TGetTypeLayoutHelper<                          FSetElementId >

code: template<> struct TGetTypeLayoutHelper< FSetElementId >


code: void Add ( uint16 Key, uint32 Index )


className: Allocator

code: typedef InAllocator Allocator


code: void CopyUnfrozen ( const [FMemoryUnfreezeContent](API\Runtime\Core\Serialization\FMemoryUnfreezeContent) & Context, void * Dst ) const


className: ElementAllocatorType

code: typedef typename [TChooseClass](API\Runtime\Core\Templates\TChooseClass)< Allocator::NeedsElementType, typename Allocator::template ForElementType< uint32 >, typename Allocator::ForAnyElementType >::Result ElementAllocatorType


description: First in hash chain.

code: uint32 First ( uint16 Key ) const


code: const uint32 * GetNextIndices() const


code: [THashTable](API\Runtime\Core\Containers\THashTable) & MoveAssign ( [THashTable](API\Runtime\Core\Containers\THashTable) && Other )


description: Next in hash chain.

code: uint32 Next ( uint32 Index ) const


code: [THashTable](API\Runtime\Core\Containers\THashTable) & operator= ( const [THashTable](API\Runtime\Core\Containers\THashTable) & Other )


code: [THashTable](API\Runtime\Core\Containers\THashTable) & operator= ( [THashTable](API\Runtime\Core\Containers\THashTable) && Other )


code: void Remove ( uint16 Key, uint32 Index )


code: void WriteMemoryImage ( [FMemoryImageWriter](API\Runtime\Core\Serialization\FMemoryImageWriter) & Writer ) const


code: THashTable ( [THashTable](API\Runtime\Core\Containers\THashTable) && Other )


code: THashTable ( const [THashTable](API\Runtime\Core\Containers\THashTable) & Other )


code: THashTable ( uint32 InHashSize, uint32 InIndexSize )


className: THashTable

code: template<typename InAllocator> class THashTable


className: THasTypeLayout<                          FSetElementId >

description: This is just an int32.

code: template<> struct THasTypeLayout< FSetElementId >


description: Returns an index to the current element.

code: SizeType GetIndex() const


description: Iterator arithmetic support

code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) & operator+= ( SizeType Offset )


description: Conversion to "bool" returning true if the iterator has not reached the last element.

code: operator bool() const


code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) operator+ ( SizeType Offset ) const


code: bool operator== ( const [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) & Rhs ) const


code: bool operator!= ( const [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) & Rhs ) const


code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) operator-- ( int )


code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) operator++ ( int )


description: Advances iterator to the next element in the container.


code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) operator- ( SizeType Offset ) const


code: [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator) & operator-= ( SizeType Offset )


description: Moves iterator to the previous element in the container.


description: Removes current element in array. This invalidates the current iterator value and it must be incremented

code: void RemoveCurrent()


description: Resets the iterator to the first element.

code: void Reset()


description: Removes current element in array by swapping it with the end element and popping it from the end. This invalidates the current iterator value and it must be incremented. Note this modifies the order of the remaining elements in the array.

code: void RemoveCurrentSwap()


description: Sets the iterator to one past the last element.

code: void SetToEnd()


code: TIndexedContainerIterator ( ContainerType & InContainer, SizeType StartIndex )


className: TIndexedContainerIterator

description: Generic iterator which can operate on types that expose the following:

code: template<typename ContainerType, typename ElementType, typename SizeType> class TIndexedContainerIterator


description: Adds a new item to the end of the array, possibly reallocating the whole array to fit.Indexto the new item.

code: int32 Add ( T * Item )


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


description: Count bytes needed to serialize this array.

code: void CountBytes ( [FArchive](API\Runtime\Core\Serialization\FArchive) & Ar ) const


description:
Creates a const iterator for the contents of this array.
The const iterator.


description:
Creates an iterator for the contents of this array.
The iterator.


description: Empties the array. It calls the destructors on held items.

code: void Empty ( int32 Slack )


description:
Helper function to return the amount of memory allocated by this container
Number of bytes allocated by this container.

code: SIZE_T GetAllocatedSize() const


description:
Helper function for returning a typed pointer to the first array entry.
Pointer to first array entry or nullptr if this->ArrayMax == 0.

code: T ** GetData()


code: const T ** GetData() const


description:
Helper function returning the size of the inner type.
Size in bytes of array type.

code: static constexpr uint32 GetTypeSize()


description: Inserts a given element into the array at given location.

code: void Insert ( T * Item, int32 Index )


className: InternalArrayType

code: typedef [TArray](API\Runtime\Core\Containers\TArray)< void *, Allocator > InternalArrayType


description: Num

code: bool IsEmpty() const


description:
Tests if index is valid, i.e. greater than zero and less than number of elements in array.
True if index is valid. False otherwise.

code: bool IsValidIndex ( int32 Index ) const


description:
Returns n-th last element from the array.
Reference to n-th last element from the array.

code: [ElementType](API\Runtime\Core\Containers\TIndirectArray\ElementType) & Last ( int32 IndexFromTheEnd )


description:
Const version.
Reference to n-th last element from the array.

code: const [ElementType](API\Runtime\Core\Containers\TIndirectArray\ElementType) & Last ( int32 IndexFromTheEnd ) const


description:
Gets number of elements in array.
Number of elements in array.

code: int32 Num() const


code: [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) & operator= ( [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) && Other )


description: Assignment operators.

code: [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) & operator= ( const [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) & Other )


description:
Bracket array access operator.
Reference to element in array at given position.

code: T & operator[] ( int32 Index )


description:
Const version.
Reference to element in array at given position.

code: const T & operator[] ( int32 Index ) const


description: Removes an element (or elements) at given location optionally shrinking the array.

code: void RemoveAt ( int32 Index, int32 Count, bool bAllowShrinking )


description: This version is much more efficient than RemoveAt (O(Count) instead of O(ArrayNum)), but does not preserve the order.

code: void RemoveAtSwap ( int32 Index, int32 Count, bool bAllowShrinking )


description: Reserves memory such that the array can contain at least Number elements.

code: void Reserve ( int32 Number )


description: Special serialize function passing the owningUObjectalong as required by FUnytpedBulkData serialization.

code: void Serialize ( [FArchive](API\Runtime\Core\Serialization\FArchive) & Ar, [UObject](API\Runtime\CoreUObject\UObject\UObject) * Owner )


description: Resets the array to the new given size. It calls the destructors on held items.

code: void Reset ( int32 NewSize )


description: Shrinks the array's used memory to smallest possible to store elements currently in it.

code: void Shrink()


description: This version is doing more sanity checks than SwapMemory.

code: void Swap ( int32 FirstIndexToSwap, int32 SecondIndexToSwap )


className: TIterator

description: Iterators.


className: TConstIterator

code: typedef [TIndexedContainerIterator](API\Runtime\Core\Containers\TIndexedContainerIterator)< const [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray), const [ElementType](API\Runtime\Core\Containers\TIndirectArray\ElementType), int32 > TConstIterator


description: Default constructors.

code: TIndirectArray()


code: TIndirectArray ( [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) && )


description: Copy constructor.

code: TIndirectArray ( const [TIndirectArray](API\Runtime\Core\Containers\TIndirectArray) & Other )


description: Destructor.

code: ~TIndirectArray()


className: TIndirectArray

code: template<typename T, typename Allocator> class TIndirectArray


description: Computes the number of hash buckets to use for a given number of elements.

code: static uint32 GetNumberOfHashBuckets ( uint32 NumHashedElements )


className: HashAllocator

code: typedef TInlineAllocator< NumInlineHashBuckets, typename SecondaryAllocator::HashAllocator > HashAllocator


className: NumInlineHashBuckets

code: enum { NumInlineHashBuckets = (NumInlineElements + AverageNumberOfElementsPerHashBucket - 1) / AverageNumberOfElementsPerHashBucket }


className: SparseArrayAllocator

code: typedef [TInlineSparseArrayAllocator](API\Runtime\Core\Containers\TInlineSparseArrayAllocator)< NumInlineElements, typename SecondaryAllocator::SparseArrayAllocator > SparseArrayAllocator


className: TInlineSetAllocator

description: An inline set allocator that allows sizing of the inline allocations for a set number of elements.

code: template<uint32 NumInlineElements, typename SecondaryAllocator, uint32 AverageNumberOfElementsPerHashBucket, uint32 MinNumberOfHashedElements> class TInlineSetAllocator


className: BitArrayAllocator

code: typedef TInlineAllocator< InlineBitArrayDWORDs, typename SecondaryAllocator::BitArrayAllocator > BitArrayAllocator


className: ElementAllocator

code: typedef TInlineAllocator< NumInlineElements, typename SecondaryAllocator::ElementAllocator > ElementAllocator


className: InlineBitArrayDWORDs

description: The size to allocate inline for the bit array.

code: enum { InlineBitArrayDWORDs = (NumInlineElements + ((int32)32) - 1) / ((int32)32) }


className: TInlineSparseArrayAllocator

description: An inline sparse array allocator that allows sizing of the inline allocations for a set number of elements.

code: template<uint32 NumInlineElements, typename SecondaryAllocator> class TInlineSparseArrayAllocator


code: void AddHead ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * Element )


code: void AddHead ( [TIntrusiveDoubleLinkedList](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList) && Other )


code: void AddTail ( [TIntrusiveDoubleLinkedList](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList) && Other )


code: void AddTail ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * Element )


className: ElementType

code: typedef InElementType ElementType


code: static void InsertAfter ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * InsertThis, [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * AfterThis )


code: static void InsertBefore ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * InsertThis, [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * BeforeThis )


code: [TIntrusiveDoubleLinkedList](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList) & operator= ( const [TIntrusiveDoubleLinkedList](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList) & )


code: static void Remove ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList\ElementType) * Element )


description: IsFilled

code: void Reset()


code: TIntrusiveDoubleLinkedList ( const [TIntrusiveDoubleLinkedList](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedList) & )


className: TIntrusiveDoubleLinkedList

description: TDoubleLinkedList

code: template<class InElementType, class ContainerType> class TIntrusiveDoubleLinkedList


code: typedef typename NodeType::ElementType ElementType


code: [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-\ElementType) * GetNode() const


description: Accessors.

code: [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-\ElementType) & operator->() const


code: bool operator== ( const [TIntrusiveDoubleLinkedListIterator](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-) & Other ) const


code: bool operator!= ( const [TIntrusiveDoubleLinkedListIterator](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-) & Other ) const


code: [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-\ElementType) & operator*() const


code: [TIntrusiveDoubleLinkedListIterator](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-) operator-- ( int )


code: [TIntrusiveDoubleLinkedListIterator](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-) operator++ ( int )


code: TIntrusiveDoubleLinkedListIterator ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListIterat-\ElementType) * Node )


className: TIntrusiveDoubleLinkedListIterator

description: Iterator for intrusive double linked list.

code: template<class NodeType> class TIntrusiveDoubleLinkedListIterator


code: [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode\ElementType) * GetNext() const


code: typedef InElementType ElementType


code: [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode\ElementType) * GetPrev() const


code: const [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode\ElementType) * GetThisElement() const


description: Insert this node after the specified node

code: void InsertAfter ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode\ElementType) * NewPrev )


description: Insert this node before the specified node

code: void InsertBefore ( [ElementType](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode\ElementType) * NewNext )


className: NodeType

code: typedef [TIntrusiveDoubleLinkedListNode](API\Runtime\Core\Containers\TIntrusiveDoubleLinkedListNode)< InElementType, ContainerType > NodeType


description: Removes this element from the list in constant time.

code: void Remove()


className: TIntrusiveDoubleLinkedListNode

description: Node of an intrusive double linked list Structs/classes must inherit this, to use it, e.g: struct FMyStruct : public TIntrusiveDoubleLinkedListNodeTIntrusiveDoubleLinkedListNodecan be inherited multiple times, ex: if ElementType needs to be stored in several lists at once by specifying a different ContainerType template parameter to distinguish the nodes.

code: template<class InElementType, class ContainerType> class TIntrusiveDoubleLinkedListNode

Next

type: ElementType...


className: Super

code: typedef [TLinkedListBase](API\Runtime\Core\Containers\TLinkedListBase)< ElementType, ElementType, [TIntrusiveLinkedListIterator](API\Runtime\Core\Containers\TIntrusiveLinkedListIterator) > Super


description: Default constructor (empty list).

code: TIntrusiveLinkedList()


description: Accessors.

code: ElementType & operator->() const


className: TIntrusiveLinkedList

description: for (FMyStruct::TIterator It(MyLinkedList); It; It.Next()) { ... }

code: template<class ElementType> class TIntrusiveLinkedList : public [TLinkedListBase< ElementType, ElementType, TIntrusiveLinkedListIterator >](API\Runtime\Core\Containers\TLinkedListBase)


code: typedef [TLinkedListIteratorBase](API\Runtime\Core\Containers\TLinkedListIteratorBase)< ElementType > Super


code: TIntrusiveLinkedListIterator ( ElementType * FirstLink )


className: TIntrusiveLinkedListIterator

code: template<class ContainerType, class ElementType> class TIntrusiveLinkedListIterator : public [TLinkedListIteratorBase< ElementType >](API\Runtime\Core\Containers\TLinkedListIteratorBase)


className: Value

description: NOTE: The stars in theTPointerIsConvertibleFromTotest areIMPORTANTThey prevent TArrayView(TArray&) from compiling!

code: enum { Value = TPointerIsConvertibleFromTo<T*, ElementType* const>::Value }


className: TIsCompatibleElementType

description: Trait testing whether a type is compatible with the view type

code: template<typename T, typename ElementType> struct TIsCompatibleElementType


code: template<typename T> static decltype(auto) GetData ( T && Arg )


code: static constexpr bool Value = TIsCompatibleElementType<typename TRemovePointer<decltype(GetData(DeclVal<RangeType&>()))>::Type, ElementType>::Value;


className: TIsCompatibleRangeType

code: template<typename RangeType, typename ElementType> struct TIsCompatibleRangeType


code: enum { Value = !std::is_same_v<typename TContainerElementTypeCompatibility<ElementType>::CopyFromOtherType, ElementType> }


className: TIsContainerElementTypeCopyable

description: Temporary compatibility mechanism to be used solely for the purpose of raw pointers to wrapped pointers. These types and the container methods that leverage them will be removed in a future release.

code: template<typename ElementType> struct TIsContainerElementTypeCopyable


code: enum { Value = !std::is_same_v<typename TContainerElementTypeCompatibility<ElementType>::ReinterpretType, ElementType> }


className: TIsContainerElementTypeReinterpretable

code: template<typename ElementType> struct TIsContainerElementTypeReinterpretable


code: template<> struct TIsContiguousContainer< FStringOutputDevice >


code: template<> struct TIsContiguousContainer< FStringOutputDeviceCountLines >


className: TypeCompat

code: typedef [TContainerElementTypeCompatibility](API\Runtime\Core\Containers\TContainerElementTypeCompatibili-)< NaturalElementType > TypeCompat


className: NaturalElementType

code: typedef typename [TRemovePointer](API\Runtime\Core\Templates\TRemovePointer)< decltype([GetData](API\Runtime\Core\Containers\TIsReinterpretableRangeType\GetData)(DeclVal< RangeType & >()))>::Type NaturalElementType


code: static constexpr bool Value = !std::is_same_v<typename TypeCompat::ReinterpretType, NaturalElementType> && TIsCompatibleElementType<typename TypeCompat::ReinterpretType, ElementType>::Value && (! 0 || std::is_same_v<ElementType, std::remove_pointer_t<typename TypeCompat::ReinterpretType>* const> || std::is_same_v<ElementType, const std::remove_pointer_t<typename TypeCompat::ReinterpretType>* const>);


className: TIsReinterpretableRangeType

description: Trait testing whether a type is reinterpretable in a way that permits use with the view type

code: template<typename RangeType, typename ElementType> struct TIsReinterpretableRangeType


code: enum { Value = TIsTArray_V<T> }


className: TIsTArray

code: template<typename T> struct TIsTArray


code: template<typename ElementType, typename AllocatorType> static char(& Resolve ( const volatile [TArray](API\Runtime\Core\Containers\TArray)< ElementType, AllocatorType > * )


code: enum { Value = sizeof(Resolve((T*)nullptr)) == 2 }


code: static constexpr bool Value = false;


className: TIsTArrayView

code: template<typename T> struct TIsTArrayView


className: TIsTArrayOrDerivedFromTArray

code: template<typename T> struct TIsTArrayOrDerivedFromTArray


className: TIsTEnumAsByte

code: template<typename T> struct TIsTEnumAsByte


className: TIsTMap

description: Traits class which determines whether or not a type is aTMap.

code: template<typename T> struct TIsTMap


className: TIsTSet

description: Traits class which determines whether or not a type is aTSet.

code: template<typename T> struct TIsTSet


className: TIsZeroConstructType< FScriptArray >

code: template<> struct TIsZeroConstructType< FScriptArray >


className: TIsZeroConstructType< FString >

code: template<> struct TIsZeroConstructType< FString >


className: TIterator

code: typedef [TIteratorAdapter](API\Runtime\Core\Containers\TIteratorAdapter)< [TIteratorBase](API\Runtime\Core\Containers\TIteratorBase_1)< InElementType, InPageType, InPageTraits >> TIterator


className: ElementType

code: typedef typename BaseType::ElementType ElementType


code: [ElementType](API\Runtime\Core\Containers\TIteratorAdapter\ElementType) * operator->() const


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) operator+ ( [SizeType](API\Runtime\Core\Containers\TIteratorAdapter\SizeType) Offset ) const


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) & operator+= ( [SizeType](API\Runtime\Core\Containers\TIteratorAdapter\SizeType) Offset )


code: bool operator== ( const [TIteratorAdapter](API\Runtime\Core\Containers\TIteratorAdapter) & Right ) const


code: bool operator!= ( const [TIteratorAdapter](API\Runtime\Core\Containers\TIteratorAdapter) & Right ) const


code: [ElementType](API\Runtime\Core\Containers\TIteratorAdapter\ElementType) & operator*() const


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) operator-- ( int )


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) operator++ ( int )


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) operator- ( [SizeType](API\Runtime\Core\Containers\TIteratorAdapter\SizeType) Offset ) const


code: [ThisType](API\Runtime\Core\Containers\TIteratorAdapter\ThisType) & operator-= ( [SizeType](API\Runtime\Core\Containers\TIteratorAdapter\SizeType) Offset )


className: SizeType

code: typedef typename BaseType::SizeType SizeType


className: ThisType

code: typedef [TIteratorAdapter](API\Runtime\Core\Containers\TIteratorAdapter)< Base > ThisType


description: Perfect forwarding constructor to the iterator class.

code: template<typename... Args> TIteratorAdapter ( EInPlace, Args &&... InArgs )


code: [ElementType](API\Runtime\Core\Containers\TIteratorBase\ElementType) & Dereference() const


className: TIteratorAdapter

description: Types:

code: template<typename Base> class TIteratorAdapter : public Base


code: typedef InElementType ElementType


code: bool Equals ( const [TIteratorBase](API\Runtime\Core\Containers\TIteratorBase) & Other ) const


description: Internal parameter constructor (used exclusively by the container).

code: TIteratorBase ( [ElementType](API\Runtime\Core\Containers\TIteratorBase\ElementType) * Data, [SizeType](API\Runtime\Core\Containers\TIteratorBase\SizeType) Range, [SizeType](API\Runtime\Core\Containers\TIteratorBase\SizeType) Offset )


className: TIteratorBase

description: TDequeiterator class.

code: template<typename InElementType, typename InSizeType> class TIteratorBase


code: [ElementType](API\Runtime\Core\Containers\TIteratorBase_1\ElementType) & Dereference() const


code: bool Equals ( const [TIteratorBase](API\Runtime\Core\Containers\TIteratorBase_1) & Other ) const


className: PageTraits

code: typedef InPageTraits PageTraits


code: typedef typename PageType::SizeType SizeType


code: TIteratorBase ( InPageType * Data, [SizeType](API\Runtime\Core\Containers\TIteratorBase_1\SizeType) Offset )


code: typedef [TIteratorAdapter](API\Runtime\Core\Containers\TIteratorAdapter)< [TIteratorBase](API\Runtime\Core\Containers\TIteratorBase)< InElementType, InSizeType >> TIterator


className: TKeyInitializer::operator TPair< KeyType, ValueType >

code: template<typename KeyType, typename ValueType> operator TPair< KeyType, ValueType >() const


description: Initialization constructor.

code: TKeyInitializer ( KeyInitType InKey )


className: TKeyInitializer

description: An initializer type for keys that's passed to the pair set when adding a new key.

code: template<typename KeyInitType> class TKeyInitializer

Key

type: TRValueToLValue...


description: Accessors.

code: ElementType * operator->()


code: const ElementType * operator->() const


code: const ElementType & operator*() const


className: Super

code: typedef [TLinkedListBase](API\Runtime\Core\Containers\TLinkedListBase)< [TLinkedList](API\Runtime\Core\Containers\TLinkedList)< ElementType >, ElementType, [TLinkedListIterator](API\Runtime\Core\Containers\TLinkedListIterator) > Super


description: TPagedArrayiterator base class forTIteratorAdapter.

code: template<typename InElementType, typename InPageType, typename InPageTraits> class TIteratorBase


description: Default constructor (empty list).

code: TLinkedList()


description: Creates a new linked list with a single element.

code: TLinkedList ( const ElementType & InElement )


className: TLinkedList

description: This linked list is non-intrusive, i.e. it stores a copy of the element passed to it (typically a pointer)

code: template<class ElementType> class TLinkedList : public [TLinkedListBase< TLinkedList< ElementType >, ElementType, TLinkedListIterator >](API\Runtime\Core\Containers\TLinkedListBase)


description:
Returns whether element is currently linked.
true if currently linked, false otherwise

code: bool IsLinked()


description: Adds this element to the linked list, after the specified element

code: void LinkAfter ( ContainerType * After )


description: Adds this element to a list, before the given element.

code: void LinkBefore ( ContainerType * Before )


description: If Head already has an element, this functions like LinkBefore.

code: void LinkHead ( ContainerType *& Head )


description: Adds this element to the linked list, replacing the specified element. This is equivalent to calling LinkBefore(Replace); Replace->Unlink();

code: void LinkReplace ( ContainerType * Replace )


code: ContainerType ** GetPrevLink() const


className: TConstIterator

code: typedef IteratorType< ContainerType, const ElementType > TConstIterator


description: Used to iterate over the elements of a linked list.

code: typedef IteratorType< ContainerType, ElementType > TIterator


description: This function is safe to call even if the element is not linked.

code: void Unlink()


description: Default constructor (empty list)

code: TLinkedListBase()


className: TLinkedListBase

description: Base linked list class, used to implement methods shared by intrusive/non-intrusive linked lists

code: template<class ContainerType, class ElementType, template< class, class > class IteratorType> class TLinkedListBase


description: Accessors.

code: ElementType & operator->() const


code: typedef [TLinkedListIteratorBase](API\Runtime\Core\Containers\TLinkedListIteratorBase)< ContainerType > Super


code: TLinkedListIterator ( ContainerType * FirstLink )


className: TLinkedListIterator

code: template<class ContainerType, class ElementType> class TLinkedListIterator : public [TLinkedListIteratorBase< ContainerType >](API\Runtime\Core\Containers\TLinkedListIteratorBase)


description: Advances the iterator to the next element.

code: void Next()


className: TLinkedListIteratorBase::operator bool

description: Conversion to "bool" returning true if the iterator is valid.

code: operator bool() const


code: bool operator== ( const [TLinkedListIteratorBase](API\Runtime\Core\Containers\TLinkedListIteratorBase) & Rhs ) const


code: bool operator!= ( const [TLinkedListIteratorBase](API\Runtime\Core\Containers\TLinkedListIteratorBase) & Rhs ) const


code: [TLinkedListIteratorBase](API\Runtime\Core\Containers\TLinkedListIteratorBase) operator++ ( int )


className: TLinkedListIteratorBase

code: template<class ContainerType> class TLinkedListIteratorBase

CurrentLink

type: ContainerType &...


code: TLinkedListIteratorBase ( ContainerType * FirstLink )


code: TList ( const ElementType & InElement, [TList](API\Runtime\Core\Containers\TList)< ElementType > * InNext )


className: TList

description: Simple single-linked list template.

code: template<class ElementType> class TList

Next

type: TList< ElementT...


className: MaxBlocks

code: enum { MaxBlocks = (MaxTotalItems + ItemsPerPage - 1) / ItemsPerPage }


code: TLockFreeAllocOnceIndexedAllocator()


className: TLockFreeAllocOnceIndexedAllocator

code: template<class T, unsigned int MaxTotalItems, unsigned int ItemsPerPage> class TLockFreeAllocOnceIndexedAllocator


description: New

code: void * Allocate()


description: New

code: void Free ( T * Item )


description: Free

code: T * New()


className: TLockFreeClassAllocator

description: Never returns free space until program shutdown.

code: template<class T, int TPaddingForCacheContention, bool AllowDisablingOfTrim> class TLockFreeClassAllocator : private [TLockFreeFixedSizeAllocator< sizeof(T), TPaddingForCacheContention, FNoopCounter, AllowDisablingOfTrim >](API\Runtime\Core\Containers\TLockFreeFixedSizeAllocator)


description: Free


code: template<class T, int TPaddingForCacheContention, bool AllowDisablingOfTrim> class TLockFreeClassAllocator_TLSCache : private [TLockFreeFixedSizeAllocator_TLSCache< sizeof(T), TPaddingForCacheContention, FNoopCounter, AllowDisablingOfTrim >](API\Runtime\Core\Containers\TLockFreeFixedSizeAllocator_TLSC-)


description: Allocate

code: void Free ( void * Item )


description: GetNumUsed

code: const TTrackingCounter & GetNumFree() const


description: GetNumFree

code: const TTrackingCounter & GetNumUsed() const


description: Returns all free memory to the heap

code: void Trim()


description: Destructor, returns all memory viaFMemory::Free

code: ~TLockFreeFixedSizeAllocator()


className: TLockFreeFixedSizeAllocator

description: Thread safe, lock free pooling allocator of fixed size blocks that never returns free space until program shutdown. alignment isn't handled, assumesFMemory::Mallocwill work

code: template<int32 SIZE, int TPaddingForCacheContention, typename TTrackingCounter, bool AllowDisablingOfTrim> class TLockFreeFixedSizeAllocator


description: Thread safe, lock free pooling allocator of fixed size blocks that never returns free space, even at shutdown alignment isn't handled, assumesFMemory::Mallocwill work

code: template<int32 SIZE, int TPaddingForCacheContention, typename TTrackingCounter, bool AllowDisablingOfTrim> class TLockFreeFixedSizeAllocator_TLSCache : public [TLockFreeFixedSizeAllocator_TLSCacheBase< SIZE, TLockFreePointerListUnordered< void *, TPaddingForCacheContention >, TTrackingCounter, AllowDisablingOfTrim >](API\Runtime\Core\Containers\TLockFreeFixedSizeAllocator_TLSC-_1)


code: enum { NUM_PER_BUNDLE = SIZE_PER_BUNDLE / SIZE }


code: template<int32 SIZE, typename TBundleRecycler, typename TTrackingCounter, bool AllowDisablingOfTrim> class TLockFreeFixedSizeAllocator_TLSCacheBase : public [FNoncopyable](API\Runtime\Core\Templates\FNoncopyable)


description: Destructor, leaks all of the memory


description:
Check if the list is empty.
true if the list is empty. CAUTION: This methods safety depends on external assumptions. For example, if another thread could add to the list at any time, the return value is no better than a best guess. As typically used, the list is not being access concurrently when this is called.

code: bool IsEmpty() const


description:
Pop an item from the list or return NULL if the list is empty.
The popped item, if any.

code: T * Pop()


description: Pop all items from the list.

code: void PopAll ( [TArray](API\Runtime\Core\Containers\TArray)< T * > & Output )


description: Push an item onto the head of the list.

code: void Push ( T * NewItem )


className: TLockFreePointerListFIFO

code: template<class T, int TPaddingForCacheContention> class TLockFreePointerListFIFO : private [FLockFreePointerFIFOBase< T, TPaddingForCacheContention >](API\Runtime\Core\Containers\FLockFreePointerFIFOBase)


className: TLockFreePointerListLIFO

code: template<class T> class TLockFreePointerListLIFO : public [TLockFreePointerListLIFOPad< T, 0 >](API\Runtime\Core\Containers\TLockFreePointerListLIFOPad)


className: TLockFreePointerListLIFOPad

code: template<class T, int TPaddingForCacheContention> class TLockFreePointerListLIFOPad : private [FLockFreePointerListLIFOBase< T, TPaddingForCacheContention >](API\Runtime\Core\Containers\FLockFreePointerListLIFOBase)


className: TLockFreePointerListUnordered

code: template<class T, int TPaddingForCacheContention> class TLockFreePointerListUnordered : public [TLockFreePointerListLIFOPad< T, TPaddingForCacheContention >](API\Runtime\Core\Containers\TLockFreePointerListLIFOPad)


description: Remove

code: void Add ( const KeyType & Key, const ValueType & Value )


description: Remove

code: bool Contains ( const KeyType & Key ) const


description: RemoveByPredicate

code: template<typename Predicate> bool ContainsByPredicate ( Predicate Pred ) const


description: Remove

code: void Empty ( int32 InMaxNumElements )


description: RemoveByPredicate

code: template<typename Predicate> [TArray](API\Runtime\Core\Containers\TArray)< ValueType > FilterByPredicate ( Predicate Pred ) const


description: Remove

code: const ValueType * Find ( const KeyType & Key ) const


description: Remove

code: ValueType * Find ( const KeyType & Key )


description: Remove

code: const ValueType * FindAndTouch ( const KeyType & Key )


description:
Find the value of the entry with the specified key and mark it as the most recently used.
Pointer to the value, or triggers an assertion if the key does not exist.

code: const ValueType & FindAndTouchChecked ( const KeyType & Key )


description:
Find the value of the entry with the specified key and mark it as the most recently used.
Copy of the value, or the default value for the ValueType if the key does not exist.

code: ValueType FindAndTouchRef ( const KeyType & Key )


description: RemoveByPredicate

code: template<typename Predicate> const ValueType * FindByPredicate ( Predicate Pred ) const


description:
Find the value of the entry with the specified key.
Reference to the value, or triggers an assertion if the key does not exist.

code: const ValueType & FindChecked ( const KeyType & Key ) const


description:
Find the value of the entry with the specified key.
Copy of the value, or the default value for the ValueType if the key does not exist.

code: ValueType FindRef ( const KeyType & Key ) const


description: Find

code: void GetKeys ( [TArray](API\Runtime\Core\Containers\TArray)< KeyType > & OutKeys ) const


description: Num

code: bool IsEmpty() const


description: Num

code: int32 Max() const


description: Mark the given entry as recently used.

code: void MarkAsRecent ( FCacheEntry & Entry )


description: Max

code: int32 Num() const


description: RemoveByPredicate

code: void Remove ( const KeyType & Key )


description: Remove the specified entry from the cache.

code: void Remove ( FCacheEntry * Entry )


description: Remove

code: template<typename Predicate> int32 RemoveByPredicate ( Predicate Pred )


description:
Remove and return the least recent element from the cache.
Copy of removed value.

code: ValueType RemoveLeastRecent()


code: ValueType & operator&45;>&40;&41; const


className: TLruCache::TBaseIterator::operator bool

code: operator bool&40;&41; const


code: bool operator&61;&61; &40; const TBaseIterator & Rhs &41; const


code: bool operator&33;&61; &40; const TBaseIterator & Rhs &41; const


code: ValueType & operator&42;&40;&41; const


code: TBaseIterator &40; const TLruCache & Cache &41;


className: TBaseIterator

description: Iteration begins at the most recent entry.

code: template<bool Const> class TBaseIterator


code: TConstIterator &40; const TLruCache & Cache &41;


description: Cache iterator (const).

code: class TConstIterator : public [TLruCache< KeyType, ValueType, KeyComp >::TBaseIterator< true >](API\Runtime\Core\Containers\TLruCache\TBaseIterator)


description: Removes the current element from the cache and increments the iterator.

code: void RemoveCurrentAndIncrement&40;&41;


code: TIterator &40; TLruCache & InCache &41;


className: TIterator

description: Cache iterator.

code: class TIterator : public [TLruCache< KeyType, ValueType, KeyComp >::TBaseIterator< false >](API\Runtime\Core\Containers\TLruCache\TBaseIterator)


description: Create and initialize a new instance.

code: TLruCache ( int32 InMaxNumElements )


description: Default constructor (empty cache that cannot hold any values).

code: TLruCache()


description: Destructor.

code: ~TLruCache()


className: TLruCache

description: Implements a Least Recently Used (LRU) cache.

code: template<typename KeyType, typename ValueType, typename KeyComp> class TLruCache


description: Move all items from another map into our map (if any keys are in both, the value from the other map wins) and empty the other map.

code: template<typename OtherSetAllocator> void Append ( [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > && OtherMap )


description: Add all items from another map to our map (if any keys are in both, the value from the other map wins).

code: template<typename OtherSetAllocator> void Append ( const [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > & OtherMap )


description:
If no pair was found, an exception is thrown.
whether or not the key was found

code: [ValueType](API\Runtime\Core\Containers\TMap\ValueType) FindAndRemoveChecked ( [KeyConstPointerType](API\Runtime\Core\Containers\TMap\KeyConstPointerType) Key )


className: KeyFuncsType

code: typedef KeyFuncs KeyFuncsType


code: [TMap](API\Runtime\Core\Containers\TMap) & operator= ( [TMap](API\Runtime\Core\Containers\TMap) && )


code: [TMap](API\Runtime\Core\Containers\TMap) & operator= ( const [TMap](API\Runtime\Core\Containers\TMap) & )


description: Assignment operator for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMap](API\Runtime\Core\Containers\TMap) & operator= ( [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > && Other )


description: Assignment operator for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMap](API\Runtime\Core\Containers\TMap) & operator= ( const [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > & Other )


description: Assignment operator which gets its elements from a native initializer list

code: [TMap](API\Runtime\Core\Containers\TMap) & operator= ( std::initializer_list< [TPairInitializer](API\Runtime\Core\Containers\TPairInitializer)< const [KeyType](API\Runtime\Core\Containers\TMap\KeyType) &, const [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & >> InitList )


code: [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & operator[] ( [KeyConstPointerType](API\Runtime\Core\Containers\TMap\KeyConstPointerType) Key )


code: const [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & operator[] ( [KeyConstPointerType](API\Runtime\Core\Containers\TMap\KeyConstPointerType) Key ) const


description:
Remove the pair with the specified key and copies the value that was removed to the ref parameter
whether or not the key was found

code: bool RemoveAndCopyValue ( [KeyInitType](API\Runtime\Core\Containers\TMap\KeyInitType) Key, [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & OutRemovedValue )


description: SeeRemoveAndCopyValue()and class documentation section on ByHash() functions

code: template<typename ComparableKey> bool RemoveAndCopyValueByHash ( uint32 KeyHash, const ComparableKey & Key, [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & OutRemovedValue )


className: SetAllocatorType

code: typedef SetAllocator SetAllocatorType


className: ValueType

code: typedef InValueType ValueType


code: TMap ( const [TMap](API\Runtime\Core\Containers\TMap) & )


code: TMap ( [TMap](API\Runtime\Core\Containers\TMap) && )


description: Constructor for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMap ( [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > && Other )


description: Constructor for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMap ( const [TMap](API\Runtime\Core\Containers\TMap)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), OtherSetAllocator, KeyFuncs > & Other )


description: Constructor which gets its elements from a native initializer list

code: TMap ( std::initializer_list< [TPairInitializer](API\Runtime\Core\Containers\TPairInitializer)< const [KeyType](API\Runtime\Core\Containers\TMap\KeyType) &, const [ValueType](API\Runtime\Core\Containers\TMap\ValueType) & >> InitList )


className: TMap

description: ATMapBasespecialization that only allows a single value associated with each key.

code: template<typename InKeyType, typename InValueType, typename SetAllocator, typename KeyFuncs> class TMap : public [TSortableMapBase< InKeyType, InValueType, SetAllocator, KeyFuncs >](API\Runtime\Core\Containers\TSortableMapBase)


description:
Set a default value associated with a key.
A reference to the value as stored in the map. The reference is only valid until the next change to any key in the map.

code: ValueType & Add ( const KeyType & InKey )


code: ValueType & Add ( KeyType && InKey )


description:
Set the value associated with a key.
A reference to the value as stored in the map. The reference is only valid until the next change to any key in the map.

code: ValueType & Add ( const [TTuple](API\Runtime\Core\Misc\TTuple)< KeyType, ValueType > & InKeyValue )


code: ValueType & Add ( [TTuple](API\Runtime\Core\Misc\TTuple)< KeyType, ValueType > && InKeyValue )


code: ValueType & Add ( const KeyType & InKey, const ValueType & InValue )


className: Super

code: typedef [TSortableMapBase](API\Runtime\Core\Containers\TSortableMapBase)< [KeyType](API\Runtime\Core\Containers\TMap\KeyType), [ValueType](API\Runtime\Core\Containers\TMap\ValueType), SetAllocator, KeyFuncs > Super


code: ValueType & Add ( const KeyType & InKey, ValueType && InValue )


code: ValueType & Add ( KeyType && InKey, const ValueType & InValue )


code: ValueType & Add ( KeyType && InKey, ValueType && InValue )


description: SeeAdd()and class documentation section on ByHash() functions

code: ValueType & AddByHash ( uint32 KeyHash, const KeyType & InKey )


code: ValueType & AddByHash ( uint32 KeyHash, KeyType && InKey )


code: ValueType & AddByHash ( uint32 KeyHash, const KeyType & InKey, const ValueType & InValue )


code: ValueType & AddByHash ( uint32 KeyHash, const KeyType & InKey, ValueType && InValue )


code: ValueType & AddByHash ( uint32 KeyHash, KeyType && InKey, const ValueType & InValue )


code: ValueType & AddByHash ( uint32 KeyHash, KeyType && InKey, ValueType && InValue )


code: static void AppendHash ( const [FPlatformTypeLayoutParameters](API\Runtime\Core\Serialization\FPlatformTypeLayoutParameters) & LayoutParams, [FSHA1](API\Runtime\Core\Misc\FSHA1) & Hasher )


description: Copy the key/value pairs in this map into an array.

code: [TArray](API\Runtime\Core\Containers\TArray)< [ElementType](API\Runtime\Core\Containers\TMapBase\ElementType) > Array() const


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


description: Compacts the pair set to remove holes

code: void Compact()


description: Compacts the pair set to remove holes. Does not change the iteration order of the elements.

code: void CompactStable()


description:
Check if map contains the specified key.
true if the map contains the key.

code: bool Contains ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key ) const


description: SeeContains()and class documentation section on ByHash() functions

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


code: void CopyUnfrozen ( const [FMemoryUnfreezeContent](API\Runtime\Core\Serialization\FMemoryUnfreezeContent) & Context, void * Dst ) const


description: GetAllocatedSize

code: void CountBytes ( [FArchive](API\Runtime\Core\Serialization\FArchive) & Ar ) const


description: Creates a const iterator over all the pairs in this map


description: Creates a const iterator over the values associated with a specified key in a map

code: [TConstKeyIterator](API\Runtime\Core\Containers\TMapBase\TConstKeyIterator) CreateConstKeyIterator ( typename [TConstKeyIterator::KeyArgumentType](API\Runtime\Core\Containers\TMapBase\TConstKeyIterator\KeyArgumentType) InKey ) const


description: Creates an iterator over all the pairs in this map


description: Describes the map's contents through an output device.

code: void Dump ( [FOutputDevice](API\Runtime\Core\Misc\FOutputDevice) & Ar )


description: Creates an iterator over the values associated with a specified key in a map

code: [TKeyIterator](API\Runtime\Core\Containers\TMapBase\TKeyIterator) CreateKeyIterator ( typename [TKeyIterator::KeyArgumentType](API\Runtime\Core\Containers\TMapBase\TKeyIterator\KeyArgumentType) InKey )


className: ElementSetType

code: typedef [TSet](API\Runtime\Core\Containers\TSet)< [ElementType](API\Runtime\Core\Containers\TMapBase\ElementType), KeyFuncs, SetAllocator > ElementSetType


className: ElementType

code: typedef TPair< KeyType, ValueType > ElementType


code: template<typename InitKeyType> ValueType & Emplace ( InitKeyType && InKey )


description:
Sets the value associated with a key.
A reference to the value as stored in the map. The reference is only valid until the next change to any key in the map.

code: template<typename InitKeyType, typename InitValueType> ValueType & Emplace ( InitKeyType && InKey, InitValueType && InValue )


description: SeeEmplace()and class documentation section on ByHash() functions

code: template<typename InitKeyType> ValueType & EmplaceByHash ( uint32 KeyHash, InitKeyType && InKey )


code: template<typename InitKeyType, typename InitValueType> ValueType & EmplaceByHash ( uint32 KeyHash, InitKeyType && InKey, InitValueType && InValue )


description: This method potentially leaves space allocated for an expected number of elements about to be added.

code: void Empty ( int32 ExpectedNumElements )


description: Filters the elements in the map based on a predicate functor.TMapwith the same type as this object which contains the subset of elements for which the functor returns true.

code: template<typename Predicate> [TMap](API\Runtime\Core\Containers\TMap)< KeyType, ValueType, SetAllocator, KeyFuncs > FilterByPredicate ( Predicate Pred ) const


code: const ValueType * Find ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key ) const


description:
Find the value associated with a specified key.
A pointer to the value associated with the specified key, or nullptr if the key isn't contained in this map. The pointer is only valid until the next change to any key in the map.

code: ValueType * Find ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key )


description: SeeFind()and class documentation section on ByHash() functions

code: template<typename ComparableKey> ValueType * FindByHash ( uint32 KeyHash, const ComparableKey & Key )


code: template<typename ComparableKey> const ValueType * FindByHash ( uint32 KeyHash, const ComparableKey & Key ) const


description:
Find a reference to the value associated with a specified key.
The value associated with the specified key, or triggers an assertion if the key does not exist.

code: const ValueType & FindChecked ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key ) const


code: ValueType & FindChecked ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key )


description:
The time taken is O(N) in the number of pairs.
A pointer to the key associated with the specified value, or nullptr if the value isn't contained in this map. The pointer is only valid until the next change to any key in the map.

code: const KeyType * FindKey ( [ValueInitType](API\Runtime\Core\Containers\TMapBase\ValueInitType) Value ) const


description:
Find the value associated with a specified key, or if none exists, adds a value using the default constructor.
A reference to the value associated with the specified key.

code: ValueType & FindOrAdd ( const KeyType & Key )


code: ValueType & FindOrAdd ( KeyType && Key )


code: ValueType & FindOrAdd ( const KeyType & Key, const ValueType & Value )


code: ValueType & FindOrAdd ( const KeyType & Key, ValueType && Value )


code: ValueType & FindOrAdd ( KeyType && Key, ValueType && Value )


code: ValueType & FindOrAdd ( KeyType && Key, const ValueType & Value )


description: SeeFindOrAdd()and class documentation section on ByHash() functions

code: ValueType & FindOrAddByHash ( uint32 KeyHash, const KeyType & Key )


code: ValueType & FindOrAddByHash ( uint32 KeyHash, KeyType && Key )


code: ValueType & FindOrAddByHash ( uint32 KeyHash, const KeyType & Key, const ValueType & Value )


code: ValueType & FindOrAddByHash ( uint32 KeyHash, const KeyType & Key, ValueType && Value )


code: ValueType & FindOrAddByHash ( uint32 KeyHash, KeyType && Key, const ValueType & Value )


code: ValueType & FindOrAddByHash ( uint32 KeyHash, KeyType && Key, ValueType && Value )


description:
Find the value associated with a specified key.
The value associated with the specified key, or the default value for the ValueType if the key isn't contained in this map.

code: ValueType FindRef ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) Key ) const


description: Generate an array from the keys in this map.

code: template<typename Allocator> void GenerateKeyArray ( [TArray](API\Runtime\Core\Containers\TArray)< KeyType, Allocator > & OutArray ) const


description: Generate an array from the values in this map.

code: template<typename Allocator> void GenerateValueArray ( [TArray](API\Runtime\Core\Containers\TArray)< ValueType, Allocator > & OutArray ) const


description: Return a mapped pair by internal identifier. Element must be valid (see ).

code: [ElementType](API\Runtime\Core\Containers\TMapBase\ElementType) & Get ( [FSetElementId](API\Runtime\Core\Containers\FSetElementId) Id )


code: const [ElementType](API\Runtime\Core\Containers\TMapBase\ElementType) & Get ( [FSetElementId](API\Runtime\Core\Containers\FSetElementId) Id ) const


description: CountBytes

code: SIZE_T GetAllocatedSize() const


description:
Get the unique keys contained within this map.
The number of unique keys in the map.

code: template<typename Allocator> int32 GetKeys ( [TArray](API\Runtime\Core\Containers\TArray)< KeyType, Allocator > & OutKeys ) const


code: template<typename Allocator> int32 GetKeys ( [TSet](API\Runtime\Core\Containers\TSet)< KeyType, Allocator > & OutKeys ) const


description: Num

code: bool IsEmpty() const


description: The max valid index of the elements in the sparse storage.

code: int32 GetMaxIndex() const


description:
Checks whether an element id is valid.
true if the element identifier refers to a valid element in this map.

code: bool IsValidId ( [FSetElementId](API\Runtime\Core\Containers\FSetElementId) Id ) const


className: KeyConstPointerType

code: typedef [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< KeyType >::ConstPointerType KeyConstPointerType


className: KeyInitType

code: typedef [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< KeyType >::ConstInitType KeyInitType


description: The number of elements in the map.

code: int32 Num() const


code: [TMapBase](API\Runtime\Core\Containers\TMapBase) & operator= ( [TMapBase](API\Runtime\Core\Containers\TMapBase) && )


code: [TMapBase](API\Runtime\Core\Containers\TMapBase) & operator= ( const [TMapBase](API\Runtime\Core\Containers\TMapBase) & )


description: Assignment operator for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMapBase](API\Runtime\Core\Containers\TMapBase) & operator= ( const [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > & Other )


description: Assignment operator for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMapBase](API\Runtime\Core\Containers\TMapBase) & operator= ( [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > && Other )


description:
Compare this map with another for equality. Does not make any assumptions about Key order. NOTE: this might be a candidate for operator== but it was decided to make it an explicit function since it can potentially be quite slow.
True if both this and Other contain the same keys with values that compare ==

code: bool OrderIndependentCompareEqual ( const [TMapBase](API\Runtime\Core\Containers\TMapBase) & Other ) const


description:
Remove all value associations for a key.
The number of values that were associated with the key.

code: int32 Remove ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) InKey )


description: SeeRemove()and class documentation section on ByHash() functions

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


description: Preallocates enough memory to contain Number elements

code: void Reserve ( int32 Number )


description: Efficiently empties out the map but preserves all allocations and capacities

code: void Reset()


description: Shrinks the pair set to avoid slack.

code: void Shrink()


className: ItKeyType

code: typedef TChooseClass< bConst, const KeyType, KeyType >::Result ItKeyType


className: ItValueType

code: typedef TChooseClass< bConst, const ValueType, ValueType >::Result ItValueType


className: MapType

code: typedef TChooseClass< bConst, const TMapBase, TMapBase >::Result MapType


code: PairType &42; operator&45;>&40;&41; const


className: TMapBase::TBaseIterator::operator bool

description: Conversion to "bool" returning true if the iterator is valid.

code: operator bool&40;&41; const


code: bool operator&61;&61; &40; const TBaseIterator & Rhs &41; const


code: bool operator&33;&61; &40; const TBaseIterator & Rhs &41; const


code: PairType & operator&42;&40;&41; const


className: PairItType

code: typedef TChooseClass< bConst, typename TChooseClass< bRangedFor, typename ElementSetType::TRangedForConstIterator, typename ElementSetType::TConstIterator >::Result, typename TChooseClass< bRangedFor, typename ElementSetType::TRangedForIterator, typename ElementSetType::TIterator >::Result >::Result PairItType


description: Inverse of the "bool" operator

code: bool operator&33;&40;&41; const


className: PairType

code: typedef TChooseClass< bConst, const typename ElementSetType::ElementType, typename ElementSetType::ElementType >::Result PairType


code: TBaseIterator &40; const PairItType & InElementIt &41;


className: TBaseIterator

description: The base ofTMapBaseiterators.

code: template<bool bConst, bool bRangedFor> class TBaseIterator

PairIt

type: PairItType


className: SetItType

code: typedef TChooseClass< bConst, typename ElementSetType::TConstKeyIterator, typename ElementSetType::TKeyIterator >::Result SetItType


description: Initialization constructor.

code: TBaseKeyIterator &40; const SetItType & InSetIt &41;


code: TConstIterator &40; const TMapBase & InMap &41;


className: TBaseKeyIterator

description: The base type of iterators that iterate over the values associated with a specified key.

code: template<bool bConst> class TBaseKeyIterator

SetIt

type: SetItType


className: TConstIterator

description: Const map iterator.

code: class TConstIterator : public [TMapBase< true >::TBaseIterator](API\Runtime\Core\Containers\TMapBase\TBaseIterator)


className: IteratorType

code: typedef typename ElementSetType::TConstKeyIterator IteratorType


className: KeyArgumentType

code: typedef typename IteratorType::KeyArgumentType KeyArgumentType


code: TConstKeyIterator &40; const TMapBase & InMap, KeyArgumentType InKey &41;


className: Super

code: typedef TBaseKeyIterator< true > Super


className: TConstKeyIterator

description: Iterates over values associated with a specified key in a const map.

code: class TConstKeyIterator : public [TMapBase< KeyType, ValueType, SetAllocator, KeyFuncs >::TBaseKeyIterator< true >](API\Runtime\Core\Containers\TMapBase\TBaseKeyIterator)


description: Removes the current pair from the map.

code: void RemoveCurrent&40;&41;


description: Initialization constructor.

code: TIterator &40; TMapBase & InMap, bool bInRequiresRehashOnRemoval &41;


description: Destructor.


className: TIterator

description: Map iterator.

code: class TIterator : public [TMapBase< KeyType, ValueType, SetAllocator, KeyFuncs >::TBaseIterator< false >](API\Runtime\Core\Containers\TMapBase\TBaseIterator)


code: typedef typename ElementSetType::TKeyIterator IteratorType


description: Removes the current key-value pair from the map.


code: typedef TBaseKeyIterator< false > Super


code: TKeyIterator &40; TMapBase & InMap, KeyArgumentType InKey &41;


className: TKeyIterator

description: Iterates over values associated with a specified key in a map.

code: class TKeyIterator : public [TMapBase< KeyType, ValueType, SetAllocator, KeyFuncs >::TBaseKeyIterator< false >](API\Runtime\Core\Containers\TMapBase\TBaseKeyIterator)


className: TRangedForConstIterator

code: typedef [TBaseIterator](API\Runtime\Core\Containers\TMapBase\TBaseIterator)< true, true > TRangedForConstIterator


className: TRangedForIterator

code: typedef [TBaseIterator](API\Runtime\Core\Containers\TMapBase\TBaseIterator)< false, true > TRangedForIterator


className: ValueInitType

code: typedef [TTypeTraits](API\Runtime\Core\Templates\TTypeTraits)< ValueType >::ConstInitType ValueInitType


code: void WriteMemoryImage ( [FMemoryImageWriter](API\Runtime\Core\Serialization\FMemoryImageWriter) & Writer ) const


code: TMapBase ( [TMapBase](API\Runtime\Core\Containers\TMapBase) && )


code: TMapBase ( const [TMapBase](API\Runtime\Core\Containers\TMapBase) & )


description: Constructor for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMapBase ( [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > && Other )


description: Constructor for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMapBase ( const [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > & Other )


className: TMapBase

description: The ByHash() functions are somewhat dangerous but particularly useful in two scenarios:  Heterogeneous lookup to avoid creating expensive keys likeFStringwhen 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 hashingbeforeacquiring the lock.

code: template<typename KeyType, typename ValueType, typename SetAllocator, typename KeyFuncs> class TMapBase

Pairs

type: ElementSetType

description: A set of the key-value pairs in the map.


description:
Adds a key-value pair to the map.
This instance (for method chaining).

code: [TMapBuilder](API\Runtime\Core\Containers\TMapBuilder) & Add ( KeyType InKey, ValueType InValue )


description:
Appends another map.
This instance (for method chaining).

code: [TMapBuilder](API\Runtime\Core\Containers\TMapBuilder) & Append ( const [TMap](API\Runtime\Core\Containers\TMap)< KeyType, ValueType, SetAllocator > & OtherMap )


description:
Builds the map as configured.
A new map.

code: [TMap](API\Runtime\Core\Containers\TMap)< KeyType, ValueType, SetAllocator > Build()


className: TMapBuilder::operator TMap< KeyType, ValueType, SetAllocator >

description:
Implicit conversion operator to build the map as configured.
A new map.

code: operator TMap< KeyType, ValueType, SetAllocator >()


description: Default constructor.

code: TMapBuilder()


description: Creates and initializes a new map builder from another map.

code: template<typename OtherAllocator> TMapBuilder ( const [TMap](API\Runtime\Core\Containers\TMap)< KeyType, ValueType, OtherAllocator > & InMap )


className: TMapBuilder

description: Template for fluent map builders.

code: template<typename KeyType, typename ValueType, typename SetAllocator> class TMapBuilder


code: template<typename KeyType, typename ValueType, typename SetAllocator, typename KeyFuncs> static bool LegacyCompareEqual ( const [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, SetAllocator, KeyFuncs > & A, const [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, SetAllocator, KeyFuncs > & B )


code: template<typename KeyType, typename ValueType, typename SetAllocator, typename KeyFuncs> static [FArchive](API\Runtime\Core\Serialization\FArchive) & Serialize ( [FArchive](API\Runtime\Core\Serialization\FArchive) & Ar, [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, SetAllocator, KeyFuncs > & Map )


code: template<typename KeyType, typename ValueType, typename SetAllocator, typename KeyFuncs> static void SerializeStructured ( [FStructuredArchive::FSlot](API\Runtime\Core\Serialization\FStructuredArchive\FSlot) Slot, [TMapBase](API\Runtime\Core\Containers\TMapBase)< KeyType, ValueType, SetAllocator, KeyFuncs > & InMap )


className: TMapPrivateFriend

code: struct TMapPrivateFriend


code: bool Dequeue ( [ElementType](API\Runtime\Core\Containers\TMpscQueue\ElementType) & OutElem )


code: template<typename... ArgTypes> void Enqueue ( ArgTypes &&... Args )


code: [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) & operator= ( const [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) & )


code: [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) & operator= ( [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) && )


description: As there can be only one consumer, a consumer can safely "peek" the tail of the queue. returns a pointer to the tail if the queue is not empty, nullptr otherwise there's no overload withTOptionalas it doesn't support references

code: [ElementType](API\Runtime\Core\Containers\TMpscQueue\ElementType) * Peek() const


code: TMpscQueue ( [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) && )


code: TMpscQueue ( const [TMpscQueue](API\Runtime\Core\Containers\TMpscQueue) & )


description:
Adds item to the array. Makes sure that we don't add more than the limit.
Always 0.

code: int32 Add ( const T & Item )


className: TMpscQueue

description: Fast multi-producer/single-consumer unbounded concurrent queue. Based onhttp://www.1024cores.net/home/lock-free-algorithms/queues/non-intrusive-mpsc-node-based-queue

code: template<typename T, typename AllocatorType> class TMpscQueue


description:
Adds unique item to the array. Makes sure that we don't add more than the limit. If the item existed it will be removed before addition.
Always 0.

code: int32 AddUnique ( const T & Item )


description:
Adds a number of zeroed elements to the array. Makes sure that we don't add more than the limit.
Always 0.

code: int32 AddZeroed ( int32 Count )


code: [TMRUArray](API\Runtime\Core\Containers\TMRUArray) & operator= ( [TMRUArray](API\Runtime\Core\Containers\TMRUArray) && )


description: Makes sure that the array never gets beyond MaxItems in size.

code: void CullArray()


code: [TMRUArray](API\Runtime\Core\Containers\TMRUArray) & operator= ( const [TMRUArray](API\Runtime\Core\Containers\TMRUArray) & )


code: typedef [TArray](API\Runtime\Core\Containers\TArray)< T, InAllocator > Super


description: Constructor.

code: TMRUArray()


code: TMRUArray ( [TMRUArray](API\Runtime\Core\Containers\TMRUArray) && )


code: TMRUArray ( const [TMRUArray](API\Runtime\Core\Containers\TMRUArray) & )


className: TMRUArray

description: Same asTArrayexcept:

code: template<typename T, typename InAllocator> class TMRUArray : public [TArray< T, InAllocator >](API\Runtime\Core\Containers\TArray)

MaxItems

description: The maximum number of items we can store in this array.


description:
Add a key-value association to the map. The association doesn't replace any of the key's existing associations. However, if both the key and value match an existing association in the map, no new association is made and the existing association's value is returned.
A reference to the value as stored in the map; the reference is only valid until the next change to any key in the map.

code: ValueType & AddUnique ( const KeyType & InKey, const ValueType & InValue )


code: ValueType & AddUnique ( const KeyType & InKey, ValueType && InValue )


code: ValueType & AddUnique ( KeyType && InKey, ValueType && InValue )


code: ValueType & AddUnique ( KeyType && InKey, const ValueType & InValue )


description: Move all items from another map into our map (if any keys are in both, the value from the other map wins) and empty the other map.

code: template<typename OtherSetAllocator> void Append ( [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > && OtherMultiMap )


description: Add all items from another map to our map (if any keys are in both, the value from the other map wins).

code: template<typename OtherSetAllocator> void Append ( const [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > & OtherMultiMap )


description:
The association doesn't replace any of the key's existing associations. However, if both key and value match an existing association in the map, no new association is made and the existing association's value is returned.
A reference to the value as stored in the map; the reference is only valid until the next change to any key in the map.

code: template<typename InitKeyType, typename InitValueType> ValueType & EmplaceUnique ( InitKeyType && InKey, InitValueType && InValue )


description:
Find an association between a specified key and value. (const)
If the map contains a matching association, a pointer to the value in the map is returned. Otherwise nullptr is returned. The pointer is only valid as long as the map isn't changed.

code: const ValueType * FindPair ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key, [ValueInitType](API\Runtime\Core\Containers\TMapBase\ValueInitType) Value ) const


description:
Find an association between a specified key and value.
If the map contains a matching association, a pointer to the value in the map is returned. Otherwise nullptr is returned. The pointer is only valid as long as the map isn't changed.

code: ValueType * FindPair ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key, [ValueInitType](API\Runtime\Core\Containers\TMapBase\ValueInitType) Value )


description: Finds all values associated with the specified key.

code: template<typename Allocator> void MultiFind ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key, [TArray](API\Runtime\Core\Containers\TArray)< ValueType, Allocator > & OutValues, bool bMaintainOrder ) const


code: template<typename Allocator> void MultiFindPointer ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key, [TArray](API\Runtime\Core\Containers\TArray)< const ValueType *, Allocator > & OutValues, bool bMaintainOrder ) const


code: template<typename Allocator> void MultiFindPointer ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key, [TArray](API\Runtime\Core\Containers\TArray)< ValueType *, Allocator > & OutValues, bool bMaintainOrder )


description: Since we implement an overloadedNum()function inTMultiMap, we need to reimplementTMapBase::Numto make it visible.

code: int32 Num() const


description: Returns the number of values within this map associated with the specified key

code: int32 Num ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) Key ) const


code: [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & operator= ( [TMultiMap](API\Runtime\Core\Containers\TMultiMap) && )


code: [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & operator= ( const [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & )


description: Assignment operator for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & operator= ( [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > && Other )


description: Assignment operator for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & operator= ( const [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > & Other )


description: Assignment operator which gets its elements from a native initializer list

code: [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & operator= ( std::initializer_list< [TPairInitializer](API\Runtime\Core\Containers\TPairInitializer)< const KeyType &, const ValueType & >> InitList )


description:
Remove all value associations for a key.
The number of values that were associated with the key.

code: int32 Remove ( [KeyConstPointerType](API\Runtime\Core\Containers\TMapBase\KeyConstPointerType) InKey )


description:
Remove associations between the specified key and value from the map.
The number of associations removed.

code: int32 Remove ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) InKey, [ValueInitType](API\Runtime\Core\Containers\TMapBase\ValueInitType) InValue )


description:
Remove the first association between the specified key and value from the map.
The number of associations removed.

code: int32 RemoveSingle ( [KeyInitType](API\Runtime\Core\Containers\TMapBase\KeyInitType) InKey, [ValueInitType](API\Runtime\Core\Containers\TMapBase\ValueInitType) InValue )


code: typedef [TSortableMapBase](API\Runtime\Core\Containers\TSortableMapBase)< KeyType, ValueType, SetAllocator, KeyFuncs > Super


code: TMultiMap ( [TMultiMap](API\Runtime\Core\Containers\TMultiMap) && )


code: TMultiMap ( const [TMultiMap](API\Runtime\Core\Containers\TMultiMap) & )


description: Constructor for moving elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMultiMap ( [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > && Other )


description: Constructor for copying elements from aTMapwith a different SetAllocator

code: template<typename OtherSetAllocator> TMultiMap ( const [TMultiMap](API\Runtime\Core\Containers\TMultiMap)< KeyType, ValueType, OtherSetAllocator, KeyFuncs > & Other )


description: Constructor which gets its elements from a native initializer list

code: TMultiMap ( std::initializer_list< [TPairInitializer](API\Runtime\Core\Containers\TPairInitializer)< const KeyType &, const ValueType & >> InitList )


className: TMultiMap

description: ATMapBasespecialization that allows multiple values to be associated with each key.

code: template<typename KeyType, typename ValueType, typename SetAllocator, typename KeyFuncs> class TMultiMap : public [TSortableMapBase< KeyType, ValueType, SetAllocator, KeyFuncs >](API\Runtime\Core\Containers\TSortableMapBase)


className: ForAnyElementType

code: typedef void ForAnyElementType


code: SizeType CalculateSlackReserve &40; SizeType NumElements, SIZE_T NumBytesPerElement &41; const


code: SizeType CalculateSlackShrink &40; SizeType NumElements, SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


code: SIZE_T GetAllocatedSize &40; SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


code: ElementType &42; GetAllocation&40;&41; const


description: Moves the state of another allocator into this one. Assumes that the allocator is currently empty, i.e. memory may be allocated but any existing elements have already been destructed (if necessary).

code: void MoveToEmpty &40; ForElementType & Other &41;


code: void ResizeAllocation &40; SizeType PreviousNumElements, SizeType NumElements, SIZE_T NumBytesPerElement &41;


description: Default constructor.


code: ForElementType &40; const ForElementType & &41;


code: SizeType CalculateSlackGrow &40; SizeType NumElements, SizeType NumAllocatedElements, SIZE_T NumBytesPerElement &41; const


className: ForElementType

code: template<typename ElementType> class ForElementType


className: NeedsElementType

code: enum { NeedsElementType = true }


className: RequireRangeCheck

code: enum { RequireRangeCheck = true }


className: TNonRelocatableInlineAllocator

description: Implements a variant of TInlineAllocator with a secondary heap allocator that is allowed to store a pointer to its inline elements. This allows caching a pointer to the elements which avoids any conditional logic in GetAllocation(), but prevents the allocator being trivially relocatable. All UE4 allocators typically rely on elements being trivially relocatable, so instances of this allocator cannot be used in other containers.

code: template<uint32 NumInlineElements> class TNonRelocatableInlineAllocator


description: Adds the parameter element at the back of the container.

code: [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) Add ( const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Element )


code: [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) Add ( [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) && Element )


code: [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Add_GetRef ( const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Element )


code: [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Add_GetRef ( [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) && Element )


className: AllocatorType

code: typedef InAllocatorType AllocatorType


code: void Append ( std::initializer_list< [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) > InList )


code: template<typename ContainerType, std::enable_if_t< [TIsContiguousContainer](API\Runtime\Core\Misc\TIsContiguousContainer)< ContainerType >::Value > *> void Append ( ContainerType && Container )


description: Appends a compatible paged array to this container. NoteTPagedArraydoesn't meetTIsContiguousContainertraits so it won't use the contiguous container overload.

code: template<int32 OtherPageSizeInBytes, typename OtherAllocator> void Append ( const [TPagedArray](API\Runtime\Core\Containers\TPagedArray)< [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType), OtherPageSizeInBytes, OtherAllocator > & Other )


description: Appends the parameter contiguous range to this container.

code: void Append ( const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) * InSource, [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) InSize )


code: template<typename ContainerType, std::enable_if_t< [TIsContiguousContainer](API\Runtime\Core\Misc\TIsContiguousContainer)< ContainerType >::Value > *> void Assign ( ContainerType && Container )


code: void Assign ( std::initializer_list< [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) > InList )


description: Assigns a compatible paged array to this container. Any pre-existing content is removed. NoteTPagedArraydoesn't meetTIsContiguousContainertraits so it won't use the contiguous container overload.

code: template<int32 OtherPageSizeInBytes, typename OtherAllocator> void Assign ( const [TPagedArray](API\Runtime\Core\Containers\TPagedArray)< [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType), OtherPageSizeInBytes, OtherAllocator > & Other )


description: Assigns the parameter contiguous range to this container. Any pre-existing content is removed.

code: void Assign ( const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) * InSource, [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) InSize )


description: STL IteratorType model compliance methods.


className: ConstIteratorType

code: typedef [UE::Core::PagedArray::Private::TIterator](API\Runtime\Core\Containers\TIterator)< const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType), const [PageType](API\Runtime\Core\Containers\TArray), [PageTraits](API\Runtime\Core\Containers\TPageTraits) > ConstIteratorType


description: Count bytes needed to serialize this paged array.

code: void CountBytes ( [FArchive](API\Runtime\Core\Serialization\FArchive) & Ar ) const


className: ElementAllocatorType

code: typedef typename [TChooseClass](API\Runtime\Core\Templates\TChooseClass)< AllocatorType::NeedsElementType, typename AllocatorType::template ForElementType< [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) >, typename AllocatorType::ForAnyElementType >::Result ElementAllocatorType


className: ElementType

code: typedef InElementType ElementType


description: Constructs an element in place using the parameter arguments and adds it at the back of the container. This method returns a reference to the constructed element.

code: template<typename... ArgsType> [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) Emplace ( ArgsType &&... Args )


code: template<typename... ArgsType> [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Emplace_GetRef ( ArgsType &&... Args )


description: Empties the container effectively destroying all contained elements and releases any acquired storage.

code: void Empty()


description: Empties the container effectively destroying all contained elements and ensures storage for the parameter capacity. Storage is adjusted to meet the parameter capacity value.

code: void Empty ( [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) InCapacity )


description:
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.
Number of bytes allocated by this container.

code: SIZE_T GetAllocatedSize() const


code: const [ElementType](API\Runtime\Core\Containers\TPagedArray\ElementType) & Last() const


code: static constexpr [SizeType](API\Runtime\Core\Containers\TPagedArray\SizeType) MaxPerPage()