;ò ìŒü?c@sRdZded„ZeZded„ZeZded„Zded„ZdS(sBisection algorithms.icCsy|tjot|ƒ}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(shisNoneslensaslosmidsxsinsert(sasxsloshismid((s#/mit/python/lib/python2.3/bisect.pys insort_rights   cCsm|tjot|ƒ}nxE||jo7||d}|||jo |}q |d}q W|SdS(srReturn 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, i points just beyond the rightmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. iiN(shisNoneslensaslosmidsx(sasxsloshismid((s#/mit/python/lib/python2.3/bisect.pys bisect_rights    cCsy|tjot|ƒ}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(shisNoneslensaslosmidsxsinsert(sasxsloshismid((s#/mit/python/lib/python2.3/bisect.pys insort_left+s   cCsm|tjot|ƒ}nxE||jo7||d}|||jo|d}q |}q W|SdS(sqReturn 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, i points 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(shisNoneslensaslosmidsx(sasxsloshismid((s#/mit/python/lib/python2.3/bisect.pys bisect_left=s    N(s__doc__sNones insort_rightsinsorts bisect_rightsbisects insort_lefts bisect_left(s insort_rightsbisects bisect_leftsinsorts insort_lefts bisect_right((s#/mit/python/lib/python2.3/bisect.pys?s