Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the priority-queue Reference Manual, version 0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Aug 15 05:37:48 2022 GMT+0.
Next: Systems, Previous: The priority-queue Reference Manual, Up: The priority-queue Reference Manual [Contents][Index]
PRIORITY-QUEUE -- a priority queue for Common Lisp The implementation uses an array-based heap. Licence: Copyright (c) 2012 David SorokinPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Next: Files, Previous: Introduction, Up: The priority-queue Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
A priority queue for Common Lisp.
David Sorokin
MIT
0.1
Next: Packages, Previous: Systems, Up: The priority-queue Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: priority-queue/priority-queue.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
priority-queue (system).
Previous: priority-queue/priority-queue.asd, Up: Lisp [Contents][Index]
priority-queue (system).
Next: Definitions, Previous: Files, Up: The priority-queue Reference Manual [Contents][Index]
Packages are listed by definition order.
pqueue
common-lisp.
Next: Indexes, Previous: Packages, Up: The priority-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]
Next: Standalone methods, Previous: Public Interface, Up: Public Interface [Contents][Index]
Make a priority queue with the specfied types for keys and values.
Clear the piority queue.
Test whether the priority queue is empty.
Take an element with the minimal priority key and return a multiple value: the element value, its key.
Return the minimal priority key.
Return the value with the minimal priority key.
Dequeue the element with the minimal priority key and return a multiple value: the element value, its key.
Enqueue a new value with the specified priority key and return the queue.
Previous: Ordinary functions, Up: Public Interface [Contents][Index]
Previous: Public Interface, Up: Definitions [Contents][Index]
Next: Structures, Previous: Internals, Up: Internals [Contents][Index]
Increase the capacity of the priority queue.
keys.
Print the priority queue.
Sift down the key and value starting at the specified index.
Sift up the key and value starting at the specified index.
Previous: Ordinary functions, Up: Internals [Contents][Index]
structure-object.
common-lisp.
common-lisp.
Previous: Definitions, Up: The priority-queue Reference Manual [Contents][Index]
Jump to: | %
(
C F I M P S |
---|
Jump to: | %
(
C F I M P S |
---|
Next: Data types, Previous: Functions, Up: Indexes [Contents][Index]
Jump to: | K L P S V |
---|
Jump to: | K L P S V |
---|
Jump to: | F P R S |
---|
Jump to: | F P R S |
---|