| Current Path : /usr/local/lib/python2.5/ |
FreeBSD hs32.drive.ne.jp 9.1-RELEASE FreeBSD 9.1-RELEASE #1: Wed Jan 14 12:18:08 JST 2015 root@hs32.drive.ne.jp:/sys/amd64/compile/hs32 amd64 |
| Current File : //usr/local/lib/python2.5/bisect.pyo |
łň
hRc @ s d Z d d d Z e Z d d d Z e Z d d d Z d d d Z y2 d d k l Z l Z l Z l Z l Z l Z Wn e j
o n Xd S( s Bisection algorithms.i c C sy | d j o t | } n xE | | j o7 | | d } | | | j o
| } q | d } q W| i | | d S( 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.
i i N( t Nonet lent insert( t at xt lot hit mid( ( s" /usr/local/lib/python2.5/bisect.pyt insort_right s
c C si | d j o t | } n xE | | j o7 | | d } | | | j o
| } 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.
i i N( R R ( R R R R R ( ( s" /usr/local/lib/python2.5/bisect.pyt bisect_right s
c C sy | d j o t | } n xE | | j o7 | | d } | | | j o | d } q | } q W| i | | d S( 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.
i i N( R R R ( R R R R R ( ( s" /usr/local/lib/python2.5/bisect.pyt insort_left+ s
c C si | d j o t | } n xE | | j o7 | | d } | | | j o | 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.
i i N( R R ( R R R R R ( ( s" /usr/local/lib/python2.5/bisect.pyt bisect_left= s
i˙˙˙˙( R R R
R t insortt bisectN(
t __doc__R R R R R
R
R t _bisectt ImportError( ( ( s" /usr/local/lib/python2.5/bisect.pys <module> s 2