46 results for "array" in function
Appends an element to the end of the array and returns its index.
Appends Count new elements at the end of the array, each default-constructed via DefaultConstructItems.
Grows the array by Count elements without constructing them, returning the index of the first new slot.
Adds an element only if it is not already present in the array.
Appends Count new elements at the end of the array, zero-initialising their memory via FMemory::Memzero.
Appends all elements from Source to the end of this array in a single allocation.
A static method that feeds the element type's layout descriptor into a SHA1 hash.
Serializes the entire array as a raw memory blob during loading, bypassing per-element serialization for significant performance gains.
Asserts that the given address does not point into the array's current backing buffer.
Asserts (in Debug/Development builds only) that ArrayNum >= 0 and ArrayMax >= ArrayNum.
Returns true if the array contains at least one element equal to Item.
Returns true if any element satisfies the predicate.
Reconstructs a live TArray from a frozen (WriteMemoryImage) binary representation by placement-constructing a new TArray at Dst and copying element data through the allocator's CopyUnfrozen path.
Reports the array's current and peak memory usage to an accounting archive by calling Ar.
Constructs a new element in-place at the end of the array using the provided constructor arguments.
Constructs a new element in-place at the given index, shifting all subsequent elements right by one.
Destructs all elements and sets Num to 0.
Searches for Item using operator== and returns true if found, setting Index to its position.
Returns a pointer to the first element for which Pred returns true, or nullptr if none match.
Searches a TArray of UObject pointers for the first element whose runtime class matches (via IsA) the template parameter SearchType.
Searches the array from the end toward the front and returns the index of the last element equal to Item, or INDEX_NONE if not found.
Removes and returns the top element (the maximum under the current predicate) from the heap, then re-heapifies the remaining elements.
Removes the top element from the heap without returning it, then re-heapifies.
Inserts an element into the array while maintaining max-heap order, sifting the new element up to its correct position.
Removes an arbitrary element at the given index from the heap, then restores heap order by sifting the replacement element both up and down as needed.
Sorts the array in ascending order using heap sort.
Rearranges the array in-place into a valid max-heap ordered by operator< (min value at the root).
Resets the array to Number elements, every one a copy of Element.
Inserts a single element at the specified index, shifting all subsequent elements right by one.
Inserts Count default-constructed elements at Index, shifting existing elements right.
Inserts a single default-constructed element at Index and returns a reference to it.
Opens a gap of Count uninitialized element slots at Index, shifting later elements right.
Inserts Count zero-initialized elements at Index by shifting existing elements right and then zeroing the new slots with FMemory::Memzero.
Inserts a single zero-initialized element at Index and returns a reference to it, allowing immediate field-by-field initialization without a second array lookup.
Returns true if the array contains no elements.
Returns the number of elements currently in the array.
Removes and returns the last element of the array using move semantics.
Appends an element to the end of the array, identical in behaviour to Add().
Validates that an index is within the array bounds, triggering a checkf assertion on failure.
Removes all elements equal to Item and returns the number of elements removed.
Removes all elements for which the predicate returns true, preserving order of remaining elements.
Removes all elements satisfying Predicate using RemoveAtSwap internally, which replaces each removed element with the last element rather than shifting.
Removes the element at Index, destructs it, and shifts all subsequent elements left to close the gap.
Removes the element at Index by filling its slot with element(s) from the end of the array.
Removes the first occurrence of Item from the array while preserving element order.
Removes the first occurrence of Item using RemoveAtSwap — the removed slot is filled by the last element, making the actual removal O(1) after the O(N) linear search.