| System: Linux server378.web-hosting.com 4.18.0-553.80.1.lve.el8.x86_64 #1 SMP Wed Oct 22 19:29:36 UTC 2025 x86_64 Current Path : /opt/alt/python313/lib64/python3.13/__pycache__/ |
| Current File : //opt/alt/python313/lib64/python3.13/__pycache__/bisect.cpython-313.opt-1.pyc |
�
?,bi_
� �| � S r S SS.S jjrS SS.S jjrS SS.S jjrS SS.S jjr SSK7 \r\rg! \ a N
f = f)
zBisection algorithms.� N��keyc �h � Uc
[ XX#5 nO[ X" U5 X#US9nU R X!5 g)a# 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/python313/lib64/python3.13/bisect.py� insort_rightr s4 � � �{�
�!��
'��
�!�S��V�R��
5���H�H�R�O� c �� � US: a [ S5 eUc [ U 5 nUc% X#: a X#- S- nXU : a UnOUS- nX#: a M U$ X#: a# X#- S- nX" X 5 : a UnOUS- nX#: a M# U$ )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�� �{��g��7�q�.�C��S�6�z����1�W�� �g� �I�
�g��7�q�.�C��3�q�v�;�����1�W�� �g� �Ir c �h � Uc
[ XX#5 nO[ X" U5 X#US9nU R X!5 g)a! 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 s4 � � �{�
��r�
&��
��C��F�B��
4���H�H�R�Or c �� � US: a [ S5 eUc [ U 5 nUc% X#: a X#- S- nX U: a US- nOUnX#: a M U$ X#: a$ X#- S- nU" X 5 U: a US- nOUnX#: a M$ U$ )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�� �{��g��7�q�.�C��v��z��1�W���� �g� �I�
�g��7�q�.�C��1�6�{�Q���1�W���� �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 �;�;