The Stack class
Guide
Edit on GitHub ✎
A Stack is a “last in, first out” or “LIFO” collection that only allows access to the value at the top of the structure and iterates in that order, destructively.
Intro
A Stack is a “last in, first out” or “LIFO” collection that only allows access to the value at the top of the structure and iterates in that order, destructively.
Uses a Ds\Vector internally.
Class synopsis
class Ds\Stack { }
Changelog
| Version | Description |
|---|---|
| PECL ds 1.3.0 | The class now implements ArrayAccess. |
Stack