Ñò mÈKc@sšdZddd„ZeZddd„ZeZddd„Zddd„Zy2ddklZlZlZlZlZlZWne j onXdS( sBisection algorithms.icCs–|djotdƒ‚n|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. islo must be non-negativeiiN(t ValueErrortNonetlentinsert(tatxtlothitmid((s/usr/lib/python2.6/bisect.pyt insort_rights    cCs†|djotdƒ‚n|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. islo must be non-negativeiiN(RRR(RRRRR((s/usr/lib/python2.6/bisect.pyt bisect_rights    cCs–|djotdƒ‚n|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. islo must be non-negativeiiN(RRRR(RRRRR((s/usr/lib/python2.6/bisect.pyt insort_left/s    cCs†|djotdƒ‚n|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. islo must be non-negativeiiN(RRR(RRRRR((s/usr/lib/python2.6/bisect.pyt bisect_leftCs    iÿÿÿÿ(R R R R tinsorttbisectN( t__doc__RR R R RR R t_bisectt ImportError(((s/usr/lib/python2.6/bisect.pyts2