£Á°è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ã
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
<html>
B
    A[                 @   s>   d Z ddlmZ ddlmZmZ dd ZG dd dejZdS )	z?
Fixer for division: from __future__ import division if needed
    )
fixer_base)tokenfuture_importc             C   s,   t j}| j|ko*| jj|k o*| jj|k S )zw
    __future__.division redefines the meaning of a single slash for division,
    so we match that and only that.
    )r   SLASHtypeZnext_siblingZprev_sibling)nodeZslash r   Q/opt/alt/python37/lib/python3.7/site-packages/libpasteurize/fixes/fix_division.pymatch_division   s    r
   c               @   s    e Zd ZdZdd Zdd ZdS )FixDivision   c             C   s   t |S )z
        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
   )selfr   r   r   r	   match   s    zFixDivision.matchc             C   s   t d| d S )NZdivision)r   )r   r   Zresultsr   r   r	   	transform   s    zFixDivision.transformN)__name__
__module____qualname__Z	run_orderr   r   r   r   r   r	   r      s   r   N)	__doc__Zlib2to3r   Zlibfuturize.fixer_utilr   r   r
   ZBaseFixr   r   r   r   r	   <module>   s   	