2.3 KiB
| layout | title |
|---|---|
| main | API |
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-queue
list-queue
list-queue-copy
list-queue-unfold
list-queue-unfold-right
Predicates
Accessors
list-queue-front
list-queue-back
list-queue-list
list-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-append
list-queue-append!
list-queue-concatenate
list-queue-append
list-queue-append!
list-queue-concatenate
Mapping
list-queue-map
list-queue-map!
list-queue-for-each