qsort_insertion_sort()

static void fl::qsort_insertion_sort ( char * base, size_t nmemb, size_t size, qsort_compare_fn compar )

static

Definition at line 348 of file cstdlib.cpp.hpp.

                                                                                                 {
    for (size_t i = 1; i < nmemb; ++i) {
        // Save current element in temp buffer
        char temp[256]; // Stack buffer for elements up to 256 bytes
        char* elem_i = base + i * size;
 
        if (size <= sizeof(temp)) {
            memcpy(temp, elem_i, size);
 
            size_t j = i;
            while (j > 0 && compar(temp, base + (j - 1) * size) < 0) {
                memcpy(base + j * size, base + (j - 1) * size, size);
                --j;
            }
 
            memcpy(base + j * size, temp, size);
        } else {
            // For large elements, use swaps instead of shifts
            size_t j = i;
            while (j > 0 && compar(elem_i, base + (j - 1) * size) < 0) {
                detail::qsort_swap(base + j * size, base + (j - 1) * size, size);
                --j;
            }
        }
    }
}

References memcpy(), and fl::detail::qsort_swap().

Referenced by fl::detail::qsort_impl().

Here is the call graph for this function:

Here is the caller graph for this function: