All Classes Interface Summary Class Summary Enum Summary
| Class |
Description |
| BitTools |
|
| BoxDistance |
|
| BoxDistance.EdgeDistance |
|
| BoxDistance.FarthestNeighbor |
Special wrapper class which takes the inverse or the given function.
|
| BoxDistance.RectangleDist |
This class calculates the distance to a rectangular shaped object.
|
| BoxIteratorWrapper<E> |
|
| BoxMap<T> |
|
| BoxMap.Factory |
|
| BoxMultimap<T> |
A common interface for spatial indexes (multimaps) that use boxes as keys.
|
| BoxMultimap.Factory |
|
| CoverTree<T> |
A 'faster' CoverTree implementation based on the paper:
|
| CoverTree.CTStats |
|
| CoverTreeQueryKnn<T> |
kNN search.
|
| CritBit<V> |
|
| CritBit.CheckEmptyWithMask |
|
| CritBit.Entry<V> |
|
| CritBit.FullIterator<V> |
|
| CritBit.QueryIterator<V> |
|
| CritBit.QueryIteratorKD<V> |
|
| CritBit.QueryIteratorWithMask<V> |
|
| CritBit1D<V> |
|
| CritBit64<V> |
|
| CritBit64.AtomicInfo<V> |
|
| CritBit64.CBIterator<V> |
|
| CritBit64.Entry<V> |
|
| CritBit64.Node<V> |
|
| CritBit64.QueryIterator<V> |
|
| CritBit64.QueryIteratorMask<V> |
|
| CritBit64COW<V> |
A concurrency enabled version of the CritBit64 tree.
|
| CritBitKD<V> |
|
| Examples |
|
| Filter |
|
| Filter.RectangleIntersectFilter |
Rectangular region filter.
|
| Filter.UnionFilter |
Union of different "ranges".
|
| Index |
|
| Index.BEComparator |
|
| Index.BoxEntry<T> |
A box entry.
|
| Index.BoxEntryKnn<T> |
|
| Index.BoxFilterKnn<T> |
|
| Index.BoxIterator<T> |
|
| Index.BoxIteratorKnn<T> |
|
| Index.PEComparator |
|
| Index.PointEntry<T> |
|
| Index.PointEntryKnn<T> |
|
| Index.PointFilterKnn<T> |
|
| Index.PointIterator<T> |
|
| Index.PointIteratorKnn<T> |
|
| Index.QueryIterator<T> |
|
| Index.QueryIteratorKnn<T> |
|
| IndexConfig |
|
| KDIterator<T> |
Resetable query iterator.
|
| KDIteratorKnn<T> |
|
| KDTree<T> |
A simple KD-Tree implementation.
|
| KDTree.KDStats |
Statistics container class.
|
| MinHeap<T> |
|
| MinHeap.Less<T> |
|
| MinHeapI<T> |
|
| MinMaxHeap<T> |
|
| MinMaxHeap.Less<T> |
|
| MinMaxHeapI<T> |
|
| MutableBool |
|
| MutableInt |
|
| MutableRef<T> |
|
| Node<T> |
|
| Node<T> |
Node class for the quadtree.
|
| PHStats |
|
| PHTreeMMP<T> |
Multimap version of the PH-Tree.
|
| PHTreeP<T> |
|
| PHTreeR<T> |
|
| PointArray<T> |
|
| PointDistance |
|
| PointIteratorWrapper<E> |
|
| PointMap<T> |
A common interface for spatial indexes (maps) that use points as keys.
|
| PointMap.Factory |
|
| PointMapWrapper<T> |
|
| PointMultimap<T> |
A common interface for spatial indexes (multimaps) that use points as keys.
|
| PointMultimap.Factory |
|
| PointMultimapWrapper<T> |
|
| QIterator0<T> |
Resettable query iterator.
|
| QIterator0<T> |
Resettable query iterator.
|
| QIterator1<T> |
Resettable query iterator.
|
| QIterator1<T> |
Resettable query iterator.
|
| QIterator2<T> |
Resettable query iterator.
|
| QIterator2<T> |
Resettable query iterator.
|
| QIteratorKnn<T> |
|
| QIteratorKnn<T> |
|
| QIteratorKnn<T> |
|
| QNode<T> |
Node class for the quadtree.
|
| QNode<T> |
Node class for the quadtree.
|
| QNode<T> |
Node class for the quadtree.
|
| QRIterator<T> |
Resetable query iterator.
|
| QRIteratorKnn<T> |
|
| QRIteratorKnn<T> |
|
| QRNode<T> |
Node class for the quadtree.
|
| QRNode<T> |
Node class for the quadtree.
|
| QuadTreeKD<T> |
This is a MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| QuadTreeKD.QStats |
Statistics container class.
|
| QuadTreeKD0<T> |
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| QuadTreeKD0.QIterator<T> |
Resettable query iterator.
|
| QuadTreeKD0.QStats |
Statistics container class.
|
| QuadTreeKD2<T> |
This is a MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| QuadTreeKD2.QStats |
Statistics container class.
|
| QuadTreeRKD<T> |
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| QuadTreeRKD0<T> |
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| QuadTreeRKD0.QRIterator<T> |
Resetable query iterator.
|
| RectArray<T> |
|
| RStarTreeLogic |
|
| RTree<T> |
R*Tree implementation based on the paper from
Beckmann, N.; Kriegel, H.
|
| RTree.RTreeStats |
|
| RTreeEntry<T> |
|
| RTreeIterator<T> |
|
| RTreeLogic |
|
| RTreeQuery1nn<T> |
1-NN search with EDGE distance and presorting of entries.
|
| RTreeQueryKnn<T> |
|
| Stats |
|
| StringBuilderLn |
|
| STRLoader<T> |
|
| TestDraw |
|
| TestDraw.MODE |
|