Package de.bsommerfeld.pathetic.engine.pathfinder.heap.impl
package de.bsommerfeld.pathetic.engine.pathfinder.heap.impl
Array-backed primitive min-heap implementations.
QuaternaryPrimitiveMinHeap is
the heap the engine uses: 4-ary, three parallel primitive arrays, position tracking by plain
array index. It requires small, dense, non-negative int ids (the session's dense node ids) and
rejects sparse keys. PrimitiveMinHeap is the binary
predecessor; it accepts arbitrary 64-bit keys via an internal hash map and remains for callers
that need sparse keys. Zero allocations in the hot paths of both heaps is a load-bearing
invariant.
-
ClassesClassDescriptionA highly optimized, array-backed binary min-heap for A* pathfinding.A quaternary (4-ary) min-heap implementation optimized for pathfinding algorithms.