�

s�h_
��|�SrS	SS.
Sjj
r
S	SS.
Sjj
rS	SS.
Sjj
rS	SS.
Sjj
rS
SK7 \r\
rg!\a N
f=f
)
zBisection algorithms.�N�
�keyc
�h�Uc
[
X
X#5nO[
X"U
5
X#US9nURX!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�hirs     �-/opt/alt/python313/lib64/python3.13/bisect.py�insort_rightrs4���{�
�!��
'��
�!�S��V�R��
5���H�H�R�O�c
���US
:a[
S5
e
Uc[U5
nUc%X#:aX#-S-nXU:aUnOUS-nX#:aMU$X#:a#X#-S-nX"X5
:aUnOUS-nX#:aM#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
rrr�mids      r
rrs���
�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��Irc
�h�Uc
[
X
X#5nO[
X"U
5
X#US9nURX!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_leftrrs     r
�insort_leftr9s4���{�
��r�
&��
��C�
�F�B��
4���H�H�R�Orc
���US
:a[
S5
e
Uc[U5
nUc%X#:aX#-S-nXU
:aUS-nOUnX#:aMU$X#:a$X#-S-nU"X5
U
:aUS-nOUnX#:aM$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.
rrrrrrs      r
rrJs���
�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)
�
*)rN)	�__doc__rrrr�_bisect�ImportError�bisect�insort�rr
�<module>r$
sb�


��
�T�
�"!
�T�!
�H

�D�
�"!
�D�!
�J

	��

��	����

	��

	�s�2�;�
;