Namespace Lucene.Net.QueryParsers.Surround.Query

Factory for conjunctions

Factory for creating basic term queries

Base class for composite queries (such as AND/OR/NOT)

Factory for NEAR queries

Forms an OR query of the provided query across multiple fields.

Factory for prohibited clauses

Factory for disjunctions

Base class for queries that expand to sets of simple terms.

SpanNearClauseFactory:

Operations:

• create for a field name and an indexreader.
• add a weighted Term - this should add a corresponding SpanTermQuery, or increase the weight of an existing one.
• add a weighted subquery SpanNearQuery
• create a clause for SpanNearQuery from the things added above.

For this, create an array of SpanQuery's from the added ones. The clause normally is a SpanOrQuery over the added subquery SpanNearQuery the SpanTermQuery's for the added Term's

When it is necessary to suppress double subqueries as much as possible: GetHashCode() and Equals() on unweighted SpanQuery are needed (possibly via GetTerms(), the terms are individually hashable). Idem SpanNearQuery: hash on the subqueries and the slop. Evt. merge SpanNearQuery's by adding the weights of the corresponding subqueries.

To be determined: Are SpanQuery weights handled correctly during search by Lucene? Should the resulting SpanOrQuery be sorted? Could other SpanQueries be added for use in this factory:

• SpanOrQuery: in principle yes, but it only has access to it's terms via getTerms(); are the corresponding weights available?
• SpanFirstQuery: treat similar to subquery SpanNearQuery. (ok?)
• SpanNotQuery: treat similar to subquery SpanNearQuery. (ok?)

Factory for SpanOrQuery

Query that matches string prefixes

Lowest level base class for surround queries

Simple single-term clause

Query that matches wildcards

Exception thrown when BasicQueryFactory would exceed the limit of query clauses.

Interface for queries that can be nested as subqueries into a span near.

Callback to visit each matching term during "rewrite" in VisitMatchingTerm(Term)