whatap 0.4.79 → 0.4.80

package/lib/util/cardinality/murmurhash.js

@@ -1,31 +1,31 @@
-/**
- * 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 hash(data) {
-    var m = 0x5bd1e995;
-    var r = 24;
-    var h = 0;
-    var k = data.mul(m);
-    k = k.getLowBits();
-    k ^= k >>> r;
-    h ^= Long.fromNumber(k).mul(m).getLowBits();
-    k =  Long.fromNumber(data.getHighBits()).mul(m).getLowBits();
-    k ^= k >>> r;
-    h = Long.fromNumber(h).mul(m).getLowBits();
-    h ^= Long.fromNumber(k).mul(m).getLowBits();
-    h ^= h >>> 13;
-    h = Long.fromNumber(h).mul(m).getLowBits();
-    h ^= h >>> 15;
-    return h;
-};
-
-var MurMurHash = {
-    hashLong : hash
-};
-
-module.exports = MurMurHash;
+/**
+ * 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 hash(data) {
+    var m = 0x5bd1e995;
+    var r = 24;
+    var h = 0;
+    var k = data.mul(m);
+    k = k.getLowBits();
+    k ^= k >>> r;
+    h ^= Long.fromNumber(k).mul(m).getLowBits();
+    k =  Long.fromNumber(data.getHighBits()).mul(m).getLowBits();
+    k ^= k >>> r;
+    h = Long.fromNumber(h).mul(m).getLowBits();
+    h ^= Long.fromNumber(k).mul(m).getLowBits();
+    h ^= h >>> 13;
+    h = Long.fromNumber(h).mul(m).getLowBits();
+    h ^= h >>> 15;
+    return h;
+};
+
+var MurMurHash = {
+    hashLong : hash
+};
+
+module.exports = MurMurHash;

package/lib/util/cardinality/registerset.js

@@ -1,75 +1,75 @@
-/**
- * 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.
- */
-
-const LOG2_BITS_PER_WORD    = 6;
-const REGISTER_SIZE         = 5;
-
-var Long = require('long');
-
-function RegisterSet(count) {
-    this.count = count;
-    this.M = new Array(getSizeForCount(this.count));
-    this.size = this.M.length;
-}
-
-RegisterSet.prototype.set = function (position, value) {
-    var bucketPos = parseInt(position / LOG2_BITS_PER_WORD);
-    var shift = REGISTER_SIZE * (position - (bucketPos * LOG2_BITS_PER_WORD));
-    this.M[bucketPos] = (this.M[bucketPos] & ~(0x1f << shift) | (value << shift));
-};
-RegisterSet.prototype.get = function (position) {
-    var bucketPos = parseInt(position / LOG2_BITS_PER_WORD);
-    var shift = REGISTER_SIZE * (position - (bucketPos * LOG2_BITS_PER_WORD));
-    return (this.M[bucketPos] & (0x1f << shift)) >>> shift;
-};
-RegisterSet.prototype.updateIfGreater = function (position, value) {
-    var bucket = parseInt(position / LOG2_BITS_PER_WORD);
-    var shift = REGISTER_SIZE * (position - (bucket * LOG2_BITS_PER_WORD));
-    var mask = 0x1f << shift;
-
-    var curVal = Long.fromNumber(this.M[bucket]).and(mask);
-    var newVal = Long.fromNumber(value).shiftLeft(shift);
-
-    if(newVal.greaterThan(curVal)) {
-        var tmp = Long.fromNumber(this.M[bucket]).and(~mask).or(newVal);
-        this.M[bucket] = tmp.getLowBits();
-        return true;
-    } else {
-        return false;
-    }
-};
-RegisterSet.prototype.merge = function (that) {
-
-    for(var bucket = 0; bucket < this.M.length; bucket++) {
-        var word = 0;
-        for(var j=0; j<LOG2_BITS_PER_WORD; j++) {
-            var mask = 0x1f << (REGISTER_SIZE * j);
-            var thisVal = (this.M[bucket] & mask);
-            var thatVal = (that.M[bucket] & mask);
-            word |= (thisVal < thatVal) ? thatVal : thisVal;
-        }
-        this.M[bucket] = word;
-    }
-};
-RegisterSet.prototype.readOnlyBits = function () {
-    return this.M;
-};
-
-function getSizeForCount(count) {
-    var bits = getBits(count);
-    if(bits === 0) {
-        return 1;
-    } else if(bits % 32 === 0) {
-        return bits;
-    } else {
-        return bits + 1;
-    }
-}
-function getBits(count) {
-    return parseInt(count / LOG2_BITS_PER_WORD);
-}
-
+/**
+ * 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.
+ */
+
+const LOG2_BITS_PER_WORD    = 6;
+const REGISTER_SIZE         = 5;
+
+var Long = require('long');
+
+function RegisterSet(count) {
+    this.count = count;
+    this.M = new Array(getSizeForCount(this.count));
+    this.size = this.M.length;
+}
+
+RegisterSet.prototype.set = function (position, value) {
+    var bucketPos = parseInt(position / LOG2_BITS_PER_WORD);
+    var shift = REGISTER_SIZE * (position - (bucketPos * LOG2_BITS_PER_WORD));
+    this.M[bucketPos] = (this.M[bucketPos] & ~(0x1f << shift) | (value << shift));
+};
+RegisterSet.prototype.get = function (position) {
+    var bucketPos = parseInt(position / LOG2_BITS_PER_WORD);
+    var shift = REGISTER_SIZE * (position - (bucketPos * LOG2_BITS_PER_WORD));
+    return (this.M[bucketPos] & (0x1f << shift)) >>> shift;
+};
+RegisterSet.prototype.updateIfGreater = function (position, value) {
+    var bucket = parseInt(position / LOG2_BITS_PER_WORD);
+    var shift = REGISTER_SIZE * (position - (bucket * LOG2_BITS_PER_WORD));
+    var mask = 0x1f << shift;
+
+    var curVal = Long.fromNumber(this.M[bucket]).and(mask);
+    var newVal = Long.fromNumber(value).shiftLeft(shift);
+
+    if(newVal.greaterThan(curVal)) {
+        var tmp = Long.fromNumber(this.M[bucket]).and(~mask).or(newVal);
+        this.M[bucket] = tmp.getLowBits();
+        return true;
+    } else {
+        return false;
+    }
+};
+RegisterSet.prototype.merge = function (that) {
+
+    for(var bucket = 0; bucket < this.M.length; bucket++) {
+        var word = 0;
+        for(var j=0; j<LOG2_BITS_PER_WORD; j++) {
+            var mask = 0x1f << (REGISTER_SIZE * j);
+            var thisVal = (this.M[bucket] & mask);
+            var thatVal = (that.M[bucket] & mask);
+            word |= (thisVal < thatVal) ? thatVal : thisVal;
+        }
+        this.M[bucket] = word;
+    }
+};
+RegisterSet.prototype.readOnlyBits = function () {
+    return this.M;
+};
+
+function getSizeForCount(count) {
+    var bits = getBits(count);
+    if(bits === 0) {
+        return 1;
+    } else if(bits % 32 === 0) {
+        return bits;
+    } else {
+        return bits + 1;
+    }
+}
+function getBits(count) {
+    return parseInt(count / LOG2_BITS_PER_WORD);
+}
+
 module.exports = RegisterSet;

package/lib/util/config-util.js

@@ -1,18 +1,18 @@
-function num(k, defValue){
-    var v=process.env[k];
-    return v?Number(v):defValue;
-};
-function bool(k, defValue){
-    var v=process.env[k];
-    return v?Boolean(v):defValue;
-};
-function str(k, defValue){
-    var v=process.env[k];
-    return v?v:defValue;
-};
-
-module.exports = {
-    num: num,
-    bool: bool,
-    str: str
+function num(k, defValue){
+    var v=process.env[k];
+    return v?Number(v):defValue;
+};
+function bool(k, defValue){
+    var v=process.env[k];
+    return v?Boolean(v):defValue;
+};
+function str(k, defValue){
+    var v=process.env[k];
+    return v?v:defValue;
+};
+
+module.exports = {
+    num: num,
+    bool: bool,
+    str: str
 }

package/lib/util/cypher.js

@@ -1,90 +1,90 @@
-/**
- * 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 crypto      = require('crypto'),
-    DataOutputX = require('./../io/data-outputx');
-
-var Cypher = function(cypherKey,  xor_key) {
-    xor_key = xor_key || 0;
-
-    this.BLOCK = require('./../conf/configure').cypher_level / 8;
-    this.key = cypherKey = Cypher.padding(cypherKey);
-    this.enc = crypto.createCipheriv("AES-128-ECB", cypherKey, '');
-
-    this.dec = crypto.createDecipheriv("AES-128-ECB", cypherKey, '');
-    this.dec.setAutoPadding(false);
-
-    this.xor_key = DataOutputX.toBytes(xor_key, 4);
-};
-
-Cypher.padding = function( src ){
-    if(src.length === 16){
-        return src;
-    }
-    var dest = Buffer.alloc(16 , 0);
-    if(src.length > 16){
-        src.copy(dest, 0 , 0, dest.length);
-    }else{
-        src.copy(dest, 0 , 0, src.length);
-    }
-    return dest;
-};
-Cypher.prototype.encryptBlock = function(data){
-    try{
-        if(this.BLOCK === 0){
-            return data;
-        }
-        var ret = Buffer.concat([this.enc.update(data), this.enc.final()]);
-        this.enc = crypto.createCipheriv( "AES-128-ECB", this.key, '');
-        return ret;
-    }catch(e){
-        console.error(e);
-    }
-};
-Cypher.prototype.hide = function(b){
-    if( this.BLOCK === 0){
-        return b;
-    }
-    for( var i = 0 , j = 0 ; i< b.length ; i++, j = (j+1) % this.xor_key.length){
-        b[i] ^= this.xor_key[j];
-    }
-    return b;
-};
-Cypher.prototype.encrypt = function(data){
-    this.enc = crypto.createCipheriv("AES-128-ECB", this.key, '');
-    var len = data.length;
-    var remainder = len % 16;
-    var buf = null;
-    if(remainder === 0 ){
-        buf = data;
-    } else {
-        buf = Buffer.alloc((Math.floor(len / 16) +1) * 16 , 0);
-        DataOutputX.set(buf, 0, data );
-    }
-    try {
-        if(data.length <= 16) {
-            return Buffer.concat([this.enc.update(buf)]);
-        } else {
-            return Buffer.concat([this.enc.update(buf), this.enc.final()]);
-        }
-    } catch(e) {
-    }
-    return null;
-};
-Cypher.prototype.decrypt = function(data){
-    this.dec = crypto.createDecipheriv( "AES-128-ECB", this.key, '');
-    this.dec.setAutoPadding(false);
-
-    try {
-        var b = this.dec.update(data);
-        var f = this.dec.final();
-        return Buffer.concat([b, f]);
-    }catch(e){
-    }
-    return null;
-};
-
+/**
+ * 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 crypto      = require('crypto'),
+    DataOutputX = require('./../io/data-outputx');
+
+var Cypher = function(cypherKey,  xor_key) {
+    xor_key = xor_key || 0;
+
+    this.BLOCK = require('./../conf/configure').cypher_level / 8;
+    this.key = cypherKey = Cypher.padding(cypherKey);
+    this.enc = crypto.createCipheriv("AES-128-ECB", cypherKey, '');
+
+    this.dec = crypto.createDecipheriv("AES-128-ECB", cypherKey, '');
+    this.dec.setAutoPadding(false);
+
+    this.xor_key = DataOutputX.toBytes(xor_key, 4);
+};
+
+Cypher.padding = function( src ){
+    if(src.length === 16){
+        return src;
+    }
+    var dest = Buffer.alloc(16 , 0);
+    if(src.length > 16){
+        src.copy(dest, 0 , 0, dest.length);
+    }else{
+        src.copy(dest, 0 , 0, src.length);
+    }
+    return dest;
+};
+Cypher.prototype.encryptBlock = function(data){
+    try{
+        if(this.BLOCK === 0){
+            return data;
+        }
+        var ret = Buffer.concat([this.enc.update(data), this.enc.final()]);
+        this.enc = crypto.createCipheriv( "AES-128-ECB", this.key, '');
+        return ret;
+    }catch(e){
+        console.error(e);
+    }
+};
+Cypher.prototype.hide = function(b){
+    if( this.BLOCK === 0){
+        return b;
+    }
+    for( var i = 0 , j = 0 ; i< b.length ; i++, j = (j+1) % this.xor_key.length){
+        b[i] ^= this.xor_key[j];
+    }
+    return b;
+};
+Cypher.prototype.encrypt = function(data){
+    this.enc = crypto.createCipheriv("AES-128-ECB", this.key, '');
+    var len = data.length;
+    var remainder = len % 16;
+    var buf = null;
+    if(remainder === 0 ){
+        buf = data;
+    } else {
+        buf = Buffer.alloc((Math.floor(len / 16) +1) * 16 , 0);
+        DataOutputX.set(buf, 0, data );
+    }
+    try {
+        if(data.length <= 16) {
+            return Buffer.concat([this.enc.update(buf)]);
+        } else {
+            return Buffer.concat([this.enc.update(buf), this.enc.final()]);
+        }
+    } catch(e) {
+    }
+    return null;
+};
+Cypher.prototype.decrypt = function(data){
+    this.dec = crypto.createDecipheriv( "AES-128-ECB", this.key, '');
+    this.dec.setAutoPadding(false);
+
+    try {
+        var b = this.dec.update(data);
+        var f = this.dec.final();
+        return Buffer.concat([b, f]);
+    }catch(e){
+    }
+    return null;
+};
+
 module.exports = Cypher;