o

�T�j?�@spdZd
dd�
dd�Z
d
dd�
dd�Zd
dd�
dd	�Zd
dd�
d
d�Zzd
dlTWn	ey1


Yn
weZe
ZdS)zBisection algorithms.�N�
�keyc
C�>|d
urt||
||�}nt|||
�
|||d�}|�
||
�
d
S)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_rights

rc
Cs�|d
krtd�
�
|durt
|�
}|dur1||kr/||d}|
||kr'|}n|d}||ks|S||krN||d}|
|||�
krF|}n|d}||ks5|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�rr	r
rr�midrrr
rs&






�
�


�rc
Cr)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_leftrrrrr
�insort_left5s	

rc
Cs�|d
krtd�
�
|durt
|�
}|dur1||kr/||d}|||
kr)|d}n|}||ks|S||krN||d}|||�
|
krH|d}n|}||ks5|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
rNrrrrrrr
rDs&







�
�



�r)
�
*)r
N)	�__doc__rrrr�_bisect�ImportError�bisect�insortrrrr
�<module>
s"#


�