eric: comparison UtilitiesPython2/Tabnanny.py

-:1b59c4ba121e
+:8cd4d08fa9f6
 if not hasattr(tokenize, 'NL'):
 raise ValueError("tokenize.NL doesn't exist -- tokenize module too old")
 __all__ = ["check", "NannyNag", "process_tokens"]
 class NannyNag(Exception):
 """
 Raised by tokeneater() if detecting an ambiguous indent.
 Captured and handled in check().
 """
 Method to retrieve the offending line.
 @return The line of code (string)
 """
 return self.line
 def check(filename, codestring):
 """
 Private function to check one Python source file for whitespace related problems.
 except Exception, err:
 return (True, filename, "1", "Unspecific Error: %s" % unicode(err))
 return (False, None, None, None)
 class Whitespace(object):
 """
 Class implementing the whitespace checker.
 """
 """
 Constructor
 @param ws The string to be checked.
 """
-self.raw  = ws
+self.raw = ws
 S, T = Whitespace.S, Whitespace.T
 count = []
 b = n = nt = 0
 for ch in self.raw:
 if ch == S:
 count = count + [0] * (b - len(count) + 1)
 count[b] = count[b] + 1
 b = 0
 else:
 break
-self.n    = n
+self.n = n
-self.nt   = nt
+self.nt = nt
 self.norm = tuple(count), b
 self.is_simple = len(count) <= 1
 # return length of longest contiguous run of spaces (whether or not
 # preceding a tab)
 @return The length of longest contiguous run of spaces (whether or not
 preceding a tab)
 """
 count, trailing = self.norm
-return max(len(count)-1, trailing)
+return max(len(count) - 1, trailing)
 def indent_level(self, tabsize):
 """
 Method to determine the indentation level.
 # and note that i/ts*count[i] is 0 when i < ts
 count, trailing = self.norm
 il = 0
 for i in range(tabsize, len(count)):
-il = il + i/tabsize * count[i]
+il = il + i / tabsize * count[i]
 return trailing + tabsize * (il + self.nt)
 # return true iff self.indent_level(t) == other.indent_level(t)
 # for all t >= 1
 def equal(self, other):
 i1 == self.indent_level(ts) != other.indent_level(ts) == i2.
 """
 n = max(self.longest_run_of_spaces(),
 other.longest_run_of_spaces()) + 1
 a = []
-for ts in range(1, n+1):
+for ts in range(1, n + 1):
 if self.indent_level(ts) != other.indent_level(ts):
-a.append( (ts,
+a.append((ts,
 self.indent_level(ts),
-other.indent_level(ts)) )
+other.indent_level(ts)))
 return a
 # Return True iff self.indent_level(t) < other.indent_level(t)
 # for all t >= 1.
 # The algorithm is due to Vincent Broman.
 # M.num_tabs() <= N.num_tabs(). Proof is easy but kinda long-winded.
 # XXXwrite that up.
 # Note that M is of the form (T*)(S*) iff len(M.norm[0]) <= 1.
 def less(self, other):
 """
 Method to compare the indentation level against another Whitespace objects to
 be smaller.
 @param other Whitespace object to compare against.
 @return True, if we compare less against the other Whitespace object.
 """
 if self.is_simple and other.is_simple:
 return self.nt <= other.nt
 n = max(self.longest_run_of_spaces(),
 other.longest_run_of_spaces()) + 1
 # the self.n >= other.n test already did it for ts=1
-for ts in range(2, n+1):
+for ts in range(2, n + 1):
 if self.indent_level(ts) >= other.indent_level(ts):
 return False
 return True
 # return a list of tuples (ts, i1, i2) such that
 i1 == self.indent_level(ts) >= other.indent_level(ts) == i2.
 """
 n = max(self.longest_run_of_spaces(),
 other.longest_run_of_spaces()) + 1
 a = []
-for ts in range(1, n+1):
+for ts in range(1, n + 1):
 if self.indent_level(ts) >= other.indent_level(ts):
-a.append( (ts,
+a.append((ts,
 self.indent_level(ts),
-other.indent_level(ts)) )
+other.indent_level(ts)))
 return a
 def format_witnesses(w):
 """
 Function to format the witnesses as a readable string.
 firsts = map(lambda tup: str(tup[0]), w)
 prefix = "at tab size"
 if len(w) > 1:
 prefix = prefix + "s"
 return prefix + " " + ', '.join(firsts)
 def process_tokens(tokens):
 """
 Function processing all tokens generated by a tokenizer run.

Mercurial Repositories > eric / file comparison

comparison: UtilitiesPython2/Tabnanny.py

UtilitiesPython2/Tabnanny.py