Searched refs:min_gallop (Results 1 – 2 of 2) sorted by relevance
1375 Py_ssize_t min_gallop; member1408 ms->min_gallop = MIN_GALLOP; in merge_init()1468 Py_ssize_t min_gallop; in merge_lo() local1484 min_gallop = ms->min_gallop; in merge_lo()1505 if (bcount >= min_gallop) in merge_lo()1515 if (acount >= min_gallop) in merge_lo()1525 ++min_gallop; in merge_lo()1528 min_gallop -= min_gallop > 1; in merge_lo()1529 ms->min_gallop = min_gallop; in merge_lo()1570 ++min_gallop; /* penalize it for leaving galloping mode */ in merge_lo()[all …]
445 A refinement: The MergeState struct contains the value of min_gallop that560 "should be" then. So the MergeState struct keeps a min_gallop variable562 the smaller min_gallop gets, making it easier to transition back to565 min_gallop is increased by one, making it harder to transition back567 random data, this all but eliminates the gallop penalty: min_gallop grows569 like ~sort, min_gallop can fall to as low as 1. This seems to work well,