removed dogano/php-util dependency

doganoo · Jun 10, 2018 · 5f361a2 · 5f361a2
1 parent 867e156
commit 5f361a2
Show file tree

Hide file tree

Showing 5 changed files with 3 additions and 31 deletions.
diff --git a/composer.json b/composer.json
@@ -16,8 +16,5 @@
   },
   "require-dev": {
     "phpunit/phpunit": "6.5"
-  },
-  "require": {
-    "doganoo/php-util": "0.0.1"
   }
 }
diff --git a/src/Common/Abstracts/AbstractGraphSearch.php b/src/Common/Abstracts/AbstractGraphSearch.php
@@ -28,7 +28,6 @@
 
 use doganoo\PHPAlgorithms\Datastructure\Graph\Graph\Node;
 use doganoo\PHPAlgorithms\Datastructure\Lists\ArrayLists\ArrayList;
-use doganoo\PHPUtil\Log\Logger;
 
 /**
  * Class AbstractTraverse
@@ -44,7 +43,7 @@ abstract class AbstractGraphSearch {
     public function __construct() {
         $this->visited = new ArrayList();
         $this->callable = function ($value) {
-            Logger::debug($value);
+            echo $value;
         };
     }
 
@@ -62,7 +61,7 @@ public function visit($value) {
         if (null === $this->callable
             && !\is_callable($this->callable)) {
             $callable = function ($otherValue) {
-                Logger::debug($otherValue);
+                echo $otherValue;
             };
         }
         $callable($value);

diff --git a/src/Common/Abstracts/AbstractTraverse.php b/src/Common/Abstracts/AbstractTraverse.php
@@ -27,7 +27,6 @@
 
 
 use doganoo\PHPAlgorithms\Common\Interfaces\IBinaryNode;
-use doganoo\PHPUtil\Log\Logger;
 
 /**
  * Class AbstractTraverse
@@ -57,7 +56,7 @@ public function visit($value) {
         if (null === $this->callable
             && !\is_callable($this->callable)) {
             $callable = function ($otherValue) {
-                Logger::debug($otherValue);
+                echo $otherValue;
             };
         }
         $callable($value);

diff --git a/src/Datastructure/Graph/Tree/Heap/MaxHeap.php b/src/Datastructure/Graph/Tree/Heap/MaxHeap.php
@@ -26,7 +26,6 @@
 namespace doganoo\PHPAlgorithms\Datastructure\Graph\Tree\Heap;
 
 use doganoo\PHPAlgorithms\Common\Util\Comparator;
-use doganoo\PHPUtil\Log\Logger;
 
 /**
  * Class MaxHeap
@@ -63,16 +62,6 @@ public function clear(): bool {
         return \count($this->heap) === 1 && $this->heap[0] == \PHP_INT_MIN;
     }
 
-    /**
-     * displays the heap
-     */
-    public function display() {
-        for ($i = 1; $i <= $this->length() / 2; $i++) {
-            $string = "Parent Node: " . $this->heap[$i] . " Left Child: " . $this->heap[2 * $i] . " Right Child: " . $this->heap[2 * $i + 1];
-            Logger::debug($string);
-        }
-    }
-
     /**
      * returns the number of elements in the heap
      *

diff --git a/src/Datastructure/Graph/Tree/Heap/MinHeap.php b/src/Datastructure/Graph/Tree/Heap/MinHeap.php
@@ -26,8 +26,6 @@
 namespace doganoo\PHPAlgorithms\Datastructure\Graph\Tree\Heap;
 
 use doganoo\PHPAlgorithms\Common\Util\Comparator;
-use doganoo\PHPUtil\Log\Logger;
-
 
 /**
  * Class MinHeap
@@ -64,16 +62,6 @@ public function clear(): bool {
         return \count($this->heap) === 1 && $this->heap[0] === \PHP_INT_MIN;
     }
 
-    /**
-     * displays the heap
-     */
-    public function display() {
-        for ($i = 1; $i <= $this->length() / 2; $i++) {
-            $string = "Parent Node: " . $this->heap[$i] . " Left Child: " . $this->heap[2 * $i] . " Right Child: " . $this->heap[2 * $i + 1];
-            Logger::debug($string);
-        }
-    }
-
     /**
      * returns the number of elements in the heap
      *