C# 클래스 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
상속: PrefixTreeStrategy
파일 보기 프로젝트 열기: apache/lucenenet 1 사용 예제들

보호된 프로퍼티들

프로퍼티 타입 설명
multiOverlappingIndexedShapes bool
pointsOnly bool

공개 메소드들

메소드 설명
MakeFilter ( SpatialArgs args ) : Filter
RecursivePrefixTreeStrategy ( SpatialPrefixTree grid, string fieldName ) : Lucene.Net.Search
ToString ( ) : string

메소드 상세

MakeFilter() 공개 메소드

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

RecursivePrefixTreeStrategy() 공개 메소드

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

ToString() 공개 메소드

public ToString ( ) : string
리턴 string

프로퍼티 상세

multiOverlappingIndexedShapes 보호되어 있는 프로퍼티

See ContainsPrefixTreeFilter.multiOverlappingIndexedShapes.
protected bool multiOverlappingIndexedShapes
리턴 bool

pointsOnly 보호되어 있는 프로퍼티

True if only indexed points shall be supported. See IntersectsPrefixTreeFilter.hasIndexedLeaves.
protected bool pointsOnly
리턴 bool