Class PriorityQueue

Priority Queue data structure

Hierarchy

MinHeap
- PriorityQueue

Constructors

constructor

Properties

Constructors

constructor

new PriorityQueue(): PriorityQueue

Overrides MinHeap.constructor
- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:35
Returns PriorityQueue

Properties

compare

compare: Comparator

heapContainer

heapContainer: any[]

priorities

priorities: Map<any, any>

Methods

add

add(item: any, priority?: number): PriorityQueue

Overrides MinHeap.add
- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:46
Parameters
- item: any
- priority: number = 0
Returns PriorityQueue

changePriority

changePriority(item: any, priority: number): PriorityQueue

- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:58
Parameters
- item: any
- priority: number
Returns PriorityQueue

comparePriority

comparePriority(a: any, b: any): 0 | "1" | "-1"

- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:76
Parameters
- a: any
  
  Item A
- b: any
  
  Item B
Returns 0 | "1" | "-1"

compareValues

compareValues(a: string | number, b: string | number): 0 | "1" | "-1"

- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:83
Parameters
- a: string | number
- b: string | number
Returns 0 | "1" | "-1"

find

find(item: any, comparator?: Comparator): number[]

Inherited from MinHeap.find
- Defined in dataStructures/6.Heap/Heap.ts:194
Parameters
- item: any
  
  item to find
- comparator: Comparator = ...
  
  A comparator instance
Returns number[]

array of indices of the item in the heap

findByValue

findByValue(item: any): number[]

- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:64
Parameters
- item: any
Returns number[]

getLeftChildIndex

getLeftChildIndex(parentIndex: number): number

Inherited from MinHeap.getLeftChildIndex
- Defined in dataStructures/6.Heap/Heap.ts:45
Parameters
- parentIndex: number
  
  Parent's index
Returns number

Index of the left child

getParentIndex

getParentIndex(childIndex: number): number

Inherited from MinHeap.getParentIndex
- Defined in dataStructures/6.Heap/Heap.ts:62
Parameters
- childIndex: number
  
  Index of the node
Returns number

Parent's index

getRightChildIndex

getRightChildIndex(parentIndex: number): number

Inherited from MinHeap.getRightChildIndex
- Defined in dataStructures/6.Heap/Heap.ts:54
Parameters
- parentIndex: number
  
  Parent's index
Returns number

Index of the right child

hasLeftChild

hasLeftChild(parentIndex: number): boolean

Inherited from MinHeap.hasLeftChild
- Defined in dataStructures/6.Heap/Heap.ts:76
Parameters
- parentIndex: number
Returns boolean

hasParent

hasParent(childIndex: number): boolean

Inherited from MinHeap.hasParent
- Defined in dataStructures/6.Heap/Heap.ts:69
Parameters
- childIndex: number
  
  Index of the node
Returns boolean

hasRightChild

hasRightChild(parentIndex: number): boolean

Inherited from MinHeap.hasRightChild
- Defined in dataStructures/6.Heap/Heap.ts:83
Parameters
- parentIndex: number
  
  Parent's index
Returns boolean

hasValue

hasValue(item: any): boolean

- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:68
Parameters
- item: any
Returns boolean

heapifyDown

heapifyDown(startIndex?: number): void

Inherited from MinHeap.heapifyDown
- Defined in dataStructures/6.Heap/Heap.ts:226
Compare the parent with both of it's children and swap it with the appropriate child (smaller child for MinHeap and bigger child for MaxHeap). Do the same for next children after swap.

Parameters
- Optional startIndex: number
  
  Index to start heapify process from
Returns void

heapifyUp

heapifyUp(startIndex?: number): void

Inherited from MinHeap.heapifyUp
- Defined in dataStructures/6.Heap/Heap.ts:209
Take the last item (last in the container array or bottom left in the heap) and lift it up until its in the correct position with respect to its parent

Parameters
- Optional startIndex: number
  
  Index to start heapify process from
Returns void

isEmpty

isEmpty(): boolean

Inherited from MinHeap.isEmpty
- Defined in dataStructures/6.Heap/Heap.ts:251
Returns boolean

isPairInCorrectOrder

isPairInCorrectOrder(parent: any, child: any): boolean

Inherited from MinHeap.isPairInCorrectOrder
- Defined in dataStructures/6.Heap/MinHeap.ts:16
Parent must be less than or equal to the child node

Parameters
- parent: any
  
  Parent Node
- child: any
  
  Child Node
Returns boolean

leftChild

leftChild(parentIndex: number): any

Inherited from MinHeap.leftChild
- Defined in dataStructures/6.Heap/Heap.ts:90
Parameters
- parentIndex: number
  
  Parent's index
Returns any

parent

parent(childIndex: number): any

Inherited from MinHeap.parent
- Defined in dataStructures/6.Heap/Heap.ts:106
Parameters
- childIndex: number
  
  Index of the node
Returns any

peak

peak(): any

Inherited from MinHeap.peak
- Defined in dataStructures/6.Heap/Heap.ts:123
Get the root node without modifying the heap

Returns any

poll

poll(): any

Inherited from MinHeap.poll
- Defined in dataStructures/6.Heap/Heap.ts:134
Remove the root node

Returns any

remove

remove(item: any, comparator?: Comparator): PriorityQueue

Overrides MinHeap.remove
- Defined in dataStructures/7.PriorityQueue/PriorityQueue.ts:52
Parameters
- item: any
- Optional comparator: Comparator
Returns PriorityQueue

rightChild

rightChild(parentIndex: number): any

Inherited from MinHeap.rightChild
- Defined in dataStructures/6.Heap/Heap.ts:97
Parameters
- parentIndex: number
  
  Parent's index
Returns any

swap

swap(index1: number, index2: number): void

Inherited from MinHeap.swap
- Defined in dataStructures/6.Heap/Heap.ts:114
Parameters
- index1: number
  
  Index of the first item
- index2: number
  
  Index of the second item
Returns void

toString

toString(): string

Inherited from MinHeap.toString
- Defined in dataStructures/6.Heap/Heap.ts:255
Returns string