\Yy d Z ddlZddlmZmZ dee deedf fdZded edefd
Zd edeeef fd Zd
edeedf de fdZ
dS )a
Given a list of integers, made up of (hopefully) a small number of long runs
of consecutive integers, compute a representation of the form
((start1, end1), (start2, end2) ...). Then answer the question "was x present
in the original list?" in time O(log(# runs)).
N)ListTuplelist_return.c j t | }g }d}t t | D ]u}|dz t | k r|| ||dz dz
k r1||dz |dz }| t |d |d dz |}vt | S )a Represent a list of integers as a sequence of ranges:
((start_0, end_0), (start_1, end_1), ...), such that the original
integers are exactly those x such that start_i <= x < end_i for some i.
Ranges are encoded as single integers (start << 32 | end), not as tuples.
r )sortedrangelenappend
_encode_rangetuple)r sorted_listranges
last_writei
current_ranges l/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/pip/_vendor/idna/intranges.pyintranges_from_listr s --K
FJ
3{##
$
$ q53{## # #1~QU!3a!777#JNQU$:;
mM!$4mB6G!6KLLMMM
== startendc | dz |z S )N )r r s r r r " s RK3 r rc | dz | dz fS )Nr l r )r s r
_decode_ranger & s
GqM* ++r int_r c t | d }t j || }|dk r-t ||dz
\ }}|| cxk r|k rn ndS |t | k r t || \ }}|| k rdS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r bisect bisect_leftr r )r r tuple_posleftright_s r intranges_containr) * s
4
#
#F
VV
,
,C Qww#F37O44 e 4 % 4
S[[ s ,,a 4<<4 5r ) __doc__r" typingr r intr r r boolr) r r r r. s
tCy U38_ , 3 3 ,S ,U38_ , , , ,C sCx T r