Lines Matching defs:list
29 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi,
41 hi = PySequence_Size(list);
50 litem = PySequence_GetItem(list, mid);
83 Return the index where to insert item x in list a, assuming a is sorted.
86 a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will
111 Insert item x in list a, and keep it sorted assuming a is sorted.
155 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi,
167 hi = PySequence_Size(list);
176 litem = PySequence_GetItem(list, mid);
210 Return the index where to insert item x in list a, assuming a is sorted.
213 a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will
239 Insert item x in list a, and keep it sorted assuming a is sorted.
292 This module provides support for maintaining a list in sorted order without\n\
293 having to sort the list after each insertion. For long lists of items with\n\