public class WithinPrefixTreeQuery extends AbstractVisitingPrefixTreeQuery
WITHIN
the query shape. It works by looking at cells outside of the query
shape to ensure documents there are excluded. By default, it will
examine all cells, and it's fairly slow. If you know that the indexed shapes
are never comprised of multiple disjoint parts (which also means it is not multi-valued),
then you can pass SpatialPrefixTree.getDistanceForLevel(maxLevels)
as
the queryBuffer
constructor parameter to minimally look this distance
beyond the query shape's edge. Even if the indexed shapes are sometimes
comprised of multiple disjoint parts, you might want to use this option with
a large buffer as a faster approximation with minimal false-positives.AbstractVisitingPrefixTreeQuery.VisitorTemplate, AbstractVisitingPrefixTreeQuery.VNode
AbstractPrefixTreeQuery.BaseTermsEnumTraverser
prefixGridScanLevel
detailLevel, fieldName, grid, queryShape
Constructor and Description |
---|
WithinPrefixTreeQuery(org.locationtech.spatial4j.shape.Shape queryShape,
String fieldName,
SpatialPrefixTree grid,
int detailLevel,
int prefixGridScanLevel,
double queryBuffer)
|
Modifier and Type | Method and Description |
---|---|
protected org.locationtech.spatial4j.shape.Shape |
bufferShape(org.locationtech.spatial4j.shape.Shape shape,
double distErr)
Returns a new shape that is larger than shape by at distErr.
|
boolean |
equals(Object o) |
protected DocIdSet |
getDocIdSet(LeafReaderContext context) |
int |
hashCode() |
String |
toString(String field) |
createWeight, visit
classHash, rewrite, sameClassAs, toString
public WithinPrefixTreeQuery(org.locationtech.spatial4j.shape.Shape queryShape, String fieldName, SpatialPrefixTree grid, int detailLevel, int prefixGridScanLevel, double queryBuffer)
AbstractVisitingPrefixTreeQuery.AbstractVisitingPrefixTreeQuery(org.locationtech.spatial4j.shape.Shape, String, org.apache.lucene.spatial.prefix.tree.SpatialPrefixTree, int, int)
.
queryBuffer
is the (minimum) distance beyond the query shape edge
where non-matching documents are looked for so they can be excluded. If
-1 is used then the whole world is examined (a good default for correctness).public boolean equals(Object o)
equals
in class AbstractPrefixTreeQuery
public int hashCode()
hashCode
in class AbstractPrefixTreeQuery
protected org.locationtech.spatial4j.shape.Shape bufferShape(org.locationtech.spatial4j.shape.Shape shape, double distErr)
protected DocIdSet getDocIdSet(LeafReaderContext context) throws IOException
getDocIdSet
in class AbstractPrefixTreeQuery
IOException
Copyright © 2000-2019 Apache Software Foundation. All Rights Reserved.