nl.inl.blacklab.search.lucene

Class SpanQueryAnyToken

java.lang.Object

org.apache.lucene.search.Query

org.apache.lucene.search.spans.SpanQuery

nl.inl.blacklab.search.lucene.BLSpanQuery

nl.inl.blacklab.search.lucene.SpanQueryAnyToken

All Implemented Interfaces:

Cloneable

public class SpanQueryAnyToken
extends BLSpanQuery

A SpanQuery matching a number of tokens without any restrictions.

Field Summary

Fields

Modifier and Type	Field and Description
protected int	max The maximum number of tokens in this stretch.
protected int	min The minimum number of tokens in this stretch.

Fields inherited from class nl.inl.blacklab.search.lucene.BLSpanQuery

MAX_UNLIMITED

Constructor Summary

Constructors

Constructor and Description
SpanQueryAnyToken(int min, int max, String luceneField)

Method Summary

Modifier and Type	Method and Description
BLSpanQuery	addRep(int addMin, int addMax)
boolean	canMakeNfa()
BLSpanWeight	createWeight(org.apache.lucene.search.IndexSearcher searcher, boolean needsScores)
boolean	equals(Object obj)
int	forwardMatchingCost() Return an (very rough) indication of how expensive finding a match for this query using an NFA would be.
Nfa	getNfa(ForwardIndexAccessor fiAccessor, int direction)
String	getRealField()
int	hashCode()
boolean	hitsAllSameLength() Do our hits have constant length?
boolean	hitsAreUnique() Is it guaranteed that no two hits have the same start and end position?
boolean	hitsEndPointSorted() When hit B follows hit A, is it guaranteed that B.end >= A.end? Also, if A.end == B.end, is B.start > A.start?
boolean	hitsHaveUniqueEnd() Is it guaranteed that no two hits have the same end position?
boolean	hitsHaveUniqueStart() Is it guaranteed that no two hits have the same start position?
int	hitsLengthMax() How long could our longest hit be?
int	hitsLengthMin() How long could our shortest hit be?
boolean	hitsStartPointSorted() When hit B follows hit A, is it guaranteed that B.start >= A.start? Also, if A.start == B.start, is B.end > A.end?
BLSpanQuery	inverted() Return an inverted version of this query.
boolean	matchesEmptySequence() Does this query match the empty sequence? For example, the query [word="cow"]* matches the empty sequence.
BLSpanQuery	noEmpty() Return a version of this clause that cannot match the empty sequence.
protected boolean	okayToInvertForOptimization() Is it okay to invert this query for optimization? Heuristic used to determine when to optimize a query by inverting one or more of its subqueries.
long	reverseMatchingCost(org.apache.lucene.index.IndexReader reader) Return an (very rough) indication of how many hits this clause might return.
BLSpanQuery	rewrite(org.apache.lucene.index.IndexReader reader)
String	toString(String field)

Methods inherited from class nl.inl.blacklab.search.lucene.BLSpanQuery

addMaxValues, canInternalizeNeighbour, ensureSorted, ensureSortedUnique, getField, getNfaTwoWay, inf, internalizeNeighbour, isSingleTokenNot, log, optimize, producesSingleTokens, setQueryInfo, wrap

Methods inherited from class org.apache.lucene.search.spans.SpanQuery

getTermContexts, getTermContexts

Methods inherited from class org.apache.lucene.search.Query

clone, getBoost, setBoost, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

min

protected int min

The minimum number of tokens in this stretch.

max

protected int max

The maximum number of tokens in this stretch.

Constructor Detail

SpanQueryAnyToken

public SpanQueryAnyToken(int min,
                         int max,
                         String luceneField)

Method Detail

matchesEmptySequence

public boolean matchesEmptySequence()

Description copied from class: BLSpanQuery

Does this query match the empty sequence? For example, the query [word="cow"]* matches the empty sequence. We need to know this so we can rewrite to the appropriate queries. A query of the form "AB*" would be translated into "A|AB+", so each component of the query actually generates non-empty matches. We default to no because most queries don't match the empty sequence.

Overrides:

matchesEmptySequence in class BLSpanQuery

Returns:

true if this query matches the empty sequence, false otherwise

noEmpty

public BLSpanQuery noEmpty()

Description copied from class: BLSpanQuery

Return a version of this clause that cannot match the empty sequence.

Returns:

a version that doesn't match the empty sequence

equals

public boolean equals(Object obj)

Specified by:

equals in class BLSpanQuery

createWeight

public BLSpanWeight createWeight(org.apache.lucene.search.IndexSearcher searcher,
                                 boolean needsScores)
                          throws IOException

Specified by:

createWeight in class BLSpanQuery

Throws:

IOException

toString

public String toString(String field)

Specified by:

toString in class BLSpanQuery

getRealField

public String getRealField()

Specified by:

getRealField in class BLSpanQuery

hashCode

public int hashCode()

Specified by:

hashCode in class BLSpanQuery

inverted

public BLSpanQuery inverted()

Description copied from class: BLSpanQuery

Return an inverted version of this query.

Overrides:

inverted in class BLSpanQuery

Returns:

the inverted query

okayToInvertForOptimization

protected boolean okayToInvertForOptimization()

Description copied from class: BLSpanQuery

Is it okay to invert this query for optimization? Heuristic used to determine when to optimize a query by inverting one or more of its subqueries.

Returns:

true if it is, false if not

hitsAllSameLength

public boolean hitsAllSameLength()

Description copied from class: BLSpanQuery

Do our hits have constant length?

Specified by:

hitsAllSameLength in class BLSpanQuery

Returns:

true if they do, false if not

hitsLengthMin

public int hitsLengthMin()

Description copied from class: BLSpanQuery

How long could our shortest hit be?

Specified by:

hitsLengthMin in class BLSpanQuery

Returns:

length of the shortest hit possible

hitsLengthMax

public int hitsLengthMax()

Description copied from class: BLSpanQuery

How long could our longest hit be?

Specified by:

hitsLengthMax in class BLSpanQuery

Returns:

length of the longest hit possible, or Integer.MAX_VALUE if unlimited

hitsEndPointSorted

public boolean hitsEndPointSorted()

Description copied from class: BLSpanQuery

When hit B follows hit A, is it guaranteed that B.end >= A.end? Also, if A.end == B.end, is B.start > A.start?

Specified by:

hitsEndPointSorted in class BLSpanQuery

Returns:

true if this is guaranteed, false if not

hitsStartPointSorted

public boolean hitsStartPointSorted()

Description copied from class: BLSpanQuery

When hit B follows hit A, is it guaranteed that B.start >= A.start? Also, if A.start == B.start, is B.end > A.end?

Specified by:

hitsStartPointSorted in class BLSpanQuery

Returns:

true if this is guaranteed, false if not

hitsHaveUniqueStart

public boolean hitsHaveUniqueStart()

Description copied from class: BLSpanQuery

Is it guaranteed that no two hits have the same start position?

Specified by:

hitsHaveUniqueStart in class BLSpanQuery

Returns:

true if this is guaranteed, false if not

hitsHaveUniqueEnd

public boolean hitsHaveUniqueEnd()

Description copied from class: BLSpanQuery

Is it guaranteed that no two hits have the same end position?

Specified by:

hitsHaveUniqueEnd in class BLSpanQuery

Returns:

true if this is guaranteed, false if not

hitsAreUnique

public boolean hitsAreUnique()

Description copied from class: BLSpanQuery

Is it guaranteed that no two hits have the same start and end position?

Specified by:

hitsAreUnique in class BLSpanQuery

Returns:

true if this is guaranteed, false if not

getNfa

public Nfa getNfa(ForwardIndexAccessor fiAccessor,
                  int direction)

Overrides:

getNfa in class BLSpanQuery

canMakeNfa

public boolean canMakeNfa()

Overrides:

canMakeNfa in class BLSpanQuery

reverseMatchingCost

public long reverseMatchingCost(org.apache.lucene.index.IndexReader reader)

Description copied from class: BLSpanQuery

Return an (very rough) indication of how many hits this clause might return. Used to decide what parts of the query to match using the forward index. Based on term frequency, which are combined using simple rules of thumb. Another way to think of this is an indication of how much computation this clause will require when matching using the reverse index.

Specified by:

reverseMatchingCost in class BLSpanQuery

Parameters:

reader - the index reader

Returns:

rough estimation of the number of hits

forwardMatchingCost

public int forwardMatchingCost()

Description copied from class: BLSpanQuery

Return an (very rough) indication of how expensive finding a match for this query using an NFA would be. Used to decide what parts of the query to match using the forward index.

Specified by:

forwardMatchingCost in class BLSpanQuery

Returns:

rough estimation of the NFA complexity

addRep

public BLSpanQuery addRep(int addMin,
                          int addMax)

rewrite

public BLSpanQuery rewrite(org.apache.lucene.index.IndexReader reader)
                    throws IOException

Specified by:

rewrite in class BLSpanQuery

Throws:

IOException