Searched refs:stackLen (Results 1 – 2 of 2) sorted by relevance
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| H A D | sorting.d | 2270 size_t stackLen = 0; in TimSortImpl() local
2290 stack[stackLen++] = Slice(i, runLen); in TimSortImpl()
2295 while (stackLen > 1) in TimSortImpl()
2297 immutable run4 = stackLen - 1; in TimSortImpl()
2298 immutable run3 = stackLen - 2; in TimSortImpl()
2299 immutable run2 = stackLen - 3; in TimSortImpl()
2300 immutable run1 = stackLen - 4; in TimSortImpl()
2302 … if ( (stackLen > 2 && stack[run2].length <= stack[run3].length + stack[run4].length) || in TimSortImpl()
2303 … (stackLen > 3 && stack[run1].length <= stack[run3].length + stack[run2].length) ) in TimSortImpl()
2306 mergeAt(range, stack[0 .. stackLen], at, minGallop, temp); in TimSortImpl()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
| H A D | sorting.d | 2366 size_t stackLen = 0; in TimSortImpl() local
2386 stack[stackLen++] = Slice(i, runLen); in TimSortImpl()
2391 while (stackLen > 1) in TimSortImpl()
2393 immutable run4 = stackLen - 1; in TimSortImpl()
2394 immutable run3 = stackLen - 2; in TimSortImpl()
2395 immutable run2 = stackLen - 3; in TimSortImpl()
2396 immutable run1 = stackLen - 4; in TimSortImpl()
2398 … if ( (stackLen > 2 && stack[run2].length <= stack[run3].length + stack[run4].length) || in TimSortImpl()
2399 … (stackLen > 3 && stack[run1].length <= stack[run3].length + stack[run2].length) ) in TimSortImpl()
2402 mergeAt(range, stack[0 .. stackLen], at, minGallop, temp); in TimSortImpl()
[all …]
|