Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the clump Reference Manual, generated automatically by Declt version 3.0 "Montgomery Scott" on Tue Dec 22 13:06:16 2020 GMT+0.
• Introduction | What clump is all about | |
• Systems | The systems documentation | |
• Files | The files documentation | |
• Packages | The packages documentation | |
• Definitions | The symbols documentation | |
• Indexes | Concepts, functions, variables and data types |
The purpose of this repository is to provide a collection of implementations of trees. In contrast to existing libraries such as cl-containers, we do not want to impose a particular use for the trees. Instead, we aim for a stratified design, allowing client code to choose between different levels of abstraction. As a consequence of this policy, we provide low-level interfaces where the concrete representation is exposed, but also high level interfaces where the trees can be used as search trees or as trees that represent sequences of objects.
Next: Files, Previous: Introduction, Up: Top [Contents][Index]
The main system appears first, followed by any subsystem dependency.
• The clump system | ||
• The clump-binary-tree system | ||
• The clump-2-3-tree system |
Next: The clump-binary-tree system, Previous: Systems, Up: Systems [Contents][Index]
Robert Strandh <robert.strandh@gmail.com>
FreeBSD, see file LICENSE.text
Library for operations on different kinds of trees
clump.asd (file)
Next: The clump-2-3-tree system, Previous: The clump system, Up: Systems [Contents][Index]
acclimation
clump-binary-tree.asd (file)
Previous: The clump-binary-tree system, Up: Systems [Contents][Index]
acclimation
clump-2-3-tree.asd (file)
Files are sorted by type and then listed depth-first from the systems components trees.
• Lisp files |
Next: The clump-binary-tree․asd file, Previous: Lisp files, Up: Lisp files [Contents][Index]
clump.asd
clump (system)
Next: The clump-2-3-tree․asd file, Previous: The clump․asd file, Up: Lisp files [Contents][Index]
Binary-tree/clump-binary-tree.asd
clump-binary-tree (system)
Next: The clump-binary-tree/packages․lisp file, Previous: The clump-binary-tree․asd file, Up: Lisp files [Contents][Index]
2-3-tree/clump-2-3-tree.asd
clump-2-3-tree (system)
Next: The clump-binary-tree/binary-tree․lisp file, Previous: The clump-2-3-tree․asd file, Up: Lisp files [Contents][Index]
clump-binary-tree (system)
Binary-tree/packages.lisp
Next: The clump-binary-tree/link-unlink․lisp file, Previous: The clump-binary-tree/packages․lisp file, Up: Lisp files [Contents][Index]
packages.lisp (file)
clump-binary-tree (system)
Binary-tree/binary-tree.lisp
Next: The clump-binary-tree/conditions․lisp file, Previous: The clump-binary-tree/binary-tree․lisp file, Up: Lisp files [Contents][Index]
binary-tree.lisp (file)
clump-binary-tree (system)
Binary-tree/link-unlink.lisp
Next: The clump-binary-tree/replace-child․lisp file, Previous: The clump-binary-tree/link-unlink․lisp file, Up: Lisp files [Contents][Index]
link-unlink.lisp (file)
clump-binary-tree (system)
Binary-tree/conditions.lisp
Next: The clump-binary-tree/rotation․lisp file, Previous: The clump-binary-tree/conditions․lisp file, Up: Lisp files [Contents][Index]
conditions.lisp (file)
clump-binary-tree (system)
Binary-tree/replace-child.lisp
Next: The clump-binary-tree/recursive-traversal․lisp file, Previous: The clump-binary-tree/replace-child․lisp file, Up: Lisp files [Contents][Index]
replace-child.lisp (file)
clump-binary-tree (system)
Binary-tree/rotation.lisp
Next: The clump-binary-tree/iterative-traversal․lisp file, Previous: The clump-binary-tree/rotation․lisp file, Up: Lisp files [Contents][Index]
rotation.lisp (file)
clump-binary-tree (system)
Binary-tree/recursive-traversal.lisp
Next: The clump-binary-tree/splay․lisp file, Previous: The clump-binary-tree/recursive-traversal․lisp file, Up: Lisp files [Contents][Index]
recursive-traversal.lisp (file)
clump-binary-tree (system)
Binary-tree/iterative-traversal.lisp
Next: The clump-binary-tree/docstrings-english․lisp file, Previous: The clump-binary-tree/iterative-traversal․lisp file, Up: Lisp files [Contents][Index]
iterative-traversal.lisp (file)
clump-binary-tree (system)
Binary-tree/splay.lisp
Next: The clump-binary-tree/condition-reporters-english․lisp file, Previous: The clump-binary-tree/splay․lisp file, Up: Lisp files [Contents][Index]
splay.lisp (file)
clump-binary-tree (system)
Binary-tree/docstrings-english.lisp
Next: The clump-2-3-tree/packages․lisp file, Previous: The clump-binary-tree/docstrings-english․lisp file, Up: Lisp files [Contents][Index]
docstrings-english.lisp (file)
clump-binary-tree (system)
Binary-tree/condition-reporters-english.lisp
Next: The clump-2-3-tree/2-3-tree․lisp file, Previous: The clump-binary-tree/condition-reporters-english․lisp file, Up: Lisp files [Contents][Index]
clump-2-3-tree (system)
2-3-tree/packages.lisp
Next: The clump-2-3-tree/insertion․lisp file, Previous: The clump-2-3-tree/packages․lisp file, Up: Lisp files [Contents][Index]
packages.lisp (file)
clump-2-3-tree (system)
2-3-tree/2-3-tree.lisp
Next: The clump-2-3-tree/deletion․lisp file, Previous: The clump-2-3-tree/2-3-tree․lisp file, Up: Lisp files [Contents][Index]
2-3-tree.lisp (file)
clump-2-3-tree (system)
2-3-tree/insertion.lisp
Next: The clump-2-3-tree/conditions․lisp file, Previous: The clump-2-3-tree/insertion․lisp file, Up: Lisp files [Contents][Index]
insertion.lisp (file)
clump-2-3-tree (system)
2-3-tree/deletion.lisp
Next: The clump-2-3-tree/docstrings-english․lisp file, Previous: The clump-2-3-tree/deletion․lisp file, Up: Lisp files [Contents][Index]
deletion.lisp (file)
clump-2-3-tree (system)
2-3-tree/conditions.lisp
tree (method)
Next: The clump-2-3-tree/condition-reporters-english․lisp file, Previous: The clump-2-3-tree/conditions․lisp file, Up: Lisp files [Contents][Index]
conditions.lisp (file)
clump-2-3-tree (system)
2-3-tree/docstrings-english.lisp
Previous: The clump-2-3-tree/docstrings-english․lisp file, Up: Lisp files [Contents][Index]
docstrings-english.lisp (file)
clump-2-3-tree (system)
2-3-tree/condition-reporters-english.lisp
Next: Definitions, Previous: Files, Up: Top [Contents][Index]
Packages are listed by definition order.
• The clump-binary-tree package | ||
• The clump-2-3-tree package |
Next: The clump-2-3-tree package, Previous: Packages, Up: Packages [Contents][Index]
packages.lisp (file)
common-lisp
Previous: The clump-binary-tree package, Up: Packages [Contents][Index]
packages.lisp (file)
common-lisp
Definitions are sorted by export status, category, package, and then by lexicographic order.
• Exported definitions | ||
• Internal definitions |
Next: Internal definitions, Previous: Definitions, Up: Definitions [Contents][Index]
• Exported generic functions | ||
• Exported conditions | ||
• Exported classes |
Next: Exported conditions, Previous: Exported definitions, Up: Exported definitions [Contents][Index]
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
deletion.lisp (file)
deletion.lisp (file)
insertion.lisp (file)
insertion.lisp (file)
insertion.lisp (file)
iterative-traversal.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
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.
binary-tree.lisp (file)
(setf left) (generic function)
automatically generated reader method
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.
binary-tree.lisp (file)
left (generic function)
automatically generated writer method
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
binary-tree.lisp (file)
automatically generated writer method
binary-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
recursive-traversal.lisp (file)
insertion.lisp (file)
deletion.lisp (file)
replace-child.lisp (file)
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.
binary-tree.lisp (file)
(setf right) (generic function)
automatically generated reader method
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.
binary-tree.lisp (file)
right (generic function)
automatically generated writer method
automatically generated reader method
2-3-tree.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
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.
rotation.lisp (file)
rotation.lisp (file)
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.
rotation.lisp (file)
rotation.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
splay.lisp (file)
insertion.lisp (file)
conditions.lisp (file)
automatically generated reader method
2-3-tree.lisp (file)
Next: Exported classes, Previous: Exported generic functions, Up: Exported definitions [Contents][Index]
conditions.lisp (file)
binary-tree-error (condition)
:tree
tree (generic function)
conditions.lisp (file)
binary-tree-error (condition)
:tree
tree (generic function)
conditions.lisp (file)
binary-tree-error (condition)
:tree
tree (generic function)
Previous: Exported conditions, Up: Exported definitions [Contents][Index]
2-3-tree.lisp (file)
node (class)
:left
left (generic function)
(setf %left) (generic function)
:right
right (generic function)
(setf %right) (generic function)
2-3-tree.lisp (file)
node (class)
:left
left (generic function)
(setf %left) (generic function)
:middle
middle (generic function)
(setf %middle) (generic function)
:right
right (generic function)
(setf %right) (generic function)
2-3-tree.lisp (file)
node (class)
:contents
contents (generic function)
(setf contents) (generic function)
binary-tree.lisp (file)
standard-object (class)
:left
left (generic function)
(setf left) (generic function)
:right
right (generic function)
(setf right) (generic function)
binary-tree.lisp (file)
node (class)
:parent
parent (generic function)
(setf parent) (generic function)
binary-tree.lisp (file)
node (class)
iterative-traversal (method)
2-3-tree.lisp (file)
standard-object (class)
contents (generic function)
(setf contents) (generic function)
:leaf-class
leaf-class (generic function)
:2-node-class
2-node-class (generic function)
:3-node-class
3-node-class (generic function)
Previous: Exported definitions, Up: Definitions [Contents][Index]
• Internal generic functions | ||
• Internal conditions | ||
• Internal classes |
Next: Internal conditions, Previous: Internal definitions, Up: Internal definitions [Contents][Index]
automatically generated writer method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
automatically generated writer method
2-3-tree.lisp (file)
2-3-tree.lisp (file)
2-3-tree.lisp (file)
conditions.lisp (file)
link-unlink.lisp (file)
link-unlink.lisp (file)
binary-tree.lisp (file)
splay.lisp (file)
splay.lisp (file)
conditions.lisp (file)
conditions.lisp (file)
conditions.lisp (file)
conditions.lisp (file)
link-unlink.lisp (file)
link-unlink.lisp (file)
Next: Internal classes, Previous: Internal generic functions, Up: Internal definitions [Contents][Index]
conditions.lisp (file)
tree-for-insertion-must-be-empty (condition)
conditions.lisp (file)
conditions.lisp (file)
binary-tree-error (condition)
:tree
tree (generic function)
:child
child (generic function)
conditions.lisp (file)
2-3-tree-error (condition)
:tree
tree (generic function)
Previous: Internal conditions, Up: Internal definitions [Contents][Index]
2-3-tree.lisp (file)
standard-object (class)
:parent
parent (generic function)
(setf parent) (generic function)
:tree
tree (generic function)
Previous: Definitions, Up: Top [Contents][Index]
• Concept index | ||
• Function index | ||
• Variable index | ||
• Data type index |
Next: Function index, Previous: Indexes, Up: Indexes [Contents][Index]
Jump to: | C F L |
---|
Jump to: | C F L |
---|
Next: Variable index, Previous: Concept index, Up: Indexes [Contents][Index]
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 |
---|
Next: Data type index, Previous: Function index, Up: Indexes [Contents][Index]
Jump to: | %
S |
---|
Jump to: | %
S |
---|
Previous: Variable index, Up: Indexes [Contents][Index]
Jump to: | 2
3
B C I L M N P R S T |
---|
Jump to: | 2
3
B C I L M N P R S T |
---|