HOWZ1T / Ptypes

Ptypes/DoublyLinkedList.php

Braces +31 added lines, -11 removed lines

@@ -12,7 +12,9 @@ 
 	public $next = null, $prev = null; //A reference to the next and previous node
 	public $data = null; //Data or a reference to data
 	
-	public function __construct() {}
+	public function __construct()
+	{
+}
 }
 
 class DoublyLinkedList implements Countable
@@ -21,13 +23,19 @@ 
 	
 	private $size = 0;
 	
-	public function __construct() {}
+	public function __construct()
+	{
+}
 	
 	public function insert_after($node, $newNode)
 	{
 		//type checks
-		if (get_class($node) != "DLNode") {throw new InvalidArgument("Expected a DLNode, got: " . get_class($node)); }
-		if (get_class($newNode) != "DLNode") {throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
+		if (get_class($node) != "DLNode")
+		{
+throw new InvalidArgument("Expected a DLNode, got: " . get_class($node)); }
+		if (get_class($newNode) != "DLNode")
+		{
+throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
 		
 		$newNode->prev = $node;
 		if ($node->next == null)
@@ -47,8 +55,12 @@ 
 	public function insert_before($node, $newNode)
 	{
 		//type checks
-		if (get_class($node) != "DLNode") {throw new InvalidArgument("Expected a DLNode, got: " . get_class($node)); }
-		if (get_class($newNode) != "DLNode") {throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
+		if (get_class($node) != "DLNode")
+		{
+throw new InvalidArgument("Expected a DLNode, got: " . get_class($node)); }
+		if (get_class($newNode) != "DLNode")
+		{
+throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
 		
 		$newNode->next = $node;
 		if ($node->prev == null)
@@ -66,9 +78,11 @@ 
 	}
 	
 	public function insert_beginning($newNode)
-	{	
+	{
 		//type checks
-		if (get_class($newNode) != "DLNode") {throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
+		if (get_class($newNode) != "DLNode")
+		{
+throw new InvalidArgument("Expected a DLNode, got: " . get_class($newNode)); }
 		
 		if ($this->firstNode == null)
 		{
@@ -100,13 +114,17 @@ 
 	public function contains($node)
 	{
 		//check this so we could possibly avoid list traversal
-		if ($node == $this->firstNode || $node == $this->lastNode) {return true; }
+		if ($node == $this->firstNode || $node == $this->lastNode)
+		{
+return true; }
 		
 		//traverse the list and try to find the node
 		$n = $this->firstNode->next; //we can start one node ahead as we already checked the firstNode
 		while ($n != null)
 		{
-			if ($n == $node) {return true; }
+			if ($n == $node)
+			{
+return true; }
 			$n = $n->next;
 		}
 		
@@ -116,7 +134,9 @@ 
 	public function remove($node)
 	{
 		//check if the node exists
-		if ($this->contains($node) == false) {throw new InvalidArgument("The node given does not exist in this list!"); }
+		if ($this->contains($node) == false)
+		{
+throw new InvalidArgument("The node given does not exist in this list!"); }
 		
 		if ($node->prev == null)
 		{