Table of Contents

Namespace Core.Collections

Structs

NativeMinHeap<T>

Burst-compatible min-heap for priority queue operations. Used by pathfinding for efficient lowest-cost node extraction.

Performance:

  • Push: O(log n)
  • Pop: O(log n)
  • Peek: O(1)

Memory: Pre-allocated NativeList, zero allocations during use.

PathfindingNode

Pathfinding node for A* algorithm. Comparable by fScore for min-heap priority queue.