分析并输出Python代码依赖的库

清华大佬耗费三个月吐血整理的几百G的资源,免费分享!....>>>

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#!/usr/bin/env python
# encoding: utf-8
# source: https://github.com/MrLYC/ycyc/blob/dev/tools/analysis_dependency.py
 
import ast
import importlib
import inspect
 
 
class Analysis(ast.NodeTransformer):
    def __init__(self, paths, recursion):
        self.modules = list()
        self.paths = list(paths)
        self.recursion = recursion
 
    def add_module(self, module):
        if module and module not in self.modules:
            self.modules.append(module)
            if self.recursion:
                try:
                    path = inspect.getsourcefile(importlib.import_module(module))
                    if path:
                        self.paths.append(path)
                except:
                    pass
 
    def visit_Import(self, node):
        for i in node.names:
            self.add_module(i.name)
 
    def visit_ImportFrom(self, node):
        self.add_module(node.module)
 
    def analysis(self):
        for p in self.paths:
            try:
                with open(p, "rt") as fp:
                    self.visit(ast.parse(fp.read(), p))
            except:
                pass
        return tuple(self.modules)
 
if __name__ == "__main__":
    import argparse
 
    parser = argparse.ArgumentParser()
    parser.add_argument("paths", nargs="+")
    parser.add_argument("-r", "--recursion", action="store_true", default=False)
    args = parser.parse_args()
 
    analysisor = Analysis(args.paths, args.recursion)
    for m in analysisor.analysis():
        print m