Searched refs:MIN_GALLOP (Results 1 – 4 of 4) sorted by relevance
| /external/python/cpython2/Objects/ |
| D | listobject.c | 1351 #define MIN_GALLOP 7 macro
1405 ms->min_gallop = MIN_GALLOP; in merge_init()
1566 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_lo()
1705 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_hi()
|
| D | listsort.txt | 436 If that count reaches MIN_GALLOP, we switch to "galloping mode". Here
442 less than MIN_GALLOP elements long, at which point we go back to one-pair-
446 controls when we enter galloping mode, initialized to MIN_GALLOP.
555 at a time until the evidence seems strong that galloping may pay. MIN_GALLOP
559 in cases like ~sort, galloping always pays, and MIN_GALLOP is larger than it
570 but in all it's a minor improvement over using a fixed MIN_GALLOP value.
|
| /external/python/cpython3/Objects/ |
| D | listobject.c | 1109 #define MIN_GALLOP 7 macro
1501 ms->min_gallop = MIN_GALLOP; in merge_init()
1666 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_lo()
1806 } while (acount >= MIN_GALLOP || bcount >= MIN_GALLOP); in merge_hi()
|
| D | listsort.txt | 436 If that count reaches MIN_GALLOP, we switch to "galloping mode". Here
442 less than MIN_GALLOP elements long, at which point we go back to one-pair-
446 controls when we enter galloping mode, initialized to MIN_GALLOP.
555 at a time until the evidence seems strong that galloping may pay. MIN_GALLOP
559 in cases like ~sort, galloping always pays, and MIN_GALLOP is larger than it
570 but in all it's a minor improvement over using a fixed MIN_GALLOP value.
|