New datastructures made their way into SPL recently:
- SplDoublyLinkedList
as long with two childs:
- SplStack
- SplQueue
Those structures implement Iterator, ArrayAccess and Countable which makes them easy to handle. There are also multiple ways to iterate through them.
More datastructures will get implemented in the future. The goal is to implement quite every basic datastructure along with algorithms related to them. SPL could then be used as an object oriented replacement for ADT.