Linux webserver 6.8.0-49-generic #49~22.04.1-Ubuntu SMP PREEMPT_DYNAMIC Wed Nov 6 17:42:15 UTC 2 x86_64
Apache/2.4.52 (Ubuntu)
Server IP : 192.168.1.1 & Your IP : 13.58.157.160
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
lib /
python3 /
dist-packages /
idna /
__pycache__ /
Delete
Unzip
Name
Size
Permission
Date
Action
__init__.cpython-310.pyc
799
B
-rw-r--r--
2024-05-23 06:10
codec.cpython-310.pyc
2.71
KB
-rw-r--r--
2024-05-23 06:10
compat.cpython-310.pyc
699
B
-rw-r--r--
2024-05-23 06:10
core.cpython-310.pyc
9.17
KB
-rw-r--r--
2024-05-23 06:10
idnadata.cpython-310.pyc
184.59
KB
-rw-r--r--
2024-05-23 06:10
intranges.cpython-310.pyc
1.89
KB
-rw-r--r--
2024-05-23 06:10
package_data.cpython-310.pyc
163
B
-rw-r--r--
2024-05-23 06:10
uts46data.cpython-310.pyc
147.36
KB
-rw-r--r--
2024-05-23 06:10
Save
Rename
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>