FM / python3.3

/opt/alt/python33/lib64/python3.3

Name	Size	Mode	Actions
collections/	-	0755	rm
concurrent/	-	0755	rm
config-3.3m/	-	0755	rm
ctypes/	-	0755	rm
curses/	-	0755	rm
dbm/	-	0755	rm
distutils/	-	0755	rm
email/	-	0755	rm
encodings/	-	0755	rm
html/	-	0755	rm
http/	-	0755	rm
idlelib/	-	0755	rm
importlib/	-	0755	rm
json/	-	0755	rm
lib-dynload/	-	0755	rm
lib2to3/	-	0755	rm
logging/	-	0755	rm
multiprocessing/	-	0755	rm
plat-linux/	-	0755	rm
pydoc_data/	-	0755	rm
site-packages/	-	0755	rm
sqlite3/	-	0755	rm
test/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	8057	0644	edit dl rm
aifc.py	31054	0644	edit dl rm
antigravity.py	475	0644	edit dl rm
argparse.py	89069	0644	edit dl rm
ast.py	12142	0644	edit dl rm
asynchat.py	11588	0644	edit dl rm
asyncore.py	20753	0644	edit dl rm
base64.py	13986	0755	edit dl rm
bdb.py	21894	0644	edit dl rm
binhex.py	13708	0644	edit dl rm
bisect.py	2595	0644	edit dl rm
bz2.py	18473	0644	edit dl rm
calendar.py	22940	0644	edit dl rm
cgi.py	35554	0755	edit dl rm
cgitb.py	12041	0644	edit dl rm
chunk.py	5377	0644	edit dl rm
cmd.py	14860	0644	edit dl rm
code.py	10030	0644	edit dl rm
codecs.py	35956	0644	edit dl rm
codeop.py	5994	0644	edit dl rm
colorsys.py	3691	0644	edit dl rm
compileall.py	9743	0644	edit dl rm
configparser.py	49437	0644	edit dl rm
contextlib.py	9125	0644	edit dl rm
copy.py	8991	0644	edit dl rm
copyreg.py	6611	0644	edit dl rm
cProfile.py	6361	0755	edit dl rm
crypt.py	1879	0644	edit dl rm
csv.py	16185	0644	edit dl rm
datetime.py	74954	0644	edit dl rm
decimal.py	228558	0644	edit dl rm
difflib.py	82519	0644	edit dl rm
dis.py	10134	0644	edit dl rm
doctest.py	102933	0644	edit dl rm
dummy_threading.py	2815	0644	edit dl rm
filecmp.py	9597	0644	edit dl rm
fileinput.py	14256	0644	edit dl rm
fnmatch.py	3163	0644	edit dl rm
formatter.py	14930	0644	edit dl rm
fractions.py	23033	0644	edit dl rm
ftplib.py	40253	0644	edit dl rm
functools.py	13596	0644	edit dl rm
genericpath.py	3093	0644	edit dl rm
getopt.py	7488	0644	edit dl rm
getpass.py	5793	0644	edit dl rm
gettext.py	20637	0644	edit dl rm
glob.py	2838	0644	edit dl rm
gzip.py	24403	0644	edit dl rm
hashlib.py	6193	0644	edit dl rm
heapq.py	17997	0644	edit dl rm
hmac.py	4440	0644	edit dl rm
imaplib.py	50111	0644	edit dl rm
imghdr.py	3528	0644	edit dl rm
imp.py	9727	0644	edit dl rm
inspect.py	78960	0644	edit dl rm
io.py	3280	0644	edit dl rm
ipaddress.py	70303	0644	edit dl rm
keyword.py	2060	0755	edit dl rm
linecache.py	3864	0644	edit dl rm
locale.py	93215	0644	edit dl rm
lzma.py	17454	0644	edit dl rm
macpath.py	5617	0644	edit dl rm
macurl2path.py	2732	0644	edit dl rm
mailbox.py	79093	0644	edit dl rm
mailcap.py	7437	0644	edit dl rm
mimetypes.py	20735	0644	edit dl rm
modulefinder.py	23198	0644	edit dl rm
netrc.py	5747	0644	edit dl rm
nntplib.py	42786	0644	edit dl rm
ntpath.py	20437	0644	edit dl rm
nturl2path.py	2396	0644	edit dl rm
numbers.py	10398	0644	edit dl rm
opcode.py	5098	0644	edit dl rm
optparse.py	60346	0644	edit dl rm
os.py	34779	0644	edit dl rm
os2emxpath.py	4659	0644	edit dl rm
pdb.py	60653	0755	edit dl rm
pickle.py	47858	0644	edit dl rm
pickletools.py	81349	0644	edit dl rm
pipes.py	8916	0644	edit dl rm
pkgutil.py	21539	0644	edit dl rm
platform.py	50742	0755	edit dl rm
plistlib.py	14777	0644	edit dl rm
poplib.py	11372	0644	edit dl rm
posixpath.py	14254	0644	edit dl rm
pprint.py	12700	0644	edit dl rm
profile.py	21448	0755	edit dl rm
pstats.py	26372	0644	edit dl rm
pty.py	5055	0644	edit dl rm
pyclbr.py	13438	0644	edit dl rm
pydoc.py	101644	0755	edit dl rm
py_compile.py	6717	0644	edit dl rm
queue.py	8835	0644	edit dl rm
quopri.py	7315	0755	edit dl rm
random.py	25660	0644	edit dl rm
re.py	14973	0644	edit dl rm
reprlib.py	5110	0644	edit dl rm
rlcompleter.py	5526	0644	edit dl rm
runpy.py	10413	0644	edit dl rm
sched.py	6399	0644	edit dl rm
shelve.py	8243	0644	edit dl rm
shlex.py	11502	0644	edit dl rm
shutil.py	39147	0644	edit dl rm
site.py	21971	0644	edit dl rm
smtpd.py	30207	0755	edit dl rm
smtplib.py	38021	0755	edit dl rm
sndhdr.py	6219	0644	edit dl rm
socket.py	14913	0644	edit dl rm
socketserver.py	24196	0644	edit dl rm
sre_compile.py	16345	0644	edit dl rm
sre_constants.py	7231	0644	edit dl rm
sre_parse.py	30212	0644	edit dl rm
ssl.py	24478	0644	edit dl rm
stat.py	4304	0644	edit dl rm
string.py	9410	0644	edit dl rm
stringprep.py	12917	0644	edit dl rm
struct.py	238	0644	edit dl rm
subprocess.py	67578	0644	edit dl rm
sunau.py	17523	0644	edit dl rm
symbol.py	2051	0755	edit dl rm
symtable.py	7383	0644	edit dl rm
sysconfig.py	25174	0644	edit dl rm
tabnanny.py	11410	0755	edit dl rm
tarfile.py	88864	0755	edit dl rm
telnetlib.py	27349	0644	edit dl rm
tempfile.py	23013	0644	edit dl rm
textwrap.py	16488	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	45641	0644	edit dl rm
timeit.py	12395	0755	edit dl rm
token.py	3034	0644	edit dl rm
tokenize.py	24876	0644	edit dl rm
trace.py	31487	0755	edit dl rm
traceback.py	11982	0644	edit dl rm
tty.py	879	0644	edit dl rm
types.py	3167	0644	edit dl rm
uu.py	6766	0755	edit dl rm
uuid.py	22349	0644	edit dl rm
warnings.py	13825	0644	edit dl rm
wave.py	18579	0644	edit dl rm
weakref.py	11495	0644	edit dl rm
webbrowser.py	22913	0755	edit dl rm
xdrlib.py	5381	0644	edit dl rm
zipfile.py	66424	0644	edit dl rm
_compat_pickle.py	4338	0644	edit dl rm
_dummy_thread.py	4769	0644	edit dl rm
_markupbase.py	14598	0644	edit dl rm
_osx_support.py	18855	0644	edit dl rm
_pyio.py	72905	0644	edit dl rm
_strptime.py	21674	0644	edit dl rm
_sysconfigdata.py	21056	0644	edit dl rm
_threading_local.py	7410	0644	edit dl rm
_weakrefset.py	5705	0644	edit dl rm
__future__.py	4584	0644	edit dl rm
__phello__.foo.py	64	0644	edit dl rm

Edit: /opt/alt/python33/lib64/python3.3/tabnanny.py (11410B)

#! /opt/alt/python33/bin/python3.3

"""The Tab Nanny despises ambiguous indentation.  She knows no mercy.

tabnanny -- Detection of ambiguous indentation

For the time being this module is intended to be called as a script.
However it is possible to import it into an IDE and use the function
check() described below.

Warning: The API provided by this module is likely to change in future
releases; such changes may not be backward compatible.
"""

# Released to the public domain, by Tim Peters, 15 April 1998.

# XXX Note: this is now a standard library module.
# XXX The API needs to undergo changes however; the current code is too
# XXX script-like.  This will be addressed later.

__version__ = "6"

import os
import sys
import getopt
import tokenize
if not hasattr(tokenize, 'NL'):
    raise ValueError("tokenize.NL doesn't exist -- tokenize module too old")

__all__ = ["check", "NannyNag", "process_tokens"]

verbose = 0
filename_only = 0

def errprint(*args):
    sep = ""
    for arg in args:
        sys.stderr.write(sep + str(arg))
        sep = " "
    sys.stderr.write("\n")

def main():
    global verbose, filename_only
    try:
        opts, args = getopt.getopt(sys.argv[1:], "qv")
    except getopt.error as msg:
        errprint(msg)
        return
    for o, a in opts:
        if o == '-q':
            filename_only = filename_only + 1
        if o == '-v':
            verbose = verbose + 1
    if not args:
        errprint("Usage:", sys.argv[0], "[-v] file_or_directory ...")
        return
    for arg in args:
        check(arg)

class NannyNag(Exception):
    """
    Raised by tokeneater() if detecting an ambiguous indent.
    Captured and handled in check().
    """
    def __init__(self, lineno, msg, line):
        self.lineno, self.msg, self.line = lineno, msg, line
    def get_lineno(self):
        return self.lineno
    def get_msg(self):
        return self.msg
    def get_line(self):
        return self.line

def check(file):
    """check(file_or_dir)

If file_or_dir is a directory and not a symbolic link, then recursively
    descend the directory tree named by file_or_dir, checking all .py files
    along the way. If file_or_dir is an ordinary Python source file, it is
    checked for whitespace related problems. The diagnostic messages are
    written to standard output using the print statement.
    """

if os.path.isdir(file) and not os.path.islink(file):
        if verbose:
            print("%r: listing directory" % (file,))
        names = os.listdir(file)
        for name in names:
            fullname = os.path.join(file, name)
            if (os.path.isdir(fullname) and
                not os.path.islink(fullname) or
                os.path.normcase(name[-3:]) == ".py"):
                check(fullname)
        return

try:
        f = tokenize.open(file)
    except IOError as msg:
        errprint("%r: I/O Error: %s" % (file, msg))
        return

if verbose > 1:
        print("checking %r ..." % file)

try:
        process_tokens(tokenize.generate_tokens(f.readline))

except tokenize.TokenError as msg:
        errprint("%r: Token Error: %s" % (file, msg))
        return

except IndentationError as msg:
        errprint("%r: Indentation Error: %s" % (file, msg))
        return

except NannyNag as nag:
        badline = nag.get_lineno()
        line = nag.get_line()
        if verbose:
            print("%r: *** Line %d: trouble in tab city! ***" % (file, badline))
            print("offending line: %r" % (line,))
            print(nag.get_msg())
        else:
            if ' ' in file: file = '"' + file + '"'
            if filename_only: print(file)
            else: print(file, badline, repr(line))
        return

finally:
        f.close()

if verbose:
        print("%r: Clean bill of health." % (file,))

class Whitespace:
    # the characters used for space and tab
    S, T = ' \t'

# members:
    #   raw
    #       the original string
    #   n
    #       the number of leading whitespace characters in raw
    #   nt
    #       the number of tabs in raw[:n]
    #   norm
    #       the normal form as a pair (count, trailing), where:
    #       count
    #           a tuple such that raw[:n] contains count[i]
    #           instances of S * i + T
    #       trailing
    #           the number of trailing spaces in raw[:n]
    #       It's A Theorem that m.indent_level(t) ==
    #       n.indent_level(t) for all t >= 1 iff m.norm == n.norm.
    #   is_simple
    #       true iff raw[:n] is of the form (T*)(S*)

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

# return length of longest contiguous run of spaces (whether or not
    # preceding a tab)
    def longest_run_of_spaces(self):
        count, trailing = self.norm
        return max(len(count)-1, trailing)

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)

# return true iff self.indent_level(t) == other.indent_level(t)
    # for all t >= 1
    def equal(self, other):
        return self.norm == other.norm

# return a list of tuples (ts, i1, i2) such that
    # i1 == self.indent_level(ts) != other.indent_level(ts) == i2.
    # Intended to be used after not self.equal(other) is known, in which
    # case it will return at least one witnessing tab size.
    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

# Return True iff self.indent_level(t) < other.indent_level(t)
    # for all t >= 1.
    # The algorithm is due to Vincent Broman.
    # Easy to prove it's correct.
    # XXXpost that.
    # Trivial to prove n is sharp (consider T vs ST).
    # Unknown whether there's a faster general way.  I suspected so at
    # first, but no longer.
    # For the special (but common!) case where M and N are both of the
    # form (T*)(S*), M.less(N) iff M.len() < N.len() and
    # 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):
        if self.n >= other.n:
            return False
        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 False
        return True

# return a list of tuples (ts, i1, i2) such that
    # i1 == self.indent_level(ts) >= other.indent_level(ts) == i2.
    # Intended to be used after not self.less(other) is known, in which
    # case it will return at least one witnessing tab size.
    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

def format_witnesses(w):
    firsts = (str(tup[0]) for tup in w)
    prefix = "at tab size"
    if len(w) > 1:
        prefix = prefix + "s"
    return prefix + " " + ', '.join(firsts)

def process_tokens(tokens):
    INDENT = tokenize.INDENT
    DEDENT = tokenize.DEDENT
    NEWLINE = tokenize.NEWLINE
    JUNK = tokenize.COMMENT, tokenize.NL
    indents = [Whitespace("")]
    check_equal = 0

for (type, token, start, end, line) in tokens:
        if type == NEWLINE:
            # a program statement, or ENDMARKER, will eventually follow,
            # after some (possibly empty) run of tokens of the form
            #     (NL | COMMENT)* (INDENT | DEDENT+)?
            # If an INDENT appears, setting check_equal is wrong, and will
            # be undone when we see the INDENT.
            check_equal = 1

elif type == INDENT:
            check_equal = 0
            thisguy = Whitespace(token)
            if not indents[-1].less(thisguy):
                witness = indents[-1].not_less_witness(thisguy)
                msg = "indent not greater e.g. " + format_witnesses(witness)
                raise NannyNag(start[0], msg, line)
            indents.append(thisguy)

elif type == DEDENT:
            # there's nothing we need to check here!  what's important is
            # that when the run of DEDENTs ends, the indentation of the
            # program statement (or ENDMARKER) that triggered the run is
            # equal to what's left at the top of the indents stack

# Ouch!  This assert triggers if the last line of the source
            # is indented *and* lacks a newline -- then DEDENTs pop out
            # of thin air.
            # assert check_equal  # else no earlier NEWLINE, or an earlier INDENT
            check_equal = 1

del indents[-1]

elif check_equal and type not in JUNK:
            # this is the first "real token" following a NEWLINE, so it
            # must be the first token of the next program statement, or an
            # ENDMARKER; the "line" argument exposes the leading whitespace
            # for this statement; in the case of ENDMARKER, line is an empty
            # string, so will properly match the empty string with which the
            # "indents" stack was seeded
            check_equal = 0
            thisguy = Whitespace(line)
            if not indents[-1].equal(thisguy):
                witness = indents[-1].not_equal_witness(thisguy)
                msg = "indent not equal e.g. " + format_witnesses(witness)
                raise NannyNag(start[0], msg, line)

if __name__ == '__main__':
    main()

cmd: