Home
last modified time | relevance | path

Searched refs:gallop_left (Results 1 – 4 of 4) sorted by relevance

/external/python/cpython2/Objects/
Dlistsort.txt510 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
Dlistobject.c1173 gallop_left(PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint, PyObject *compare) in gallop_left() function
1550 k = gallop_left(*pa, pb, nb, 0, compare); in merge_lo()
1682 k = gallop_left(*pa, baseb, nb, nb-1, compare); in merge_hi()
1772 nb = gallop_left(pa[na-1], pb, nb, nb-1, compare); in merge_at()
/external/python/cpython3/Objects/
Dlistsort.txt510 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
Dlistobject.c1308 gallop_left(MergeState *ms, PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint) in gallop_left() function
1650 k = gallop_left(ms, ssa.keys[0], ssb.keys, nb, 0); in merge_lo()
1783 k = gallop_left(ms, ssa.keys[0], baseb.keys, nb, nb-1); in merge_hi()
1871 nb = gallop_left(ms, ssa.keys[na-1], ssb.keys, nb, nb-1); in merge_at()