Find dependencies between a bunch of Python modules.，dependenciesbunch,'''PYTHON SO

Find dependencies between a bunch of Python modules.，dependenciesbunch,'''PYTHON SO

'''PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2--------------------------------------------1. This LICENSE AGREEMENT is between the Python Software Foundation('PSF'), and the Individual or Organization ('Licensee') accessing andotherwise using this software ('Python') in source or binary form andits associated documentation.2. Subject to the terms and conditions of this License Agreement, PSFhereby grants Licensee a nonexclusive, royalty-free, world-widelicense to reproduce, analyze, test, perform and/or display publicly,prepare derivative works, distribute, and otherwise use Pythonalone or in any derivative version, provided, however, that PSF'sLicense Agreement and PSF's notice of copyright, i.e., 'Copyright (c)2001, 2002, 2003, 2004 Python Software Foundation; All Rights Reserved'are retained in Python alone or in any derivative version preparedby Licensee.3. In the event Licensee prepares a derivative work that is based onor incorporates Python or any part thereof, and wants to makethe derivative work available to others as provided herein, thenLicensee hereby agrees to include in any such work a brief summary ofthe changes made to Python.4. PSF is making Python available to Licensee on an 'AS IS'basis.  PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS ORIMPLIED.  BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO ANDDISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESSFOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOTINFRINGE ANY THIRD PARTY RIGHTS.5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHONFOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS ASA RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON,OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.6. This License Agreement will automatically terminate upon a materialbreach of its terms and conditions.7. Nothing in this License Agreement shall be deemed to create anyrelationship of agency, partnership, or joint venture between PSF andLicensee.  This License Agreement does not grant permission to use PSFtrademarks or trade name in a trademark sense to endorse or promoteproducts or services of Licensee, or any third party.8. By copying, installing or otherwise using Python, Licenseeagrees to be bound by the terms and conditions of this LicenseAgreement.'''#! /usr/bin/env 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 modulesimport sysimport regeximport 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 = regex.compile('^[ \t]*from[ \t]+\([^ \t]+\)[ \t]+')m_from = regex.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 statusif __name__ == '__main__':    try:        sys.exit(main())    except KeyboardInterrupt:        sys.exit(1)