Class default<T>

An implementation of Binary Heap.

Type Parameters

T

Hierarchy

BasePriorityQueue
- default

Implements

PriorityQueueInstance<T>

Index

Constructors

Properties

_kind collection comparator

Accessors

Methods

clear isEmpty merge pop push toArray top from

Constructors

constructor

new default<T>(__namedParameters?: PriorityQueueOption<T>): default<T>
Type Parameters
- T
Parameters
- __namedParameters: PriorityQueueOption<T> = {}
Returns default<T>
Overrides BasePriorityQueue.constructor
- Defined in BinaryHeap.ts:76

Properties

_kind

_kind: string

collection

collection: T[] = []

comparator

comparator: Comparator<T>

Accessors

length

get length(): number
Returns number
Implementation of PriorityQueueInstance.length
- Defined in BinaryHeap.ts:89

Methods

clear

clear(): void
Returns void
Implementation of PriorityQueueInstance.clear
- Defined in BinaryHeap.ts:81

isEmpty

isEmpty(): boolean
Returns boolean
Implementation of PriorityQueueInstance.isEmpty
- Defined in BinaryHeap.ts:140

merge

merge<Instance>(other: Instance): void
Type Parameters
- Instance extends PriorityQueueInstance<T>
Parameters
- other: Instance
Returns void
Implementation of PriorityQueueInstance.merge
- Defined in BinaryHeap.ts:130

pop

pop(): T
Returns T
Implementation of PriorityQueueInstance.pop
- Defined in BinaryHeap.ts:100

push

push(value: T): void
Parameters
- value: T
Returns void
Implementation of PriorityQueueInstance.push
- Defined in BinaryHeap.ts:115

toArray

toArray(): T[]
Returns T[]
Implementation of PriorityQueueInstance.toArray
- Defined in BinaryHeap.ts:85

top

top(): T
Returns T
Implementation of PriorityQueueInstance.top
- Defined in BinaryHeap.ts:93

`Static` from

from<U>(array: U[], option?: PriorityQueueOption<U>): default<U>
Type Parameters
- U
Parameters
- array: U[]
- option: PriorityQueueOption<U> = {}
Returns default<U>
- Defined in BinaryHeap.ts:66

Generated using TypeDoc