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.

Synopsis de la classe

class Ds\Queue implements Ds\Collection, ArrayAccess {
/* Constantes */
const int MIN_CAPACITY = 8;
/* Méthodes */
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

Constantes pré-définies



Version Description
PECL ds 1.3.0 The class now implements ArrayAccess.


add a note

User Contributed Notes

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