tedious 1.12.3 → 1.14.0

package/lib/token/token-stream-parser.js

@@ -1,19 +1,15 @@
-// Generated by CoffeeScript 1.10.0
-var EventEmitter,
-    Parser,
-    StreamParser,
-    extend = function (child, parent) {
-  for (var key in parent) {
-    if (hasProp.call(parent, key)) child[key] = parent[key];
-  }function ctor() {
-    this.constructor = child;
-  }ctor.prototype = parent.prototype;child.prototype = new ctor();child.__super__ = parent.prototype;return child;
-},
-    hasProp = ({}).hasOwnProperty;
-
-EventEmitter = require('events').EventEmitter;
-
-StreamParser = require("./stream-parser");
+'use strict';
+
+var _get = require('babel-runtime/helpers/get')['default'];
+
+var _inherits = require('babel-runtime/helpers/inherits')['default'];
+
+var _createClass = require('babel-runtime/helpers/create-class')['default'];
+
+var _classCallCheck = require('babel-runtime/helpers/class-call-check')['default'];
+
+var EventEmitter = require('events').EventEmitter;
+var StreamParser = require('./stream-parser');
 
 /*
   Buffers are thrown at the parser (by calling addBuffer).
@@ -26,32 +22,41 @@ StreamParser = require("./stream-parser");
   parsing resumes.
  */
 
-Parser = (function (superClass) {
-  extend(Parser, superClass);
+var Parser = (function (_EventEmitter) {
+  _inherits(Parser, _EventEmitter);
 
   function Parser(debug, colMetadata, options) {
+    var _this = this;
+
+    _classCallCheck(this, Parser);
+
+    _get(Object.getPrototypeOf(Parser.prototype), 'constructor', this).call(this);
+
     this.debug = debug;
-    this.colMetadata = colMetadata;
+    this.colMetadata = this.colMetadata;
     this.options = options;
+
     this.parser = new StreamParser(this.debug, this.colMetadata, this.options);
-    this.parser.on("data", (function (_this) {
-      return function (token) {
-        if (token.event) {
-          return _this.emit(token.event, token);
-        }
-      };
-    })(this));
+    this.parser.on('data', function (token) {
+      if (token.event) {
+        _this.emit(token.event, token);
+      }
+    });
   }
 
-  Parser.prototype.addBuffer = function (buffer) {
-    return this.parser.write(buffer);
-  };
-
-  Parser.prototype.isEnd = function () {
-    return this.parser.buffer.length === 0;
-  };
+  _createClass(Parser, [{
+    key: 'addBuffer',
+    value: function addBuffer(buffer) {
+      return this.parser.write(buffer);
+    }
+  }, {
+    key: 'isEnd',
+    value: function isEnd() {
+      return this.parser.buffer.length === this.parser.position;
+    }
+  }]);
 
   return Parser;
 })(EventEmitter);
 
-exports.Parser = Parser;
+module.exports.Parser = Parser;

package/lib/token/token.js

@@ -1,7 +1,6 @@
-// Generated by CoffeeScript 1.10.0
-var TYPE;
+'use strict';
 
-TYPE = {
+module.exports.TYPE = {
   ALTMETADATA: 0x88,
   ALTROW: 0xD3,
   COLMETADATA: 0x81,
@@ -21,6 +20,4 @@ TYPE = {
   ROW: 0xD1,
   SSPI: 0xED,
   TABNAME: 0xA4
-};
-
-exports.TYPE = TYPE;
+};

package/lib/tracking-buffer/bigint.js

@@ -1,90 +1,87 @@
-// Generated by CoffeeScript 1.10.0
-var convertLEBytesToString, getNextRemainder, invert, isZero, numberToInt64LE;
+'use strict';
 
-isZero = function (array) {
-  var byte, j, len;
-  for (j = 0, len = array.length; j < len; j++) {
-    byte = array[j];
+function isZero(array) {
+  for (var j = 0, len = array.length; j < len; j++) {
+    var byte = array[j];
     if (byte !== 0) {
       return false;
     }
   }
   return true;
-};
+}
 
-getNextRemainder = function (array) {
-  var index, j, ref, remainder, s;
-  remainder = 0;
-  for (index = j = ref = array.length - 1; j >= 0; index = j += -1) {
-    s = remainder * 256 + array[index];
-    array[index] = Math.floor(s / 10);
+function getNextRemainder(array) {
+  var remainder = 0;
+
+  for (var i = array.length - 1; i >= 0; i--) {
+    var s = remainder * 256 + array[i];
+    array[i] = Math.floor(s / 10);
     remainder = s % 10;
   }
+
   return remainder;
-};
+}
+
+function invert(array) {
+  // Invert bits
+  var len = array.length;
 
-invert = function (array) {
-  var byte, index, j, k, len, len1, results;
-  for (index = j = 0, len = array.length; j < len; index = ++j) {
-    byte = array[index];
-    array[index] = array[index] ^ 0xFF;
+  for (var i = 0; i < len; i++) {
+    array[i] = array[i] ^ 0xFF;
   }
-  results = [];
-  for (index = k = 0, len1 = array.length; k < len1; index = ++k) {
-    byte = array[index];
-    array[index] = array[index] + 1;
-    if (array[index] > 255) {
-      results.push(array[index] = 0);
+
+  for (var i = 0; i < len; i++) {
+    array[i] = array[i] + 1;
+
+    if (array[i] > 255) {
+      array[i] = 0;
     } else {
       break;
     }
   }
-  return results;
-};
+}
 
-convertLEBytesToString = function (buffer) {
-  var array, result, sign, t;
-  array = Array.prototype.slice.call(buffer, 0, buffer.length);
+module.exports.convertLEBytesToString = convertLEBytesToString;
+function convertLEBytesToString(buffer) {
+  var array = Array.prototype.slice.call(buffer, 0, buffer.length);
   if (isZero(array)) {
     return '0';
   } else {
+    var sign = undefined;
     if (array[array.length - 1] & 0x80) {
       sign = '-';
       invert(array);
     } else {
       sign = '';
     }
-    result = '';
+    var result = '';
     while (!isZero(array)) {
-      t = getNextRemainder(array);
+      var t = getNextRemainder(array);
       result = t + result;
     }
     return sign + result;
   }
-};
+}
 
-numberToInt64LE = function (num) {
-  var buf, carry, hi, i, j, k, lo, negate, v;
-  negate = num < 0;
-  hi = Math.abs(num);
-  lo = hi % 0x100000000;
+module.exports.numberToInt64LE = numberToInt64LE;
+function numberToInt64LE(num) {
+  // adapted from https://github.com/broofa/node-int64
+  var negate = num < 0;
+  var hi = Math.abs(num);
+  var lo = hi % 0x100000000;
   hi = hi / 0x100000000 | 0;
-  buf = new Buffer(8);
-  for (i = j = 0; j <= 7; i = ++j) {
+  var buf = new Buffer(8);
+  for (var i = 0; i <= 7; i++) {
     buf[i] = lo & 0xff;
     lo = i === 3 ? hi : lo >>> 8;
   }
   if (negate) {
-    carry = 1;
-    for (i = k = 0; k <= 7; i = ++k) {
-      v = (buf[i] ^ 0xff) + carry;
+    var carry = 1;
+    for (var i = 0; i <= 7; i++) {
+      var v = (buf[i] ^ 0xff) + carry;
       buf[i] = v & 0xff;
       carry = v >> 8;
     }
   }
   return buf;
-};
-
-module.exports.convertLEBytesToString = convertLEBytesToString;
-
-module.exports.numberToInt64LE = numberToInt64LE;
+}