seboettg / Forest

src/Visitor/PostOrderVisitor.php

Spacing +1 added lines, -1 removed lines

@@ -33,7 +33,7 @@
     {
         $resultList = new ArrayList();
         if ($node !== null) {
-            foreach($node->getChildren() as $child) {
+            foreach ($node->getChildren() as $child) {
                 $resultList->merge($child->accept($this));
             }
             $resultList->append($node->getItem());

src/Visitor/PreOrderVisitor.php

Spacing +1 added lines, -1 removed lines

@@ -33,7 +33,7 @@
         $resultList = new ArrayList();
         if ($node !== null) {
             $resultList->append($node->getItem());
-            foreach($node->getChildren() as $child) {
+            foreach ($node->getChildren() as $child) {
                 $resultList->merge($child->accept($this));
             }
         }

src/Item/StringItem.php

Spacing +1 added lines, -1 removed lines

@@ -47,7 +47,7 @@
 
     public function __toString()
     {
-        return (string)$this->value;
+        return (string) $this->value;
     }
 
     /**

src/Visitor/InOrderVisitor.php

Spacing +1 added lines, -1 removed lines

@@ -31,7 +31,7 @@
     public function visit(TreeNodeInterface $node): ArrayListInterface
     {
         if (!$node instanceof BinaryNodeInterface) {
-            throw new InvalidArgumentException(BinaryNodeInterface::class . " expected, got " . get_class($node) . ".");
+            throw new InvalidArgumentException(BinaryNodeInterface::class." expected, got ".get_class($node).".");
         }
         $resultList = new ArrayList();
         if ($node !== null) {

examples/generalTree.php

Spacing +3 added lines, -3 removed lines

@@ -28,7 +28,7 @@ 
             ->child(5)
             ->child(6)
         ->endSubTree();
-echo $tree->count() . " items added to tree\n";
+echo $tree->count()." items added to tree\n";
 
 $rootNode = $tree->getRoot();
 
@@ -39,7 +39,7 @@ 
     echo "no leaf node\n";
 }
 
-echo "2. child of root has a height of " . $rootNode->getChildren()[1]->getHeight() . "\n";
+echo "2. child of root has a height of ".$rootNode->getChildren()[1]->getHeight()."\n";
 
 echo "Values of level 3 nodes: ";
 foreach ($rootNode->getChildren() as $lev1) {
@@ -47,7 +47,7 @@ 
         foreach ($lev1->getChildren() as $lev2) {
             if (count($lev2->getChildren()) > 0) {
                 foreach ($lev2->getChildren() as $lev3) {
-                    echo $lev3->getItem()->getValue() . " ";
+                    echo $lev3->getItem()->getValue()." ";
                 }
             }
         }

examples/bst/AddressBookEntry.php

Spacing +1 added lines, -1 removed lines

@@ -41,7 +41,7 @@
 
     public function getCompareValue()
     {
-        return $this->lastName . "," . $this->firstName;
+        return $this->lastName.",".$this->firstName;
     }
 
     /**

examples/bst/addressBookSearch.php

Spacing +4 added lines, -4 removed lines

@@ -47,8 +47,8 @@
     echo "No entry found\n";
 } else {
     $searchResultItem = $result->getItem();
-    echo $searchResultItem->getLastName() . ", " . $searchResultItem->getFirstName() . "\n";
-    echo $searchResultItem->getAddress() . "\n";
-    echo "Phone No.: " . $searchResultItem->getPhoneNumber() . "\n";
+    echo $searchResultItem->getLastName().", ".$searchResultItem->getFirstName()."\n";
+    echo $searchResultItem->getAddress()."\n";
+    echo "Phone No.: ".$searchResultItem->getPhoneNumber()."\n";
 }
-echo "Time to search with $dataStructure: " . sprintf("%1.2E", $time) . "\n";
+echo "Time to search with $dataStructure: ".sprintf("%1.2E", $time)."\n";

src/BinaryTree.php

Spacing +2 added lines, -2 removed lines

@@ -202,7 +202,7 @@ 
         $tmp = $node;
         $cmp = $node->getItem()->compareTo($item);
         $child = null;
-        switch($cmp) {
+        switch ($cmp) {
             case -1:
                 $child = $node->getRight();
                 break;
@@ -242,7 +242,7 @@ 
             } else { // left and right?
                 $tmp = $node->getRight(); //keep right in mind
                 $leftMostLeaf = $this->getLeftMostLeaf($tmp); // get the leftmost leaf of the right subtree
-                $leftMostLeaf->setLeft($node->getLeft());  // append the left subtree to the leftmost leaf of the right subtree
+                $leftMostLeaf->setLeft($node->getLeft()); // append the left subtree to the leftmost leaf of the right subtree
                 $node = $tmp;
             }
         }

src/AVLTree.php

Spacing +1 added lines, -1 removed lines

@@ -125,7 +125,7 @@
                 $tmp = $node->getRight(); //keep right in mind
                 $this->rebalance($node->getItem(), $tmp);
                 $leftMostLeaf = $this->getLeftMostLeaf($tmp); // get the leftmost leaf of the right subtree
-                $leftMostLeaf->setLeft($node->getLeft());  // append the left subtree to the leftmost leaf of the right subtree
+                $leftMostLeaf->setLeft($node->getLeft()); // append the left subtree to the leftmost leaf of the right subtree
                 $node = $tmp;
             }
         }