The Queue class

(No hay información de versión disponible, podría estar únicamente en SVN)

Introducción

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.

Sinopsis de la Clase

Ds\Queue implements Ds\Collection {
/* Constants */
const int MIN_CAPACITY = 8 ;
/* Métodos */
public void allocate ( int $capacity )
public int capacity ( void )
public void clear ( void )
public Ds\Queue copy ( void )
public bool isEmpty ( void )
public mixed peek ( void )
public mixed pop ( void )
public void push ([ mixed $...values ] )
public array toArray ( void )
}

Constantes predefinidas

Ds\Queue::MIN_CAPACITY

Tabla de contenidos

add a note add a note

User Contributed Notes

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