This is the vp-trees Reference Manual, version 1.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Sep 15 07:06:31 2024 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
1.0
serapeum (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).
flatten (function).
items-in-ball (function).
make-vp-tree (function).
nearest-neighbor (function).
print-object (method).
vp-node (function).
vp-node (structure).
divide-list (function).
make-vp-node (function).
median (function).
metric (type).
pick-random (function).
read-only-struct-slot-names (method).
vp-node-center (reader).
vp-node-inner (reader).
vp-node-leaf-p (function).
vp-node-outer (reader).
vp-node-p (function).
vp-node-radius (reader).
Packages are listed by definition order.
vp-treescommon-lisp.
flatten (function).
items-in-ball (function).
make-vp-tree (function).
nearest-neighbor (function).
vp-node (function).
vp-node (structure).
divide-list (function).
make-vp-node (function).
median (function).
metric (type).
pick-random (function).
vp-node-center (reader).
vp-node-inner (reader).
vp-node-leaf-p (function).
vp-node-outer (reader).
vp-node-p (function).
vp-node-radius (reader).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Deconstruct VP tree back into list. The order of elements in the original list is not preserved.
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 (key(x), key(y))).
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 (key(x), key(y))).
%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.
True if this node is a leaf
| Jump to: | D F I M N P R V |
|---|
| Jump to: | D F I 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 |
|---|