|
Server : LiteSpeed System : Linux server51.dnsbootclub.com 4.18.0-553.62.1.lve.el8.x86_64 #1 SMP Mon Jul 21 17:50:35 UTC 2025 x86_64 User : nandedex ( 1060) PHP Version : 8.1.33 Disable Function : NONE Directory : /opt/cppython/lib/python3.8/site-packages/idna/__pycache__/ |
U
O��gj � @ s� d Z ddlZddlmZmZ ee eedf d�dd�Zeeed�d d
�Zeeeef d�dd
�Zeeedf e d�dd�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_�returnc C s� t | �}g }d}tt|��D ]b}|d t|�k rJ|| ||d d krJq||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 �;/opt/cppython/lib/python3.8/site-packages/idna/intranges.py�intranges_from_list s r )�start�endr c C s | d>