Searched refs:min_gallop (Results 1 – 4 of 4) sorted by relevance
| /external/python/cpython2/Objects/ |
| D | listobject.c | 1372 Py_ssize_t min_gallop; member
1405 ms->min_gallop = MIN_GALLOP; in merge_init()
1465 Py_ssize_t min_gallop; in merge_lo() local
1481 min_gallop = ms->min_gallop; in merge_lo()
1502 if (bcount >= min_gallop) in merge_lo()
1512 if (acount >= min_gallop) in merge_lo()
1522 ++min_gallop; in merge_lo()
1525 min_gallop -= min_gallop > 1; in merge_lo()
1526 ms->min_gallop = min_gallop; in merge_lo()
1567 ++min_gallop; /* penalize it for leaving galloping mode */ in merge_lo()
[all …]
|
| D | listsort.txt | 445 A refinement: The MergeState struct contains the value of min_gallop that
560 "should be" then. So the MergeState struct keeps a min_gallop variable
562 the smaller min_gallop gets, making it easier to transition back to
565 min_gallop is increased by one, making it harder to transition back
567 random data, this all but eliminates the gallop penalty: min_gallop grows
569 like ~sort, min_gallop can fall to as low as 1. This seems to work well,
|
| /external/python/cpython3/Objects/ |
| D | listobject.c | 1152 Py_ssize_t min_gallop; member
1521 ms->min_gallop = MIN_GALLOP; in merge_init()
1585 Py_ssize_t min_gallop; in merge_lo() local
1602 min_gallop = ms->min_gallop; in merge_lo()
1622 if (bcount >= min_gallop) in merge_lo()
1632 if (acount >= min_gallop) in merge_lo()
1642 ++min_gallop; in merge_lo()
1645 min_gallop -= min_gallop > 1; in merge_lo()
1646 ms->min_gallop = min_gallop; in merge_lo()
1687 ++min_gallop; /* penalize it for leaving galloping mode */ in merge_lo()
[all …]
|
| D | listsort.txt | 445 A refinement: The MergeState struct contains the value of min_gallop that
560 "should be" then. So the MergeState struct keeps a min_gallop variable
562 the smaller min_gallop gets, making it easier to transition back to
565 min_gallop is increased by one, making it harder to transition back
567 random data, this all but eliminates the gallop penalty: min_gallop grows
569 like ~sort, min_gallop can fall to as low as 1. This seems to work well,
|