| Package | Description |
|---|---|
| org.tinspin.index | |
| org.tinspin.index.array | |
| org.tinspin.index.phtree | |
| org.tinspin.index.qthypercube | |
| org.tinspin.index.qtplain | |
| org.tinspin.index.rtree |
| Modifier and Type | Interface and Description |
|---|---|
interface |
RectangleEntryDist<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIterator<RectangleEntry<T>> |
RectangleIndex.iterator() |
QueryIterator<RectangleEntry<T>> |
RectangleIndex.queryIntersect(double[] min,
double[] max) |
| Modifier and Type | Method and Description |
|---|---|
default double |
RectangleDistanceFunction.dist(double[] center,
RectangleEntry<?> entry)
Some algorithm use this method on the entries containing user supplied values.
|
double |
RectangleDistanceFunction.FarthestNeighbor.dist(double[] center,
RectangleEntry<?> entry) |
| Modifier and Type | Method and Description |
|---|---|
QueryIterator<RectangleEntry<T>> |
RectArray.iterator() |
| Modifier and Type | Class and Description |
|---|---|
class |
DistEntryR<T> |
class |
EntryR<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIterator<RectangleEntry<T>> |
PHTreeR.iterator() |
QueryIterator<RectangleEntry<T>> |
PHTreeR.queryIntersect(double[] min,
double[] max) |
| Modifier and Type | Class and Description |
|---|---|
class |
QREntry<T> |
class |
QREntryDist<T> |
| Modifier and Type | Method and Description |
|---|---|
QueryIterator<RectangleEntry<T>> |
QuadTreeRKD.iterator() |
| Modifier and Type | Method and Description |
|---|---|
QueryIterator<RectangleEntry<T>> |
QuadTreeRKD0.iterator() |
| Modifier and Type | Class and Description |
|---|---|
class |
DistEntry<T> |
class |
Entry<T> |
| Modifier and Type | Method and Description |
|---|---|
default boolean |
Filter.matches(RectangleEntry<?> entry)
This is used on the actual entries.
|
boolean |
Filter.UnionFilter.matches(RectangleEntry<?> entry) |
Copyright © 2018. All rights reserved.