![]() Version | The DJ version string. |
ClassGraph | Overloaded. Initializes a new instance of the ClassGraph class. |
Nodes (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) |
AddAssembly | Overloaded. Add all classes in package pthat can be found on the class path. |
AddClass | Overloaded. Add typeto the class graph, if it hasn't already been added. If addFieldsis true, add all its non-static fields as construction edges. If addMethodsis true, add all its non-static non-void methods with no arguments as derived construction edges. |
AddConstructionEdge | Overloaded. Add a no-args method as a construction edge. |
AddEdge (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
AddInheritanceEdge (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
AddRepetitionEdge | Add a repetition edge from source to target. |
AddSubclassEdge (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
AsList | Overloaded. A fixed-size List backed by the object graph rooted at o. The elements of the list are the objects reachable by strategy s in the object graph with the given root whose class is a target of s. Throws TraversalSourceException if the type of root is not a source of the strategy. Note that this list (like the List returned by Arrays.AsList, but unlike the List returned by Gather()) is write-through, i.e. modifying it will modify the underlying object graph, and vice versa. |
definesClass (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
Equals (inherited from Object) | Determines whether the specified Object is equal to the current Object. |
Fetch | Overloaded. Fetch the object in the object graph rooted at o corresponding to the target of strategy s. |
Gather | Overloaded. Gather the objects in the object graph rooted at o corresponding to the target of strategy s. |
GetClassNamed | The System.Type object corresponding to the node named className. |
GetHashCode (inherited from Object) | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
getIncomingEdges (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
GetNode (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
GetNodeClass | The Class object corresponding to the node o. |
getOutgoingEdges (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
GetType (inherited from Object) | Gets the Type of the current instance. |
printTraversalEdges (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
Slice | Overloaded. The slice of the object graph rooted at o determined by strategy s. |
ToString (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
Traverse | Overloaded. Traverse the object graph rooted at o along strategy s using visitors in array v in parallel, returning the value of v[0].getReturnValue() at the end of the traversal. |
classNameToDefinitionMap (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
classNameToTypeMap | A table of classes indexed by name. Includes both ends of edges added. |
incoming (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
nodeNameToNodeMap (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
outgoing (inherited from edu.neu.ccs.demeter.APRlib.cd.ClassGraph) | |
typeToAddedMap | A table of classes and what parts have been added. {@link edu.neu.ccs.demeter.APRlib.cd.ClassGraph#definesClass} will be true for classes we've added on either end of an edge, but we want to keep track of edge sources in particular. |
Finalize (inherited from Object) | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
MemberwiseClone (inherited from Object) | Creates a shallow copy of the current Object. |
m_assembliesMap | The set of Assemblies that have been added. |