Package | Description |
---|---|
org.apache.lucene.search.payloads |
The payloads package provides Query mechanisms for finding and using payloads.
|
org.apache.lucene.search.spans |
The calculus of spans.
|
Modifier and Type | Method and Description |
---|---|
void |
PayloadNearQuery.PayloadNearSpanScorer.getPayloads(Spans[] subSpans) |
Constructor and Description |
---|
PayloadNearQuery.PayloadNearSpanScorer(Spans spans,
SpanWeight weight,
Similarity similarity,
Similarity.SimScorer docScorer) |
Modifier and Type | Class and Description |
---|---|
class |
FilterSpans
A
Spans implementation wrapping another spans instance,
allowing to filter spans matches easily by implementing FilterSpans.accept(org.apache.lucene.search.spans.Spans) |
class |
NearSpansOrdered
A Spans that is formed from the ordered subspans of a SpanNearQuery
where the subspans do not overlap and have a maximum slop between them,
and that does not need to collect payloads.
|
class |
NearSpansPayloadOrdered
A
NearSpansOrdered that allows collecting payloads. |
class |
NearSpansUnordered
Similar to
NearSpansOrdered , but for the unordered case. |
class |
TermSpans
Expert:
Public for extension only.
|
Modifier and Type | Field and Description |
---|---|
protected Spans |
FilterSpans.in
The wrapped spans instance.
|
protected Spans |
SpanScorer.spans
underlying spans we are scoring from
|
Modifier and Type | Method and Description |
---|---|
Spans |
SpanMultiTermQueryWrapper.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
abstract Spans |
SpanQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts)
Expert: Returns the matches for this query in an index.
|
Spans |
SpanPositionCheckQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Spans |
SpanTermQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Spans |
SpanOrQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Spans |
SpanContainingQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts)
Return spans from
big that contain at least one spans from little . |
Spans |
SpanNearQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Spans |
FieldMaskingSpanQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Spans |
SpanWithinQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts)
Return spans from
little that are contained in a spans from big . |
Spans |
SpanNotQuery.getSpans(LeafReaderContext context,
Bits acceptDocs,
Map<Term,TermContext> termContexts) |
Modifier and Type | Method and Description |
---|---|
protected abstract FilterSpans.AcceptStatus |
FilterSpans.accept(Spans candidate)
Returns YES if the candidate should be an accepted match,
NO if it should not, and NO_MORE_IN_CURRENT_DOC if iteration
should move on to the next document.
|
protected abstract FilterSpans.AcceptStatus |
SpanPositionCheckQuery.acceptPosition(Spans spans)
Implementing classes are required to return whether the current position is a match for the passed in
"match"
SpanQuery . |
protected FilterSpans.AcceptStatus |
SpanPositionRangeQuery.acceptPosition(Spans spans) |
protected FilterSpans.AcceptStatus |
SpanNearPayloadCheckQuery.acceptPosition(Spans spans) |
protected FilterSpans.AcceptStatus |
SpanPayloadCheckQuery.acceptPosition(Spans spans) |
protected FilterSpans.AcceptStatus |
SpanFirstQuery.acceptPosition(Spans spans) |
Constructor and Description |
---|
FilterSpans(Spans in)
Wrap the given
Spans . |
SpanScorer(Spans spans,
SpanWeight weight,
Similarity.SimScorer docScorer) |
Constructor and Description |
---|
NearSpansOrdered(SpanNearQuery query,
List<Spans> subSpans) |
NearSpansPayloadOrdered(SpanNearQuery query,
List<Spans> subSpans) |
NearSpansUnordered(SpanNearQuery query,
List<Spans> subSpans) |
Copyright © 2000-2015 Apache Software Foundation. All Rights Reserved.