Vega strike Python Modules doc: Whitespace Class Reference

All Data Structures Namespaces Files Functions Variables

Public Member Functions
def	__init__

def	longest_run_of_spaces

def	indent_level

def	equal

def	not_equal_witness

def	less

def	not_less_witness

Data Fields
	raw

	n

	nt

	norm

	is_simple

Detailed Description

Definition at line 106 of file tabnanny.py.

Constructor & Destructor Documentation

def __init__	(	self,
		ws
	)

Definition at line 129 of file tabnanny.py.

 
     def __init__(self, ws):
         self.raw  = ws
         S, T = Whitespace.S, Whitespace.T
         count = []
         b = n = nt = 0
         for ch in self.raw:
             if ch == S:
                 n = n + 1
                 b = b + 1
             elif ch == T:
                 n = n + 1
                 nt = nt + 1
                 if b >= len(count):
                     count = count + [0] * (b - len(count) + 1)
                 count[b] = count[b] + 1
                 b = 0
             else:
                 break
         self.n    = n
         self.nt   = nt
         self.norm = tuple(count), b
         self.is_simple = len(count) <= 1

Member Function Documentation

def equal	(	self,
		other
	)

Definition at line 181 of file tabnanny.py.

References Whitespace.norm.

 
     def equal(self, other):
         return self.norm == other.norm

def indent_level	(	self,
		tabsize
	)

Definition at line 158 of file tabnanny.py.

References Whitespace.norm, and Whitespace.nt.

 
     def indent_level(self, tabsize):
         # count, il = self.norm
         # for i in range(len(count)):
         #    if count[i]:
         #        il = il + (i/tabsize + 1)*tabsize * count[i]
         # return il
 
         # quicker:
         # il = trailing + sum (i/ts + 1)*ts*count[i] =
         # trailing + ts * sum (i/ts + 1)*count[i] =
         # trailing + ts * sum i/ts*count[i] + count[i] =
         # trailing + ts * [(sum i/ts*count[i]) + (sum count[i])] =
         # trailing + ts * [(sum i/ts*count[i]) + num_tabs]
         # 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]
         return trailing + tabsize * (il + self.nt)

def less	(	self,
		other
	)

Definition at line 212 of file tabnanny.py.

References Whitespace.indent_level(), Whitespace.is_simple, Whitespace.longest_run_of_spaces(), sre_parse.max, Whitespace.n, and Whitespace.nt.

 
     def less(self, other):
         if self.n >= other.n:
             return 0
         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):
             if self.indent_level(ts) >= other.indent_level(ts):
                 return 0
         return 1

def longest_run_of_spaces ( self)

Definition at line 154 of file tabnanny.py.

References sre_parse.max, and Whitespace.norm.

 
     def longest_run_of_spaces(self):
         count, trailing = self.norm
         return max(len(count)-1, trailing)

def not_equal_witness	(	self,
		other
	)

Definition at line 188 of file tabnanny.py.

References Whitespace.indent_level(), Whitespace.longest_run_of_spaces(), and sre_parse.max.

 
     def not_equal_witness(self, other):
         n = max(self.longest_run_of_spaces(),
                 other.longest_run_of_spaces()) + 1
         a = []
         for ts in range(1, n+1):
             if self.indent_level(ts) != other.indent_level(ts):
                 a.append( (ts,
                            self.indent_level(ts),
                            other.indent_level(ts)) )
         return a

def not_less_witness	(	self,
		other
	)

Definition at line 229 of file tabnanny.py.

References Whitespace.indent_level(), Whitespace.longest_run_of_spaces(), and sre_parse.max.

 
     def not_less_witness(self, other):
         n = max(self.longest_run_of_spaces(),
                 other.longest_run_of_spaces()) + 1
         a = []
         for ts in range(1, n+1):
             if self.indent_level(ts) >= other.indent_level(ts):
                 a.append( (ts,
                            self.indent_level(ts),
                            other.indent_level(ts)) )
         return a

Public Member Functions

Data Fields

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Field Documentation