a
ÌRì]Õ ã @ 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)Zlist_Z sorted_listÚrangesZ
last_writeÚiZ
current_range© r ú2/usr/lib/python3.9/site-packages/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 ÚbisectZ bisect_leftr r )Zint_r
Ztuple_ÚposÚleftÚrightÚ_r r r
Úintranges_contain& s
r )Ú__doc__r r r r r r r r r
Ú s