Fix error in docstrings in bisect module (GH-21422)
The docstrings for `bisect_right()` and `bisect_left()` contain sample code that has a bug: `a.insert(x)` should be `a.insert(i, x)`.
This commit is contained in:
parent
344dce312a
commit
6a1e9c2673
|
@ -16,7 +16,7 @@ def bisect_right(a, x, lo=0, hi=None):
|
||||||
"""Return the index where to insert item x in list a, assuming a is sorted.
|
"""Return the index where to insert item x in list a, assuming a is sorted.
|
||||||
|
|
||||||
The return value i is such that all e in a[:i] have e <= x, and all e in
|
The return value i is such that all e in a[:i] have e <= x, and all e in
|
||||||
a[i:] have e > x. So if x already appears in the list, a.insert(x) will
|
a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will
|
||||||
insert just after the rightmost x already there.
|
insert just after the rightmost x already there.
|
||||||
|
|
||||||
Optional args lo (default 0) and hi (default len(a)) bound the
|
Optional args lo (default 0) and hi (default len(a)) bound the
|
||||||
|
@ -51,7 +51,7 @@ def bisect_left(a, x, lo=0, hi=None):
|
||||||
"""Return the index where to insert item x in list a, assuming a is sorted.
|
"""Return the index where to insert item x in list a, assuming a is sorted.
|
||||||
|
|
||||||
The return value i is such that all e in a[:i] have e < x, and all e in
|
The return value i is such that all e in a[:i] have e < x, and all e in
|
||||||
a[i:] have e >= x. So if x already appears in the list, a.insert(x) will
|
a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will
|
||||||
insert just before the leftmost x already there.
|
insert just before the leftmost x already there.
|
||||||
|
|
||||||
Optional args lo (default 0) and hi (default len(a)) bound the
|
Optional args lo (default 0) and hi (default len(a)) bound the
|
||||||
|
|
Loading…
Reference in New Issue