/// <summary> Adds a Scorer to the ScorerDocQueue in log(size) time if either
/// the ScorerDocQueue is not full, or not lessThan(scorer, top()).
/// </summary>
/// <param name="scorer">
/// </param>
/// <returns> true if scorer is added, false otherwise.
/// </returns>
public virtual bool Insert(Scorer scorer)
{
if (size < maxSize)
{
Put(scorer);
return(true);
}
else
{
int docNr = scorer.DocID();
if ((size > 0) && (!(docNr < topHSD.doc)))
{
// heap[1] is top()
heap[1] = new HeapedScorerDoc(this, scorer, docNr);
DownHeap();
return(true);
}
else
{
return(false);
}
}
}
public override int NextDoc()
{
int scorerDoc, disiDoc;
return(doc = (disiDoc = docIdSetIterator.NextDoc()) != NO_MORE_DOCS && (scorerDoc = scorer.NextDoc()) != NO_MORE_DOCS && AdvanceToCommon(scorerDoc, disiDoc) != NO_MORE_DOCS?scorer.DocID() : NO_MORE_DOCS);
}
internal virtual void Adjust()
{
doc = scorer.DocID();
}
internal HeapedScorerDoc(ScorerDocQueue enclosingInstance, Scorer s) : this(enclosingInstance, s, s.DocID())
{
}
internal HeapedScorerDoc(ScorerDocQueue enclosingInstance, Scorer s):this(enclosingInstance, s, s.DocID())
{
}
/// <summary> Adds a Scorer to the ScorerDocQueue in log(size) time if either
/// the ScorerDocQueue is not full, or not lessThan(scorer, top()).
/// </summary>
/// <param name="scorer">
/// </param>
/// <returns> true if scorer is added, false otherwise.
/// </returns>
public virtual bool Insert(Scorer scorer)
{
if (size < maxSize)
{
Put(scorer);
return true;
}
else
{
int docNr = scorer.DocID();
if ((size > 0) && (!(docNr < topHSD.doc)))
{
// heap[1] is top()
heap[1] = new HeapedScorerDoc(this, scorer, docNr);
DownHeap();
return true;
}
else
{
return false;
}
}
}
public override int DocID()
{
return(subQueryScorer.DocID());
}
