Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the pettomato-deque Reference Manual, version 0.1.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Aug 15 05:34:21 2022 GMT+0.
Next: Systems, Previous: The pettomato-deque Reference Manual, Up: The pettomato-deque Reference Manual [Contents][Index]
This package contains implementations of double-ended queues (aka, deques). See: http://en.wikipedia.org/wiki/Deque deque is a standard double-ended queue. You can push and pop from both ends. Other features include indexing elements from their relative position inside the deque, iterating through the elements, and converting the deque to a list. ideque is a specialized deque that keeps track of the indices of the front and back of the queue so that we may reference items by an absolute, rather than relative, index. The idea is that you can add elements to an ideque (push-back), pop elements off the front (pop-front), and still reference the nth item added directly by n. It probably doesn't make much sense to use push-front with an ideque, but you can. Please see the docstrings for the exported symbols for more information. -------------------------------- Acknowledgments This implementation was originally based off of the deque implementation in the arnesi package: http://common-lisp.net/project/bese/repos/arnesi_dev/src/queue.lisp
Next: Modules, Previous: Introduction, Up: The pettomato-deque Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
A set of double-ended queue implementations.
Austin Haas <austin@pettomato.com>
MIT
0.1.1
src (module).
Next: Files, Previous: Systems, Up: The pettomato-deque Reference Manual [Contents][Index]
Modules are listed depth-first from the system components tree.
pettomato-deque (system).
Next: Packages, Previous: Modules, Up: The pettomato-deque Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: pettomato-deque/src/package.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
pettomato-deque (system).
Next: pettomato-deque/src/deque.lisp, Previous: pettomato-deque/pettomato-deque.asd, Up: Lisp [Contents][Index]
src (module).
Next: pettomato-deque/src/ideque.lisp, Previous: pettomato-deque/src/package.lisp, Up: Lisp [Contents][Index]
package.lisp (file).
src (module).
Previous: pettomato-deque/src/deque.lisp, Up: Lisp [Contents][Index]
deque.lisp (file).
src (module).
Next: Definitions, Previous: Files, Up: The pettomato-deque Reference Manual [Contents][Index]
Packages are listed by definition order.
common-lisp.
Next: Indexes, Previous: Packages, Up: The pettomato-deque 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]
Next: Ordinary functions, Previous: Public Interface, Up: Public Interface [Contents][Index]
Iterate through deque in the order that pop-front would return elements, and bind each element to element in body. element is bound using a symbol-macrolet so that the value referenced by element can be changed using setf.
Next: Generic functions, Previous: Macros, Up: Public Interface [Contents][Index]
Returns the elements of the queue as a list. The original queue is not modified.
Next: Standalone methods, Previous: Ordinary functions, Up: Public Interface [Contents][Index]
Returns the number of elements currently in the queue.
Returns a generalized boolean: true if the queue is empty, otherwise false.
Move front up to index. It is permissible for index
to be greater than max-index; the queue will be cleared and min-index
and max-index will be set to index. Returns deque.
Ensure that deque is large enough to be indexed at
index. If not, value will be pushed on until it is. If value is a
function, the function will be called and the returned value will be
used. Returns deque.
Accesses the element of the queue specified by index.
Returns the element at the back of the queue without removing it from the queue.
Returns the element at the front of the queue without removing it from the queue.
Removes the element at the back of the queue and returns it.
Removes the element at the front of the queue and returns it.
Push value on to the back of queue. Returns queue.
Push value on to the front of queue. Returns queue.
Next: Classes, Previous: Generic functions, Up: Public Interface [Contents][Index]
Previous: Standalone methods, Up: Public Interface [Contents][Index]
A double ended queue.
A double ended queue that allows indexing.
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]
Previous: Ordinary functions, Up: Internals [Contents][Index]
Previous: Definitions, Up: The pettomato-deque Reference Manual [Contents][Index]
Jump to: | (
B D E F G H I M N P T |
---|
Jump to: | (
B D E F G H I M N P T |
---|
Next: Data types, Previous: Functions, Up: Indexes [Contents][Index]
Jump to: | B H M S T |
---|
Jump to: | B H M S T |
---|
Jump to: | C D F I M P S |
---|
Jump to: | C D F I M P S |
---|