The Stack class

(No version information available, might only be in Git)


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 Ds\Stack implements Ds\Collection, ArrayAccess {
/* 方法 */
public allocate(int $capacity): void
public capacity(): int
public clear(): void
public copy(): Ds\Stack
public isEmpty(): bool
public peek(): mixed
public pop(): mixed
public push(mixed ...$values): void
public toArray(): array


版本 说明
PECL ds 1.3.0 The class now implements ArrayAccess.