Files
wg-backend-django/acer-env/lib/python3.10/site-packages/idna/__pycache__/intranges.cpython-310.pyc

17 lines
1.9 KiB
Plaintext
Raw Normal View History

2022-11-30 15:58:16 +07:00
o
<00>ԄcY<00>@s<>dZddlZddlmZmZdeedeedffdd<08>Zd ed
edefd d <0C>Zd edeeeffdd<0F>Zdedeedfde fdd<13>Z
dS)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)).
<EFBFBD>N)<02>List<73>Tuple<6C>list_<74>return.cCs<>t|<00>}g}d}tt|<01><01>D]1}|dt|<01>kr%||||ddkr%q||d|d<00>}|<02>t|d|dd<00><02>|}qt|<02>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.
<20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>r)<06>sorted<65>range<67>len<65>append<6E> _encode_range<67>tuple)r<00> sorted_list<73>ranges<65>
last_write<EFBFBD>i<> current_range<67>r<00>a/home/infidel/Sync/Project/ocp-wg-backend/acer-env/lib/python3.10/site-packages/idna/intranges.py<70>intranges_from_list sr<00>start<72>endcCs |d>|BS)N<> r)rrrrrr s r <00>rcCs|d?|d@fS)Nrl<00><EFBFBD>r)rrrr<00> _decode_range#sr<00>int_rcCsvt|d<01>}t<01>||<02>}|dkr%t||d<00>\}}||kr$|kr%dS|t|<01>kr9t||<00>\}}||kr9dSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)r <00>bisect<63> bisect_leftrr
)rr<00>tuple_<65>pos<6F>left<66>right<68>_rrr<00>intranges_contain's
 <02> r#) <0B>__doc__r<00>typingrr<00>intrr r<00>boolr#rrrr<00><module>s"