Hot Path Principles
Non-negotiable rules for maximum performance:
Zero allocation in processing loop
No exceptions – use counters for errors
No callbacks/lambdas in hot path – direct method calls
No locks – single-threaded per tree
Array indexing for routing (not Maps)
Bitmask pruning for optional features
Memory access uses VarHandle for near-native speed.
Header objects are reused and rebound – never new inside loop.
Last updated