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.
类摘要
Ds\Queue
implements
Ds\Collection
,
ArrayAccess
{
/* Constants */
/* 方法 */
}预定义常量
Ds\Queue::MIN_CAPACITY
更新日志
| 版本 | 说明 |
|---|---|
| PECL ds 1.3.0 | The class now implements ArrayAccess. |
目录
- Ds\Queue::allocate — Allocates enough memory for a required capacity
- Ds\Queue::capacity — Returns the current capacity
- Ds\Queue::clear — Removes all values
- Ds\Queue::__construct — Creates a new instance
- Ds\Queue::copy — Returns a shallow copy of the queue
- Ds\Queue::count — Returns the number of values in the queue
- Ds\Queue::isEmpty — Returns whether the queue is empty
- Ds\Queue::jsonSerialize — Returns a representation that can be converted to JSON
- Ds\Queue::peek — Returns the value at the front of the queue
- Ds\Queue::pop — Removes and returns the value at the front of the queue
- Ds\Queue::push — Pushes values into the queue
- Ds\Queue::toArray — Converts the queue to an array
add a note
User Contributed Notes
There are no user contributed notes for this page.
