Ë
|
¶^ij ã ó d Z ddlZddlmZmZ dee deedf fdZded edefd
|
Zd edeeef fd Zd edeedf de fdZ
|
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)).
|
é N)ÚListÚTupleÚlist_Úreturn.c ó t | « }g }d}t t |« « D ]V }|dz t |« k r|| ||dz dz
|
k( r&||dz |dz }|j t |d |d dz « « |}X t |« S )a 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.
|
éÿÿÿÿé r )ÚsortedÚrangeÚlenÚappendÚ _encode_rangeÚtuple)r Ú sorted_listÚrangesÚ
|
last_writeÚiÚ current_ranges õa H:\项ç®\archive\æµè¯ç»\èæ¬\Change_password\venv_build\Lib\site-packages\idna/intranges.pyÚintranges_from_listr s¥ ô -KØ FØJÜ 3{Ó#Ó $ò Ø q53{Ó#Ò #Ø1~ ¨Q°©UÑ!3°aÑ!7Ò7ØØ# J°¡N°Q¸±UÐ; Ø m M°!Ñ$4°mÀBÑ6GÈ!Ñ6KÓLÔMØ
|
ð ô =Ðó ÚstartÚendc ó | dz |z S )Né © )r r s r r r " s Ø RK3Ñ Ð r Úrc ó | dz | dz fS )Nr l ÿÿ r )r s r Ú _decode_ranger & s Ø GqMÑ*Ð +Ð+r Úint_r c óÞ t | d« }t j ||« }|dkD r!t ||dz
|
« \ }}|| cxk r|k ry |t |« k rt || « \ }}|| k( ryy)z=Determine if `int_` falls into one of the ranges in `ranges`.r r TF)r ÚbisectÚ bisect_leftr r )r r Útuple_ÚposÚleftÚrightÚ_s r Úintranges_containr) * s ä 4 Ó #FÜ
|
×
|
Ñ
|
V VÓ
|
,Cð QwÜ# F¨3°©7¡OÓ4 eØ 4Ô %Ò Øð ð S[ÒÜ s¡ Ó,aØ 4<ØØ r ) Ú__doc__r" Útypingr r Úintr r r Úboolr) r r r ú<module>r. s ðñó ß ðt Cyð ¨U°3¸°8©_ó ð, ð 3ð ¨3ó ð,Sð ,U 3¨ 8_ó ,ðC𠨨s°C¨x© ð ¸Tô r
|
