grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026 -߁|SrS SS.SjjrS SS.SjjrS SS.SjjrS SS.SjjrSSK7 \r\rg!\a N f=f) zBisection algorithms.NkeychUc [XX#5nO[X"U5X#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_rightinsertaxlohirs -/opt/alt/python313/lib64/python3.13/bisect.py insort_rightrs4 { ! ' !SVR 5HHROcUS:a [S5eUc [U5nUc%X#:aX#-S-nXU:aUnOUS-nX#:aMU$X#:a#X#-S-nX"X5:aUnOUS-nX#:aM#U$)aReturn 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. rlo must be non-negative ValueErrorlenr r r r rmids r rrs Av233 z V {g7q.CS6z1W g I g7q.C3qv;1W g IrchUc [XX#5nO[X"U5X#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 & CFB 4HHROrcUS:a [S5eUc [U5nUc%X#:aX#-S-nXU:aUS-nOUnX#:aMU$X#:a$X#-S-nU"X5U:aUS-nOUnX#:aM$U$)aReturn 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 Av233 z V {g7q.Cvz1W g I g7q.C16{Q1W g Ir)*)rN) __doc__rrrr_bisect ImportErrorbisectinsortrr r$sbT"!T!HD"!D!J      s 2;;