Class UpgradeHeap

Binary min-heap over UpgradeEntry with Python-heapq tuple ordering. Dependency-free; sift-up/sift-down identical in behavior to heapq.

Index

Constructors

Accessors

Methods

Constructors

constructor

new UpgradeHeap(): UpgradeHeap

Returns UpgradeHeap

Accessors

length

get length(): number
Returns number
- Defined in packages/quantize/src/allocator.ts:83

Methods

pop

pop(): UpgradeEntry | undefined
Returns UpgradeEntry | undefined
- Defined in packages/quantize/src/allocator.ts:102

push

push(entry: UpgradeEntry): void
Parameters
- entry: UpgradeEntry
Returns void
- Defined in packages/quantize/src/allocator.ts:87