Submit
Path:
~
/
/
proc
/
thread-self
/
root
/
opt
/
alt
/
python27
/
lib
/
python2.7
/
site-packages
/
libfuturize
/
fixes
/
File Content:
fix_division_safe.py
""" For the ``future`` package. Adds this import line: from __future__ import division at the top and changes any old-style divisions to be calls to past.utils.old_div so the code runs as before on Py2.6/2.7 and has the same behaviour on Py3. If "from __future__ import division" is already in effect, this fixer does nothing. """ import re import lib2to3.pytree as pytree from lib2to3.fixer_util import Leaf, Node, Comma from lib2to3 import fixer_base from lib2to3.fixer_util import syms, does_tree_import from libfuturize.fixer_util import (token, future_import, touch_import_top, wrap_in_fn_call) 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 const_re = re.compile('^[0-9]*[.][0-9]*$') def is_floaty(node, div_idx): return _is_floaty(node.children[0:div_idx]) or _is_floaty(node.children[div_idx+1:]) def _is_floaty(expr): if isinstance(expr, list): expr = expr[0] if isinstance(expr, Leaf): # If it's a leaf, let's see if it's a numeric constant containing a '.' return const_re.match(expr.value) elif isinstance(expr, Node): # If the expression is a node, let's see if it's a direct cast to float if isinstance(expr.children[0], Leaf): return expr.children[0].value == u'float' return False def find_division(node): for i, child in enumerate(node.children): if match_division(child): return i return False def clone_div_operands(node, div_idx): children = [] for i, child in enumerate(node.children): if i == div_idx: children.append(Comma()) else: children.append(child.clone()) # Strip any leading space for the first number: children[0].prefix = u'' return children class FixDivisionSafe(fixer_base.BaseFix): # BM_compatible = True run_order = 4 # this seems to be ignored? _accept_type = token.SLASH PATTERN = """ term<(not('/') any)+ '/' ((not('/') any))> """ def start_tree(self, tree, name): """ Skip this fixer if "__future__.division" is already imported. """ super(FixDivisionSafe, self).start_tree(tree, name) self.skip = "division" in tree.future_features def match(self, node): u""" Since the tree needs to be fixed once and only once if and only if it matches, we can start discarding matches after the first. """ if node.type == self.syms.term: div_idx = find_division(node) if div_idx is not False: # if expr1 or expr2 are obviously floats, we don't need to wrap in # old_div, as the behavior of division between any number and a float # should be the same in 2 or 3 if not is_floaty(node, div_idx): return clone_div_operands(node, div_idx) return False def transform(self, node, results): if self.skip: return future_import(u"division", node) touch_import_top(u'past.utils', u'old_div', node) return wrap_in_fn_call("old_div", results, prefix=node.prefix)
Submit
FILE
FOLDER
Name
Size
Permission
Action
__init__.py
5141 bytes
0644
__init__.pyc
2406 bytes
0644
__init__.pyo
2406 bytes
0644
fix_UserDict.py
3840 bytes
0644
fix_UserDict.pyc
2903 bytes
0644
fix_UserDict.pyo
2903 bytes
0644
fix_absolute_import.py
3140 bytes
0644
fix_absolute_import.pyc
3022 bytes
0644
fix_absolute_import.pyo
3022 bytes
0644
fix_add__future__imports_except_unicode_literals.py
662 bytes
0644
fix_add__future__imports_except_unicode_literals.pyc
1336 bytes
0644
fix_add__future__imports_except_unicode_literals.pyo
1336 bytes
0644
fix_basestring.py
394 bytes
0644
fix_basestring.pyc
1007 bytes
0644
fix_basestring.pyo
1007 bytes
0644
fix_bytes.py
685 bytes
0644
fix_bytes.pyc
1311 bytes
0644
fix_bytes.pyo
1311 bytes
0644
fix_cmp.py
701 bytes
0644
fix_cmp.pyc
1321 bytes
0644
fix_cmp.pyo
1321 bytes
0644
fix_division.py
228 bytes
0644
fix_division.pyc
438 bytes
0644
fix_division.pyo
438 bytes
0644
fix_division_safe.py
3460 bytes
0644
fix_division_safe.pyc
4468 bytes
0644
fix_division_safe.pyo
4468 bytes
0644
fix_execfile.py
921 bytes
0644
fix_execfile.pyc
1556 bytes
0644
fix_execfile.pyo
1556 bytes
0644
fix_future_builtins.py
2027 bytes
0644
fix_future_builtins.pyc
1957 bytes
0644
fix_future_builtins.pyo
1957 bytes
0644
fix_future_standard_library.py
733 bytes
0644
fix_future_standard_library.pyc
1256 bytes
0644
fix_future_standard_library.pyo
1256 bytes
0644
fix_future_standard_library_urllib.py
1001 bytes
0644
fix_future_standard_library_urllib.pyc
1342 bytes
0644
fix_future_standard_library_urllib.pyo
1342 bytes
0644
fix_metaclass.py
9568 bytes
0644
fix_metaclass.pyc
7373 bytes
0644
fix_metaclass.pyo
7373 bytes
0644
fix_next_call.py
3158 bytes
0644
fix_next_call.pyc
3736 bytes
0644
fix_next_call.pyo
3703 bytes
0644
fix_object.py
407 bytes
0644
fix_object.pyc
997 bytes
0644
fix_object.pyo
997 bytes
0644
fix_oldstr_wrap.py
1214 bytes
0644
fix_oldstr_wrap.pyc
1728 bytes
0644
fix_oldstr_wrap.pyo
1728 bytes
0644
fix_order___future__imports.py
829 bytes
0644
fix_order___future__imports.pyc
1247 bytes
0644
fix_order___future__imports.pyo
1247 bytes
0644
fix_print.py
3384 bytes
0644
fix_print.pyc
2879 bytes
0644
fix_print.pyo
2782 bytes
0644
fix_print_with_import.py
735 bytes
0644
fix_print_with_import.pyc
1129 bytes
0644
fix_print_with_import.pyo
1129 bytes
0644
fix_raise.py
2167 bytes
0644
fix_raise.pyc
2126 bytes
0644
fix_raise.pyo
2126 bytes
0644
fix_remove_old__future__imports.py
851 bytes
0644
fix_remove_old__future__imports.pyc
1479 bytes
0644
fix_remove_old__future__imports.pyo
1479 bytes
0644
fix_unicode_keep_u.py
779 bytes
0644
fix_unicode_keep_u.pyc
1413 bytes
0644
fix_unicode_keep_u.pyo
1413 bytes
0644
fix_unicode_literals_import.py
367 bytes
0644
fix_unicode_literals_import.pyc
1029 bytes
0644
fix_unicode_literals_import.pyo
1029 bytes
0644
fix_xrange_with_import.py
479 bytes
0644
fix_xrange_with_import.pyc
1060 bytes
0644
fix_xrange_with_import.pyo
1060 bytes
0644
N4ST4R_ID | Naxtarrr