FastLED 3.9.15
Loading...
Searching...
No Matches

◆ sort() [2/2]

template<typename Iterator, typename Compare>
void fl::sort ( Iterator first,
Iterator last,
Compare comp )

Definition at line 564 of file algorithm.h.

564 {
565 if (first == last || first + 1 == last) {
566 return; // Already sorted or empty
567 }
568
569 detail::quicksort_impl(first, last, comp);
570}
void quicksort_impl(Iterator first, Iterator last, Compare comp) FL_NOEXCEPT
Definition algorithm.h:411

References FL_NOEXCEPT, 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: