This is the vp-trees Reference Manual, version 0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Jan 15 08:05:48 2023 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
0.1
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).
make-vp-tree (function).
print-object (method).
search-close (function).
vp-node (structure).
copy-vp-node (function).
divide-list (function).
make-vp-node (function).
median (function).
pick-random (function).
vp-node-center (reader).
(setf vp-node-center) (writer).
vp-node-inner (reader).
(setf vp-node-inner) (writer).
vp-node-leaf-p (function).
vp-node-outer (reader).
(setf vp-node-outer) (writer).
vp-node-p (function).
vp-node-radius (reader).
(setf vp-node-radius) (writer).
Packages are listed by definition order.
vp-treescommon-lisp.
make-vp-tree (function).
search-close (function).
vp-node (structure).
copy-vp-node (function).
divide-list (function).
make-vp-node (function).
median (function).
pick-random (function).
vp-node-center (reader).
(setf vp-node-center) (writer).
vp-node-inner (reader).
(setf vp-node-inner) (writer).
vp-node-leaf-p (function).
vp-node-outer (reader).
(setf vp-node-outer) (writer).
vp-node-p (function).
vp-node-radius (reader).
(setf vp-node-radius) (writer).
Definitions are sorted by export status, category, package, and then by lexicographic order.
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).
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))).
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: | (
C D F M P S V |
|---|
| Jump to: | (
C D F M P S 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 P S V |
|---|
| Jump to: | F P S V |
|---|