Name	Size	Mode	Actions
codec.cpython-313.pyc	5282	0644	editdlrm
compat.cpython-313.pyc	868	0644	editdlrm
core.cpython-313.pyc	16926	0644	editdlrm
idnadata.cpython-313.pyc	100887	0644	editdlrm
intranges.cpython-313.pyc	2581	0644	editdlrm
package_data.cpython-313.pyc	189	0644	editdlrm
uts46data.cpython-313.pyc	161985	0644	editdlrm
__init__.cpython-313.pyc	858	0644	editdlrm

� ��ij���SrS
SK
r
S
SKJrJr S\\S\\S44SjrS\S \S\4S jrS\S\\\44SjrS \S\\S4S\ 4Sjr g)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
�
�[
U5
n
/nS
n[[U
5
5
HWnUS-[U
5
:aXXS-S- :XaM'XS-US-nUR[ USUS
S-55
UnMY [U5
$)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_ranges �@/opt/support/venv/lib/python3.13/site-packages/idna/intranges.py�intranges_from_listrs�����-�K� �F��J� �3�{�#� $�
��q�5�3�{�#�#��~���U�!3�a�!7�7��#��N�Q��U�;� �� � �m�M�!�$4�m�B�6G�!�6K�L�M�� � %���=���start�endc��US
-U
-$)N� �)rrs rrr"s���R�K�3��r�
rc
��US
- US-
4$)Nrl��r)
rs
r� _decode_ranger&s�� ��G�q�M�*�+�+r�int_rc���[
US
5n[R"X5nUS
:�a![XS- 5
upEX@s=::aU:ag U[ U
5
:a[X5
upFX@:Xa
gg)z=Determine if `int_` falls into one of the ranges in `ranges`.rr TF)r�bisect�bisect_leftrr)r r�tuple_�pos�left�right�
_s r�intranges_containr)*ss�� �4�� #�F� � � �V� ,�C��Q�w�#�F��7�O�4�����%��� ��S��[�����,����<��r)�__doc__r"�typingrr�intrrr�boolr)rrr�r.
s��


�
�
��
�t�C�y�
�U�3��8�_�
�,

��

�3�

�3�

�

,�S�

,�U�3��8�_�

,�
�C�
��s�C�x��
�T�
r