FIFO container using C allocations and byte copies. The main enqueues four 64-bit C-interoperable integers, verifies count and exact retrieval order, frees every popped allocation with C free, checks empty-pop behavior and destroys the queue. No source edits. The implementation uses GNU LOC and raw byte storage; the example makes no portability claim for arbitrary derived types, pointer-owning values, threading or every compiler.
Package dependencies
Resolved GitHub repositories used by the verified playground build, combining direct and indirect dependencies. This list does not describe internal module dependencies or native system libraries.
Required by this build
No additional GitHub package dependencies were recorded for this verified build.
Build record verified 2026-10-29.
Used by (0 selected packages)
No other selected build records this repository as a dependency. This is not a measure of usage outside the catalog.
Reviewed procedures
These mappings have pinned source evidence. A checked package example may exercise only some of them; source review is not a numerical benchmark.
new_fifo_queue / fifo%push / pop / count / destroy
FIFO container using C allocations and byte copies. The main enqueues four 64-bit C-interoperable integers, verifies count and exact retrieval order, frees every popped allocation with C free, checks empty-pop behavior and destroys the queue. No source edits. The implementation uses GNU LOC and raw byte storage; the example makes no portability claim for arbitrary derived types, pointer-owning values, threading or every compiler. The class-specific N4 driver checks 160 copied two-int64 records against an independent FIFO model, interleaved pushes/pops, three drain/refill cycles, empty-pop null pointers, independent queues and freeing all popped allocations. No pointer-owning or misaligned payload is certified.