Three independent building blocks for bounded embedded work: a broad deterministic module library, table-free data placement, and heap-free traversal of implicit constrained spaces.
This family is intentionally not a framework. Each component solves one narrow problem with deterministic behaviour, caller-owned state and no hidden allocation. They can stand alone in firmware where memory, timing and integration boundaries matter.
A dependency-free C99 static library of 22 focused deterministic primitives. Its ONE modules keep state with the caller, use no heap, timers, callbacks or I/O, and expose a plain C API that can be included as one umbrella header or as narrow module headers.
Development · C99 · MITOpen projectAn allocation-free, table-free C primitive maps indices with a self-inverse Gray-code shear, spreading local neighbours across configured logical cells while retaining an exact inverse through the same mapping call.
Development · C99 · MITOpen projectA heap-free traversal primitive represents each prefix with compact sufficient state, counts valid continuations using bounded saturating arithmetic, and lets the caller visit or skip an entire subtree without materialising the search tree.
Development · C99 · MITOpen project