/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
using System;
using Lucene.Net.Documents;
using Document = Lucene.Net.Documents.Document;
using CorruptIndexException = Lucene.Net.Index.CorruptIndexException;
using Term = Lucene.Net.Index.Term;
namespace Lucene.Net.Search
{
/// An abstract base class for search implementations. Implements the main search
/// methods.
///
///
/// Note that you can only access hits from a Searcher as long as it is not yet
/// closed, otherwise an IOException will be thrown.
///
public abstract class Searcher : System.MarshalByRefObject, Searchable, System.IDisposable
{
protected Searcher()
{
InitBlock();
}
private void InitBlock()
{
similarity = Net.Search.Similarity.Default;
}
/// Search implementation with arbitrary sorting. Finds
/// the top n hits for query, applying
/// filter if non-null, and sorting the hits by the criteria in
/// sort.
///
/// NOTE: this does not compute scores by default; use
/// to enable scoring.
///
///
/// BooleanQuery.TooManyClauses
public virtual TopFieldDocs Search(Query query, Filter filter, int n, Sort sort)
{
return Search(CreateWeight(query), filter, n, sort);
}
/// Lower-level search API.
///
/// is called for every matching document.
///
/// Applications should only use this if they need all of the matching
/// documents. The high-level search API (
/// ) is usually more efficient, as it skips non-high-scoring hits.
/// Note: The score passed to this method is a raw score.
/// In other words, the score will not necessarily be a float whose value is
/// between 0 and 1.
///
/// BooleanQuery.TooManyClauses
public virtual void Search(Query query, Collector results)
{
Search(CreateWeight(query), null, results);
}
/// Lower-level search API.
///
/// is called for every matching
/// document.
///
Collector-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 ()
/// is usually more efficient, as it skips
/// non-high-scoring hits.
///
///
/// to match documents
///
/// if non-null, used to permit documents to be collected.
///
/// to receive hits
///
/// BooleanQuery.TooManyClauses
public virtual void Search(Query query, Filter filter, Collector results)
{
Search(CreateWeight(query), filter, results);
}
/// Finds the top n
/// hits for query, applying filter if non-null.
///
///
/// BooleanQuery.TooManyClauses
public virtual TopDocs Search(Query query, Filter filter, int n)
{
return Search(CreateWeight(query), filter, n);
}
/// Finds the top n
/// hits for query.
///
///
/// BooleanQuery.TooManyClauses
public virtual TopDocs Search(Query query, int n)
{
return Search(query, null, n);
}
/// Returns an Explanation that describes how doc scored against
/// query.
///
/// 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.
///
public virtual Explanation Explain(Query query, int doc)
{
return Explain(CreateWeight(query), doc);
}
/// The Similarity implementation used by this searcher.
private Similarity similarity;
/// Expert: Gets or Sets the Similarity implementation used by this Searcher.
///
///
///
///
public virtual Similarity Similarity
{
get { return this.similarity; }
set { this.similarity = value; }
}
/// creates a weight for query
/// new weight
///
public /*protected internal*/ virtual Weight CreateWeight(Query query)
{
return query.Weight(this);
}
// inherit javadoc
public virtual int[] DocFreqs(Term[] terms)
{
int[] result = new int[terms.Length];
for (int i = 0; i < terms.Length; i++)
{
result[i] = DocFreq(terms[i]);
}
return result;
}
public abstract void Search(Weight weight, Filter filter, Collector results);
[Obsolete("Use Dispose() instead")]
public void Close()
{
Dispose();
}
public void Dispose()
{
Dispose(true);
}
protected abstract void Dispose(bool disposing);
public abstract int DocFreq(Term term);
public abstract int MaxDoc { get; }
public abstract TopDocs Search(Weight weight, Filter filter, int n);
public abstract Document Doc(int i);
public abstract Document Doc(int docid, FieldSelector fieldSelector);
public abstract Query Rewrite(Query query);
public abstract Explanation Explain(Weight weight, int doc);
public abstract TopFieldDocs Search(Weight weight, Filter filter, int n, Sort sort);
/* End patch for GCJ bug #15411. */
}
}