prevOffset = index.writtenBits();
}
totPostings += postings;
final Properties properties = new Properties();
properties.setProperty( Index.PropertyKeys.DOCUMENTS, documentCount );
properties.setProperty( Index.PropertyKeys.TERMS, numTerms );
properties.setProperty( Index.PropertyKeys.POSTINGS, postings );
properties.setProperty( Index.PropertyKeys.MAXCOUNT, maxCount );
properties.setProperty( Index.PropertyKeys.INDEXCLASS, FileIndex.class.getName() );
properties.addProperty( Index.PropertyKeys.CODING, "FREQUENCIES:GAMMA" );
properties.addProperty( Index.PropertyKeys.CODING, "POINTERS:DELTA" );
if ( completeness.compareTo( Completeness.COUNTS ) >= 0 ) properties.addProperty( Index.PropertyKeys.CODING, "COUNTS:GAMMA" );
if ( completeness.compareTo( Completeness.POSITIONS ) >= 0 ) properties.addProperty( Index.PropertyKeys.CODING, "POSITIONS:DELTA" );
properties.setProperty( Index.PropertyKeys.TERMPROCESSOR, ObjectParser.toSpec( termProcessor ) );
properties.setProperty( Index.PropertyKeys.OCCURRENCES, numOccurrences );
properties.setProperty( Index.PropertyKeys.MAXDOCSIZE, maxDocSize );
properties.setProperty( Index.PropertyKeys.SIZE, index.writtenBits() );
if ( field != null ) properties.setProperty( Index.PropertyKeys.FIELD, field );
properties.save( batchBasename + DiskBasedIndex.PROPERTIES_EXTENSION );
index.close();
offsets.close();
posNumBits.close();
}
else {
final IndexWriter indexWriter = new BitStreamIndexWriter( batchBasename, maxDocInBatch + 1, true, flags );
ByteArrayPostingList bapl;
OutputBitStream obs;
int maxCount = -1, maxFrequency = 0, frequency;
// Compute max frequency and allocate position array.
for ( ByteArrayPostingList b : termMap.values() ) {
b.close();
b.align();
if ( maxFrequency < b.frequency ) maxFrequency = b.frequency;
if ( maxCount < b.maxCount ) maxCount = b.maxCount;
}
final long[] bitPos = new long[ maxFrequency ];
final int[] pointer = new int[ maxFrequency ];
int[] pos = new int[ maxCount ];
final boolean hasCounts = completeness.compareTo( Completeness.COUNTS ) >= 0;
final boolean hasPositions = completeness.compareTo( Completeness.POSITIONS ) >= 0;
int count = -1, moreCount = -1;
for ( int i = 0; i < numTerms; i++ ) {
bapl = termMap.get( termArray[ i ] );
final InputBitStream ibs = new InputBitStream( bapl.buffer );
frequency = bapl.frequency; // This could be much more than the actual frequency in virtual indices
// Calculate posting bit positions and corresponding pointers
for ( int j = 0; j < frequency; j++ ) {
bitPos[ j ] = ibs.readBits(); // Cache bit poisition
pointer[ j ] = ibs.readDelta(); // Cache pointer
if ( hasCounts ) count = ibs.readGamma() + 1;
if ( hasPositions ) ibs.skipDeltas( count ); // Skip document positions
}
// Sort stably pointers and positions by increasing pointer
it.unimi.dsi.fastutil.Arrays.quickSort( 0, frequency, new AbstractIntComparator() {
public int compare( final int i0, final int i1 ) {
final int t = pointer[ i0 ] - pointer[ i1 ];
if ( t != 0 ) return t;
final long u = bitPos[ i0 ] - bitPos[ i1 ]; // We need a stable sort
return u < 0 ? -1 : u > 0 ? 1 : 0;
}
},
new Swapper() {
public void swap( final int i0, final int i1 ) {
final long t = bitPos[ i0 ]; bitPos[ i0 ] = bitPos[ i1 ]; bitPos[ i1 ] = t;
final int p = pointer[ i0 ]; pointer[ i0 ] = pointer[ i1 ]; pointer[ i1 ] = p;
}
} );
int actualFrequency = frequency;
// Compute actual frequency for virtual indices
if ( indexingIsVirtual ) {
actualFrequency = 1;
for ( int j = 1; j < frequency; j++ ) if ( pointer[ j ] != pointer[ j - 1 ] ) actualFrequency++;
if ( ASSERTS ) {
for ( int j = 1; j < frequency; j++ ) {
assert pointer[ j ] >= pointer[ j - 1 ];
assert pointer[ j ] != pointer[ j - 1 ] || bitPos[ j ] > bitPos[ j - 1 ];
}
}
}
indexWriter.newInvertedList();
indexWriter.writeFrequency( actualFrequency );
int currPointer;
for ( int j = 0; j < frequency; j++ ) {
ibs.position( bitPos[ j ] );
obs = indexWriter.newDocumentRecord();
indexWriter.writeDocumentPointer( obs, currPointer = ibs.readDelta() );
if ( ASSERTS ) assert currPointer == pointer[ j ];
if ( hasCounts ) count = ibs.readGamma() + 1;
if ( hasPositions ) {
ibs.readDeltas( pos, count );
for ( int p = 1; p < count; p++ ) pos[ p ] += pos[ p - 1 ] + 1;
}
if ( indexingIsVirtual ) {
while( j < frequency - 1 ) {
ibs.position( bitPos[ j + 1 ] );
if ( currPointer != ibs.readDelta() ) break;
j++;
if ( hasCounts ) moreCount = ibs.readGamma() + 1;
if ( hasPositions ) {
pos = IntArrays.grow( pos, count + moreCount, count );
pos[ count ] = ibs.readDelta();
if ( ASSERTS ) assert pos[ count ] > pos[ count - 1 ];
for ( int p = 1; p < moreCount; p++ ) pos[ count + p ] = pos[ count + p - 1 ] + 1 + ibs.readDelta();
}
count += moreCount;
}
if ( maxCount < count ) maxCount = count;
}
if ( hasCounts ) indexWriter.writePositionCount( obs, count );
if ( hasPositions ) indexWriter.writeDocumentPositions( obs, pos, 0, count, -1 );
}
frequencies.writeGamma( actualFrequency );
globCounts.writeLongGamma( bapl.globCount );
}
indexWriter.close();
final Properties properties = indexWriter.properties();
totPostings += properties.getLong( "postings" );
properties.setProperty( Index.PropertyKeys.TERMPROCESSOR, ObjectParser.toSpec( termProcessor ) );
properties.setProperty( Index.PropertyKeys.OCCURRENCES, numOccurrences );
properties.setProperty( Index.PropertyKeys.MAXDOCSIZE, maxDocSize );
properties.setProperty( Index.PropertyKeys.SIZE, indexWriter.writtenBits() );
if ( field != null ) properties.setProperty( Index.PropertyKeys.FIELD, field );
properties.save( batchBasename + DiskBasedIndex.PROPERTIES_EXTENSION );
if ( indexingIsRemapped ) {
// We must permute sizes
final int[] document = new int[ documentCount ], size = new int[ documentCount ];
final InputBitStream sizes = new InputBitStream( batchBasename + DiskBasedIndex.SIZES_EXTENSION );