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

Показать файл Открыть проект

Открытые методы

Метод	Описание
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