insertion_sort()

template<typename Iterator, typename Compare>

void fl::detail::insertion_sort	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 303 of file algorithm.h.

                                                                              {
    if (first == last) return;
    
    for (Iterator i = first + 1; i != last; ++i) {
        auto value = fl::move(*i);
        Iterator j = i;
        
        while (j != first && comp(value, *(j - 1))) {
            *j = fl::move(*(j - 1));
            --j;
        }
        
        *j = fl::move(value);
    }
}

References fl::FL_NO_EXCEPT, fl::fl::adl_barrier::move(), and fl::type_rank< T >::value.

Referenced by mergesort_impl(), quicksort_impl(), and fl::adl_barrier::sort_small().

Here is the call graph for this function:

Here is the caller graph for this function: