From 7587f7a97ca6cd0d0736e0a3307497a6e16dfaff Mon Sep 17 00:00:00 2001
From: Simon Barner <barner@fortiss.org>
Date: Tue, 5 Dec 2017 13:22:42 +0000
Subject: [PATCH] Avoid warning
---
.../sysmodel/arch/taskgraph/AcyclicTaskGraph.java | 14 +++++---------
1 file changed, 5 insertions(+), 9 deletions(-)
diff --git a/org.fortiss.af3.exploration.alg/trunk/src/org/fortiss/af3/exploration/alg/dse/sysmodel/arch/taskgraph/AcyclicTaskGraph.java b/org.fortiss.af3.exploration.alg/trunk/src/org/fortiss/af3/exploration/alg/dse/sysmodel/arch/taskgraph/AcyclicTaskGraph.java
index 089a6fd6..3ba439ef 100644
--- a/org.fortiss.af3.exploration.alg/trunk/src/org/fortiss/af3/exploration/alg/dse/sysmodel/arch/taskgraph/AcyclicTaskGraph.java
+++ b/org.fortiss.af3.exploration.alg/trunk/src/org/fortiss/af3/exploration/alg/dse/sysmodel/arch/taskgraph/AcyclicTaskGraph.java
@@ -32,12 +32,9 @@ import org.jgrapht.alg.interfaces.MinimumSpanningTree;
import org.jgrapht.graph.ListenableDirectedWeightedGraph;
/**
- * Creates a Directed acyclic task graph of all the {@link IDeployableComponentAdapter}s.
- * <li>Each
- * {@link ISignalAdapter} is examined:</li>
- * <li>If there exists no path between a target of the
- * {@link ISignalAdapter} and it source, add an edge to the {@link DefaultTaskGraph}.</li>
- * <li>
+ * Creates a Directed acyclic task graph of all the {@link IDeployableComponentAdapter}s. <li>Each
+ * {@link ISignalAdapter} is examined:</li> <li>If there exists no path between a target of the
+ * {@link ISignalAdapter} and it source, add an edge to the {@link DefaultTaskGraph}.</li> <li>
* Otherwise, a loop is detected. Then, the detected loop is cut either by not adding the edge (if
* the source vertex is strongly causal) or by removing an edge between the vertices (i.e.
* {@link IDeployableComponentAdapter}s) that are closest to the current {@link ISignalAdapter} by
@@ -86,7 +83,6 @@ public class AcyclicTaskGraph extends DefaultTaskGraph implements TaskGraph {
}
/** {@inheritDoc} */
- @SuppressWarnings("unchecked")
@Override
public AcyclicTaskGraph copy() {
AcyclicTaskGraph clonedTaskGraph;
@@ -110,8 +106,8 @@ public class AcyclicTaskGraph extends DefaultTaskGraph implements TaskGraph {
* Transforms all existing {@link TaskGraph}s of {@code this} {@link TaskGraphEncoding} into
* {@link AcyclicTaskGraph}s.
*/
- public static <T extends TaskGraph> Collection<AcyclicTaskGraph>
- transformToAcyclicGraphs(Collection<T> cyclicTGs) {
+ public static <T extends TaskGraph> Collection<AcyclicTaskGraph> transformToAcyclicGraphs(
+ Collection<T> cyclicTGs) {
Collection<AcyclicTaskGraph> acyclicTGCollection = new ArrayList<>();
for(TaskGraph tg : cyclicTGs) {
AcyclicTaskGraph acycTG = new AcyclicTaskGraph(tg);
--
GitLab