� e f# �@s�dZdddd�ZeZdddd�ZeZdddd�Zddd d �ZyddlTWnek r|YnXdS)zBisection algorithms.�NcCs�|dkrtd��n|dkr6t|�}nxA||kry||d}|||krl|}q9|d}q9W|j||�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�+/opt/alt/python34/lib64/python3.4/bisect.py�insort_rights rcCs~|dkrtd��n|dkr6t|�}nxA||kry||d}|||krl|}q9|d}q9W|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 rrrr �bisect_rights rcCs�|dkrtd��n|dkr6t|�}nxA||kry||d}|||krp|d}q9|}q9W|j||�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 rrrr �insort_left/s rcCs~|dkrtd��n|dkr6t|�}nxA||kry||d}|||krp|d}q9|}q9W|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 rrrr �bisect_leftCs r)�*) �__doc__rZinsortrZbisectrrZ_bisect�ImportErrorrrrr �s