Gecko [ primetaxinc.net ]

Name	Size	Permission
__init__.py	58 B	-rw-r--r--
__init__.pyc	244 B	-rw-r--r--
__init__.pyo	244 B	-rw-r--r--
codec.py	3.22 KB	-rw-r--r--
codec.pyc	3.88 KB	-rw-r--r--
codec.pyo	3.88 KB	-rw-r--r--
compat.py	232 B	-rw-r--r--
compat.pyc	811 B	-rw-r--r--
compat.pyo	811 B	-rw-r--r--
core.py	11.12 KB	-rw-r--r--
core.pyc	11.5 KB	-rw-r--r--
core.pyo	11.5 KB	-rw-r--r--
idnadata.py	32.23 KB	-rw-r--r--
idnadata.pyc	27.89 KB	-rw-r--r--
idnadata.pyo	27.89 KB	-rw-r--r--
intranges.py	1.71 KB	-rw-r--r--
intranges.pyc	2.17 KB	-rw-r--r--
intranges.pyo	2.17 KB	-rw-r--r--
package_data.py	21 B	-rw-r--r--
package_data.pyc	182 B	-rw-r--r--
package_data.pyo	182 B	-rw-r--r--
uts46data.py	180.61 KB	-rw-r--r--
uts46data.pyc	267.14 KB	-rw-r--r--
uts46data.pyo	267.14 KB	-rw-r--r--

Code Editor : intranges.pyo

�
��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>���/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyt���intranges_from_list
���s����	"
c���������C���s���|��d�>|�BS(���Ni ���(����(���t���startt���end(����(����s>���/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyR������s����c���������C���s���|��d�?|��d�@f�S(���Ni ���i���I�������I��������(����(���t���r(����(����s>���/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyt
���_decode_range"���s����c���������C���s����t��|��d���}�t�j�|�|���}�|�d�k�rj�t�|�|�d���\�}�}�|�|��k�o^�|�k��n�rj�t�Sn��|�t�|���k��r��t�|�|���\�}�}�|�|��k�r��t�Sn��t�S(���s=���Determine if `int_` falls into one of the ranges in `ranges`.i����i���(���R���t���bisectt���bisect_leftR���t���TrueR���t���False(���t���int_R���t���tuple_t���post���leftt���rightt���_(����(����s>���/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyt���intranges_contain&���s����(���t���__doc__R���R���R���R���R���(����(����(����s>���/usr/lib/python2.7/site-packages/pip/_vendor/idna/intranges.pyt���<module>���s
���

${this.title}

Code Editor : intranges.pyo