U

e5d¦ã@sZdZddd„
Z
d
dd„
Zddd„
Zdd	d
„
Zzd
dlTWnek
rL


YnXeZe
ZdS)zBisection algorithms.éNcCst||
||ƒ}| 
||
¡
d
S)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.
    N)Úbisect_rightÚinsert©Ú
aÚ
xÚloÚhi©r	ú/usr/lib64/python3.8/bisect.pyÚinsort_rights	
rcCsT|d
krtdƒ
‚
|dkr t
|ƒ
}||krP||d}|
||krF|}q |d}q |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
úlo must be non-negativeNéé
©Ú
ValueErrorÚlen©rrrrZmidr	r	r
rs








rcCst||
||ƒ}| 
||
¡
d
S)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.
    N)Úbisect_leftrrr	r	r
Úinsort_left$s	
rcCsT|d
krtdƒ
‚
|dkr t
|ƒ
}||krP||d}|||
krJ|d}q |}q |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
rNr
rrrr	r	r
r1s








r)
Ú
*)r
N)r
N)r
N)r
N)	Ú__doc__rrrrZ_bisectÚImportErrorZbisectZinsortr	r	r	r
Ú<module>
s