The PriorityQueue class

(PECL ds >= 1.0.0)

Introduction

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.

Class synopsis

classDs\PriorityQueueimplementsDs\Collection {
constintMIN_CAPACITY = 8;
publicallocate(int$capacity): void
publiccapacity(): int
publicclear(): void
publicisEmpty(): bool
publicpeek(): mixed
publicpop(): mixed
publicpush(mixed$value, int$priority): void
publictoArray(): array
}

Predefined Constants

Ds\PriorityQueue::MIN_CAPACITY

Table of Contents

To Top