Home
last modified time | relevance | path

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

/third_party/boost/boost/move/algo/detail/
Dadaptive_sort_merge.hpp111 static const std::size_t AdaptiveSortInsertionSortThreshold = 16; variable
113 BOOST_STATIC_ASSERT((AdaptiveSortInsertionSortThreshold&(AdaptiveSortInsertionSortThreshold-1)) == …
454 while(s > AdaptiveSortInsertionSortThreshold){ in floor_merge_multiple()
469 if(base < AdaptiveSortInsertionSortThreshold){ in ceil_merge_multiple()
473 base = AdaptiveSortInsertionSortThreshold/2 + 1; in ceil_merge_multiple()
524 while((L - m) > size_type(AdaptiveSortInsertionSortThreshold)){ in slow_stable_sort()
525 insertion_sort(first+m, first+m+size_type(AdaptiveSortInsertionSortThreshold), comp); in slow_stable_sort()
526 m += AdaptiveSortInsertionSortThreshold; in slow_stable_sort()
531 size_type h = AdaptiveSortInsertionSortThreshold; in slow_stable_sort()
1358 size_type const s = min_value<size_type>(step, AdaptiveSortInsertionSortThreshold); in op_insertion_sort_step_left()
[all …]
/third_party/boost/boost/move/algo/
Dadaptive_sort.hpp464 l_base = min_value<Unsigned>(n_keys, AdaptiveSortInsertionSortThreshold); in adaptive_sort_build_params()
541 if(len <= size_type(AdaptiveSortInsertionSortThreshold)){ in adaptive_sort_impl()
549 BOOST_STATIC_ASSERT(AdaptiveSortInsertionSortThreshold >= 4); in adaptive_sort_impl()