SiroDiaz / DataStructures

DataStructures/Lists/CircularLinkedList.php

Doc Comments +2 added lines, -3 removed lines

@@ -89,7 +89,6 @@ 
     /**
      * Add a new node in the specified index.
      *
-     * @param integer $index the position.
      * @param mixed $data the data to be stored.
      */
     private function insertEnd($data) {
@@ -133,7 +132,7 @@ 
     /**
      * Adds at the beginning a node in the list.
      *
-     * @param mixed $data
+     * @param integer $data
      * @return mixed the data stored.
      */
     public function unshift($data) {
@@ -186,7 +185,7 @@ 
     /**
      * Generator for retrieve all nodes stored.
      * 
-     * @return null if the head is null (or list is empty)
+     * @return \Generator if the head is null (or list is empty)
      */
     public function getAll() {
         if($this->head === null) {

Unused Use Statements -1 removed lines

@@ -11,7 +11,6 @@
 use DataStructures\Lists\Nodes\SimpleLinkedListNode as Node;
 use DataStructures\Lists\Interfaces\ListInterface;
 use OutOfBoundsException;
-use Iterator;
 
 /**
  * CircularLinkedList

DataStructures/Lists/DoublyLinkedList.php

Doc Comments +2 added lines, -2 removed lines

@@ -90,7 +90,7 @@ 
     /**
      * Generator for retrieve all nodes stored.
      * 
-     * @return null if the head is null (or list is empty)
+     * @return \Generator if the head is null (or list is empty)
      */
     public function getAll() {
         if($this->head === null) {
@@ -211,7 +211,7 @@ 
     /**
      * Adds at the beginning a node in the list.
      *
-     * @param mixed $data
+     * @param integer $data
      * @return mixed the data stored.
      */
     public function unshift($data) {

DataStructures/Trees/AVLTree.php

Doc Comments +1 added lines, -1 removed lines

@@ -32,7 +32,7 @@
      * @param DataStructures\Trees\Nodes\AVLNode|null $left the left child node.
      * @param DataStructures\Trees\Nodes\AVLNode|null $right the right child node.
      *
-     * @return DataStructures\Trees\Nodes\AVLNode the new node created.
+     * @return AVLNode the new node created.
      */
     public function createNode($key, $data, $parent = null, $left = null, $right = null) {
         return new AVLNode($key, $data, $parent, $left, $right);

DataStructures/Trees/BinaryTreeAbstract.php

Doc Comments +16 added lines, -12 removed lines

@@ -88,8 +88,8 @@ 
     /**
      * Creates a new node or updates it if already exists.
      *
-     * @param int|string $key the key.
-     * @param mixed $data the data to be stored. 
+     * @param integer $key the key.
+     * @param string $data the data to be stored. 
      */
     public function putOrUpdate($key, $data) {
         $this->put($key, $data, true);
@@ -98,7 +98,7 @@ 
     /**
      * Retrieve the data stored in the tree.
      *
-     * @param int|string $key the key to identify the data.
+     * @param integer $key the key to identify the data.
      * @return mixed
      */
     public function get($key){
@@ -132,7 +132,7 @@ 
     /**
      * Looks for the node with the given key.
      *
-     * @param int|string $key the key used to look for.
+     * @param string $key the key used to look for.
      * @return bool true if was found.
      */
     public function exists($key) : bool {
@@ -234,7 +234,7 @@ 
     /**
      * Returns the minimum node from a given node in position X.
      *
-     * @param DataStructures\Trees\Nodes\BSTNode $node the start point.
+     * @param BinaryNodeInterface $node the start point.
      * @return DataStructures\Trees\Nodes\BSTNode|null the minimum node.
      */
     private function getMinNode(BinaryNodeInterface $node = null) {
@@ -252,7 +252,7 @@ 
     /**
      * Returns the maximum node from a given node in position X.
      *
-     * @param DataStructures\Trees\Nodes\BSTNode $node the start point.
+     * @param BinaryNodeInterface $node the start point.
      * @return DataStructures\Trees\Nodes\BSTNode|null the maximum node.
      */
     private function getMaxNode(BinaryNodeInterface $node = null) {
@@ -271,7 +271,7 @@ 
      * Deletes the node with the minimum key and returns it. The most left and more bottom.
      * 
      * @param DataStructures\Trees\Nodes\BSTNode|null if null takes the root.
-     * @return DataStructures\Trees\Nodes\BSTNode|null the minimum node or
+     * @return BinaryNodeInterface|null the minimum node or
      *  null if the tree is empty.
      */
     public function deleteMin(BinaryNodeInterface $node = null) {
@@ -287,7 +287,7 @@ 
      * Deletes the node with the maximum key and returns it. The most right and more bottom.
      * 
      * @param DataStructures\Trees\Nodes\BSTNode|null if null takes the root.
-     * @return DataStructures\Trees\Nodes\BSTNode|null the maximum node or
+     * @return BinaryNodeInterface|null the maximum node or
      *  null if the tree is empty.
      */
     public function deleteMax(BinaryNodeInterface $node = null) {
@@ -303,7 +303,8 @@ 
      * Deletes the node with the maximum key and returns it. The most right and more bottom.
      * 
      * @param DataStructures\Trees\Nodes\BSTNode|null if null takes the root.
-     * @return DataStructures\Trees\Nodes\BSTNode|null the maximum node or
+     * @param integer $key
+     * @return BinaryNodeInterface|null the maximum node or
      *  null if the tree is empty.
      */
     public function delete($key) {
@@ -321,7 +322,7 @@ 
      * that replaces the deleted node. Also decrease the size of tree.
      *
      * @param DataStructures\Trees\Nodes\BSTNode|null The node to be deleted.
-     * @return the node that replaces the deleted.
+     * @return DataStructures\Trees\Nodes\BSTNode|null node that replaces the deleted.
      */
     protected function _delete(BinaryNodeInterface &$node) {
         if($node !== null) {
@@ -409,7 +410,7 @@ 
      * Returns true if is leaf the node.
      *
      * @param DataStructures\Trees\Nodes\BSTNode|null $node default to null.
-     * @return true if is leaf the node, is not null and their subtrees has no
+     * @return boolean if is leaf the node, is not null and their subtrees has no
      *  pointers to successors.
      */
     public function isLeaf($node) : bool { // BinaryTreeNode
@@ -421,7 +422,7 @@ 
      * also are called a root node.
      *
      * @param DataStructures\Trees\Nodes\BSTNode|null $node default to null.
-     * @return true if is root the node, is not null and their subtrees has no
+     * @return boolean if is root the node, is not null and their subtrees has no
      *  pointers to successors.
      */
     public function isRoot($node) : bool {
@@ -446,6 +447,7 @@ 
      * @param DataStructures\Trees\Nodes\BSTNode|null $node.
      * @param Callable|null $callback the callback function to apply to each
      *  node.
+     * @param null|DataStructures\Trees\Nodes\BSTNode $node
      */
     private function _preorder($node, Callable $callback = null) {
         if($node === null) {
@@ -476,6 +478,7 @@ 
      * @param DataStructures\Trees\Nodes\BSTNode|null $node.
      * @param Callable|null $callback the callback function to apply to each
      *  node.
+     * @param null|DataStructures\Trees\Nodes\BSTNode $node
      */
     private function _inorder($node, Callable $callback = null) {
         if($node === null) {
@@ -507,6 +510,7 @@ 
      * @param DataStructures\Trees\Nodes\BSTNode|null $node.
      * @param Callable|null $callback the callback function to apply to each
      *  node.
+     * @param null|DataStructures\Trees\Nodes\BSTNode $node
      */
     private function _postorder($node, Callable $callback = null) {
         if($node === null) {