Files
intellecton/venv/lib/python3.12/site-packages/idna/__pycache__/intranges.cpython-312.pyc
T

23 lines
2.5 KiB
Plaintext
Raw Normal View History

Ë
j;ãó|dZddlZdeedeedffdZdededefd „Zd
edeeeffd Zd ed
eedfdefdZ y)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)).
élist_Úreturn.cót|«}g}d}tt|««D]V}|dzt|«kr||||dzdz
k(rŒ&||dz|dz}|jt |d|ddz««|}ŒXt |«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Ú
current_ranges úQ/home/antigravity/intellecton/venv/lib/python3.12/site-packages/idna/intranges.pyÚintranges_from_listr ô˜“-€KØ
€FØ€JÜ
”3
ˆØ ˆq‰5”3 °A©¸+ÀaÈ!ÁeÑ:LÈqÑ:PÒ(PØ Ø# ¡N°Q¸±UÐ
Ø