U
|
H=®dÕ ã @ s0 d Z ddlZdd 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)).
|
é Nc 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 )ÚsortedÚrangeÚlenÚappendÚ _encode_rangeÚtuple)Úlist_Ú sorted_listÚrangesÚ
|
last_writeÚiÚ current_range© r úQD:\z\workplace\VsCode\pyvenv\venv\Lib\site-packages\pip/_vendor/idna/intranges.pyÚintranges_from_list
|
s r c C s | d> |B S )Né r )ÚstartÚendr 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 ÚbisectÚ bisect_leftr r )Úint_r Útuple_ÚposÚleftÚrightÚ_r r r Úintranges_contain& s
|
r )Ú__doc__r r r r r r r r r Ú<module> s
|
|
