The Queue class

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

はじめに

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 {
/* Constants */
const int MIN_CAPACITY = 8;
/* メソッド */
public allocate(int $capacity): void
public capacity(): int
public clear(): void
public copy(): Ds\Queue
public isEmpty(): bool
public peek(): mixed
public pop(): mixed
public push(mixed ...$values): void
public toArray(): array
}

定義済み定数

Ds\Queue::MIN_CAPACITY

変更履歴

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

目次

add a note add a note

User Contributed Notes

There are no user contributed notes for this page.
To Top