sort_small() [2/2]

template<typename Iterator, typename Compare>

void fl::sort_small	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 612 of file algorithm.h.

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

References FL_NOEXCEPT, and fl::detail::insertion_sort().

Referenced by fl::ChannelManager::addDriver(), fl::ChannelManager::setDriverPriority(), and sort_small().

Here is the call graph for this function:

Here is the caller graph for this function: