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.repair |
Objects for encapsulating computed repairs.
|
Modifier and Type | Method and Description |
---|---|
protected Edge |
Handler.doEdgeOpening(Intent nestedIntent)
Opens the exploration of a newly reached edge and its intent.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.List<Edge> |
Handler.doEdgesOpening(java.util.List<Intent> nestedIntents)
Opens the exploration of edges for the entire set of intents.
|
Modifier and Type | Method and Description |
---|---|
protected Repair |
Handler.acquireSchedulingSingle(Requests requestsData,
Intent nestedIntent,
Edge nestedEdge)
Fetches the required repair or requests its scheduled execution.
|
protected void |
Handler.doEdgeClosing(Edge nestedEdge,
Repair nestedRepair)
Closes the exploration of a given edge and its correction intent.
|
protected void |
Handler.handleSchedulingSingle(Requests requestsData,
Edge nestedEdge)
Processes exploration and scheduled evaluation of the given intent.
|
protected Quota |
Handler.resolveGrantedQuota(Edge nestedEdge,
int allowedRise)
Prepares the quota object to be assigned to the given task.
|
protected void |
Handler.scheduleStandardExtended(Requests requestsData,
Task nestedTask,
Edge nestedEdge)
Activates the particular scheduled task.
|
protected void |
Handler.scheduleStandardSimple(Requests requestsData,
Task nestedTask,
Edge nestedEdge)
Activates the particular scheduled task.
|
protected void |
Handler.updatePathsTracing(Edge inspectedEdge)
Updates records about paths to the target vertex of the provided edge.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.List<Repair> |
Handler.acquireSchedulingMultiple(Requests requestsData,
java.util.List<Intent> nestedIntents,
java.util.List<Edge> nestedEdges)
Fetches the required repairs or requests their scheduled execution.
|
void |
Handler.dispatchIterativeRequests(java.util.List<Edge> nestedEdges,
java.util.List<Task> nestedTasks,
java.util.List<Quota> nestedQuotas)
Dispatches all requests to the iterative refinement processing.
|
Modifier and Type | Field and Description |
---|---|
java.util.Set<Edge> |
Record.delayedEdges
Prepared set of edges to be delayed.
|
java.util.List<Edge> |
Requests.preparedEdges
List of postponed and not yet evaluated edges and their intents.
|
java.util.List<Edge> |
Record.promisingEdges
Prepared set of open edges having the minimal cost over them.
|
java.util.List<Edge> |
Requests.requestedEdges
List of requested nested edges during the last execution.
|
java.util.Set<Edge> |
Record.tracingEdges
Prepared set of predecessor edges on shortest paths.
|
java.util.Set<Edge> |
Record.uselessEdges
Prepared set of edges that are closed or open but not to be delayed.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Edge> |
Variables.getDelayedEdges()
Returns the internal container with delayed and not yet closed edges.
|
Modifier and Type | Method and Description |
---|---|
void |
Variables.addDelayedEdge(Edge delayedEdge)
Adds a new edge to the container of delayed edges.
|
void |
Variables.removeDelayedEdge(Edge delayedEdge)
Removes the selected edge from the container of delayed edges.
|
Modifier and Type | Method and Description |
---|---|
void |
Variables.addDelayedEdges(java.util.Collection<Edge> delayedEdges)
Adds all provided edges to the container of delayed edges.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<java.util.List<Edge>> |
Graph.fetchShortestPaths()
Generates the set of all shortest paths in the aggregated multigraph.
|
java.util.Set<Edge> |
Graph.getGraphEdges()
Returns the set of all edges in the multigraph.
|
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.util.Set<Edge> |
Graph.getTracingEdges(Vertex graphVertex)
Returns the set of preceding edges on shortest paths.
|
Modifier and Type | Method and Description |
---|---|
void |
Graph.addNewEdge(Edge newEdge)
Adds a new edge into the multigraph.
|
void |
Graph.addTracingEdge(Vertex graphVertex,
Edge precedingEdge)
Adds a new preceding edge into the set of a given base vertex.
|
int |
Edge.compareTo(Edge e) |
java.lang.Integer |
Graph.getResolvedCost(Edge inspectedEdge)
Returns the computed cost to the target vertex using this edge only.
|
java.lang.Integer |
Graph.getTracedCost(Edge inspectedEdge)
Returns the stored tracing cost for the target vertex of the edge.
|
Modifier and Type | Method and Description |
---|---|
int |
Graph.PathsComparator.compare(java.util.List<Edge> p1,
java.util.List<Edge> p2) |
int |
Graph.PathsComparator.compare(java.util.List<Edge> p1,
java.util.List<Edge> p2) |
protected void |
Graph.generateShortestPaths(java.util.List<java.util.List<Edge>> outputSet,
Vertex targetVertex)
Generates all shortest paths ending in the specified target vertex.
|
void |
Graph.setTracingEdges(Vertex graphVertex,
java.util.Set<Edge> prevEdges)
Sets the new set of preceding edges on shortest paths.
|
Modifier and Type | Method and Description |
---|---|
protected void |
Repair.gatherInvolvedRepairs(java.util.Map<java.lang.String,Repair> nestedRepairs,
java.util.List<java.util.List<Edge>> shortestPaths)
Collects all nested intent repairs that are involved in shortest paths.
|
protected void |
Repair.printPathsDump(java.lang.String indentPrefix,
java.util.List<java.util.List<Edge>> shortestPaths)
Prints the list of all provided paths.
|