sort() [2/2]

template<typename Iterator, typename Compare>

void fl::adl_barrier::sort	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 571 of file algorithm.h.

                                                                    {
    if (first == last || first + 1 == last) {
        return;  // Already sorted or empty
    }
    
    detail::quicksort_impl(first, last, comp);
}

References fl::FL_NO_EXCEPT, and fl::detail::quicksort_impl().

Referenced by FL_DISABLE_WARNING(), sort(), fl::detail::AlphaTrimmedMeanImpl< T, N >::update(), and fl::detail::MedianFilterImpl< T, N >::update().

Here is the call graph for this function:

Here is the caller graph for this function: