execute()

template<std::random_access_iterator Iterator, typename Comparator >

void MayaFlux::Kinesis::Discrete::execute	(	Iterator	begin,
		Iterator	end,
		Comparator	comp,
		SortingAlgorithm	algorithm
	)

Execute a sorting algorithm on an iterator range.

Unimplemented algorithm variants fall back to STANDARD.

Template Parameters

Iterator	Random access iterator
Comparator	Binary predicate

Parameters

begin	Start of range
end	End of range
comp	Comparator
algorithm	Algorithm to use

Definition at line 128 of file Sort.hpp.

{
    switch (algorithm) {
    case SortingAlgorithm::STABLE:
        std::ranges::stable_sort(begin, end, comp);
        return;
 
    case SortingAlgorithm::PARTIAL: {
        const auto dist = std::distance(begin, end);
        if (dist > 1)
            std::partial_sort(begin, begin + dist / 2, end, comp);
        return;
    }
 
    case SortingAlgorithm::NTH_ELEMENT: {
        const auto dist = std::distance(begin, end);
        if (dist > 1)
            std::nth_element(begin, begin + dist / 2, end, comp);
        return;
    }
 
    case SortingAlgorithm::HEAP:
        std::make_heap(begin, end, comp);
        std::sort_heap(begin, end, comp);
        return;
 
    case SortingAlgorithm::PARALLEL:
        MayaFlux::Parallel::sort(MayaFlux::Parallel::par_unseq, begin, end, comp);
        return;
 
    case SortingAlgorithm::STANDARD:
    default:
        std::ranges::sort(begin, end, comp);
        return;
    }
}

References HEAP, NTH_ELEMENT, PARALLEL, PARTIAL, STABLE, and STANDARD.

Referenced by sort_span().

Here is the caller graph for this function: