C# 클래스 Lucene.Net.Spatial.Prefix.RecursivePrefixTreeFilter

Performs a spatial intersection filter against a field indexed with {@link SpatialPrefixTree}, a Trie. SPT yields terms (grids) at length 1 and at greater lengths corresponding to greater precisions. This filter recursively traverses each grid length and uses methods on {@link Shape} to efficiently know that all points at a prefix fit in the shape or not to either short-circuit unnecessary traversals or to efficiently load all enclosed points.

상속: Lucene.Net.Search.Filter

파일 보기 프로젝트 열기: apache/lucenenet

공개 메소드들

메소드	설명
Equals ( object o ) : bool
GetDocIdSet ( Index reader ) : Lucene.Net.Search.DocIdSet
GetHashCode ( ) : int
RecursivePrefixTreeFilter ( String fieldName, SpatialPrefixTree grid, Shape queryShape, int prefixGridScanLevel, int detailLevel ) : System
ToString ( ) : string

메소드 상세

Equals() 공개 메소드

public Equals ( object o ) : bool
o	object
리턴	bool

GetDocIdSet() 공개 메소드

public GetDocIdSet ( Index reader ) : Lucene.Net.Search.DocIdSet
reader	Index
리턴	Lucene.Net.Search.DocIdSet

GetHashCode() 공개 메소드

public GetHashCode ( ) : int
리턴	int

RecursivePrefixTreeFilter() 공개 메소드

public RecursivePrefixTreeFilter ( String fieldName, SpatialPrefixTree grid, Shape queryShape, int prefixGridScanLevel, int detailLevel ) : System
fieldName	String
grid	Lucene.Net.Spatial.Prefix.Tree.SpatialPrefixTree
queryShape	Shape
prefixGridScanLevel	int
detailLevel	int
리턴	System

ToString() 공개 메소드

public ToString ( ) : string
리턴	string