Package | Description |
---|---|
org.apache.lucene.util.bkd |
Block KD-tree, implementing the generic spatial data structure described in
this paper.
|
Class and Description |
---|
BKDReader
Handles intersection of an multi-dimensional shape in byte[] space with a block KD-tree previously written with
BKDWriter . |
BKDReader.IndexTree
Used to walk the in-heap index
|
BKDReader.IntersectState
Used to track all state for a single call to
BKDReader.intersect(org.apache.lucene.index.PointValues.IntersectVisitor) . |
HeapPointWriter
Utility class to write new points into in-heap arrays.
|
PointReader
One pass iterator through all points previously written with a
PointWriter , abstracting away whether points a read
from (offline) disk or simple arrays in heap. |
PointWriter
Appends many points, and then at the end provides a
PointReader to iterate
those points. |
Copyright © 2000-2017 Apache Software Foundation. All Rights Reserved.