moditect#27 Formatting

gunnarmorling · Jan 24, 2019 · b46f323 · b46f323
1 parent 7bfae73
commit b46f323
Show file tree

Hide file tree

Showing 6 changed files with 5 additions and 9 deletions.
diff --git a/javac-plugin/src/main/java/org/moditect/deptective/internal/graph/GraphUtils.java b/javac-plugin/src/main/java/org/moditect/deptective/internal/graph/GraphUtils.java
@@ -29,7 +29,6 @@
 import org.moditect.deptective.internal.graph.impl.Tarjan;
 
 /**
- *
  * @author Gerd W&uuml;therich (gw@code-kontor.io)
  */
 public class GraphUtils {
@@ -40,7 +39,8 @@ public class GraphUtils {
      *
      * @param nodes the collection of nodes (the directed graph)
      * @return a list of strongly connected components (SCCs). Note that the result also contains components that
-     *         contain just a single node. If you want to detect 'real' cycle (size > 1) please use {@link GraphUtils#detectCycles(Collection)}.
+     *         contain just a single node. If you want to detect 'real' cycle (size > 1) please use
+     *         {@link GraphUtils#detectCycles(Collection)}.
      */
     public static List<List<Node>> detectStronglyConnectedComponents(Collection<Node> nodes) {
         return new Tarjan<Node>().detectStronglyConnectedComponents(Objects.requireNonNull(nodes));

diff --git a/javac-plugin/src/main/java/org/moditect/deptective/internal/graph/Node.java b/javac-plugin/src/main/java/org/moditect/deptective/internal/graph/Node.java
@@ -48,7 +48,8 @@ public Dependency getOutgoingDependencyTo(Node node) {
     }
 
     public Set<Dependency> getOutgoingDependenciesTo(Collection<Node> nodes) {
-        return Objects.requireNonNull(nodes).stream().map(node -> getOutgoingDependencyTo(node)).filter(dep -> dep != null)
+        return Objects.requireNonNull(nodes).stream().map(node -> getOutgoingDependencyTo(node))
+                .filter(dep -> dep != null)
                 .collect(Collectors.toSet());
     }
 

diff --git a/javac-plugin/src/test/java/org/moditect/deptective/internal/graph/CyclesTest.java b/javac-plugin/src/test/java/org/moditect/deptective/internal/graph/CyclesTest.java
@@ -22,7 +22,6 @@
 import org.junit.Test;
 
 /**
- * 
  * @author Gerd W&uuml;therich (gw@code-kontor.io)
  */
 public class CyclesTest {

diff --git a/...n/src/test/java/org/moditect/deptective/internal/graph/DependencyStructureMatrixTest.java b/...n/src/test/java/org/moditect/deptective/internal/graph/DependencyStructureMatrixTest.java
@@ -22,7 +22,6 @@
 import org.junit.Test;
 
 /**
- * 
  * @author Gerd W&uuml;therich (gw@code-kontor.io)
  */
 public class DependencyStructureMatrixTest {
@@ -41,7 +40,7 @@ public void detectCycle() {
                 nodes.get(0), nodes.get(1), nodes.get(2),
                 nodes.get(3)
         );
-        
+
         // assert upward dependencies
         assertThat(dsm.getUpwardDependencies()).hasSize(1)
                 .containsExactly(nodes.get(3).getOutgoingDependencyTo(nodes.get(2)));

diff --git a/...src/test/java/org/moditect/deptective/internal/graph/StronglyConnectedComponentsTest.java b/...src/test/java/org/moditect/deptective/internal/graph/StronglyConnectedComponentsTest.java
@@ -22,7 +22,6 @@
 import org.junit.Test;
 
 /**
- * 
  * @author Gerd W&uuml;therich (gw@code-kontor.io)
  */
 public class StronglyConnectedComponentsTest {

diff --git a/javac-plugin/src/test/java/org/moditect/deptective/internal/graph/TestModelCreator.java b/javac-plugin/src/test/java/org/moditect/deptective/internal/graph/TestModelCreator.java
@@ -23,13 +23,11 @@
 import org.moditect.deptective.internal.graph.Node;
 
 /**
- * 
  * @author Gerd W&uuml;therich (gw@code-kontor.io)
  */
 public class TestModelCreator {
 
     /**
-     * 
      * @return
      */
     public static List<Node> createDummyModel() {