#include <ArrayView.h>

Public Types
using	ElementType = InElementType

using	SizeType = InSizeType

using	IntrusiveUnsetOptionalStateType = TArrayView

Public Member Functions
constexpr	TArrayView (const TArrayView &)=default

TArrayView &	operator= (const TArrayView &)=default

	~TArrayView ()=default

constexpr	TArrayView ()

template<typename OtherRangeType , typename CVUnqualifiedOtherRangeType = std::remove_cv_t<std::remove_reference_t<OtherRangeType>> UE_REQUIRES( TAnd< TIsContiguousContainer<CVUnqualifiedOtherRangeType>, TOr< TIsCompatibleRangeType<OtherRangeType>, TIsReinterpretableRangeType<OtherRangeType> > >::Value && TIsTArrayView_V<CVUnqualifiedOtherRangeType> && !std::is_same_v<CVUnqualifiedOtherRangeType, TArrayView> )>
constexpr	TArrayView (OtherRangeType &&Other)

template<typename OtherRangeType , typename CVUnqualifiedOtherRangeType = std::remove_cv_t<std::remove_reference_t<OtherRangeType>> UE_REQUIRES( TAnd< TIsContiguousContainer<CVUnqualifiedOtherRangeType>, TOr< TIsCompatibleRangeType<OtherRangeType>, TIsReinterpretableRangeType<OtherRangeType> > >::Value && !TIsTArrayView_V<CVUnqualifiedOtherRangeType> )>
constexpr	TArrayView (OtherRangeType &&Other UE_LIFETIMEBOUND)

template<typename OtherElementType >
constexpr	TArrayView (OtherElementType *InData UE_LIFETIMEBOUND, SizeType InCount)

constexpr	TArrayView (std::initializer_list< ElementType > List UE_LIFETIMEBOUND)

constexpr	TArrayView (FIntrusiveUnsetOptionalState)

constexpr bool	UEOpEquals (FIntrusiveUnsetOptionalState) const

UE_FORCEINLINE_HINT constexpr ElementType *	GetData () const

UE_FORCEINLINE_HINT constexpr void	CheckInvariants () const

constexpr void	RangeCheck (SizeType Index) const

constexpr void	SliceRangeCheck (SizeType Index, SizeType InNum) const

UE_FORCEINLINE_HINT constexpr bool	IsValidIndex (SizeType Index) const

constexpr bool	IsEmpty () const

UE_FORCEINLINE_HINT constexpr SizeType	Num () const

UE_FORCEINLINE_HINT constexpr SIZE_T	NumBytes () const

constexpr ElementType &	operator[] (SizeType Index) const

constexpr ElementType &	Last (SizeType IndexFromTheEnd=0) const

constexpr TArrayView	Slice (SizeType Index, SizeType InNum) const

constexpr TArrayView	Left (SizeType Count) const

constexpr TArrayView	LeftChop (SizeType Count) const

constexpr TArrayView	Right (SizeType Count) const

constexpr TArrayView	RightChop (SizeType Count) const

constexpr TArrayView	Mid (SizeType Index, SizeType Count=TNumericLimits< SizeType >::Max()) const

constexpr void	LeftInline (SizeType CharCount)

constexpr void	LeftChopInline (SizeType CharCount)

constexpr void	RightInline (SizeType CharCount)

constexpr void	RightChopInline (SizeType CharCount)

constexpr void	MidInline (SizeType Position, SizeType CharCount=TNumericLimits< SizeType >::Max())

constexpr bool	Find (const ElementType &Item, SizeType &Index) const

constexpr SizeType	Find (const ElementType &Item) const

constexpr bool	FindLast (const ElementType &Item, SizeType &Index) const

constexpr SizeType	FindLast (const ElementType &Item) const

template<typename Predicate >
constexpr SizeType	FindLastByPredicate (Predicate Pred, SizeType StartIndex) const

template<typename Predicate >
UE_FORCEINLINE_HINT constexpr SizeType	FindLastByPredicate (Predicate Pred) const

template<typename KeyType >
constexpr SizeType	IndexOfByKey (const KeyType &Key) const

template<typename Predicate >
constexpr SizeType	IndexOfByPredicate (Predicate Pred) const

template<typename KeyType >
constexpr ElementType *	FindByKey (const KeyType &Key) const

template<typename Predicate >
constexpr ElementType *	FindByPredicate (Predicate Pred) const

template<typename Predicate >
constexpr TArray< std::remove_const_t< ElementType > >	FilterByPredicate (Predicate Pred) const

template<typename ComparisonType >
constexpr bool	Contains (const ComparisonType &Item) const

template<typename Predicate >
UE_FORCEINLINE_HINT constexpr bool	ContainsByPredicate (Predicate Pred) const

UE_FORCEINLINE_HINT constexpr ElementType *	begin () const

UE_FORCEINLINE_HINT constexpr ElementType *	end () const

UE_FORCEINLINE_HINT constexpr TReversePointerIterator< ElementType >	rbegin () const

UE_FORCEINLINE_HINT constexpr TReversePointerIterator< ElementType >	rend () const

constexpr void	Sort ()

template<class PREDICATE_CLASS >
constexpr void	Sort (const PREDICATE_CLASS &Predicate)

constexpr void	StableSort ()

template<class PREDICATE_CLASS >
constexpr void	StableSort (const PREDICATE_CLASS &Predicate)

template<typename OtherElementType , typename OtherSizeType >
bool	UEOpEquals (TArrayView< OtherElementType, OtherSizeType >) const =delete

template<typename RangeType > requires (std::is_convertible_v<decltype(UE::Core::ArrayView::Private::GetDataHelper(std::declval<RangeType&>())), const ElementType*>)
bool	UEOpEquals (RangeType &&Rhs) const

Static Public Member Functions
static UE_FORCEINLINE_HINT constexpr size_t	GetTypeSize ()

static UE_FORCEINLINE_HINT constexpr size_t	GetTypeAlignment ()

Static Public Attributes
static constexpr bool	bHasIntrusiveUnsetOptionalState = true

Detailed Description

template<typename InElementType, typename InSizeType>
class TArrayView< InElementType, InSizeType >

Templated fixed-size view of another array

A statically sized view of an array of typed elements. Designed to allow functions to take either a fixed C array or a TArray with an arbitrary allocator as an argument when the function neither adds nor removes elements

e.g.: int32 SumAll(TArrayView<const int32> array) { return Algo::Accumulate(array); }

could be called as: SumAll(MyTArray);\ SumAll(MyCArray); SumAll(MakeArrayView(Ptr, Num));

auto Values = { 1, 2, 3 }; SumAll(Values);

Note: View classes are not const-propagating! If you want a view where the elements are const, you need "TArrayView<const T>" not "const TArrayView<T>"!

Caution: Treat a view like a reference to the elements in the array. DO NOT free or reallocate the array while the view exists! For this reason, be mindful of lifetimes when constructing TArrayViews from rvalue initializer lists:

TArrayView<int> View = { 1, 2, 3 }; // construction of array view from rvalue initializer list int n = View[0]; // undefined behavior, as the initializer list was destroyed at the end of the previous line

Member Typedef Documentation

◆ ElementType

template<typename InElementType , typename InSizeType >

using TArrayView< InElementType, InSizeType >::ElementType = InElementType

◆ IntrusiveUnsetOptionalStateType

template<typename InElementType , typename InSizeType >

using TArrayView< InElementType, InSizeType >::IntrusiveUnsetOptionalStateType = TArrayView

◆ SizeType

template<typename InElementType , typename InSizeType >

using TArrayView< InElementType, InSizeType >::SizeType = InSizeType

Constructor & Destructor Documentation

◆ TArrayView() [1/7]

template<typename InElementType , typename InSizeType >

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( const TArrayView< InElementType, InSizeType > & )

constexprdefault

◆ ~TArrayView()

template<typename InElementType , typename InSizeType >

TArrayView< InElementType, InSizeType >::~TArrayView ( )

default

◆ TArrayView() [2/7]

template<typename InElementType , typename InSizeType >

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( )

inlineconstexpr

Constructor.

◆ TArrayView() [3/7]

template<typename InElementType , typename InSizeType >

template<typename OtherRangeType , typename CVUnqualifiedOtherRangeType = std::remove_cv_t<std::remove_reference_t<OtherRangeType>> UE_REQUIRES( TAnd< TIsContiguousContainer<CVUnqualifiedOtherRangeType>, TOr< TIsCompatibleRangeType<OtherRangeType>, TIsReinterpretableRangeType<OtherRangeType> > >::Value && TIsTArrayView_V<CVUnqualifiedOtherRangeType> && !std::is_same_v<CVUnqualifiedOtherRangeType, TArrayView> )>

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( OtherRangeType && Other )

inlineconstexpr

Constructor from another range

Parameters

Other The source range to copy

◆ TArrayView() [4/7]

template<typename InElementType , typename InSizeType >

template<typename OtherRangeType , typename CVUnqualifiedOtherRangeType = std::remove_cv_t<std::remove_reference_t<OtherRangeType>> UE_REQUIRES( TAnd< TIsContiguousContainer<CVUnqualifiedOtherRangeType>, TOr< TIsCompatibleRangeType<OtherRangeType>, TIsReinterpretableRangeType<OtherRangeType> > >::Value && !TIsTArrayView_V<CVUnqualifiedOtherRangeType> )>

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( OtherRangeType &&Other UE_LIFETIMEBOUND )

inlineconstexpr

◆ TArrayView() [5/7]

template<typename InElementType , typename InSizeType >

template<typename OtherElementType >

constexpr TArrayView< InElementType, InSizeType >::TArrayView	(	OtherElementType *InData	UE_LIFETIMEBOUND,
		SizeType	InCount
	)

inlineconstexpr

Construct a view of an arbitrary pointer

Parameters

InData	The data to view
InCount	The number of elements

◆ TArrayView() [6/7]

template<typename InElementType , typename InSizeType >

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( std::initializer_list< ElementType > List UE_LIFETIMEBOUND )

inlineconstexpr

Construct a view of an initializer list.

The caller is responsible for ensuring that the view does not outlive the initializer list.

◆ TArrayView() [7/7]

template<typename InElementType , typename InSizeType >

constexpr TArrayView< InElementType, InSizeType >::TArrayView ( FIntrusiveUnsetOptionalState )

inlineexplicitconstexpr

Member Function Documentation

◆ begin()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr ElementType * TArrayView< InElementType, InSizeType >::begin ( ) const

inlineconstexpr

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

◆ CheckInvariants()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr void TArrayView< InElementType, InSizeType >::CheckInvariants ( ) const

inlineconstexpr

Checks array invariants: if array size is greater than or equal to zero.

◆ Contains()

template<typename InElementType , typename InSizeType >

template<typename ComparisonType >

constexpr bool TArrayView< InElementType, InSizeType >::Contains ( const ComparisonType & Item ) const

inlineconstexpr

Checks if this array contains the element.

Returns: True if found. False otherwise.

◆ ContainsByPredicate()

template<typename InElementType , typename InSizeType >

template<typename Predicate >

UE_FORCEINLINE_HINT constexpr bool TArrayView< InElementType, InSizeType >::ContainsByPredicate ( Predicate Pred ) const

inlineconstexpr

Checks if this array contains an element for which the predicate is true.

Parameters

Predicate to use

Returns: True if found. False otherwise.

◆ end()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr ElementType * TArrayView< InElementType, InSizeType >::end ( ) const

inlineconstexpr

◆ FilterByPredicate()

template<typename InElementType , typename InSizeType >

template<typename Predicate >

constexpr TArray< std::remove_const_t< ElementType > > TArrayView< InElementType, InSizeType >::FilterByPredicate ( Predicate Pred ) const

inlineconstexpr

Filters the elements in the array based on a predicate functor.

Parameters

Pred	The functor to apply to each element.

Returns: TArray with the same type as this object which contains the subset of elements for which the functor returns true.

◆ Find() [1/2]

template<typename InElementType , typename InSizeType >

constexpr SizeType TArrayView< InElementType, InSizeType >::Find ( const ElementType & Item ) const

inlineconstexpr

Finds element within the array.

Parameters

Item	Item to look for.

Returns: Index of the found element. INDEX_NONE otherwise.

◆ Find() [2/2]

template<typename InElementType , typename InSizeType >

constexpr bool TArrayView< InElementType, InSizeType >::Find	(	const ElementType &	Item,
		SizeType &	Index
	)		const

inlineconstexpr

Finds element within the array.

Parameters

Item	Item to look for.
Index	Output parameter. Found index.

Returns: True if found. False otherwise.

◆ FindByKey()

template<typename InElementType , typename InSizeType >

template<typename KeyType >

constexpr ElementType * TArrayView< InElementType, InSizeType >::FindByKey ( const KeyType & Key ) const

inlineconstexpr

Finds an item by key (assuming the ElementType overloads operator== for the comparison).

Parameters

Key	The key to search by.

Returns: Pointer to the first matching element, or nullptr if none is found.

◆ FindByPredicate()

template<typename InElementType , typename InSizeType >

template<typename Predicate >

constexpr ElementType * TArrayView< InElementType, InSizeType >::FindByPredicate ( Predicate Pred ) const

inlineconstexpr

Finds an element which matches a predicate functor.

Parameters

Pred	The functor to apply to each element.

Returns: Pointer to the first element for which the predicate returns true, or nullptr if none is found.

◆ FindLast() [1/2]

template<typename InElementType , typename InSizeType >

constexpr SizeType TArrayView< InElementType, InSizeType >::FindLast ( const ElementType & Item ) const

inlineconstexpr

Finds element within the array starting from the end.

Parameters

Item	Item to look for.

Returns: Index of the found element. INDEX_NONE otherwise.

◆ FindLast() [2/2]

template<typename InElementType , typename InSizeType >

constexpr bool TArrayView< InElementType, InSizeType >::FindLast	(	const ElementType &	Item,
		SizeType &	Index
	)		const

inlineconstexpr

Finds element within the array starting from the end.

Parameters

Item	Item to look for.
Index	Output parameter. Found index.

Returns: True if found. False otherwise.

◆ FindLastByPredicate() [1/2]

template<typename InElementType , typename InSizeType >

template<typename Predicate >

UE_FORCEINLINE_HINT constexpr SizeType TArrayView< InElementType, InSizeType >::FindLastByPredicate ( Predicate Pred ) const

inlineconstexpr

Finds element within the array starting from the end. Uses predicate to match element.

Parameters

Pred	Predicate taking array element and returns true if element matches search criteria, false otherwise.

Returns: Index of the found element. INDEX_NONE otherwise.

◆ FindLastByPredicate() [2/2]

template<typename InElementType , typename InSizeType >

template<typename Predicate >

constexpr SizeType TArrayView< InElementType, InSizeType >::FindLastByPredicate	(	Predicate	Pred,
		SizeType	StartIndex
	)		const

inlineconstexpr

Finds element within the array starting from StartIndex and going backwards. Uses predicate to match element.

Parameters

Pred	Predicate taking array element and returns true if element matches search criteria, false otherwise.
StartIndex	Index of element from which to start searching.

Returns: Index of the found element. INDEX_NONE otherwise.

◆ GetData()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr ElementType * TArrayView< InElementType, InSizeType >::GetData ( ) const

inlineconstexpr

Helper function for returning a typed pointer to the first array entry.

Returns: Pointer to first array entry.

◆ GetTypeAlignment()

template<typename InElementType , typename InSizeType >

static UE_FORCEINLINE_HINT constexpr size_t TArrayView< InElementType, InSizeType >::GetTypeAlignment ( )

inlinestaticconstexpr

Helper function returning the alignment of the inner type.

◆ GetTypeSize()

template<typename InElementType , typename InSizeType >

static UE_FORCEINLINE_HINT constexpr size_t TArrayView< InElementType, InSizeType >::GetTypeSize ( )

inlinestaticconstexpr

Helper function returning the size of the inner type.

Returns: Size in bytes of array type.

◆ IndexOfByKey()

template<typename InElementType , typename InSizeType >

template<typename KeyType >

constexpr SizeType TArrayView< InElementType, InSizeType >::IndexOfByKey ( const KeyType & Key ) const

inlineconstexpr

Finds an item by key (assuming the ElementType overloads operator== for the comparison).

Parameters

Key	The key to search by.

Returns: Index to the first matching element, or INDEX_NONE if none is found.

◆ IndexOfByPredicate()

template<typename InElementType , typename InSizeType >

template<typename Predicate >

constexpr SizeType TArrayView< InElementType, InSizeType >::IndexOfByPredicate ( Predicate Pred ) const

inlineconstexpr

Finds an item by predicate.

Parameters

Pred	The predicate to match.

Returns: Index to the first matching element, or INDEX_NONE if none is found.

◆ IsEmpty()

template<typename InElementType , typename InSizeType >

constexpr bool TArrayView< InElementType, InSizeType >::IsEmpty ( ) const

inlineconstexpr

Returns true if the array view is empty and contains no elements.

Returns: True if the array view is empty.

See also: Num

◆ IsValidIndex()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr bool TArrayView< InElementType, InSizeType >::IsValidIndex ( SizeType Index ) const

inlineconstexpr

Tests if index is valid, i.e. greater than or equal to zero, and less than the number of elements in the array.

Parameters

Index Index to test.

Returns: True if index is valid. False otherwise.

◆ Last()

template<typename InElementType , typename InSizeType >

constexpr ElementType & TArrayView< InElementType, InSizeType >::Last ( SizeType IndexFromTheEnd = 0 ) const

inlineconstexpr

Returns n-th last element from the array.

Parameters

IndexFromTheEnd (Optional) Index from the end of array. Default is 0.

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

◆ Left()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::Left ( SizeType Count ) const

inlineconstexpr

Returns the left-most part of the view by taking the given number of elements from the left.

◆ LeftChop()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::LeftChop ( SizeType Count ) const

inlineconstexpr

Returns the left-most part of the view by chopping the given number of elements from the right.

◆ LeftChopInline()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::LeftChopInline ( SizeType CharCount )

inlineconstexpr

Modifies the view by chopping the given number of elements from the right.

◆ LeftInline()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::LeftInline ( SizeType CharCount )

inlineconstexpr

Modifies the view to be the given number of elements from the left.

◆ Mid()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::Mid	(	SizeType	Index,
		SizeType	Count = `TNumericLimits<SizeType>::Max()`
	)		const

inlineconstexpr

Returns the middle part of the view by taking up to the given number of elements from the given position.

◆ MidInline()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::MidInline	(	SizeType	Position,
		SizeType	CharCount = `TNumericLimits<SizeType>::Max()`
	)

inlineconstexpr

Modifies the view to be the middle part by taking up to the given number of elements from the given position.

◆ Num()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr SizeType TArrayView< InElementType, InSizeType >::Num ( ) const

inlineconstexpr

Returns number of elements in array.

Returns: Number of elements in array.

◆ NumBytes()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr SIZE_T TArrayView< InElementType, InSizeType >::NumBytes ( ) const

inlineconstexpr

Returns: Number of bytes used, excluding slack

◆ operator=()

template<typename InElementType , typename InSizeType >

TArrayView & TArrayView< InElementType, InSizeType >::operator= ( const TArrayView< InElementType, InSizeType > & )

default

◆ operator[]()

template<typename InElementType , typename InSizeType >

constexpr ElementType & TArrayView< InElementType, InSizeType >::operator[] ( SizeType Index ) const

inlineconstexpr

Array bracket operator. Returns reference to element at given index.

Returns: Reference to indexed element.

◆ RangeCheck()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::RangeCheck ( SizeType Index ) const

inlineconstexpr

Checks if index is in array range.

Parameters

Index Index to check.

◆ rbegin()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr TReversePointerIterator< ElementType > TArrayView< InElementType, InSizeType >::rbegin ( ) const

inlineconstexpr

◆ rend()

template<typename InElementType , typename InSizeType >

UE_FORCEINLINE_HINT constexpr TReversePointerIterator< ElementType > TArrayView< InElementType, InSizeType >::rend ( ) const

inlineconstexpr

◆ Right()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::Right ( SizeType Count ) const

inlineconstexpr

Returns the right-most part of the view by taking the given number of elements from the right.

◆ RightChop()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::RightChop ( SizeType Count ) const

inlineconstexpr

Returns the right-most part of the view by chopping the given number of elements from the left.

◆ RightChopInline()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::RightChopInline ( SizeType CharCount )

inlineconstexpr

Modifies the view by chopping the given number of elements from the left.

◆ RightInline()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::RightInline ( SizeType CharCount )

inlineconstexpr

Modifies the view to be the given number of elements from the right.

◆ Slice()

template<typename InElementType , typename InSizeType >

constexpr TArrayView TArrayView< InElementType, InSizeType >::Slice	(	SizeType	Index,
		SizeType	InNum
	)		const

inlineconstexpr

Returns a sliced view This is similar to Mid(), but with a narrow contract, i.e. slicing outside of the range of the view is illegal.

Parameters

Index	starting index of the new view
InNum	number of elements in the new view

Returns: Sliced view

See also: Mid

◆ SliceRangeCheck()

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::SliceRangeCheck	(	SizeType	Index,
		SizeType	InNum
	)		const

inlineconstexpr

Checks if a slice range [Index, Index+InNum) is in array range. Length is 0 is allowed on empty arrays; Index must be 0 in that case.

Parameters

Index	Starting index of the slice.
InNum	Length of the slice.

◆ Sort() [1/2]

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::Sort ( )

inlineconstexpr

Sorts the array assuming < operator is defined for the item type.

Note: : If your array contains raw pointers, they will be automatically dereferenced during sorting. Therefore, your array will be sorted by the values being pointed to, rather than the pointers' values. If this is not desirable, please use Algo::Sort(MyArray) directly instead. The auto-dereferencing behavior does not occur with smart pointers.

◆ Sort() [2/2]

template<typename InElementType , typename InSizeType >

template<class PREDICATE_CLASS >

constexpr void TArrayView< InElementType, InSizeType >::Sort ( const PREDICATE_CLASS & Predicate )

inlineconstexpr

Sorts the array using user define predicate class.

Parameters

Predicate Predicate class instance.

Note: : If your array contains raw pointers, they will be automatically dereferenced during sorting. Therefore, your predicate will be passed references rather than pointers. If this is not desirable, please use Algo::Sort(MyArray, Predicate) directly instead. The auto-dereferencing behavior does not occur with smart pointers.

◆ StableSort() [1/2]

template<typename InElementType , typename InSizeType >

constexpr void TArrayView< InElementType, InSizeType >::StableSort ( )

inlineconstexpr

Stable sorts the array assuming < operator is defined for the item type.

Stable sort is slower than non-stable algorithm.

Note: : If your array contains raw pointers, they will be automatically dereferenced during sorting. Therefore, your array will be sorted by the values being pointed to, rather than the pointers' values. If this is not desirable, please use Algo::StableSort(MyArray) directly instead. The auto-dereferencing behavior does not occur with smart pointers.

◆ StableSort() [2/2]

template<typename InElementType , typename InSizeType >

template<class PREDICATE_CLASS >

constexpr void TArrayView< InElementType, InSizeType >::StableSort ( const PREDICATE_CLASS & Predicate )

inlineconstexpr

Stable sorts the array using user defined predicate class.

Stable sort is slower than non-stable algorithm.

Parameters

Predicate Predicate class instance

Note: : If your array contains raw pointers, they will be automatically dereferenced during sorting. Therefore, your predicate will be passed references rather than pointers. If this is not desirable, please use Algo::StableSort(MyArray, Predicate) directly instead. The auto-dereferencing behavior does not occur with smart pointers.

◆ UEOpEquals() [1/3]

template<typename InElementType , typename InSizeType >

constexpr bool TArrayView< InElementType, InSizeType >::UEOpEquals ( FIntrusiveUnsetOptionalState ) const

inlineconstexpr

◆ UEOpEquals() [2/3]

template<typename InElementType , typename InSizeType >

template<typename RangeType >
requires (std::is_convertible_v<decltype(UE::Core::ArrayView::Private::GetDataHelper(std::declval<RangeType&>())), const ElementType*>)

bool TArrayView< InElementType, InSizeType >::UEOpEquals ( RangeType && Rhs ) const

inline

Equality operator.

Parameters

Lhs	Another ranged type to compare.

Returns: True if this array view's contents and the other ranged type match. False otherwise.

◆ UEOpEquals() [3/3]

template<typename InElementType , typename InSizeType >

template<typename OtherElementType , typename OtherSizeType >

bool TArrayView< InElementType, InSizeType >::UEOpEquals ( TArrayView< OtherElementType, OtherSizeType > ) const

delete

Member Data Documentation

◆ bHasIntrusiveUnsetOptionalState

template<typename InElementType , typename InSizeType >

constexpr bool TArrayView< InElementType, InSizeType >::bHasIntrusiveUnsetOptionalState = true

staticconstexpr

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

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

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Detailed Description

Member Typedef Documentation

◆ ElementType

◆ IntrusiveUnsetOptionalStateType

◆ SizeType

Constructor & Destructor Documentation

◆ TArrayView() [1/7]

◆ ~TArrayView()

◆ TArrayView() [2/7]

◆ TArrayView() [3/7]

◆ TArrayView() [4/7]

◆ TArrayView() [5/7]

◆ TArrayView() [6/7]

◆ TArrayView() [7/7]

Member Function Documentation

◆ begin()

◆ CheckInvariants()

◆ Contains()

◆ ContainsByPredicate()

◆ end()

◆ FilterByPredicate()

◆ Find() [1/2]

◆ Find() [2/2]

◆ FindByKey()

◆ FindByPredicate()

◆ FindLast() [1/2]

◆ FindLast() [2/2]

◆ FindLastByPredicate() [1/2]

◆ FindLastByPredicate() [2/2]

◆ GetData()

◆ GetTypeAlignment()

◆ GetTypeSize()

◆ IndexOfByKey()

◆ IndexOfByPredicate()

◆ IsEmpty()

◆ IsValidIndex()

◆ Last()

◆ Left()

◆ LeftChop()

◆ LeftChopInline()

◆ LeftInline()

◆ Mid()

◆ MidInline()

◆ Num()

◆ NumBytes()

◆ operator=()

◆ operator[]()

◆ RangeCheck()

◆ rbegin()

◆ rend()

◆ Right()

◆ RightChop()

◆ RightChopInline()

◆ RightInline()

◆ Slice()

◆ SliceRangeCheck()

◆ Sort() [1/2]

◆ Sort() [2/2]

◆ StableSort() [1/2]

◆ StableSort() [2/2]

◆ UEOpEquals() [1/3]

◆ UEOpEquals() [2/3]

◆ UEOpEquals() [3/3]

Member Data Documentation

◆ bHasIntrusiveUnsetOptionalState