Class ChainedFilter
Allows multiple Lucene.Net.Search.Filters to be chained. Logical operations such as NOT and XOR are applied between filters. One operation can be used for all filters, or a specific operation can be declared for each filter.
Order in which filters are called depends on the position of the filter in the chain. It's probably more efficient to place the most restrictive filters/least computationally-intensive filters first.
Inherited Members
Namespace: Lucene.Net.Queries
Assembly: Lucene.Net.Queries.dll
Syntax
public class ChainedFilter : Filter
Constructors
ChainedFilter(Filter[])
Ctor.
Declaration
public ChainedFilter(Filter[] chain)
Parameters
Type | Name | Description |
---|---|---|
Filter[] | chain | The chain of filters |
ChainedFilter(Filter[], int)
Ctor.
Declaration
public ChainedFilter(Filter[] chain, int logic)
Parameters
Type | Name | Description |
---|---|---|
Filter[] | chain | The chain of filters |
int | logic | Logical operation to apply to ALL filters |
ChainedFilter(Filter[], int[])
Ctor.
Declaration
public ChainedFilter(Filter[] chain, int[] logicArray)
Parameters
Type | Name | Description |
---|---|---|
Filter[] | chain | The chain of filters |
int[] | logicArray | Logical operations to apply between filters |
Fields
AND
Allows multiple Lucene.Net.Search.Filters to be chained. Logical operations such as NOT and XOR are applied between filters. One operation can be used for all filters, or a specific operation can be declared for each filter.
Order in which filters are called depends on the position of the filter in the chain. It's probably more efficient to place the most restrictive filters/least computationally-intensive filters first.
Declaration
public const int AND = 1
Field Value
Type | Description |
---|---|
int |
ANDNOT
Allows multiple Lucene.Net.Search.Filters to be chained. Logical operations such as NOT and XOR are applied between filters. One operation can be used for all filters, or a specific operation can be declared for each filter.
Order in which filters are called depends on the position of the filter in the chain. It's probably more efficient to place the most restrictive filters/least computationally-intensive filters first.
Declaration
public const int ANDNOT = 2
Field Value
Type | Description |
---|---|
int |
DEFAULT
Logical operation when none is declared. Defaults to OR.
Declaration
public const int DEFAULT = 0
Field Value
Type | Description |
---|---|
int |
OR
Allows multiple Lucene.Net.Search.Filters to be chained. Logical operations such as NOT and XOR are applied between filters. One operation can be used for all filters, or a specific operation can be declared for each filter.
Order in which filters are called depends on the position of the filter in the chain. It's probably more efficient to place the most restrictive filters/least computationally-intensive filters first.
Declaration
public const int OR = 0
Field Value
Type | Description |
---|---|
int |
XOR
Allows multiple Lucene.Net.Search.Filters to be chained. Logical operations such as NOT and XOR are applied between filters. One operation can be used for all filters, or a specific operation can be declared for each filter.
Order in which filters are called depends on the position of the filter in the chain. It's probably more efficient to place the most restrictive filters/least computationally-intensive filters first.
Declaration
public const int XOR = 3
Field Value
Type | Description |
---|---|
int |
Methods
GetDocIdSet(AtomicReaderContext, IBits)
Lucene.Net.Search.Filter.GetDocIdSet(Lucene.Net.Index.AtomicReaderContext, Lucene.Net.Util.IBits).
Declaration
public override DocIdSet GetDocIdSet(AtomicReaderContext context, IBits acceptDocs)
Parameters
Type | Name | Description |
---|---|---|
AtomicReaderContext | context | |
IBits | acceptDocs |
Returns
Type | Description |
---|---|
DocIdSet |
Overrides
ToString()
Returns a string that represents the current object.
Declaration
public override string ToString()
Returns
Type | Description |
---|---|
string | A string that represents the current object. |