C# Class Lucene.Net.Spatial.Prefix.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: PrefixTreeStrategy

显示文件 Open project: apache/lucenenet Class Usage Examples

Protected Properties

Property	Type	Description
multiOverlappingIndexedShapes	bool
pointsOnly	bool

Public Methods

Method	Description
MakeFilter ( SpatialArgs args ) : Filter
RecursivePrefixTreeStrategy ( SpatialPrefixTree grid, string fieldName ) : Lucene.Net.Search
ToString ( ) : string

Method Details

MakeFilter() public method

public MakeFilter ( SpatialArgs args ) : Filter
args	Lucene.Net.Spatial.Queries.SpatialArgs
return	Lucene.Net.Search.Filter

RecursivePrefixTreeStrategy() public method

public RecursivePrefixTreeStrategy ( SpatialPrefixTree grid, string fieldName ) : Lucene.Net.Search
grid	Lucene.Net.Spatial.Prefix.Tree.SpatialPrefixTree
fieldName	string
return	Lucene.Net.Search

ToString() public method

public ToString ( ) : string
return	string

Property Details

multiOverlappingIndexedShapes protected_oe property

See ContainsPrefixTreeFilter.multiOverlappingIndexedShapes.

protected bool multiOverlappingIndexedShapes
return	bool

pointsOnly protected_oe property

True if only indexed points shall be supported. See IntersectsPrefixTreeFilter.hasIndexedLeaves.

protected bool pointsOnly
return	bool