Current File : //opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyc
�
�A�[c @ sR d Z d d l m Z d d l m Z m Z d � Z d e j f d � � YZ d S( u?
Fixer for division: from __future__ import division if needed
i����( t
fixer_base( t tokent
future_importc C s< t j } | j | k o; | j j | k o; | j j | k S( uw
__future__.division redefines the meaning of a single slash for division,
so we match that and only that.
( R t SLASHt typet next_siblingt prev_sibling( t nodet slash( ( sQ /opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyt match_division s "t FixDivisionc B s e Z d Z d � Z d � Z RS( i c C s
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 ( t selfR ( ( sQ /opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyt match s c C s t d | � d S( Nu division( R ( R R t results( ( sQ /opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyt transform s ( 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__t lib2to3R t libfuturize.fixer_utilR R R t BaseFixR
( ( ( sQ /opt/alt/python27/lib/python2.7/site-packages/libpasteurize/fixes/fix_division.pyt <module> s
Mini Shell