Examples of me.lemire.integercompression.Simple9

me.lemire.integercompression.Simple9
This is an implementation of the popular Simple9 scheme. It is limited to 28-bit integers (between 0 and 2^28-1). Note that this does not use differential coding: if you are working on sorted lists, you must compute the deltas separately. @author Daniel Lemire

                                new OptPFDS16(), new VariableByte()), data,
                                repeat, true);
                        System.out.println();




                        testCodec(csvLog, sparsity, new Simple9(), data,
                                repeat, false);
                        testCodec(csvLog, sparsity, new Simple9(), data,
                                repeat, false);
                        testCodec(csvLog, sparsity, new Simple9(), data,
                                repeat, true);
                        System.out.println();


                        {
                                IntegerCODEC c = new Composition(

View Full Code Here

TOP

Related Classes of me.lemire.integercompression.Simple9

me.lemire.integercompression.benchmarktools.Benchmark

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.