Class RecursivePrefixTreeStrategy

A PrefixTreeStrategy which uses AbstractVisitingPrefixTreeFilter. This strategy has support for searching non-point shapes (note: not tested). Even a query shape with distErrPct=0 (fully precise to the grid) should have good performance for typical data, unless there is a lot of indexed data coincident with the shape's edge.

@lucene.experimental

Inheritance
System.Object
SpatialStrategy
PrefixTreeStrategy
RecursivePrefixTreeStrategy
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
Assembly: Lucene.Net.Spatial.dll
Syntax
[Serializable]
public class RecursivePrefixTreeStrategy : PrefixTreeStrategy

Constructors

Name Description
RecursivePrefixTreeStrategy(SpatialPrefixTree, String)

Fields

Name Description
m_multiOverlappingIndexedShapes

See m_multiOverlappingIndexedShapes.
m_pointsOnly

True if only indexed points shall be supported. See Lucene.Net.Spatial.Prefix.IntersectsPrefixTreeFilter.hasIndexedLeaves.

Properties

Name Description
PrefixGridScanLevel

Sets the grid level [1-maxLevels] at which indexed terms are scanned brute-force instead of by grid decomposition. By default this is maxLevels - 4. The final level, maxLevels, is always scanned. Value can be 1 to maxLevels.

Methods

Name Description
MakeFilter(SpatialArgs)
ToString()

Extension Methods