Gecko [ beriskala.com ]

Name	Size	Permission	Date
analyze_dxp.py	4.12 KB	-rwxr-xr-x	2025-01-08 14:13
byext.py	3.86 KB	-rwxr-xr-x	2025-01-08 14:13
byteyears.py	1.61 KB	-rwxr-xr-x	2025-01-08 14:13
checkappend.py	4.56 KB	-rwxr-xr-x	2025-01-08 14:13
checkpip.py	767 B	-rwxr-xr-x	2025-01-08 14:13
checkpyc.py	1.97 KB	-rwxr-xr-x	2025-01-08 14:13
classfix.py	5.82 KB	-rwxr-xr-x	2025-01-08 14:13
cleanfuture.py	8.39 KB	-rwxr-xr-x	2025-01-08 14:13
combinerefs.py	4.29 KB	-rwxr-xr-x	2025-01-08 14:13
copytime.py	673 B	-rwxr-xr-x	2025-01-08 14:13
crlf.py	620 B	-rwxr-xr-x	2025-01-08 14:13
cvsfiles.py	1.75 KB	-rwxr-xr-x	2025-01-08 14:13
db2pickle.py	3.5 KB	-rwxr-xr-x	2025-01-08 14:13
diff.py	2.03 KB	-rwxr-xr-x	2025-01-08 14:13
dutree.py	1.59 KB	-rwxr-xr-x	2025-01-08 14:13
eptags.py	1.46 KB	-rwxr-xr-x	2025-01-08 14:13
find_recursionlimit.py	3.4 KB	-rwxr-xr-x	2025-01-08 14:13
finddiv.py	2.47 KB	-rwxr-xr-x	2025-01-08 14:13
findlinksto.py	1.05 KB	-rwxr-xr-x	2025-01-08 14:13
findnocoding.py	2.75 KB	-rwxr-xr-x	2025-01-08 14:13
fixcid.py	9.77 KB	-rwxr-xr-x	2025-01-08 14:13
fixdiv.py	13.53 KB	-rwxr-xr-x	2025-01-08 14:13
fixheader.py	1.17 KB	-rwxr-xr-x	2025-01-08 14:13
fixnotice.py	2.99 KB	-rwxr-xr-x	2025-01-08 14:13
fixps.py	903 B	-rwxr-xr-x	2025-01-08 14:13
google.py	529 B	-rwxr-xr-x	2025-01-08 14:13
gprof2html.py	2.13 KB	-rwxr-xr-x	2025-01-08 14:13
h2py.py	5.82 KB	-rwxr-xr-x	2025-01-08 14:13
hotshotmain.py	1.46 KB	-rwxr-xr-x	2025-01-08 14:13
ifdef.py	3.64 KB	-rwxr-xr-x	2025-01-08 14:13
lfcr.py	628 B	-rwxr-xr-x	2025-01-08 14:13
linktree.py	2.38 KB	-rwxr-xr-x	2025-01-08 14:13
lll.py	752 B	-rwxr-xr-x	2025-01-08 14:13
logmerge.py	5.45 KB	-rwxr-xr-x	2025-01-08 14:13
mailerdaemon.py	7.77 KB	-rwxr-xr-x	2025-01-08 14:13
md5sum.py	2.34 KB	-rwxr-xr-x	2025-01-08 14:13
methfix.py	5.34 KB	-rwxr-xr-x	2025-01-08 14:13
mkreal.py	1.6 KB	-rwxr-xr-x	2025-01-08 14:13
ndiff.py	3.73 KB	-rwxr-xr-x	2025-01-08 14:13
nm2def.py	2.4 KB	-rwxr-xr-x	2025-01-08 14:13
objgraph.py	5.89 KB	-rwxr-xr-x	2025-01-08 14:13
parseentities.py	1.69 KB	-rwxr-xr-x	2025-01-08 14:13
patchcheck.py	7.51 KB	-rwxr-xr-x	2025-01-08 14:13
pathfix.py	4.24 KB	-rwxr-xr-x	2025-01-08 14:13
pdeps.py	3.85 KB	-rwxr-xr-x	2025-01-08 14:13
pickle2db.py	3.86 KB	-rwxr-xr-x	2025-01-08 14:13
pindent.py	16.78 KB	-rwxr-xr-x	2025-01-08 14:13
ptags.py	1.21 KB	-rwxr-xr-x	2025-01-08 14:13
pysource.py	3.77 KB	-rwxr-xr-x	2025-01-08 14:13
redemo.py	5.67 KB	-rwxr-xr-x	2025-01-08 14:13
reindent-rst.py	287 B	-rwxr-xr-x	2025-01-08 14:13
reindent.py	11.16 KB	-rwxr-xr-x	2025-01-08 14:13
rgrep.py	1.47 KB	-rwxr-xr-x	2025-01-08 14:13
serve.py	1.13 KB	-rwxr-xr-x	2025-01-08 14:13
setup.py	421 B	-rwxr-xr-x	2025-01-08 14:13
suff.py	631 B	-rwxr-xr-x	2025-01-08 14:13
svneol.py	2.87 KB	-rwxr-xr-x	2025-01-08 14:13
texcheck.py	9.04 KB	-rwxr-xr-x	2025-01-08 14:13
texi2html.py	68.2 KB	-rwxr-xr-x	2025-01-08 14:13
treesync.py	5.66 KB	-rwxr-xr-x	2025-01-08 14:13
untabify.py	1.2 KB	-rwxr-xr-x	2025-01-08 14:13
which.py	1.6 KB	-rwxr-xr-x	2025-01-08 14:13
win_add2path.py	1.58 KB	-rwxr-xr-x	2025-01-08 14:13
xxci.py	2.74 KB	-rwxr-xr-x	2025-01-08 14:13

Rename

#! /opt/alt/python27/bin/python

# pdeps
#
# Find dependencies between a bunch of Python modules.
#
# Usage:
#       pdeps file1.py file2.py ...
#
# Output:
# Four tables separated by lines like '--- Closure ---':
# 1) Direct dependencies, listing which module imports which other modules
# 2) The inverse of (1)
# 3) Indirect dependencies, or the closure of the above
# 4) The inverse of (3)
#
# To do:
# - command line options to select output type
# - option to automatically scan the Python library for referenced modules
# - option to limit output to particular modules

import sys
import re
import os

# Main program
#
def main():
    args = sys.argv[1:]
    if not args:
        print 'usage: pdeps file.py file.py ...'
        return 2
    #
    table = {}
    for arg in args:
        process(arg, table)
    #
    print '--- Uses ---'
    printresults(table)
    #
    print '--- Used By ---'
    inv = inverse(table)
    printresults(inv)
    #
    print '--- Closure of Uses ---'
    reach = closure(table)
    printresults(reach)
    #
    print '--- Closure of Used By ---'
    invreach = inverse(reach)
    printresults(invreach)
    #
    return 0

# Compiled regular expressions to search for import statements
#
m_import = re.compile('^[ \t]*from[ \t]+([^ \t]+)[ \t]+')
m_from = re.compile('^[ \t]*import[ \t]+([^#]+)')

# Collect data from one file
#
def process(filename, table):
    fp = open(filename, 'r')
    mod = os.path.basename(filename)
    if mod[-3:] == '.py':
        mod = mod[:-3]
    table[mod] = list = []
    while 1:
        line = fp.readline()
        if not line: break
        while line[-1:] == '\\':
            nextline = fp.readline()
            if not nextline: break
            line = line[:-1] + nextline
        if m_import.match(line) >= 0:
            (a, b), (a1, b1) = m_import.regs[:2]
        elif m_from.match(line) >= 0:
            (a, b), (a1, b1) = m_from.regs[:2]
        else: continue
        words = line[a1:b1].split(',')
        # print '#', line, words
        for word in words:
            word = word.strip()
            if word not in list:
                list.append(word)

# Compute closure (this is in fact totally general)
#
def closure(table):
    modules = table.keys()
    #
    # Initialize reach with a copy of table
    #
    reach = {}
    for mod in modules:
        reach[mod] = table[mod][:]
    #
    # Iterate until no more change
    #
    change = 1
    while change:
        change = 0
        for mod in modules:
            for mo in reach[mod]:
                if mo in modules:
                    for m in reach[mo]:
                        if m not in reach[mod]:
                            reach[mod].append(m)
                            change = 1
    #
    return reach

# Invert a table (this is again totally general).
# All keys of the original table are made keys of the inverse,
# so there may be empty lists in the inverse.
#
def inverse(table):
    inv = {}
    for key in table.keys():
        if not inv.has_key(key):
            inv[key] = []
        for item in table[key]:
            store(inv, item, key)
    return inv

# Store "item" in "dict" under "key".
# The dictionary maps keys to lists of items.
# If there is no list for the key yet, it is created.
#
def store(dict, key, item):
    if dict.has_key(key):
        dict[key].append(item)
    else:
        dict[key] = [item]

# Tabulate results neatly
#
def printresults(table):
    modules = table.keys()
    maxlen = 0
    for mod in modules: maxlen = max(maxlen, len(mod))
    modules.sort()
    for mod in modules:
        list = table[mod]
        list.sort()
        print mod.ljust(maxlen), ':',
        if mod in list:
            print '(*)',
        for ref in list:
            print ref,
        print

# Call main and honor exit status
if __name__ == '__main__':
    try:
        sys.exit(main())
    except KeyboardInterrupt:
        sys.exit(1)