Na}{

File Content: `fix_division.py`

u"""
Fixer for division: from __future__ import division if needed
"""

from lib2to3 import fixer_base
from libfuturize.fixer_util import token, future_import

def match_division(node):
    u"""
    __future__.division redefines the meaning of a single slash for division,
    so we match that and only that.
    """
    slash = token.SLASH
    return node.type == slash and not node.next_sibling.type == slash and \
                                  not node.prev_sibling.type == slash

class FixDivision(fixer_base.BaseFix):
    run_order = 4    # this seems to be ignored?

    def match(self, node):
        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.
        """
        return match_division(node)

    def transform(self, node, results):
        future_import(u"division", node)

Name	Size	Permission
__pycache__	---	0755
__init__.py	3719 bytes	0644
feature_base.py	1723 bytes	0644
fix_add_all__future__imports.py	676 bytes	0644
fix_add_all_future_builtins.py	1269 bytes	0644
fix_add_future_standard_library_import.py	663 bytes	0644
fix_annotations.py	1581 bytes	0644
fix_division.py	904 bytes	0644
fix_features.py	2675 bytes	0644
fix_fullargspec.py	438 bytes	0644
fix_future_builtins.py	1450 bytes	0644
fix_getcwd.py	873 bytes	0644
fix_imports.py	4944 bytes	0644
fix_imports2.py	8580 bytes	0644
fix_kwargs.py	5991 bytes	0644
fix_memoryview.py	551 bytes	0644
fix_metaclass.py	3260 bytes	0644
fix_newstyle.py	888 bytes	0644
fix_next.py	1233 bytes	0644
fix_printfunction.py	401 bytes	0644
fix_raise.py	1099 bytes	0644
fix_raise_.py	1225 bytes	0644
fix_throw.py	835 bytes	0644
fix_unpacking.py	5946 bytes	0644

File Content: fix_division.py

File Content: `fix_division.py`