| Server IP : 77.50.203.18 / Your IP : 192.168.0.10 Web Server : Apache/2.4.62 (CentOS Stream) OpenSSL/3.5.7 mpm-itk/2.4.7-04 PHP/8.4.23 System : Linux web2 5.14.0-722.el9.x86_64 #1 SMP PREEMPT_DYNAMIC Mon Jul 6 09:07:51 UTC 2026 x86_64 User : warsnews.ru ( 1001) PHP Version : 8.4.23 Disable Function : NONE MySQL : ON | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : ON Directory : /usr/lib/python3.9/site-packages/idna/__pycache__/ |
Upload File : |
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 �� |}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)Zlist_Zsorted_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>