ERROR: Unexpected token: keyword (const) #3275
Description
Bug report or feature request?
Uglify version (uglifyjs -V) 3.4.9
JavaScript input
(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
(function (Buffer){
const fs = require("fs");
const jints = require("jints");
const utils = require("./utils");
const vm = require("vm");
const INSTRUCTION_SET = [
"nop","addr","addm","subr","subm","mulr","mulm","divr","divm",
"andr","andm","orr","orm","xorr","xorm","norr","norm","nandr","nandm","lshiftr","lshiftm","rshiftr","rshiftm",
"cmpr","cmpm","jitr","jitm","jit","jmpr","jmpm","jmp","callr","callm","call","ret",
"pushr","pushm","popr","popm","movrr","movrm","movmr","movmm","stor","stom",
"intr","intm","int","iret","lditblr","lditblm","hlt"
];
const REGISTERS = (() => {
var r = ["flags","tmp","sp","ip","pc","cycle"];
var bigr = ["data","index","addr","ptr"];
for(var br of bigr) {
for(var i = 0;i < 10;i++) r.push(br+i);
}
return r;
})();
function compileOpcode(str,opts) {
if(str[0]+str[1] == "0x") return parseInt(str.slice(2),16);
if(str[0]+str[1] == "0b") return parseInt(str.slice(2),2);
if(str[0] == "%") {
str = str.replace("%","");
if(REGISTERS.indexOf(str) == -1) throw new Error("Invalid register "+str);
return REGISTERS.indexOf(str);
}
if(str[0] == "\'" && str[str.length-1] == "\'") {
if(str.length != 3 && str.length != 4) throw new Error("Failed to compile character");
if(str.length == 4 && str[1] != "\\") throw new Error("Failed to compile character");
if(str[1]) {
var sb = { result: str.slice(1,-1) };
vm.runInNewContext("result = \""+str+"\";",sb,"assembler.js");
str = sb.result;
}
if(str[0] == '\'' && str[str.length-1] == '\'') str = str.slice(1,-1);
return Buffer.from(str)[0];
}
return parseInt(str);
}
function compileLine(str,opts) {
str = str.split(", ",2).join(",").split(",",2).join(" ");
var opcodes = str.split(" ",3);
opcodes[0] = opcodes[0].toLowerCase();
var instr = [0,0,0];
if(INSTRUCTION_SET.indexOf(opcodes[0]) == -1) throw new Error("No instruction called \""+opcodes[0]+"\" exists");
instr[0] = new jints.UInt64(INSTRUCTION_SET.indexOf(opcodes[0]));
for(var i = 1;i < opcodes.length;i++) instr[i] = compileOpcode(opcodes[i],opts);
if(opts.verbose) console.log("Compiled Line: "+instr[0]+" "+instr[1]+", "+instr[2]);
for(var i = 0;i < instr.length;i++) {
if(!(instr[i] instanceof jints.UInt64)) instr[i] = new jints.UInt64(instr[i]);
}
for(var i = 0;i < instr.length;i++) instr[i] = instr[i].toArray();
var buff = Buffer.alloc(3*8);
var index = 0;
for(var i = 0;i < instr.length;i++) {
for(var x = 0;x < 8;x++) buff[index++] = instr[i][x];
}
return buff;
}
function compileString(str,opts) {
var lines = str.split("\n");
for(var i = 0;i < lines.length;i++) {
if(lines[i].length <= 1 || lines[i][0] == "#") lines.splice(i,1);
}
var instrs = Buffer.alloc((lines.length*3)*8);
instrs.fill(0);
var index = 0;
for(var line of lines) {
var instr = compileLine(line,opts);
for(var i = 0;i < 8*3;i++) instrs[index++] = instr[i];
}
return instrs;
}
function compileFile(path,opts) {
return compileString(fs.readFileSync(path).toString(),opts);
}
function compile(str,opts) {
if(!opts) opts = { verbose: false };
if(typeof(opts.verbose) == "undefined") opts.verbose = false;
var isFile = fs.existsSync(str);
if(isFile) return Buffer.from(compileFile(str,opts));
return Buffer.from(compileString(str,opts));
}
module.exports = compile;
}).call(this,require("buffer").Buffer)
},{"./utils":15,"buffer":9,"fs":8,"jints":12,"vm":14}],2:[function(require,module,exports){
module.exports = {
compile: require("./assembler"),
VirtualMachine: require("./vm")
};
},{"./assembler":1,"./vm":19}],3:[function(require,module,exports){
(function (global){
'use strict';
// compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js
// original notice:
/*!
* The buffer module from node.js, for the browser.
*
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
* @license MIT
*/
function compare(a, b) {
if (a === b) {
return 0;
}
var x = a.length;
var y = b.length;
for (var i = 0, len = Math.min(x, y); i < len; ++i) {
if (a[i] !== b[i]) {
x = a[i];
y = b[i];
break;
}
}
if (x < y) {
return -1;
}
if (y < x) {
return 1;
}
return 0;
}
function isBuffer(b) {
if (global.Buffer && typeof global.Buffer.isBuffer === 'function') {
return global.Buffer.isBuffer(b);
}
return !!(b != null && b._isBuffer);
}
// based on node assert, original notice:
// http://wiki.commonjs.org/wiki/Unit_Testing/1.0
//
// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!
//
// Originally from narwhal.js (http://narwhaljs.org)
// Copyright (c) 2009 Thomas Robinson <280north.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the 'Software'), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
var util = require('util/');
var hasOwn = Object.prototype.hasOwnProperty;
var pSlice = Array.prototype.slice;
var functionsHaveNames = (function () {
return function foo() {}.name === 'foo';
}());
function pToString (obj) {
return Object.prototype.toString.call(obj);
}
function isView(arrbuf) {
if (isBuffer(arrbuf)) {
return false;
}
if (typeof global.ArrayBuffer !== 'function') {
return false;
}
if (typeof ArrayBuffer.isView === 'function') {
return ArrayBuffer.isView(arrbuf);
}
if (!arrbuf) {
return false;
}
if (arrbuf instanceof DataView) {
return true;
}
if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) {
return true;
}
return false;
}
// 1. The assert module provides functions that throw
// AssertionError's when particular conditions are not met. The
// assert module must conform to the following interface.
var assert = module.exports = ok;
// 2. The AssertionError is defined in assert.
// new assert.AssertionError({ message: message,
// actual: actual,
// expected: expected })
var regex = /\s*function\s+([^\(\s]*)\s*/;
// based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js
function getName(func) {
if (!util.isFunction(func)) {
return;
}
if (functionsHaveNames) {
return func.name;
}
var str = func.toString();
var match = str.match(regex);
return match && match[1];
}
assert.AssertionError = function AssertionError(options) {
this.name = 'AssertionError';
this.actual = options.actual;
this.expected = options.expected;
this.operator = options.operator;
if (options.message) {
this.message = options.message;
this.generatedMessage = false;
} else {
this.message = getMessage(this);
this.generatedMessage = true;
}
var stackStartFunction = options.stackStartFunction || fail;
if (Error.captureStackTrace) {
Error.captureStackTrace(this, stackStartFunction);
} else {
// non v8 browsers so we can have a stacktrace
var err = new Error();
if (err.stack) {
var out = err.stack;
// try to strip useless frames
var fn_name = getName(stackStartFunction);
var idx = out.indexOf('\n' + fn_name);
if (idx >= 0) {
// once we have located the function frame
// we need to strip out everything before it (and its line)
var next_line = out.indexOf('\n', idx + 1);
out = out.substring(next_line + 1);
}
this.stack = out;
}
}
};
// assert.AssertionError instanceof Error
util.inherits(assert.AssertionError, Error);
function truncate(s, n) {
if (typeof s === 'string') {
return s.length < n ? s : s.slice(0, n);
} else {
return s;
}
}
function inspect(something) {
if (functionsHaveNames || !util.isFunction(something)) {
return util.inspect(something);
}
var rawname = getName(something);
var name = rawname ? ': ' + rawname : '';
return '[Function' + name + ']';
}
function getMessage(self) {
return truncate(inspect(self.actual), 128) + ' ' +
self.operator + ' ' +
truncate(inspect(self.expected), 128);
}
// At present only the three keys mentioned above are used and
// understood by the spec. Implementations or sub modules can pass
// other keys to the AssertionError's constructor - they will be
// ignored.
// 3. All of the following functions must throw an AssertionError
// when a corresponding condition is not met, with a message that
// may be undefined if not provided. All assertion methods provide
// both the actual and expected values to the assertion error for
// display purposes.
function fail(actual, expected, message, operator, stackStartFunction) {
throw new assert.AssertionError({
message: message,
actual: actual,
expected: expected,
operator: operator,
stackStartFunction: stackStartFunction
});
}
// EXTENSION! allows for well behaved errors defined elsewhere.
assert.fail = fail;
// 4. Pure assertion tests whether a value is truthy, as determined
// by !!guard.
// assert.ok(guard, message_opt);
// This statement is equivalent to assert.equal(true, !!guard,
// message_opt);. To test strictly for the value true, use
// assert.strictEqual(true, guard, message_opt);.
function ok(value, message) {
if (!value) fail(value, true, message, '==', assert.ok);
}
assert.ok = ok;
// 5. The equality assertion tests shallow, coercive equality with
// ==.
// assert.equal(actual, expected, message_opt);
assert.equal = function equal(actual, expected, message) {
if (actual != expected) fail(actual, expected, message, '==', assert.equal);
};
// 6. The non-equality assertion tests for whether two objects are not equal
// with != assert.notEqual(actual, expected, message_opt);
assert.notEqual = function notEqual(actual, expected, message) {
if (actual == expected) {
fail(actual, expected, message, '!=', assert.notEqual);
}
};
// 7. The equivalence assertion tests a deep equality relation.
// assert.deepEqual(actual, expected, message_opt);
assert.deepEqual = function deepEqual(actual, expected, message) {
if (!_deepEqual(actual, expected, false)) {
fail(actual, expected, message, 'deepEqual', assert.deepEqual);
}
};
assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {
if (!_deepEqual(actual, expected, true)) {
fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual);
}
};
function _deepEqual(actual, expected, strict, memos) {
// 7.1. All identical values are equivalent, as determined by ===.
if (actual === expected) {
return true;
} else if (isBuffer(actual) && isBuffer(expected)) {
return compare(actual, expected) === 0;
// 7.2. If the expected value is a Date object, the actual value is
// equivalent if it is also a Date object that refers to the same time.
} else if (util.isDate(actual) && util.isDate(expected)) {
return actual.getTime() === expected.getTime();
// 7.3 If the expected value is a RegExp object, the actual value is
// equivalent if it is also a RegExp object with the same source and
// properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
} else if (util.isRegExp(actual) && util.isRegExp(expected)) {
return actual.source === expected.source &&
actual.global === expected.global &&
actual.multiline === expected.multiline &&
actual.lastIndex === expected.lastIndex &&
actual.ignoreCase === expected.ignoreCase;
// 7.4. Other pairs that do not both pass typeof value == 'object',
// equivalence is determined by ==.
} else if ((actual === null || typeof actual !== 'object') &&
(expected === null || typeof expected !== 'object')) {
return strict ? actual === expected : actual == expected;
// If both values are instances of typed arrays, wrap their underlying
// ArrayBuffers in a Buffer each to increase performance
// This optimization requires the arrays to have the same type as checked by
// Object.prototype.toString (aka pToString). Never perform binary
// comparisons for Float*Arrays, though, since e.g. +0 === -0 but their
// bit patterns are not identical.
} else if (isView(actual) && isView(expected) &&
pToString(actual) === pToString(expected) &&
!(actual instanceof Float32Array ||
actual instanceof Float64Array)) {
return compare(new Uint8Array(actual.buffer),
new Uint8Array(expected.buffer)) === 0;
// 7.5 For all other Object pairs, including Array objects, equivalence is
// determined by having the same number of owned properties (as verified
// with Object.prototype.hasOwnProperty.call), the same set of keys
// (although not necessarily the same order), equivalent values for every
// corresponding key, and an identical 'prototype' property. Note: this
// accounts for both named and indexed properties on Arrays.
} else if (isBuffer(actual) !== isBuffer(expected)) {
return false;
} else {
memos = memos || {actual: [], expected: []};
var actualIndex = memos.actual.indexOf(actual);
if (actualIndex !== -1) {
if (actualIndex === memos.expected.indexOf(expected)) {
return true;
}
}
memos.actual.push(actual);
memos.expected.push(expected);
return objEquiv(actual, expected, strict, memos);
}
}
function isArguments(object) {
return Object.prototype.toString.call(object) == '[object Arguments]';
}
function objEquiv(a, b, strict, actualVisitedObjects) {
if (a === null || a === undefined || b === null || b === undefined)
return false;
// if one is a primitive, the other must be same
if (util.isPrimitive(a) || util.isPrimitive(b))
return a === b;
if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b))
return false;
var aIsArgs = isArguments(a);
var bIsArgs = isArguments(b);
if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
return false;
if (aIsArgs) {
a = pSlice.call(a);
b = pSlice.call(b);
return _deepEqual(a, b, strict);
}
var ka = objectKeys(a);
var kb = objectKeys(b);
var key, i;
// having the same number of owned properties (keys incorporates
// hasOwnProperty)
if (ka.length !== kb.length)
return false;
//the same set of keys (although not necessarily the same order),
ka.sort();
kb.sort();
//~~~cheap key test
for (i = ka.length - 1; i >= 0; i--) {
if (ka[i] !== kb[i])
return false;
}
//equivalent values for every corresponding key, and
//~~~possibly expensive deep test
for (i = ka.length - 1; i >= 0; i--) {
key = ka[i];
if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects))
return false;
}
return true;
}
// 8. The non-equivalence assertion tests for any deep inequality.
// assert.notDeepEqual(actual, expected, message_opt);
assert.notDeepEqual = function notDeepEqual(actual, expected, message) {
if (_deepEqual(actual, expected, false)) {
fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual);
}
};
assert.notDeepStrictEqual = notDeepStrictEqual;
function notDeepStrictEqual(actual, expected, message) {
if (_deepEqual(actual, expected, true)) {
fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual);
}
}
// 9. The strict equality assertion tests strict equality, as determined by ===.
// assert.strictEqual(actual, expected, message_opt);
assert.strictEqual = function strictEqual(actual, expected, message) {
if (actual !== expected) {
fail(actual, expected, message, '===', assert.strictEqual);
}
};
// 10. The strict non-equality assertion tests for strict inequality, as
// determined by !==. assert.notStrictEqual(actual, expected, message_opt);
assert.notStrictEqual = function notStrictEqual(actual, expected, message) {
if (actual === expected) {
fail(actual, expected, message, '!==', assert.notStrictEqual);
}
};
function expectedException(actual, expected) {
if (!actual || !expected) {
return false;
}
if (Object.prototype.toString.call(expected) == '[object RegExp]') {
return expected.test(actual);
}
try {
if (actual instanceof expected) {
return true;
}
} catch (e) {
// Ignore. The instanceof check doesn't work for arrow functions.
}
if (Error.isPrototypeOf(expected)) {
return false;
}
return expected.call({}, actual) === true;
}
function _tryBlock(block) {
var error;
try {
block();
} catch (e) {
error = e;
}
return error;
}
function _throws(shouldThrow, block, expected, message) {
var actual;
if (typeof block !== 'function') {
throw new TypeError('"block" argument must be a function');
}
if (typeof expected === 'string') {
message = expected;
expected = null;
}
actual = _tryBlock(block);
message = (expected && expected.name ? ' (' + expected.name + ').' : '.') +
(message ? ' ' + message : '.');
if (shouldThrow && !actual) {
fail(actual, expected, 'Missing expected exception' + message);
}
var userProvidedMessage = typeof message === 'string';
var isUnwantedException = !shouldThrow && util.isError(actual);
var isUnexpectedException = !shouldThrow && actual && !expected;
if ((isUnwantedException &&
userProvidedMessage &&
expectedException(actual, expected)) ||
isUnexpectedException) {
fail(actual, expected, 'Got unwanted exception' + message);
}
if ((shouldThrow && actual && expected &&
!expectedException(actual, expected)) || (!shouldThrow && actual)) {
throw actual;
}
}
// 11. Expected to throw an error:
// assert.throws(block, Error_opt, message_opt);
assert.throws = function(block, /*optional*/error, /*optional*/message) {
_throws(true, block, error, message);
};
// EXTENSION! This is annoying to write outside this module.
assert.doesNotThrow = function(block, /*optional*/error, /*optional*/message) {
_throws(false, block, error, message);
};
assert.ifError = function(err) { if (err) throw err; };
var objectKeys = Object.keys || function (obj) {
var keys = [];
for (var key in obj) {
if (hasOwn.call(obj, key)) keys.push(key);
}
return keys;
};
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
},{"util/":6}],4:[function(require,module,exports){
if (typeof Object.create === 'function') {
// implementation from standard node.js 'util' module
module.exports = function inherits(ctor, superCtor) {
ctor.super_ = superCtor
ctor.prototype = Object.create(superCtor.prototype, {
constructor: {
value: ctor,
enumerable: false,
writable: true,
configurable: true
}
});
};
} else {
// old school shim for old browsers
module.exports = function inherits(ctor, superCtor) {
ctor.super_ = superCtor
var TempCtor = function () {}
TempCtor.prototype = superCtor.prototype
ctor.prototype = new TempCtor()
ctor.prototype.constructor = ctor
}
}
},{}],5:[function(require,module,exports){
module.exports = function isBuffer(arg) {
return arg && typeof arg === 'object'
&& typeof arg.copy === 'function'
&& typeof arg.fill === 'function'
&& typeof arg.readUInt8 === 'function';
}
},{}],6:[function(require,module,exports){
(function (process,global){
// Copyright Joyent, Inc. and other Node contributors.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to permit
// persons to whom the Software is furnished to do so, subject to the
// following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
// USE OR OTHER DEALINGS IN THE SOFTWARE.
var formatRegExp = /%[sdj%]/g;
exports.format = function(f) {
if (!isString(f)) {
var objects = [];
for (var i = 0; i < arguments.length; i++) {
objects.push(inspect(arguments[i]));
}
return objects.join(' ');
}
var i = 1;
var args = arguments;
var len = args.length;
var str = String(f).replace(formatRegExp, function(x) {
if (x === '%%') return '%';
if (i >= len) return x;
switch (x) {
case '%s': return String(args[i++]);
case '%d': return Number(args[i++]);
case '%j':
try {
return JSON.stringify(args[i++]);
} catch (_) {
return '[Circular]';
}
default:
return x;
}
});
for (var x = args[i]; i < len; x = args[++i]) {
if (isNull(x) || !isObject(x)) {
str += ' ' + x;
} else {
str += ' ' + inspect(x);
}
}
return str;
};
// Mark that a method should not be used.
// Returns a modified function which warns once by default.
// If --no-deprecation is set, then it is a no-op.
exports.deprecate = function(fn, msg) {
// Allow for deprecating things in the process of starting up.
if (isUndefined(global.process)) {
return function() {
return exports.deprecate(fn, msg).apply(this, arguments);
};
}
if (process.noDeprecation === true) {
return fn;
}
var warned = false;
function deprecated() {
if (!warned) {
if (process.throwDeprecation) {
throw new Error(msg);
} else if (process.traceDeprecation) {
console.trace(msg);
} else {
console.error(msg);
}
warned = true;
}
return fn.apply(this, arguments);
}
return deprecated;
};
var debugs = {};
var debugEnviron;
exports.debuglog = function(set) {
if (isUndefined(debugEnviron))
debugEnviron = process.env.NODE_DEBUG || '';
set = set.toUpperCase();
if (!debugs[set]) {
if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
var pid = process.pid;
debugs[set] = function() {
var msg = exports.format.apply(exports, arguments);
console.error('%s %d: %s', set, pid, msg);
};
} else {
debugs[set] = function() {};
}
}
return debugs[set];
};
/**
* Echos the value of a value. Trys to print the value out
* in the best way possible given the different types.
*
* @param {Object} obj The object to print out.
* @param {Object} opts Optional options object that alters the output.
*/
/* legacy: obj, showHidden, depth, colors*/
function inspect(obj, opts) {
// default options
var ctx = {
seen: [],
stylize: stylizeNoColor
};
// legacy...
if (arguments.length >= 3) ctx.depth = arguments[2];
if (arguments.length >= 4) ctx.colors = arguments[3];
if (isBoolean(opts)) {
// legacy...
ctx.showHidden = opts;
} else if (opts) {
// got an "options" object
exports._extend(ctx, opts);
}
// set default options
if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
if (isUndefined(ctx.depth)) ctx.depth = 2;
if (isUndefined(ctx.colors)) ctx.colors = false;
if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
if (ctx.colors) ctx.stylize = stylizeWithColor;
return formatValue(ctx, obj, ctx.depth);
}
exports.inspect = inspect;
// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
inspect.colors = {
'bold' : [1, 22],
'italic' : [3, 23],
'underline' : [4, 24],
'inverse' : [7, 27],
'white' : [37, 39],
'grey' : [90, 39],
'black' : [30, 39],
'blue' : [34, 39],
'cyan' : [36, 39],
'green' : [32, 39],
'magenta' : [35, 39],
'red' : [31, 39],
'yellow' : [33, 39]
};
// Don't use 'blue' not visible on cmd.exe
inspect.styles = {
'special': 'cyan',
'number': 'yellow',
'boolean': 'yellow',
'undefined': 'grey',
'null': 'bold',
'string': 'green',
'date': 'magenta',
// "name": intentionally not styling
'regexp': 'red'
};
function stylizeWithColor(str, styleType) {
var style = inspect.styles[styleType];
if (style) {
return '\u001b[' + inspect.colors[style][0] + 'm' + str +
'\u001b[' + inspect.colors[style][1] + 'm';
} else {
return str;
}
}
function stylizeNoColor(str, styleType) {
return str;
}
function arrayToHash(array) {
var hash = {};
array.forEach(function(val, idx) {
hash[val] = true;
});
return hash;
}
function formatValue(ctx, value, recurseTimes) {
// Provide a hook for user-specified inspect functions.
// Check that value is an object with an inspect function on it
if (ctx.customInspect &&
value &&
isFunction(value.inspect) &&
// Filter out the util module, it's inspect function is special
value.inspect !== exports.inspect &&
// Also filter out any prototype objects using the circular check.
!(value.constructor && value.constructor.prototype === value)) {
var ret = value.inspect(recurseTimes, ctx);
if (!isString(ret)) {
ret = formatValue(ctx, ret, recurseTimes);
}
return ret;
}
// Primitive types cannot have properties
var primitive = formatPrimitive(ctx, value);
if (primitive) {
return primitive;
}
// Look up the keys of the object.
var keys = Object.keys(value);
var visibleKeys = arrayToHash(keys);
if (ctx.showHidden) {
keys = Object.getOwnPropertyNames(value);
}
// IE doesn't make error fields non-enumerable
// http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
if (isError(value)
&& (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
return formatError(value);
}
// Some type of object without properties can be shortcutted.
if (keys.length === 0) {
if (isFunction(value)) {
var name = value.name ? ': ' + value.name : '';
return ctx.stylize('[Function' + name + ']', 'special');
}
if (isRegExp(value)) {
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
}
if (isDate(value)) {
return ctx.stylize(Date.prototype.toString.call(value), 'date');
}
if (isError(value)) {
return formatError(value);
}
}
var base = '', array = false, braces = ['{', '}'];
// Make Array say that they are Array
if (isArray(value)) {
array = true;
braces = ['[', ']'];
}
// Make functions say that they are functions
if (isFunction(value)) {
var n = value.name ? ': ' + value.name : '';
base = ' [Function' + n + ']';
}
// Make RegExps say that they are RegExps
if (isRegExp(value)) {
base = ' ' + RegExp.prototype.toString.call(value);
}
// Make dates with properties first say the date
if (isDate(value)) {
base = ' ' + Date.prototype.toUTCString.call(value);
}
// Make error with message first say the error
if (isError(value)) {
base = ' ' + formatError(value);
}
if (keys.length === 0 && (!array || value.length == 0)) {
return braces[0] + base + braces[1];
}
if (recurseTimes < 0) {
if (isRegExp(value)) {
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
} else {
return ctx.stylize('[Object]', 'special');
}
}
ctx.seen.push(value);
var output;
if (array) {
output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
} else {
output = keys.map(function(key) {
return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
});
}
ctx.seen.pop();
return reduceToSingleString(output, base, braces);
}
function formatPrimitive(ctx, value) {
if (isUndefined(value))
return ctx.stylize('undefined', 'undefined');
if (isString(value)) {
var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
.replace(/'/g, "\\'")
.replace(/\\"/g, '"') + '\'';
return ctx.stylize(simple, 'string');
}
if (isNumber(value))
return ctx.stylize('' + value, 'number');
if (isBoolean(value))
return ctx.stylize('' + value, 'boolean');
// For some reason typeof null is "object", so special case here.
if (isNull(value))
return ctx.stylize('null', 'null');
}
function formatError(value) {
return '[' + Error.prototype.toString.call(value) + ']';
}
function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
var output = [];
for (var i = 0, l = value.length; i < l; ++i) {
if (hasOwnProperty(value, String(i))) {
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
String(i), true));
} else {
output.push('');
}
}
keys.forEach(function(key) {
if (!key.match(/^\d+$/)) {
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
key, true));
}
});
return output;
}
function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
var name, str, desc;
desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
if (desc.get) {
if (desc.set) {
str = ctx.stylize('[Getter/Setter]', 'special');
} else {
str = ctx.stylize('[Getter]', 'special');
}
} else {
if (desc.set) {
str = ctx.stylize('[Setter]', 'special');
}
}
if (!hasOwnProperty(visibleKeys, key)) {
name = '[' + key + ']';
}
if (!str) {
if (ctx.seen.indexOf(desc.value) < 0) {
if (isNull(recurseTimes)) {
str = formatValue(ctx, desc.value, null);
} else {
str = formatValue(ctx, desc.value, recurseTimes - 1);
}
if (str.indexOf('\n') > -1) {
if (array) {
str = str.split('\n').map(function(line) {
return ' ' + line;
}).join('\n').substr(2);
} else {
str = '\n' + str.split('\n').map(function(line) {
return ' ' + line;
}).join('\n');
}
}
} else {
str = ctx.stylize('[Circular]', 'special');
}
}
if (isUndefined(name)) {
if (array && key.match(/^\d+$/)) {
return str;
}
name = JSON.stringify('' + key);
if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
name = name.substr(1, name.length - 2);
name = ctx.stylize(name, 'name');
} else {
name = name.replace(/'/g, "\\'")
.replace(/\\"/g, '"')
.replace(/(^"|"$)/g, "'");
name = ctx.stylize(name, 'string');
}
}
return name + ': ' + str;
}
function reduceToSingleString(output, base, braces) {
var numLinesEst = 0;
var length = output.reduce(function(prev, cur) {
numLinesEst++;
if (cur.indexOf('\n') >= 0) numLinesEst++;
return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
}, 0);
if (length > 60) {
return braces[0] +
(base === '' ? '' : base + '\n ') +
' ' +
output.join(',\n ') +
' ' +
braces[1];
}
return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
}
// NOTE: These type checking functions intentionally don't use `instanceof`
// because it is fragile and can be easily faked with `Object.create()`.
function isArray(ar) {
return Array.isArray(ar);
}
exports.isArray = isArray;
function isBoolean(arg) {
return typeof arg === 'boolean';
}
exports.isBoolean = isBoolean;
function isNull(arg) {
return arg === null;
}
exports.isNull = isNull;
function isNullOrUndefined(arg) {
return arg == null;
}
exports.isNullOrUndefined = isNullOrUndefined;
function isNumber(arg) {
return typeof arg === 'number';
}
exports.isNumber = isNumber;
function isString(arg) {
return typeof arg === 'string';
}
exports.isString = isString;
function isSymbol(arg) {
return typeof arg === 'symbol';
}
exports.isSymbol = isSymbol;
function isUndefined(arg) {
return arg === void 0;
}
exports.isUndefined = isUndefined;
function isRegExp(re) {
return isObject(re) && objectToString(re) === '[object RegExp]';
}
exports.isRegExp = isRegExp;
function isObject(arg) {
return typeof arg === 'object' && arg !== null;
}
exports.isObject = isObject;
function isDate(d) {
return isObject(d) && objectToString(d) === '[object Date]';
}
exports.isDate = isDate;
function isError(e) {
return isObject(e) &&
(objectToString(e) === '[object Error]' || e instanceof Error);
}
exports.isError = isError;
function isFunction(arg) {
return typeof arg === 'function';
}
exports.isFunction = isFunction;
function isPrimitive(arg) {
return arg === null ||
typeof arg === 'boolean' ||
typeof arg === 'number' ||
typeof arg === 'string' ||
typeof arg === 'symbol' || // ES6 symbol
typeof arg === 'undefined';
}
exports.isPrimitive = isPrimitive;
exports.isBuffer = require('./support/isBuffer');
function objectToString(o) {
return Object.prototype.toString.call(o);
}
function pad(n) {
return n < 10 ? '0' + n.toString(10) : n.toString(10);
}
var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
'Oct', 'Nov', 'Dec'];
// 26 Feb 16:19:34
function timestamp() {
var d = new Date();
var time = [pad(d.getHours()),
pad(d.getMinutes()),
pad(d.getSeconds())].join(':');
return [d.getDate(), months[d.getMonth()], time].join(' ');
}
// log is just a thin wrapper to console.log that prepends a timestamp
exports.log = function() {
console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
};
/**
* Inherit the prototype methods from one constructor into another.
*
* The Function.prototype.inherits from lang.js rewritten as a standalone
* function (not on Function.prototype). NOTE: If this file is to be loaded
* during bootstrapping this function needs to be rewritten using some native
* functions as prototype setup using normal JavaScript does not work as
* expected during bootstrapping (see mirror.js in r114903).
*
* @param {function} ctor Constructor function which needs to inherit the
* prototype.
* @param {function} superCtor Constructor function to inherit prototype from.
*/
exports.inherits = require('inherits');
exports._extend = function(origin, add) {
// Don't do anything if add isn't an object
if (!add || !isObject(add)) return origin;
var keys = Object.keys(add);
var i = keys.length;
while (i--) {
origin[keys[i]] = add[keys[i]];
}
return origin;
};
function hasOwnProperty(obj, prop) {
return Object.prototype.hasOwnProperty.call(obj, prop);
}
}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
},{"./support/isBuffer":5,"_process":13,"inherits":4}],7:[function(require,module,exports){
'use strict'
exports.byteLength = byteLength
exports.toByteArray = toByteArray
exports.fromByteArray = fromByteArray
var lookup = []
var revLookup = []
var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array
var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'
for (var i = 0, len = code.length; i < len; ++i) {
lookup[i] = code[i]
revLookup[code.charCodeAt(i)] = i
}
// Support decoding URL-safe base64 strings, as Node.js does.
// See: https://en.wikipedia.org/wiki/Base64#URL_applications
revLookup['-'.charCodeAt(0)] = 62
revLookup['_'.charCodeAt(0)] = 63
function getLens (b64) {
var len = b64.length
if (len % 4 > 0) {
throw new Error('Invalid string. Length must be a multiple of 4')
}
// Trim off extra bytes after placeholder bytes are found
// See: https://github.com/beatgammit/base64-js/issues/42
var validLen = b64.indexOf('=')
if (validLen === -1) validLen = len
var placeHoldersLen = validLen === len
? 0
: 4 - (validLen % 4)
return [validLen, placeHoldersLen]
}
// base64 is 4/3 + up to two characters of the original data
function byteLength (b64) {
var lens = getLens(b64)
var validLen = lens[0]
var placeHoldersLen = lens[1]
return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen
}
function _byteLength (b64, validLen, placeHoldersLen) {
return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen
}
function toByteArray (b64) {
var tmp
var lens = getLens(b64)
var validLen = lens[0]
var placeHoldersLen = lens[1]
var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))
var curByte = 0
// if there are placeholders, only get up to the last complete 4 chars
var len = placeHoldersLen > 0
? validLen - 4
: validLen
for (var i = 0; i < len; i += 4) {
tmp =
(revLookup[b64.charCodeAt(i)] << 18) |
(revLookup[b64.charCodeAt(i + 1)] << 12) |
(revLookup[b64.charCodeAt(i + 2)] << 6) |
revLookup[b64.charCodeAt(i + 3)]
arr[curByte++] = (tmp >> 16) & 0xFF
arr[curByte++] = (tmp >> 8) & 0xFF
arr[curByte++] = tmp & 0xFF
}
if (placeHoldersLen === 2) {
tmp =
(revLookup[b64.charCodeAt(i)] << 2) |
(revLookup[b64.charCodeAt(i + 1)] >> 4)
arr[curByte++] = tmp & 0xFF
}
if (placeHoldersLen === 1) {
tmp =
(revLookup[b64.charCodeAt(i)] << 10) |
(revLookup[b64.charCodeAt(i + 1)] << 4) |
(revLookup[b64.charCodeAt(i + 2)] >> 2)
arr[curByte++] = (tmp >> 8) & 0xFF
arr[curByte++] = tmp & 0xFF
}
return arr
}
function tripletToBase64 (num) {
return lookup[num >> 18 & 0x3F] +
lookup[num >> 12 & 0x3F] +
lookup[num >> 6 & 0x3F] +
lookup[num & 0x3F]
}
function encodeChunk (uint8, start, end) {
var tmp
var output = []
for (var i = start; i < end; i += 3) {
tmp =
((uint8[i] << 16) & 0xFF0000) +
((uint8[i + 1] << 8) & 0xFF00) +
(uint8[i + 2] & 0xFF)
output.push(tripletToBase64(tmp))
}
return output.join('')
}
function fromByteArray (uint8) {
var tmp
var len = uint8.length
var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes
var parts = []
var maxChunkLength = 16383 // must be multiple of 3
// go through the array every three bytes, we'll deal with trailing stuff later
for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
parts.push(encodeChunk(
uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)
))
}
// pad the end with zeros, but make sure to not forget the extra bytes
if (extraBytes === 1) {
tmp = uint8[len - 1]
parts.push(
lookup[tmp >> 2] +
lookup[(tmp << 4) & 0x3F] +
'=='
)
} else if (extraBytes === 2) {
tmp = (uint8[len - 2] << 8) + uint8[len - 1]
parts.push(
lookup[tmp >> 10] +
lookup[(tmp >> 4) & 0x3F] +
lookup[(tmp << 2) & 0x3F] +
'='
)
}
return parts.join('')
}
},{}],8:[function(require,module,exports){
},{}],9:[function(require,module,exports){
/*!
* The buffer module from node.js, for the browser.
*
* @author Feross Aboukhadijeh <https://feross.org>
* @license MIT
*/
/* eslint-disable no-proto */
'use strict'
var base64 = require('base64-js')
var ieee754 = require('ieee754')
exports.Buffer = Buffer
exports.SlowBuffer = SlowBuffer
exports.INSPECT_MAX_BYTES = 50
var K_MAX_LENGTH = 0x7fffffff
exports.kMaxLength = K_MAX_LENGTH
/**
* If `Buffer.TYPED_ARRAY_SUPPORT`:
* === true Use Uint8Array implementation (fastest)
* === false Print warning and recommend using `buffer` v4.x which has an Object
* implementation (most compatible, even IE6)
*
* Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
* Opera 11.6+, iOS 4.2+.
*
* We report that the browser does not support typed arrays if the are not subclassable
* using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`
* (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support
* for __proto__ and has a buggy typed array implementation.
*/
Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport()
if (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&
typeof console.error === 'function') {
console.error(
'This browser lacks typed array (Uint8Array) support which is required by ' +
'`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'
)
}
function typedArraySupport () {
// Can typed array instances can be augmented?
try {
var arr = new Uint8Array(1)
arr.__proto__ = { __proto__: Uint8Array.prototype, foo: function () { return 42 } }
return arr.foo() === 42
} catch (e) {
return false
}
}
Object.defineProperty(Buffer.prototype, 'parent', {
enumerable: true,
get: function () {
if (!Buffer.isBuffer(this)) return undefined
return this.buffer
}
})
Object.defineProperty(Buffer.prototype, 'offset', {
enumerable: true,
get: function () {
if (!Buffer.isBuffer(this)) return undefined
return this.byteOffset
}
})
function createBuffer (length) {
if (length > K_MAX_LENGTH) {
throw new RangeError('The value "' + length + '" is invalid for option "size"')
}
// Return an augmented `Uint8Array` instance
var buf = new Uint8Array(length)
buf.__proto__ = Buffer.prototype
return buf
}
/**
* The Buffer constructor returns instances of `Uint8Array` that have their
* prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
* `Uint8Array`, so the returned instances will have all the node `Buffer` methods
* and the `Uint8Array` methods. Square bracket notation works as expected -- it
* returns a single octet.
*
* The `Uint8Array` prototype remains unmodified.
*/
function Buffer (arg, encodingOrOffset, length) {
// Common case.
if (typeof arg === 'number') {
if (typeof encodingOrOffset === 'string') {
throw new TypeError(
'The "string" argument must be of type string. Received type number'
)
}
return allocUnsafe(arg)
}
return from(arg, encodingOrOffset, length)
}
// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97
if (typeof Symbol !== 'undefined' && Symbol.species != null &&
Buffer[Symbol.species] === Buffer) {
Object.defineProperty(Buffer, Symbol.species, {
value: null,
configurable: true,
enumerable: false,
writable: false
})
}
Buffer.poolSize = 8192 // not used by this implementation
function from (value, encodingOrOffset, length) {
if (typeof value === 'string') {
return fromString(value, encodingOrOffset)
}
if (ArrayBuffer.isView(value)) {
return fromArrayLike(value)
}
if (value == null) {
throw TypeError(
'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
'or Array-like Object. Received type ' + (typeof value)
)
}
if (isInstance(value, ArrayBuffer) ||
(value && isInstance(value.buffer, ArrayBuffer))) {
return fromArrayBuffer(value, encodingOrOffset, length)
}
if (typeof value === 'number') {
throw new TypeError(
'The "value" argument must not be of type number. Received type number'
)
}
var valueOf = value.valueOf && value.valueOf()
if (valueOf != null && valueOf !== value) {
return Buffer.from(valueOf, encodingOrOffset, length)
}
var b = fromObject(value)
if (b) return b
if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&
typeof value[Symbol.toPrimitive] === 'function') {
return Buffer.from(
value[Symbol.toPrimitive]('string'), encodingOrOffset, length
)
}
throw new TypeError(
'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
'or Array-like Object. Received type ' + (typeof value)
)
}
/**
* Functionally equivalent to Buffer(arg, encoding) but throws a TypeError
* if value is a number.
* Buffer.from(str[, encoding])
* Buffer.from(array)
* Buffer.from(buffer)
* Buffer.from(arrayBuffer[, byteOffset[, length]])
**/
Buffer.from = function (value, encodingOrOffset, length) {
return from(value, encodingOrOffset, length)
}
// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:
// https://github.com/feross/buffer/pull/148
Buffer.prototype.__proto__ = Uint8Array.prototype
Buffer.__proto__ = Uint8Array
function assertSize (size) {
if (typeof size !== 'number') {
throw new TypeError('"size" argument must be of type number')
} else if (size < 0) {
throw new RangeError('The value "' + size + '" is invalid for option "size"')
}
}
function alloc (size, fill, encoding) {
assertSize(size)
if (size <= 0) {
return createBuffer(size)
}
if (fill !== undefined) {
// Only pay attention to encoding if it's a string. This
// prevents accidentally sending in a number that would
// be interpretted as a start offset.
return typeof encoding === 'string'
? createBuffer(size).fill(fill, encoding)
: createBuffer(size).fill(fill)
}
return createBuffer(size)
}
/**
* Creates a new filled Buffer instance.
* alloc(size[, fill[, encoding]])
**/
Buffer.alloc = function (size, fill, encoding) {
return alloc(size, fill, encoding)
}
function allocUnsafe (size) {
assertSize(size)
return createBuffer(size < 0 ? 0 : checked(size) | 0)
}
/**
* Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
* */
Buffer.allocUnsafe = function (size) {
return allocUnsafe(size)
}
/**
* Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
*/
Buffer.allocUnsafeSlow = function (size) {
return allocUnsafe(size)
}
function fromString (string, encoding) {
if (typeof encoding !== 'string' || encoding === '') {
encoding = 'utf8'
}
if (!Buffer.isEncoding(encoding)) {
throw new TypeError('Unknown encoding: ' + encoding)
}
var length = byteLength(string, encoding) | 0
var buf = createBuffer(length)
var actual = buf.write(string, encoding)
if (actual !== length) {
// Writing a hex string, for example, that contains invalid characters will
// cause everything after the first invalid character to be ignored. (e.g.
// 'abxxcd' will be treated as 'ab')
buf = buf.slice(0, actual)
}
return buf
}
function fromArrayLike (array) {
var length = array.length < 0 ? 0 : checked(array.length) | 0
var buf = createBuffer(length)
for (var i = 0; i < length; i += 1) {
buf[i] = array[i] & 255
}
return buf
}
function fromArrayBuffer (array, byteOffset, length) {
if (byteOffset < 0 || array.byteLength < byteOffset) {
throw new RangeError('"offset" is outside of buffer bounds')
}
if (array.byteLength < byteOffset + (length || 0)) {
throw new RangeError('"length" is outside of buffer bounds')
}
var buf
if (byteOffset === undefined && length === undefined) {
buf = new Uint8Array(array)
} else if (length === undefined) {
buf = new Uint8Array(array, byteOffset)
} else {
buf = new Uint8Array(array, byteOffset, length)
}
// Return an augmented `Uint8Array` instance
buf.__proto__ = Buffer.prototype
return buf
}
function fromObject (obj) {
if (Buffer.isBuffer(obj)) {
var len = checked(obj.length) | 0
var buf = createBuffer(len)
if (buf.length === 0) {
return buf
}
obj.copy(buf, 0, 0, len)
return buf
}
if (obj.length !== undefined) {
if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {
return createBuffer(0)
}
return fromArrayLike(obj)
}
if (obj.type === 'Buffer' && Array.isArray(obj.data)) {
return fromArrayLike(obj.data)
}
}
function checked (length) {
// Note: cannot use `length < K_MAX_LENGTH` here because that fails when
// length is NaN (which is otherwise coerced to zero.)
if (length >= K_MAX_LENGTH) {
throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')
}
return length | 0
}
function SlowBuffer (length) {
if (+length != length) { // eslint-disable-line eqeqeq
length = 0
}
return Buffer.alloc(+length)
}
Buffer.isBuffer = function isBuffer (b) {
return b != null && b._isBuffer === true &&
b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false
}
Buffer.compare = function compare (a, b) {
if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)
if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {
throw new TypeError(
'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
)
}
if (a === b) return 0
var x = a.length
var y = b.length
for (var i = 0, len = Math.min(x, y); i < len; ++i) {
if (a[i] !== b[i]) {
x = a[i]
y = b[i]
break
}
}
if (x < y) return -1
if (y < x) return 1
return 0
}
Buffer.isEncoding = function isEncoding (encoding) {
switch (String(encoding).toLowerCase()) {
case 'hex':
case 'utf8':
case 'utf-8':
case 'ascii':
case 'latin1':
case 'binary':
case 'base64':
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
return true
default:
return false
}
}
Buffer.concat = function concat (list, length) {
if (!Array.isArray(list)) {
throw new TypeError('"list" argument must be an Array of Buffers')
}
if (list.length === 0) {
return Buffer.alloc(0)
}
var i
if (length === undefined) {
length = 0
for (i = 0; i < list.length; ++i) {
length += list[i].length
}
}
var buffer = Buffer.allocUnsafe(length)
var pos = 0
for (i = 0; i < list.length; ++i) {
var buf = list[i]
if (isInstance(buf, Uint8Array)) {
buf = Buffer.from(buf)
}
if (!Buffer.isBuffer(buf)) {
throw new TypeError('"list" argument must be an Array of Buffers')
}
buf.copy(buffer, pos)
pos += buf.length
}
return buffer
}
function byteLength (string, encoding) {
if (Buffer.isBuffer(string)) {
return string.length
}
if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {
return string.byteLength
}
if (typeof string !== 'string') {
throw new TypeError(
'The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' +
'Received type ' + typeof string
)
}
var len = string.length
var mustMatch = (arguments.length > 2 && arguments[2] === true)
if (!mustMatch && len === 0) return 0
// Use a for loop to avoid recursion
var loweredCase = false
for (;;) {
switch (encoding) {
case 'ascii':
case 'latin1':
case 'binary':
return len
case 'utf8':
case 'utf-8':
return utf8ToBytes(string).length
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
return len * 2
case 'hex':
return len >>> 1
case 'base64':
return base64ToBytes(string).length
default:
if (loweredCase) {
return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8
}
encoding = ('' + encoding).toLowerCase()
loweredCase = true
}
}
}
Buffer.byteLength = byteLength
function slowToString (encoding, start, end) {
var loweredCase = false
// No need to verify that "this.length <= MAX_UINT32" since it's a read-only
// property of a typed array.
// This behaves neither like String nor Uint8Array in that we set start/end
// to their upper/lower bounds if the value passed is out of range.
// undefined is handled specially as per ECMA-262 6th Edition,
// Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.
if (start === undefined || start < 0) {
start = 0
}
// Return early if start > this.length. Done here to prevent potential uint32
// coercion fail below.
if (start > this.length) {
return ''
}
if (end === undefined || end > this.length) {
end = this.length
}
if (end <= 0) {
return ''
}
// Force coersion to uint32. This will also coerce falsey/NaN values to 0.
end >>>= 0
start >>>= 0
if (end <= start) {
return ''
}
if (!encoding) encoding = 'utf8'
while (true) {
switch (encoding) {
case 'hex':
return hexSlice(this, start, end)
case 'utf8':
case 'utf-8':
return utf8Slice(this, start, end)
case 'ascii':
return asciiSlice(this, start, end)
case 'latin1':
case 'binary':
return latin1Slice(this, start, end)
case 'base64':
return base64Slice(this, start, end)
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
return utf16leSlice(this, start, end)
default:
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
encoding = (encoding + '').toLowerCase()
loweredCase = true
}
}
}
// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)
// to detect a Buffer instance. It's not possible to use `instanceof Buffer`
// reliably in a browserify context because there could be multiple different
// copies of the 'buffer' package in use. This method works even for Buffer
// instances that were created from another copy of the `buffer` package.
// See: https://github.com/feross/buffer/issues/154
Buffer.prototype._isBuffer = true
function swap (b, n, m) {
var i = b[n]
b[n] = b[m]
b[m] = i
}
Buffer.prototype.swap16 = function swap16 () {
var len = this.length
if (len % 2 !== 0) {
throw new RangeError('Buffer size must be a multiple of 16-bits')
}
for (var i = 0; i < len; i += 2) {
swap(this, i, i + 1)
}
return this
}
Buffer.prototype.swap32 = function swap32 () {
var len = this.length
if (len % 4 !== 0) {
throw new RangeError('Buffer size must be a multiple of 32-bits')
}
for (var i = 0; i < len; i += 4) {
swap(this, i, i + 3)
swap(this, i + 1, i + 2)
}
return this
}
Buffer.prototype.swap64 = function swap64 () {
var len = this.length
if (len % 8 !== 0) {
throw new RangeError('Buffer size must be a multiple of 64-bits')
}
for (var i = 0; i < len; i += 8) {
swap(this, i, i + 7)
swap(this, i + 1, i + 6)
swap(this, i + 2, i + 5)
swap(this, i + 3, i + 4)
}
return this
}
Buffer.prototype.toString = function toString () {
var length = this.length
if (length === 0) return ''
if (arguments.length === 0) return utf8Slice(this, 0, length)
return slowToString.apply(this, arguments)
}
Buffer.prototype.toLocaleString = Buffer.prototype.toString
Buffer.prototype.equals = function equals (b) {
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
if (this === b) return true
return Buffer.compare(this, b) === 0
}
Buffer.prototype.inspect = function inspect () {
var str = ''
var max = exports.INSPECT_MAX_BYTES
str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()
if (this.length > max) str += ' ... '
return '<Buffer ' + str + '>'
}
Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
if (isInstance(target, Uint8Array)) {
target = Buffer.from(target, target.offset, target.byteLength)
}
if (!Buffer.isBuffer(target)) {
throw new TypeError(
'The "target" argument must be one of type Buffer or Uint8Array. ' +
'Received type ' + (typeof target)
)
}
if (start === undefined) {
start = 0
}
if (end === undefined) {
end = target ? target.length : 0
}
if (thisStart === undefined) {
thisStart = 0
}
if (thisEnd === undefined) {
thisEnd = this.length
}
if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {
throw new RangeError('out of range index')
}
if (thisStart >= thisEnd && start >= end) {
return 0
}
if (thisStart >= thisEnd) {
return -1
}
if (start >= end) {
return 1
}
start >>>= 0
end >>>= 0
thisStart >>>= 0
thisEnd >>>= 0
if (this === target) return 0
var x = thisEnd - thisStart
var y = end - start
var len = Math.min(x, y)
var thisCopy = this.slice(thisStart, thisEnd)
var targetCopy = target.slice(start, end)
for (var i = 0; i < len; ++i) {
if (thisCopy[i] !== targetCopy[i]) {
x = thisCopy[i]
y = targetCopy[i]
break
}
}
if (x < y) return -1
if (y < x) return 1
return 0
}
// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,
// OR the last index of `val` in `buffer` at offset <= `byteOffset`.
//
// Arguments:
// - buffer - a Buffer to search
// - val - a string, Buffer, or number
// - byteOffset - an index into `buffer`; will be clamped to an int32
// - encoding - an optional encoding, relevant is val is a string
// - dir - true for indexOf, false for lastIndexOf
function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {
// Empty buffer means no match
if (buffer.length === 0) return -1
// Normalize byteOffset
if (typeof byteOffset === 'string') {
encoding = byteOffset
byteOffset = 0
} else if (byteOffset > 0x7fffffff) {
byteOffset = 0x7fffffff
} else if (byteOffset < -0x80000000) {
byteOffset = -0x80000000
}
byteOffset = +byteOffset // Coerce to Number.
if (numberIsNaN(byteOffset)) {
// byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer
byteOffset = dir ? 0 : (buffer.length - 1)
}
// Normalize byteOffset: negative offsets start from the end of the buffer
if (byteOffset < 0) byteOffset = buffer.length + byteOffset
if (byteOffset >= buffer.length) {
if (dir) return -1
else byteOffset = buffer.length - 1
} else if (byteOffset < 0) {
if (dir) byteOffset = 0
else return -1
}
// Normalize val
if (typeof val === 'string') {
val = Buffer.from(val, encoding)
}
// Finally, search either indexOf (if dir is true) or lastIndexOf
if (Buffer.isBuffer(val)) {
// Special case: looking for empty string/buffer always fails
if (val.length === 0) {
return -1
}
return arrayIndexOf(buffer, val, byteOffset, encoding, dir)
} else if (typeof val === 'number') {
val = val & 0xFF // Search for a byte value [0-255]
if (typeof Uint8Array.prototype.indexOf === 'function') {
if (dir) {
return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)
} else {
return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)
}
}
return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir)
}
throw new TypeError('val must be string, number or Buffer')
}
function arrayIndexOf (arr, val, byteOffset, encoding, dir) {
var indexSize = 1
var arrLength = arr.length
var valLength = val.length
if (encoding !== undefined) {
encoding = String(encoding).toLowerCase()
if (encoding === 'ucs2' || encoding === 'ucs-2' ||
encoding === 'utf16le' || encoding === 'utf-16le') {
if (arr.length < 2 || val.length < 2) {
return -1
}
indexSize = 2
arrLength /= 2
valLength /= 2
byteOffset /= 2
}
}
function read (buf, i) {
if (indexSize === 1) {
return buf[i]
} else {
return buf.readUInt16BE(i * indexSize)
}
}
var i
if (dir) {
var foundIndex = -1
for (i = byteOffset; i < arrLength; i++) {
if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
if (foundIndex === -1) foundIndex = i
if (i - foundIndex + 1 === valLength) return foundIndex * indexSize
} else {
if (foundIndex !== -1) i -= i - foundIndex
foundIndex = -1
}
}
} else {
if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength
for (i = byteOffset; i >= 0; i--) {
var found = true
for (var j = 0; j < valLength; j++) {
if (read(arr, i + j) !== read(val, j)) {
found = false
break
}
}
if (found) return i
}
}
return -1
}
Buffer.prototype.includes = function includes (val, byteOffset, encoding) {
return this.indexOf(val, byteOffset, encoding) !== -1
}
Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {
return bidirectionalIndexOf(this, val, byteOffset, encoding, true)
}
Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {
return bidirectionalIndexOf(this, val, byteOffset, encoding, false)
}
function hexWrite (buf, string, offset, length) {
offset = Number(offset) || 0
var remaining = buf.length - offset
if (!length) {
length = remaining
} else {
length = Number(length)
if (length > remaining) {
length = remaining
}
}
var strLen = string.length
if (length > strLen / 2) {
length = strLen / 2
}
for (var i = 0; i < length; ++i) {
var parsed = parseInt(string.substr(i * 2, 2), 16)
if (numberIsNaN(parsed)) return i
buf[offset + i] = parsed
}
return i
}
function utf8Write (buf, string, offset, length) {
return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
}
function asciiWrite (buf, string, offset, length) {
return blitBuffer(asciiToBytes(string), buf, offset, length)
}
function latin1Write (buf, string, offset, length) {
return asciiWrite(buf, string, offset, length)
}
function base64Write (buf, string, offset, length) {
return blitBuffer(base64ToBytes(string), buf, offset, length)
}
function ucs2Write (buf, string, offset, length) {
return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
}
Buffer.prototype.write = function write (string, offset, length, encoding) {
// Buffer#write(string)
if (offset === undefined) {
encoding = 'utf8'
length = this.length
offset = 0
// Buffer#write(string, encoding)
} else if (length === undefined && typeof offset === 'string') {
encoding = offset
length = this.length
offset = 0
// Buffer#write(string, offset[, length][, encoding])
} else if (isFinite(offset)) {
offset = offset >>> 0
if (isFinite(length)) {
length = length >>> 0
if (encoding === undefined) encoding = 'utf8'
} else {
encoding = length
length = undefined
}
} else {
throw new Error(
'Buffer.write(string, encoding, offset[, length]) is no longer supported'
)
}
var remaining = this.length - offset
if (length === undefined || length > remaining) length = remaining
if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
throw new RangeError('Attempt to write outside buffer bounds')
}
if (!encoding) encoding = 'utf8'
var loweredCase = false
for (;;) {
switch (encoding) {
case 'hex':
return hexWrite(this, string, offset, length)
case 'utf8':
case 'utf-8':
return utf8Write(this, string, offset, length)
case 'ascii':
return asciiWrite(this, string, offset, length)
case 'latin1':
case 'binary':
return latin1Write(this, string, offset, length)
case 'base64':
// Warning: maxLength not taken into account in base64Write
return base64Write(this, string, offset, length)
case 'ucs2':
case 'ucs-2':
case 'utf16le':
case 'utf-16le':
return ucs2Write(this, string, offset, length)
default:
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
encoding = ('' + encoding).toLowerCase()
loweredCase = true
}
}
}
Buffer.prototype.toJSON = function toJSON () {
return {
type: 'Buffer',
data: Array.prototype.slice.call(this._arr || this, 0)
}
}
function base64Slice (buf, start, end) {
if (start === 0 && end === buf.length) {
return base64.fromByteArray(buf)
} else {
return base64.fromByteArray(buf.slice(start, end))
}
}
function utf8Slice (buf, start, end) {
end = Math.min(buf.length, end)
var res = []
var i = start
while (i < end) {
var firstByte = buf[i]
var codePoint = null
var bytesPerSequence = (firstByte > 0xEF) ? 4
: (firstByte > 0xDF) ? 3
: (firstByte > 0xBF) ? 2
: 1
if (i + bytesPerSequence <= end) {
var secondByte, thirdByte, fourthByte, tempCodePoint
switch (bytesPerSequence) {
case 1:
if (firstByte < 0x80) {
codePoint = firstByte
}
break
case 2:
secondByte = buf[i + 1]
if ((secondByte & 0xC0) === 0x80) {
tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)
if (tempCodePoint > 0x7F) {
codePoint = tempCodePoint
}
}
break
case 3:
secondByte = buf[i + 1]
thirdByte = buf[i + 2]
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)
if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
codePoint = tempCodePoint
}
}
break
case 4:
secondByte = buf[i + 1]
thirdByte = buf[i + 2]
fourthByte = buf[i + 3]
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)
if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
codePoint = tempCodePoint
}
}
}
}
if (codePoint === null) {
// we did not generate a valid codePoint so insert a
// replacement char (U+FFFD) and advance only 1 byte
codePoint = 0xFFFD
bytesPerSequence = 1
} else if (codePoint > 0xFFFF) {
// encode to utf16 (surrogate pair dance)
codePoint -= 0x10000
res.push(codePoint >>> 10 & 0x3FF | 0xD800)
codePoint = 0xDC00 | codePoint & 0x3FF
}
res.push(codePoint)
i += bytesPerSequence
}
return decodeCodePointsArray(res)
}
// Based on http://stackoverflow.com/a/22747272/680742, the browser with
// the lowest limit is Chrome, with 0x10000 args.
// We go 1 magnitude less, for safety
var MAX_ARGUMENTS_LENGTH = 0x1000
function decodeCodePointsArray (codePoints) {
var len = codePoints.length
if (len <= MAX_ARGUMENTS_LENGTH) {
return String.fromCharCode.apply(String, codePoints) // avoid extra slice()
}
// Decode in chunks to avoid "call stack size exceeded".
var res = ''
var i = 0
while (i < len) {
res += String.fromCharCode.apply(
String,
codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)
)
}
return res
}
function asciiSlice (buf, start, end) {
var ret = ''
end = Math.min(buf.length, end)
for (var i = start; i < end; ++i) {
ret += String.fromCharCode(buf[i] & 0x7F)
}
return ret
}
function latin1Slice (buf, start, end) {
var ret = ''
end = Math.min(buf.length, end)
for (var i = start; i < end; ++i) {
ret += String.fromCharCode(buf[i])
}
return ret
}
function hexSlice (buf, start, end) {
var len = buf.length
if (!start || start < 0) start = 0
if (!end || end < 0 || end > len) end = len
var out = ''
for (var i = start; i < end; ++i) {
out += toHex(buf[i])
}
return out
}
function utf16leSlice (buf, start, end) {
var bytes = buf.slice(start, end)
var res = ''
for (var i = 0; i < bytes.length; i += 2) {
res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))
}
return res
}
Buffer.prototype.slice = function slice (start, end) {
var len = this.length
start = ~~start
end = end === undefined ? len : ~~end
if (start < 0) {
start += len
if (start < 0) start = 0
} else if (start > len) {
start = len
}
if (end < 0) {
end += len
if (end < 0) end = 0
} else if (end > len) {
end = len
}
if (end < start) end = start
var newBuf = this.subarray(start, end)
// Return an augmented `Uint8Array` instance
newBuf.__proto__ = Buffer.prototype
return newBuf
}
/*
* Need to make sure that buffer isn't trying to write out of bounds.
*/
function checkOffset (offset, ext, length) {
if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
}
Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) checkOffset(offset, byteLength, this.length)
var val = this[offset]
var mul = 1
var i = 0
while (++i < byteLength && (mul *= 0x100)) {
val += this[offset + i] * mul
}
return val
}
Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) {
checkOffset(offset, byteLength, this.length)
}
var val = this[offset + --byteLength]
var mul = 1
while (byteLength > 0 && (mul *= 0x100)) {
val += this[offset + --byteLength] * mul
}
return val
}
Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 1, this.length)
return this[offset]
}
Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 2, this.length)
return this[offset] | (this[offset + 1] << 8)
}
Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 2, this.length)
return (this[offset] << 8) | this[offset + 1]
}
Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return ((this[offset]) |
(this[offset + 1] << 8) |
(this[offset + 2] << 16)) +
(this[offset + 3] * 0x1000000)
}
Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return (this[offset] * 0x1000000) +
((this[offset + 1] << 16) |
(this[offset + 2] << 8) |
this[offset + 3])
}
Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) checkOffset(offset, byteLength, this.length)
var val = this[offset]
var mul = 1
var i = 0
while (++i < byteLength && (mul *= 0x100)) {
val += this[offset + i] * mul
}
mul *= 0x80
if (val >= mul) val -= Math.pow(2, 8 * byteLength)
return val
}
Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) checkOffset(offset, byteLength, this.length)
var i = byteLength
var mul = 1
var val = this[offset + --i]
while (i > 0 && (mul *= 0x100)) {
val += this[offset + --i] * mul
}
mul *= 0x80
if (val >= mul) val -= Math.pow(2, 8 * byteLength)
return val
}
Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 1, this.length)
if (!(this[offset] & 0x80)) return (this[offset])
return ((0xff - this[offset] + 1) * -1)
}
Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 2, this.length)
var val = this[offset] | (this[offset + 1] << 8)
return (val & 0x8000) ? val | 0xFFFF0000 : val
}
Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 2, this.length)
var val = this[offset + 1] | (this[offset] << 8)
return (val & 0x8000) ? val | 0xFFFF0000 : val
}
Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return (this[offset]) |
(this[offset + 1] << 8) |
(this[offset + 2] << 16) |
(this[offset + 3] << 24)
}
Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return (this[offset] << 24) |
(this[offset + 1] << 16) |
(this[offset + 2] << 8) |
(this[offset + 3])
}
Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return ieee754.read(this, offset, true, 23, 4)
}
Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 4, this.length)
return ieee754.read(this, offset, false, 23, 4)
}
Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 8, this.length)
return ieee754.read(this, offset, true, 52, 8)
}
Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
offset = offset >>> 0
if (!noAssert) checkOffset(offset, 8, this.length)
return ieee754.read(this, offset, false, 52, 8)
}
function checkInt (buf, value, offset, ext, max, min) {
if (!Buffer.isBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance')
if (value > max || value < min) throw new RangeError('"value" argument is out of bounds')
if (offset + ext > buf.length) throw new RangeError('Index out of range')
}
Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
value = +value
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) {
var maxBytes = Math.pow(2, 8 * byteLength) - 1
checkInt(this, value, offset, byteLength, maxBytes, 0)
}
var mul = 1
var i = 0
this[offset] = value & 0xFF
while (++i < byteLength && (mul *= 0x100)) {
this[offset + i] = (value / mul) & 0xFF
}
return offset + byteLength
}
Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
value = +value
offset = offset >>> 0
byteLength = byteLength >>> 0
if (!noAssert) {
var maxBytes = Math.pow(2, 8 * byteLength) - 1
checkInt(this, value, offset, byteLength, maxBytes, 0)
}
var i = byteLength - 1
var mul = 1
this[offset + i] = value & 0xFF
while (--i >= 0 && (mul *= 0x100)) {
this[offset + i] = (value / mul) & 0xFF
}
return offset + byteLength
}
Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)
this[offset] = (value & 0xff)
return offset + 1
}
Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
this[offset] = (value & 0xff)
this[offset + 1] = (value >>> 8)
return offset + 2
}
Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
this[offset] = (value >>> 8)
this[offset + 1] = (value & 0xff)
return offset + 2
}
Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
this[offset + 3] = (value >>> 24)
this[offset + 2] = (value >>> 16)
this[offset + 1] = (value >>> 8)
this[offset] = (value & 0xff)
return offset + 4
}
Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
this[offset] = (value >>> 24)
this[offset + 1] = (value >>> 16)
this[offset + 2] = (value >>> 8)
this[offset + 3] = (value & 0xff)
return offset + 4
}
Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) {
var limit = Math.pow(2, (8 * byteLength) - 1)
checkInt(this, value, offset, byteLength, limit - 1, -limit)
}
var i = 0
var mul = 1
var sub = 0
this[offset] = value & 0xFF
while (++i < byteLength && (mul *= 0x100)) {
if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
sub = 1
}
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
}
return offset + byteLength
}
Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) {
var limit = Math.pow(2, (8 * byteLength) - 1)
checkInt(this, value, offset, byteLength, limit - 1, -limit)
}
var i = byteLength - 1
var mul = 1
var sub = 0
this[offset + i] = value & 0xFF
while (--i >= 0 && (mul *= 0x100)) {
if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
sub = 1
}
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
}
return offset + byteLength
}
Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)
if (value < 0) value = 0xff + value + 1
this[offset] = (value & 0xff)
return offset + 1
}
Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
this[offset] = (value & 0xff)
this[offset + 1] = (value >>> 8)
return offset + 2
}
Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
this[offset] = (value >>> 8)
this[offset + 1] = (value & 0xff)
return offset + 2
}
Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
this[offset] = (value & 0xff)
this[offset + 1] = (value >>> 8)
this[offset + 2] = (value >>> 16)
this[offset + 3] = (value >>> 24)
return offset + 4
}
Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
if (value < 0) value = 0xffffffff + value + 1
this[offset] = (value >>> 24)
this[offset + 1] = (value >>> 16)
this[offset + 2] = (value >>> 8)
this[offset + 3] = (value & 0xff)
return offset + 4
}
function checkIEEE754 (buf, value, offset, ext, max, min) {
if (offset + ext > buf.length) throw new RangeError('Index out of range')
if (offset < 0) throw new RangeError('Index out of range')
}
function writeFloat (buf, value, offset, littleEndian, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) {
checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)
}
ieee754.write(buf, value, offset, littleEndian, 23, 4)
return offset + 4
}
Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
return writeFloat(this, value, offset, true, noAssert)
}
Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
return writeFloat(this, value, offset, false, noAssert)
}
function writeDouble (buf, value, offset, littleEndian, noAssert) {
value = +value
offset = offset >>> 0
if (!noAssert) {
checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)
}
ieee754.write(buf, value, offset, littleEndian, 52, 8)
return offset + 8
}
Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
return writeDouble(this, value, offset, true, noAssert)
}
Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
return writeDouble(this, value, offset, false, noAssert)
}
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
Buffer.prototype.copy = function copy (target, targetStart, start, end) {
if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')
if (!start) start = 0
if (!end && end !== 0) end = this.length
if (targetStart >= target.length) targetStart = target.length
if (!targetStart) targetStart = 0
if (end > 0 && end < start) end = start
// Copy 0 bytes; we're done
if (end === start) return 0
if (target.length === 0 || this.length === 0) return 0
// Fatal error conditions
if (targetStart < 0) {
throw new RangeError('targetStart out of bounds')
}
if (start < 0 || start >= this.length) throw new RangeError('Index out of range')
if (end < 0) throw new RangeError('sourceEnd out of bounds')
// Are we oob?
if (end > this.length) end = this.length
if (target.length - targetStart < end - start) {
end = target.length - targetStart + start
}
var len = end - start
if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {
// Use built-in when available, missing from IE11
this.copyWithin(targetStart, start, end)
} else if (this === target && start < targetStart && targetStart < end) {
// descending copy from end
for (var i = len - 1; i >= 0; --i) {
target[i + targetStart] = this[i + start]
}
} else {
Uint8Array.prototype.set.call(
target,
this.subarray(start, end),
targetStart
)
}
return len
}
// Usage:
// buffer.fill(number[, offset[, end]])
// buffer.fill(buffer[, offset[, end]])
// buffer.fill(string[, offset[, end]][, encoding])
Buffer.prototype.fill = function fill (val, start, end, encoding) {
// Handle string cases:
if (typeof val === 'string') {
if (typeof start === 'string') {
encoding = start
start = 0
end = this.length
} else if (typeof end === 'string') {
encoding = end
end = this.length
}
if (encoding !== undefined && typeof encoding !== 'string') {
throw new TypeError('encoding must be a string')
}
if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {
throw new TypeError('Unknown encoding: ' + encoding)
}
if (val.length === 1) {
var code = val.charCodeAt(0)
if ((encoding === 'utf8' && code < 128) ||
encoding === 'latin1') {
// Fast path: If `val` fits into a single byte, use that numeric value.
val = code
}
}
} else if (typeof val === 'number') {
val = val & 255
}
// Invalid ranges are not set to a default, so can range check early.
if (start < 0 || this.length < start || this.length < end) {
throw new RangeError('Out of range index')
}
if (end <= start) {
return this
}
start = start >>> 0
end = end === undefined ? this.length : end >>> 0
if (!val) val = 0
var i
if (typeof val === 'number') {
for (i = start; i < end; ++i) {
this[i] = val
}
} else {
var bytes = Buffer.isBuffer(val)
? val
: Buffer.from(val, encoding)
var len = bytes.length
if (len === 0) {
throw new TypeError('The value "' + val +
'" is invalid for argument "value"')
}
for (i = 0; i < end - start; ++i) {
this[i + start] = bytes[i % len]
}
}
return this
}
// HELPER FUNCTIONS
// ================
var INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g
function base64clean (str) {
// Node takes equal signs as end of the Base64 encoding
str = str.split('=')[0]
// Node strips out invalid characters like \n and \t from the string, base64-js does not
str = str.trim().replace(INVALID_BASE64_RE, '')
// Node converts strings with length < 2 to ''
if (str.length < 2) return ''
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
while (str.length % 4 !== 0) {
str = str + '='
}
return str
}
function toHex (n) {
if (n < 16) return '0' + n.toString(16)
return n.toString(16)
}
function utf8ToBytes (string, units) {
units = units || Infinity
var codePoint
var length = string.length
var leadSurrogate = null
var bytes = []
for (var i = 0; i < length; ++i) {
codePoint = string.charCodeAt(i)
// is surrogate component
if (codePoint > 0xD7FF && codePoint < 0xE000) {
// last char was a lead
if (!leadSurrogate) {
// no lead yet
if (codePoint > 0xDBFF) {
// unexpected trail
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
continue
} else if (i + 1 === length) {
// unpaired lead
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
continue
}
// valid lead
leadSurrogate = codePoint
continue
}
// 2 leads in a row
if (codePoint < 0xDC00) {
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
leadSurrogate = codePoint
continue
}
// valid surrogate pair
codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000
} else if (leadSurrogate) {
// valid bmp char, but last char was a lead
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
}
leadSurrogate = null
// encode utf8
if (codePoint < 0x80) {
if ((units -= 1) < 0) break
bytes.push(codePoint)
} else if (codePoint < 0x800) {
if ((units -= 2) < 0) break
bytes.push(
codePoint >> 0x6 | 0xC0,
codePoint & 0x3F | 0x80
)
} else if (codePoint < 0x10000) {
if ((units -= 3) < 0) break
bytes.push(
codePoint >> 0xC | 0xE0,
codePoint >> 0x6 & 0x3F | 0x80,
codePoint & 0x3F | 0x80
)
} else if (codePoint < 0x110000) {
if ((units -= 4) < 0) break
bytes.push(
codePoint >> 0x12 | 0xF0,
codePoint >> 0xC & 0x3F | 0x80,
codePoint >> 0x6 & 0x3F | 0x80,
codePoint & 0x3F | 0x80
)
} else {
throw new Error('Invalid code point')
}
}
return bytes
}
function asciiToBytes (str) {
var byteArray = []
for (var i = 0; i < str.length; ++i) {
// Node's code seems to be doing this and not & 0x7F..
byteArray.push(str.charCodeAt(i) & 0xFF)
}
return byteArray
}
function utf16leToBytes (str, units) {
var c, hi, lo
var byteArray = []
for (var i = 0; i < str.length; ++i) {
if ((units -= 2) < 0) break
c = str.charCodeAt(i)
hi = c >> 8
lo = c % 256
byteArray.push(lo)
byteArray.push(hi)
}
return byteArray
}
function base64ToBytes (str) {
return base64.toByteArray(base64clean(str))
}
function blitBuffer (src, dst, offset, length) {
for (var i = 0; i < length; ++i) {
if ((i + offset >= dst.length) || (i >= src.length)) break
dst[i + offset] = src[i]
}
return i
}
// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass
// the `instanceof` check but they should be treated as of that type.
// See: https://github.com/feross/buffer/issues/166
function isInstance (obj, type) {
return obj instanceof type ||
(obj != null && obj.constructor != null && obj.constructor.name != null &&
obj.constructor.name === type.name)
}
function numberIsNaN (obj) {
// For IE11 support
return obj !== obj // eslint-disable-line no-self-compare
}
},{"base64-js":7,"ieee754":11}],10:[function(require,module,exports){
// Copyright Joyent, Inc. and other Node contributors.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to permit
// persons to whom the Software is furnished to do so, subject to the
// following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
// USE OR OTHER DEALINGS IN THE SOFTWARE.
var objectCreate = Object.create || objectCreatePolyfill
var objectKeys = Object.keys || objectKeysPolyfill
var bind = Function.prototype.bind || functionBindPolyfill
function EventEmitter() {
if (!this._events || !Object.prototype.hasOwnProperty.call(this, '_events')) {
this._events = objectCreate(null);
this._eventsCount = 0;
}
this._maxListeners = this._maxListeners || undefined;
}
module.exports = EventEmitter;
// Backwards-compat with node 0.10.x
EventEmitter.EventEmitter = EventEmitter;
EventEmitter.prototype._events = undefined;
EventEmitter.prototype._maxListeners = undefined;
// By default EventEmitters will print a warning if more than 10 listeners are
// added to it. This is a useful default which helps finding memory leaks.
var defaultMaxListeners = 10;
var hasDefineProperty;
try {
var o = {};
if (Object.defineProperty) Object.defineProperty(o, 'x', { value: 0 });
hasDefineProperty = o.x === 0;
} catch (err) { hasDefineProperty = false }
if (hasDefineProperty) {
Object.defineProperty(EventEmitter, 'defaultMaxListeners', {
enumerable: true,
get: function() {
return defaultMaxListeners;
},
set: function(arg) {
// check whether the input is a positive number (whose value is zero or
// greater and not a NaN).
if (typeof arg !== 'number' || arg < 0 || arg !== arg)
throw new TypeError('"defaultMaxListeners" must be a positive number');
defaultMaxListeners = arg;
}
});
} else {
EventEmitter.defaultMaxListeners = defaultMaxListeners;
}
// Obviously not all Emitters should be limited to 10. This function allows
// that to be increased. Set to zero for unlimited.
EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {
if (typeof n !== 'number' || n < 0 || isNaN(n))
throw new TypeError('"n" argument must be a positive number');
this._maxListeners = n;
return this;
};
function $getMaxListeners(that) {
if (that._maxListeners === undefined)
return EventEmitter.defaultMaxListeners;
return that._maxListeners;
}
EventEmitter.prototype.getMaxListeners = function getMaxListeners() {
return $getMaxListeners(this);
};
// These standalone emit* functions are used to optimize calling of event
// handlers for fast cases because emit() itself often has a variable number of
// arguments and can be deoptimized because of that. These functions always have
// the same number of arguments and thus do not get deoptimized, so the code
// inside them can execute faster.
function emitNone(handler, isFn, self) {
if (isFn)
handler.call(self);
else {
var len = handler.length;
var listeners = arrayClone(handler, len);
for (var i = 0; i < len; ++i)
listeners[i].call(self);
}
}
function emitOne(handler, isFn, self, arg1) {
if (isFn)
handler.call(self, arg1);
else {
var len = handler.length;
var listeners = arrayClone(handler, len);
for (var i = 0; i < len; ++i)
listeners[i].call(self, arg1);
}
}
function emitTwo(handler, isFn, self, arg1, arg2) {
if (isFn)
handler.call(self, arg1, arg2);
else {
var len = handler.length;
var listeners = arrayClone(handler, len);
for (var i = 0; i < len; ++i)
listeners[i].call(self, arg1, arg2);
}
}
function emitThree(handler, isFn, self, arg1, arg2, arg3) {
if (isFn)
handler.call(self, arg1, arg2, arg3);
else {
var len = handler.length;
var listeners = arrayClone(handler, len);
for (var i = 0; i < len; ++i)
listeners[i].call(self, arg1, arg2, arg3);
}
}
function emitMany(handler, isFn, self, args) {
if (isFn)
handler.apply(self, args);
else {
var len = handler.length;
var listeners = arrayClone(handler, len);
for (var i = 0; i < len; ++i)
listeners[i].apply(self, args);
}
}
EventEmitter.prototype.emit = function emit(type) {
var er, handler, len, args, i, events;
var doError = (type === 'error');
events = this._events;
if (events)
doError = (doError && events.error == null);
else if (!doError)
return false;
// If there is no 'error' event listener then throw.
if (doError) {
if (arguments.length > 1)
er = arguments[1];
if (er instanceof Error) {
throw er; // Unhandled 'error' event
} else {
// At least give some kind of context to the user
var err = new Error('Unhandled "error" event. (' + er + ')');
err.context = er;
throw err;
}
return false;
}
handler = events[type];
if (!handler)
return false;
var isFn = typeof handler === 'function';
len = arguments.length;
switch (len) {
// fast cases
case 1:
emitNone(handler, isFn, this);
break;
case 2:
emitOne(handler, isFn, this, arguments[1]);
break;
case 3:
emitTwo(handler, isFn, this, arguments[1], arguments[2]);
break;
case 4:
emitThree(handler, isFn, this, arguments[1], arguments[2], arguments[3]);
break;
// slower
default:
args = new Array(len - 1);
for (i = 1; i < len; i++)
args[i - 1] = arguments[i];
emitMany(handler, isFn, this, args);
}
return true;
};
function _addListener(target, type, listener, prepend) {
var m;
var events;
var existing;
if (typeof listener !== 'function')
throw new TypeError('"listener" argument must be a function');
events = target._events;
if (!events) {
events = target._events = objectCreate(null);
target._eventsCount = 0;
} else {
// To avoid recursion in the case that type === "newListener"! Before
// adding it to the listeners, first emit "newListener".
if (events.newListener) {
target.emit('newListener', type,
listener.listener ? listener.listener : listener);
// Re-assign `events` because a newListener handler could have caused the
// this._events to be assigned to a new object
events = target._events;
}
existing = events[type];
}
if (!existing) {
// Optimize the case of one listener. Don't need the extra array object.
existing = events[type] = listener;
++target._eventsCount;
} else {
if (typeof existing === 'function') {
// Adding the second element, need to change to array.
existing = events[type] =
prepend ? [listener, existing] : [existing, listener];
} else {
// If we've already got an array, just append.
if (prepend) {
existing.unshift(listener);
} else {
existing.push(listener);
}
}
// Check for listener leak
if (!existing.warned) {
m = $getMaxListeners(target);
if (m && m > 0 && existing.length > m) {
existing.warned = true;
var w = new Error('Possible EventEmitter memory leak detected. ' +
existing.length + ' "' + String(type) + '" listeners ' +
'added. Use emitter.setMaxListeners() to ' +
'increase limit.');
w.name = 'MaxListenersExceededWarning';
w.emitter = target;
w.type = type;
w.count = existing.length;
if (typeof console === 'object' && console.warn) {
console.warn('%s: %s', w.name, w.message);
}
}
}
}
return target;
}
EventEmitter.prototype.addListener = function addListener(type, listener) {
return _addListener(this, type, listener, false);
};
EventEmitter.prototype.on = EventEmitter.prototype.addListener;
EventEmitter.prototype.prependListener =
function prependListener(type, listener) {
return _addListener(this, type, listener, true);
};
function onceWrapper() {
if (!this.fired) {
this.target.removeListener(this.type, this.wrapFn);
this.fired = true;
switch (arguments.length) {
case 0:
return this.listener.call(this.target);
case 1:
return this.listener.call(this.target, arguments[0]);
case 2:
return this.listener.call(this.target, arguments[0], arguments[1]);
case 3:
return this.listener.call(this.target, arguments[0], arguments[1],
arguments[2]);
default:
var args = new Array(arguments.length);
for (var i = 0; i < args.length; ++i)
args[i] = arguments[i];
this.listener.apply(this.target, args);
}
}
}
function _onceWrap(target, type, listener) {
var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };
var wrapped = bind.call(onceWrapper, state);
wrapped.listener = listener;
state.wrapFn = wrapped;
return wrapped;
}
EventEmitter.prototype.once = function once(type, listener) {
if (typeof listener !== 'function')
throw new TypeError('"listener" argument must be a function');
this.on(type, _onceWrap(this, type, listener));
return this;
};
EventEmitter.prototype.prependOnceListener =
function prependOnceListener(type, listener) {
if (typeof listener !== 'function')
throw new TypeError('"listener" argument must be a function');
this.prependListener(type, _onceWrap(this, type, listener));
return this;
};
// Emits a 'removeListener' event if and only if the listener was removed.
EventEmitter.prototype.removeListener =
function removeListener(type, listener) {
var list, events, position, i, originalListener;
if (typeof listener !== 'function')
throw new TypeError('"listener" argument must be a function');
events = this._events;
if (!events)
return this;
list = events[type];
if (!list)
return this;
if (list === listener || list.listener === listener) {
if (--this._eventsCount === 0)
this._events = objectCreate(null);
else {
delete events[type];
if (events.removeListener)
this.emit('removeListener', type, list.listener || listener);
}
} else if (typeof list !== 'function') {
position = -1;
for (i = list.length - 1; i >= 0; i--) {
if (list[i] === listener || list[i].listener === listener) {
originalListener = list[i].listener;
position = i;
break;
}
}
if (position < 0)
return this;
if (position === 0)
list.shift();
else
spliceOne(list, position);
if (list.length === 1)
events[type] = list[0];
if (events.removeListener)
this.emit('removeListener', type, originalListener || listener);
}
return this;
};
EventEmitter.prototype.removeAllListeners =
function removeAllListeners(type) {
var listeners, events, i;
events = this._events;
if (!events)
return this;
// not listening for removeListener, no need to emit
if (!events.removeListener) {
if (arguments.length === 0) {
this._events = objectCreate(null);
this._eventsCount = 0;
} else if (events[type]) {
if (--this._eventsCount === 0)
this._events = objectCreate(null);
else
delete events[type];
}
return this;
}
// emit removeListener for all listeners on all events
if (arguments.length === 0) {
var keys = objectKeys(events);
var key;
for (i = 0; i < keys.length; ++i) {
key = keys[i];
if (key === 'removeListener') continue;
this.removeAllListeners(key);
}
this.removeAllListeners('removeListener');
this._events = objectCreate(null);
this._eventsCount = 0;
return this;
}
listeners = events[type];
if (typeof listeners === 'function') {
this.removeListener(type, listeners);
} else if (listeners) {
// LIFO order
for (i = listeners.length - 1; i >= 0; i--) {
this.removeListener(type, listeners[i]);
}
}
return this;
};
function _listeners(target, type, unwrap) {
var events = target._events;
if (!events)
return [];
var evlistener = events[type];
if (!evlistener)
return [];
if (typeof evlistener === 'function')
return unwrap ? [evlistener.listener || evlistener] : [evlistener];
return unwrap ? unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);
}
EventEmitter.prototype.listeners = function listeners(type) {
return _listeners(this, type, true);
};
EventEmitter.prototype.rawListeners = function rawListeners(type) {
return _listeners(this, type, false);
};
EventEmitter.listenerCount = function(emitter, type) {
if (typeof emitter.listenerCount === 'function') {
return emitter.listenerCount(type);
} else {
return listenerCount.call(emitter, type);
}
};
EventEmitter.prototype.listenerCount = listenerCount;
function listenerCount(type) {
var events = this._events;
if (events) {
var evlistener = events[type];
if (typeof evlistener === 'function') {
return 1;
} else if (evlistener) {
return evlistener.length;
}
}
return 0;
}
EventEmitter.prototype.eventNames = function eventNames() {
return this._eventsCount > 0 ? Reflect.ownKeys(this._events) : [];
};
// About 1.5x faster than the two-arg version of Array#splice().
function spliceOne(list, index) {
for (var i = index, k = i + 1, n = list.length; k < n; i += 1, k += 1)
list[i] = list[k];
list.pop();
}
function arrayClone(arr, n) {
var copy = new Array(n);
for (var i = 0; i < n; ++i)
copy[i] = arr[i];
return copy;
}
function unwrapListeners(arr) {
var ret = new Array(arr.length);
for (var i = 0; i < ret.length; ++i) {
ret[i] = arr[i].listener || arr[i];
}
return ret;
}
function objectCreatePolyfill(proto) {
var F = function() {};
F.prototype = proto;
return new F;
}
function objectKeysPolyfill(obj) {
var keys = [];
for (var k in obj) if (Object.prototype.hasOwnProperty.call(obj, k)) {
keys.push(k);
}
return k;
}
function functionBindPolyfill(context) {
var fn = this;
return function () {
return fn.apply(context, arguments);
};
}
},{}],11:[function(require,module,exports){
exports.read = function (buffer, offset, isLE, mLen, nBytes) {
var e, m
var eLen = (nBytes * 8) - mLen - 1
var eMax = (1 << eLen) - 1
var eBias = eMax >> 1
var nBits = -7
var i = isLE ? (nBytes - 1) : 0
var d = isLE ? -1 : 1
var s = buffer[offset + i]
i += d
e = s & ((1 << (-nBits)) - 1)
s >>= (-nBits)
nBits += eLen
for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}
m = e & ((1 << (-nBits)) - 1)
e >>= (-nBits)
nBits += mLen
for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}
if (e === 0) {
e = 1 - eBias
} else if (e === eMax) {
return m ? NaN : ((s ? -1 : 1) * Infinity)
} else {
m = m + Math.pow(2, mLen)
e = e - eBias
}
return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
}
exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {
var e, m, c
var eLen = (nBytes * 8) - mLen - 1
var eMax = (1 << eLen) - 1
var eBias = eMax >> 1
var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
var i = isLE ? 0 : (nBytes - 1)
var d = isLE ? 1 : -1
var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
value = Math.abs(value)
if (isNaN(value) || value === Infinity) {
m = isNaN(value) ? 1 : 0
e = eMax
} else {
e = Math.floor(Math.log(value) / Math.LN2)
if (value * (c = Math.pow(2, -e)) < 1) {
e--
c *= 2
}
if (e + eBias >= 1) {
value += rt / c
} else {
value += rt * Math.pow(2, 1 - eBias)
}
if (value * c >= 2) {
e++
c /= 2
}
if (e + eBias >= eMax) {
m = 0
e = eMax
} else if (e + eBias >= 1) {
m = ((value * c) - 1) * Math.pow(2, mLen)
e = e + eBias
} else {
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
e = 0
}
}
for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
e = (e << mLen) | m
eLen += mLen
for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
buffer[offset + i - d] |= s * 128
}
},{}],12:[function(require,module,exports){
(function (exportName) {
/*<function name="BigInteger">*/
var WORD_SIZE = 26;
/**
* 大整数
*
* @see https://github.com/indutny/bn.js
*/
var BigInteger = (function () {
/**
* 构造大整数对象
*
* @param value 数值
* @example BigInteger():value is undefined
```js
var bi = new jints.BigInteger();
console.log(bi.toString());
// > 0
```
* @example BigInteger():value is string
```js
var bi = new jints.BigInteger('123');
console.log(bi.toString());
// > 123
var bi = new jints.BigInteger('');
console.log(bi.toString());
// > 0
```
* @example BigInteger():value is hex
```js
var bi = new jints.BigInteger('0xff');
console.log(bi.toString());
// > 255
```
* @example BigInteger():value is oct
```js
var bi = new jints.BigInteger('0o77');
console.log(bi.toString());
// > 63
```
* @example BigInteger():value is bin
```js
var bi = new jints.BigInteger('-0b1111');
console.log(bi.toString());
// > -15
```
* @example BigInteger():value is number
```js
var bi = new jints.BigInteger(1000.12);
console.log(bi.toString());
// > 1000
var bi = new jints.BigInteger(-1000.12);
console.log(bi.toString());
// > -1000
var bi = new jints.BigInteger(0x4000000);
console.log(bi.toString(16));
// > 4000000
var bi = new jints.BigInteger(0x10000000000000);
console.log(bi.toString(16));
// > 10000000000000
```
*/
function BigInteger(value) {
if (value === void 0) { value = null; }
this.negative = 0;
if (typeof value === 'string') {
var match = value.match(/^([+-]?)((?:0x|0b|0o)?)(\w+)/i);
if (match) {
var radix = {
"0b": 2,
"0o": 8,
"0x": 16,
}[match[2].toLowerCase()] || 10;
if (match[1] === '-') {
this.negative = 1;
}
this.parse(match[3], radix, 0);
}
else {
this.words = [0];
}
}
else {
if (value < 0) {
this.negative = 1;
value = -value;
}
if (value < 0x4000000) {
this.words = [value & 0x3ffffff];
}
else if (value < 0x10000000000000) {
this.words = [
value & 0x3ffffff,
(value / 0x4000000) & 0x3ffffff
];
}
else {
this.words = [
value & 0x3ffffff,
(value / 0x4000000) & 0x3ffffff,
1
];
}
}
}
/**
* 转换数字字符串
*
* @param text 字符串
* @param start 起始位置
* @param end 结束为止
* @param radix 进制基数 2~36
* @example parseText():base
```js
console.log(jints.BigInteger.parseText('123', 0, 3, 10));
// > 123
console.log(jints.BigInteger.parseText('123', 1, 3, 10));
// > 23
console.log(jints.BigInteger.parseText('123', 1, 3, 16));
// > 35
console.log(jints.BigInteger.parseText('Aa', 0, 2, 16));
// > 170
```
*/
BigInteger.parseText = function (text, start, end, radix) {
var result = 0;
var len = Math.min(text.length, end);
for (var i = start; i < len; i++) {
result *= radix;
var c = text.charCodeAt(i) - 48;
if (c >= 49) {
result += c - 49 + 0xa;
}
else if (c >= 17) {
result += c - 17 + 0xa;
}
else {
result += c;
}
}
return result;
};
/**
* 解析数字字符
*
* @param number 数字字符串
* @param radix 进制基数
* @param start 起始位置
* @example parse():base
```js
var bi = new jints.BigInteger();
bi.parse('0123456789abcdef', 16);
console.log(bi.toString(16));
// > 123456789abcdef
bi.parse('0123456789abcdef', 16, 3);
console.log(bi.toString(16));
// > 3456789abcdef
```
* @example parse():coverage
```js
var bi = new jints.BigInteger();
bi.parse('zzzzzzzzzzzz', 36);
console.log(bi.toString(36));
// > zzzzzzzzzzzz
bi.parse('2821122424961', 10);
console.log(bi.toString(10));
// > 2821122424961
```
*/
BigInteger.prototype.parse = function (number, radix, start) {
if (start === void 0) { start = 0; }
// Initialize as zero
this.words = [0];
// Find length of limb in base
var limbLen = 0;
var limbPow = 1;
for (; limbPow <= 0x3ffffff; limbPow *= radix) {
limbLen++;
}
limbLen--;
limbPow = (limbPow / radix) | 0;
var total = number.length - start;
var mod = total % limbLen;
var end = Math.min(total, total - mod) + start;
var word = 0;
var i;
for (i = start; i < end; i += limbLen) {
word = BigInteger.parseText(number, i, i + limbLen, radix);
this.mul(limbPow);
if (this.words[0] + word < 0x4000000) {
this.words[0] += word;
}
else {
this.add(word);
}
}
if (mod !== 0) {
var pow = 1;
word = BigInteger.parseText(number, i, number.length, radix);
for (i = 0; i < mod; i++) {
pow *= radix;
}
this.mul(pow);
if (this.words[0] + word < 0x4000000) {
this.words[0] += word;
}
else {
this.add(word);
}
}
};
/**
* 除于一个数
*
* @param num 被除数
* @example div():base
```js
var bi = new jints.BigInteger(101);
bi.div(2);
console.log(bi.toString());
// > 50
var bi = new jints.BigInteger(101);
bi.div(3);
console.log(bi.toString());
// > 33
```
*/
BigInteger.prototype.div = function (num) {
var carry = 0;
for (var i = this.words.length - 1; i >= 0; i--) {
var w = (this.words[i] | 0) + carry * 0x4000000;
this.words[i] = (w / num) | 0;
carry = w % num;
}
this.strip();
};
BigInteger.prototype.strip = function () {
while (this.words.length > 1 && this.words[this.words.length - 1] === 0) {
this.words.length--;
}
this.normSign();
};
BigInteger.prototype.normSign = function () {
if (this.words.length === 1 && this.words[0] === 0) {
this.negative = 0;
}
};
/**
* 乘于一个数
*
* @param num 该数
* @example mul():base
```js
var bi = new jints.BigInteger(101);
bi.mul(2);
console.log(bi.toString());
// > 202
var bi = new jints.BigInteger(7);
bi.mul(3);
console.log(bi.toString());
// > 21
```
*/
BigInteger.prototype.mul = function (num) {
// Carry
var carry = 0;
var i = 0;
for (; i < this.words.length; i++) {
var w = (this.words[i] | 0) * num;
var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
carry >>= WORD_SIZE;
carry += (w / 0x4000000) | 0;
// NOTE: lo is 27bit maximum
carry += lo >>> WORD_SIZE;
this.words[i] = lo & 0x3ffffff;
}
if (carry !== 0) {
this.words[i] = carry;
}
};
/**
* 加一个数
*
* @param num 该数
* @example add():base
```js
var bi = new jints.BigInteger(101);
bi.add(2);
console.log(bi.toString());
// > 103
var bi = new jints.BigInteger(7);
bi.add(3);
console.log(bi.toString());
// > 10
```
* @example add():coverage
```js
var bi = new jints.BigInteger(0x4000000 - 1);
bi.add(0x4000000 - 2);
console.log(bi.toString(16));
// > 7fffffd
```
*/
BigInteger.prototype.add = function (num) {
this.words[0] += num;
// Carry
for (var i = 0; i < this.words.length && this.words[i] >= 0x4000000; i++) {
this.words[i] -= 0x4000000;
if (i === this.words.length - 1) {
this.words[i + 1] = 0;
}
this.words[i + 1]++;
}
};
/**
* 取模
*
* @param num 该数
* @example mod():base
```js
var bi = new jints.BigInteger(101);
console.log(bi.mod(2));
// > 1
var bi = new jints.BigInteger(7);
console.log(bi.mod(3));
// > 1
```
*/
BigInteger.prototype.mod = function (num) {
var p = (1 << WORD_SIZE) % num;
var result = 0;
for (var i = this.words.length - 1; i >= 0; i--) {
result = (p * result + (this.words[i] | 0)) % num;
}
return result;
};
/**
* 为零判断
*
* @example mod():base
```js
var bi = new jints.BigInteger(0);
console.log(bi.isZero());
// > true
var bi = new jints.BigInteger(1);
console.log(bi.isZero());
// > false
```
*/
BigInteger.prototype.isZero = function () {
return this.words.length === 1 && this.words[0] === 0;
};
/**
* 克隆对象
*
* @example clone():base
```js
var bi = new jints.BigInteger('1234567890000000000000000');
console.log(bi.clone().toString());
// > 1234567890000000000000000
```
*/
BigInteger.prototype.clone = function () {
var result = new BigInteger();
result.words = this.words.slice();
result.negative = this.negative;
return result;
};
/**
* 转换为字符串
*
* @param radix 进制基数
* @example toString():base
```js
var bi = new jints.BigInteger('1234567890000000000000000');
console.log(bi.toString());
// > 1234567890000000000000000
console.log(bi.toString(16));
// > 1056e0f3635fbb7d50000
console.log(bi.toString(36));
// > 5l1ec1qoa123tvk0
```
*/
BigInteger.prototype.toString = function (radix) {
if (radix === void 0) { radix = 10; }
if (this.isZero()) {
return '0';
}
var groupSize = Math.floor(WORD_SIZE * Math.LN2 / Math.log(radix));
var groupBase = Math.pow(radix, groupSize);
var result = '';
var c = this.clone();
c.negative = 0;
while (!c.isZero()) {
var r = c.mod(groupBase).toString(radix);
c.div(groupBase);
if (!c.isZero()) {
result = new Array(groupSize - r.length + 1).join('0') + r + result;
}
else {
result = r + result;
}
}
if (this.negative === 1) {
result = '-' + result;
}
return result;
};
Object.defineProperty(BigInteger.prototype, "length", {
get: function () {
return this.words.length;
},
enumerable: true,
configurable: true
});
/**
* 两数比较
*
* @param bi 另一个数
* @return 如果相同返回 0, 大于: 1, 小于: -1
* @example compare():base
```js
var a = new jints.BigInteger('0xfffffff');
var b = new jints.BigInteger('0xfffffff');
console.log(a.compare(b));
// > 0
b.add(1);
console.log(a.compare(b));
// > -1
a.add(2);
console.log(a.compare(b));
// > 1
var a = new jints.BigInteger(2);
var b = new jints.BigInteger(1);
console.log(a.compare(b));
// > 1
var a = new jints.BigInteger(-2);
var b = new jints.BigInteger(-1);
console.log(a.compare(b));
// > -1
```
* @example compare():signed
```js
var a = new jints.BigInteger('0xfffffff');
var b = new jints.BigInteger('0xfffffff');
b.negative = 1;
console.log(a.compare(b));
// > 1
a.negative = 1;
console.log(a.compare(b));
// > 0
b.negative = 0;
console.log(a.compare(b));
// > -1
```
* @example compare():length of words
```js
var a = new jints.BigInteger('0xfffffff');
var b = new jints.BigInteger('0xff');
console.log(a.compare(b));
// > 1
console.log(b.compare(a));
// > -1
```
*/
BigInteger.prototype.compare = function (bi) {
if (this.negative !== 0 && bi.negative === 0) {
return -1;
}
if (this.negative === 0 && bi.negative !== 0) {
return 1;
}
var signed = this.negative !== 0 ? -1 : 1;
if (this.length > bi.length) {
return 1 * signed;
}
if (this.length < bi.length) {
return -1 * signed;
}
for (var i = this.length - 1; i >= 0; i--) {
var a = this.words[i] | 0;
var b = bi.words[i] | 0;
if (a === b)
continue;
if (a < b) {
return -1 * signed;
}
return 1 * signed;
}
return 0;
};
/**
* 取有多长的 bit
*
* @example bitLength():zero
```js
var bi = new jints.BigInteger();
console.log(bi.bitLength());
// > 0
```
*/
BigInteger.prototype.bitLength = function () {
function clz32(x) {
// Let n be ToUint32(x).
// Let p be the number of leading zero bits in
// the 32-bit binary representation of n.
// Return p.
if (x == null || x === 0) {
return 32;
}
return 31 - Math.floor(Math.log(x >>> 0) * Math.LOG2E);
}
var w = this.words[this.length - 1];
var hi = 32 - clz32(w);
return (this.length - 1) * WORD_SIZE + hi;
};
BigInteger.prototype.byteLength = function () {
return Math.ceil(this.bitLength() / 8);
};
/**
* 与运算
*
* @param num 该数
* @return 返回与的结果
* @example and():base
```js
var a = new jints.BigInteger('0x3114');
console.log(a.and(0xff).toString(16));
// > 14
```
*/
BigInteger.prototype.and = function (num) {
return this.words[0] & num;
};
/**
* 右移 bit 位
*
* @param bits 右移个数
* @example shr():base
```js
var bi = new jints.BigInteger('0b10010001000000011000000000000');
var c = bi.clone();
c.shr(10);
console.log(c.toString(2));
// > 1001000100000001100
var c = bi.clone();
c.shr(28);
console.log(c.toString(2));
// > 1
```
* @example shr():zero
```js
var bi = new jints.BigInteger();
bi.shr(0);
console.log(bi.toString());
// > 0
bi.shr(26);
console.log(bi.toString());
// > 0
var bi = new jints.BigInteger(1);
bi.shr(1);
console.log(bi.toString());
// > 0
```
*/
BigInteger.prototype.shr = function (bits) {
var h = 0;
var r = bits % WORD_SIZE;
var s = Math.min((bits - r) / WORD_SIZE, this.length);
var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
h -= s;
h = Math.max(0, h);
if (s === 0) {
// No-op, we should not move anything at all
}
else if (this.length > s) {
for (var i = 0; i < this.length - s; i++) {
this.words[i] = this.words[i + s];
}
this.words.length -= s;
}
else {
this.words = [0];
}
var carry = 0;
for (var i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {
var word = this.words[i] | 0;
this.words[i] = (carry << (WORD_SIZE - r)) | (word >>> r);
carry = word & mask;
}
this.strip();
};
/**
* 转为字节数值
*
* @param endian 字节序
* @param length 字节长度
* @example toArray():base
```js
var bi = new jints.BigInteger('0x1234567890ab');
console.log(JSON.stringify(bi.toArray()));
// > [171,144,120,86,52,18]
console.log(JSON.stringify(bi.toArray('be')));
// > [18,52,86,120,144,171]
```
* @example toArray():length
```js
var bi = new jints.BigInteger('0x1234567890ab');
console.log(JSON.stringify(bi.toArray('be', 8)));
// > [0,0,18,52,86,120,144,171]
console.log(JSON.stringify(bi.toArray('le', 8)));
// > [171,144,120,86,52,18,0,0]
```
*/
BigInteger.prototype.toArray = function (endian, length) {
if (endian === void 0) { endian = 'le'; }
if (length === void 0) { length = 0; }
var byteLength = this.byteLength();
var reqLength = length || Math.max(1, byteLength);
var result = new Array(reqLength);
var q = this.clone();
var i;
if (endian !== 'le') {
// Assume big-endian
for (i = 0; i < reqLength - byteLength; i++) {
result[i] = 0;
}
for (i = 0; !q.isZero(); i++) {
var b = q.and(0xff);
q.shr(8);
result[reqLength - i - 1] = b;
}
}
else {
for (i = 0; !q.isZero(); i++) {
var b = q.and(0xff);
q.shr(8);
result[i] = b;
}
for (; i < reqLength; i++) {
result[i] = 0;
}
}
return result;
};
/**
* 从数值中转换
*
* @param arr 数组 Uint8Array
* @param endian 字节序
* @example fromArray():base
```js
var bi = new jints.BigInteger();
bi.fromArray([1, 2, 3, 4, 5, 6]);
console.log(bi.toString(16));
// > 60504030201
```
* @example fromArray():coverage
```js
var bi = new jints.BigInteger();
bi.fromArray([]);
console.log(bi.toString());
// > 0
var bi = new jints.BigInteger();
bi.fromArray([1, 2, 3, 4, 5, 6], 'be');
console.log(bi.toString(16));
// > 10203040506
```
*/
BigInteger.prototype.fromArray = function (arr, endian) {
if (endian === void 0) { endian = 'le'; }
// Perhaps a Uint8Array
if (arr.length <= 0) {
this.words = [0];
return this;
}
var length = Math.ceil(arr.length / 3);
this.words = new Array(length);
for (var i = 0; i < length; i++) {
this.words[i] = 0;
}
var off = 0;
if (endian === 'be') {
for (var i = arr.length - 1, j = 0; i >= 0; i -= 3) {
var w = arr[i] | (arr[i - 1] << 8) | (arr[i - 2] << 16);
this.words[j] |= (w << off) & 0x3ffffff;
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
off += 24;
if (off >= 26) {
off -= 26;
j++;
}
}
}
else {
for (var i = 0, j = 0; i < arr.length; i += 3) {
var w = arr[i] | (arr[i + 1] << 8) | (arr[i + 2] << 16);
this.words[j] |= (w << off) & 0x3ffffff;
this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
off += 24;
if (off >= 26) {
off -= 26;
j++;
}
}
}
this.strip();
};
/**
* 取绝对值
*
* @example abs():base
```js
var bi = new jints.BigInteger(-1);
bi.abs();
console.log(bi.toString());
// > 1
```
*/
BigInteger.prototype.abs = function () {
this.negative = 0;
};
BigInteger.prototype.expand = function (size) {
while (this.length < size) {
this.words[this.words.length++] = 0;
}
};
/**
* 取补码
*
* @example twos():base
```js
var bi = new jints.BigInteger('-0b1010');
bi.twos(8);
console.log(bi.toString(2));
// > 11110110
```
* @example twos():unsigned
```js
var bi = new jints.BigInteger('0b1010');
bi.twos(8);
console.log(bi.toString(2));
// > 1010
```
*/
BigInteger.prototype.twos = function (bitSize) {
if (this.negative !== 0) {
this.abs();
this.not(bitSize);
this.add(1);
}
};
/**
* 取非值
*
* @example not():base
```js
var bi = new jints.BigInteger('0b1010');
bi.not(8);
console.log(bi.toString(2));
// > 11110101
```
* @example not():coverage
```js
var bi = new jints.BigInteger('0b1010');
bi.not(26);
console.log(bi.toString(2));
// > 11111111111111111111110101
var bi = new jints.BigInteger('0b1010');
bi.not(28);
console.log(bi.toString(2));
// > 1111111111111111111111110101
```
*/
BigInteger.prototype.not = function (bitSize) {
var bytesNeeded = Math.ceil(bitSize / WORD_SIZE) | 0;
var bitsLeft = bitSize % WORD_SIZE;
// Extend the buffer with leading zeroes
this.expand(bytesNeeded);
if (bitsLeft > 0) {
bytesNeeded--;
}
// Handle complete words
var i = 0;
for (; i < bytesNeeded; i++) {
this.words[i] = ~this.words[i] & 0x3ffffff;
}
// Handle the residue
if (bitsLeft > 0) {
this.words[i] = ~this.words[i] & (0x3ffffff >> (WORD_SIZE - bitsLeft));
}
// And remove leading zeroes
this.strip();
};
return BigInteger;
}()); /*</function>*/
/*<function name="UInt64" depend="BigInteger">*/
var UInt64 = (function () {
/**
* Creates and returns a new 64-bit signed integer.
* This may be specified as an integer (if the value can be represented as a 32-bit value),
* another 64-bit integer object (either signed or unsigned), or as a string, which may consist of an optional minus sign,
* followed by either a decimal number or "0x" or "0X" followed by a hexadecimal number.
* The string is then converted into the corresponding 64-bit integer value.
* You can therefore use a string to represent a 64-bit value that is too large to represent as a 32-bit JavaScript Number.
*
* @param value The value to assign the new 64-bit integer object.
* @return A new object representing the specified value.
* @exception TypeError The specified value cannot be converted into a 64-bit integer. Either it's not a Number, String, or 64-bit integer object, or it's a string that is incorrectly formatted or contains a value outside the range that can be represented in 64 bits. This will also be thrown if the source value is a floating-point number that can't be precisely represented as a 64-bit integer.
* @example UInt64():base
```js
var uint64 = new jints.UInt64('0x12345');
console.log(uint64.toString());
// > 74565
console.log(uint64.low);
// > 74565
console.log(uint64.high);
// > 0
```
* @example UInt64():-1
```js
var uint64 = new jints.UInt64(-1);
console.log(uint64.toString(16));
// > ffffffffffffffff
```
*/
function UInt64(value) {
this.value = new BigInteger(value);
this.value.twos(64);
var arr32 = new Int32Array(new Uint8Array(this.toArray()).buffer);
this.low = arr32[0];
this.high = arr32[1];
}
/**
* Compares two 64-bit integer values.
*
* @param a The first value to compare.
* @param b The second value to compare.
* @return The returned value is: -1 if a < b, 0 if a == b, and 1 if a > b.
* @exception One or both of the specified values is not a 64-bit integer (either signed or unsigned).
* @example UInt64.compare():base
```js
var a = new jints.UInt64('0x12345');
var b = new jints.UInt64('0x12345');
console.log(jints.UInt64.compare(a, b));
// > 0
```
*/
UInt64.compare = function (a, b) {
return a.value.compare(b.value);
};
/**
* Returns the high 32 bits of the specified value.
*
* @param num The value whose high 32 bits are to be returned.
* @return The high 32 bits of num are returned. This is essentially num >> 32.
* @exception TypeError num is not a 64-bit integer object.
* @example UInt64.hi():base
```js
var a = new jints.UInt64('0x12345');
console.log(jints.UInt64.hi(a));
// > 0
```
*/
UInt64.hi = function (num) {
return num.high;
};
/**
* Returns the low 32 bits of the specified value.
* @param num The UInt64 value whose low 32 bits are to be returned.
* @return The high 32 bits of num are returned. This is essentially num & 0xFFFFFFFF.
* @exception TypeError num is not a 64-bit integer object.
* @example UInt64.lo():base
```js
var a = new jints.UInt64('0x12345');
console.log(jints.UInt64.lo(a));
// > 74565
```
*/
UInt64.lo = function (num) {
return num.low;
};
/**
* Creates a 64-bit integer object whose value is constructed using the specified high and low order 32-bit values.
*
* @param high The high-order 32 bits of the value to create.
* @param low The low-order 32 bits of the value to create.
* @return A new 64-bit integer object comprised of the two values merged together. The returned value is (high << 32) + low.
* @exception TypeError One or both of the specified numbers is not a JavaScript number with an integral value.
* @example UInt64.join():base
```js
var a = new jints.UInt64.join(1234, 5678);
console.log(a.low);
// > 5678
console.log(a.high);
// > 1234
console.log(a.toString());
// > 5299989648942
```
*/
UInt64.join = function (high, low) {
var result = new UInt64(0);
var arr8 = new Uint8Array(new Int32Array([low, high]).buffer);
result.value.fromArray(arr8);
result.low = low;
result.high = high;
return result;
};
/**
* Returns a string representation of the object's numeric value.
*
* @param radix The radix (base) to use when constructing the string. If you don't specify a radix, base 10 is used.
* @return A string representation of the value in the specified radix. This string consists of a leading minus sign, if the value was negative, followed by one or more lower-case digits in the specified radix.
* @example toString():base
```js
var a = new jints.UInt64.join(1234, 5678);
console.log(a.toString(16));
// > 4d20000162e
```
*/
UInt64.prototype.toString = function (radix) {
if (radix === void 0) { radix = 10; }
return this.value.toString(radix);
};
/**
* Convert to byte Array, and optionally zero pad to length, throwing if already exceeding
*
* @param endian endian
* @example toArray():base
```js
var a = new jints.UInt64.join(1234, 5678);
console.log(JSON.stringify(a.toArray()));
// > [46,22,0,0,210,4,0,0]
console.log(JSON.stringify(a.toArray('be')));
// > [0,0,4,210,0,0,22,46]
```
*/
UInt64.prototype.toArray = function (endian) {
if (endian === void 0) { endian = 'le'; }
return this.value.toArray(endian, 8);
};
return UInt64;
}()); /*</function>*/
/*<function name="Int64" depend="BigInteger">*/
var Int64 = (function () {
/**
* Creates and returns a new 64-bit signed integer.
* This may be specified as an integer (if the value can be represented as a 32-bit value),
* another 64-bit integer object (either signed or unsigned), or as a string, which may consist of an optional minus sign,
* followed by either a decimal number or "0x" or "0X" followed by a hexadecimal number.
* The string is then converted into the corresponding 64-bit integer value.
* You can therefore use a string to represent a 64-bit value that is too large to represent as a 32-bit JavaScript Number.
*
* @param value The value to assign the new 64-bit integer object.
* @return A new object representing the specified value.
* @exception TypeError The specified value cannot be converted into a 64-bit integer. Either it's not a Number, String, or 64-bit integer object, or it's a string that is incorrectly formatted or contains a value outside the range that can be represented in 64 bits. This will also be thrown if the source value is a floating-point number that can't be precisely represented as a 64-bit integer.
* @example Int64():base
```js
var int64 = new jints.Int64('0x12345');
console.log(int64.toString());
// > 74565
console.log(int64.low);
// > 74565
console.log(int64.high);
// > 0
```
*/
function Int64(value) {
this.value = new BigInteger(value);
var arr32 = new Int32Array(new Uint8Array(this.toArray()).buffer);
this.low = arr32[0];
this.high = arr32[1];
}
/**
* Compares two 64-bit integer values.
*
* @param a The first value to compare.
* @param b The second value to compare.
* @return The returned value is: -1 if a < b, 0 if a == b, and 1 if a > b.
* @exception One or both of the specified values is not a 64-bit integer (either signed or unsigned).
* @example Int64.compare():base
```js
var a = new jints.Int64('0x12345');
var b = new jints.Int64('0x12345');
console.log(jints.Int64.compare(a, b));
// > 0
```
*/
Int64.compare = function (a, b) {
return a.value.compare(b.value);
};
/**
* Returns the high 32 bits of the specified value.
*
* @param num The value whose high 32 bits are to be returned.
* @return The high 32 bits of num are returned. This is essentially num >> 32.
* @exception TypeError num is not a 64-bit integer object.
* @example Int64.hi():base
```js
var a = new jints.Int64('0x12345');
console.log(jints.Int64.hi(a));
// > 0
```
*/
Int64.hi = function (num) {
return num.high;
};
/**
* Returns the low 32 bits of the specified value.
* @param num The Int64 value whose low 32 bits are to be returned.
* @return The high 32 bits of num are returned. This is essentially num & 0xFFFFFFFF.
* @exception TypeError num is not a 64-bit integer object.
* @example Int64.lo():base
```js
var a = new jints.Int64('0x12345');
console.log(jints.Int64.lo(a));
// > 74565
```
*/
Int64.lo = function (num) {
return num.low;
};
/**
* Creates a 64-bit integer object whose value is constructed using the specified high and low order 32-bit values.
*
* @param high The high-order 32 bits of the value to create.
* @param low The low-order 32 bits of the value to create.
* @return A new 64-bit integer object comprised of the two values merged together. The returned value is (high << 32) + low.
* @exception TypeError One or both of the specified numbers is not a JavaScript number with an integral value.
* @example Int64.join():base
```js
var a = new jints.Int64.join(1234, 5678);
console.log(a.low);
// > 5678
console.log(a.high);
// > 1234
console.log(a.toString());
// > 5299989648942
```
* @example Int64.join():-1
```js
var a = new jints.Int64.join(-1, -1);
console.log(a.low);
// > -1
console.log(a.high);
// > -1
console.log(a.toString());
// > -1
```
* @example Int64.join():-0x1234567890abcdef
```js
var a = new jints.Int64('-0x1234567890abcdef');
var b = jints.Int64.join(a.high, a.low)
console.log(b.toString(16));
// > -1234567890abcdef
```
*/
Int64.join = function (high, low) {
var result = new Int64(0);
var arr8 = new Uint8Array(new Int32Array([low, high]).buffer);
result.value.fromArray(arr8);
if (high < 0) {
result.value.negative = 1;
result.value.twos(64);
result.value.negative = 1;
}
result.low = low;
result.high = high;
return result;
};
/**
* Returns a string representation of the object's numeric value.
*
* @param radix The radix (base) to use when constructing the string. If you don't specify a radix, base 10 is used.
* @return A string representation of the value in the specified radix. This string consists of a leading minus sign, if the value was negative, followed by one or more lower-case digits in the specified radix.
* @example toString():base
```js
var a = new jints.Int64.join(1234, 5678);
console.log(a.toString(16));
// > 4d20000162e
```
* @example Int64():-1
```js
var int64 = new jints.Int64(-1);
console.log(int64.toString(16));
// > -1
```
*/
Int64.prototype.toString = function (radix) {
if (radix === void 0) { radix = 10; }
return this.value.toString(radix);
};
/**
* Convert to byte Array, and optionally zero pad to length, throwing if already exceeding
*
* @param endian endian
* @example toArray():base
```js
var a = new jints.Int64.join(1234, 5678);
console.log(JSON.stringify(a.toArray()));
// > [46,22,0,0,210,4,0,0]
console.log(JSON.stringify(a.toArray('be')));
// > [0,0,4,210,0,0,22,46]
```
* @example toArray():-1
```js
var int64 = new jints.Int64(-1);
console.log(JSON.stringify(int64.toArray()));
// > [255,255,255,255,255,255,255,255]
```
*/
Int64.prototype.toArray = function (endian) {
if (endian === void 0) { endian = 'le'; }
var c = this.value.clone();
c.twos(64);
return c.toArray(endian, 8);
};
return Int64;
}()); /*</function>*/
var exports = {
BigInteger: BigInteger,
UInt64: UInt64,
Int64: Int64,
};
/* istanbul ignore next */
if (typeof define === 'function') {
if (define.amd || define.cmd) {
define(function() {
return exports;
});
}
} else if (typeof module !== 'undefined' && module.exports) {
module.exports = exports;
} else {
window[exportName] = exports;
}
})('jints');
},{}],13:[function(require,module,exports){
// shim for using process in browser
var process = module.exports = {};
// cached from whatever global is present so that test runners that stub it
// don't break things. But we need to wrap it in a try catch in case it is
// wrapped in strict mode code which doesn't define any globals. It's inside a
// function because try/catches deoptimize in certain engines.
var cachedSetTimeout;
var cachedClearTimeout;
function defaultSetTimout() {
throw new Error('setTimeout has not been defined');
}
function defaultClearTimeout () {
throw new Error('clearTimeout has not been defined');
}
(function () {
try {
if (typeof setTimeout === 'function') {
cachedSetTimeout = setTimeout;
} else {
cachedSetTimeout = defaultSetTimout;
}
} catch (e) {
cachedSetTimeout = defaultSetTimout;
}
try {
if (typeof clearTimeout === 'function') {
cachedClearTimeout = clearTimeout;
} else {
cachedClearTimeout = defaultClearTimeout;
}
} catch (e) {
cachedClearTimeout = defaultClearTimeout;
}
} ())
function runTimeout(fun) {
if (cachedSetTimeout === setTimeout) {
//normal enviroments in sane situations
return setTimeout(fun, 0);
}
// if setTimeout wasn't available but was latter defined
if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
cachedSetTimeout = setTimeout;
return setTimeout(fun, 0);
}
try {
// when when somebody has screwed with setTimeout but no I.E. maddness
return cachedSetTimeout(fun, 0);
} catch(e){
try {
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
return cachedSetTimeout.call(null, fun, 0);
} catch(e){
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
return cachedSetTimeout.call(this, fun, 0);
}
}
}
function runClearTimeout(marker) {
if (cachedClearTimeout === clearTimeout) {
//normal enviroments in sane situations
return clearTimeout(marker);
}
// if clearTimeout wasn't available but was latter defined
if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
cachedClearTimeout = clearTimeout;
return clearTimeout(marker);
}
try {
// when when somebody has screwed with setTimeout but no I.E. maddness
return cachedClearTimeout(marker);
} catch (e){
try {
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
return cachedClearTimeout.call(null, marker);
} catch (e){
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
// Some versions of I.E. have different rules for clearTimeout vs setTimeout
return cachedClearTimeout.call(this, marker);
}
}
}
var queue = [];
var draining = false;
var currentQueue;
var queueIndex = -1;
function cleanUpNextTick() {
if (!draining || !currentQueue) {
return;
}
draining = false;
if (currentQueue.length) {
queue = currentQueue.concat(queue);
} else {
queueIndex = -1;
}
if (queue.length) {
drainQueue();
}
}
function drainQueue() {
if (draining) {
return;
}
var timeout = runTimeout(cleanUpNextTick);
draining = true;
var len = queue.length;
while(len) {
currentQueue = queue;
queue = [];
while (++queueIndex < len) {
if (currentQueue) {
currentQueue[queueIndex].run();
}
}
queueIndex = -1;
len = queue.length;
}
currentQueue = null;
draining = false;
runClearTimeout(timeout);
}
process.nextTick = function (fun) {
var args = new Array(arguments.length - 1);
if (arguments.length > 1) {
for (var i = 1; i < arguments.length; i++) {
args[i - 1] = arguments[i];
}
}
queue.push(new Item(fun, args));
if (queue.length === 1 && !draining) {
runTimeout(drainQueue);
}
};
// v8 likes predictible objects
function Item(fun, array) {
this.fun = fun;
this.array = array;
}
Item.prototype.run = function () {
this.fun.apply(null, this.array);
};
process.title = 'browser';
process.browser = true;
process.env = {};
process.argv = [];
process.version = ''; // empty string to avoid regexp issues
process.versions = {};
function noop() {}
process.on = noop;
process.addListener = noop;
process.once = noop;
process.off = noop;
process.removeListener = noop;
process.removeAllListeners = noop;
process.emit = noop;
process.prependListener = noop;
process.prependOnceListener = noop;
process.listeners = function (name) { return [] }
process.binding = function (name) {
throw new Error('process.binding is not supported');
};
process.cwd = function () { return '/' };
process.chdir = function (dir) {
throw new Error('process.chdir is not supported');
};
process.umask = function() { return 0; };
},{}],14:[function(require,module,exports){
var indexOf = function (xs, item) {
if (xs.indexOf) return xs.indexOf(item);
else for (var i = 0; i < xs.length; i++) {
if (xs[i] === item) return i;
}
return -1;
};
var Object_keys = function (obj) {
if (Object.keys) return Object.keys(obj)
else {
var res = [];
for (var key in obj) res.push(key)
return res;
}
};
var forEach = function (xs, fn) {
if (xs.forEach) return xs.forEach(fn)
else for (var i = 0; i < xs.length; i++) {
fn(xs[i], i, xs);
}
};
var defineProp = (function() {
try {
Object.defineProperty({}, '_', {});
return function(obj, name, value) {
Object.defineProperty(obj, name, {
writable: true,
enumerable: false,
configurable: true,
value: value
})
};
} catch(e) {
return function(obj, name, value) {
obj[name] = value;
};
}
}());
var globals = ['Array', 'Boolean', 'Date', 'Error', 'EvalError', 'Function',
'Infinity', 'JSON', 'Math', 'NaN', 'Number', 'Object', 'RangeError',
'ReferenceError', 'RegExp', 'String', 'SyntaxError', 'TypeError', 'URIError',
'decodeURI', 'decodeURIComponent', 'encodeURI', 'encodeURIComponent', 'escape',
'eval', 'isFinite', 'isNaN', 'parseFloat', 'parseInt', 'undefined', 'unescape'];
function Context() {}
Context.prototype = {};
var Script = exports.Script = function NodeScript (code) {
if (!(this instanceof Script)) return new Script(code);
this.code = code;
};
Script.prototype.runInContext = function (context) {
if (!(context instanceof Context)) {
throw new TypeError("needs a 'context' argument.");
}
var iframe = document.createElement('iframe');
if (!iframe.style) iframe.style = {};
iframe.style.display = 'none';
document.body.appendChild(iframe);
var win = iframe.contentWindow;
var wEval = win.eval, wExecScript = win.execScript;
if (!wEval && wExecScript) {
// win.eval() magically appears when this is called in IE:
wExecScript.call(win, 'null');
wEval = win.eval;
}
forEach(Object_keys(context), function (key) {
win[key] = context[key];
});
forEach(globals, function (key) {
if (context[key]) {
win[key] = context[key];
}
});
var winKeys = Object_keys(win);
var res = wEval.call(win, this.code);
forEach(Object_keys(win), function (key) {
// Avoid copying circular objects like `top` and `window` by only
// updating existing context properties or new properties in the `win`
// that was only introduced after the eval.
if (key in context || indexOf(winKeys, key) === -1) {
context[key] = win[key];
}
});
forEach(globals, function (key) {
if (!(key in context)) {
defineProp(context, key, win[key]);
}
});
document.body.removeChild(iframe);
return res;
};
Script.prototype.runInThisContext = function () {
return eval(this.code); // maybe...
};
Script.prototype.runInNewContext = function (context) {
var ctx = Script.createContext(context);
var res = this.runInContext(ctx);
if (context) {
forEach(Object_keys(ctx), function (key) {
context[key] = ctx[key];
});
}
return res;
};
forEach(Object_keys(Script.prototype), function (name) {
exports[name] = Script[name] = function (code) {
var s = Script(code);
return s[name].apply(s, [].slice.call(arguments, 1));
};
});
exports.isContext = function (context) {
return context instanceof Context;
};
exports.createScript = function (code) {
return exports.Script(code);
};
exports.createContext = Script.createContext = function (context) {
var copy = new Context();
if(typeof context === 'object') {
forEach(Object_keys(context), function (key) {
copy[key] = context[key];
});
}
return copy;
};
},{}],15:[function(require,module,exports){
const jints = require("jints");
function decode64bits(buff,size) {
if(typeof(size) != "number") size = 1;
return new jints.UInt64(buff).toArray();
//return _.float64("value").unpack(buff);
}
function encode64bits(i,size) {
if(typeof(size) != "number") size = 1;
return new jints.UInt64(i).toArray();
//return _.float64("value",size).pack(i);
}
module.exports = {
decode64bits: decode64bits,
encode64bits: encode64bits
};
},{"jints":12}],16:[function(require,module,exports){
const assert = require("assert").ok;
const MAILBOX_BASE = 0x10000000;
const MAILBOX_SIZE = 0x00000009;
const MAILBOX_END = MAILBOX_BASE+MAILBOX_SIZE;
class Mailbox {
constructor() {
this.devices = [];
this.devIndex = 0;
this.dataIndex = 0;
}
destroy() {
for(var dev of this.devices) {
if(dev.destroy) dev.destroy(dev,this);
}
}
isValidDeviceIndex(i) {
return i >= 0 && this.devices.length > i;
}
reset(vm) {
vm.mmap(MAILBOX_BASE,MAILBOX_END,i => {
switch(i) {
case 0: return this.devices.length;
case 1: return this.devIndex;
case 2: return this.dataIndex;
case 3:
if(this.isValidDeviceIndex(this.devIndex)) {
if(this.devices[this.devIndex].read) return this.devices[this.devIndex].read(this.devices[this.devIndex],this.dataIndex);
} else return 0xFFFF;
case 4:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.vendorID;
else return 0xFFFF;
case 5:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.deviceID;
else return 0xFFFF;
case 6:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.rev;
else return 0xFFFF;
case 7:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.type;
else return 0xFFFF;
case 8:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.classCode;
else return 0xFFFF;
case 9:
if(this.isValidDeviceIndex(this.devIndex)) return this.devices[this.devIndex].hdr.subclass;
else return 0xFFFF;
}
return 0;
},(i,v) => {
switch(i) {
case 1:
this.devIndex = v;
break;
case 2:
this.dataIndex = v;
break;
case 3:
if(this.isValidDeviceIndex(this.devIndex)) {
if(this.devices[this.devIndex].write) return this.devices[this.devIndex].write(this.devices[this.devIndex],this.dataIndex,v);
} else return 0xFFFF;
}
});
for(var dev of this.devices) {
if(dev.reset) dev.reset(dev,vm);
}
}
cycle(vm) {
for(var dev of this.devices) {
if(dev.cycle) dev.cycle(dev,vm);
}
}
addDevice(dev) {
assert(typeof(dev) == "object","dev is not an object");
assert(typeof(dev.hdr) == "object","dev.hdr is not an object");
assert(typeof(dev.hdr.vendorID) == "number","dev.hdr.vendorID is not a number");
assert(typeof(dev.hdr.deviceID) == "number","dev.hdr.deviceID is not a number");
assert(typeof(dev.hdr.rev) == "number","dev.hdr.rev is not a number");
assert(typeof(dev.hdr.type) == "number","dev.hdr.type is not a number");
assert(typeof(dev.hdr.classCode) == "number","dev.hdr.classCode is not a number");
assert(typeof(dev.hdr.subclass) == "number","dev.hdr.subclass is not a number");
assert(typeof(dev.name) == "string","dev.name is not a string");
var i = this.devices.push(dev)-1;
if(this.devices[i].create) this.devices[i].create(this.devices[i]);
}
}
module.exports = Mailbox;
},{"assert":3}],17:[function(require,module,exports){
const RTC_BASE = 0x1000000A;
const RTC_SIZE = 0x00000007;
const RTC_END = RTC_BASE+RTC_SIZE;
Date.prototype.stdTimezoneOffset = function () {
var jan = new Date(this.getFullYear(),0,1);
var jul = new Date(this.getFullYear(),6,1);
return Math.max(jan.getTimezoneOffset(),jul.getTimezoneOffset());
}
Date.prototype.isDstObserved = function () {
return this.getTimezoneOffset() < this.stdTimezoneOffset();
}
class RTC {
constructor() {
this.timers = [];
}
destroy() {}
reset(vm) {
vm.mmap(RTC_BASE,RTC_END,i => {
switch(i) {
case 0: return new Date().getSeconds();
case 1: return new Date().getMinutes();
case 2: return new Date().getHours();
case 3: return new Date().getDate();
case 4: return new Date().getMonth();
case 5: return new Date().getFullYear();
case 6: return new Date().isDstObserved();
case 7: return this.timers.length;
}
return 0;
},(i,v) => {
switch(i) {
case 7:
this.createTimer(v,vm);
break;
}
});
}
cycle(vm) {}
createTimer(time,vm) {
this.timers.push(setInterval((i) => {
// TODO: trigger irq
clearInterval(this.timers[i]);
delete this.timers[i];
},time,this.timers.length));
}
}
module.exports = RTC;
},{}],18:[function(require,module,exports){
(function (Buffer){
const EventEmitter = require("events");
const UART_BASE = 0x10000012;
const UART_SIZE = 0x00000003;
const UART_END = UART_BASE+UART_SIZE;
class UART extends EventEmitter {
constructor() {
super();
this.input = [];
this.on("input",(d) => {
this.input.push(d);
});
}
destroy() {}
reset(vm) {
vm.mmap(UART_BASE,UART_END,i => {
switch(i) {
case 0: return this.input.length > 0;
case 1: return this.input.shift() || 0;
case 2: return 1;
}
return 0;
},(i,v) => {
switch(i) {
case 1: this.emit("output",Buffer.from([v]).toString());
}
});
}
cycle(vm) {
}
}
module.exports = UART;
}).call(this,require("buffer").Buffer)
},{"buffer":9,"events":10}],19:[function(require,module,exports){
(function (Buffer){
const EventEmitter = require("events");
const fs = require("fs");
const jints = require("jints");
const Mailbox = require("./hardware/mailbox");
const RTC = require("./hardware/rtc");
const UART = require("./hardware/uart");
const CPU_REG_FLAG_INTR = (1 << 0);
const CPU_INT = {
"STACK_OVERFLOW": 0,
"FAULT": 1,
"BADADDR": 2,
"DIVBYZERO": 3,
"BADINSTR": 4,
"TIMER": 5
};
const IO_RAM_BASE = 0xA0000000;
const IO_RAM_SIZE = 0x40000000;
const IO_RAM_END = IO_RAM_BASE+IO_RAM_SIZE;
function setupRegisters() {
return {
flags: new Float64Array(1),
tmp: new Float64Array(1),
sp: new Float64Array(1),
ip: new Float64Array(1),
pc: new Float64Array(1),
cycle: new Float64Array(1),
data: new Float64Array(10),
index: new Float64Array(10),
addr: new Float64Array(10),
ptr: new Float64Array(10)
};
}
class VirtualMachine extends EventEmitter {
constructor(opts = {}) {
super();
this.cpu = {
regs: setupRegisters(),
iregs: setupRegisters(),
stack: new Float64Array(20),
ivt: new Float64Array(6),
intr: new Float64Array(1),
running: false,
clockspeed: 1
};
this.ioctl = {
ram: new Float64Array(IO_RAM_SIZE),
mmap: []
};
this.opts = opts;
this.mailbox = new Mailbox();
this.rtc = new RTC();
this.uart = new UART();
}
destroy() {
if(this.mailbox) this.mailbox.destroy(this);
if(this.rtc) this.rtc.destroy(this);
if(this.uart) this.uart.destroy(this);
this.emit("destroy");
}
reset() {
/* (Re)initialize the RAM */
if(this.ioctl.ram) delete this.ioctl.ram;
this.ioctl.ram = new Float64Array(IO_RAM_SIZE);
/* (Re)initialize the memory map in the IO Controller */
if(this.ioctl.mmap) delete this.ioctl.mmap;
this.ioctl.mmap = [];
this.mmap(IO_RAM_BASE,IO_RAM_END,i => this.ioctl.ram[i],(i,v) => { this.ioctl.ram[i] = v; });
/* Reset the mailbox */
if(this.mailbox) this.mailbox.reset(this);
/* Reset the RTC */
if(this.rtc) this.rtc.reset(this);
/* Reset the UART */
if(this.uart) this.uart.reset(this);
/* Reset the registers */
this.cpu.regs = this.cpu.iregs = setupRegisters();
/* Reset the CPU */
this.cpu.stack.fill(0);
this.cpu.ivt.fill(0);
this.cpu.intr[0] = 0;
this.cpu.running = false;
this.emit("reset");
}
intr(i) {
if(i > this.cpu.ivt.length) throw new Error("SAVM_ERROR_INVAL_INT");
if(this.cpu.regs.flags[0] & CPU_REG_FLAG_INTR) {
this.cpu.intr[0] = CPU_INT["FAULT"];
return this.emit("cpu/interrupt",i);
}
this.cpu.iregs = this.cpu.regs;
this.cpu.regs.flags[0] |= CPU_REG_FLAG_INTR;
this.cpu.intr[0] = i;
this.cpu.regs.pc[0] = this.cpu.ivt[i];
this.emit("cpu/interrupt",i);
}
regread(i) {
this.emit("cpu/registers/read",i);
switch(i) {
case 0: /* flags */ return this.cpu.regs.flags[0];
case 1: /* tmp */ return this.cpu.regs.tmp[0];
case 2: /* sp */ return this.cpu.regs.sp[0];
case 3: /* ip */ return this.cpu.regs.ip[0];
case 4: /* pc */ return this.cpu.regs.pc[0];
case 5: /* cycle */ return this.cpu.regs.cycle[0];
default:
if(i >= 6 && i < 16) return this.cpu.regs.data[i-6];
if(i >= 17 && i < 27) return this.cpu.regs.index[i-17];
if(i >= 28 && i < 38) return this.cpu.regs.addr[i-28];
if(i >= 39 && i < 49) return this.cpu.regs.ptr[i-39];
throw new Error("SAVM_ERROR_INVAL_ADDR");
}
}
regwrite(i,v) {
switch(i) {
case 0: /* flags */
this.cpu.regs.flags[0] = v;
break;
case 1: /* tmp */
this.cpu.regs.tmp[0] = v;
break;
case 2: /* sp */
this.cpu.regs.sp[0] = v;
break;
case 3: /* ip */
this.cpu.regs.ip[0] = v;
break;
case 4: /* pc */
this.cpu.regs.pc[0] = v;
break;
case 5: /* cycle */
this.cpu.regs.cycle[0] = v;
break;
default:
if(i >= 6 && i < 16) {
this.cpu.regs.data[i-6] = v;
break;
}
if(i >= 17 && i < 27) {
this.cpu.regs.index[i-17] = v;
break;
}
if(i >= 28 && i < 38) {
this.cpu.regs.addr[i-28] = v;
break;
}
if(i >= 39 && i < 49) {
this.cpu.regs.ptr[i-39] = v;
break;
}
throw new Error("SAVM_ERROR_INVAL_ADDR");
}
this.emit("cpu/registers/write",i,v);
}
cycle() {
if(this.cpu.regs.pc[0] == 0) this.cpu.regs.pc[0] = IO_RAM_BASE+(this.cpu.regs.cycle[0]*3);
/* Fetches the instruction from memory */
this.cpu.regs.ip[0] = this.read(this.cpu.regs.pc[0]);
/* Decodes the instruction */
var addr = this.read(this.cpu.regs.pc[0]+1);
var val = this.read(this.cpu.regs.pc[0]+2);
this.cpu.regs.pc[0] += 3;
/* Execute the instruction */
try {
switch(this.cpu.regs.ip[0]) {
case 0: /* NOP */
this.stop();
break;
case 1: /* ADDR */
this.regwrite(addr,this.regread(addr)+this.regread(val));
break;
case 2: /* ADDM */
this.write(addr,this.read(addr)+this.read(val));
break;
case 3: /* SUBR */
this.regwrite(addr,this.regread(addr)-this.regread(val));
break;
case 4: /* SUBM */
this.write(addr,this.read(addr)-this.read(val));
break;
case 5: /* MULR */
this.regwrite(addr,this.regread(addr)*this.regread(val));
break;
case 6: /* MULM */
this.write(addr,this.read(addr)*this.read(val));
break;
case 7: /* DIVR */
if(this.regread(val) == 0) {
this.intr(CPU_INT["DIVBYZERO"]);
break;
}
this.regwrite(addr,this.regread(addr)/this.regread(val));
break;
case 8: /* DIVM */
if(this.read(val) == 0) {
this.intr(CPU_INT["DIVBYZERO"]);
break;
}
this.write(addr,this.read(addr)/this.read(val));
break;
case 9: /* ANDR */
this.regwrite(addr,this.regread(addr) & this.regread(val));
break;
case 10: /* ANDM */
this.write(addr,this.read(addr) & this.read(val));
break;
case 11: /* ORR */
this.regwrite(addr,this.regread(addr) | this.regread(val));
break;
case 12: /* ORM */
this.write(addr,this.read(addr) | this.read(val));
break;
case 13: /* XORR */
this.regwrite(addr,this.regread(addr) ^ this.regread(val));
break;
case 14: /* XORM */
this.write(addr,this.read(addr) ^ this.read(val));
break;
case 15: /* NORR */
this.regwrite(addr,~(this.regread(addr) | this.regread(val)));
break;
case 16: /* NORM */
this.write(addr,~(this.read(addr) | this.read(val)));
break;
case 17: /* NANDR */
this.regwrite(addr,~(this.regread(addr) & this.regread(val)));
break;
case 18: /* NANDM */
this.write(addr,~(this.read(addr) & this.read(val)));
break;
case 19: /* LSHIFTR */
this.regwrite(addr,this.regread(addr) << this.regread(val));
break;
case 20: /* LSHIFTM */
this.write(addr,this.read(addr) << this.read(val));
break;
case 21: /* RSHIFTR */
this.regwrite(addr,this.regread(addr) >> this.regread(val));
break;
case 22: /* RSHIFTM */
this.write(addr,this.read(addr) >> this.read(val));
break;
case 23: /* CMPR */
this.cpu.regs.tmp[0] = this.regread(addr) == this.regread(val);
break;
case 24: /* CMPM */
this.cpu.regs.tmp[0] = this.read(addr) == this.read(val);
break;
case 25: /* JITR */
if(this.cpu.regs.tmp[0]) this.cpu.regs.pc[0] = this.regread(addr);
break;
case 26: /* JITM */
if(this.cpu.regs.tmp[0]) this.cpu.regs.pc[0] = this.read(addr);
break;
case 27: /* JIT */
if(this.cpu.regs.tmp[0]) this.cpu.regs.pc[0] = addr;
break;
case 28: /* JMPR */
this.cpu.regs.pc[0] = this.regread(addr);
break;
case 29: /* JMPM */
this.cpu.regs.pc[0] = this.read(addr);
break;
case 30: /* JMP */
this.cpu.regs.pc[0] = addr;
break;
case 31: /* CALLR */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) {
this.cpu.stack[this.cpu.regs.sp[0]++] = this.cpu.regs.pc[0];
this.cpu.regs.pc[0] = this.regread(addr);
} else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 32: /* CALLM */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) {
this.cpu.stack[this.cpu.regs.sp[0]++] = this.cpu.regs.pc[0];
this.cpu.regs.pc[0] = this.read(addr);
} else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 33: /* CALL */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) {
this.cpu.stack[this.cpu.regs.sp[0]++] = this.cpu.regs.pc[0];
this.cpu.regs.pc[0] = addr;
} else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 34: /* RET */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) this.cpu.regs.pc[0] = this.cpu.stack[this.cpu.regs.sp[0]--];
else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 35: /* PUSHR */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) this.cpu.stack[this.cpu.regs.sp[0]++] = this.regread(addr);
else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 36: /* PUSHM */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) this.cpu.stack[this.cpu.regs.sp[0]++] = this.read(addr);
else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 37: /* POPR */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) this.regwrite(addr,this.cpu.stack[this.cpu.regs.sp[0]--]);
else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 38: /* POPM */
if(this.cpu.regs.sp[0] < this.cpu.stack.length) this.write(addr,this.cpu.stack[this.cpu.regs.sp[0]--]);
else this.intr(CPU_INT["STACK_OVERFLOW"]);
break;
case 39: /* MOVRR */
this.regwrite(addr,this.regread(val));
break;
case 40: /* MOVRM */
this.write(addr,this.regread(val));
break;
case 41: /* MOVMR */
this.regwrite(addr,this.read(val));
break;
case 42: /* MOVMM */
this.write(addr,this.read(val));
break;
case 43: /* STOR */
this.regwrite(addr,val);
break;
case 44: /* STOM */
this.write(addr,val);
break;
case 45: /* INTR */
var a = this.regread(addr);
try {
this.intr(a);
} catch(ex) {
this.intr(CPU_INT["BADADDR"]);
}
break;
case 46: /* INTM */
var a = this.read(addr);
try {
this.intr(a);
} catch(ex) {
this.intr(CPU_INT["BADADDR"]);
}
break;
case 47: /* INT */
try {
this.intr(addr);
} catch(ex) {
this.intr(CPU_INT["BADADDR"]);
}
break;
case 48: /* IRET */
if(this.cpu.regs.flags[0] & CPU_REG_FLAG_INTR) this.cpu.regs = this.cpu.iregs;
else this.intr(CPU_INT["FAULT"]);
break;
case 49: /* LDITBLR */
addr = this.regread(addr);
for(var i = 0;i < this.cpu.ivt.length;i++) this.cpu.ivt[i] = this.read(addr+i);
break;
case 50: /* LDITBLM */
addr = this.read(addr);
for(var i = 0;i < this.cpu.ivt.length;i++) this.cpu.ivt[i] = this.read(addr+i);
break;
case 51: /* HLT */
this.stop();
break;
default:
this.intr(CPU_INT["BADINSTR"]);
}
} catch(ex) {
if(ex.message == "SAVM_ERROR_NOTMAPPED") this.intr(CPU_INT["BADADDR"]);
else throw ex;
}
if(this.rtc) this.rtc.cycle(this);
if(this.mailbox) this.mailbox.cycle(this);
if(this.uart) this.uart.cycle(this);
this.emit("cpu/cycle");
this.cpu.regs.cycle[0]++;
}
_buff2uint64(buff) {
var u64 = new Float64Array(buff.length/8);
var index = 0;
for(var i = 0;i < buff.length;i += 8) {
var b = buff.slice(i,i+8);
var arr = new Int32Array(new Uint8Array(buff.slice(i,i+8)).buffer);
var v = new jints.UInt64.join(arr[1],arr[0]);
v = parseInt(v.toString());
u64[index++] = v;
}
return u64;
}
_uint642buff(u64) {
var buff = Buffer.alloc(u64.length*8);
var index = 0;
for(var i = 0;i < u64.length;i++) {
var arr = new jints.UInt64(u64[i]).toArray();
for(var x = 0;x < 8;x++) buff[index++] = arr[x];
}
return buff;
}
start() {
this.cpu.running = true;
this.emit("cpu/start");
this.interval = setInterval(() => {
this.cycle();
if(!this.cpu.running) this.stop();
},this.cpu.clockspeed);
}
stop() {
if(typeof(this.interval) == "number") clearInterval(this.interval);
this.cpu.running = false;
this.emit("cpu/stop");
}
loadFirmware(path) {
var buff = this._buff2uint64(fs.readFileSync(path));
for(var i = 0;i < buff.length;i++) this.ioctl.ram[i] = buff[i];
}
loadFile(addr,path) {
var buff = this._buff2uint64(fs.readFileSync(path));
for(var i = 0;i < buff.length;i++) this.write(addr,buff[i]);
}
dumpFile(addr,size,path) {
var buff = new Float64Array(size);
for(var i = 0;i < buff.length;i++) buff[i] = this.read(i);
fs.writeFileSync(path,this._uint642buff(buff));
}
mmap(addr,end,read = () => 0,write = () => {}) {
for(var entry of this.ioctl.mmap) {
if(entry.addr == addr && entry.end == end) throw new Error("SAVM_ERROR_MAPPED");
}
var i = this.ioctl.mmap.push({
addr: addr,
end: end,
read: read,
write: write
})-1;
this.emit("ioctl/mmap",addr,end,i);
}
read(addr) {
this.emit("ioctl/read",addr);
for(var entry of this.ioctl.mmap) {
if(entry.addr <= addr && entry.end > addr) return entry.read(addr-entry.addr);
}
throw new Error("SAVM_ERROR_NOTMAPPED");
}
write(addr,v) {
for(var entry of this.ioctl.mmap) {
if(entry.addr <= addr && entry.end > addr) {
entry.write(addr-entry.addr,v);
return this.emit("ioctl/write",addr,v);
}
}
throw new Error("SAVM_ERROR_NOTMAPPED");
}
}
module.exports = VirtualMachine;
}).call(this,require("buffer").Buffer)
},{"./hardware/mailbox":16,"./hardware/rtc":17,"./hardware/uart":18,"buffer":9,"events":10,"fs":8,"jints":12}]},{},[2]);
The uglifyjs CLI command executed or minify() options used.
uglifyjs ./dist/sa.js --compress -o ./dist/sa.min.js
JavaScript output or error produced.
Parse error at ./dist/sa.js:3,0
const fs = require("fs");
^
ERROR: Unexpected token: keyword (const)
at JS_Parse_Error.get (eval at <anonymous> (/home/spaceboyross/SherwoodArch/src/package/node_modules/uglify-js/tools/node.js:20:1), <anonymous>:71:23)
at fatal (/home/spaceboyross/SherwoodArch/src/package/node_modules/uglify-js/bin/uglifyjs:291:52)
at run (/home/spaceboyross/SherwoodArch/src/package/node_modules/uglify-js/bin/uglifyjs:235:9)
at Object.<anonymous> (/home/spaceboyross/SherwoodArch/src/package/node_modules/uglify-js/bin/uglifyjs:160:5)
at Module._compile (module.js:569:30)
at Object.Module._extensions..js (module.js:580:10)
at Module.load (module.js:503:32)
at tryModuleLoad (module.js:466:12)
at Function.Module._load (module.js:458:3)
at Function.Module.runMain (module.js:605:10)