mirror of
https://github.com/Tautulli/Tautulli.git
synced 2025-07-07 05:31:15 -07:00
Add future 0.18.2
This commit is contained in:
parent
08c8ee0774
commit
fa97d3f88d
210 changed files with 43159 additions and 0 deletions
28
lib/libpasteurize/fixes/fix_division.py
Normal file
28
lib/libpasteurize/fixes/fix_division.py
Normal file
|
@ -0,0 +1,28 @@
|
|||
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)
|
Loading…
Add table
Add a link
Reference in a new issue