e f#
@ s d Z d d d d Z e Z d d d d Z e Z d d d d Z d d d d
Z y d d l TWn e k
r| Yn Xd S) zBisection algorithms. Nc C s | d k r t d n | d k r6 t | } n xA | | k ry | | d } | | | k rl | } q9 | d } q9 W| j | | d S)zInsert 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 )
ValueErrorleninsert)axlohimid r +/opt/alt/python34/lib64/python3.4/bisect.py insort_right s r c C s~ | d k r t d n | d k r6 t | } n xA | | k ry | | d } | | | k rl | } q9 | d } q9 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 s | d k r t d n | d k r6 t | } n xA | | k ry | | d } | | | k rp | d } q9 | } q9 W| j | | d S)zInsert 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 s~ | d k r t d n | d k r6 t | } n xA | | k ry | | d } | | | k rp | d } q9 | } q9 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_leftC s
r )*) __doc__r Zinsortr Zbisectr r Z_bisect ImportErrorr r r r
s