C E G H I M N S T V

C

ClassGraphI - interface EDU.neu.ccs.demeter.aplib.ClassGraphI.
 
compute(ClassGraphI, StrategyGraphI, NameMapI) - Static method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Compute the traversal graph for the class graph and strategy graph with the given map, which is a partial map from labels in the strategy graph to labels in the class graph.
compute(ClassGraphI, StrategyGraphI, NameMapI, boolean) - Static method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
 
copiesOfAlternationEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing which copies of the given alternation edge are in the traversal graph, or null if there is no such edge.
copiesOfConstructionEdge(String, String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing which copies of the given construction edge are in the traversal graph, or null if there is no such edge.
copiesOfEdge(EdgeI) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing which copies of the given edge are in the traversal graph, or null if there is no such edge.
copiesOfInheritanceEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing which copies of the given inheritance edge are in the traversal graph, or null if there is no such edge.
copiesOfVertex(String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing which copies of the vertex labeled l are in the traversal graph, or null if there is no such vertex.

E

EdgeI - interface EDU.neu.ccs.demeter.aplib.EdgeI.
 
edgeKey(EdgeI) - Static method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A unique identifying string for the given edge.
edges() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Deprecated. Renamed to getEdges() to comply with bean naming convention.
equals(Object) - Method in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
 

G

get(String) - Method in interface EDU.neu.ccs.demeter.aplib.NameMapI
The label in the ClassGraphI corresponding to l in the StrategyGraphI.
getAlternationEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The given alternation edge, if it's in the traversal graph, or null.
getClassGraph() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The class graph used in computing this traversal graph.
getConstructionEdge(String, String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The given construction edge, if it's in the traversal graph, or null.
getEdges() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
An enumeration of the edges (EdgeI objects) in the traversal graph.
getIncomingEdges(String) - Method in interface EDU.neu.ccs.demeter.aplib.ClassGraphI
A List of edges (EdgeI objects) coming into the vertex labeled l, or null if there is no such vertex.
getIncomingIndices(String) - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
A Vector of Integers of the incoming edges to the vertex labeled l.
getInheritanceEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The given inheritance edge, if it's in the traversal graph, or null.
getIntercopyTable(EdgeI) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
An enumeration of IntercopyTableEntry objects representing the intercopy table for the given edge.
getIntercopyTableForAlternationEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The intercopy table for the given alternation edge, or null if there is no such edge.
getIntercopyTableForConstructionEdge(String, String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The intercopy table for the given construction edge, or null if there is no such edge.
getIntercopyTableForInheritanceEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The intercopy table for the given inheritance edge, or null if there is no such edge.
getLabel() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
The label of the edge, or null if it has none.
getNameMap() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The name map from the strategy graph to the class graph.
getOutgoingEdges(String) - Method in interface EDU.neu.ccs.demeter.aplib.ClassGraphI
A List of edges (EdgeI objects) going out of the vertex labeled l, or null if there is no such vertex.
getOutgoingIndices(String) - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
A Vector of Integers of the outgoing edges from the vertex labeled l.
getSource() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
The label of the source vertex of the edge.
getSourceIndices(String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A vector of Integer objects representing the start set of tokens (copy indices) for the source vertex labeled l.
getSources() - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
An Enumeration of Strings which label the source vertices, or null if the strategy is "from *".
getSources() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
An enumeration of the labels (Strings) of the source vertices of the traversal graph.
getStartSet(String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A BitSet representing the start set of tokens (copy indices) for the source vertex labeled l.
getStrategyGraph() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
The strategy graph used in computing this traversal graph.
getTarget() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
The label of the target vertex of the edge.
getTargets() - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
An Enumeration of Strings which label the target vertices, or null if the strategy is "to *".
getTargets() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
An enumeration of the labels (Strings) of the target vertices of the traversal graph.
getVertices() - Method in interface EDU.neu.ccs.demeter.aplib.ClassGraphI
A List of Strings which label the vertices in the class graph.
getVertices() - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
An Enumeration of Strings which label the vertices in the strategy graph.
getVertices() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
An enumeration of the vertex labels (Strings) in the traversal graph.

H

hasAlternationEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given alternation edge in the traversal graph?
hasAlternationEdge(String, String, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the ith copy of the given alternation edge in the traversal graph?
hasAlternationEdge(String, String, int, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given alternation edge from the ith copy of its source vertex to the jth copy of its target vertex in the traversal graph?
hasConstructionEdge(String, String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given construction edge in the traversal graph?
hasConstructionEdge(String, String, String, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the ith copy of the given construction edge in the traversal graph?
hasConstructionEdge(String, String, String, int, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given construction edge from the ith copy of its source vertex to the jth copy of its target vertex in the traversal graph?
hasEdge(EdgeI) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given edge in the traversal graph?
hasEdge(EdgeI, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the ith copy of the given edge in the traversal graph? This is equivalent to hasEdge(edge, i, i).
hasEdge(EdgeI, int, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given edge from the ith copy of its source vertex to the jth copy of its target vertex in the traversal graph?
hashCode() - Method in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
 
hasInheritanceEdge(String, String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given inheritance edge in the traversal graph?
hasInheritanceEdge(String, String, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the ith copy of the given inheritance edge in the traversal graph?
hasInheritanceEdge(String, String, int, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the given inheritance edge from the ith copy of its source vertex to the jth copy of its target vertex in the traversal graph?
hasVertex(String) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the vertex labeled l in the traversal graph?
hasVertex(String, int) - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Is the ith copy of the vertex labeled l in the traversal graph?

I

IntercopyTableEntry - class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry.
 
isAlternationEdge() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
Is the edge an alternation (subclass) edge?
isConstructionEdge() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
Is the edge a construction (part) edge?
isInheritanceEdge() - Method in interface EDU.neu.ccs.demeter.aplib.EdgeI
Is the edge an inheritance (superclass) edge?

M

meetsConstraint(int, EdgeI, NameMapI) - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
Does the edge in the class graph meet the constraint on the ith strategy edge, given the name map? The name map is a total map and maps labels in the strategy graph to labels in the class graph.

N

NameMapI - interface EDU.neu.ccs.demeter.aplib.NameMapI.
A map from labels in a StrategyGraphI to labels in a ClassGraphI.
numEdges() - Method in interface EDU.neu.ccs.demeter.aplib.StrategyGraphI
The number of edges in the strategy graph.

S

source - Variable in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
 
source() - Method in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
The copy index of the source of the edge.
StrategyGraphI - interface EDU.neu.ccs.demeter.aplib.StrategyGraphI.
A directed graph whose vertices are uniquely labeled with strings and whose edges are uniquely labeled with consecutive ints starting from 0.

T

target - Variable in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
 
target() - Method in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
The copy index of the target of the edge.
toString() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
A string representation of the graph.
toString() - Method in class EDU.neu.ccs.demeter.aplib.IntercopyTableEntry
 
TraversalGraph - class EDU.neu.ccs.demeter.aplib.TraversalGraph.
 
TraversalGraph(ClassGraphI, StrategyGraphI, NameMapI) - Constructor for class EDU.neu.ccs.demeter.aplib.TraversalGraph
Compute the traversal graph for the class graph and strategy graph with the given map, which is a partial map from labels in the strategy graph to labels in the class graph.
TraversalGraph(ClassGraphI, StrategyGraphI, NameMapI, boolean) - Constructor for class EDU.neu.ccs.demeter.aplib.TraversalGraph
 

V

vertices() - Method in class EDU.neu.ccs.demeter.aplib.TraversalGraph
Deprecated. Renamed to getVertices() to comply with bean naming convention.
C E G H I M N S T V