org.apache.lucene.search
public interface Searchable extends Remote
Searchable is the abstract network protocol for searching. Implementations provide search over a single index, over multiple indices, and over indices on remote servers.
Queries, filters and sort criteria are designed to be compact so that they may be efficiently passed to a remote index, with only the top-scoring hits being returned, rather than every non-zero scoring hit.
Method Summary | |
---|---|
void | close() Frees resources associated with this Searcher.
|
Document | doc(int i) Expert: Returns the stored fields of document i .
|
int | docFreq(Term term) Expert: Returns the number of documents containing term .
|
int[] | docFreqs(Term[] terms) Expert: For each term in the terms array, calculates the number of
documents containing term . |
Explanation | explain(Weight weight, int doc) Expert: low-level implementation method
Returns an Explanation that describes how doc scored against
weight .
|
Explanation | explain(Query query, int doc) |
int | maxDoc() Expert: Returns one greater than the largest possible document number.
|
Query | rewrite(Query query) Expert: called to re-write queries into primitive queries. |
void | search(Weight weight, Filter filter, HitCollector results) Lower-level search API.
|
void | search(Query query, Filter filter, HitCollector results) Expert: Low-level search implementation. |
TopDocs | search(Weight weight, Filter filter, int n) Expert: Low-level search implementation. |
TopDocs | search(Query query, Filter filter, int n) Expert: Low-level search implementation. |
TopFieldDocs | search(Weight weight, Filter filter, int n, Sort sort) Expert: Low-level search implementation with arbitrary sorting. |
TopFieldDocs | search(Query query, Filter filter, int n, Sort sort) Expert: Low-level search implementation. |
i
.
Called by {@link HitCollector} implementations.See Also: IndexReader
term
.
Called by search code to compute term weights.See Also: docFreq
term
. Returns an array with these
document frequencies. Used to minimize number of remote calls.doc
scored against
weight
.
This is intended to be used in developing Similarity implementations, and, for good performance, should not be displayed with every hit. Computing an explanation is as expensive as executing the query over the entire index.
Applications should call {@link Searcher#explain(Query, int)}.
Throws: BooleanQuery.TooManyClauses
Deprecated: use {@link Searcher#explain(Weight, int)} instead.
See Also: maxDoc
Throws: BooleanQuery.TooManyClauses
{@link HitCollector#collect(int,float)} is called for every non-zero
scoring document.
HitCollector-based access to remote indexes is discouraged.
Applications should only use this if they need all of the matching documents. The high-level search API ({@link Searcher#search(Query)}) is usually more efficient, as it skips non-high-scoring hits.
Parameters: weight to match documents filter if non-null, a bitset used to eliminate some documents results to receive hits
Throws: BooleanQuery.TooManyClauses
Deprecated: use {@link Searcher#search(Weight, Filter, HitCollector)} instead.
Expert: Low-level search implementation.n
hits for query
, applying filter
if non-null.
Called by {@link Hits}.
Applications should usually call {@link Searcher#search(Query)} or {@link Searcher#search(Query,Filter)} instead.
Throws: BooleanQuery.TooManyClauses
Deprecated: use {@link Searcher#search(Weight, Filter, int)} instead.
Expert: Low-level search implementation.n
hits for query
, applying
filter
if non-null, and sorting the hits by the criteria in
sort
.
Applications should usually call {@link Searcher#search(Query,Filter,Sort)} instead.
Throws: BooleanQuery.TooManyClauses
Deprecated: use {@link Searcher#search(Weight, Filter, int, Sort)} instead.
Expert: Low-level search implementation.