£Á°èZ¨Ä…–K§‚«“ô4“ÒÙ´dîfUÙÃÅ WKbyʦ•êŽ…È®FÒ¿ÊÎóCozá¬S@6{Í:›œêZÌ:Š•_%:¢¾¾~;‘Ã~芩ÊǍí`ÔÑ©ú뙵'5I¿fš×WO%ø9¾«¾DK|€ùÍD”Ýs]nHÕ¶êםӼ㞪éUWŸÈË%DÒÕ¬ï‘]/Åcx ‰ï2ß]ä6G[]S£Ôϯrs{úëóµmÒï#UQxo·õÞCe]"±/aÙ&Eã4ú9Jé_ÞåëdãöKë)AÞ ¯¹ægƒÛowЍø^d™ý½ßB7áyMä9ÜÖUã !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!  Re@sFdZddlZddZddZddZd d ZdS) 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)). NcCst|}g}d}xtt|D]{}|dt|krf||||ddkrfq+||d|d}|jt|d|dd|}q+Wt|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. rr)sortedrangelenappend _encode_rangetuple)list_ sorted_listranges last_writei current_ranger/builddir/build/BUILDROOT/alt-python35-pip-20.2.4-5.el8.x86_64/opt/alt/python35/lib/python3.5/site-packages/pip/_vendor/idna/intranges.pyintranges_from_list s " rcCs |d>|BS)N r)startendrrrrsrcCs|d?|d@fS)Nrrllr)rrrr _decode_range"srcCst|d}tj||}|dkrgt||d\}}||ko^|knrgdS|t|krt||\}}||krdSdS)z=Determine if `int_` falls into one of the ranges in `ranges`.rrTF)rbisect bisect_leftrr)int_r tuple_posleftright_rrrintranges_contain&s  r )__doc__rrrrr rrrrs