digilist / dependency-graph

src/DependencyGraph.php

Doc Comments +2 added lines, -2 removed lines

@@ -129,8 +129,8 @@
      * Inner recursive function.
      *
      * @param DependencyNode $rootNode
-     * @param ArrayObject|DependencyNode[] $resolved
-     * @param ArrayObject|DependencyNode[]  $seen
+     * @param ArrayObject $resolved
+     * @param ArrayObject  $seen
      * @return ArrayObject|DependencyNode[]
      * @throws \Exception
      */

Spacing +1 added lines, -1 removed lines

@@ -118,7 +118,7 @@
             throw new CircularDependencyException();
         }
 
-        $resolvedElements = array_map(function (DependencyNode $node) {
+        $resolvedElements = array_map(function(DependencyNode $node) {
             return $node->getElement();
         }, $resolved->getArrayCopy());
 

src/Tests/DependencyGraphTest.php

Indentation +6 added lines, -6 removed lines

@@ -187,12 +187,12 @@
         $graph->resolve();
     }
 
-	/**
-	 * Tests whether a circular dependency is detected for a->b b->a.
-	 *
-	 * @expectedException Digilist\DependencyGraph\CircularDependencyException
-	 * @test
-	 */
+    /**
+     * Tests whether a circular dependency is detected for a->b b->a.
+     *
+     * @expectedException Digilist\DependencyGraph\CircularDependencyException
+     * @test
+     */
     public function testCircularDependencyException2()
     {
         $graph = new DependencyGraph();