diff options
| author | Guido van Rossum <guido@python.org> | 1997-10-07 14:45:49 (GMT) |
|---|---|---|
| committer | Guido van Rossum <guido@python.org> | 1997-10-07 14:45:49 (GMT) |
| commit | d5484fb75c6b2b43867662c60f0ef59283d8468a (patch) | |
| tree | d0d25373c83fb19036b67763b17dfebe1a609892 | |
| parent | eec6ef1aa279e258d2c067d2916120d132d00806 (diff) | |
| download | cpython-d5484fb75c6b2b43867662c60f0ef59283d8468a.zip cpython-d5484fb75c6b2b43867662c60f0ef59283d8468a.tar.gz cpython-d5484fb75c6b2b43867662c60f0ef59283d8468a.tar.bz2 | |
Add optional arguments lo and hi to insort() and bisect(), to support
using arrays containing leading or trailing garbage.
| -rw-r--r-- | Lib/bisect.py | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/Lib/bisect.py b/Lib/bisect.py index 688666a..4d92bc8 100644 --- a/Lib/bisect.py +++ b/Lib/bisect.py @@ -3,8 +3,9 @@ # Insert item x in list a, and keep it sorted assuming a is sorted -def insort(a, x): - lo, hi = 0, len(a) +def insort(a, x, lo=0, hi=None): + if hi is None: + hi = len(a) while lo < hi: mid = (lo+hi)/2 if x < a[mid]: hi = mid @@ -14,8 +15,9 @@ def insort(a, x): # Find the index where to insert item x in list a, assuming a is sorted -def bisect(a, x): - lo, hi = 0, len(a) +def bisect(a, x, lo=0, hi=None): + if hi is None: + hi = len(a) while lo < hi: mid = (lo+hi)/2 if x < a[mid]: hi = mid |