֦i_
j d Z d dddZd dddZd dddZd dddZ ddl eZeZy# e$ r Y w xY w)
zBisection algorithms. Nkeyc 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_rightinsertaxlohir s /usr/lib64/python3.12/bisect.py insort_rightr s< {
!QB
'
!SVR
5HHRO 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
ValueErrorlenr r
r r r mids r
r r s
Av233 z
V {2g7q.C1S6z1W 2g I
2g7q.C3qv;1W 2g 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< {
Ar2
&
CFB
4HHROr 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
Av233 z
V {2g7q.Cvz1W 2g I
2g7q.C1S6{Q1W 2g Ir )*)r N) __doc__r r r r _bisect ImportErrorbisectinsort r r
r$ sb T "!T !HD "!D !J
s * 22