Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.70.100.144
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3 /
dist-packages /
idna /
__pycache__ /
[ HOME SHELL ]
Name
Size
Permission
Action
__init__.cpython-310.pyc
799
B
-rw-r--r--
codec.cpython-310.pyc
2.71
KB
-rw-r--r--
compat.cpython-310.pyc
699
B
-rw-r--r--
core.cpython-310.pyc
9.17
KB
-rw-r--r--
idnadata.cpython-310.pyc
184.59
KB
-rw-r--r--
intranges.cpython-310.pyc
1.89
KB
-rw-r--r--
package_data.cpython-310.pyc
163
B
-rw-r--r--
uts46data.cpython-310.pyc
147.36
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : 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>