9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi)  in internal_bisect_right()  argument
18     if (hi == -1) {  in internal_bisect_right()
19         hi = PySequence_Size(list);  in internal_bisect_right()
20         if (hi < 0)  in internal_bisect_right()
23     while (lo < hi) {  in internal_bisect_right()
27         mid = ((size_t)lo + hi) / 2;  in internal_bisect_right()
36             hi = mid;  in internal_bisect_right()
48     Py_ssize_t hi = -1;  in bisect_right()  local
53         keywords, &list, &item, &lo, &hi))  in bisect_right()
55     index = internal_bisect_right(list, item, lo, hi);  in bisect_right()
79     Py_ssize_t hi = -1;  in insort_right()  local
84         keywords, &list, &item, &lo, &hi))  in insort_right()
86     index = internal_bisect_right(list, item, lo, hi);  in insort_right()
115 internal_bisect_left(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi)  in internal_bisect_left()  argument
124     if (hi == -1) {  in internal_bisect_left()
125         hi = PySequence_Size(list);  in internal_bisect_left()
126         if (hi < 0)  in internal_bisect_left()
129     while (lo < hi) {  in internal_bisect_left()
133         mid = ((size_t)lo + hi) / 2;  in internal_bisect_left()
144             hi = mid;  in internal_bisect_left()
154     Py_ssize_t hi = -1;  in bisect_left()  local
159         keywords, &list, &item, &lo, &hi))  in bisect_left()
161     index = internal_bisect_left(list, item, lo, hi);  in bisect_left()
184     Py_ssize_t hi = -1;  in insort_left()  local
189         keywords, &list, &item, &lo, &hi))  in insort_left()
191     index = internal_bisect_left(list, item, lo, hi);  in insort_left()