This is the bst Reference Manual, version 2.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 04:27:41 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
Files are sorted by type and then listed depth-first from the systems components trees.
bst/bst.lispbst (system).
bst.
*bst-copy-function* (special variable).
*bst-equal-p-function* (special variable).
*bst-lesser-p-function* (special variable).
+bst-empty+ (constant).
bst-add (function).
bst-add! (function).
bst-balance (function).
bst-copy (function).
bst-count (function).
bst-empty-p (function).
bst-equal-p (function).
bst-from-sorted-values (function).
bst-from-values (function).
bst-lesser-p (function).
bst-map (function).
bst-max-depth (function).
bst-max-value (function).
bst-min-depth (function).
bst-min-value (function).
bst-remove (function).
bst-remove! (function).
bst-search (function).
bst-search-max-value-below (function).
bst-search-min-value-above (function).
bst-tree-copy (function).
bst-tree-equal-p (function).
bst-values (function).
bst-values-equal-p (function).
bst (structure).
bst-left (reader).
(setf bst-left) (writer).
bst-p (function).
bst-right (reader).
(setf bst-right) (writer).
bst-value (reader).
(setf bst-value) (writer).
copy-bst (function).
make-bst (function).
Packages are listed by definition order.
bstcommon-lisp.
*bst-copy-function* (special variable).
*bst-equal-p-function* (special variable).
*bst-lesser-p-function* (special variable).
+bst-empty+ (constant).
bst-add (function).
bst-add! (function).
bst-balance (function).
bst-copy (function).
bst-count (function).
bst-empty-p (function).
bst-equal-p (function).
bst-from-sorted-values (function).
bst-from-values (function).
bst-lesser-p (function).
bst-map (function).
bst-max-depth (function).
bst-max-value (function).
bst-min-depth (function).
bst-min-value (function).
bst-remove (function).
bst-remove! (function).
bst-search (function).
bst-search-max-value-below (function).
bst-search-min-value-above (function).
bst-tree-copy (function).
bst-tree-equal-p (function).
bst-values (function).
bst-values-equal-p (function).
bst (structure).
bst-left (reader).
(setf bst-left) (writer).
bst-p (function).
bst-right (reader).
(setf bst-right) (writer).
bst-value (reader).
(setf bst-value) (writer).
copy-bst (function).
make-bst (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
A function used to copy a value of a tree.
A function used to check if two values of a tree are equal.
A function used to check if a value of a tree is lesser than another.
Insert a VALUE in a TREE. The TREE argument is destroyed.
Return T if TREE is empty and NIL otherwise.
Return T if VALUE1 and VALUE2 are equal, and NIL otherwise.
Make a balanced tree from a vector of sorted values.
Make a tree from a sequence of values.
Return T if VALUE1 is lesser than VALUE2, and NIL otherwise.
Apply a FUNCTION to each value of a TREE in ascending order.
Return the length of the longest branch in a TREE.
If TREE is not empty, return its maximum value and T, otherwise return NIL and NIL.
Return the length of the shortest branch in a TREE.
If TREE is not empty, return its minimum value and T, otherwise return NIL and NIL.
Delete a VALUE from a TREE. The TREE argument is destroyed.
If VALUE is present in TREE, return VALUE and T, otherwise return NIL and NIL.
Search the maximum value in TREE lesser that VALUE. If such a value is found, return it and T, otherwise return NIL and NIL.
Search the minimum value in TREE greater that VALUE. If such a value is found, return it and T, otherwise return NIL and NIL.
Return T if TREE1 and TREE2 have the same structure, and NIL otherwise.
Return all the values of a TREE in a vector.
Return T if TREE1 and TREE2 contain the same values, and NIL otherwise.
| Jump to: | (
B C F M |
|---|
| Jump to: | (
B C F M |
|---|
| Jump to: | *
+
C L R S V |
|---|
| Jump to: | *
+
C L R S V |
|---|
| Jump to: | B F P S |
|---|
| Jump to: | B F P S |
|---|