The PriorityQueue class

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.

注意:

"First in, first out" ordering is preserved for values with the same priority.

注意:

Iterating over a PriorityQueue is destructive, equivalent to successive pop operations until the queue is empty.

類摘要

class Ds\PriorityQueue implements Ds\Collection {
/* Constants */
const int MIN_CAPACITY = 8;
/* 方法 */
public allocate(int $capacity): void
public capacity(): int
public clear(): void
public isEmpty(): bool
public peek(): mixed
public pop(): mixed
public push(mixed $value, int $priority): void
public toArray(): array
}

預定義常量

Ds\PriorityQueue::MIN_CAPACITY

目錄

發佈留言

發佈留言必須填寫的電子郵件地址不會公開。 必填欄位標示為 *