home *** CD-ROM | disk | FTP | other *** search
- # Source Generated with Decompyle++
- # File: in.pyo (Python 2.6)
-
-
- def insort_right(a, x, cmp, lo = 0, hi = None):
- if hi is None:
- hi = len(a)
-
- while lo < hi:
- mid = (lo + hi) // 2
- if cmp(x, a[mid]) < 0:
- hi = mid
- continue
- lo = mid + 1
- a.insert(lo, x)
-
- insort = insort_right
-
- def bisect_right(a, x, cmp, lo = 0, hi = None):
- if hi is None:
- hi = len(a)
-
- while lo < hi:
- mid = (lo + hi) // 2
- if cmp(x, a[mid]) < 0:
- hi = mid
- continue
- lo = mid + 1
- return lo
-
- bisect = bisect_right
-
- def insort_left(a, x, cmp, lo = 0, hi = None):
- if hi is None:
- hi = len(a)
-
- while lo < hi:
- mid = (lo + hi) // 2
- if cmp(a[mid], x) < 0:
- lo = mid + 1
- continue
- hi = mid
- a.insert(lo, x)
-
-
- def bisect_left(a, x, cmp, lo = 0, hi = None):
- if hi is None:
- hi = len(a)
-
- while lo < hi:
- mid = (lo + hi) // 2
- if cmp(a[mid], x) < 0:
- lo = mid + 1
- continue
- hi = mid
- return lo
-
-