The kdtree-jk Reference Manual

This is the kdtree-jk Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Wed May 15 05:41:01 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 kdtree-jk

KD-TREE package for searching for nearest neighbors in N points in in M-dimensions in N log(N) time.

Author

<>

License

MIT

Source

kdtree-jk.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 kdtree-jk/kdtree-jk.asd

Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

ASDF Systems

kdtree-jk.


3.1.2 kdtree-jk/kdtree-jk-package.lisp

Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Packages

kdtree-jk.


3.1.3 kdtree-jk/kdtree-jk-structs.lisp

Dependency

kdtree-jk-package.lisp (file).

Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Public Interface
Internals

3.1.4 kdtree-jk/kdtree-jk-utils.lisp

Dependencies
Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Internals

3.1.5 kdtree-jk/kdtree-jk-balance.lisp

Dependencies
Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Public Interface

balance-kdtree (function).


3.1.6 kdtree-jk/kdtree-jk-insert.lisp

Dependencies
Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Public Interface
Internals

3.1.7 kdtree-jk/kdtree-jk-search.lisp

Dependencies
Source

kdtree-jk.asd.

Parent Component

kdtree-jk (system).

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.1 kdtree-jk

Source

kdtree-jk-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: balance-kdtree (kdtree)

Balances a KDTREE by ensuring that each node splits the remaining set in 2. Also removes any deleted objects (objects with object-vec set to ’DELETED-OBJECT)

This seems to be a N [log(n)]^2 operation.

Package

kdtree-jk.

Source

kdtree-jk-balance.lisp.

Reader: bbox-ndim (instance)
Writer: (setf bbox-ndim) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

ndim.

Function: bbox-p (object)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Reader: bbox-rmax-vec (instance)
Writer: (setf bbox-rmax-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

rmax-vec.

Reader: bbox-rmin-vec (instance)
Writer: (setf bbox-rmin-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

rmin-vec.

Function: build-bbox (min-bounds max-bounds)

Build a Bounding Box (BBOX). MIN-VEC and MAX-VEC are sequences representing the bounds.

Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: build-kdresult (&key n)
Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: build-kdtree (ndim &key npoints)

Build a KDTREE with NDIM dimensions and NPOINTS of storage, initially.

Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: describe-node (kdtree k &key stream)

Describe a node in the KDTREE, to STREAM.

Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: insert-2d (kdtree x y object &key vec defer)

Insert X,Y into 2d KDTREE.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: insert-3d (kdtree x y z object &key vec defer)

Insert X,Y,Z into 3d KDTREE.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: insert-vector (kdtree v object &key defer)

Insert a vector V corresponding to OBJECT into NDIM KDTREE, returning the index where it ended up.

If DEFER keyword is set, then the tree-insertion is deferred to save time, but it will be necessary to run BALANCE-KDTREE before use. This is useful for creating a balanced tree from unbalanced or nonrandom data.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: kd-find-k-nearest (kdtree v k-nearest &key rstart kdresult)

Find k-nearest objects in KDTREE, by doing increasing radial
searches. The returned KDRESULT will contain at least K-NEAREST points, sorted by radius. It us up to the user to truncate the result to the first K-NEAREST.

RSTART is an optional starting radius size. By default, it it set using the volume fraction expected to be occupied by K-NEAREST points.

Returns the number of search iterations as the second value.

The ACTION keyword is not supported because the result is not know
before the end of the search.

Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: kd-find-nearest-point (kdtree v &key kdresult)

Find the single nearest point to vector V in KDTREE.
A wrapper for:
(KD-SEARCH-IN-RADIUS KDTREE V HUGE-RADIUS :KDRESULT KDRESULT NEAREST-POINT T)

The ACTION keyword is not supported because the result is not known
before the end of the search.

Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: kd-search-in-bbox (kdtree bbox &key kdresult action)

Search KDTREE for points inside bounding box BBOX (of type BBOX). If keyword :KDRESULT is NIL, then a KDRESULT will be created. Otherwise, given KDRESULT will be used to return the result.

If ACTION is supplied, than it is applied to each matching point, and
KDRESULT is ignored and set to NIL.
It is called as (FUNCALL ACTION INODE) where INODE is the linear index of a node.

:ACTION (MAKE-DELETION-ACTION), for example, deletes an element by setting its value to a special symbol ’DELETED-OBJECT.

Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: kd-search-in-radius (kdtree v radius &key kdresult sort nearest-point action)

Search KDTREE for points within RADIUS of float vector V. If
keyword :KDRESULT is NIL, then a KDRESULT will be created. Otherwise,
given KDRESULT will be used to return the result.

If NEAREST-POINT is set, return just the nearest point. This is
especially efficient because the internal search radius keeps
shrinking.

If SORT is true, then the KDRESULT is sorted by increasing distance
from point given.

If ACTION is supplied, than it is applied to each matching point, and KDRESULT is ignored and set to NIL.
It is called as (FUNCALL ACTION INODE) where INODE is the linear index of a node.

:ACTION (MAKE-DELETION-ACTION), for example, deletes any element returned by search by setting its value to a special symbol ’DELETED-OBJECT.

Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Reader: kdresult-dist-vec (instance)
Writer: (setf kdresult-dist-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

dist-vec.

Reader: kdresult-index-vec (instance)
Writer: (setf kdresult-index-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

index-vec.

Reader: kdresult-n (instance)
Writer: (setf kdresult-n) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

n.

Reader: kdresult-obj-vec (instance)
Writer: (setf kdresult-obj-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

obj-vec.

Function: kdresult-p (object)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Reader: kdtree-avg-depth (instance)
Writer: (setf kdtree-avg-depth) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

avg-depth.

Reader: kdtree-bbox (instance)
Writer: (setf kdtree-bbox) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

bbox.

Reader: kdtree-idepth (instance)
Writer: (setf kdtree-idepth) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

idepth.

Function: kdtree-minimize-size (kdtree)

Make the arrays in KDTREE just large enough to hold the data.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Reader: kdtree-ndim (instance)
Writer: (setf kdtree-ndim) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

ndim.

Reader: kdtree-npoints (instance)
Writer: (setf kdtree-npoints) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

npoints.

Reader: kdtree-obj-vec (instance)
Writer: (setf kdtree-obj-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

obj-vec.

Function: kdtree-p (object)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Reader: kdtree-r-vec (instance)
Writer: (setf kdtree-r-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

r-vec.

Function: make-deletion-action (&key test)

Function to generate a function to pass as an :ACTION, to delete objects according to :TEST.

TEST is an optional function taking the OBJECT inside KDTREE-OBJ-VEC, returning T if this object is to be deleted.

For example,
(MAKE-DELETION-ACTION (LAMBDA (OBJ) (EQ OBJ *MY-OBJ*)))
will return an action to delete objects EQ to *MY-OBJ*
that are picked up by the search.
and
(MAKE-DELETION-ACTION) will return an action to
delete all objects picked up by the KDTREE search.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: make-search-action (object-function)

Make a function that can be passed as an :ACTION to search functions, that will (FUNCALL OBJECT-FUNCTION OBJECT) to each object in KDTREE-OBJECT-VEC that falls inside the search.

Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.


5.1.2 Structures

Structure: bbox
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: ndim
Type

(unsigned-byte 32)

Initform

0

Readers

bbox-ndim.

Writers

(setf bbox-ndim).

Slot: rmin-vec
Type

kdtree-jk::kdfltvec

Initform

(kdtree-jk::make-kdfltvec 0)

Readers

bbox-rmin-vec.

Writers

(setf bbox-rmin-vec).

Slot: rmax-vec
Type

kdtree-jk::kdfltvec

Initform

(kdtree-jk::make-kdfltvec 0)

Readers

bbox-rmax-vec.

Writers

(setf bbox-rmax-vec).

Structure: kdresult
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: n
Type

(unsigned-byte 32)

Initform

0

Readers

kdresult-n.

Writers

(setf kdresult-n).

Slot: obj-vec
Type

kdtree-jk::objvec

Initform

(kdtree-jk::make-objvec 0)

Readers

kdresult-obj-vec.

Writers

(setf kdresult-obj-vec).

Slot: index-vec
Type

kdtree-jk::indexvec

Initform

(kdtree-jk::make-indexvec 0)

Readers

kdresult-index-vec.

Writers

(setf kdresult-index-vec).

Slot: dist-vec
Type

kdtree-jk::kdfltvec

Initform

(kdtree-jk::make-kdfltvec 0)

Readers

kdresult-dist-vec.

Writers

(setf kdresult-dist-vec).

Structure: kdtree
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: ndim
Type

(unsigned-byte 16)

Initform

0

Readers

kdtree-ndim.

Writers

(setf kdtree-ndim).

Slot: npoints
Type

(unsigned-byte 32)

Initform

0

Readers

kdtree-npoints.

Writers

(setf kdtree-npoints).

Slot: needs-balancing
Type

(or null t)

Readers

kdtree-needs-balancing.

Writers

(setf kdtree-needs-balancing).

Slot: idepth
Type

(unsigned-byte 20)

Initform

0

Readers

kdtree-idepth.

Writers

(setf kdtree-idepth).

Slot: avg-depth
Type

double-float

Initform

0.0d0

Readers

kdtree-avg-depth.

Writers

(setf kdtree-avg-depth).

Slot: npoints-total
Type

(unsigned-byte 32)

Initform

0

Readers

kdtree-npoints-total.

Writers

(setf kdtree-npoints-total).

Slot: flag-vec
Type

kdtree-jk::flagvec

Initform

(kdtree-jk::make-flagvec 0 kdtree-jk::+empty+)

Readers

kdtree-flag-vec.

Writers

(setf kdtree-flag-vec).

Slot: ir-vec
Type

kdtree-jk::indexvec

Initform

(kdtree-jk::make-indexvec 0 kdtree-jk::+end+)

Readers

kdtree-ir-vec.

Writers

(setf kdtree-ir-vec).

Slot: index-left-vec
Type

kdtree-jk::indexvec

Initform

(kdtree-jk::make-indexvec 0 kdtree-jk::+end+)

Readers

kdtree-index-left-vec.

Writers

(setf kdtree-index-left-vec).

Slot: index-right-vec
Type

kdtree-jk::indexvec

Initform

(kdtree-jk::make-indexvec 0 kdtree-jk::+end+)

Readers

kdtree-index-right-vec.

Writers

(setf kdtree-index-right-vec).

Slot: obj-vec
Type

kdtree-jk::objvec

Initform

(make-array 0)

Readers

kdtree-obj-vec.

Writers

(setf kdtree-obj-vec).

Slot: sd-vec
Type

kdtree-jk::dimvec

Initform

(kdtree-jk::make-dimvec 0)

Readers

kdtree-sd-vec.

Writers

(setf kdtree-sd-vec).

Slot: r-vec
Type

kdtree-jk::kdfltarr

Initform

(kdtree-jk::make-kdfltarr 0 0)

Readers

kdtree-r-vec.

Writers

(setf kdtree-r-vec).

Slot: bbox
Type

kdtree-jk:bbox

Initform

(kdtree-jk::make-bbox)

Readers

kdtree-bbox.

Writers

(setf kdtree-bbox).


5.1.3 Types

Type: dimnum ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: index ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: kd-float ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.


5.2 Internals


5.2.1 Constants

Constant: +empty+
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Constant: +end+
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Constant: +filled+
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Constant: +most-positive-float+
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.


5.2.2 Special variables

Special Variable: *kdtree-expansion-factor*
Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.


5.2.3 Ordinary functions

Function: %expand-kdresult (kdresult)
Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: %expand-kdtree (kdtree &key factor new-size)
Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: %insert-into-kd (v object kdtree jr k idepth idim)
Package

kdtree-jk.

Source

kdtree-jk-insert.lisp.

Function: %insert-point-in-kdresult (kdtree kdresult k dist2 overwrite)
Package

kdtree-jk.

Source

kdtree-jk-search.lisp.

Function: %remove-deleted-objects (kdtree)
Package

kdtree-jk.

Source

kdtree-jk-utils.lisp.

Function: copy-bbox (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: copy-kdresult (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: copy-kdtree (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Reader: kdtree-flag-vec (instance)
Writer: (setf kdtree-flag-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

flag-vec.

Reader: kdtree-index-left-vec (instance)
Writer: (setf kdtree-index-left-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

index-left-vec.

Reader: kdtree-index-right-vec (instance)
Writer: (setf kdtree-index-right-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

index-right-vec.

Reader: kdtree-ir-vec (instance)
Writer: (setf kdtree-ir-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

ir-vec.

Reader: kdtree-needs-balancing (instance)
Writer: (setf kdtree-needs-balancing) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

needs-balancing.

Reader: kdtree-npoints-total (instance)
Writer: (setf kdtree-npoints-total) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

npoints-total.

Reader: kdtree-sd-vec (instance)
Writer: (setf kdtree-sd-vec) (instance)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Target Slot

sd-vec.

Function: make-bbox (&key ndim rmin-vec rmax-vec)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-dimvec (n &optional initial-element)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-flagvec (n &optional initial-element)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-indexvec (n &optional initial-element)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-kdfltarr (nrow ncol)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-kdfltvec (n)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-kdresult (&key n obj-vec index-vec dist-vec)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-kdtree (&key ndim npoints needs-balancing idepth avg-depth npoints-total flag-vec ir-vec index-left-vec index-right-vec obj-vec sd-vec r-vec bbox)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: make-objvec (n &optional initial-element)
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Function: partition-ir-vec-around-median (kdtree j1 j2 idim)
Package

kdtree-jk.

Source

kdtree-jk-utils.lisp.

Function: sort-kdresult-by-radius (kdresult)
Package

kdtree-jk.

Source

kdtree-jk-search.lisp.


5.2.4 Types

Type: dimvec ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: flagvec ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: indexvec ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: kd-flag ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: kdfltarr ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: kdfltvec ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.

Type: objvec ()
Package

kdtree-jk.

Source

kdtree-jk-structs.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   %   (  
B   C   D   F   I   K   M   P   S  
Index Entry  Section

%
%expand-kdresult: Private ordinary functions
%expand-kdtree: Private ordinary functions
%insert-into-kd: Private ordinary functions
%insert-point-in-kdresult: Private ordinary functions
%remove-deleted-objects: Private ordinary functions

(
(setf bbox-ndim): Public ordinary functions
(setf bbox-rmax-vec): Public ordinary functions
(setf bbox-rmin-vec): Public ordinary functions
(setf kdresult-dist-vec): Public ordinary functions
(setf kdresult-index-vec): Public ordinary functions
(setf kdresult-n): Public ordinary functions
(setf kdresult-obj-vec): Public ordinary functions
(setf kdtree-avg-depth): Public ordinary functions
(setf kdtree-bbox): Public ordinary functions
(setf kdtree-flag-vec): Private ordinary functions
(setf kdtree-idepth): Public ordinary functions
(setf kdtree-index-left-vec): Private ordinary functions
(setf kdtree-index-right-vec): Private ordinary functions
(setf kdtree-ir-vec): Private ordinary functions
(setf kdtree-ndim): Public ordinary functions
(setf kdtree-needs-balancing): Private ordinary functions
(setf kdtree-npoints): Public ordinary functions
(setf kdtree-npoints-total): Private ordinary functions
(setf kdtree-obj-vec): Public ordinary functions
(setf kdtree-r-vec): Public ordinary functions
(setf kdtree-sd-vec): Private ordinary functions

B
balance-kdtree: Public ordinary functions
bbox-ndim: Public ordinary functions
bbox-p: Public ordinary functions
bbox-rmax-vec: Public ordinary functions
bbox-rmin-vec: Public ordinary functions
build-bbox: Public ordinary functions
build-kdresult: Public ordinary functions
build-kdtree: Public ordinary functions

C
copy-bbox: Private ordinary functions
copy-kdresult: Private ordinary functions
copy-kdtree: Private ordinary functions

D
describe-node: Public ordinary functions

F
Function, %expand-kdresult: Private ordinary functions
Function, %expand-kdtree: Private ordinary functions
Function, %insert-into-kd: Private ordinary functions
Function, %insert-point-in-kdresult: Private ordinary functions
Function, %remove-deleted-objects: Private ordinary functions
Function, (setf bbox-ndim): Public ordinary functions
Function, (setf bbox-rmax-vec): Public ordinary functions
Function, (setf bbox-rmin-vec): Public ordinary functions
Function, (setf kdresult-dist-vec): Public ordinary functions
Function, (setf kdresult-index-vec): Public ordinary functions
Function, (setf kdresult-n): Public ordinary functions
Function, (setf kdresult-obj-vec): Public ordinary functions
Function, (setf kdtree-avg-depth): Public ordinary functions
Function, (setf kdtree-bbox): Public ordinary functions
Function, (setf kdtree-flag-vec): Private ordinary functions
Function, (setf kdtree-idepth): Public ordinary functions
Function, (setf kdtree-index-left-vec): Private ordinary functions
Function, (setf kdtree-index-right-vec): Private ordinary functions
Function, (setf kdtree-ir-vec): Private ordinary functions
Function, (setf kdtree-ndim): Public ordinary functions
Function, (setf kdtree-needs-balancing): Private ordinary functions
Function, (setf kdtree-npoints): Public ordinary functions
Function, (setf kdtree-npoints-total): Private ordinary functions
Function, (setf kdtree-obj-vec): Public ordinary functions
Function, (setf kdtree-r-vec): Public ordinary functions
Function, (setf kdtree-sd-vec): Private ordinary functions
Function, balance-kdtree: Public ordinary functions
Function, bbox-ndim: Public ordinary functions
Function, bbox-p: Public ordinary functions
Function, bbox-rmax-vec: Public ordinary functions
Function, bbox-rmin-vec: Public ordinary functions
Function, build-bbox: Public ordinary functions
Function, build-kdresult: Public ordinary functions
Function, build-kdtree: Public ordinary functions
Function, copy-bbox: Private ordinary functions
Function, copy-kdresult: Private ordinary functions
Function, copy-kdtree: Private ordinary functions
Function, describe-node: Public ordinary functions
Function, insert-2d: Public ordinary functions
Function, insert-3d: Public ordinary functions
Function, insert-vector: Public ordinary functions
Function, kd-find-k-nearest: Public ordinary functions
Function, kd-find-nearest-point: Public ordinary functions
Function, kd-search-in-bbox: Public ordinary functions
Function, kd-search-in-radius: Public ordinary functions
Function, kdresult-dist-vec: Public ordinary functions
Function, kdresult-index-vec: Public ordinary functions
Function, kdresult-n: Public ordinary functions
Function, kdresult-obj-vec: Public ordinary functions
Function, kdresult-p: Public ordinary functions
Function, kdtree-avg-depth: Public ordinary functions
Function, kdtree-bbox: Public ordinary functions
Function, kdtree-flag-vec: Private ordinary functions
Function, kdtree-idepth: Public ordinary functions
Function, kdtree-index-left-vec: Private ordinary functions
Function, kdtree-index-right-vec: Private ordinary functions
Function, kdtree-ir-vec: Private ordinary functions
Function, kdtree-minimize-size: Public ordinary functions
Function, kdtree-ndim: Public ordinary functions
Function, kdtree-needs-balancing: Private ordinary functions
Function, kdtree-npoints: Public ordinary functions
Function, kdtree-npoints-total: Private ordinary functions
Function, kdtree-obj-vec: Public ordinary functions
Function, kdtree-p: Public ordinary functions
Function, kdtree-r-vec: Public ordinary functions
Function, kdtree-sd-vec: Private ordinary functions
Function, make-bbox: Private ordinary functions
Function, make-deletion-action: Public ordinary functions
Function, make-dimvec: Private ordinary functions
Function, make-flagvec: Private ordinary functions
Function, make-indexvec: Private ordinary functions
Function, make-kdfltarr: Private ordinary functions
Function, make-kdfltvec: Private ordinary functions
Function, make-kdresult: Private ordinary functions
Function, make-kdtree: Private ordinary functions
Function, make-objvec: Private ordinary functions
Function, make-search-action: Public ordinary functions
Function, partition-ir-vec-around-median: Private ordinary functions
Function, sort-kdresult-by-radius: Private ordinary functions

I
insert-2d: Public ordinary functions
insert-3d: Public ordinary functions
insert-vector: Public ordinary functions

K
kd-find-k-nearest: Public ordinary functions
kd-find-nearest-point: Public ordinary functions
kd-search-in-bbox: Public ordinary functions
kd-search-in-radius: Public ordinary functions
kdresult-dist-vec: Public ordinary functions
kdresult-index-vec: Public ordinary functions
kdresult-n: Public ordinary functions
kdresult-obj-vec: Public ordinary functions
kdresult-p: Public ordinary functions
kdtree-avg-depth: Public ordinary functions
kdtree-bbox: Public ordinary functions
kdtree-flag-vec: Private ordinary functions
kdtree-idepth: Public ordinary functions
kdtree-index-left-vec: Private ordinary functions
kdtree-index-right-vec: Private ordinary functions
kdtree-ir-vec: Private ordinary functions
kdtree-minimize-size: Public ordinary functions
kdtree-ndim: Public ordinary functions
kdtree-needs-balancing: Private ordinary functions
kdtree-npoints: Public ordinary functions
kdtree-npoints-total: Private ordinary functions
kdtree-obj-vec: Public ordinary functions
kdtree-p: Public ordinary functions
kdtree-r-vec: Public ordinary functions
kdtree-sd-vec: Private ordinary functions

M
make-bbox: Private ordinary functions
make-deletion-action: Public ordinary functions
make-dimvec: Private ordinary functions
make-flagvec: Private ordinary functions
make-indexvec: Private ordinary functions
make-kdfltarr: Private ordinary functions
make-kdfltvec: Private ordinary functions
make-kdresult: Private ordinary functions
make-kdtree: Private ordinary functions
make-objvec: Private ordinary functions
make-search-action: Public ordinary functions

P
partition-ir-vec-around-median: Private ordinary functions

S
sort-kdresult-by-radius: Private ordinary functions


A.3 Variables

Jump to:   *   +  
A   B   C   D   F   I   N   O   R   S  
Index Entry  Section

*
*kdtree-expansion-factor*: Private special variables

+
+empty+: Private constants
+end+: Private constants
+filled+: Private constants
+most-positive-float+: Private constants

A
avg-depth: Public structures

B
bbox: Public structures

C
Constant, +empty+: Private constants
Constant, +end+: Private constants
Constant, +filled+: Private constants
Constant, +most-positive-float+: Private constants

D
dist-vec: Public structures

F
flag-vec: Public structures

I
idepth: Public structures
index-left-vec: Public structures
index-right-vec: Public structures
index-vec: Public structures
ir-vec: Public structures

N
n: Public structures
ndim: Public structures
ndim: Public structures
needs-balancing: Public structures
npoints: Public structures
npoints-total: Public structures

O
obj-vec: Public structures
obj-vec: Public structures

R
r-vec: Public structures
rmax-vec: Public structures
rmin-vec: Public structures

S
sd-vec: Public structures
Slot, avg-depth: Public structures
Slot, bbox: Public structures
Slot, dist-vec: Public structures
Slot, flag-vec: Public structures
Slot, idepth: Public structures
Slot, index-left-vec: Public structures
Slot, index-right-vec: Public structures
Slot, index-vec: Public structures
Slot, ir-vec: Public structures
Slot, n: Public structures
Slot, ndim: Public structures
Slot, ndim: Public structures
Slot, needs-balancing: Public structures
Slot, npoints: Public structures
Slot, npoints-total: Public structures
Slot, obj-vec: Public structures
Slot, obj-vec: Public structures
Slot, r-vec: Public structures
Slot, rmax-vec: Public structures
Slot, rmin-vec: Public structures
Slot, sd-vec: Public structures
Special Variable, *kdtree-expansion-factor*: Private special variables


A.4 Data types

Jump to:   B   D   F   I   K   O   P   S   T  
Index Entry  Section

B
bbox: Public structures

D
dimnum: Public types
dimvec: Private types

F
File, kdtree-jk-balance.lisp: The kdtree-jk/kdtree-jk-balance․lisp file
File, kdtree-jk-insert.lisp: The kdtree-jk/kdtree-jk-insert․lisp file
File, kdtree-jk-package.lisp: The kdtree-jk/kdtree-jk-package․lisp file
File, kdtree-jk-search.lisp: The kdtree-jk/kdtree-jk-search․lisp file
File, kdtree-jk-structs.lisp: The kdtree-jk/kdtree-jk-structs․lisp file
File, kdtree-jk-utils.lisp: The kdtree-jk/kdtree-jk-utils․lisp file
File, kdtree-jk.asd: The kdtree-jk/kdtree-jk․asd file
flagvec: Private types

I
index: Public types
indexvec: Private types

K
kd-flag: Private types
kd-float: Public types
kdfltarr: Private types
kdfltvec: Private types
kdresult: Public structures
kdtree: Public structures
kdtree-jk: The kdtree-jk system
kdtree-jk: The kdtree-jk package
kdtree-jk-balance.lisp: The kdtree-jk/kdtree-jk-balance․lisp file
kdtree-jk-insert.lisp: The kdtree-jk/kdtree-jk-insert․lisp file
kdtree-jk-package.lisp: The kdtree-jk/kdtree-jk-package․lisp file
kdtree-jk-search.lisp: The kdtree-jk/kdtree-jk-search․lisp file
kdtree-jk-structs.lisp: The kdtree-jk/kdtree-jk-structs․lisp file
kdtree-jk-utils.lisp: The kdtree-jk/kdtree-jk-utils․lisp file
kdtree-jk.asd: The kdtree-jk/kdtree-jk․asd file

O
objvec: Private types

P
Package, kdtree-jk: The kdtree-jk package

S
Structure, bbox: Public structures
Structure, kdresult: Public structures
Structure, kdtree: Public structures
System, kdtree-jk: The kdtree-jk system

T
Type, dimnum: Public types
Type, dimvec: Private types
Type, flagvec: Private types
Type, index: Public types
Type, indexvec: Private types
Type, kd-flag: Private types
Type, kd-float: Public types
Type, kdfltarr: Private types
Type, kdfltvec: Private types
Type, objvec: Private types