| Classes | |
|---|---|
| Deque | |
| Map | |
| Pair | A pair is used by Ds\Map to pair keys with values. |
| PriorityQueue | A PriorityQueue is very similar to a Queue. Values are pushed into the queue with an assigned priority, and the value… |
| Queue | A Queue is a “first in, first out” or “FIFO” collection that only allows access to the value at the front of the queue… |
| Set | A Set is a sequence of unique values. This implementation uses the same hash table as Ds\Map, where values are used as… |
| Stack | A Stack is a “last in, first out” or “LIFO” collection that only allows access to the value at the top of the structure… |
| Vector | A Vector is a sequence of values in a contiguous buffer that grows and shrinks automatically. It’s the most efficient… |
| Interfaces | |
| Collection | Collection is the base interface which covers functionality common to all the data structures in this library. It… |
| Hashable | Hashable is an interface which allows objects to be used as keys. It’s an alternative to spl_object_hash(), which… |
| Sequence | A Sequence describes the behaviour of values arranged in a single, linear dimension. Some languages refer to this as a … |