HOWZ1T / Ptypes

Ptypes/DoublyLinkedList.php

Braces +28 added lines, -12 removed lines

@@ -13,7 +13,7 @@ 
 	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($data=null) 
+	public function __construct($data=null)
 	{
 		$this->data = $data;
 	}
@@ -25,13 +25,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)
@@ -51,8 +57,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)
@@ -70,9 +80,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)
 		{
@@ -104,13 +116,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;
 		}
 		
@@ -120,8 +136,8 @@ 
 	public function remove($node)
 	{
 		//check if the node exists
-		if ($this->contains($node) === false) 
-		{ 
+		if ($this->contains($node) === false)
+		{
 			throw new InvalidArgument("The node given does not exist in this list!"); 
 		}