Home
last modified time | relevance | path

Searched refs:partial_insertion_sort (Results 1 – 2 of 2) sorted by relevance

/external/sdv/vsomeip/third_party/boost/move/include/boost/move/algo/detail/
Dpdqsort.hpp110 inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { in partial_insertion_sort() function
307 if (already_partitioned && partial_insertion_sort(begin, pivot_pos, comp) in pdqsort_loop()
308 && partial_insertion_sort(pivot_pos + 1, end, comp)) return; in pdqsort_loop()
/external/rust/crates/rayon/src/slice/
Dquicksort.rs142 fn partial_insertion_sort<T, F>(v: &mut [T], is_less: &F) -> bool in partial_insertion_sort() function
794 if partial_insertion_sort(v, is_less) { in recurse()