One Hat Cyber Team
Your IP :
10.30.1.1
Server IP :
103.148.201.5
Server :
Linux web-olt 5.15.0-156-generic #166-Ubuntu SMP Sat Aug 9 00:02:46 UTC 2025 x86_64
Server Software :
Apache/2.4.52 (Ubuntu)
PHP Version :
8.1.29
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3
/
dist-packages
/
idna
/
__pycache__
/
View File Name :
intranges.cpython-310.pyc
o ��YaY � @ s� d Z ddlZddlmZmZ dee deedf fdd�Zd ed edefdd�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>