BinaryHeap | @moonage/cobi-data - v0.0.5

Binary Heap class

export

Type parameters

T

Hierarchy

BinaryHeap

Index

Constructors

constructor

Accessors

list
size

Methods

Constructors

constructor

new BinaryHeap<T>(compare?: CompareFunction<T>): BinaryHeap<T>

- Defined in lib/tree/binary-heap/BinaryHeap.ts:13
Type parameters
- T
Parameters
- compare: CompareFunction<T> = ...
  
  CompareFunction
Returns BinaryHeap<T>

Accessors

list

get list(): Nullable<T>[]

- Defined in lib/tree/binary-heap/BinaryHeap.ts:42
Return element in the list

Runtime: O(1).

Returns Nullable<T>[]

size

get size(): number

- Defined in lib/tree/binary-heap/BinaryHeap.ts:186
Return the size of the heap.

readonly

memberof

BinaryHeap

Returns number

Methods

add

add(element: T): void

- Defined in lib/tree/binary-heap/BinaryHeap.ts:30
Add element to the heap

Runtime: O(log(n)).

Parameters
- element: T
  
  T
Returns void

decreaseKey

decreaseKey(index: number, newValue: Nullable<T>): void

- Defined in lib/tree/binary-heap/BinaryHeap.ts:100
Replace an element in given index and rebalance the heap.
Runtime: O(log(n))

Parameters
- index: number
- newValue: Nullable<T>
Returns void

deleteAtIndex

deleteAtIndex(index: number): void

- Defined in lib/tree/binary-heap/BinaryHeap.ts:84
Remove an element in given index and rebalance the heap.
Runtime: O(log(n))

Parameters
- index: number
Returns void

extract

extract(): Nullable<T>

- Defined in lib/tree/binary-heap/BinaryHeap.ts:67
Extract least priority element.
Remove the first element from the list.
Replace it with the last element from the list.
Fix the order by using sinkDown method for the first element.

Runtime: O(log(n)).

memberof

BinaryHeap

Returns Nullable<T>

findMin

findMin(): Nullable<T>

- Defined in lib/tree/binary-heap/BinaryHeap.ts:53
Return the minimum priority in the heap without removing it.

Runtime: O(1).

memberof

BinaryHeap

Returns Nullable<T>

Generated using TypeDoc