AnonSec Shell
Server IP : 209.38.156.173  /  Your IP : 216.73.216.122   [ Reverse IP ]
Web Server : Apache/2.4.52 (Ubuntu)
System : Linux lakekumayuhotel 5.15.0-136-generic #147-Ubuntu SMP Sat Mar 15 15:53:30 UTC 2025 x86_64
User : root ( 0)
PHP Version : 8.1.2-1ubuntu2.22
Disable Function : NONE
Domains : 2 Domains
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : ON  |  Pkexec : ON
Directory :  /usr/lib/python3/dist-packages/idna/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ HOME ]     [ BACKUP SHELL ]     [ JUMPING ]     [ MASS DEFACE ]     [ SCAN ROOT ]     [ SYMLINK ]     

Current File : /usr/lib/python3/dist-packages/idna/__pycache__/intranges.cpython-310.pyc
o

��YaY�@s�dZddlZddlmZmZdeedeedffdd�Zd	ed
edefdd�Zd
edeeeffdd�Zdedeedfde	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.cCs�t|�}g}d}tt|��D]1}|dt|�kr%||||ddkr%q||d|d�}|�t|d|dd��|}qt|�S)aRepresent 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_listsr�start�endcCs|d>|BS)N� r)rrrrrr sr�rcCs|d?|d@fS)Nrl��r)rrrr�
_decode_range#sr�int_rcCsvt|d�}t�||�}|dkr%t||d�\}}||kr$|kr%dS|t|�kr9t||�\}}||kr9dSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r�bisect�bisect_leftrr
)rr�tuple_�pos�left�right�_rrr�intranges_contain's
�r#)�__doc__r�typingrr�intrrr�boolr#rrrr�<module>s"

Anon7 - 2022
AnonSec Team