This is the vp-trees Reference Manual, version 2.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Fri May 15 13:12:18 2026 GMT+0.
The main system appears first, followed by any subsystem dependency.
vp-treesPerceptual hash algorithms for images
Vasily Postnicov <shamaz.mazum@gmail.com>
2-clause BSD
2.1
serapeum (system).
alexandria (system).
float-features (system).
src/package.lisp (file).
src/vp-trees.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
vp-trees/src/vp-trees.lispsrc/package.lisp (file).
vp-trees (system).
find (function).
flatten (function).
make-vp-tree (function).
nearest-neighbor (function).
print-object (method).
vp-node (function).
vp-node (structure).
divide-list (function).
median (function).
metric (type).
pick-random (function).
read-only-struct-slot-names (method).
vp-node-center (reader).
vp-node-has-children-p (function).
vp-node-inner (reader).
vp-node-outer (reader).
vp-node-p (function).
vp-node-radius (reader).
vp-tree (type).
Packages are listed by definition order.
vp-treescommon-lisp.
find (function).
flatten (function).
make-vp-tree (function).
nearest-neighbor (function).
vp-node (function).
vp-node (structure).
divide-list (function).
median (function).
metric (type).
pick-random (function).
vp-node-center (reader).
vp-node-has-children-p (function).
vp-node-inner (reader).
vp-node-outer (reader).
vp-node-p (function).
vp-node-radius (reader).
vp-tree (type).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Find all items in the tree @c(tree) closer to @c(item) than @c(threshold). @c(item) and elements of the tree must belong to a metric space with @c(distance) as a metric function. Optional @c(key) function can be used to calculate a distance between two objects in the following way: @c(ρ(x,y) = distance (x, key(y))), @c(y) being an element of the tree. Optionally @c(max) can be specified to return no more than that number of items. In this case it is not guaranteed that the returned items are necessarily the closest items to @c(item).
Deconstruct VP-tree back into a list. The order of elements in the original list is not preserved.
Make vantage point tree from a set @c(list) using a distance function @c(distance). Optional @c(key) function can be specified as a mapping between elements in @c(list) and elements in your metric space, so @c(ρ(x,y) = distance (key(x), key(y))) where x and y are in the @c(list).
Return element in the @c(tree) which is the closest element to @c(item). @c(item) and elements of the tree must belong to a metric space with @c(distance) as a metric function. Optional @c(key) function can be used to calculate a distance between two objects in the following way: @c(ρ(x,y) = distance (x, key(y))), @c(y) being an element of the tree..
%read-only-struct.
(alexandria:required-argument (quote vp-trees::center))
This slot is read-only.
(real 0)
(alexandria:required-argument (quote vp-trees::radius))
This slot is read-only.
(or vp-trees:vp-node null)
(alexandria:required-argument (quote vp-trees::inner))
This slot is read-only.
(or vp-trees:vp-node null)
(alexandria:required-argument (quote vp-trees::outer))
This slot is read-only.
Divide a set in two halves depending on the value of predicate function
Return median value for a list
Pick a random value from a list and return this value and a new list with this value removed.
vp-node)) ¶serapeum/defining-types.
| Jump to: | D F M N P R V |
|---|
| Jump to: | D F M N P R V |
|---|
| Jump to: | C I O R S |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| C | |||
center: | Public structures | ||
| | |||
| I | |||
inner: | Public structures | ||
| | |||
| O | |||
outer: | Public structures | ||
| | |||
| R | |||
radius: | Public structures | ||
| | |||
| S | |||
Slot, center: | Public structures | ||
Slot, inner: | Public structures | ||
Slot, outer: | Public structures | ||
Slot, radius: | Public structures | ||
| | |||
| Jump to: | C I O R S |
|---|
| Jump to: | F M P S T V |
|---|
| Jump to: | F M P S T V |
|---|