Class BinaryPacking

java.lang.Object
me.lemire.integercompression.BinaryPacking
All Implemented Interfaces:
IntegerCODEC, SkippableIntegerCODEC

public final class BinaryPacking extends Object implements IntegerCODEC, SkippableIntegerCODEC
Scheme based on a commonly used idea: can be extremely fast. It encodes integers in blocks of 32 integers. For arrays containing an arbitrary number of integers, you should use it in conjunction with another CODEC:
IntegerCODEC ic = 
  new Composition(new BinaryPacking(), new VariableByte()).
Note that this does not use differential coding: if you are working on sorted lists, use IntegratedBinaryPacking instead.

For details, please see

Daniel Lemire and Leonid Boytsov, Decoding billions of integers per second through vectorization Software: Practice & Experience http://onlinelibrary.wiley.com/doi/10.1002/spe.2203/abstract http://arxiv.org/abs/1209.2137

Daniel Lemire, Leonid Boytsov, Nathan Kurz, SIMD Compression and the Intersection of Sorted Integers http://arxiv.org/abs/1401.6399

Author:
Daniel Lemire