/** Creates a new AND interval iterator. * * @param index the index of the iterator. * @param n the number of component iterators. */ protected AndIndexIntervalIterator( final Index index, final int n ) { super( n ); // We just set up some internal data, but we perform no initialisation. this.index = index; queue = new IntHeapSemiIndirectPriorityQueue( curr ); }
public MultiTermIntervalIterator() { super( n ); positionQueue = new IntHeapSemiIndirectPriorityQueue( curr ); cache = new int[ 4 ]; }
public MultiTermIntervalIterator() { super( n ); positionQueue = new IntHeapSemiIndirectPriorityQueue( curr ); cache = new int[ 4 ]; }
/** Creates a new AND interval iterator. * * @param index the index of the iterator. */ public AndIndexIntervalIterator( final Index index ) { super( n ); // We just set up some internal data, but we perform no initialisation. this.index = index; queue = new IntHeapSemiIndirectPriorityQueue( curr ); }
/** Creates a new AND interval iterator. * * @param index the index of the iterator. * @param n the number of component iterators. */ protected AndIndexIntervalIterator( final Index index, final int n ) { super( n ); // We just set up some internal data, but we perform no initialisation. this.index = index; queue = new IntHeapSemiIndirectPriorityQueue( curr ); }
public OrIndexIntervalIterator( final Index index ) { super( n ); this.index = index; positionQueue = new IntHeapSemiIndirectPriorityQueue( curr ); positionFront = new int[ n ]; }
/** Creates a new AND interval iterator. * * @param index the index of the iterator. */ public AndIndexIntervalIterator( final Index index ) { super( n ); // We just set up some internal data, but we perform no initialisation. this.index = index; queue = new IntHeapSemiIndirectPriorityQueue( curr ); }
public OrIndexIntervalIterator( final Index index ) { super( n ); this.index = index; positionQueue = new IntHeapSemiIndirectPriorityQueue( curr ); positionFront = new int[ n ]; }
documentQueue = new IntHeapSemiIndirectPriorityQueue( doc, numIndices );
documentQueue = new IntHeapSemiIndirectPriorityQueue( doc, numIndices );
this.inputStreamLength = new int[batches.size()]; Arrays.fill(this.prevTarget, -1); queue = new IntHeapSemiIndirectPriorityQueue(this.refArray); this.prevTarget = prevTarget; this.inputStreamLength = inputStreamLength; queue = new IntHeapSemiIndirectPriorityQueue(refArray);
queue = new IntHeapSemiIndirectPriorityQueue( globalDocumentPointer, n );
queue = new IntHeapSemiIndirectPriorityQueue( globalDocumentPointer, n );
/** Creates a new document iterator that computes the OR of the given array of iterators. * @param documentIterator the iterators to be joined. * @throws IOException */ protected AbstractUnionDocumentIterator( final DocumentIterator... documentIterator ) throws IOException { super( documentIterator ); this.refArray = new int[ n ]; queue = new IntHeapSemiIndirectPriorityQueue( refArray ); intervalIterators = new Reference2ReferenceArrayMap<Index,IntervalIterator>( indices.size() ); currentIterators = new Reference2ReferenceArrayMap<Index,IntervalIterator>( indices.size() ); unmodifiableCurrentIterators = Reference2ReferenceMaps.unmodifiable( currentIterators ); // Only add to the queue nonempty iterators... for ( int i = 0; i < n; i++ ) if ( ( refArray[ i ] = documentIterator[ i ].nextDocument() ) != -1 ) queue.enqueue( i ); // If queue is empty, the process is over if ( queue.isEmpty() ) curr = END_OF_LIST; else { curr = refArray[ queue.first() ]; ahead = true; } front = new int[ queue.size() ]; }