AlgoImpl::IntroSortInternal

Navigation

API > API/Runtime > API/Runtime/Core

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.

namespace AlgoImpl  
{  
    template<typename T, typename IndexType, typename ProjectionType, typename PredicateType>  
    void AlgoImpl::IntroSortInternal  
    (  
        T * First,  
        IndexType Num,  
        ProjectionType Proj,  
        PredicateType Predicate  
    )  
}  
Copy full snippet

namespace AlgoImpl {     template<typename T, typename IndexType, typename ProjectionType, typename PredicateType>     void AlgoImpl::IntroSortInternal     (         T * First,         IndexType Num,         ProjectionType Proj,         PredicateType Predicate     ) }

Parameters