Package | Description |
---|---|
cz.cuni.mff.corrector.corrector |
Implementations of correction algorithms.
|
cz.cuni.mff.corrector.execution |
Supporting classes for corrector implementations.
|
cz.cuni.mff.corrector.graph |
Correction multigraphs implementation.
|
cz.cuni.mff.corrector.intent |
Correction intents implementation.
|
Modifier and Type | Method and Description |
---|---|
protected Vertex |
Handler.selectAnyVertex()
Returns some reached vertex from the set of reached vertices.
|
protected Vertex |
Handler.selectCheapestVertex()
Returns the first reached vertex with the lowest cost.
|
Modifier and Type | Method and Description |
---|---|
void |
Handler.dispatchStandardRequests(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Dispatches all requests to the standard execution processing.
|
protected void |
Handler.handleInvokingMultiple(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Processes exploration and invoked evaluation of all allowed intents.
|
protected void |
Handler.handleInvokingSingle(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Processes exploration and invoked evaluation of all allowed intents.
|
protected void |
Handler.handleNestingSingle(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Processes exploration and nested evaluation of all allowed intents.
|
protected void |
Handler.handleSchedulingMultiple(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Processes exploration and scheduled evaluation of all allowed intents.
|
protected void |
Handler.handleSchedulingSingle(Vertex selectedVertex,
java.util.List<Intent> nestedIntents)
Processes exploration and scheduled evaluation of all allowed intents.
|
protected void |
Handler.processCompleteVertex(Record reportData,
Vertex selectedVertex)
Processes the complete vertex using the iterative strategy.
|
protected void |
Handler.processIncompleteVertex(Record reportData,
Vertex selectedVertex)
Processes the incomplete vertex using the iterative strategy.
|
protected void |
Handler.processSelectedVertex(Vertex selectedVertex)
Performs or starts the further exploration of the selected vertex.
|
protected Record |
Handler.resolveVertexReport(Vertex inspectedVertex)
Computes the full report for the given reached vertex.
|
protected boolean |
Handler.shouldFixateCost(Vertex selectedVertex)
Detects if the final cost should be fixed during the exploration.
|
Modifier and Type | Field and Description |
---|---|
Vertex |
Record.associatedVertex
Reference to the associated vertex object.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Variables.getReachedVertex()
Returns the first (some) reached vertex.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Vertex> |
Variables.getReachedVertices()
Returns all the stored reached vertices.
|
Modifier and Type | Method and Description |
---|---|
void |
Variables.addReachedVertex(Vertex reachedVertex)
Inserts the given vertex into the list of reached vertices.
|
boolean |
Variables.hasReachedVertex(Vertex inspectedVertex)
Detects whether the given vertex is stored in the reached vertices.
|
void |
Variables.removeReachedVertex(Vertex reachedVertex)
Removes the given vertex from the list of reached vertices.
|
Constructor and Description |
---|
Record(Vertex associatedVertex)
Creates a new and empty instance of the report.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Edge.getSourceVertex()
Returns the source vertex reference.
|
Vertex |
Edge.getTargetVertex()
Returns the target vertex reference.
|
Vertex |
Graph.getTargetVertex(java.lang.String automatonState)
Attempts to fetch the existing vertex from the last stratum.
|
Vertex |
Graph.getVertexItem(java.lang.Integer stratumNumber,
java.lang.String automatonState)
Attempts to fetch the existing vertex from the multigraph.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Vertex> |
Graph.getGraphVertices()
Returns the set of all vertices in the multigraph.
|
Modifier and Type | Method and Description |
---|---|
void |
Graph.addNewVertex(Vertex newVertex)
Adds a new vertex into the multigraph.
|
void |
Graph.addTracingEdge(Vertex graphVertex,
Edge precedingEdge)
Adds a new preceding edge into the set of a given base vertex.
|
void |
Graph.clearTracingEdges(Vertex graphVertex)
Clears the existing set of preceding edges.
|
int |
Graph.ReachedVerticesComparator.compare(Vertex o1,
Vertex o2) |
int |
Vertex.compareTo(Vertex v) |
protected void |
Graph.generateShortestPaths(java.util.List<java.util.List<Edge>> outputSet,
Vertex targetVertex)
Generates all shortest paths ending in the specified target vertex.
|
java.util.Set<Edge> |
Graph.getIngoingEdges(Vertex baseVertex)
Returns the set of all edges ingoing to the specified vertex.
|
java.util.Set<Edge> |
Graph.getOutgoingEdges(Vertex baseVertex)
Returns the set of all edges outgoing from the specified vertex.
|
java.lang.Integer |
Graph.getTracingCost(Vertex graphVertex)
Returns the cost of shortest paths leading to the given vertex.
|
java.util.Set<Edge> |
Graph.getTracingEdges(Vertex graphVertex)
Returns the set of preceding edges on shortest paths.
|
boolean |
Graph.hasVertexItem(Vertex inspectedVertex)
Detects whether the given vertex is already in the multigraph.
|
void |
Graph.initTracingEdges(Vertex graphVertex)
Creates a new empty set of preceding edges and replaces the original.
|
void |
Graph.removeTracingEdges(Vertex graphVertex)
Completely removes the set of preceding edges.
|
void |
Graph.setTracingCost(Vertex graphVertex,
java.lang.Integer newCost)
Sets a new path cost value for a given vertex.
|
void |
Graph.setTracingEdges(Vertex graphVertex,
java.util.Set<Edge> prevEdges)
Sets the new set of preceding edges on shortest paths.
|
Constructor and Description |
---|
Edge(Vertex sourceVertex,
Vertex targetVertex,
Intent correctionIntent)
Deprecated.
Only for testing purposes only!
|
Modifier and Type | Field and Description |
---|---|
protected Vertex |
Intent.endingVertex
Pair of the ending stratum number and automaton state.
|
protected Vertex |
Intent.initialVertex
Pair of the initial stratum number and automaton state.
|
Modifier and Type | Method and Description |
---|---|
Vertex |
Intent.getEndingVertex()
Returns the pair of the ending stratum number and automaton state.
|
Vertex |
Intent.getInitialVertex()
Returns the pair of the initial stratum number and automaton state.
|
Constructor and Description |
---|
Intent(Node baseNode,
NodeRepair nodeRepair,
Vertex initialVertex,
Vertex endingVertex,
java.util.List<Node> nodeSequence,
Context grammarContext,
java.util.List<Context> contextChain)
Creates a new instance of the correction intent.
|
IntentDelete(Node baseNode,
Vertex initialVertex,
Vertex endingVertex,
java.util.List<Node> nodeSequence,
Context grammarContext)
Creates a new instance of the delete correction intent.
|
IntentInsert(Vertex initialVertex,
Vertex endingVertex,
Context grammarContext,
java.util.List<Context> contextChain,
java.lang.String nodeLabel)
Creates a new instance of the insert correction intent.
|
IntentRename(Node baseNode,
Vertex initialVertex,
Vertex endingVertex,
java.util.List<Node> nodeSequence,
Context grammarContext,
java.lang.String nodeLabel)
Creates a new instance of the rename correction intent.
|
IntentRepair(Node baseNode,
Vertex initialVertex,
Vertex endingVertex,
java.util.List<Node> nodeSequence,
Context grammarContext)
Creates a new instance of the repair correction intent.
|