Class PriorityQueue<T>

Construct a new prioriry queue.

const q = new PriorityQueue<number>({
  capacity: 1024,
  compare: (a, b) => a < b,
  elements: [1, 2, 3]
})
Copy

Count the amount of elements in the collection.

⚠️ In most cases, this should be an O(1) operation. However, there are cases where this can be an O(n) operation. Therefore, it is recommended to always cache the result in a local variable.

Returns an object which is able to sift through the values in this collection.

The order by which the elements are traversed depends on the kind of collection. For unordered collections, the iteration order is unspecified and may even differ between two iterations on the same collection.

Add an element to the collection. If the element already exists, update its value.

The location where the element is placed depends on the collection type, and in the generic case there is no guarantee on the location where it is inserted.

This method returns a pair with the first element indicating whether the element was added, while the second element refers to the actual location of the element.

Remove all elements from this collection, effectively setting the collection to the empty collection.

Copies all elements in the collection to a new one of the same kind.

Remove an element from the collection. If multiple elements are matched, the collection picks one of them.

Remove an element from the collection. If multiple elements are matched, the collection removes all of them.

Remove the element pointed to by the iterator result from this collection.

Checks if the collection holds the given element.

Get the next element in the queue without removing it from the collection.

Get the next element in the order defined by the queue and remove it from the collection.

Converts the entire collection to a range.