Mini Kabibi Habibi
+
��h�
� � � R t RRR/R lltRRR/R lltRRR/R lltRRR/R llt ^ RI5 ]t]tR# ] d Li ; i) zBisection algorithms.N�keyc �r � Vf \ WW#4 pM\ W! V4 W#VR7 pV P W!4 R# )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.
N�r )� bisect_right�insert��a�x�lo�hir s &&&&$�BC:\Users\ITO\AppData\Local\Programs\Python\Python314\Lib\bisect.py� insort_rightr
s4 � � �{�
�!��
'��
�!�S��V�R��
5���H�H�R�O� c �$ � V^ 8 d \ R4 hVf \ V 4 pVf5 W#8 d, W#, ^, pWV, 8 d TpK& V^, pK1 V# W#8 d1 W#, ^, pW! W, 4 8 d TpK+ V^, pK6 V# )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.
�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�� � �I�
�g��7�q�.�C��3�q�v�;�����1�W��
�Ir c �r � Vf \ WW#4 pM\ W! V4 W#VR7 pV P W!4 R# )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 �& � V^ 8 d \ R4 hVf \ V 4 pVf5 W#8 d, W#, ^, pW, V8 d V^, pK- TpK1 V# W#8 d2 W#, ^, pV! W, 4 V8 d V^, pK3 TpK7 V# )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 s &&&&$ r r r J s� � �
�A�v��2�3�3� �z�
��V�� �{��g��7�q�.�C��v��z��1�W���� � �I�
�g��7�q�.�C��1�6�{�Q���1�W����
�Ir )�*)� N) �__doc__r
r r r �_bisect� ImportError�bisect�insort� r r �<module>r" sb �� ��T� �"!�T� !�H�D� �"!�D� !�J ��
�� ��� � �� �s �3 �=�=