git://wamblee.org
/
utils
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
[maven-release-plugin] prepare for next development iteration
[utils]
/
system
/
general
/
src
/
main
/
java
/
org
/
wamblee
/
system
/
graph
/
component
/
CheckStartupDependenciesVisitor.java
diff --git
a/system/general/src/main/java/org/wamblee/system/graph/component/CheckStartupDependenciesVisitor.java
b/system/general/src/main/java/org/wamblee/system/graph/component/CheckStartupDependenciesVisitor.java
index 5b50e0925c0b57ce16f3796d2651133a2f9b0ee6..d18db7994bdb33a7832815afe2506d066916b3cd 100644
(file)
--- a/
system/general/src/main/java/org/wamblee/system/graph/component/CheckStartupDependenciesVisitor.java
+++ b/
system/general/src/main/java/org/wamblee/system/graph/component/CheckStartupDependenciesVisitor.java
@@
-24,14
+24,24
@@
import org.wamblee.system.graph.Graph;
import org.wamblee.system.graph.Node;
import org.wamblee.system.graph.Visitor;
import org.wamblee.system.graph.Node;
import org.wamblee.system.graph.Visitor;
+/**
+ * Checks whether the given component graph can be started in component
+ * order without any missing dependencies.
+ * @author Erik Brakkee
+ *
+ */
public class CheckStartupDependenciesVisitor implements Visitor {
public class CheckStartupDependenciesVisitor implements Visitor {
- private Graph _graph;
- private List<Node> _available;
-
+ private Graph graph;
+ private List<Node> available;
+
+ /**
+ * Constructs the visitor.
+ * @param aGraph Graph.
+ */
public CheckStartupDependenciesVisitor(Graph aGraph) {
public CheckStartupDependenciesVisitor(Graph aGraph) {
-
_
graph = aGraph;
-
_
available = new ArrayList<Node>();
+ graph = aGraph;
+ available = new ArrayList<Node>();
}
@Override
}
@Override
@@
-41,17
+51,17
@@
public class CheckStartupDependenciesVisitor implements Visitor {
@Override
public void visitNode(Node aNode) {
@Override
public void visitNode(Node aNode) {
- List<Edge> edges =
_
graph.findOutgoing(aNode);
+ List<Edge> edges = graph.findOutgoing(aNode);
// check dependencies.
for (Edge edge: edges) {
Node dep = edge.getTo();
// check dependencies.
for (Edge edge: edges) {
Node dep = edge.getTo();
- if ( !
_
available.contains(dep)) {
+ if ( !available.contains(dep)) {
throw new SystemAssemblyException(aNode + ": required dependency '" + dep + "' was not started");
}
}
throw new SystemAssemblyException(aNode + ": required dependency '" + dep + "' was not started");
}
}
-
_
available.add(aNode);
+ available.add(aNode);
}
}
}
}