Class PriorityQueue<T>

Type parameters

T

Hierarchy

PriorityQueue

Implements

IPriorityQueue<T>

Index

Constructors

constructor

Properties

_heap

Accessors

isEmpty
size

Methods

Constructors

constructor

new PriorityQueue(getPriority: (value: T) => any, compareFunction?: CompareFunctionType<any>): PriorityQueue

- Defined in Queue/PriorityQueue.ts:18
Parameters
- getPriority: (value: T) => any
  - - (value: T): any
    - Parameters
      - value: T
      Returns any
- Default value compareFunction: CompareFunctionType<any> = descendingCompareFunction
Returns PriorityQueue

Properties

Private _heap

_heap: IHeap<T>

Accessors

isEmpty

get isEmpty(): boolean

- Defined in Queue/PriorityQueue.ts:62
Returns boolean

size

get size(): number

- Defined in Queue/PriorityQueue.ts:58
Returns number

Methods

[Symbol.iterator]

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

Implementation of IPriorityQueue.[Symbol.iterator]
- Defined in Queue/PriorityQueue.ts:66
Returns Iterator<T, any, undefined>

dequeue

dequeue(): T

Implementation of IPriorityQueue.dequeue
- Defined in Queue/PriorityQueue.ts:41
Returns T

enqueue

enqueue(item: T): void

Implementation of IPriorityQueue.enqueue
- Defined in Queue/PriorityQueue.ts:37
Parameters
- item: T
Returns void

peek

peek(): T

Implementation of IPriorityQueue.peek
- Defined in Queue/PriorityQueue.ts:45
Returns T

rearrange

rearrange(): void

Implementation of IPriorityQueue.rearrange
- Defined in Queue/PriorityQueue.ts:33
Returns void

toArray

toArray(): T[]

Implementation of IPriorityQueue.toArray
- Defined in Queue/PriorityQueue.ts:49
Returns T[]

Generated using TypeDoc