Navigation
API > API/Runtime > API/Runtime/Chaos
Description
Stable counting sort: groups Elements into contiguous blocks by partition index, preserving the original relative order of elements within each block. PrefixSum supplies the start index of each partition index block after sorting and used as the starting write position for the sort. T may be any copyable type (pointer, handle, value).
| Name | Chaos::Private::SortArrayByPartitionIndex |
| Type | function |
| Header File | /Engine/Source/Runtime/Experimental/Chaos/Public/Chaos/Evolution/SolverPartitionManager.h |
| Include Path | #include "Chaos/Evolution/SolverPartitionManager.h" |
namespace Chaos
{
namespace Private
{
template<typename T>
void Chaos::Private::SortArrayByPartitionIndex
(
TArray < T > & Elements,
const TArray < int32 > & PartitionIndices,
const TArray < int32 > & PrefixSum
)
}
}