Module me.lemire.integercompression
Class SkippableIntegratedComposition
java.lang.Object
me.lemire.integercompression.differential.SkippableIntegratedComposition
- All Implemented Interfaces:
SkippableIntegratedIntegerCODEC
public class SkippableIntegratedComposition
extends Object
implements SkippableIntegratedIntegerCODEC
Helper class to compose schemes.
- Author:
- Daniel Lemire
-
Constructor Summary
ConstructorsConstructorDescriptionSkippableIntegratedComposition(SkippableIntegratedIntegerCODEC f1, SkippableIntegratedIntegerCODEC f2) Compose a scheme from a first one (f1) and a second one (f2). -
Method Summary
Modifier and TypeMethodDescriptionvoidheadlessCompress(int[] in, IntWrapper inpos, int inlength, int[] out, IntWrapper outpos, IntWrapper initvalue) Compress data from an array to another array.voidheadlessUncompress(int[] in, IntWrapper inpos, int inlength, int[] out, IntWrapper outpos, int num, IntWrapper initvalue) Uncompress data from an array to another array.intmaxHeadlessCompressedLength(IntWrapper compressedPositions, int inlength) Compute the maximum number of integers that might be required to store the compressed form of a given input array segment, without headers.toString()
-
Constructor Details
-
SkippableIntegratedComposition
public SkippableIntegratedComposition(SkippableIntegratedIntegerCODEC f1, SkippableIntegratedIntegerCODEC f2) Compose a scheme from a first one (f1) and a second one (f2). The first one is called first and then the second one tries to compress whatever remains from the first run. By convention, the first scheme should be such that if, during decoding, a 32-bit zero is first encountered, then there is no output.- Parameters:
f1- first codecf2- second codec
-
-
Method Details
-
toString
-
headlessCompress
public void headlessCompress(int[] in, IntWrapper inpos, int inlength, int[] out, IntWrapper outpos, IntWrapper initvalue) Description copied from interface:SkippableIntegratedIntegerCODECCompress data from an array to another array. Both inpos and outpos are modified to represent how much data was read and written to if 12 ints (inlength = 12) are compressed to 3 ints, then inpos will be incremented by 12 while outpos will be incremented by 3 we use IntWrapper to pass the values by reference.- Specified by:
headlessCompressin interfaceSkippableIntegratedIntegerCODEC- Parameters:
in- input arrayinpos- location in the input arrayinlength- how many integers to compressout- output arrayoutpos- where to write in the output arrayinitvalue- initial value for the purpose of differential coding, the value is automatically updated
-
headlessUncompress
public void headlessUncompress(int[] in, IntWrapper inpos, int inlength, int[] out, IntWrapper outpos, int num, IntWrapper initvalue) Description copied from interface:SkippableIntegratedIntegerCODECUncompress data from an array to another array. Both inpos and outpos parameters are modified to indicate new positions after read/write.- Specified by:
headlessUncompressin interfaceSkippableIntegratedIntegerCODEC- Parameters:
in- array containing data in compressed forminpos- where to start reading in the arrayinlength- length of the compressed data (ignored by some schemes)out- array where to write the compressed outputoutpos- where to write the compressed output in outnum- number of integers we want to decode, the actual number of integers decoded can be lessinitvalue- initial value for the purpose of differential coding, the value is automatically updated
-
maxHeadlessCompressedLength
Description copied from interface:SkippableIntegratedIntegerCODECCompute the maximum number of integers that might be required to store the compressed form of a given input array segment, without headers.This is useful to pre-allocate the output buffer before calling
SkippableIntegratedIntegerCODEC.headlessCompress(int[], IntWrapper, int, int[], IntWrapper, IntWrapper).- Specified by:
maxHeadlessCompressedLengthin interfaceSkippableIntegratedIntegerCODEC- Parameters:
compressedPositions- since not all schemes compress every input integer, this parameter returns how many input integers will actually be compressed. This is useful when composing multiple schemes.inlength- number of integers to be compressed- Returns:
- the maximum number of integers needed in the output array
-