Current Path: > > usr > lib > python2.7 > site-packages > pip > _vendor > > > idna
Operation : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64 Software : Apache Server IP : 162.0.232.56 | Your IP: 216.73.216.111 Domains : 1034 Domain(s) Permission : [ 0755 ]
Name | Type | Size | Last Modified | Actions |
---|---|---|---|---|
__init__.py | File | 58 bytes | April 21 2022 18:08:21. | |
__init__.pyc | File | 244 bytes | April 21 2022 18:08:34. | |
__init__.pyo | File | 244 bytes | April 21 2022 18:08:34. | |
codec.py | File | 3299 bytes | April 21 2022 18:08:21. | |
codec.pyc | File | 3969 bytes | April 21 2022 18:08:34. | |
codec.pyo | File | 3969 bytes | April 21 2022 18:08:34. | |
compat.py | File | 232 bytes | April 21 2022 18:08:21. | |
compat.pyc | File | 811 bytes | April 21 2022 18:08:34. | |
compat.pyo | File | 811 bytes | April 21 2022 18:08:34. | |
core.py | File | 11390 bytes | April 21 2022 18:08:21. | |
core.pyc | File | 11773 bytes | April 21 2022 18:08:34. | |
core.pyo | File | 11773 bytes | April 21 2022 18:08:34. | |
idnadata.py | File | 32999 bytes | April 21 2022 18:08:21. | |
idnadata.pyc | File | 28555 bytes | April 21 2022 18:08:34. | |
idnadata.pyo | File | 28555 bytes | April 21 2022 18:08:34. | |
intranges.py | File | 1749 bytes | April 21 2022 18:08:21. | |
intranges.pyc | File | 2217 bytes | April 21 2022 18:08:34. | |
intranges.pyo | File | 2217 bytes | April 21 2022 18:08:34. | |
package_data.py | File | 21 bytes | April 21 2022 18:08:21. | |
package_data.pyc | File | 182 bytes | April 21 2022 18:08:34. | |
package_data.pyo | File | 182 bytes | April 21 2022 18:08:34. | |
uts46data.py | File | 184944 bytes | April 21 2022 18:08:21. | |
uts46data.pyc | File | 273551 bytes | April 21 2022 18:08:34. | |
uts46data.pyo | File | 273551 bytes | April 21 2022 18:08:34. |
� ��abc @ s: d Z d d l Z d � Z d � Z d � Z d � Z d S( s 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)). i����Nc C s� t | � } g } d } x� t t | � � D]~ } | d t | � k rl | | | | d d k rl q+ ql n | | d | d !} | j t | d | d d � � | } q+ Wt | � S( s 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. i����i i ( t sortedt ranget lent appendt _encode_ranget tuple( t list_t sorted_listt rangest last_writet it current_range( ( s>