Package | Description |
---|---|
org.apache.lucene.index |
Code to maintain and access indices.
|
org.apache.lucene.util.bkd |
Block KD-tree, implementing the generic spatial data structure described in
this paper.
|
Modifier and Type | Class and Description |
---|---|
static class |
CheckIndex.VerifyPointsVisitor
Walks the entire N-dimensional points space, verifying that all points fall within the last cell's boundaries.
|
Modifier and Type | Method and Description |
---|---|
abstract long |
PointValues.estimatePointCount(PointValues.IntersectVisitor visitor)
Estimate the number of points that would be visited by
PointValues.intersect(org.apache.lucene.index.PointValues.IntersectVisitor)
with the given PointValues.IntersectVisitor . |
abstract void |
PointValues.intersect(PointValues.IntersectVisitor visitor)
Finds all documents and points matching the provided visitor.
|
Modifier and Type | Method and Description |
---|---|
long |
BKDReader.estimatePointCount(PointValues.IntersectVisitor visitor) |
BKDReader.IntersectState |
BKDReader.getIntersectState(PointValues.IntersectVisitor visitor)
Create a new
BKDReader.IntersectState |
void |
BKDReader.intersect(PointValues.IntersectVisitor visitor) |
Constructor and Description |
---|
IntersectState(IndexInput in,
int numDims,
int packedBytesLength,
int packedIndexBytesLength,
int maxPointsInLeafNode,
PointValues.IntersectVisitor visitor,
BKDReader.IndexTree indexVisitor) |
Copyright © 2000-2019 Apache Software Foundation. All Rights Reserved.