łň ž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.pyt insort_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.pyt bisect_left=s  i˙˙˙˙(R R R RtinsorttbisectN( t__doc__RRR R R R R t_bisectt ImportError(((s/sys/lib/python/bisect.pyss2