module Bisect
Overview
A direct port of the Python bisect standard library.
http://svn.python.org/view/python/branches/py3k/Lib/bisect.py?view=markup&pathrev=70846
Extended Modules
Defined in:
bisect.crInstance Method Summary
- #bisect(a, x, lo = 0, hi = a.size)
-
#bisect_left(a, x, lo = 0, hi = a.size)
Return the index where to insert item x in list a, assuming a is sorted.
-
#bisect_right(a, x, lo = 0, hi = a.size)
Return the index where to insert item x in list a, assuming a is sorted.
-
#find_ge(a, x)
Find leftmost item greater than or equal to x
-
#find_gt(a, x)
Find leftmost value greater than x
-
#find_le(a, x)
Find rightmost value less than or equal to x
-
#find_lt(a, x)
Find rightmost value less than x
- #insort(a, x, lo = 0, hi = a.size)
-
#insort_left(a, x, lo = 0, hi = a.size)
Insert item x in list a, and keep it sorted assuming a is sorted.
-
#insort_right(a, x, lo = 0, hi = a.size)
Insert item x in list a, and keep it sorted assuming a is sorted.
Instance Method Detail
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 a[i:] have e >= x. So if x already appears in the list, a.insert(x) will insert just before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched.
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 a[i:] have e > x. So if x already appears in the list, a.insert(x) will insert just after the rightmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched.
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched.
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched.