You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Measure and optimize targeted, broadcast, priority, global-accept-all, interceptor, post-processing, and rewritten-route costs without conflating them with the simple emit prologue.
Screen hash mixer, load factor, probing, deletion, and layout as mechanisms instead of treating named maps as indivisible candidates.
Compare dynamic managed candidates: current linear/backward-shift storage, Robin Hood, scalar tagged-metadata open addressing, and standard Dictionary controls.
Do not repeat inline 1/2/4 target maps plus ordinary spill; prior physical inline context maps failed retained storage.
Measure priority containers during registration, arbitrary removal, and snapshot build. Test a bitset only for an explicitly bounded priority domain with a general int fallback.
Test 0/1/N hook kernels, fused dynamic programs, post snapshot cost, route rewrite, global flattening, and relevance-scoped invalidation.
Compare AoS/SoA, packing, and numeric width only after profile/probe evidence identifies a removable cost.
Part of #497 and the filtered, post-processing, and keyed outcomes in #414. Consumes the shared-prologue baseline from #501.
Inputs and dependencies
Purpose
Measure and optimize targeted, broadcast, priority, global-accept-all, interceptor, post-processing, and rewritten-route costs without conflating them with the simple emit prologue.
Owned experiments
RED and correctness
Acceptance
Every route family and data-structure mechanism receives baseline, probe/profile, allocation, retained-memory, and decision evidence.
A production winner must:
Shared prologue, compiler-only work, additive frozen semantics, and queue architecture are out of scope.