Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
2to3	96 B	-rwxr-xr-x	2024-03-19 22:46
README	4.46 KB	-rw-r--r--	2024-03-19 22:46
abitype.py	5.44 KB	-rwxr-xr-x	2024-03-19 22:46
analyze_dxp.py	4.08 KB	-rw-r--r--	2024-03-19 22:46
byext.py	3.81 KB	-rwxr-xr-x	2024-03-19 22:46
byteyears.py	1.61 KB	-rwxr-xr-x	2024-03-19 22:46
checkpip.py	793 B	-rwxr-xr-x	2024-03-19 22:46
cleanfuture.py	8.42 KB	-rwxr-xr-x	2024-03-19 22:46
combinerefs.py	4.35 KB	-rwxr-xr-x	2024-03-19 22:46
copytime.py	663 B	-rwxr-xr-x	2024-03-19 22:46
crlf.py	632 B	-rwxr-xr-x	2024-03-19 22:46
db2pickle.py	3.54 KB	-rwxr-xr-x	2024-03-19 22:46
diff.py	2.2 KB	-rwxr-xr-x	2024-03-19 22:46
dutree.doc	2.18 KB	-rw-r--r--	2024-03-19 22:46
dutree.py	1.6 KB	-rwxr-xr-x	2024-03-19 22:46
eptags.py	1.54 KB	-rwxr-xr-x	2024-03-19 22:46
find-uname.py	1.18 KB	-rwxr-xr-x	2024-03-19 22:46
find_recursionlimit.py	3.9 KB	-rwxr-xr-x	2024-03-19 22:46
finddiv.py	2.48 KB	-rwxr-xr-x	2024-03-19 22:46
findlinksto.py	1.05 KB	-rwxr-xr-x	2024-03-19 22:46
findnocoding.py	2.88 KB	-rwxr-xr-x	2024-03-19 22:46
fixcid.py	9.93 KB	-rwxr-xr-x	2024-03-19 22:46
fixdiv.py	13.91 KB	-rwxr-xr-x	2024-03-19 22:46
fixheader.py	1.33 KB	-rwxr-xr-x	2024-03-19 22:46
fixnotice.py	2.96 KB	-rwxr-xr-x	2024-03-19 22:46
fixps.py	892 B	-rwxr-xr-x	2024-03-19 22:46
generate_opcode_h.py	2.17 KB	-rw-r--r--	2024-03-19 22:46
generate_stdlib_module_names.py	4.55 KB	-rw-r--r--	2024-03-19 22:46
generate_token.py	6.81 KB	-rwxr-xr-x	2024-03-19 22:46
get-remote-certificate.py	2.25 KB	-rwxr-xr-x	2024-03-19 22:46
google.py	501 B	-rwxr-xr-x	2024-03-19 22:46
gprof2html.py	2.25 KB	-rwxr-xr-x	2024-03-19 22:46
highlight.py	8.95 KB	-rwxr-xr-x	2024-03-19 22:46
idle3	96 B	-rwxr-xr-x	2024-03-19 22:46
ifdef.py	3.62 KB	-rwxr-xr-x	2024-03-19 22:46
import_diagnostics.py	999 B	-rwxr-xr-x	2024-03-19 22:46
lfcr.py	640 B	-rwxr-xr-x	2024-03-19 22:46
linktree.py	2.38 KB	-rwxr-xr-x	2024-03-19 22:46
lll.py	748 B	-rwxr-xr-x	2024-03-19 22:46
mailerdaemon.py	7.85 KB	-rwxr-xr-x	2024-03-19 22:46
make_ctype.py	2.23 KB	-rwxr-xr-x	2024-03-19 22:46
md5sum.py	2.46 KB	-rwxr-xr-x	2024-03-19 22:46
mkreal.py	1.59 KB	-rwxr-xr-x	2024-03-19 22:46
ndiff.py	3.73 KB	-rwxr-xr-x	2024-03-19 22:46
nm2def.py	2.42 KB	-rwxr-xr-x	2024-03-19 22:46
objgraph.py	5.8 KB	-rwxr-xr-x	2024-03-19 22:46
parse_html5_entities.py	3.91 KB	-rwxr-xr-x	2024-03-19 22:46
parseentities.py	1.7 KB	-rwxr-xr-x	2024-03-19 22:46
patchcheck.py	10.51 KB	-rwxr-xr-x	2024-03-19 22:46
pathfix.py	6.63 KB	-rwxr-xr-x	2024-03-19 22:46
pdeps.py	3.91 KB	-rwxr-xr-x	2024-03-19 22:46
pep384_macrocheck.py	4.61 KB	-rw-r--r--	2024-03-19 22:46
pickle2db.py	3.93 KB	-rwxr-xr-x	2024-03-19 22:46
pindent.py	16.73 KB	-rwxr-xr-x	2024-03-19 22:46
ptags.py	1.28 KB	-rwxr-xr-x	2024-03-19 22:46
pydoc3	80 B	-rwxr-xr-x	2024-03-19 22:46
pysource.py	3.77 KB	-rwxr-xr-x	2024-03-19 22:46
reindent-rst.py	279 B	-rwxr-xr-x	2024-03-19 22:46
reindent.py	11.37 KB	-rwxr-xr-x	2024-03-19 22:46
rgrep.py	1.54 KB	-rwxr-xr-x	2024-03-19 22:46
run_tests.py	1.78 KB	-rw-r--r--	2024-03-19 22:46
serve.py	1.2 KB	-rwxr-xr-x	2024-03-19 22:46
smelly.py	4.9 KB	-rwxr-xr-x	2024-03-19 22:46
stable_abi.py	21.09 KB	-rwxr-xr-x	2024-03-19 22:46
suff.py	510 B	-rwxr-xr-x	2024-03-19 22:46
texi2html.py	68.72 KB	-rwxr-xr-x	2024-03-19 22:46
untabify.py	1.27 KB	-rwxr-xr-x	2024-03-19 22:46
update_file.py	762 B	-rw-r--r--	2024-03-19 22:46
var_access_benchmark.py	11.63 KB	-rw-r--r--	2024-03-19 22:46
verify_ensurepip_wheels.py	3.31 KB	-rwxr-xr-x	2024-03-19 22:46
which.py	1.65 KB	-rwxr-xr-x	2024-03-19 22:46
win_add2path.py	1.62 KB	-rw-r--r--	2024-03-19 22:46

Rename

#! /usr/bin/env python3

# 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):
    with open(filename, encoding='utf-8') as fp:
        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)

# 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)