; Ιβ"Ic @s›dZddd„ZeZddd„ZeZddd„Zddd„Zy2ddlmZmZmZmZmZmZWne k oYnXdS(uBisection algorithms.icCs–|dkotdƒ‚n|dkot|ƒ}nxE||ko7||d}|||ko |}q=|d}q=W|j||ƒdS(uο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. iulo must be non-negativeiiN(u ValueErroruNoneulenuinsert(uauxulouhiumid((u#/mit/python/lib/python3.0/bisect.pyu insort_rights    cCs†|dkotdƒ‚n|dkot|ƒ}nxE||ko7||d}|||ko |}q=|d}q=W|S(u€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. iulo must be non-negativeiiN(u ValueErroruNoneulen(uauxulouhiumid((u#/mit/python/lib/python3.0/bisect.pyu bisect_rights    cCs–|dkotdƒ‚n|dkot|ƒ}nxE||ko7||d}|||ko|d}q=|}q=W|j||ƒdS(uν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. iulo must be non-negativeiiN(u ValueErroruNoneulenuinsert(uauxulouhiumid((u#/mit/python/lib/python3.0/bisect.pyu insort_left/s    cCs†|dkotdƒ‚n|dkot|ƒ}nxE||ko7||d}|||ko|d}q=|}q=W|S(u€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. iulo must be non-negativeiiN(u ValueErroruNoneulen(uauxulouhiumid((u#/mit/python/lib/python3.0/bisect.pyu bisect_leftCs    (u bisect_rightu bisect_leftu insort_leftu insort_rightuinsortubisectN( u__doc__uNoneu insort_rightuinsortu bisect_rightubisectu insort_leftu bisect_leftu_bisectu ImportError(((u#/mit/python/lib/python3.0/bisect.pyus2