internal Hits(Searcher s, Query q, Filter f, Sort o)
{
query = q;
searcher = s;
filter = f;
sort = o;
GetMoreDocs(50); // retrieve 100 initially
}
static Sort()
{
INDEXORDER = new Sort(SortField.FIELD_DOC);
}
// inherit javadoc
public override TopFieldDocs Search(Query query, Filter filter, int nDocs, Sort sort)
{
Scorer scorer = query.Weight(this).Scorer(reader);
if (scorer == null)
return new TopFieldDocs(0, new ScoreDoc[0], sort.fields);
System.Collections.BitArray bits = filter != null ? filter.Bits(reader) : null;
FieldSortedHitQueue hq = new FieldSortedHitQueue(reader, sort.fields, nDocs);
int[] totalHits = new int[1];
scorer.Score(new AnonymousClassHitCollector1(bits, totalHits, hq, this));
ScoreDoc[] scoreDocs = new ScoreDoc[hq.Size()];
for (int i = hq.Size() - 1; i >= 0; i--)
// put docs in array
scoreDocs[i] = hq.FillFields((FieldDoc) hq.Pop());
return new TopFieldDocs(totalHits[0], scoreDocs, hq.GetFields());
}
public override TopFieldDocs Search(Query query, Filter filter, int n, Sort sort)
{
FieldDocSortedHitQueue hq = null;
int totalHits = 0;
for (int i = 0; i < searchables.Length; i++)
{
// search each searcher
TopFieldDocs docs = searchables[i].Search(query, filter, n, sort);
if (hq == null)
hq = new FieldDocSortedHitQueue(docs.fields, n);
totalHits += docs.totalHits; // update totalHits
ScoreDoc[] scoreDocs = docs.scoreDocs;
for (int j = 0; j < scoreDocs.Length; j++)
{
// merge scoreDocs into hq
ScoreDoc scoreDoc = scoreDocs[j];
scoreDoc.doc += starts[i]; // convert doc
if (!hq.Insert(scoreDoc))
break; // no more scores > minScore
}
}
ScoreDoc[] scoreDocs2 = new ScoreDoc[hq.Size()];
for (int i = hq.Size() - 1; i >= 0; i--)
// put docs in array
scoreDocs2[i] = (ScoreDoc) hq.Pop();
return new TopFieldDocs(totalHits, scoreDocs2, hq.GetFields());
}
/// <summary>Returns documents matching <code>query</code> and <code>filter</code>,
/// sorted by <code>sort</code>.
/// </summary>
public virtual Hits Search(Query query, Filter filter, Sort sort)
{
return new Hits(this, query, filter, sort);
}
/// <summary>Returns documents matching <code>query</code> sorted by
/// <code>sort</code>.
/// </summary>
public virtual Hits Search(Query query, Sort sort)
{
return new Hits(this, query, null, sort);
}
public MultiSearcherThread(Monodoc.Lucene.Net.Search.Searchable searchable, Query query, Filter filter, int nDocs, FieldDocSortedHitQueue hq, Sort sort, int i, int[] starts, System.String name):base(name)
{
this.searchable = searchable;
this.query = query;
this.filter = filter;
this.nDocs = nDocs;
this.hq = hq;
this.i = i;
this.starts = starts;
this.sort = sort;
}
/// <summary> A search implementation allowing sorting which spans a new thread for each
/// Searchable, waits for each search to complete and merges
/// the results back together.
/// </summary>
public override TopFieldDocs Search(Query query, Filter filter, int nDocs, Sort sort)
{
// don't specify the fields - we'll wait to do this until we get results
FieldDocSortedHitQueue hq = new FieldDocSortedHitQueue(null, nDocs);
int totalHits = 0;
MultiSearcherThread[] msta = new MultiSearcherThread[searchables.Length];
for (int i = 0; i < searchables.Length; i++)
{
// search each searcher
// Assume not too many searchables and cost of creating a thread is by far inferior to a search
msta[i] = new MultiSearcherThread(searchables[i], query, filter, nDocs, hq, sort, i, starts, "MultiSearcher thread #" + (i + 1));
msta[i].Start();
}
for (int i = 0; i < searchables.Length; i++)
{
try
{
msta[i].Join();
}
catch (System.Threading.ThreadInterruptedException ie)
{
; // TODO: what should we do with this???
}
System.IO.IOException ioe = msta[i].GetIOException();
if (ioe == null)
{
totalHits += msta[i].Hits();
}
else
{
// if one search produced an IOException, rethrow it
throw ioe;
}
}
ScoreDoc[] scoreDocs = new ScoreDoc[hq.Size()];
for (int i = hq.Size() - 1; i >= 0; i--)
// put docs in array
scoreDocs[i] = (ScoreDoc) hq.Pop();
return new TopFieldDocs(totalHits, scoreDocs, hq.GetFields());
}
public virtual TopFieldDocs Search(Query query, Filter filter, int n, Sort sort)
{
return local.Search(query, filter, n, sort);
}