FIFO Module

Build a bounded queue: private storage, public void q_clear(void), int q_push(int v) (0 when full, capacity 8), int q_pop(int *out) (0 when empty or out==NULL, else 1 and the OLDEST value).

Difficulty: beginner