git: 9front

ref: 4bb9e229bcb23826a0fde907667c8fd6565d98d2
dir: /sys/lib/python/bisect.pyc/

View raw version 
��
�l�Jc@s�dZddd�ZeZddd�ZeZddd�Zddd�Zy2ddklZlZlZlZlZlZWne	j
onXdS(	sBisection algorithms.icCsy|djot|�}nxE||jo7||d}|||jo
|}q |d}q W|i||�dS(s�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.
    iiN(tNonetlentinsert(tatxtlothitmid((s/sys/lib/python/bisect.pytinsort_rights	
cCsi|djot|�}nxE||jo7||d}|||jo
|}q |d}q W|S(s�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.
    iiN(RR(RRRRR((s/sys/lib/python/bisect.pytbisect_rights
cCsy|djot|�}nxE||jo7||d}|||jo|d}q |}q W|i||�dS(s�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.
    iiN(RRR(RRRRR((s/sys/lib/python/bisect.pytinsort_left+s	
cCsi|djot|�}nxE||jo7||d}|||jo|d}q |}q W|S(s�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.
    iiN(RR(RRRRR((s/sys/lib/python/bisect.pytbisect_left=s
i����(R	RR
RtinsorttbisectN(
t__doc__RRRR	R
R
Rt_bisecttImportError(((s/sys/lib/python/bisect.pys<module>s2