Interface | Description |
---|---|
ByteNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
CoordinateIndex<T extends Coordinate> |
Interface representing an index of
Coordinate s that can
have points added to it and can be searched in a variety of ways. |
DoubleNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
FloatNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
IncrementalNearestNeighbours<DATA,DISTANCES,PAIR_TYPE> |
Extension to K-nearest-neighbour that allows database points to be added
dynamically.
|
InternalNearestNeighbours<DISTANCES> |
Interface for K-nearest-neighbour implementations that are able to search
directly using an indexed item of their own internal data as the query.
|
IntNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
LongNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
NearestNeighbours<DATA,DISTANCES,PAIR_TYPE> |
Interface for k-nearest-neighbour calculations with some data.
|
NearestNeighboursFactory<T extends NearestNeighbours<DATA,?,?>,DATA> |
Interface for factory objects that can produce
NearestNeighbours
objects for some given data. |
ObjectNearestNeighboursProvider<T> |
Interface for classes able to expose a k-nearest-neighbour object.
|
ShortNearestNeighboursProvider |
Interface for classes able to expose a k-nearest-neighbour object.
|
Class | Description |
---|---|
ByteNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with byte[] data.
|
ByteNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
ByteNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
ByteNearestNeighboursExact s. |
CoordinateBruteForce<T extends Coordinate> |
Implementation of a
CoordinateIndex that performs
searching by brute-force comparison over the indexed coordinates. |
CoordinateKDTree<T extends Coordinate> |
Implementation of a simple KDTree with range search.
|
DoubleNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with double[] data.
|
DoubleNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
DoubleNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
DoubleNearestNeighboursExact s. |
FloatNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with float[] data.
|
FloatNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
FloatNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
FloatNearestNeighboursExact s. |
IntNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with int[] data.
|
IntNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
IntNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
IntNearestNeighboursExact s. |
LongNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with long[] data.
|
LongNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
LongNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
LongNearestNeighboursExact s. |
ObjectNearestNeighbours<T> |
Abstract base class for k-nearest-neighbour calculations with any form of
object that can be compared with a
DistanceComparator . |
ObjectNearestNeighboursExact<T> |
Exact (brute-force) k-nearest-neighbour implementation for objects with a
compatible
DistanceComparator . |
ObjectNearestNeighboursExact.Factory<T> |
NearestNeighboursFactory for producing
ObjectNearestNeighboursExact s. |
ShortNearestNeighbours |
Abstract base class for k-nearest-neighbour calculations with short[] data.
|
ShortNearestNeighboursExact |
Exact (brute-force) k-nearest-neighbour implementation.
|
ShortNearestNeighboursExact.Factory |
NearestNeighboursFactory for producing
ShortNearestNeighboursExact s. |