Gecko [ beriskala.com ]

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2026-05-01 04:20
2to3	96 B	-rwxr-xr-x	2017-09-19 12:02
README	4.22 KB	-rw-r--r--	2017-09-19 12:02
abitype.py	5.45 KB	-rwxr-xr-x	2024-04-17 20:28
analyze_dxp.py	4.08 KB	-rw-r--r--	2024-04-17 20:28
byext.py	3.84 KB	-rwxr-xr-x	2024-04-17 20:28
byteyears.py	1.62 KB	-rwxr-xr-x	2024-04-17 20:28
checkpyc.py	2.14 KB	-rwxr-xr-x	2024-04-17 20:28
cleanfuture.py	8.43 KB	-rwxr-xr-x	2024-04-17 20:28
combinerefs.py	4.32 KB	-rwxr-xr-x	2024-04-17 20:28
copytime.py	676 B	-rwxr-xr-x	2024-04-17 20:28
crlf.py	643 B	-rwxr-xr-x	2024-04-17 20:28
db2pickle.py	3.56 KB	-rwxr-xr-x	2024-04-17 20:28
diff.py	2.2 KB	-rwxr-xr-x	2024-04-17 20:28
dutree.doc	2.19 KB	-rw-r--r--	2017-09-19 12:02
dutree.py	1.58 KB	-rwxr-xr-x	2024-04-17 20:28
eptags.py	1.46 KB	-rwxr-xr-x	2024-04-17 20:28
find-uname.py	1.18 KB	-rwxr-xr-x	2024-04-17 20:28
find_recursionlimit.py	3.91 KB	-rwxr-xr-x	2024-04-17 20:28
finddiv.py	2.45 KB	-rwxr-xr-x	2024-04-17 20:28
findlinksto.py	1.06 KB	-rwxr-xr-x	2024-04-17 20:28
findnocoding.py	2.89 KB	-rwxr-xr-x	2024-04-17 20:28
fixcid.py	9.77 KB	-rwxr-xr-x	2024-04-17 20:28
fixdiv.py	13.62 KB	-rwxr-xr-x	2024-04-17 20:28
fixheader.py	1.19 KB	-rwxr-xr-x	2024-04-17 20:28
fixnotice.py	3 KB	-rwxr-xr-x	2024-04-17 20:28
fixps.py	911 B	-rwxr-xr-x	2024-04-17 20:28
get-remote-certificate.py	2.66 KB	-rwxr-xr-x	2024-04-17 20:28
google.py	533 B	-rwxr-xr-x	2024-04-17 20:28
gprof2html.py	2.16 KB	-rwxr-xr-x	2024-04-17 20:28
h2py.py	5.49 KB	-rwxr-xr-x	2024-04-17 20:28
highlight.py	8.92 KB	-rwxr-xr-x	2024-04-17 20:28
idle3	96 B	-rwxr-xr-x	2017-09-19 12:02
ifdef.py	3.64 KB	-rwxr-xr-x	2024-04-17 20:28
import_diagnostics.py	1011 B	-rwxr-xr-x	2024-04-17 20:28
lfcr.py	651 B	-rwxr-xr-x	2024-04-17 20:28
linktree.py	2.4 KB	-rwxr-xr-x	2024-04-17 20:28
lll.py	763 B	-rwxr-xr-x	2024-04-17 20:28
mailerdaemon.py	7.86 KB	-rwxr-xr-x	2024-04-17 20:28
make_ctype.py	2.24 KB	-rwxr-xr-x	2024-04-17 20:28
md5sum.py	2.36 KB	-rwxr-xr-x	2024-04-17 20:28
mkreal.py	1.6 KB	-rwxr-xr-x	2024-04-17 20:28
ndiff.py	3.75 KB	-rwxr-xr-x	2024-04-17 20:28
nm2def.py	2.4 KB	-rwxr-xr-x	2024-04-17 20:28
objgraph.py	5.85 KB	-rwxr-xr-x	2024-04-17 20:28
parseentities.py	1.67 KB	-rwxr-xr-x	2024-04-17 20:28
patchcheck.py	5.7 KB	-rwxr-xr-x	2024-04-17 20:28
pathfix.py	4.78 KB	-rwxr-xr-x	2024-04-17 20:28
pdeps.py	3.83 KB	-rwxr-xr-x	2024-04-17 20:28
pickle2db.py	3.94 KB	-rwxr-xr-x	2024-04-17 20:28
pindent.py	16.74 KB	-rwxr-xr-x	2024-04-17 20:28
ptags.py	1.21 KB	-rwxr-xr-x	2024-04-17 20:28
pydoc3	80 B	-rwxr-xr-x	2017-09-19 12:02
pydocgui.pyw	215 B	-rw-r--r--	2017-09-19 12:02
pysource.py	3.79 KB	-rwxr-xr-x	2024-04-17 20:28
pyvenv	232 B	-rwxr-xr-x	2017-09-19 12:02
reindent-rst.py	279 B	-rwxr-xr-x	2024-04-17 20:28
reindent.py	11.26 KB	-rwxr-xr-x	2024-04-17 20:28
rgrep.py	1.45 KB	-rwxr-xr-x	2024-04-17 20:28
run_tests.py	1.84 KB	-rw-r--r--	2024-04-17 20:28
serve.py	1.15 KB	-rwxr-xr-x	2024-04-17 20:28
suff.py	521 B	-rwxr-xr-x	2024-04-17 20:28
svneol.py	3.42 KB	-rwxr-xr-x	2024-04-17 20:28
texi2html.py	68.54 KB	-rwxr-xr-x	2024-04-17 20:28
treesync.py	5.8 KB	-rwxr-xr-x	2024-04-17 20:28
untabify.py	1.28 KB	-rwxr-xr-x	2024-04-17 20:28
which.py	1.61 KB	-rwxr-xr-x	2024-04-17 20:28
win_add2path.py	1.58 KB	-rw-r--r--	2024-04-17 20:28

Rename

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

# 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
        m_found = m_import.match(line) or m_from.match(line)
        if m_found:
            (a, b), (a1, b1) = m_found.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)
    fp.close()

# Compute closure (this is in fact totally general)
#
def closure(table):
    modules = list(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 key not in inv:
            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 key in dict:
        dict[key].append(item)
    else:
        dict[key] = [item]

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

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