Hacked By AnonymousFox
�
�Q�f_
� �j � d Z d dd�d�Zd dd�d�Zd dd�d�Zd dd�d�Z ddl� eZeZy# e$ r Y � w xY w)
zBisection algorithms.� N��keyc �v � |�t | |||� }nt | ||� |||�� }| j ||� y)a7 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.
A custom key function can be supplied to customize the sort order.
Nr )� bisect_right�insert��a�x�lo�hir s �-/opt/alt/python312/lib64/python3.12/bisect.py� insort_rightr s< � � �{�
�!�Q��B�
'��
�!�S��V�R���
5���H�H�R��O� c �� � |dk r t d� �|� t | � }|�%||k r ||z dz }|| | k r|}n|dz }||k r� |S ||k r$||z dz }| || | � k r|}n|dz }||k r�$|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.
A custom key function can be supplied to customize the sort order.
r �lo must be non-negative� � ��
ValueError�len�r r
r r r �mids r
r r s� � �
�A�v��2�3�3� �z�
��V�� �{��2�g���7�q�.�C��1�S�6�z����1�W�� �2�g� �I�
�2�g���7�q�.�C��3�q��v�;�����1�W�� �2�g� �Ir c �v � |�t | |||� }nt | ||� |||�� }| j ||� y)a5 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.
A custom key function can be supplied to customize the sort order.
Nr )� bisect_leftr r s r
� insort_leftr 9 s< � � �{�
��A�r�2�
&��
��C��F�B���
4���H�H�R��Or c �� � |dk r t d� �|� t | � }|�%||k r ||z dz }| | |k r|dz }n|}||k r� |S ||k r$||z dz } || | � |k r|dz }n|}||k r�$|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.
A custom key function can be supplied to customize the sort order.
r r r r r r s r
r r J s� � �
�A�v��2�3�3� �z�
��V�� �{��2�g���7�q�.�C���v��z��1�W���� �2�g� �I�
�2�g���7�q�.�C��1�S�6�{�Q���1�W���� �2�g� �Ir )�*)r N) �__doc__r r r r �_bisect� ImportError�bisect�insort� r r
�<module>r$ sb �� ��T� �"!�T� !�H�D� �"!�D� !�J ��
�� ��� � �� �s �* �2�2
Hacked By AnonymousFox1.0, Coded By AnonymousFox