The vp-trees Reference Manual

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.

Table of Contents


1 Introduction


2 Systems

The main system appears first, followed by any subsystem dependency.


2.1 vp-trees

Perceptual hash algorithms for images

Author

Vasily Postnicov <>

License

2-clause BSD

Version

0.1

Source

vp-trees.asd.

Child Components

3 Files

Files are sorted by type and then listed depth-first from the systems components trees.


3.1 Lisp


3.1.1 vp-trees/vp-trees.asd

Source

vp-trees.asd.

Parent Component

vp-trees (system).

ASDF Systems

vp-trees.


3.1.2 vp-trees/src/package.lisp

Source

vp-trees.asd.

Parent Component

vp-trees (system).

Packages

vp-trees.


3.1.3 vp-trees/src/vp-trees.lisp

Dependency

src/package.lisp (file).

Source

vp-trees.asd.

Parent Component

vp-trees (system).

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.1 vp-trees

Source

src/package.lisp.

Use List

common-lisp.

Public Interface
Internals

5 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


5.1 Public Interface


5.1.1 Ordinary functions

Function: make-vp-tree (list distance &key key)

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).

Package

vp-trees.

Source

src/vp-trees.lisp.

Function: search-close (tree item threshold distance &key key)

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))).

Package

vp-trees.

Source

src/vp-trees.lisp.


5.1.2 Standalone methods

Method: print-object ((object vp-node) stream)
Source

src/vp-trees.lisp.


5.1.3 Structures

Structure: vp-node
Package

vp-trees.

Source

src/vp-trees.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots
Slot: center
Readers

vp-node-center.

Writers

(setf vp-node-center).

Slot: radius
Type

number

Initform

0

Readers

vp-node-radius.

Writers

(setf vp-node-radius).

Slot: inner
Type

(or null vp-trees:vp-node)

Readers

vp-node-inner.

Writers

(setf vp-node-inner).

Slot: outer
Type

(or null vp-trees:vp-node)

Readers

vp-node-outer.

Writers

(setf vp-node-outer).


5.2 Internals


5.2.1 Ordinary functions

Function: copy-vp-node (instance)
Package

vp-trees.

Source

src/vp-trees.lisp.

Function: divide-list (list predicate)

Divide a set in two halves depending on the value of predicate function

Package

vp-trees.

Source

src/vp-trees.lisp.

Function: make-vp-node (&key center radius inner outer)
Package

vp-trees.

Source

src/vp-trees.lisp.

Function: median (list &optional nleft nright key)

Return median value for a list

Package

vp-trees.

Source

src/vp-trees.lisp.

Function: pick-random (list)

Pick a random value from a list and return this value and a new list with this value removed.

Package

vp-trees.

Source

src/vp-trees.lisp.

Reader: vp-node-center (instance)
Writer: (setf vp-node-center) (instance)
Package

vp-trees.

Source

src/vp-trees.lisp.

Target Slot

center.

Reader: vp-node-inner (instance)
Writer: (setf vp-node-inner) (instance)
Package

vp-trees.

Source

src/vp-trees.lisp.

Target Slot

inner.

Function: vp-node-leaf-p (node)

True if this node is a leaf

Package

vp-trees.

Source

src/vp-trees.lisp.

Reader: vp-node-outer (instance)
Writer: (setf vp-node-outer) (instance)
Package

vp-trees.

Source

src/vp-trees.lisp.

Target Slot

outer.

Function: vp-node-p (object)
Package

vp-trees.

Source

src/vp-trees.lisp.

Reader: vp-node-radius (instance)
Writer: (setf vp-node-radius) (instance)
Package

vp-trees.

Source

src/vp-trees.lisp.

Target Slot

radius.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   (  
C   D   F   M   P   S   V  
Index Entry  Section

(
(setf vp-node-center): Private ordinary functions
(setf vp-node-inner): Private ordinary functions
(setf vp-node-outer): Private ordinary functions
(setf vp-node-radius): Private ordinary functions

C
copy-vp-node: Private ordinary functions

D
divide-list: Private ordinary functions

F
Function, (setf vp-node-center): Private ordinary functions
Function, (setf vp-node-inner): Private ordinary functions
Function, (setf vp-node-outer): Private ordinary functions
Function, (setf vp-node-radius): Private ordinary functions
Function, copy-vp-node: Private ordinary functions
Function, divide-list: Private ordinary functions
Function, make-vp-node: Private ordinary functions
Function, make-vp-tree: Public ordinary functions
Function, median: Private ordinary functions
Function, pick-random: Private ordinary functions
Function, search-close: Public ordinary functions
Function, vp-node-center: Private ordinary functions
Function, vp-node-inner: Private ordinary functions
Function, vp-node-leaf-p: Private ordinary functions
Function, vp-node-outer: Private ordinary functions
Function, vp-node-p: Private ordinary functions
Function, vp-node-radius: Private ordinary functions

M
make-vp-node: Private ordinary functions
make-vp-tree: Public ordinary functions
median: Private ordinary functions
Method, print-object: Public standalone methods

P
pick-random: Private ordinary functions
print-object: Public standalone methods

S
search-close: Public ordinary functions

V
vp-node-center: Private ordinary functions
vp-node-inner: Private ordinary functions
vp-node-leaf-p: Private ordinary functions
vp-node-outer: Private ordinary functions
vp-node-p: Private ordinary functions
vp-node-radius: Private ordinary functions


A.3 Variables