Class default<T>

An implementation of Skew Heap.

Type Parameters

T

Hierarchy

BasePriorityQueue
- default

Implements

PriorityQueueInstance<T>

Index

Constructors

Properties

_kind _length comparator root

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 SkewHeap.ts:65

Properties

_kind

_kind: string

_length

_length: number = 0

comparator

comparator: Comparator<T>

root

root: null | Node<T> = null

Accessors

length

get length(): number
Returns number
Implementation of PriorityQueueInstance.length
- Defined in SkewHeap.ts:75

Methods

clear

clear(): void
Returns void
Implementation of PriorityQueueInstance.clear
- Defined in SkewHeap.ts:70

isEmpty

isEmpty(): boolean
Returns boolean
Implementation of PriorityQueueInstance.isEmpty
- Defined in SkewHeap.ts:118

merge

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

pop

pop(): T
Returns T
Implementation of PriorityQueueInstance.pop
- Defined in SkewHeap.ts:91

push

push(val: T): void
Parameters
- val: T
Returns void
Implementation of PriorityQueueInstance.push
- Defined in SkewHeap.ts:79

toArray

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

top

top(): T
Returns T
Implementation of PriorityQueueInstance.top
- Defined in SkewHeap.ts:84

`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 SkewHeap.ts:57

Generated using TypeDoc