0x1949 Team - FAZEMRX - MANAGER
Edit File: bisect.cpython-310.pyc
o ��+g? � @ sp d Z d dd�dd�Zd dd�dd�Zd dd�dd �Zd dd�d d �Zzdd lT W n ey1 Y nw eZeZdS )zBisection algorithms.� N��keyc C �> |du r t | |||�}n t | ||�|||d�}| �||� 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. Nr )� bisect_right�insert��a�x�lo�hir � r � /usr/lib/python3.10/bisect.py� insort_right s r c C s� |dk rt d��|du rt| �}|du r1||k r/|| d }|| | k r'|}n|d }||k s|S ||k rN|| d }||| | �k rF|}n|d }||k s5|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(i, 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 �lo must be non-negativeN� � �� ValueError�len�r r r r r �midr r r r s& � � �r c C r )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. Nr )� bisect_leftr r r r r � insort_left5 s r c C s� |dk rt d��|du rt| �}|du r1||k r/|| d }| | |k r)|d }n|}||k s|S ||k rN|| d }|| | �|k rH|d }n|}||k s5|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(i, 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 r Nr r r r r r r r D s& � � �r )�*)r N) �__doc__r r r r �_bisect� ImportError�bisect�insortr r r r �<module> s "# �