File: //usr/lib/python3.7/__pycache__/bisect.cpython-37.pyc
B
îÇ{aý ã @ sZ d Z d dd„Zd
dd„Zddd„Zdd d
„Zy dd lT W n ek
rL Y nX eZeZdS )zBisection algorithms.é Nc C sd |dk rt dƒ‚|dkr t| ƒ}x2||k rR|| d }|| | k rH|}q"|d }q"W | ||¡ dS )zï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.
r zlo must be non-negativeNé é )Ú
ValueErrorÚlenÚinsert)ÚaÚxÚloÚhiÚmid© r ú /usr/lib/python3.7/bisect.pyÚ insort_right s
r c C sX |dk rt dƒ‚|dkr t| ƒ}x2||k rR|| d }|| | k rH|}q"|d }q"W |S )a€ 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.
r zlo must be non-negativeNr r )r r )r r r r
r r r r
Ú bisect_right s
r c C sd |dk rt dƒ‚|dkr t| ƒ}x2||k rR|| d }| | |k rL|d }q"|}q"W | ||¡ dS )zí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.
r zlo must be non-negativeNr r )r r r )r r r r
r r r r
Ú insort_left+ s
r c C sX |dk rt dƒ‚|dkr t| ƒ}x2||k rR|| d }| | |k rL|d }q"|}q"W |S )a€ 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.
r zlo must be non-negativeNr r )r r )r r r r
r r r r
Ú bisect_left? s
r )Ú*)r N)r N)r N)r N) Ú__doc__r r r r Z_bisectÚ ImportErrorZbisectZinsortr r r r
Ú<module> s