Class PriorityQueue<T>

A pure data structure that maintains a set of ordered items by numeric priority. Lower priority numbers dequeue first. Ties are broken by insertion order.

Time Complexity:

Enqueue: O(log n)
Dequeue: O(log n)
Peek: O(1)

Space Complexity: O(n) where n is the number of items in the queue

Type Parameters

T

Index

Constructors

Methods

[iterator] clear clone find heapify isEmpty peek peekMany pop popMany push size toSortedArray

Constructors

constructor

new PriorityQueue<T>(options?: PriorityQueueOptions<T>): PriorityQueue<T>
Type Parameters
- T
Parameters
- Optionaloptions: PriorityQueueOptions<T>
Returns PriorityQueue<T>
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:37

Methods

[iterator]

"[iterator]"(): IterableIterator<T>
Returns an iterator over the queue.

Returns IterableIterator<T>
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:87

clear

clear(): void
Clears all items and resets the insertion counter.

Returns void
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:99

clone

clone(): PriorityQueue<T>
Returns PriorityQueue<T>
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:79

find

find(predicate: (value: T) => boolean): T | null
Find an item in the queue by predicate.
Parameters
- predicate: (value: T) => boolean
Returns T | null
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:71

heapify

heapify(items: Node<T>[]): void
Heapify the queue.

Time Complexity: O(n) Space Complexity: O(n)
Parameters
- items: Node<T>[]
Returns void
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:78

isEmpty

isEmpty(): boolean
Returns true if the queue is empty.

Returns boolean
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:95

peek

peek(): T | null
Returns the next item to be dequeued without removing it.

Returns T | null
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:63

peekMany

peekMany(count?: number): T[]
Returns the next item to be dequeued without removing it.
Parameters
- Optionalcount: number
Returns T[]
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:67

pop

pop(): T | null
Removes and returns the highest-priority item. Returns null if the queue is empty.

Time Complexity: O(log n) Space Complexity: O(1)

Returns T | null
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:54

popMany

popMany(count?: number): T[]
Removes and returns many items from the queue. Returns an empty array if the queue is empty.
Parameters
- Optionalcount: number
Returns T[]
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:59

push

push(value: T, priority?: number): void
Adds a new item into the queue.
Parameters
- value: T
  The payload associated with the item
- Optionalpriority: number
  Numeric priority (lower = higher priority)
  
  Time Complexity: O(log n) Space Complexity: O(1)
Returns void
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:46

size

size(): number
Returns the number of items in the queue.

Returns number
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:91

toSortedArray

toSortedArray(): T[]
Returns a sorted array of the queue.

Returns T[]
- Defined in packages/utils/dist/types/data-structures/priority-queue.d.ts:83