- Notifications
You must be signed in to change notification settings - Fork 31.7k
/
Copy pathbisect.py
92 lines (73 loc) · 2.5 KB
/
bisect.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
"""Bisection algorithms."""
definsort_right(a, x, lo=0, hi=None):
"""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.
"""
iflo<0:
raiseValueError('lo must be non-negative')
ifhiisNone:
hi=len(a)
whilelo<hi:
mid= (lo+hi)//2
ifx<a[mid]: hi=mid
else: lo=mid+1
a.insert(lo, x)
defbisect_right(a, x, lo=0, hi=None):
"""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.
"""
iflo<0:
raiseValueError('lo must be non-negative')
ifhiisNone:
hi=len(a)
whilelo<hi:
mid= (lo+hi)//2
ifx<a[mid]: hi=mid
else: lo=mid+1
returnlo
definsort_left(a, x, lo=0, hi=None):
"""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.
"""
iflo<0:
raiseValueError('lo must be non-negative')
ifhiisNone:
hi=len(a)
whilelo<hi:
mid= (lo+hi)//2
ifa[mid] <x: lo=mid+1
else: hi=mid
a.insert(lo, x)
defbisect_left(a, x, lo=0, hi=None):
"""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.
"""
iflo<0:
raiseValueError('lo must be non-negative')
ifhiisNone:
hi=len(a)
whilelo<hi:
mid= (lo+hi)//2
ifa[mid] <x: lo=mid+1
else: hi=mid
returnlo
# Overwrite above definitions with a fast C implementation
try:
from_bisectimport*
exceptImportError:
pass
# Create aliases
bisect=bisect_right
insort=insort_right
