ÿØÿà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Áß_ÿÙ A[c@sRdZddlmZddlmZmZdZdejfdYZdS(u? Fixer for division: from __future__ import division if needed i(t fixer_base(ttokent future_importcCs<tj}|j|ko;|jj|k o;|jj|k S(uw __future__.division redefines the meaning of a single slash for division, so we match that and only that. (RtSLASHttypet next_siblingt prev_sibling(tnodetslash((sQ/opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pytmatch_divisions "t FixDivisioncBs eZdZdZdZRS(icCs t|S(u Since the tree needs to be fixed once and only once if and only if it matches, then we can start discarding matches after we make the first. (R (tselfR((sQ/opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pytmatchscCstd|dS(Nudivision(R(R Rtresults((sQ/opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyt transforms(t__name__t __module__t run_orderR R(((sQ/opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyR s N( t__doc__tlib2to3Rtlibfuturize.fixer_utilRRR tBaseFixR (((sQ/opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyts