/usr/lib/python3/dist-packages/idna/__pycache__
Edit: /usr/lib/python3/dist-packages/idna/__pycache__/intranges.cpython-310.pyc (1936B)
o
’ÍYaY ã @ sŒ d Z ddlZddlmZmZ dee deedf fdd„Zd ed
edefd d „Zd
edeeef fdd„Zdedeedf de fdd„Z
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)ÚListÚTupleÚlist_Úreturn.c C sˆ t | ƒ}g }d}tt|ƒƒD ]1}|d t|ƒk r%|| ||d d kr%q||d |d … }| t|d |d d ƒ¡ |}qt|ƒ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)r Ú sorted_listÚrangesÚ
last_writeÚiÚ
current_range© r ú0/usr/lib/python3/dist-packages/idna/intranges.pyÚintranges_from_list s r ÚstartÚendc C s | d> |B S )Né r )r r r r r r s r Úrc C s | d? | d@ fS )Nr l ÿÿ r )r r r r Ú
_decode_range# s r Úint_r c C sv t | dƒ}t ||¡}|dkr%t||d ƒ\}}|| kr$|k r%dS |t|ƒk r9t|| ƒ\}}|| kr9dS dS )z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r ÚbisectÚ bisect_leftr r
)r r Útuple_ÚposÚleftÚrightÚ_r r r Úintranges_contain' s
ÿ r# ) Ú__doc__r Útypingr r Úintr r r Úboolr# r r r r Ú
s "