Interface PriorityQueueNode<T>Internal

Readonly capacity

enablePriority

size

[iterator]

• [iterator](): Iterator<T, any, undefined>

• Returns an iterator for the fixed priority queue.

  Returns Iterator<T, any, undefined>

  An iterator for the fixed priority queue.

  See

  https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols

clear

• clear(): void

• Clears the fixed priority queue.

  Returns void

dequeue

• dequeue(): undefined | T

• Dequeue data from the fixed priority queue.

  Returns undefined | T

  The dequeued data or undefined if the priority queue is empty.

empty

• empty(): boolean

• Checks if the fixed priority queue is empty.

  Returns boolean

  true if the fixed priority queue is empty, false otherwise.

enqueue

• enqueue(data, priority?): number

• Enqueue data into the fixed priority queue.

  Parameters

  • data: T

    Data to enqueue.
  • Optional priority: number

    Priority of the data. Lower values have higher priority.

  Returns number

  The new size of the priority queue.

  Throws

  If the fixed priority queue is full.

full

• full(): boolean

• Checks if the fixed priority queue is full.

  Returns boolean

  true if the fixed priority queue is full, false otherwise.

get

• get(index): undefined | T

• Gets data from the fixed priority queue.

  Parameters

  • index: number

    The index of the data to get.

  Returns undefined | T

  The data at the index or undefined if the fixed priority queue is empty or the index is out of bounds.