<?php
require 'Structures/LinkedList/Double.php';
/* To do anything useful with a linked list, you need to
* extend the Node class to hold data associated with the
* node. In this case, we're just going to hold a single
* integer in the $_my_number property.
*/
}
}
}
}
}
}
/* To enable key=>value iteration, we must override the default key()
* method in Structures_LinkedList_Double to return a meaningful value */
return $this->current()->getLetter
();
}
}
/* Now we'll create some instances of the new class */
/* Start by instantiating a list object.
* You can either pass the first node to the constructor,
* or leave it null and add nodes later.
*/
/* appendNode() adds a node to the end of the list */
/* prependNode() adds a node to the start of the list */
/* insertNode($new_node, $reference_node, $before) adds a node
* before the reference node if the third parameter is true,
* or after the reference node if the third parameter is false
*/
$list->insertNode($node5, $node1, true
);
// 3-5-1-4-2
/* current() returns the current pointer node in the list */
print $link->getNumber(); // "1"
/* rewind() resets the pointer to the root node of the list */
print $link->getNumber(); // "3"
// iterate through the list with do...while()
do {
print $link->getNumber();
} while
($link =
$list->next());
// "35142"
/* You can also iterate through a list with foreach() */
foreach ($list as $bull) {
print $bull->getNumber();
} // 3-1-4-2
/* Override the key() method to enable $key=>$value iteration */
foreach ($list as $key=>$value) {
print "$key => $value\n";
}
/* end() resets the pointer to the last node of the list */
print $link->getNumber(); // "2"
/* You can iterate backwards through a list with previous() */
do {
print $link->getNumber();
} while
($link =
$list->previous());
// "24153"
?>