Common Lisp library implementing a few different kinds of queues
A Common Lisp library implementing a few different kinds of queues:
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.)
| Linter | Message | Location |
|---|---|---|
| input-labels Identify input labels that do not match package names | label 'jpl-util' does not match package name 'sbcl-jpl-util' | |
| input-labels Identify input labels that do not match package names | label 'bordeaux-threads' does not match package name 'sbcl-bordeaux-threads' |