a

��?h��@s>dZd
dl
mZ
d
dlmZmZ
dd�ZGdd�dej�ZdS)	z?
Fixer for division: from __future__ import division if needed
�)
�
fixer_base)�token�
future_importc
Cs,tj
}
|j|
ko*|jj|
ko*|jj|
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)�nodeZslash�r�J/usr/local/lib/python3.9/site-packages/libpasteurize/fixes/fix_division.py�match_divisions

�r
c@s eZ
dZd
Zdd�Zdd�ZdS)�FixDivision�cCst|
�
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
)�selfrrrr	�matchszFixDivision.matchcCstd
|
�
dS)N�division)
r)r
r�resultsrrr	�	transforms
zFixDivision.transformN)�__name__�
__module__�__qualname__Z	run_orderrrrrrr	rs
rN)	�__doc__Zlib2to3rZlibfuturize.fixer_utilrrr
ZBaseFixrrrrr	�<module>
s