private static class NearestNeighbor.NearestVisitor extends java.lang.Object implements PointValues.IntersectVisitor
Modifier and Type | Field and Description |
---|---|
int |
curDocBase |
Bits |
curLiveDocs |
(package private) java.util.PriorityQueue<NearestNeighbor.NearestHit> |
hitQueue |
private double |
maxLat |
private double |
maxLon |
private double |
minLat |
private double |
minLon |
private double |
minLon2 |
(package private) double |
pointLat |
(package private) double |
pointLon |
private int |
setBottomCounter |
(package private) int |
topN |
Constructor and Description |
---|
NearestVisitor(java.util.PriorityQueue<NearestNeighbor.NearestHit> hitQueue,
int topN,
double pointLat,
double pointLon) |
Modifier and Type | Method and Description |
---|---|
PointValues.Relation |
compare(byte[] minPackedValue,
byte[] maxPackedValue)
Called for non-leaf cells to test how the cell relates to the query, to
determine how to further recurse down the tree.
|
private void |
maybeUpdateBBox() |
void |
visit(int docID)
Called for all documents in a leaf cell that's fully contained by the query.
|
void |
visit(int docID,
byte[] packedValue)
Called for all documents in a leaf cell that crosses the query.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
grow
public int curDocBase
public Bits curLiveDocs
final int topN
final java.util.PriorityQueue<NearestNeighbor.NearestHit> hitQueue
final double pointLat
final double pointLon
private int setBottomCounter
private double minLon
private double maxLon
private double minLat
private double maxLat
private double minLon2
public NearestVisitor(java.util.PriorityQueue<NearestNeighbor.NearestHit> hitQueue, int topN, double pointLat, double pointLon)
public void visit(int docID)
PointValues.IntersectVisitor
visit
in interface PointValues.IntersectVisitor
private void maybeUpdateBBox()
public void visit(int docID, byte[] packedValue)
PointValues.IntersectVisitor
visit
in interface PointValues.IntersectVisitor
public PointValues.Relation compare(byte[] minPackedValue, byte[] maxPackedValue)
PointValues.IntersectVisitor
compare
in interface PointValues.IntersectVisitor