partition()

template<typename Iterator, typename Compare>

Iterator fl::detail::partition	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 343 of file algorithm.h.

                                                                             {
    Iterator middle = first + (last - first) / 2;
    Iterator pivot_iter = median_of_three(first, middle, last - 1, comp);
    
    // Move pivot to end
    swap(*pivot_iter, *(last - 1));
    Iterator pivot = last - 1;
    
    Iterator i = first;
    for (Iterator j = first; j != pivot; ++j) {
        if (comp(*j, *pivot)) {
            swap(*i, *j);
            ++i;
        }
    }
    
    swap(*i, *pivot);
    return i;
}

References fl::FL_NO_EXCEPT, median_of_three(), and fl::swap().

Referenced by quicksort_impl().

Here is the call graph for this function:

Here is the caller graph for this function: