The Queue class
Guide
Edit on GitHub ✎
A Queue is a “first in, first out” or “FIFO” collection that only allows access to the value at the front of the queue and iterates in that order, destructively.
Intro
A Queue is a “first in, first out” or “FIFO” collection that only allows access to the value at the front of the queue and iterates in that order, destructively.
Class synopsis
class Ds\Queue { }
Predefined Constants
Ds\Queue::MIN_CAPACITY
Changelog
| Version | Description |
|---|---|
| PECL ds 1.3.0 | The class now implements ArrayAccess. |
Queue