public override bool Next()
{
if (moreInclude) // move to next include
{
moreInclude = includeSpans.Next();
}
while (moreInclude && moreExclude)
{
if (includeSpans.Doc > excludeSpans.Doc) // skip exclude
{
moreExclude = excludeSpans.SkipTo(includeSpans.Doc);
}
while (moreExclude && includeSpans.Doc == excludeSpans.Doc && excludeSpans.End <= includeSpans.Start - outerInstance.pre) // while exclude is before
{
moreExclude = excludeSpans.Next(); // increment exclude
}
if (!moreExclude || includeSpans.Doc != excludeSpans.Doc || includeSpans.End + outerInstance.post <= excludeSpans.Start) // if no intersection
{
break; // we found a match
}
moreInclude = includeSpans.Next(); // intersected: keep scanning
}
return(moreInclude);
}
public override bool Next()
{
if (!spans.Next())
{
return(false);
}
return(DoNext());
}
protected internal SpanScorer(Spans spans, Weight weight, Similarity.SimScorer docScorer)
: base(weight)
{
this.m_docScorer = docScorer;
this.m_spans = spans;
m_doc = -1;
m_more = spans.Next();
}
private bool InitSpanQueue(int target)
{
queue = new SpanQueue(outerInstance, outerInstance.clauses.Count);
foreach (var clause in outerInstance.clauses)
{
Spans spans = clause.GetSpans(context, acceptDocs, termContexts);
cost += spans.GetCost();
if (((target == -1) && spans.Next()) || ((target != -1) && spans.SkipTo(target)))
{
queue.Add(spans);
}
}
return(queue.Count != 0);
}
protected virtual bool SetFreqCurrentDoc()
{
if (!m_more)
{
return(false);
}
m_doc = m_spans.Doc;
m_freq = 0.0f;
m_numMatches = 0;
do
{
int matchLength = m_spans.End - m_spans.Start;
m_freq += m_docScorer.ComputeSlopFactor(matchLength);
m_numMatches++;
m_more = m_spans.Next();
} while (m_more && (m_doc == m_spans.Doc));
return(true);
}
/// <summary>
/// The <see cref="SubSpans"/> are ordered in the same doc, so there is a possible match.
/// Compute the slop while making the match as short as possible by advancing
/// all <see cref="SubSpans"/> except the last one in reverse order.
/// </summary>
private bool ShrinkToAfterShortestMatch()
{
matchStart = subSpans[subSpans.Length - 1].Start;
matchEnd = subSpans[subSpans.Length - 1].End;
var possibleMatchPayloads = new JCG.HashSet <byte[]>();
if (subSpans[subSpans.Length - 1].IsPayloadAvailable)
{
possibleMatchPayloads.UnionWith(subSpans[subSpans.Length - 1].GetPayload());
}
IList <byte[]> possiblePayload = null;
int matchSlop = 0;
int lastStart = matchStart;
int lastEnd = matchEnd;
for (int i = subSpans.Length - 2; i >= 0; i--)
{
Spans prevSpans = subSpans[i];
if (collectPayloads && prevSpans.IsPayloadAvailable)
{
possiblePayload = new List <byte[]>(prevSpans.GetPayload()); // LUCENENET specific - using copy constructor instead of AddRange()
}
int prevStart = prevSpans.Start;
int prevEnd = prevSpans.End;
while (true) // Advance prevSpans until after (lastStart, lastEnd)
{
if (!prevSpans.Next())
{
inSameDoc = false;
more = false;
break; // Check remaining subSpans for final match.
}
else if (matchDoc != prevSpans.Doc)
{
inSameDoc = false; // The last subSpans is not advanced here.
break; // Check remaining subSpans for last match in this document.
}
else
{
int ppStart = prevSpans.Start;
int ppEnd = prevSpans.End; // Cannot avoid invoking .end()
if (!DocSpansOrdered(ppStart, ppEnd, lastStart, lastEnd))
{
break; // Check remaining subSpans.
} // prevSpans still before (lastStart, lastEnd)
else
{
prevStart = ppStart;
prevEnd = ppEnd;
if (collectPayloads && prevSpans.IsPayloadAvailable)
{
possiblePayload = new List <byte[]>(prevSpans.GetPayload()); // LUCENENET specific - using copy constructor instead of AddRange()
}
}
}
}
if (collectPayloads && possiblePayload != null)
{
possibleMatchPayloads.UnionWith(possiblePayload);
}
if (Debugging.AssertsEnabled)
{
Debugging.Assert(prevStart <= matchStart);
}
if (matchStart > prevEnd) // Only non overlapping spans add to slop.
{
matchSlop += (matchStart - prevEnd);
}
/* Do not break on (matchSlop > allowedSlop) here to make sure
* that subSpans[0] is advanced after the match, if any.
*/
matchStart = prevStart;
lastStart = prevStart;
lastEnd = prevEnd;
}
bool match = matchSlop <= allowedSlop;
if (collectPayloads && match && possibleMatchPayloads.Count > 0)
{
matchPayload.AddRange(possibleMatchPayloads);
}
return(match); // ordered and allowed slop
}
public override bool Next()
{
return(Adjust(spans.Next()));
}