Package it.unimi.dsi.fastutil.ints

Examples of it.unimi.dsi.fastutil.ints.IntIterator.nextInt()

97
98
99
100
101
102
103
104
105
106
107
    for( int i = 0; i < numIndices; i++ ) {
      final IntIterator sizes = sizes( i );
      int s = 0;
      int j = index[ i ].numberOfDocuments;
      while( j-- != 0 ) {
        maxDocSize = Math.max( maxDocSize, s = sizes.nextInt() );
        if ( needsSizes ) size[ currDoc++ ] = s;
        sizesOutputBitStream.writeGamma( s );
      }
      if ( sizes instanceof Closeable ) ((Closeable)sizes).close();
    }
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
      currDoc = 0;
      int j = index[ i ].numberOfDocuments;
      int s;
      while( j-- != 0 ) {
        if ( ( s = sizes.nextInt() ) != 0 ) {
          if ( size[ currDoc ] != 0 ) throw new IllegalArgumentException( "Document " + currDoc + " has nonzero length in two indices" );
          size[ currDoc ] = s;
          if ( s > maxDocSize ) maxDocSize = s;
        }
        currDoc++;
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
      size = new int[ numberOfDocuments ];
      for( int i = 0; i < numIndices; i++ ) {
        final IntIterator sizes = sizes( i );
        int j = index[ i ].numberOfDocuments;
        currDoc = 0;
        while( j-- != 0 ) maxDocSize = Math.max( maxDocSize, size[ currDoc++ ] += sizes.nextInt() );
        if ( sizes instanceof Closeable ) ((Closeable)sizes).close();
      }
      // We write the array.
      for( int s: size ) sizesOutputBitStream.writeGamma( s );
      // We keep it if we need sizes.
View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
      if ( needsSizes ) size = new int[ numberOfDocuments ];
      final IntIterator sizes = sizes( numIndices - 1 );
      int s = 0;
      // We copy the last file size, and store the elements in an array if needsSizes is true.
      for( int j = 0; j < numberOfDocuments; j++ ) {
        s = sizes.nextInt();
        if ( needsSizes ) size[ j ] = s;
        maxDocSize = Math.max( maxDocSize, s );
        sizesOutputBitStream.writeGamma( s );
      }
      if ( sizes instanceof Closeable ) ((Closeable)sizes).close();
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
          secondIterator.next();
 
          IntIterator firstIntIt = firstIterator.positions();
          IntIterator secondIntIt = secondIterator.positions();       
          while(firstIntIt.hasNext()){                 
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }       
          Assert.assertEquals(firstIntIt.skip(2),secondIntIt.skip(2));       
          if(firstIntIt.hasNext()){
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }       
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
          while(firstIntIt.hasNext()){                 
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }       
          Assert.assertEquals(firstIntIt.skip(2),secondIntIt.skip(2));       
          if(firstIntIt.hasNext()){
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }       
          Assert.assertEquals(firstIntIt.skip(9999999),secondIntIt.skip(9999999));       
          if(firstIntIt.hasNext()){       
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
          if(firstIntIt.hasNext()){
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }       
          Assert.assertEquals(firstIntIt.skip(9999999),secondIntIt.skip(9999999));       
          if(firstIntIt.hasNext()){       
            Assert.assertEquals(firstIntIt.nextInt(),secondIntIt.nextInt());
          }
         
        }
       
        /** Compare IntervalIterator from Interval() method */
 
View Full Code Here
310
311
312
313
314
315
316
317
318
319
320
              s0.retainAll( s1 );
              indexIterator =  termLists ? indexReader[ i ].documents( terms[ i ].get( t ) ) : indexReader[ i ].documents( t );
              additionalIterator = termLists ? additionalReader.documents( terms[ i ].get( u ) ) : additionalReader.documents( u );
              it = s0.iterator();
              documentIterator = AndDocumentIterator.getInstance( indexIterator, additionalIterator );
              for( int j = s0.size(); j-- != 0; ) if ( it.nextInt() != documentIterator.nextDocument() ) throw new AssertionError();
              if ( documentIterator.hasNext() ) throw new AssertionError();

              s2.clear();
              IntIterators.pour( termLists ? indexReader[ i ].documents( terms[ i ].get( t ) ) : indexReader[ i ].documents( t ), s2 );
              IntIterators.pour( termLists ? indexReader[ i ].documents( terms[ i ].get( u ) ) : indexReader[ i ].documents( u ), s2 );
View Full Code Here
322
323
324
325
326
327
328
329
330
331
332
              indexIterator =  termLists ? indexReader[ i ].documents( terms[ i ].get( t ) ) : indexReader[ i ].documents( t );
              additionalIterator = termLists ? additionalReader.documents( terms[ i ].get( u ) ) : additionalReader.documents( u );

              it = s2.iterator();
              documentIterator = OrDocumentIterator.getInstance( indexIterator, additionalIterator );
              for( int j = s2.size(); j-- != 0; ) if ( it.nextInt() != documentIterator.nextDocument() ) throw new AssertionError();
              if ( documentIterator.hasNext() ) throw new AssertionError();
            } 
            pl.update();
          }
          pl.done();
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
   
    assertEquals( Interval.valueOf( 3 ), multiTermIndexIterator.intervalIterator().nextInterval() );

    IntIterator positions = multiTermIndexIterator.positions();
    assertEquals( 0, positions.nextInt() );
    assertEquals( 1, positions.nextInt() );
    assertEquals( 2, positions.nextInt() );
    assertEquals( 3, positions.nextInt() );
    assertFalse( positions.hasNext() );
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.