This is the funds Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 06:09:24 2024 GMT+0.
funds/funds.asdfunds/package.lispfunds/stack.lispfunds/trees/classes.lispfunds/trees/constructors.lispfunds/trees/bt.lispfunds/trees/avl.lispfunds/trees/stitch-tree.lispfunds/trees/tree-as-alist.lispfunds/trees/tree-empty-p.lispfunds/trees/tree-insert.lispfunds/trees/tree-remove.lispfunds/trees/tree-find.lispfunds/trees/tree-weight.lispfunds/trees/tree-height.lispfunds/trees/utilities.lispfunds/heap/heap.lispfunds/heap/heap-empty-p.lispfunds/heap/heap-insert.lispfunds/heap/heap-remove.lispfunds/heap/heap-first.lispfunds/vector.lispfunds/hash.lispfunds/hash-set.lispfunds/queue.lispThe main system appears first, followed by any subsystem dependency.
fundspackage.lisp (file).
stack.lisp (file).
trees (module).
heap (module).
vector.lisp (file).
hash.lisp (file).
hash-set.lisp (file).
queue.lisp (file).
Modules are listed depth-first from the system components tree.
funds/treesstack.lisp (file).
funds (system).
classes.lisp (file).
constructors.lisp (file).
bt.lisp (file).
avl.lisp (file).
stitch-tree.lisp (file).
tree-as-alist.lisp (file).
tree-empty-p.lisp (file).
tree-insert.lisp (file).
tree-remove.lisp (file).
tree-find.lisp (file).
tree-weight.lisp (file).
tree-height.lisp (file).
utilities.lisp (file).
funds/heaptrees (module).
funds (system).
heap.lisp (file).
heap-empty-p.lisp (file).
heap-insert.lisp (file).
heap-remove.lisp (file).
heap-first.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
funds/funds.asdfunds/package.lispfunds/stack.lispfunds/trees/classes.lispfunds/trees/constructors.lispfunds/trees/bt.lispfunds/trees/avl.lispfunds/trees/stitch-tree.lispfunds/trees/tree-as-alist.lispfunds/trees/tree-empty-p.lispfunds/trees/tree-insert.lispfunds/trees/tree-remove.lispfunds/trees/tree-find.lispfunds/trees/tree-weight.lispfunds/trees/tree-height.lispfunds/trees/utilities.lispfunds/heap/heap.lispfunds/heap/heap-empty-p.lispfunds/heap/heap-insert.lispfunds/heap/heap-remove.lispfunds/heap/heap-first.lispfunds/vector.lispfunds/hash.lispfunds/hash-set.lispfunds/queue.lispfunds/stack.lisppackage.lisp (file).
funds (system).
make-stack (function).
map-stack (function).
stack-as-list (function).
stack-count (function).
stack-count-if (function).
stack-empty-p (function).
stack-from-list (function).
stack-pop (function).
stack-push (function).
stack-size (function).
stack-top (function).
funds/trees/classes.lisptrees (module).
avl-height (reader method).
avl-leaf (class).
avl-tree (class).
binary-tree (class).
bt-leaf (class).
bt-left (reader method).
bt-right (reader method).
leaf (class).
tree (class).
funds/trees/constructors.lispclasses.lisp (file).
trees (module).
make-avl-tree (function).
make-binary-tree (function).
+avl-leaf+ (special variable).
+bt-leaf+ (special variable).
make-avl-leaf (function).
make-bt-leaf (function).
funds/trees/bt.lispconstructors.lisp (file).
trees (module).
left-p (function).
next-in-order (function).
other-side (function).
side-to-insert (function).
tree-child (function).
funds/trees/avl.lispbt.lisp (file).
trees (module).
balance (function).
balanced-p (function).
heavier-p (function).
height-difference (function).
parent-height (function).
rotate (function).
funds/trees/stitch-tree.lispavl.lisp (file).
trees (module).
stitch-avl-tree (function).
stitch-binary-tree (function).
stitch-tree (method).
stitch-tree (method).
funds/trees/tree-as-alist.lispstitch-tree.lisp (file).
trees (module).
tree-as-alist (generic function).
tree-as-pre-order-alist (method).
tree-as-pre-order-alist (method).
funds/trees/tree-empty-p.lisptree-as-alist.lisp (file).
trees (module).
tree-empty-p (generic function).
funds/trees/tree-insert.lisptree-empty-p.lisp (file).
trees (module).
tree-insert (generic function).
funds/trees/tree-remove.lisptree-insert.lisp (file).
trees (module).
tree-remove (generic function).
remove-root (function).
remove-root-with-children (function).
funds/trees/tree-find.lisptree-remove.lisp (file).
trees (module).
tree-find (generic function).
funds/trees/tree-weight.lisptree-find.lisp (file).
trees (module).
tree-weight (generic function).
funds/trees/tree-height.lisptree-weight.lisp (file).
trees (module).
tree-height (generic function).
funds/trees/utilities.lisptree-height.lisp (file).
trees (module).
map-tree (function).
tree-count (function).
tree-count-if (function).
funds/heap/heap.lispheap (module).
make-heap (function).
tree-weight (method).
+heap-leaf+ (special variable).
attach-heap (function).
heap (class).
heap-leaf (class).
heap-priority (reader method).
heap-weight (reader method).
make-heap-leaf (function).
stitch-tree (method).
funds/heap/heap-empty-p.lispheap.lisp (file).
heap (module).
heap-empty-p (function).
funds/heap/heap-insert.lispheap-empty-p.lisp (file).
heap (module).
heap-insert (generic function).
last-direction (function).
next-direction (function).
path-direction (function).
funds/heap/heap-remove.lispheap-insert.lisp (file).
heap (module).
heap-remove (generic function).
bubble-down (function).
clip-last (function).
in-order-p (function).
last-node (function).
no-children-p (function).
funds/heap/heap-first.lispheap-remove.lisp (file).
heap (module).
heap-first (function).
funds/vector.lispheap (module).
funds (system).
make-vector (function).
map-vector (function).
vector-as-list (function).
vector-copy (function).
vector-count (function).
vector-count-if (function).
vector-from-list (function).
vector-ref (function).
vector-set (function).
vector-size (function).
funds/hash.lispvector.lisp (file).
funds (system).
hash-as-alist (function).
hash-from-alist (function).
hash-keys (function).
hash-ref (function).
hash-remove (function).
hash-set (function).
hash-size (function).
make-hash (function).
map-hash (function).
copy-dict (function).
dict (structure).
dict-hash (reader).
(setf dict-hash) (writer).
dict-p (function).
dict-test (reader).
(setf dict-test) (writer).
dict-tree (reader).
(setf dict-tree) (writer).
hash-values (function).
make-dict (function).
funds/hash-set.lisphash.lisp (file).
funds (system).
hash-as-list (function).
hash-difference (function).
hash-from-list (function).
hash-intersection (function).
hash-union (function).
funds/queue.lisphash-set.lisp (file).
funds (system).
dequeue (function).
enqueue (function).
make-queue (function).
map-queue (function).
queue-as-list (function).
queue-count (function).
queue-count-if (function).
queue-empty-p (function).
queue-first (function).
queue-size (function).
queue (class).
queue-heap (reader method).
queue-next-priority (reader method).
Packages are listed by definition order.
fundscommon-lisp.
bt-key (generic reader).
bt-value (generic reader).
dequeue (function).
enqueue (function).
hash-as-alist (function).
hash-as-list (function).
hash-difference (function).
hash-from-alist (function).
hash-from-list (function).
hash-intersection (function).
hash-keys (function).
hash-ref (function).
hash-remove (function).
hash-set (function).
hash-size (function).
hash-union (function).
heap-empty-p (function).
heap-first (function).
heap-insert (generic function).
heap-remove (generic function).
make-avl-tree (function).
make-binary-tree (function).
make-hash (function).
make-heap (function).
make-queue (function).
make-stack (function).
make-vector (function).
map-hash (function).
map-queue (function).
map-stack (function).
map-tree (function).
map-vector (function).
queue-as-list (function).
queue-count (function).
queue-count-if (function).
queue-empty-p (function).
queue-first (function).
queue-size (function).
stack-as-list (function).
stack-count (function).
stack-count-if (function).
stack-empty-p (function).
stack-from-list (function).
stack-pop (function).
stack-push (function).
stack-size (function).
stack-top (function).
tree-as-alist (generic function).
tree-count (function).
tree-count-if (function).
tree-empty-p (generic function).
tree-find (generic function).
tree-height (generic function).
tree-insert (generic function).
tree-remove (generic function).
tree-weight (generic function).
vector-as-list (function).
vector-copy (function).
vector-count (function).
vector-count-if (function).
vector-from-list (function).
vector-ref (function).
vector-set (function).
vector-size (function).
+avl-leaf+ (special variable).
+bt-leaf+ (special variable).
+heap-leaf+ (special variable).
attach-heap (function).
avl-height (generic reader).
avl-leaf (class).
avl-tree (class).
balance (function).
balanced-p (function).
binary-tree (class).
bt-leaf (class).
bt-left (generic reader).
bt-right (generic reader).
bubble-down (function).
clip-last (function).
copy-dict (function).
dict (structure).
dict-hash (reader).
(setf dict-hash) (writer).
dict-p (function).
dict-test (reader).
(setf dict-test) (writer).
dict-tree (reader).
(setf dict-tree) (writer).
hash-values (function).
heap (class).
heap-leaf (class).
heap-priority (generic reader).
heap-weight (generic reader).
heavier-p (function).
height-difference (function).
in-order-p (function).
last-direction (function).
last-node (function).
leaf (class).
left-p (function).
make-avl-leaf (function).
make-bt-leaf (function).
make-dict (function).
make-heap-leaf (function).
next-direction (function).
next-in-order (function).
no-children-p (function).
other-side (function).
parent-height (function).
path-direction (function).
queue (class).
queue-heap (generic reader).
queue-next-priority (generic reader).
remove-root (function).
remove-root-with-children (function).
rotate (function).
side-to-insert (function).
stitch-avl-tree (function).
stitch-binary-tree (function).
stitch-tree (generic function).
tree (class).
tree-as-pre-order-alist (generic function).
tree-child (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
The queue that results when the first item is removed from the given queue.
The queue that results when the given item is equeued on the given queue.
An alist containing the same key-value pairs as the given hash.
Elements of the first hash that are not in hashes.
Elements that all hashes share.
The value associated with the given key in the given hash. A second value is returned to indicate whether the key is associated with any value or is not found.
A hash similar to the given hash, except that key does not map to any value in the returned hash.
A hash similar to the given hash except that key maps to value in the returned hash.
Elements of all hashes combine into one hash.
Whether the given heap has any elements.
The first value on the given heap.
An empty AVL tree.
An empty binary tree.
An empty hash that hashes occording to the given hash function, which defaults to #’sxhash and and tests according to the given test function, which defaults to #’eql.
An empty binary heap.
An empty stack.
A functional vector of the given size with the given initial contents.
A new hash where function has been applied to each key-value and the result of the each function call is the new value.
A queue containing items that are the result of applying function to the items in the given queue.
A stack whose elements are those of the given stack when function is applied to them.
A tree each node of which corresponds to the application of function to one node of the given tree.
A new vector whose elements are the results of the application of the given function to the elements of the given vector.
The elements in the given queue, returned as a list, in the order they would be dequeued from the given queue.
The number of elements in the given queue that satisfy the test.
The number of elements in the given queue that satisfy the test.
Whether the given queue does not contain any items.
The value at the head of the given queue.
The number of items in the given queue.
This function is here in case the implementation of stack changes from what it is now, a list.
Whether the given stack is empty.
This function is here in case the implementation of stack changes from what it is now, a list.
The stack that results when the top item is popped off the given stack.
The stack that results when the given item is pushed onto the given stack.
The number of items on this stack; note that this is an O(n) operation.
The top item on the given stack.
The number of sub-trees in the tree that satisfy the test.
The number of sub-trees in the given tree that satisfy the test.
The number of elements in the given vector that satisfy the test.
The number of elements in the given vector that satisfy the test.
The element at the given index of the given vector.
An vector similar to the given vector except that index and element are associated in the returned vector.
The number of elements in the given vector.
binary-tree)) ¶automatically generated reader method
key.
binary-tree)) ¶automatically generated reader method
A new heap, similar to the given heap, except that the priority-value pair is inserted into the retured heap according to the standard heap insertion algorithm.
The heap that results when first value is removed from the given heap.
An association list containing the key-value pairs in the given tree.
binary-tree)) ¶Whether the given tree does not contain key-value pairs.
The value to which the given key is mapped, or nil if this tree contains no
such key. The second value returned indicates whether the tree contained the
key. So
(find t k) -> nil t
if k maps to nil. But
(find t k) -> nil nil
if there is no mapping for k in the tree.
The height of the given tree.
binary-tree)) ¶A new tree similar to the given tree except that the given key and
value are now associated with one another. If the given key is already
contained in the tree, according to the test function, then the old value
is replaced by the specified value in the returned tree. The order function
specifies whether the given key-value pair should be inserted to the left or
right of the given tree. The given tree is not modified.
A new tree with the given key removed. The test function is used to compare the tree’s key to the given key. The order function is used to determine whether the key can be found to the left or right if it is not found at the root.
binary-tree) key &key test order) ¶The number of nodes in the given tree.
binary-tree)) ¶The heap that results when the last node is removed.
binary-tree)) ¶automatically generated reader method
left.
binary-tree)) ¶automatically generated reader method
binary-tree) &key key value left right) ¶binary-tree)) ¶A leaf node of an AVL tree.
leaf.
A height-balanced binary tree.
A binary tree that holds a key-value pair in its root.
A leaf node of an AVL tree.
leaf.
A leaf with no data or children.
tree.
The foundation of all trees.
| Jump to: | (
A B C D E F G H I L M N O P Q R S T V |
|---|
| Jump to: | (
A B C D E F G H I L M N O P Q R S T V |
|---|
| Jump to: | +
H K L N R S T V W |
|---|
| Jump to: | +
H K L N R S T V W |
|---|
| Jump to: | A B C D F H L M P Q S T U V |
|---|
| Jump to: | A B C D F H L M P Q S T U V |
|---|