Searched refs:merge_hi (Results 1 – 4 of 4) sorted by relevance
| /external/python/cpython2/Objects/ |
| D | listsort.txt | 400 If B is smaller (function merge_hi, which is merge_lo's "mirror image"),
423 merge_lo() and merge_hi() are where the bulk of the time is spent. merge_lo
424 deals with runs where A <= B, and merge_hi where A > B. They don't know
428 merge_lo here; merge_hi is exactly analogous.
447 merge_lo() and merge_hi() adjust this higher when galloping isn't paying
561 that merge_lo and merge_hi adjust: the longer we stay in galloping mode,
575 The description above was for merge_lo. merge_hi has to merge "from the
|
| D | listobject.c | 1591 merge_hi(MergeState *ms, PyObject **pa, Py_ssize_t na, PyObject **pb, Py_ssize_t nb) in merge_hi() function
1782 return merge_hi(ms, pa, na, pb, nb); in merge_at()
|
| /external/python/cpython3/Objects/ |
| D | listsort.txt | 400 If B is smaller (function merge_hi, which is merge_lo's "mirror image"),
423 merge_lo() and merge_hi() are where the bulk of the time is spent. merge_lo
424 deals with runs where A <= B, and merge_hi where A > B. They don't know
428 merge_lo here; merge_hi is exactly analogous.
447 merge_lo() and merge_hi() adjust this higher when galloping isn't paying
561 that merge_lo and merge_hi adjust: the longer we stay in galloping mode,
575 The description above was for merge_lo. merge_hi has to merge "from the
|
| D | listobject.c | 1691 merge_hi(MergeState *ms, sortslice ssa, Py_ssize_t na, in merge_hi() function
1881 return merge_hi(ms, ssa, na, ssb, nb); in merge_at()
|