3


 \#
ã@sZdZddd„
Z
e
Zd
dd„
ZeZddd„
Zdd	d
„
Zyd
dlTWnek
rT


YnXdS)zBisection algorithms.éNcCsd|d
krtdƒ
‚
|dkr t
|ƒ
}x2||krR||d}|
||krH|}q"|d}q"W|j||
ƒ
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/lib64/python3.6/bisect.pyÚinsort_rights	








rcCsX|d
krtdƒ
‚
|dkr t
|ƒ
}x2||krR||d}|
||krH|}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-negativeNrr)rr)rrr	r
rrrr
Úbisect_rights








rcCsd|d
krtdƒ
‚
|dkr t
|ƒ
}x2||krR||d}|||
krL|d}q"|}q"W|j||
ƒ
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-negativeNrr)rrr)rrr	r
rrrr
Úinsort_left/s	









rcCsX|d
krtdƒ
‚
|dkr t
|ƒ
}x2||krR||d}|||
krL|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-negativeNrr)rr)rrr	r
rrrr
Úbisect_leftCs









r)
Ú
*)r
N)r
N)r
N)r
N)	Ú__doc__rZinsortrZbisectrrZ_bisectÚImportErrorrrrr
Ú<module>
s