The PriorityQueue class
(No version information available, might only be in Git)
简介
A PriorityQueue is very similar to a Queue. Values are pushed into the queue with an assigned priority, and the value with the highest priority will always be at the front of the queue.
Implemented using a max heap.
Note:
"First in, first out" ordering is preserved for values with the same priority.
Note:
Iterating over a PriorityQueue is destructive, equivalent to successive pop operations until the queue is empty.
类摘要
DsPriorityQueue implements DsCollection {
/* Constants */
/* 方法 */
}
预定义常量
DsPriorityQueue::MIN_CAPACITY
属性/方法 列表
- DsPriorityQueue::allocate — Allocates enough memory for a required capacity
- DsPriorityQueue::capacity — Returns the current capacity
- DsPriorityQueue::clear — Removes all values
- DsPriorityQueue::__construct — Creates a new instance
- DsPriorityQueue::copy — Returns a shallow copy of the queue
- DsPriorityQueue::count — Returns the number of values in the queue
- DsPriorityQueue::isEmpty — Returns whether the queue is empty
- DsPriorityQueue::jsonSerialize — Returns a representation that can be converted to JSON
- DsPriorityQueue::peek — Returns the value at the front of the queue
- DsPriorityQueue::pop — Removes and returns the value with the highest priority
- DsPriorityQueue::push — Pushes values into the queue
- DsPriorityQueue::toArray — Converts the queue to an array
用户贡献的笔记
There are no user contributed notes for this page.
转载请注明:悠然品鉴 » PHP PriorityQueue 用法 手册 | 示例代码