Lines Matching defs:list
9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi)
19 hi = PySequence_Size(list);
25 litem = PySequence_GetItem(list, mid);
43 PyObject *list, *item;
50 keywords, &list, &item, &lo, &hi))
52 index = internal_bisect_right(list, item, lo, hi);
61 Return the index where to insert item x in list a, assuming a is sorted.\n\
64 a[i:] have e > x. So if x already appears in the list, i points just\n\
73 PyObject *list, *item, *result;
80 keywords, &list, &item, &lo, &hi))
82 index = internal_bisect_right(list, item, lo, hi);
85 if (PyList_CheckExact(list)) {
86 if (PyList_Insert(list, index, item) < 0)
89 result = PyObject_CallMethod(list, "insert", "nO",
102 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
110 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi)
120 hi = PySequence_Size(list);
126 litem = PySequence_GetItem(list, mid);
144 PyObject *list, *item;
151 keywords, &list, &item, &lo, &hi))
153 index = internal_bisect_left(list, item, lo, hi);
162 Return the index where to insert item x in list a, assuming a is sorted.\n\
165 a[i:] have e >= x. So if x already appears in the list, i points just\n\
174 PyObject *list, *item, *result;
181 keywords, &list, &item, &lo, &hi))
183 index = internal_bisect_left(list, item, lo, hi);
186 if (PyList_CheckExact(list)) {
187 if (PyList_Insert(list, index, item) < 0)
190 result = PyObject_CallMethod(list, "insert", "iO",
203 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
232 This module provides support for maintaining a list in sorted order without\n\
233 having to sort the list after each insertion. For long lists of items with\n\