Home
last modified time | relevance | path

Searched refs:minrun (Results 1 – 6 of 6) sorted by relevance

/external/libxml2/
Dtimsort.h132 const int minrun = size >> shift; in compute_minrun() local
136 return minrun + 1; in compute_minrun()
139 return minrun; in compute_minrun()
490 const size_t minrun, in PUSH_NEXT() argument
495 size_t run = minrun; in PUSH_NEXT()
531 size_t minrun; in TIM_SORT() local
548 minrun = compute_minrun(size); in TIM_SORT()
554 if (!PUSH_NEXT(dst, size, store, minrun, run_stack, &stack_curr, &curr)) { in TIM_SORT()
558 if (!PUSH_NEXT(dst, size, store, minrun, run_stack, &stack_curr, &curr)) { in TIM_SORT()
562 if (!PUSH_NEXT(dst, size, store, minrun, run_stack, &stack_curr, &curr)) { in TIM_SORT()
[all …]
/external/python/cpython2/Objects/
Dlistsort.txt235 run contains less than minrun elements (see next section), the main loop
236 artificially boosts it to minrun elements, via a stable binary insertion sort
238 run. In a random array, *all* runs are likely to be minrun long as a
248 inline everything. Since there are no more than N/minrun runs to begin
252 Computing minrun
254 If N < 64, minrun is N. IOW, binary insertion sort is used for the whole
258 When N is a power of 2, testing on random data showed that minrun values of
282 If we take minrun=33 in this case, then we're very likely to end up with 64
285 What we want to avoid is picking minrun such that in
287 q, r = divmod(N, minrun)
[all …]
Dlistobject.c2049 Py_ssize_t minrun; in listsort() local
2131 minrun = merge_compute_minrun(nremaining); in listsort()
2143 if (n < minrun) { in listsort()
2144 const Py_ssize_t force = nremaining <= minrun ? in listsort()
2145 nremaining : minrun; in listsort()
/external/python/cpython3/Objects/
Dlistsort.txt235 run contains less than minrun elements (see next section), the main loop
236 artificially boosts it to minrun elements, via a stable binary insertion sort
238 run. In a random array, *all* runs are likely to be minrun long as a
248 inline everything. Since there are no more than N/minrun runs to begin
252 Computing minrun
254 If N < 64, minrun is N. IOW, binary insertion sort is used for the whole
258 When N is a power of 2, testing on random data showed that minrun values of
282 If we take minrun=33 in this case, then we're very likely to end up with 64
285 What we want to avoid is picking minrun such that in
287 q, r = divmod(N, minrun)
[all …]
Dlistobject.c2217 Py_ssize_t minrun; in list_sort_impl() local
2391 minrun = merge_compute_minrun(nremaining); in list_sort_impl()
2403 if (n < minrun) { in list_sort_impl()
2404 const Py_ssize_t force = nremaining <= minrun ? in list_sort_impl()
2405 nremaining : minrun; in list_sort_impl()
/external/v8/third_party/v8/builtins/
Darray-sort.tq1251 // and extending short natural runs to minrun elements.