This is the bk-tree Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 08 16:29:24 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
bk-tree
packages.lisp
(file).
specials.lisp
(file).
utils.lisp
(file).
bk-tree.lisp
(file).
Files are sorted by type and then listed depth-first from the systems components trees.
bk-tree/bk-tree.asd
bk-tree/packages.lisp
bk-tree/specials.lisp
bk-tree/utils.lisp
bk-tree/bk-tree.lisp
bk-tree/specials.lisp
packages.lisp
(file).
bk-tree
(system).
bk-tree
(class).
distance-of
(reader method).
distance-of
(reader method).
(setf distance-of)
(writer method).
(setf distance-of)
(writer method).
duplicate-value
(condition).
nodes-of
(reader method).
(setf nodes-of)
(writer method).
print-object
(method).
print-object
(method).
search-result
(class).
value-of
(reader method).
value-of
(reader method).
value-of
(reader method).
(setf value-of)
(writer method).
(setf value-of)
(writer method).
(setf value-of)
(writer method).
bk-tree/utils.lisp
specials.lisp
(file).
bk-tree
(system).
levenshtein
(function).
levenshtein-cost
(type).
levenshtein-max-distance
(type).
bk-tree/bk-tree.lisp
utils.lisp
(file).
bk-tree
(system).
average-children-count
(function).
hairy-search-value
(function).
insert-value
(function).
maximum-depth
(function).
print-tree
(function).
search-value
(function).
Packages are listed by definition order.
bk-tree
common-lisp
.
average-children-count
(function).
bk-tree
(class).
distance-of
(generic reader).
(setf distance-of)
(generic writer).
duplicate-value
(condition).
hairy-search-value
(function).
insert-value
(function).
levenshtein
(function).
levenshtein-cost
(type).
levenshtein-max-distance
(type).
maximum-depth
(function).
nodes-of
(generic reader).
(setf nodes-of)
(generic writer).
print-tree
(function).
search-result
(class).
search-value
(function).
value-of
(generic reader).
(setf value-of)
(generic writer).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Returns average children count per node of the supplied ‘TREE’.
Return a list of ‘SEARCH-RESULT’ instances built from ‘TREE’ and its children
whose value is no more distant from ‘VALUE’ than ‘THRESHOLD’, using ‘METRIC’ to
measure the distance.
If ‘LIMIT’ is non-NIL, given number of first found results will be
returned.
If ‘ORDERED-RESULTS’ is non-NIL, returned results will be ordered according to
their distances from ‘VALUES’.
If ‘ORDERED-TRAVERSAL’ is non-NIL, candidates in a level (e.g. children of a
validated node) will be traversed in sorted order according to the absolute
difference between the parent distance and child distance – the (probably) more
similar is first.
‘HAIRY-SEARCH-VALUE’ is a feature rich and hence slower derivative of ‘SEARCH-VALUE’. For simple query patterns, consider using ‘SEARCH-VALUE’.
Inserts given ‘VALUE’ into supplied ‘TREE’.
An O(mn) implementation of the Levenshtein distance metric.
Returns maximum depth of the ‘TREE’.
Prints supplied ‘TREE’ in a human-readable(?) format.
Return a list of ‘SEARCH-RESULT’ instances built from ‘TREE’ and its children
whose value is no more distant from ‘VALUE’ than ‘THRESHOLD’, using ‘METRIC’ to
measure the distance.
If ‘ORDERED-RESULTS’ is non-NIL, collected results will be sorted according to their distances from ‘VALUE’.
search-result
)) ¶automatically generated reader method
search-result
)) ¶automatically generated writer method
duplicate-value
)) ¶search-result
)) ¶automatically generated reader method
duplicate-value
)) ¶search-result
)) ¶automatically generated writer method
search-result
) stream) ¶Signaled upon every duplicated entry insertion.
error
.
:value
Metric distance between current node and its parent.
unsigned-byte
0
:distance
:value
Nodes collected under this node.
list
bk-tree::nodes
Jump to: | (
A D F G H I L M N P S V |
---|
Jump to: | (
A D F G H I L M N P S V |
---|
Jump to: | D N S V |
---|
Jump to: | D N S V |
---|
Jump to: | B C D F L P S T U |
---|
Jump to: | B C D F L P S T U |
---|