source code formatting.

[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 d18db7994bdb33a7832815afe2506d066916b3cd..3321bf926e11408f8b07c6bd594f77f7122e2ed0 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
@@ -1,67 +1,85 @@
 /*
  * Copyright 2008 the original author or authors.
- * 
+ *
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
  * You may obtain a copy of the License at
- * 
+ *
  *      http://www.apache.org/licenses/LICENSE-2.0
- * 
+ *
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS,
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ 
+ */
 package org.wamblee.system.graph.component;
 
-import java.util.ArrayList;
-import java.util.List;
-
 import org.wamblee.system.core.SystemAssemblyException;
 import org.wamblee.system.graph.Edge;
 import org.wamblee.system.graph.Graph;
 import org.wamblee.system.graph.Node;
 import org.wamblee.system.graph.Visitor;
 
+import java.util.ArrayList;
+import java.util.List;
+
+
 /**
  * Checks whether the given component graph can be started in component
- * order without any missing dependencies. 
- * @author Erik Brakkee
+ * order without any missing dependencies.
  *
+ * @author Erik Brakkee
  */
 public class CheckStartupDependenciesVisitor implements Visitor {
-    
-    private Graph graph; 
-    private List<Node> available; 
+    /**
+     * DOCUMENT ME!
+     */
+    private Graph graph;
 
     /**
+     * DOCUMENT ME!
+     */
+    private List<Node> available;
+
+/**
      * Constructs the visitor. 
      * @param aGraph Graph. 
      */
-    public CheckStartupDependenciesVisitor(Graph aGraph) { 
-        graph = aGraph; 
-        available = new ArrayList<Node>();
+    public CheckStartupDependenciesVisitor(Graph aGraph) {
+        graph         = aGraph;
+        available     = new ArrayList<Node>();
     }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @param aEdge DOCUMENT ME!
+     */
     @Override
     public void visitEdge(Edge aEdge) {
         // Empty
     }
 
+    /**
+     * DOCUMENT ME!
+     *
+     * @param aNode DOCUMENT ME!
+     */
     @Override
     public void visitNode(Node aNode) {
         List<Edge> edges = graph.findOutgoing(aNode);
-        
+
         // check dependencies.
-        for (Edge edge: edges) { 
+        for (Edge edge : edges) {
             Node dep = edge.getTo();
-            if ( !available.contains(dep)) { 
-                throw new SystemAssemblyException(aNode + ": required dependency '" + dep + "' was not started");
+
+            if (!available.contains(dep)) {
+                throw new SystemAssemblyException(aNode
+                    + ": required dependency '" + dep + "' was not started");
             }
         }
-        
+
         available.add(aNode);
     }
-
 }