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.

目录