public override long NextLong()
{
if (!HasNext())
{
throw new IndexOutOfRangeException("No more facets in this iteration");
}
LongIteratorNode node = _queue.Top();
_facet = node.CurFacet;
long next = TermLongList.VALUE_MISSING;
count = 0;
while (HasNext())
{
node = _queue.Top();
next = node.CurFacet;
if ((next != TermLongList.VALUE_MISSING) && (next != _facet))
{
return(_facet);
}
count += node.CurFacetCount;
if (node.Fetch(1))
{
_queue.UpdateTop();
}
else
{
_queue.Pop();
}
}
return(TermLongList.VALUE_MISSING);
}
/// <summary>
/// This version of the next() method applies the minHits from the _facet spec before returning the _facet and its hitcount
/// </summary>
/// <param name="minHits">the minHits from the _facet spec for CombinedFacetAccessible</param>
/// <returns>The next _facet that obeys the minHits </returns>
public override string Next(int minHits)
{
int qsize = _queue.Size();
if (qsize == 0)
{
_facet = TermLongList.VALUE_MISSING;
count = 0;
return(null);
}
LongIteratorNode node = _queue.Top();
_facet = node.CurFacet;
count = node.CurFacetCount;
while (true)
{
if (node.Fetch(minHits))
{
node = _queue.UpdateTop();
}
else
{
_queue.Pop();
if (--qsize > 0)
{
node = _queue.Top();
}
else
{
// we reached the end. check if this _facet obeys the minHits
if (count < minHits)
{
_facet = TermLongList.VALUE_MISSING;
count = 0;
return(null);
}
break;
}
}
long next = node.CurFacet;
if (next != _facet)
{
// check if this _facet obeys the minHits
if (count >= minHits)
{
break;
}
// else, continue iterating to the next _facet
_facet = next;
count = node.CurFacetCount;
}
else
{
count += node.CurFacetCount;
}
}
return(Format(_facet));
}
public CombinedLongFacetIterator(List <LongFacetIterator> iterators, int minHits)
: this(iterators.Count)
{
_iterators = iterators;
foreach (LongFacetIterator iterator in iterators)
{
LongIteratorNode node = new LongIteratorNode(iterator);
if (node.Fetch(minHits))
{
_queue.Add(node);
}
}
_facet = TermLongList.VALUE_MISSING;
count = 0;
}
public CombinedLongFacetIterator(List<LongFacetIterator> iterators, int minHits)
: this(iterators.Count)
{
_iterators = iterators;
foreach (LongFacetIterator iterator in iterators)
{
LongIteratorNode node = new LongIteratorNode(iterator);
if (node.Fetch(minHits))
_queue.Add(node);
}
_facet = TermLongList.VALUE_MISSING;
count = 0;
}