tiny-queue

A lightweight FIFO queue implemented as a linked list, avoiding the O(n) cost of Array.shift(). Current version 0.2.1, stable but rarely updated. Differentiator: minimal overhead (~38 lines) for environments where array shift is a bottleneck, such as high-throughput message passing. Not suitable for priority queues or complex data structures.