This is the cl-speedy-queue Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon May 15 04:20:18 2023 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-speedy-queuecl-speedy-queue is a portable, non-consing, optimized queue implementation.
Adlai Chandrasekhar <munchking@gmail.com>
MIT
cl-speedy-queue.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-speedy-queue/cl-speedy-queue.asdcl-speedy-queue (system).
cl-speedy-queue/cl-speedy-queue.lispcl-speedy-queue (system).
dequeue (function).
enqueue (function).
make-queue (function).
queue-count (function).
queue-empty-p (function).
queue-full-p (function).
queue-length (function).
queue-peek (function).
%dequeue (function).
%enqueue (function).
%make-queue (function).
%next-index (function).
%queue-count (function).
%queue-empty-p (function).
%queue-full-p (function).
%queue-in (function).
%queue-length (function).
%queue-out (function).
%queue-peek (function).
%queue-zero-p (function).
define-speedy-function (macro).
queue-condition (condition).
queue-condition-queue (reader method).
queue-error-attempted-length (reader method).
queue-length-error (condition).
queue-overflow-error (condition).
queue-overflow-extra-item (reader method).
queue-underflow-error (condition).
queuep (function).
Packages are listed by definition order.
cl-speedy-queuecommon-lisp.
dequeue (function).
enqueue (function).
make-queue (function).
queue-count (function).
queue-empty-p (function).
queue-full-p (function).
queue-length (function).
queue-peek (function).
%dequeue (function).
%enqueue (function).
%make-queue (function).
%next-index (function).
%queue-count (function).
%queue-empty-p (function).
%queue-full-p (function).
%queue-in (function).
%queue-length (function).
%queue-out (function).
%queue-peek (function).
%queue-zero-p (function).
define-speedy-function (macro).
queue-condition (condition).
queue-condition-queue (generic reader).
queue-error-attempted-length (generic reader).
queue-length-error (condition).
queue-overflow-error (condition).
queue-overflow-extra-item (generic reader).
queue-underflow-error (condition).
queuep (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
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.
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
queue-condition)) ¶queue-length-error)) ¶queue-overflow-error)) ¶item.
error.
:queue
This slot is read-only.
:attempted-length
This slot is read-only.
:item
This slot is read-only.
| Jump to: | %
D E F G M Q |
|---|
| Jump to: | %
D E F G M Q |
|---|
| 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 |
|---|