Module org.apache.lucene.sandbox
Package org.apache.lucene.sandbox.search
Class NearestNeighbor.NearestVisitor
java.lang.Object
org.apache.lucene.sandbox.search.NearestNeighbor.NearestVisitor
- All Implemented Interfaces:
PointValues.IntersectVisitor
- Enclosing class:
- NearestNeighbor
private static class NearestNeighbor.NearestVisitor
extends Object
implements PointValues.IntersectVisitor
-
Field Summary
FieldsModifier and TypeFieldDescriptionint
(package private) final PriorityQueue<NearestNeighbor.NearestHit>
private double
private double
private double
private double
private double
(package private) final double
(package private) final double
private int
(package private) final int
-
Constructor Summary
ConstructorsConstructorDescriptionNearestVisitor
(PriorityQueue<NearestNeighbor.NearestHit> hitQueue, int topN, double pointLat, double pointLon) -
Method Summary
Modifier and TypeMethodDescriptioncompare
(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
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.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface org.apache.lucene.index.PointValues.IntersectVisitor
grow, visit, visit
-
Field Details
-
curDocBase
public int curDocBase -
curLiveDocs
-
topN
final int topN -
hitQueue
-
pointLat
final double pointLat -
pointLon
final double pointLon -
setBottomCounter
private int setBottomCounter -
minLon
private double minLon -
maxLon
private double maxLon -
minLat
private double minLat -
maxLat
private double maxLat -
minLon2
private double minLon2
-
-
Constructor Details
-
NearestVisitor
public NearestVisitor(PriorityQueue<NearestNeighbor.NearestHit> hitQueue, int topN, double pointLat, double pointLon)
-
-
Method Details
-
visit
public void visit(int docID) Description copied from interface:PointValues.IntersectVisitor
Called for all documents in a leaf cell that's fully contained by the query. The consumer should blindly accept the docID.- Specified by:
visit
in interfacePointValues.IntersectVisitor
-
maybeUpdateBBox
private void maybeUpdateBBox() -
visit
public void visit(int docID, byte[] packedValue) Description copied from interface:PointValues.IntersectVisitor
Called for all documents in a leaf cell that crosses the query. The consumer should scrutinize the packedValue to decide whether to accept it. In the 1D case, values are visited in increasing order, and in the case of ties, in increasing docID order.- Specified by:
visit
in interfacePointValues.IntersectVisitor
-
compare
Description copied from interface:PointValues.IntersectVisitor
Called for non-leaf cells to test how the cell relates to the query, to determine how to further recurse down the tree.- Specified by:
compare
in interfacePointValues.IntersectVisitor
-