grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026+ [} ɌARtRRR/RlltRRR/RlltRRR/RlltRRR/Rllt^RI5]t]tR# ]dLi;i) zBisection algorithms.NkeycrVf\WW#4pM\W!V4W#VR7pVPW!4R#)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/python314/lib64/python3.14/bisect.py insort_rightr s4 { ! ' !SVR 5HHROc$V^8d \R4hVf \V4pVf5W#8d,W#,^,pWV,8dTpK&V^,pK1V#W#8d1W#,^,pW!W,48dTpK+V^,pK6V#)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. lo must be non-negative ValueErrorlenrr r r rmids&&&&$ r rrs Av233 z V {g7q.CS6z1W  I g7q.C3qv;1W IrcrVf\WW#4pM\W!V4W#VR7pVPW!4R#)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 4HHROrc&V^8d \R4hVf \V4pVf5W#8d,W#,^,pW,V8d V^,pK-TpK1V#W#8d2W#,^,pV!W,4V8d V^,pK3TpK7V#)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. rrrs&&&&$ r rrJs Av233 z V {g7q.Cvz1W  I g7q.C16{Q1W Ir)*)N) __doc__r rrr_bisect ImportErrorbisectinsortrr r"sbT"!T!HD"!D!J      s 3==