The Queue class

(PECL ds >= 1.0.0)

はじめに

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 Ds\Queue implements Ds\Collection, ArrayAccess {

/* 定数 */

const int MIN_CAPACITY = 8;

/* メソッド */

public function allocate(int $capacity): void

public function capacity(): int

public function clear(): void

public function copy(): Ds\Queue

public function isEmpty(): bool

public function peek(): mixed

public function pop(): mixed

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

public function toArray(): array

}

定義済み定数

Ds\Queue::MIN_CAPACITY

変更履歴

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

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

関連キーワード:

Queue queue capacity values toArray allocate front copy mixed first implements ArrayAccess 定数 clear isEmpty peek push Removes Stack Structures collection allows access iterates order

The Queue class

はじめに

クラス概要

定義済み定数

変更履歴

目次