| Package | Description |
|---|---|
| org.tinspin.index | |
| org.tinspin.index.phtree | |
| org.tinspin.index.qthypercube | |
| org.tinspin.index.rtree |
| Modifier and Type | Method and Description |
|---|---|
default RectangleEntryDist<T> |
RectangleIndex.query1NN(double[] center)
Finds the nearest neighbor.
|
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<RectangleEntryDist<T>> |
RectangleIndex.queryKNN(double[] center,
int k)
Finds the nearest neighbor.
|
| Modifier and Type | Class and Description |
|---|---|
class |
DistEntryR<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIteratorKNN<RectangleEntryDist<T>> |
PHTreeR.queryKNN(double[] center,
int k) |
| Modifier and Type | Class and Description |
|---|---|
class |
QREntryDist<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
DistEntry<T> |
| Modifier and Type | Method and Description |
|---|---|
RectangleEntryDist<T> |
RTree.query1NN(double[] center) |
| Modifier and Type | Method and Description |
|---|---|
Iterable<RectangleEntryDist<T>> |
RTree.queryRangedNearestNeighbor(double[] center,
DistanceFunction dist,
DistanceFunction closestDist,
double[] minBound,
double[] maxBound) |
Iterable<RectangleEntryDist<T>> |
RTree.queryRangedNearestNeighbor(double[] center,
DistanceFunction dist,
DistanceFunction closestDist,
Filter filter)
This methods returns an Iterable which returns the nodes by a combined range and
nearest number search.
|
Copyright © 2017. All rights reserved.