Uses of Class
org.quilt.graph.Vertex

Packages that use Vertex

org.quilt.cl
org.quilt.cover.stmt
org.quilt.graph

Uses of Vertex in org.quilt.cl

Subclasses of Vertex in org.quilt.cl

class

CodeVertex A Vertex extended to carry the initial bytecode offset, line number, and an instruction list.

Fields in org.quilt.cl declared as Vertex

Vertex	CatchData.tryStart First code vertex in try block.
Vertex	CatchData.tryEnd Last code Vertex in try block.
Vertex	CatchData.handlerPC First code vertex in handler.

Methods in org.quilt.cl with parameters of type Vertex

void	GraphTalker.discoverVertex(Vertex v)
void	GraphTalker.finishVertex(Vertex v)
void	BytecodeCollector.discoverVertex(Vertex vtx) Action taken upon beginning to visit a graph vertex.
void	BytecodeCollector.finishVertex(Vertex vtx) Action taken before leaving a vertex in the graph.

Constructors in org.quilt.cl with parameters of type Vertex

CatchData(Vertex start, Vertex end, Vertex handler, org.apache.bcel.generic.ObjectType exc)
The information needed to set up an exception handler.

CatchData(Vertex start, Vertex end, Vertex handler, org.apache.bcel.generic.ObjectType exc)
The information needed to set up an exception handler.

CatchData(Vertex start, Vertex end, Vertex handler, org.apache.bcel.generic.ObjectType exc)
The information needed to set up an exception handler.

Uses of Vertex in org.quilt.cover.stmt

Subclasses of Vertex in org.quilt.cover.stmt

class

CounterVertex A CodeVertex which carries counter instrumentation and a label.

Uses of Vertex in org.quilt.graph

Subclasses of Vertex in org.quilt.graph

class	Entry The entry vertex in a directed graph.
class	Exit An exit vertex in a directed graph.

Fields in org.quilt.graph declared as Vertex

protected Vertex	Edge.source_
protected Vertex	Edge.target_

Methods in org.quilt.graph that return Vertex

Vertex	BinaryConnector.getTarget() Get the target of the preferred edge.
Vertex	BinaryConnector.getOtherTarget() Get the target of the other edge
Vertex	UnaryConnector.getTarget() Get the target of the connection.
Vertex	Exit.getTarget() Get its target.
Vertex	MultiConnector.getTarget()
Vertex	MultiConnector.getTarget(int n)
Vertex	ComplexConnector.getTarget() Get the target of the single edge.
Vertex	ComplexConnector.getTarget(int n) Get the target of the Nth edge.
Vertex	Edge.getSource()
Vertex	Edge.getTarget()
abstract Vertex	Connector.getTarget() Get the target of the preferred edge.
protected Vertex	Directed.insertVertex(Vertex v, Edge e) Insert a (new) Vertex into the graph along the edge provided.
Vertex	Directed.insertVertex(Edge e) Create a new Vertex with a Unary connector and insert into this graph's edge e.
Vertex	Vertex.getTarget()
Vertex	Entry.getTarget()

Methods in org.quilt.graph with parameters of type Vertex

void	BinaryConnector.setTarget(Vertex v) Change the target of the preferred edge.
void	BinaryConnector.setOtherTarget(Vertex v) Set the target of the other edge.
void	UnaryConnector.setTarget(Vertex v) Set the target of the connection.
void	Visitor.discoverVertex(Vertex vertex) Called when beginning visit to vertex.
void	Visitor.finishVertex(Vertex vertex) Called at end of vertex visit.
void	Exit.setTarget(Vertex v) Set its target.
void	MultiConnector.setTarget(Vertex v)
void	MultiConnector.setTarget(Vertex v, int n)
void	ComplexConnector.setTarget(Vertex v) Change the target of the single edge.
void	ComplexConnector.setTarget(Vertex v, int n) Change the target of the Nth edge.
void	Edge.setSource(Vertex v)
void	Edge.setTarget(Vertex v) Change the target of this edge.
void	Edge.insert(Vertex v) Insert a vertex with a UnaryConnector into an edge.
abstract void	Connector.setTarget(Vertex v) Set the target of the connector's preferred edge.
int	Directed.anotherVertex(Vertex v) Step count of vertices .
protected Vertex	Directed.insertVertex(Vertex v, Edge e) Insert a (new) Vertex into the graph along the edge provided.
void	Entry.setTarget(Vertex v)

Constructors in org.quilt.graph with parameters of type Vertex

Edge(Vertex s, Vertex t)
An edge in a directed graph.

Edge(Vertex s, Vertex t)
An edge in a directed graph.