1681-engine / index / MinHeap
Class: MinHeap ​
Defined in: src/nav/MinHeap.ts:6
A binary min-heap of (index, priority) pairs, kept as two parallel arrays so a search over a big grid pushes numbers, not objects. A stale entry (pushed again at a lower priority) is left in and skipped by the caller's closed set, which is cheaper than a decrease-key.
Constructors ​
Constructor ​
ts
new MinHeap(): MinHeap;Returns ​
MinHeap
Accessors ​
size ​
Get Signature ​
ts
get size(): number;Defined in: src/nav/MinHeap.ts:10
Returns ​
number
Methods ​
clear() ​
ts
clear(): void;Defined in: src/nav/MinHeap.ts:55
Returns ​
void
pop() ​
ts
pop(): number;Defined in: src/nav/MinHeap.ts:30
The index with the lowest priority, removed. Only call while size > 0.
Returns ​
number
push() ​
ts
push(index, priority): void;Defined in: src/nav/MinHeap.ts:14
Parameters ​
| Parameter | Type |
|---|---|
index | number |
priority | number |
Returns ​
void