ÿØÿàJFIFÿþ ÿÛC       ÿÛC ÿÀÿÄÿÄ"#QrÿÄÿÄ&1!A"2qQaáÿÚ ?Øy,æ/3JæݹÈ߲؋5êXw²±ÉyˆR”¾I0ó2—PI¾IÌÚiMö¯–þrìN&"KgX:Šíµ•nTJnLK„…@!‰-ý ùúmë;ºgµŒ&ó±hw’¯Õ@”Ü— 9ñ-ë.²1<yà‚¹ïQÐU„ہ?.’¦èûbß±©Ö«Âw*VŒ) `$‰bØԟ’ëXÖ-ËTÜíGÚ3ð«g Ÿ§¯—Jx„–’U/ÂÅv_s(Hÿ@TñJÑãõçn­‚!ÈgfbÓc­:él[ðQe 9ÀPLbÃãCµm[5¿ç'ªjglå‡Ûí_§Úõl-;"PkÞÞÁQâ¼_Ñ^¢SŸx?"¸¦ùY騐ÒOÈ q’`~~ÚtËU¹CڒêV  I1Áß_ÿÙ 'Xc@s:dZddlZdZdZdZdZdS(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)). iNcCst|}g}d}xtt|D]~}|dt|krl||||ddkrlq+qln||d|d!}|jt|d|dd|}q+Wt|S(sRepresent 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. iii(tsortedtrangetlentappendt _encode_rangettuple(tlist_t sorted_listtrangest last_writetit current_range((s2/usr/lib/python2.7/site-packages/idna/intranges.pytintranges_from_list s  " cCs |d>|BS(Ni ((tstarttend((s2/usr/lib/python2.7/site-packages/idna/intranges.pyRscCs|d?|d@fS(Ni iII((tr((s2/usr/lib/python2.7/site-packages/idna/intranges.pyt _decode_range"scCst|d}tj||}|dkrjt||d\}}||ko^|knrjtSn|t|krt||\}}||krtSntS(s=Determine if `int_` falls into one of the ranges in `ranges`.ii(Rtbisectt bisect_leftRtTrueRtFalse(tint_Rttuple_tpostlefttrightt_((s2/usr/lib/python2.7/site-packages/idna/intranges.pytintranges_contain&s  (t__doc__RR RRR(((s2/usr/lib/python2.7/site-packages/idna/intranges.pyts