The Queue class

(PECL pht >= 0.0.1)

Introducere

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.

Sinopsisul clasei

pht\Queue implements pht\Threaded {

/* Metode */

public front ( ) : mixed

public lock ( ) : void

public pop ( ) : mixed

public push ( mixed $value ) : void

public size ( ) : int

public unlock ( ) : void

}

Cuprins

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

add a note

User Contributed Notes

There are no user contributed notes for this page.