List of nextDocument() Examples

Examples of nextDocument()

com.google.enterprise.connector.otex.LivelinkDocumentList.nextDocument()
{@inheritDoc}
com.google.enterprise.connector.sharepoint.spiimpl.SPDocumentList.nextDocument()
The processing that are done when the document is actually sent to CM. Site Alias mapping defined during connector configuration are used at this point only.
- Updates the index position of the document in the document list maintained here
- Sets the current document as the last document sent from its parent list represented by the ListState.
- Applies alias mapping rules for ADD action only. For DELETE action no alias mapping is done as the docId never contains the aliased URL
- Does not remove the document from the crawl queue of the list
com.google.enterprise.connector.spi.DocumentList.nextDocument()
Returns the next {@link Document} in this document list, if there is one. @return the new current document if there is one; {@code null}otherwise @throws RepositoryException if a repository access error occursThe Connector Manager will stop processing the {@code DocumentList}, call {@link #checkpoint()}, and wait a short period of time before resuming traversal. @throws RepositoryDocumentException if this specific documenthas unrecoverable errors. This document will be skipped, and {@code nextDocument()} or {@link #checkpoint()}may be subsequently called.
it.unimi.dsi.mg4j.document.DocumentIterator.nextDocument()
Returns the next document. @return the next document, or null if there are no other documents.
it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()
it.unimi.dsi.mg4j.index.MultiTermIndexIterator.nextDocument()
it.unimi.dsi.mg4j.search.DocumentIterator.nextDocument()
Returns the next document provided by this document iterator, or -1 if no more documents are available.
Warning: the specification of this method has significantly changed as of MG4J 1.2. The special return value -1 is used to mark the end of iteration (a {@link NoSuchElementException}would have been thrown before in that case, so ho harm should be caused by this change). The reason for this change is providing fully lazy iteration over documents. Fully lazy iteration does not provide an hasNext() method—you have to actually ask for the next element and check the return value. Fully lazy iteration is much lighter on method calls (half) and in most (if not all) MG4J classes leads to a much simpler logic. Moreover, {@link #nextDocument()}can be specified as throwing an {@link IOException}, which avoids the pernicious proliferation of try/catch blocks in very short, low-level methods (it was having a detectable impact on performance). @return the next document, or -1 if no more documents are available.
it.unimi.dsi.mg4j.search.NotDocumentIterator.nextDocument()
it.unimi.dsi.mg4j.search.OrDocumentIterator.nextDocument()
org.infinispan.schematic.document.DocumentSequence.nextDocument()
Get the next document. @return the next document, or null if there are no more @throws ParsingException if there was a problem reading from the stream
org.sindice.siren.index.codecs.siren10.DocsFreqBlockIndexInput.DocsFreqBlockReader.nextDocument()
Decode and return the next document identifier of the current block.
org.sindice.siren.index.codecs.siren10.Siren10PostingsReader.Siren10DocsNodesAndPositionsEnum.nextDocument()
Decode and return the next document identifier of the current block.
org.terrier.indexing.TRECFullTokenizer.nextDocument()
Proceed to the next document.

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

        Assert.assertEquals(firstIterator.frequency(), secondIterator.frequency());                
        
        /** Compare positions & count*/      
        while(firstIterator.hasNext()){
          int fr = firstIterator.nextDocument();
          int sr = secondIterator.nextDocument();    
          Assert.assertEquals(fr,sr);                
          /** Compare count*/
          Assert.assertEquals(firstIterator.count(), secondIterator.count());

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

                System.err.println( "Error in frequency for term " + t + ": expected " + f + " documents, found " + indexFrequency );
                return;
              }


              while ( indexFrequency-- != 0 ) {
                p = indexIterator.nextDocument();
                if (index[i].hasCounts) count[i][p] += indexIterator.count();
                if (index[i].hasPositions) indexIterator.positionArray(); // Just to force reading in high-performance indices
              }
              if ( indexIterator.nextDocument() != -1 ) throw new AssertionError( "nextDocument() is not -1 after exhaustive iteration" );
            }

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

              while ( indexFrequency-- != 0 ) {
                p = indexIterator.nextDocument();
                if (index[i].hasCounts) count[i][p] += indexIterator.count();
                if (index[i].hasPositions) indexIterator.positionArray(); // Just to force reading in high-performance indices
              }
              if ( indexIterator.nextDocument() != -1 ) throw new AssertionError( "nextDocument() is not -1 after exhaustive iteration" );
            }
            
            // Check document sizes
            if ( ! isVirtual && ( (BitStreamIndex) index[ i ] ).sizes != null && index[ i ].hasCounts )
              for ( p = 0; p < index[ i ].numberOfDocuments; p++ )

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

                return;
              }
              
              int prevp = -1;
              while (indexFrequency-- != 0) {
                p = indexIterator.nextDocument();
                if ( prevp >= p ) throw new AssertionError( "previous pointer: " + prevp + "; current pointer: " + p );
                prevp = p;
                if (index[i].hasCounts) count[i][p] += indexIterator.count();
              }
            }

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

          for (t = 0; t < numberOfTerms[ i ]; t++) {
            l.clear();
            positions.clear();
            IndexIterator documents = termLists ? indexReader[ i ].documents( terms[ i ].get( t ) ) : indexReader[ i ].documents( t );
            int d;
            while( ( d = documents.nextDocument() ) != -1 ) {
              l.add( d );
              if ( index[ i ].hasPositions ) positions.add( ArrayUtils.subarray( documents.positionArray(), 0, documents.count() ) );
            }
            
            for( start = 0; start < l.size(); start++ ) {

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

      indexIterator = indexReader.nextIterator();
      usedIndices = 0;
      frequency = indexIterator.frequency();
      
      for ( int j = 0; j < frequency; j++ ) {
        globalPointer = indexIterator.nextDocument();                
        localIndex = strategy.localIndex( globalPointer );  


        if ( localFrequency[ localIndex ] == 0 ) {
          // First time we see a document for this index.
          currentTerm.println( localTerms[ localIndex ] );

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

        i0 = reader0.documents( i );
        i1 = reader1.documents( i );
      }


      while ( i0.hasNext() && i1.hasNext() ) {
        assertEquals( "term " + i, document = i0.nextDocument(), i1.nextDocument() );
        if ( hasCounts ) {
          assertEquals( "term " + i + ", document " + document, i0.count(), i1.count() );
          if ( i0.count() > p0.length ) p0 = new int[ i0.count() ];
          if ( i1.count() > p1.length ) p1 = new int[ i1.count() ];
          if ( hasPositions ) for ( int p = i0.count(); p-- != 0; )

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

          String msg = index[ i ] + ":" + term;
          IndexIterator indexIterator = indexReader.documents( term );
          ObjectArrayList<int[]> list = termMap[ i ].get( term );
          int k = 0;
          while ( indexIterator.hasNext() ) {
            assertEquals( msg, list.get( k )[ 0 ], indexIterator.nextDocument() ); // Document
                                                // pointer
            if ( index[ i ].hasCounts ) assertEquals( msg, list.get( k ).length - 1, indexIterator.count() ); // Count
            if ( index[ i ].hasPositions ) {
              final int[] position = indexIterator.positionArray();
              for ( int p = 0; p < indexIterator.count(); p++ )

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.IndexIterator.nextDocument()

        assertEquals( index[ i ].toString(), -1, index[ i ].numberOfOccurrences );
        if ( documentIndex != 0 ) {
          IndexIterator indexIterator = index[ i ].documents( 0 );
          int k = 0;
          while ( indexIterator.hasNext() ) {
            assertEquals( payloadPointers[ i ].getInt( k ), indexIterator.nextDocument() );
            if ( factory.fieldType( field[ i ] ) == FieldType.INT ) assertEquals( ( (Number)payloadContent[ i ].get( k ) ).longValue(), ( (Number)indexIterator.payload().get() )
                .longValue() );
            else assertEquals( payloadContent[ i ].get( k ), indexIterator.payload().get() );
            k++;
          }

View Full Code Here

Examples of it.unimi.dsi.mg4j.index.MultiTermIndexIterator.nextDocument()

    assertEquals( 3, multiTermIndexIterator.frequency() );
    
    assertTrue( multiTermIndexIterator.hasNext() );
    assertTrue( multiTermIndexIterator.hasNext() ); // To increase coverage
    
    assertEquals( 0, multiTermIndexIterator.nextDocument() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() ); // To increase coverage
    assertEquals( Interval.valueOf( 0 ), multiTermIndexIterator.intervalIterator().nextInterval() );
    assertEquals( Interval.valueOf( 1 ), multiTermIndexIterator.intervalIterator().nextInterval() );
    assertTrue( multiTermIndexIterator.intervalIterator().hasNext() );

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.