TreeCrawler Namespace Reference

Classes
class	Color
class	mymf
class	Package
class	SearchHit

Functions
def	getDependenciesFromPythonFile (filename, toplevelname, path)
def	getImportTree (filename, path)
def	packageNameFromFilename (name)
def	removeRecursiveLoops (node, verbose=False, currentStack=None)
def	transformIntoGraph (depgraph, toplevel)

Function Documentation

def TreeCrawler.getDependenciesFromPythonFile	(		filename,
			toplevelname,
			path
	)

Definition at line 288 of file TreeCrawler.py.

Referenced by getImportTree().

def getDependenciesFromPythonFile(filename,toplevelname,path):
    modulefinder = mymf(path)
    modulefinder.run_script(filename)
    globalDependencyDict = modulefinder._depgraph
    globalDependencyDict[toplevelname] = globalDependencyDict["__main__"] 
    return globalDependencyDict

def TreeCrawler.getImportTree	(		filename,
			path
	)

Definition at line 296 of file TreeCrawler.py.

References getDependenciesFromPythonFile(), packageNameFromFilename(), and transformIntoGraph().

def getImportTree(filename,path):
    toplevelname = packageNameFromFilename(filename)
    # get dependencies from given file
    globalDependencyDict = getDependenciesFromPythonFile(filename,toplevelname,path)
        
    # transform this flat structure in a dependency tree
    dependencyGraph = transformIntoGraph(globalDependencyDict,toplevelname)
    return dependencyGraph                                               

def TreeCrawler.packageNameFromFilename

(

name

)

Definition at line 32 of file TreeCrawler.py.

References join(), python.rootplot.root2matplotlib.replace(), and split.

Referenced by getImportTree(), and TreeCrawler.Package.search().

def packageNameFromFilename(name):
    return ".".join(name.replace("python/","").replace(".py","").split("/")[-3:])

def TreeCrawler.removeRecursiveLoops	(		node,
			verbose = False,
			currentStack = None
	)

Definition at line 250 of file TreeCrawler.py.

References edm.print().

Referenced by transformIntoGraph().

def removeRecursiveLoops( node, verbose=False, currentStack=None ) :
    if currentStack is None : currentStack=[]
    try :
        duplicateIndex=currentStack.index( node ) # If there isn't a recursive loop this will raise a ValueError
        if verbose :
            print("Removing recursive loop in:")
            for index in range(duplicateIndex,len(currentStack)) :
                print("   ",currentStack[index].name,"-->")
            print("   ",node.name)
        currentStack[-1].dependencies.remove(node)
    except ValueError:
        # No recursive loop found, so continue traversing the tree
        currentStack.append( node )
        for subnode in node.dependencies :
            removeRecursiveLoops( subnode, verbose, currentStack[:] )

def TreeCrawler.transformIntoGraph	(		depgraph,
			toplevel
	)

Definition at line 266 of file TreeCrawler.py.

References removeRecursiveLoops().

Referenced by getImportTree().

def transformIntoGraph(depgraph,toplevel):
    packageDict = {}
    # create the top level config
    packageDict[toplevel] = Package(toplevel, top = True) 

    # create package objects
    for key, value in six.iteritems(depgraph):
        if key.count(".") == 2 and key != toplevel: 
            packageDict[key] = Package(key)
        for name in value.keys():
            if name.count(".") == 2: packageDict[name] = Package(name)
    # now create dependencies
    for key, value in six.iteritems(depgraph):
        if key.count(".") == 2 or key == toplevel:
            package = packageDict[key]
            package.dependencies = [packageDict[name] for name in value.keys() if name.count(".") == 2]

    removeRecursiveLoops( packageDict[toplevel] )
    # find and return the top level config
    return packageDict[toplevel]

---

Generated for CMSSW Reference Manual by  1.8.11