public class WithinPrefixTreeFilter extends AbstractVisitingPrefixTreeFilter
WITHINthe 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
queryBufferconstructor 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.
|Constructor and Description|
|Modifier and Type||Method and Description|
Returns a new shape that is larger than shape by at distErr.
public WithinPrefixTreeFilter(com.spatial4j.core.shape.Shape queryShape, String fieldName, SpatialPrefixTree grid, int detailLevel, int prefixGridScanLevel, double queryBuffer)
AbstractVisitingPrefixTreeFilter.AbstractVisitingPrefixTreeFilter(com.spatial4j.core.shape.Shape, String, org.apache.lucene.spatial.prefix.tree.SpatialPrefixTree, int, int).
queryBufferis 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).
protected com.spatial4j.core.shape.Shape bufferShape(com.spatial4j.core.shape.Shape shape, double distErr)
Copyright © 2000-2013 Apache Software Foundation. All Rights Reserved.