@@ -73,8 +73,8 @@ _bisect.bisect_right -> Py_ssize_t
73
73
Return the index where to insert item x in list a, assuming a is sorted.
74
74
75
75
The return value i is such that all e in a[:i] have e <= x, and all e in
76
- a[i:] have e > x. So if x already appears in the list, i points just
77
- beyond the rightmost x already there
76
+ a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will
77
+ insert just after the rightmost x already there.
78
78
79
79
Optional args lo (default 0) and hi (default len(a)) bound the
80
80
slice of a to be searched.
@@ -83,7 +83,7 @@ slice of a to be searched.
83
83
static Py_ssize_t
84
84
_bisect_bisect_right_impl (PyObject * module , PyObject * a , PyObject * x ,
85
85
Py_ssize_t lo , Py_ssize_t hi , PyObject * key )
86
- /*[clinic end generated code: output=3a4bc09cc7c8a73d input=1313e9ca20c8bc3c ]*/
86
+ /*[clinic end generated code: output=3a4bc09cc7c8a73d input=40fcc5afa06ae593 ]*/
87
87
{
88
88
return internal_bisect_right (a , x , lo , hi , key );
89
89
}
@@ -199,8 +199,8 @@ _bisect.bisect_left -> Py_ssize_t
199
199
Return the index where to insert item x in list a, assuming a is sorted.
200
200
201
201
The return value i is such that all e in a[:i] have e < x, and all e in
202
- a[i:] have e >= x. So if x already appears in the list, i points just
203
- before the leftmost x already there.
202
+ a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will
203
+ insert just before the leftmost x already there.
204
204
205
205
Optional args lo (default 0) and hi (default len(a)) bound the
206
206
slice of a to be searched.
@@ -209,7 +209,7 @@ slice of a to be searched.
209
209
static Py_ssize_t
210
210
_bisect_bisect_left_impl (PyObject * module , PyObject * a , PyObject * x ,
211
211
Py_ssize_t lo , Py_ssize_t hi , PyObject * key )
212
- /*[clinic end generated code: output=70749d6e5cae9284 input=3cbeec690f2f6c6e ]*/
212
+ /*[clinic end generated code: output=70749d6e5cae9284 input=90dd35b50ceb05e3 ]*/
213
213
{
214
214
return internal_bisect_left (a , x , lo , hi , key );
215
215
}
0 commit comments