The Stack class

(PECL ds >= 1.0.0)

はじめに

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 function allocate(int $capacity): void

public function capacity(): int

public function clear(): void

public function copy(): Ds\Stack

public function isEmpty(): bool

public function peek(): mixed

public function pop(): mixed

public function push(mixed ...$values): void

public function toArray(): array

}

変更履歴

バージョン	説明
PECL ds 1.3.0	The class now implements ArrayAccess.

Ds\Stack::allocate — Allocates enough memory for a required capacity
Ds\Stack::capacity — Returns the current capacity
Ds\Stack::clear — Removes all values
Ds\Stack::__construct — Creates a new instance
Ds\Stack::copy — Returns a shallow copy of the stack
Ds\Stack::count — Returns the number of values in the stack
Ds\Stack::isEmpty — Returns whether the stack is empty
Ds\Stack::jsonSerialize — Returns a representation that can be converted to JSON
Ds\Stack::peek — Returns the value at the top of the stack
Ds\Stack::pop — Removes and returns the value at the top of the stack
Ds\Stack::push — Pushes values onto the stack
Ds\Stack::toArray — Converts the stack to an array

関連キーワード:

Stack stack capacity values allocate copy mixed implements ArrayAccess clear isEmpty peek push toArray Removes Structures last first collection allows access structure iterates order destructively

The Stack class

はじめに

クラス概要

変更履歴

目次