This is the clump Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Sep 15 04:48:09 2024 GMT+0.
clump/clump.asd
clump-binary-tree/clump-binary-tree.asd
clump-2-3-tree/clump-2-3-tree.asd
clump-binary-tree/packages.lisp
clump-binary-tree/binary-tree.lisp
clump-binary-tree/link-unlink.lisp
clump-binary-tree/conditions.lisp
clump-binary-tree/replace-child.lisp
clump-binary-tree/rotation.lisp
clump-binary-tree/recursive-traversal.lisp
clump-binary-tree/iterative-traversal.lisp
clump-binary-tree/splay.lisp
clump-binary-tree/docstrings-english.lisp
clump-binary-tree/condition-reporters-english.lisp
clump-2-3-tree/packages.lisp
clump-2-3-tree/2-3-tree.lisp
clump-2-3-tree/insertion.lisp
clump-2-3-tree/deletion.lisp
clump-2-3-tree/conditions.lisp
clump-2-3-tree/docstrings-english.lisp
clump-2-3-tree/condition-reporters-english.lisp
The main system appears first, followed by any subsystem dependency.
clump
Library for operations on different kinds of trees
Robert Strandh <robert.strandh@gmail.com>
FreeBSD, see file LICENSE.text
clump-binary-tree
(system).
clump-2-3-tree
(system).
clump-binary-tree
acclimation
(system).
packages.lisp
(file).
binary-tree.lisp
(file).
link-unlink.lisp
(file).
conditions.lisp
(file).
replace-child.lisp
(file).
rotation.lisp
(file).
recursive-traversal.lisp
(file).
iterative-traversal.lisp
(file).
splay.lisp
(file).
docstrings-english.lisp
(file).
condition-reporters-english.lisp
(file).
clump-2-3-tree
acclimation
(system).
packages.lisp
(file).
2-3-tree.lisp
(file).
insertion.lisp
(file).
deletion.lisp
(file).
conditions.lisp
(file).
docstrings-english.lisp
(file).
condition-reporters-english.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
clump/clump.asd
clump-binary-tree/clump-binary-tree.asd
clump-2-3-tree/clump-2-3-tree.asd
clump-binary-tree/packages.lisp
clump-binary-tree/binary-tree.lisp
clump-binary-tree/link-unlink.lisp
clump-binary-tree/conditions.lisp
clump-binary-tree/replace-child.lisp
clump-binary-tree/rotation.lisp
clump-binary-tree/recursive-traversal.lisp
clump-binary-tree/iterative-traversal.lisp
clump-binary-tree/splay.lisp
clump-binary-tree/docstrings-english.lisp
clump-binary-tree/condition-reporters-english.lisp
clump-2-3-tree/packages.lisp
clump-2-3-tree/2-3-tree.lisp
clump-2-3-tree/insertion.lisp
clump-2-3-tree/deletion.lisp
clump-2-3-tree/conditions.lisp
clump-2-3-tree/docstrings-english.lisp
clump-2-3-tree/condition-reporters-english.lisp
clump-binary-tree/clump-binary-tree.asd
clump-binary-tree
(system).
clump-2-3-tree/clump-2-3-tree.asd
clump-2-3-tree
(system).
clump-binary-tree/binary-tree.lisp
packages.lisp
(file).
clump-binary-tree
(system).
initialize-instance
(method).
left
(generic reader).
(setf left)
(generic function).
node
(class).
node-with-parent
(class).
parent
(reader method).
(setf parent)
(writer method).
right
(generic reader).
(setf right)
(generic function).
simple-node
(class).
node-p
(generic function).
clump-binary-tree/link-unlink.lisp
binary-tree.lisp
(file).
clump-binary-tree
(system).
link-left
(generic function).
link-right
(generic function).
unlink-left
(generic function).
unlink-right
(generic function).
clump-binary-tree/conditions.lisp
link-unlink.lisp
(file).
clump-binary-tree
(system).
invalid-binary-tree
(condition).
left-subtree-must-be-non-nil
(condition).
right-subtree-must-be-non-nil
(condition).
binary-tree-error
(condition).
child
(reader method).
must-be-child
(condition).
tree
(reader method).
tree
(reader method).
tree
(reader method).
tree
(reader method).
clump-binary-tree/replace-child.lisp
conditions.lisp
(file).
clump-binary-tree
(system).
replace-child
(generic function).
clump-binary-tree/rotation.lisp
replace-child.lisp
(file).
clump-binary-tree
(system).
rotate-left
(generic function).
rotate-left-with-child
(generic function).
rotate-right
(generic function).
rotate-right-with-child
(generic function).
clump-binary-tree/recursive-traversal.lisp
rotation.lisp
(file).
clump-binary-tree
(system).
recursive-traversal
(generic function).
clump-binary-tree/iterative-traversal.lisp
recursive-traversal.lisp
(file).
clump-binary-tree
(system).
iterative-traversal
(generic function).
clump-binary-tree/splay.lisp
iterative-traversal.lisp
(file).
clump-binary-tree
(system).
splay
(generic function).
splay-step
(generic function).
splay-step-with-left-parent
(generic function).
splay-step-with-left-parent-and-left-grandparent
(generic function).
splay-step-with-left-parent-and-right-grandparent
(generic function).
splay-step-with-parent
(generic function).
splay-step-with-right-parent
(generic function).
splay-step-with-right-parent-and-left-grandparent
(generic function).
splay-step-with-right-parent-and-right-grandparent
(generic function).
splay-step-with-left-parent-and-grandparent
(generic function).
splay-step-with-right-parent-and-grandparent
(generic function).
clump-binary-tree/docstrings-english.lisp
splay.lisp
(file).
clump-binary-tree
(system).
clump-binary-tree/condition-reporters-english.lisp
docstrings-english.lisp
(file).
clump-binary-tree
(system).
report-condition
(method).
report-condition
(method).
report-condition
(method).
report-condition
(method).
clump-2-3-tree/2-3-tree.lisp
packages.lisp
(file).
clump-2-3-tree
(system).
2-node
(class).
2-node-class
(reader method).
3-node
(class).
3-node-class
(reader method).
contents
(reader method).
contents
(reader method).
(setf contents)
(writer method).
(setf contents)
(writer method).
initialize-instance
(method).
initialize-instance
(method).
leaf
(class).
leaf-class
(reader method).
left
(reader method).
left
(reader method).
middle
(reader method).
parent
(reader method).
(setf parent)
(writer method).
right
(reader method).
right
(reader method).
tree
(reader method).
tree
(class).
(setf %left)
(writer method).
(setf %left)
(writer method).
(setf %middle)
(writer method).
(setf %right)
(writer method).
(setf %right)
(writer method).
2-node-p
(generic function).
3-node-p
(generic function).
node
(class).
clump-2-3-tree/insertion.lisp
2-3-tree.lisp
(file).
clump-2-3-tree
(system).
insert
(generic function).
insert-after
(generic function).
insert-before
(generic function).
replace
(generic function).
split
(generic function).
clump-2-3-tree/deletion.lisp
insertion.lisp
(file).
clump-2-3-tree
(system).
delete
(generic function).
delete-child
(generic function).
replace-and-shrink
(generic function).
clump-2-3-tree/conditions.lisp
deletion.lisp
(file).
clump-2-3-tree
(system).
tree
(reader method).
2-3-tree-error
(condition).
tree-for-insertion-must-be-empty
(condition).
clump-2-3-tree/docstrings-english.lisp
conditions.lisp
(file).
clump-2-3-tree
(system).
clump-2-3-tree/condition-reporters-english.lisp
docstrings-english.lisp
(file).
clump-2-3-tree
(system).
report-condition
(method).
Packages are listed by definition order.
clump-2-3-tree
common-lisp
.
2-node
(class).
2-node-class
(generic reader).
3-node
(class).
3-node-class
(generic reader).
contents
(generic reader).
(setf contents)
(generic writer).
delete
(generic function).
delete-child
(generic function).
insert
(generic function).
insert-after
(generic function).
insert-before
(generic function).
leaf
(class).
leaf-class
(generic reader).
left
(generic reader).
middle
(generic reader).
parent
(generic reader).
(setf parent)
(generic writer).
replace
(generic function).
replace-and-shrink
(generic function).
right
(generic reader).
split
(generic function).
tree
(generic reader).
tree
(class).
(setf %left)
(generic writer).
(setf %middle)
(generic writer).
(setf %right)
(generic writer).
2-3-tree-error
(condition).
2-node-p
(generic function).
3-node-p
(generic function).
node
(class).
tree-for-insertion-must-be-empty
(condition).
clump-binary-tree
common-lisp
.
invalid-binary-tree
(condition).
iterative-traversal
(generic function).
left
(generic reader).
(setf left)
(generic function).
left-subtree-must-be-non-nil
(condition).
node
(class).
node-with-parent
(class).
parent
(generic reader).
(setf parent)
(generic writer).
recursive-traversal
(generic function).
replace-child
(generic function).
right
(generic reader).
(setf right)
(generic function).
right-subtree-must-be-non-nil
(condition).
rotate-left
(generic function).
rotate-left-with-child
(generic function).
rotate-right
(generic function).
rotate-right-with-child
(generic function).
simple-node
(class).
splay
(generic function).
splay-step
(generic function).
splay-step-with-left-parent
(generic function).
splay-step-with-left-parent-and-left-grandparent
(generic function).
splay-step-with-left-parent-and-right-grandparent
(generic function).
splay-step-with-parent
(generic function).
splay-step-with-right-parent
(generic function).
splay-step-with-right-parent-and-left-grandparent
(generic function).
splay-step-with-right-parent-and-right-grandparent
(generic function).
binary-tree-error
(condition).
child
(generic reader).
link-left
(generic function).
link-right
(generic function).
must-be-child
(condition).
node-p
(generic function).
splay-step-with-left-parent-and-grandparent
(generic function).
splay-step-with-right-parent-and-grandparent
(generic function).
tree
(generic reader).
unlink-left
(generic function).
unlink-right
(generic function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
simple-node
) pre in post) ¶node-with-parent
) pre in post) ¶Given a binary tree, return the left child of that tree.
If an object other than a binary tree is given,
then an error of type INVALID-BINARY-TREE is signaled.
Given two binary trees, NEW and TREE,
make NEW the new left child of TREE.
NEW may be a node or NIL.
If TREE is NIL an error of type,
INVALID-BINARY-TREE is signaled.
node-with-parent
)) ¶node-with-parent
)) ¶automatically generated reader method
node-with-parent
)) ¶automatically generated writer method
Given a binary tree, return the right child of that tree.
If an object other than a binary tree is given,
then an error of type INVALID-BINARY-TREE is signaled.
Given two binary trees, NEW and TREE,
make NEW the new right child of TREE.
NEW may be a node or NIL.
If TREE is NIL an error of type,
INVALID-BINARY-TREE is signaled.
node-with-parent
)) ¶Given a binary tree TREE, apply a left rotation to it.
If TREE is not a node, an error of type,
INVALID-BINARY-TREE is signaled.
If the right child of TREE is not a node, an error of type
RIGHT-SUBTREE-MUST-BE-NON-NIL is signaled.
The new root of the tree is returned.
If TREE has a parent node, no provision is made
for replacing TREE with the return value of this function.
Client code is responsible for doing that.
node-with-parent
) (child node-with-parent
)) ¶Given a binary tree TREE, apply a right rotation to it.
If TREE is not a node, an error of type,
INVALID-BINARY-TREE is signaled.
If the left child of TREE is not a node, an error of type
LEFT-SUBTREE-MUST-BE-NON-NIL is signaled.
The new root of the tree is returned.
If TREE has a parent node, no provision is made
for replacing TREE with the return value of this function.
Client code is responsible for doing that.
node-with-parent
) (child node-with-parent
)) ¶node-with-parent
)) ¶node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶node-with-parent
) (parent null
)) ¶node-with-parent
) (parent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶tree-for-insertion-must-be-empty
)) ¶tree-for-insertion-must-be-empty
) stream (language english
)) ¶acclimation
.
right-subtree-must-be-non-nil
) stream (language english
)) ¶acclimation
.
left-subtree-must-be-non-nil
) stream (language english
)) ¶acclimation
.
invalid-binary-tree
) stream (language english
)) ¶acclimation
.
must-be-child
) stream (language english
)) ¶acclimation
.
node
.
iterative-traversal
.
(setf left)
.
link-left
.
link-right
.
(setf parent)
.
parent
.
(setf right)
.
rotate-left-with-child
.
rotate-right-with-child
.
splay
.
splay-step
.
splay-step-with-left-parent
.
splay-step-with-left-parent-and-grandparent
.
splay-step-with-left-parent-and-grandparent
.
splay-step-with-left-parent-and-left-grandparent
.
splay-step-with-left-parent-and-right-grandparent
.
splay-step-with-parent
.
splay-step-with-parent
.
splay-step-with-right-parent
.
splay-step-with-right-parent-and-grandparent
.
splay-step-with-right-parent-and-grandparent
.
splay-step-with-right-parent-and-left-grandparent
.
splay-step-with-right-parent-and-right-grandparent
.
unlink-left
.
unlink-right
.
:parent
:leaf-class
This slot is read-only.
:2-node-class
This slot is read-only.
:3-node-class
This slot is read-only.
must-be-child
)) ¶node-with-parent
) (child node-with-parent
)) ¶node-with-parent
) (child node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent null
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent null
)) ¶node-with-parent
) (parent node-with-parent
) (grandparent node-with-parent
)) ¶must-be-child
)) ¶left-subtree-must-be-non-nil
)) ¶right-subtree-must-be-non-nil
)) ¶invalid-binary-tree
)) ¶node-with-parent
) (child node-with-parent
)) ¶node-with-parent
) (child node-with-parent
)) ¶condition
.
error
.
condition
.
error
.
Jump to: | (
2
3
C D G I L M N P R S T U |
---|
Jump to: | (
2
3
C D G I L M N P R S T U |
---|
Jump to: | %
S |
---|
Jump to: | %
S |
---|
Jump to: | 2
3
B C D F I L M N P R S T |
---|
Jump to: | 2
3
B C D F I L M N P R S T |
---|