Edit File: bisect.cpython-37.opt-1.pyc
B ����q}�c� ������������������@���sZ���d�Z�ddd�Zd dd�Zddd�Zdd d �ZyddlT�W�n�ek rL���Y�nX�eZeZdS�)zBisection algorithms.�����Nc�������������C���sd���|dk�rt�d��|dkr t|��}x2||k�rR||�d�}||�|�k�rH|}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. r���zlo must be non-negativeN��������)� ValueError�len�insert)�a�x�lo�hi�mid��r����+/opt/alt/python37/lib64/python3.7/bisect.py�insort_right���s���� �r���c�������������C���sX���|dk�rt�d��|dkr t|��}x2||k�rR||�d�}||�|�k�rH|}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. r���zlo must be non-negativeNr���r���)r���r���)r���r���r ���r ���r���r���r���r ����bisect_right���s���� �r���c�������������C���sd���|dk�rt�d��|dkr t|��}x2||k�rR||�d�}|�|�|k�rL|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. r���zlo must be non-negativeNr���r���)r���r���r���)r���r���r ���r ���r���r���r���r ����insort_left+���s���� � r���c�������������C���sX���|dk�rt�d��|dkr t|��}x2||k�rR||�d�}|�|�|k�rL|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. r���zlo must be non-negativeNr���r���)r���r���)r���r���r ���r ���r���r���r���r ����bisect_left?���s���� � r���)�*)r���N)r���N)r���N)r���N) �__doc__r���r���r���r���Z_bisect�ImportErrorZbisectZinsortr���r���r���r ����<module>���s���