Searched refs:gallop_right (Results 1 – 4 of 4) 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
715 leftmost equal value, and gallop_right() the position immediately after the
718 thru B for where an element from A belongs, and gallop_right to search thru A
|
| D | listobject.c | 1264 gallop_right(PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint, PyObject *compare) in gallop_right() function
1527 k = gallop_right(*pb, pa, na, 0, compare); in merge_lo()
1664 k = gallop_right(*pb, basea, na, na-1, compare); in merge_hi()
1761 k = gallop_right(*pb, pa, na, 0, compare); in merge_at()
|
| /external/python/cpython3/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
715 leftmost equal value, and gallop_right() the position immediately after the
718 thru B for where an element from A belongs, and gallop_right to search thru A
|
| D | listobject.c | 1399 gallop_right(MergeState *ms, PyObject *key, PyObject **a, Py_ssize_t n, Py_ssize_t hint) in gallop_right() function
1627 k = gallop_right(ms, ssb.keys[0], ssa.keys, na, 0); in merge_lo()
1765 k = gallop_right(ms, ssb.keys[0], basea.keys, na, na-1); in merge_hi()
1860 k = gallop_right(ms, *ssb.keys, ssa.keys, na, 0); in merge_at()
|