Navigation
API > API/Runtime > API/Runtime/uLangCore
Description
Implementation of an introspective sort. Starts with quick sort and switches to heap sort when the iteration depth is too big. The sort is unstable, meaning that the ordering of equal items is not necessarily preserved. This is the internal sorting function used by IntroSort overrides.
| Name | uLang::AlgoImpl::IntroSortInternal |
| Type | function |
| Header File | /Engine/Source/Runtime/Solaris/uLangCore/Public/uLang/Common/Algo/IntroSort.h |
| Include Path | #include "uLang/Common/Algo/IntroSort.h" |
namespace uLang
{
namespace AlgoImpl
{
template<typename T, typename ProjectionType, typename PredicateType>
void uLang::AlgoImpl::IntroSortInternal
(
T * First,
size_t Num,
ProjectionType Projection,
PredicateType Predicate
)
}
}
Parameters
| Name | Remarks |
|---|---|
| First | pointer to the first element to sort |
| Num | the number of items to sort |
| Projection | The projection to sort by when applied to the element. |
| Predicate | predicate class |