B \ Çcý ã@sZdZd dd„Zd dd„Zddd„Zdd d „Zy dd lTWnek rLYnXeZeZdS)zBisection algorithms.éNcCsd|dkrtdƒ‚|dkr t|ƒ}x2||krR||d}|||krH|}q"|d}q"W| ||¡dS)zï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. rzlo must be non-negativeNéé)Ú ValueErrorÚlenÚinsert)ÚaÚxÚloÚhiÚmid©r úlib/python3.7/bisect.pyÚ insort_rights     rcCsX|dkrtdƒ‚|dkr t|ƒ}x2||krR||d}|||krH|}q"|d}q"W|S)a€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. rzlo must be non-negativeNrr)rr)rrr r r r r r Ú bisect_rights     rcCsd|dkrtdƒ‚|dkr t|ƒ}x2||krR||d}|||krL|d}q"|}q"W| ||¡dS)zí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. rzlo must be non-negativeNrr)rrr)rrr r r r r r Ú insort_left+s    rcCsX|dkrtdƒ‚|dkr t|ƒ}x2||krR||d}|||krL|d}q"|}q"W|S)a€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. rzlo must be non-negativeNrr)rr)rrr r r r r r Ú bisect_left?s    r)Ú*)rN)rN)rN)rN) Ú__doc__rrrrZ_bisectÚ ImportErrorZbisectZinsortr r r r Ús