Searched refs:gallop_left (Results 1 – 2 of 2) sorted by relevance
| /external/python/cpython2/Objects/ |
| D | listsort.txt | 510 comparison is expensive, and gallop_left() and gallop_right() are
579 this reason, the gallop_left() and gallop_right() (see note LEFT OR RIGHT)
711 gallop_left() and gallop_right() are akin to the Python bisect module's
714 for. In that case, gallop_left() returns the position immediately before the
717 general, when merging adjacent runs A and B, gallop_left is used to search
|
| D | listobject.c | 1176 gallop_left(PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint, PyObject *compare) in gallop_left() function
1553 k = gallop_left(*pa, pb, nb, 0, compare); in merge_lo()
1685 k = gallop_left(*pa, baseb, nb, nb-1, compare); in merge_hi()
1775 nb = gallop_left(pa[na-1], pb, nb, nb-1, compare); in merge_at()
|