Options
All
  • Public
  • Public/Protected
  • All
Menu

Type parameters

  • T

Hierarchy

  • PriorityQueue

Implements

Index

Constructors

constructor

  • new PriorityQueue<T>(comparator: (a: T, b: T) => boolean): PriorityQueue<T>

Properties

Private heap

heap: T[] = []

Accessors

length

  • get length(): number

Methods

add

  • add(element: T): void

clear

  • clear(): void

contains

  • contains(item: T): boolean

forEach

  • forEach(callback: (item: T, index: number) => boolean): void

Private heapify

  • heapify(index: number): void

peek

  • peek(): T

pop

  • pop(): undefined | T

Private swap

  • swap(indexOne: number, indexTwo: number): void

Static createMaxQueue

  • createMaxQueue<T>(valueExtractor: (value: T) => number): PriorityQueue<T>

Static createMinQueue

  • createMinQueue<T>(valueExtractor: (value: T) => number): PriorityQueue<T>

Generated using TypeDoc