403Webshell
Server IP : 3.96.16.70  /  Your IP : 216.73.216.15
Web Server : Apache
System : Linux ip-172-31-26-103.ca-central-1.compute.internal 6.1.163-186.299.amzn2023.x86_64 #1 SMP PREEMPT_DYNAMIC Tue Feb 24 16:35:42 UTC 2026 x86_64
User : ec2-user ( 1000)
PHP Version : 8.4.18
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : ON  |  Pkexec : OFF
Directory :  /lib/python3.9/site-packages/idna/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /lib/python3.9/site-packages/idna/__pycache__/intranges.cpython-39.pyc
a

�R�]��@s0dZddlZdd�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)).
�NcCs�t|�}g}d}tt|��D]b}|dt|�krJ||||ddkrJq||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)Zlist_Zsorted_list�rangesZ
last_write�iZ
current_range�r�2/usr/lib/python3.9/site-packages/idna/intranges.py�intranges_from_list
srcCs|d>|BS)N� r)�start�endrrr
rsrcCs|d?|d@fS)Nrl��r)�rrrr
�
_decode_range"srcCszt|d�}t�||�}|dkrNt||d�\}}||krF|krNnndS|t|�krvt||�\}}||krvdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r�bisectZbisect_leftrr)Zint_r
Ztuple_�pos�left�right�_rrr
�intranges_contain&s
r)�__doc__rrrrrrrrr
�<module>s


Youez - 2016 - github.com/yon3zu
LinuXploit