2.3 KiB
SRFI 117 - Queues based on lists
The (srfi 117) library defines list queues; mutable ordered collections that can contain any Scheme object. Each list queue is based on an ordinary Scheme list containing the elements of the list queue by maintaining pointers to the first and last pairs of the list. It's cheap to add or remove elements from the front of the list or to add elements to the back, but not to remove elements from the back.
See the SRFI document for more information.
-
Constructors
make-list-queuelist-queuelist-queue-copylist-queue-unfoldlist-queue-unfold-right -
Predicates
list-queue?list-queue-empty? -
Accessors
list-queue-frontlist-queue-backlist-queue-listlist-queue-first-last -
Mutators
list-queue-add-front!list-queue-add-back!list-queue-remove-front!list-queue-remove-back!list-queue-remove-all!list-queue-set-list!list-queue-appendlist-queue-append!list-queue-concatenatelist-queue-appendlist-queue-append!list-queue-concatenate