# The Queue class

(PECL pht >= 0.0.1)

## Introduction

The pht\Queue class is one of the Inter-Thread Communication (ITC) data structures exposed by pht. It can be safely passed around between threads, and manipulated by multiple threads using the mutex locks that have been packed in with the data structure. It is reference-counted across threads, and so it does not need to be explicitly destroyed.

## Synopsis de la classe

pht\Queue implements pht\Threaded {
/* Méthodes */
public front ( void ) : mixed
public lock ( void ) : void
public pop ( void ) : mixed
public push ( mixed `$value` ) : void
public size ( void ) : int
public unlock ( void ) : void
}

## Sommaire

- pht\Queue::front — Returns the first value from a queue
- pht\Queue::lock — Acquires the queue's mutex lock
- pht\Queue::pop — Pops a value off of the front of a queue
- pht\Queue::push — Pushes a value to the end of a queue
- pht\Queue::size — Gets the size of the queue
- pht\Queue::unlock — Releases the queue's mutex lock