Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the cl-speedy-queue Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Aug 15 04:03:11 2022 GMT+0.
Next: Systems, Previous: The cl-speedy-queue Reference Manual, Up: The cl-speedy-queue Reference Manual [Contents][Index]
cl-speedy-queue is a portable, non-consing, optimized queue implementation. It was originally written by Adlai Chandrasekhar for use in ChanL.
[function] make-queue size
Creates a new queue of SIZE.
[function] enqueue object queue
Enqueues OBJECT in QUEUE.
[function] dequeue queue
Dequeues QUEUE.
[function] queue-count queue
Returns the current size of QUEUE.
[function] queue-length queue
Returns the maximum size of QUEUE.
[function] queue-peek queue
Returns the next item that would be dequeued without dequeueing it.
[function] queue-full-p queue
Returns NIL if more items can be enqueued.
[function] queue-empty-p queue
Returns NIL if there are still items in the queue.
Next: Files, Previous: Introduction, Up: The cl-speedy-queue Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
cl-speedy-queue is a portable, non-consing, optimized queue implementation.
Adlai Chandrasekhar <munchking@gmail.com>
MIT
cl-speedy-queue.lisp (file).
Next: Packages, Previous: Systems, Up: The cl-speedy-queue Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: cl-speedy-queue/cl-speedy-queue.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
cl-speedy-queue (system).
Previous: cl-speedy-queue/cl-speedy-queue.asd, Up: Lisp [Contents][Index]
cl-speedy-queue (system).
Next: Definitions, Previous: Files, Up: The cl-speedy-queue Reference Manual [Contents][Index]
Packages are listed by definition order.
common-lisp.
Next: Indexes, Previous: Packages, Up: The cl-speedy-queue Reference Manual [Contents][Index]
Definitions are sorted by export status, category, package, and then by lexicographic order.
Next: Internals, Previous: Definitions, Up: Definitions [Contents][Index]
Previous: Public Interface, Up: Public Interface [Contents][Index]
Dequeues QUEUE
Enqueues OBJECT in QUEUE
Makes a queue of maximum size SIZE
Returns the current size of QUEUE
Tests whether QUEUE is empty
Returns NIL if more items can be enqueued.
Returns the maximum size of QUEUE
Returns the next item that would be dequeued without dequeueing it.
Previous: Public Interface, Up: Definitions [Contents][Index]
Next: Ordinary functions, Previous: Internals, Up: Internals [Contents][Index]
Next: Generic functions, Previous: Macros, Up: Internals [Contents][Index]
Sets QUEUE’s tail to QUEUE, increments QUEUE’s tail pointer, and returns the previous tail ref
Enqueue OBJECT and increment QUEUE’s entry pointer
Creates a new queue of maximum size LENGTH
Returns QUEUE’s effective length
Checks whether QUEUE is effectively empty
Checks whether QUEUE is effectively full
QUEUE’s entry pointer
Returns QUEUE’s maximum length
QUEUE’s exit pointer
Dereference QUEUE’s exit pointer
Checks whether QUEUE’s theoretical length is zero
If this returns NIL, X is not a queue
Next: Conditions, Previous: Ordinary functions, Up: Internals [Contents][Index]
item.
Previous: Generic functions, Up: Internals [Contents][Index]
error.
:queue
This slot is read-only.
:attempted-length
This slot is read-only.
:item
This slot is read-only.
Previous: Definitions, Up: The cl-speedy-queue Reference Manual [Contents][Index]
Jump to: | %
D E F G M Q |
---|
Jump to: | %
D E F G M Q |
---|
Next: Data types, Previous: Functions, Up: Indexes [Contents][Index]
Jump to: | A I Q S |
---|
Index Entry | Section | ||
---|---|---|---|
| |||
A | |||
attempted-length : | Private conditions | ||
| |||
I | |||
item : | Private conditions | ||
| |||
Q | |||
queue : | Private conditions | ||
| |||
S | |||
Slot, attempted-length : | Private conditions | ||
Slot, item : | Private conditions | ||
Slot, queue : | Private conditions | ||
|
Jump to: | A I Q S |
---|
Jump to: | C F P Q S |
---|
Jump to: | C F P Q S |
---|