%PDF- %PDF-
Direktori : /usr/local/lib/python2.7/ |
Current File : //usr/local/lib/python2.7/bisect.pyo |
ó Mêáac @ st d Z d d d „ Z e Z d d d „ Z e Z d d d „ Z d d d „ Z y d d l TWn e k ro n Xd S( s Bisection algorithms.i c 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( 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 s lo must be non-negativei i N( t ValueErrort Nonet lent insert( t at xt lot hit mid( ( s"