45 lines
3.6 KiB
Plaintext
45 lines
3.6 KiB
Plaintext
|
Ë
|
|||
|
|
*åfÕ
|
|||
|
|
ã ój — d Z d ddœd„Zd ddœd„Zd ddœd„Zd ddœd„Z ddl eZeZy# e$ r Y Œ w xY w)
|
|||
|
|
zBisection algorithms.é N©Úkeyc ó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_rightÚinsert©ÚaÚxÚloÚhir s úBC:\Users\RCi\AppData\Local\Programs\Python\Python312\Lib\bisect.pyÚ insort_rightr s< € ð €{Ü
|
|||
|
|
˜!˜Q BÓ
|
|||
|
|
'‰ä
|
|||
|
|
˜!™S ›V R¨°Ô
|
|||
|
|
5ˆØ‡H�HˆR�…Oó 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é é ©Ú
|
|||
|
|
ValueErrorÚlen©r r
|
|||
|
|
r r r Úmids r
|
|||
|
|
r r s¬ € ð
|
|||
|
|
ˆA‚vÜÐ2Ó3Ð3Ø €zÜ
|
|||
|
|
�‹Vˆð €{Ø�2Šgؘ‘7˜q‘.ˆCØ�1�S‘6ŠzØ‘à˜1‘W�ð �2‹gð €Ið
|
|||
|
|
�2Šgؘ‘7˜q‘.ˆCØ‘3�q˜‘v“;ŠØ‘à˜1‘W�ð �2‹gð €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< € ð €{Ü
|
|||
|
|
˜˜A˜r 2Ó
|
|||
|
|
&‰ä
|
|||
|
|
˜™C ›F B¨°Ô
|
|||
|
|
4ˆØ‡H�HˆR�…Or 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.
|