whatap 0.4.78 → 0.4.80

package/lib/util/anylist.js

@@ -1,103 +1,103 @@
-var INT = 1;
-var LONG = 2;
-var FLOAT = 3;
-var DOUBLE = 4;
-var STRING = 5;
-
-AnyList.INT = 1;
-AnyList.LONG = 2;
-AnyList.FLOAT = 3;
-AnyList.DOUBLE = 4;
-AnyList.STRING = 5;
-
-function AnyList(type, len){
-    this.type=type;
-    this.data = new Array(len);
-}
-AnyList.prototype.getType=function(){
-    return this.type;
-};
-AnyList.prototype.put=function(idx, d){
-    this.data[idx]=d;
-};
-
-AnyList.prototype.get=function(idx){
-    return this.data[idx];
-};
-AnyList.prototype.size = function () {
-    return this.data ? this.data.length : 0;
-};
-AnyList.prototype.write=function(o){
-     switch(this.type){
-        case INT: this.writeDecimal(o);  return  this;
-        case LONG: this.writeDecimal(o);  return  this; 
-        case FLOAT: this.writeFloat(o);  return  this;
-        case DOUBLE: this.writeDouble(o);  return  this;
-        case STRING: this.writeString(o); return  this;
-     }
-};
-AnyList.prototype.read=function(i){
-    switch(this.type){
-       case INT: this.readDecimal(i);  return  this;
-       case LONG: this.readDecimal(i);  return  this; 
-       case FLOAT: this.readFloat(i);  return  this;
-       case DOUBLE: this.readDouble(i);  return  this;
-       case STRING: this.readString(i); return  this;
-    }
-};
-
-AnyList.prototype.writeDouble = function (dout) {
-    var len =this.size();
-    dout.writeInt24BE(len);
-    for (var i = 0; i < len; i++) {
-        dout.writeDouble(this.get(i));
-    }
-};
-AnyList.prototype.readDouble=function(din) {
-    var count = din.readInt24BE();
-    for (var i = 0; i < count; i++) {
-        this.add(din.readDouble());
-    }
-};
-AnyList.prototype.writeFloat = function (dout) {
-    var len =this.size();
-    dout.writeInt24BE(len);
-    for (var i = 0; i < len; i++) {
-        dout.writeFloat(this.get(i));
-    }
-};
-AnyList.prototype.readFloat=function(din) {
-    var count = din.readInt24BE();
-    for (var i = 0; i < count; i++) {
-        this.add(din.readFloat());
-    }
-};
-
-AnyList.prototype.writeDecimal = function (dout) {
-    var len =this.size();
-    dout.writeInt24BE(len);
-    for (var i = 0; i < len; i++) {
-        dout.writeDecimal(this.get(i));
-    }
-};
-AnyList.prototype.readDecimal=function(din) {
-    var count = din.readInt24BE();
-    for (var i = 0; i < count; i++) {
-        this.add(din.readDecNumber());
-    }
-};
-AnyList.prototype.writeString = function (dout) {
-    var len =this.size();
-    dout.writeInt24BE(len);
-    for (var i = 0; i < len; i++) {
-        dout.writeText(this.get(i));
-    }
-};
-AnyList.prototype.readString=function(din) {
-    var count = din.readInt24BE();
-    for (var i = 0; i < count; i++) {
-        this.add(din.readText());
-    }
-};
-
+var INT = 1;
+var LONG = 2;
+var FLOAT = 3;
+var DOUBLE = 4;
+var STRING = 5;
+
+AnyList.INT = 1;
+AnyList.LONG = 2;
+AnyList.FLOAT = 3;
+AnyList.DOUBLE = 4;
+AnyList.STRING = 5;
+
+function AnyList(type, len){
+    this.type=type;
+    this.data = new Array(len);
+}
+AnyList.prototype.getType=function(){
+    return this.type;
+};
+AnyList.prototype.put=function(idx, d){
+    this.data[idx]=d;
+};
+
+AnyList.prototype.get=function(idx){
+    return this.data[idx];
+};
+AnyList.prototype.size = function () {
+    return this.data ? this.data.length : 0;
+};
+AnyList.prototype.write=function(o){
+     switch(this.type){
+        case INT: this.writeDecimal(o);  return  this;
+        case LONG: this.writeDecimal(o);  return  this; 
+        case FLOAT: this.writeFloat(o);  return  this;
+        case DOUBLE: this.writeDouble(o);  return  this;
+        case STRING: this.writeString(o); return  this;
+     }
+};
+AnyList.prototype.read=function(i){
+    switch(this.type){
+       case INT: this.readDecimal(i);  return  this;
+       case LONG: this.readDecimal(i);  return  this; 
+       case FLOAT: this.readFloat(i);  return  this;
+       case DOUBLE: this.readDouble(i);  return  this;
+       case STRING: this.readString(i); return  this;
+    }
+};
+
+AnyList.prototype.writeDouble = function (dout) {
+    var len =this.size();
+    dout.writeInt24BE(len);
+    for (var i = 0; i < len; i++) {
+        dout.writeDouble(this.get(i));
+    }
+};
+AnyList.prototype.readDouble=function(din) {
+    var count = din.readInt24BE();
+    for (var i = 0; i < count; i++) {
+        this.add(din.readDouble());
+    }
+};
+AnyList.prototype.writeFloat = function (dout) {
+    var len =this.size();
+    dout.writeInt24BE(len);
+    for (var i = 0; i < len; i++) {
+        dout.writeFloat(this.get(i));
+    }
+};
+AnyList.prototype.readFloat=function(din) {
+    var count = din.readInt24BE();
+    for (var i = 0; i < count; i++) {
+        this.add(din.readFloat());
+    }
+};
+
+AnyList.prototype.writeDecimal = function (dout) {
+    var len =this.size();
+    dout.writeInt24BE(len);
+    for (var i = 0; i < len; i++) {
+        dout.writeDecimal(this.get(i));
+    }
+};
+AnyList.prototype.readDecimal=function(din) {
+    var count = din.readInt24BE();
+    for (var i = 0; i < count; i++) {
+        this.add(din.readDecNumber());
+    }
+};
+AnyList.prototype.writeString = function (dout) {
+    var len =this.size();
+    dout.writeInt24BE(len);
+    for (var i = 0; i < len; i++) {
+        dout.writeText(this.get(i));
+    }
+};
+AnyList.prototype.readString=function(din) {
+    var count = din.readInt24BE();
+    for (var i = 0; i < count; i++) {
+        this.add(din.readText());
+    }
+};
+
 module.exports = AnyList;

package/lib/util/array-util.js

@@ -1,101 +1,101 @@
-/**
- * Copyright 2016 the WHATAP project authors. All rights reserved.
- * Use of this source code is governed by a license that
- * can be found in the LICENSE file.
- */
-
-var HashUtil  = require('../util/hashutil');
-
-function ArrayUtil(){
-}
-function _hash(str) {
-    var h = 0, i, chr, len;
-    if (str.length === 0) return h;
-    for (i = 0, len = str.length; i < len; i++) {
-        chr   = str.charCodeAt(i);
-        h  = ((h << 5) - h) + chr;
-        h |= 0; // Convert to 32bit integer
-    }
-    return h;
-}
-function _hashFloat(v) {
-    var b  = Buffer.alloc(64);
-    b.writeFloatBE(v);
-    return b.readInt32BE();
-}
-
-ArrayUtil.isExist = function(arr, key){
-    if(arr===null || arr === undefined) return false;
-
-    for(var i = 0 ; i < arr.length; i++){
-        if(arr[i] === key) return true;
-    }
-    return false;
-};
-
-ArrayUtil.isA = function(arr){
-    if(arr===null || arr === undefined) return false;
-    return Array.isArray(arr);
-};
-
-ArrayUtil.compare = function(v1, v2){
-    if(Array.isArray(v1)===false){
-        return -1;
-    }
-    if(Array.isArray(v2)===false){
-        return 1;
-    }
-    
-    var l_len = v1.length,
-        r_len = v2.length;
-    for(var i=0; i<l_len && i < r_len; i++) {
-        if(v1[i] > v2[i]) {
-            return 1;
-        }
-        if(v1[i] < v2[i]) {
-            return -1;
-        }
-    }
-    return l_len - r_len;
-}
-
-ArrayUtil.intHash = function(v1){
-    if(Array.isArray(v1)===false){
-        return 0;
-    }
-    var h=0;
-    for(var i=0, len = v1.length; i<len; i++) {
-        h = h ^ v1[i];
-    }
-    return h;
-}
-ArrayUtil.floatHash = function(v1){
-    if(Array.isArray(v1)===false){
-        return 0;
-    }
-    var h=0;
-    for(var i=0, len = v1.length; i<len; i++) {
-        h = h ^ _hashFloat(v1[i]);
-    }
-    return h;
-}
-ArrayUtil.strHash = function(v1){
-    if(Array.isArray(v1)===false){
-        return 0;
-    }
-    var h=0;
-    for(var i=0, len = v1.length; i<len; i++) {
-        h = h ^ _hash(v1[i]);
-    }
-    return h;
-}
-
-ArrayUtil.equals = function(v1, v2){
-    if(v1===v2){
-        return true;
-    }else{
-        return this.compare(v1,v2)===0;
-    }
-}
-            
+/**
+ * Copyright 2016 the WHATAP project authors. All rights reserved.
+ * Use of this source code is governed by a license that
+ * can be found in the LICENSE file.
+ */
+
+var HashUtil  = require('../util/hashutil');
+
+function ArrayUtil(){
+}
+function _hash(str) {
+    var h = 0, i, chr, len;
+    if (str.length === 0) return h;
+    for (i = 0, len = str.length; i < len; i++) {
+        chr   = str.charCodeAt(i);
+        h  = ((h << 5) - h) + chr;
+        h |= 0; // Convert to 32bit integer
+    }
+    return h;
+}
+function _hashFloat(v) {
+    var b  = Buffer.alloc(64);
+    b.writeFloatBE(v);
+    return b.readInt32BE();
+}
+
+ArrayUtil.isExist = function(arr, key){
+    if(arr===null || arr === undefined) return false;
+
+    for(var i = 0 ; i < arr.length; i++){
+        if(arr[i] === key) return true;
+    }
+    return false;
+};
+
+ArrayUtil.isA = function(arr){
+    if(arr===null || arr === undefined) return false;
+    return Array.isArray(arr);
+};
+
+ArrayUtil.compare = function(v1, v2){
+    if(Array.isArray(v1)===false){
+        return -1;
+    }
+    if(Array.isArray(v2)===false){
+        return 1;
+    }
+    
+    var l_len = v1.length,
+        r_len = v2.length;
+    for(var i=0; i<l_len && i < r_len; i++) {
+        if(v1[i] > v2[i]) {
+            return 1;
+        }
+        if(v1[i] < v2[i]) {
+            return -1;
+        }
+    }
+    return l_len - r_len;
+}
+
+ArrayUtil.intHash = function(v1){
+    if(Array.isArray(v1)===false){
+        return 0;
+    }
+    var h=0;
+    for(var i=0, len = v1.length; i<len; i++) {
+        h = h ^ v1[i];
+    }
+    return h;
+}
+ArrayUtil.floatHash = function(v1){
+    if(Array.isArray(v1)===false){
+        return 0;
+    }
+    var h=0;
+    for(var i=0, len = v1.length; i<len; i++) {
+        h = h ^ _hashFloat(v1[i]);
+    }
+    return h;
+}
+ArrayUtil.strHash = function(v1){
+    if(Array.isArray(v1)===false){
+        return 0;
+    }
+    var h=0;
+    for(var i=0, len = v1.length; i<len; i++) {
+        h = h ^ _hash(v1[i]);
+    }
+    return h;
+}
+
+ArrayUtil.equals = function(v1, v2){
+    if(v1===v2){
+        return true;
+    }else{
+        return this.compare(v1,v2)===0;
+    }
+}
+            
 module.exports = ArrayUtil;

package/lib/util/bitutil.js

@@ -1,28 +1,28 @@
-/**
- * Copyright 2016 the WHATAP project authors. All rights reserved.
- * Use of this source code is governed by a license that
- * can be found in the LICENSE file.
- */
-
-var Long = require('long');
-
-function BitUtil() {}
-
-BitUtil.composite = function (hkey, wkey) {
-    return Long.fromBits(wkey, hkey);
-};
-BitUtil.getHigh = function (key) {
-
-    if(typeof key === 'number') {
-        return key & 0xffffffff;
-    }
-    return key.getHighBits() & 0xffffffff;
-};
-BitUtil.getLow = function (key) {
-    if(typeof key === 'number') {
-        return key & 0xffffffff;
-    }
-    return key.getLowBits() & 0xffffffff;
-};
-
+/**
+ * Copyright 2016 the WHATAP project authors. All rights reserved.
+ * Use of this source code is governed by a license that
+ * can be found in the LICENSE file.
+ */
+
+var Long = require('long');
+
+function BitUtil() {}
+
+BitUtil.composite = function (hkey, wkey) {
+    return Long.fromBits(wkey, hkey);
+};
+BitUtil.getHigh = function (key) {
+
+    if(typeof key === 'number') {
+        return key & 0xffffffff;
+    }
+    return key.getHighBits() & 0xffffffff;
+};
+BitUtil.getLow = function (key) {
+    if(typeof key === 'number') {
+        return key & 0xffffffff;
+    }
+    return key.getLowBits() & 0xffffffff;
+};
+
 module.exports = BitUtil;

package/lib/util/cardinality/hyperloglog.js

@@ -1,106 +1,106 @@
-/**
- * Copyright 2016 the WHATAP project authors. All rights reserved.
- * Use of this source code is governed by a license that
- * can be found in the LICENSE file.
- */
-
-var RegisterSet = require('./registerset'),
-    MurmurHash  = require('./murmurhash'),
-    DataOutpuxX = require('../../io/data-outputx'),
-    Long        = require('long');
-
-
-function HyperLogLog() {
-    this.log2m = 10;
-    this.registerSet = new RegisterSet(1 << this.log2m);
-    var m = 1 << this.log2m;
-    this.alphaMM = getAlphaMM(this.log2m, m);
-}
-
-HyperLogLog.prototype.offerHashed = function (hashedValue) {
-    var j = hashedValue >>> (32 - this.log2m);
-    var r = numberOfLeadingZeros((hashedValue << this.log2m) | (1 << (this.log2m - 1)) + 1) + 1;
-    return this.registerSet.updateIfGreater(j, r);
-};
-HyperLogLog.prototype.offer = function (o) {
-    var val;
-    if(o instanceof Long) {
-        val = o;
-    } else if(typeof o === 'string') {
-        val = Long.fromString(o);
-    } else if(typeof o === 'number') {
-        val = Long.fromNumber(o);
-    }
-    var x = MurmurHash.hashLong(val);
-    return this.offerHashed(x);
-};
-HyperLogLog.prototype.cardinality = function () {
-    var registerSum = 0;
-    var count = this.registerSet.count;
-    var zeros = 0.0;
-    for(var j=0; j<this.registerSet.count; j++) {
-        var val = this.registerSet.get(j);
-        registerSum += 1.0 / (1 << val);
-        if(parseFloat(val) === 0.0) {
-            zeros++;
-        }
-    }
-    var estimate = this.alphaMM * (1 / registerSum);
-    if(estimate <= (5.0 / 2.0) * count) {
-        return Math.round(linearCounting(count, zeros));
-    } else {
-        return Math.round(estimate);
-    }
-};
-HyperLogLog.prototype.getBytes = function () {
-    var dout = new DataOutpuxX();
-    dout.writeInt(this.log2m);
-    dout.writeInt(this.registerSet.size);
-    var M = this.registerSet.readOnlyBits();
-    for(var i=0; i<M.length; i++) {
-        dout.writeInt(M[i]);
-    }
-    return dout.toByteArray();
-};
-
-var getAlphaMM = function (p, m) {
-    switch (p) {
-        case 4:
-            return 0.673 * m * m;
-        case 5:
-            return 0.697 * m * m;
-        case 6:
-            return 0.709 * m * m;
-        default:
-            return (0.7213 / (1 + 1.079 / m)) * m * m;
-    }
-};
-var linearCounting = function (m, V) {
-    return m * Math.log(m / V);
-};
-var numberOfLeadingZeros = function (i) {
-    if (i === 0)
-        return 32;
-    var n = 1;
-
-    if (i >>> 16 === 0) {
-        n += 16;
-        i <<= 16;
-    }
-    if (i >>> 24 === 0) {
-        n += 8;
-        i <<= 8;
-    }
-    if (i >>> 28 === 0) {
-        n += 4;
-        i <<= 4;
-    }
-    if (i >>> 30 === 0) {
-        n += 2;
-        i <<= 2;
-    }
-    n -= i >>> 31;
-    return n;
-}
-
+/**
+ * Copyright 2016 the WHATAP project authors. All rights reserved.
+ * Use of this source code is governed by a license that
+ * can be found in the LICENSE file.
+ */
+
+var RegisterSet = require('./registerset'),
+    MurmurHash  = require('./murmurhash'),
+    DataOutpuxX = require('../../io/data-outputx'),
+    Long        = require('long');
+
+
+function HyperLogLog() {
+    this.log2m = 10;
+    this.registerSet = new RegisterSet(1 << this.log2m);
+    var m = 1 << this.log2m;
+    this.alphaMM = getAlphaMM(this.log2m, m);
+}
+
+HyperLogLog.prototype.offerHashed = function (hashedValue) {
+    var j = hashedValue >>> (32 - this.log2m);
+    var r = numberOfLeadingZeros((hashedValue << this.log2m) | (1 << (this.log2m - 1)) + 1) + 1;
+    return this.registerSet.updateIfGreater(j, r);
+};
+HyperLogLog.prototype.offer = function (o) {
+    var val;
+    if(o instanceof Long) {
+        val = o;
+    } else if(typeof o === 'string') {
+        val = Long.fromString(o);
+    } else if(typeof o === 'number') {
+        val = Long.fromNumber(o);
+    }
+    var x = MurmurHash.hashLong(val);
+    return this.offerHashed(x);
+};
+HyperLogLog.prototype.cardinality = function () {
+    var registerSum = 0;
+    var count = this.registerSet.count;
+    var zeros = 0.0;
+    for(var j=0; j<this.registerSet.count; j++) {
+        var val = this.registerSet.get(j);
+        registerSum += 1.0 / (1 << val);
+        if(parseFloat(val) === 0.0) {
+            zeros++;
+        }
+    }
+    var estimate = this.alphaMM * (1 / registerSum);
+    if(estimate <= (5.0 / 2.0) * count) {
+        return Math.round(linearCounting(count, zeros));
+    } else {
+        return Math.round(estimate);
+    }
+};
+HyperLogLog.prototype.getBytes = function () {
+    var dout = new DataOutpuxX();
+    dout.writeInt(this.log2m);
+    dout.writeInt(this.registerSet.size);
+    var M = this.registerSet.readOnlyBits();
+    for(var i=0; i<M.length; i++) {
+        dout.writeInt(M[i]);
+    }
+    return dout.toByteArray();
+};
+
+var getAlphaMM = function (p, m) {
+    switch (p) {
+        case 4:
+            return 0.673 * m * m;
+        case 5:
+            return 0.697 * m * m;
+        case 6:
+            return 0.709 * m * m;
+        default:
+            return (0.7213 / (1 + 1.079 / m)) * m * m;
+    }
+};
+var linearCounting = function (m, V) {
+    return m * Math.log(m / V);
+};
+var numberOfLeadingZeros = function (i) {
+    if (i === 0)
+        return 32;
+    var n = 1;
+
+    if (i >>> 16 === 0) {
+        n += 16;
+        i <<= 16;
+    }
+    if (i >>> 24 === 0) {
+        n += 8;
+        i <<= 8;
+    }
+    if (i >>> 28 === 0) {
+        n += 4;
+        i <<= 4;
+    }
+    if (i >>> 30 === 0) {
+        n += 2;
+        i <<= 2;
+    }
+    n -= i >>> 31;
+    return n;
+}
+
 module.exports = HyperLogLog;