Navigation
API > API/Runtime > API/Runtime/Core
Overloads
| Name | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|
void StableSort
(
T* First, |
Stable sort elements. | Templates/Sorting.h | |
void StableSort
(
T** First, |
Specialized version of the above StableSort function for pointers to elements. | Templates/Sorting.h | |
void StableSort
(
T* First, |
Stable sort elements using user defined predicate class. | Templates/Sorting.h | |
void StableSort
(
T** First, |
Specialized version of the above StableSort function for pointers to elements. | Templates/Sorting.h |
StableSort(T *, const int32)
Description
Stable sort elements. The sort is stable, meaning that the ordering of equal items is preserved, but it's slower than non-stable algorithm.
Assumes < operator is defined for the template type.
| Name | StableSort |
| Type | function |
| Header File | /Engine/Source/Runtime/Core/Public/Templates/Sorting.h |
| Include Path | #include "Templates/Sorting.h" |
template<class T>
void StableSort
(
T * First,
const int32 Num
)
Parameters
| Name | Remarks |
|---|---|
| First | pointer to the first element to sort |
| Num | the number of items to sort |
StableSort(T **, const int32)
Description
Specialized version of the above StableSort function for pointers to elements. Stable sort is slower than non-stable algorithm.
| Name | StableSort |
| Type | function |
| Header File | /Engine/Source/Runtime/Core/Public/Templates/Sorting.h |
| Include Path | #include "Templates/Sorting.h" |
template<class T>
void StableSort
(
T ** First,
const int32 Num
)
Parameters
| Name | Remarks |
|---|---|
| First | pointer to the first element to sort |
| Num | the number of items to sort |
StableSort(T *, const int32, const PREDICATE_CLASS &)
Description
Stable sort elements using user defined predicate class. The sort is stable, meaning that the ordering of equal items is preserved, but it's slower than non-stable algorithm.
| Name | StableSort |
| Type | function |
| Header File | /Engine/Source/Runtime/Core/Public/Templates/Sorting.h |
| Include Path | #include "Templates/Sorting.h" |
template<class T, class PREDICATE_CLASS>
void StableSort
(
T * First,
const int32 Num,
const PREDICATE_CLASS & Predicate
)
Parameters
| Name | Remarks |
|---|---|
| First | pointer to the first element to sort |
| Num | the number of items to sort |
| Predicate | predicate class |
StableSort(T **, const int32, const PREDICATE_CLASS &)
Description
Specialized version of the above StableSort function for pointers to elements. Stable sort is slower than non-stable algorithm.
| Name | StableSort |
| Type | function |
| Header File | /Engine/Source/Runtime/Core/Public/Templates/Sorting.h |
| Include Path | #include "Templates/Sorting.h" |
template<class T, class PREDICATE_CLASS>
void StableSort
(
T ** First,
const int32 Num,
const PREDICATE_CLASS & Predicate
)
Parameters
| Name | Remarks |
|---|---|
| First | pointer to the first element to sort |
| Num | the number of items to sort |
| Predicate | predicate class |