org.apache.lucene.index

Interface PointValues.IntersectVisitor

Enclosing class:

PointValues

public static interface PointValues.IntersectVisitor

We recurse the BKD tree, using a provided instance of this to guide the recursion.

WARNING: This API is experimental and might change in incompatible ways in the next release.

Method Summary

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.
default void	grow(int count) Notifies the caller that this many documents (from one block) are about to be visited
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.

Method Detail

visit

void visit(int docID)
    throws IOException

Called for all documents in a leaf cell that's fully contained by the query. The consumer should blindly accept the docID.

Throws:

IOException

visit

void visit(int docID,
           byte[] packedValue)
    throws IOException

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.

Throws:

IOException

compare

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.

grow

default void grow(int count)

Notifies the caller that this many documents (from one block) are about to be visited