Class: PriorityQueue<T>
priorityqueue.PriorityQueue
Type parameters
| Name |
|---|
T |
Constructors
constructor
• new PriorityQueue<T>(): PriorityQueue<T>
Type parameters
| Name |
|---|
T |
Returns
Properties
heap
• Private heap: Node<T>[] = []
Methods
hasLeft
▸ hasLeft(index): boolean
Parameters
| Name | Type |
|---|---|
index |
number |
Returns
boolean
hasRight
▸ hasRight(index): boolean
Parameters
| Name | Type |
|---|---|
index |
number |
Returns
boolean
insert
▸ insert(item, priority): void
Parameters
| Name | Type |
|---|---|
item |
T |
priority |
number |
Returns
void
isEmpty
▸ isEmpty(): boolean
Returns
boolean
left
▸ left(index): number
Parameters
| Name | Type |
|---|---|
index |
number |
Returns
number
parent
▸ parent(index): number
Parameters
| Name | Type |
|---|---|
index |
number |
Returns
number
peek
▸ peek(): undefined | T
Returns
undefined | T
pop
▸ pop(): undefined | T
Returns
undefined | T
right
▸ right(index): number
Parameters
| Name | Type |
|---|---|
index |
number |
Returns
number
size
▸ size(): number
Returns
number
swap
▸ swap(a, b): void
Parameters
| Name | Type |
|---|---|
a |
number |
b |
number |
Returns
void