These kinds of queues are provided:
- Bounded and unbounded FIFO queues.
- Lossy bounded FIFO queues that drop elements when full.
- Unbounded random-order queues that use less memory than unbounded FIFO queues.
Additionally, a synchronization wrapper is provided to make any queue conforming to the jpl-queues API thread-safe for lightweight multithreading applications. (See Calispel for a more sophisticated CL multithreaded message-passing library with timeouts and alternation among several blockable channels.)
jpl-queues is used by Calispel.