a
lj @ s@ d Z ddlZddlmZmZ dd Zdd Zdd Zd
d ZdS ) 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)ListTuplec C s t | }g }d}tt|D ]b}|d t|k rJ|| ||d d krJq ||d |d }|t|d |d d |}q t|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)Zlist_Z sorted_listrangesZ
last_writeiZ
current_range r >/usr/lib/python3.9/site-packages/pip/_vendor/idna/intranges.pyintranges_from_list s r c C s | d> |B S )N r )startendr r r r
! s r
c C s | d? | d@ fS )Nr l r )rr r r
_decode_range% s r c C sz t | d}t||}|dkrNt||d \}}|| krF|k rNn ndS |t|k rvt|| \}}|| krvdS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r
bisectZ bisect_leftr r )Zint_r Ztuple_posleftright_r r r intranges_contain* s
r ) __doc__r typingr r r r
r r r r r r s