Slightly better testing.

Author: lemire

FastIntegerCompression.js

@@ -80,18 +80,17 @@ FastIntegerCompression.compress = function(input) {
 
 // from a compressed array of integers stored ArrayBuffer, compute the number of compressed integers by scanning the input
 FastIntegerCompression.computeHowManyIntegers = function(input) {
-  var view   = new UInt8Array(input);
+  var view   = new Int8Array(input);
   var c = view.length;
   var count = 0;
   for(var i = 0; i < c; i++) {
     count += (input[i]>>>7);
   }
   return c - count;
 }
-
 // uncompress an array of integer from an ArrayBuffer, return the array
 FastIntegerCompression.uncompress = function(input) {
-  var array = new Array()
+  var array = []
   var inbyte = new Int8Array(input);
   var end = inbyte.length;
   var pos = 0;
@@ -128,7 +127,6 @@ FastIntegerCompression.uncompress = function(input) {
 };
 
 
-
 ///////////////
 
 module.exports = FastIntegerCompression;

benchmark/test.js

@@ -14,6 +14,7 @@ function BasicBench() {
         array.push(Math.round(Math.random() * t))
     }
     var buf = FastIntegerCompression.compress(array);
+    FastIntegerCompression.uncompress(buf);
     console.log('input size: '+sizeof.format(sizeof.sizeof(array))+' compressed size: '+sizeof.format(buf.byteLength));
 
     var suite = new Benchmark.Suite();

unit/basictests.js

@@ -17,6 +17,7 @@ describe('FastIntegerCompression', function() {
   it('Testing simple compression', function() {
     var array = [10,100000,65999,10,10,0,1,1,2000];
     var buf = FastIntegerCompression.compress(array);
+    if(! FastIntegerCompression.computeHowManyIntegers(buf) == array.length) throw "bad count";
     var back = FastIntegerCompression.uncompress(buf);
     if(!arraysEquals(array,back)) throw "bad";