sort_small() [1/2]

template<typename Iterator>

void fl::adl_barrier::sort_small	(	Iterator	first,
		Iterator	last )

Definition at line 627 of file algorithm.h.

                                                            {
    typedef typename fl::remove_reference<decltype(*first)>::type value_type;
    sort_small(first, last,
        [](const value_type& a, const value_type& b) { return a < b; });
}

References fl::FL_NO_EXCEPT, and sort_small().

Here is the call graph for this function: