8290 lines
251 KiB
Go
8290 lines
251 KiB
Go
package jsre
|
|
|
|
const Web3_JS = `require=(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file coder.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var BigNumber = require('bignumber.js');
|
|
var utils = require('../utils/utils');
|
|
var f = require('./formatters');
|
|
var SolidityParam = require('./param');
|
|
|
|
/**
|
|
* Should be used to check if a type is an array type
|
|
*
|
|
* @method isArrayType
|
|
* @param {String} type
|
|
* @return {Bool} true is the type is an array, otherwise false
|
|
*/
|
|
var isArrayType = function (type) {
|
|
return type.slice(-2) === '[]';
|
|
};
|
|
|
|
/**
|
|
* SolidityType prototype is used to encode/decode solidity params of certain type
|
|
*/
|
|
var SolidityType = function (config) {
|
|
this._name = config.name;
|
|
this._match = config.match;
|
|
this._mode = config.mode;
|
|
this._inputFormatter = config.inputFormatter;
|
|
this._outputFormatter = config.outputFormatter;
|
|
};
|
|
|
|
/**
|
|
* Should be used to determine if this SolidityType do match given type
|
|
*
|
|
* @method isType
|
|
* @param {String} name
|
|
* @return {Bool} true if type match this SolidityType, otherwise false
|
|
*/
|
|
SolidityType.prototype.isType = function (name) {
|
|
if (this._match === 'strict') {
|
|
return this._name === name || (name.indexOf(this._name) === 0 && name.slice(this._name.length) === '[]');
|
|
} else if (this._match === 'prefix') {
|
|
// TODO better type detection!
|
|
return name.indexOf(this._name) === 0;
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should be used to transform plain param to SolidityParam object
|
|
*
|
|
* @method formatInput
|
|
* @param {Object} param - plain object, or an array of objects
|
|
* @param {Bool} arrayType - true if a param should be encoded as an array
|
|
* @return {SolidityParam} encoded param wrapped in SolidityParam object
|
|
*/
|
|
SolidityType.prototype.formatInput = function (param, arrayType) {
|
|
if (utils.isArray(param) && arrayType) { // TODO: should fail if this two are not the same
|
|
var self = this;
|
|
return param.map(function (p) {
|
|
return self._inputFormatter(p);
|
|
}).reduce(function (acc, current) {
|
|
return acc.combine(current);
|
|
}, f.formatInputInt(param.length)).withOffset(32);
|
|
}
|
|
return this._inputFormatter(param);
|
|
};
|
|
|
|
/**
|
|
* Should be used to transoform SolidityParam to plain param
|
|
*
|
|
* @method formatOutput
|
|
* @param {SolidityParam} byteArray
|
|
* @param {Bool} arrayType - true if a param should be decoded as an array
|
|
* @return {Object} plain decoded param
|
|
*/
|
|
SolidityType.prototype.formatOutput = function (param, arrayType) {
|
|
if (arrayType) {
|
|
// let's assume, that we solidity will never return long arrays :P
|
|
var result = [];
|
|
var length = new BigNumber(param.dynamicPart().slice(0, 64), 16);
|
|
for (var i = 0; i < length * 64; i += 64) {
|
|
result.push(this._outputFormatter(new SolidityParam(param.dynamicPart().substr(i + 64, 64))));
|
|
}
|
|
return result;
|
|
}
|
|
return this._outputFormatter(param);
|
|
};
|
|
|
|
/**
|
|
* Should be used to slice single param from bytes
|
|
*
|
|
* @method sliceParam
|
|
* @param {String} bytes
|
|
* @param {Number} index of param to slice
|
|
* @param {String} type
|
|
* @returns {SolidityParam} param
|
|
*/
|
|
SolidityType.prototype.sliceParam = function (bytes, index, type) {
|
|
if (this._mode === 'bytes') {
|
|
return SolidityParam.decodeBytes(bytes, index);
|
|
} else if (isArrayType(type)) {
|
|
return SolidityParam.decodeArray(bytes, index);
|
|
}
|
|
return SolidityParam.decodeParam(bytes, index);
|
|
};
|
|
|
|
/**
|
|
* SolidityCoder prototype should be used to encode/decode solidity params of any type
|
|
*/
|
|
var SolidityCoder = function (types) {
|
|
this._types = types;
|
|
};
|
|
|
|
/**
|
|
* This method should be used to transform type to SolidityType
|
|
*
|
|
* @method _requireType
|
|
* @param {String} type
|
|
* @returns {SolidityType}
|
|
* @throws {Error} throws if no matching type is found
|
|
*/
|
|
SolidityCoder.prototype._requireType = function (type) {
|
|
var solidityType = this._types.filter(function (t) {
|
|
return t.isType(type);
|
|
})[0];
|
|
|
|
if (!solidityType) {
|
|
throw Error('invalid solidity type!: ' + type);
|
|
}
|
|
|
|
return solidityType;
|
|
};
|
|
|
|
/**
|
|
* Should be used to transform plain param of given type to SolidityParam
|
|
*
|
|
* @method _formatInput
|
|
* @param {String} type of param
|
|
* @param {Object} plain param
|
|
* @return {SolidityParam}
|
|
*/
|
|
SolidityCoder.prototype._formatInput = function (type, param) {
|
|
return this._requireType(type).formatInput(param, isArrayType(type));
|
|
};
|
|
|
|
/**
|
|
* Should be used to encode plain param
|
|
*
|
|
* @method encodeParam
|
|
* @param {String} type
|
|
* @param {Object} plain param
|
|
* @return {String} encoded plain param
|
|
*/
|
|
SolidityCoder.prototype.encodeParam = function (type, param) {
|
|
return this._formatInput(type, param).encode();
|
|
};
|
|
|
|
/**
|
|
* Should be used to encode list of params
|
|
*
|
|
* @method encodeParams
|
|
* @param {Array} types
|
|
* @param {Array} params
|
|
* @return {String} encoded list of params
|
|
*/
|
|
SolidityCoder.prototype.encodeParams = function (types, params) {
|
|
var self = this;
|
|
var solidityParams = types.map(function (type, index) {
|
|
return self._formatInput(type, params[index]);
|
|
});
|
|
|
|
return SolidityParam.encodeList(solidityParams);
|
|
};
|
|
|
|
/**
|
|
* Should be used to decode bytes to plain param
|
|
*
|
|
* @method decodeParam
|
|
* @param {String} type
|
|
* @param {String} bytes
|
|
* @return {Object} plain param
|
|
*/
|
|
SolidityCoder.prototype.decodeParam = function (type, bytes) {
|
|
return this.decodeParams([type], bytes)[0];
|
|
};
|
|
|
|
/**
|
|
* Should be used to decode list of params
|
|
*
|
|
* @method decodeParam
|
|
* @param {Array} types
|
|
* @param {String} bytes
|
|
* @return {Array} array of plain params
|
|
*/
|
|
SolidityCoder.prototype.decodeParams = function (types, bytes) {
|
|
var self = this;
|
|
return types.map(function (type, index) {
|
|
var solidityType = self._requireType(type);
|
|
var p = solidityType.sliceParam(bytes, index, type);
|
|
return solidityType.formatOutput(p, isArrayType(type));
|
|
});
|
|
};
|
|
|
|
var coder = new SolidityCoder([
|
|
new SolidityType({
|
|
name: 'address',
|
|
match: 'strict',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputInt,
|
|
outputFormatter: f.formatOutputAddress
|
|
}),
|
|
new SolidityType({
|
|
name: 'bool',
|
|
match: 'strict',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputBool,
|
|
outputFormatter: f.formatOutputBool
|
|
}),
|
|
new SolidityType({
|
|
name: 'int',
|
|
match: 'prefix',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputInt,
|
|
outputFormatter: f.formatOutputInt,
|
|
}),
|
|
new SolidityType({
|
|
name: 'uint',
|
|
match: 'prefix',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputInt,
|
|
outputFormatter: f.formatOutputUInt
|
|
}),
|
|
new SolidityType({
|
|
name: 'bytes',
|
|
match: 'strict',
|
|
mode: 'bytes',
|
|
inputFormatter: f.formatInputDynamicBytes,
|
|
outputFormatter: f.formatOutputDynamicBytes
|
|
}),
|
|
new SolidityType({
|
|
name: 'bytes',
|
|
match: 'prefix',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputBytes,
|
|
outputFormatter: f.formatOutputBytes
|
|
}),
|
|
new SolidityType({
|
|
name: 'real',
|
|
match: 'prefix',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputReal,
|
|
outputFormatter: f.formatOutputReal
|
|
}),
|
|
new SolidityType({
|
|
name: 'ureal',
|
|
match: 'prefix',
|
|
mode: 'value',
|
|
inputFormatter: f.formatInputReal,
|
|
outputFormatter: f.formatOutputUReal
|
|
})
|
|
]);
|
|
|
|
module.exports = coder;
|
|
|
|
|
|
},{"../utils/utils":7,"./formatters":2,"./param":3,"bignumber.js":"bignumber.js"}],2:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file formatters.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var BigNumber = require('bignumber.js');
|
|
var utils = require('../utils/utils');
|
|
var c = require('../utils/config');
|
|
var SolidityParam = require('./param');
|
|
|
|
|
|
/**
|
|
* Formats input value to byte representation of int
|
|
* If value is negative, return it's two's complement
|
|
* If the value is floating point, round it down
|
|
*
|
|
* @method formatInputInt
|
|
* @param {String|Number|BigNumber} value that needs to be formatted
|
|
* @returns {SolidityParam}
|
|
*/
|
|
var formatInputInt = function (value) {
|
|
var padding = c.ETH_PADDING * 2;
|
|
BigNumber.config(c.ETH_BIGNUMBER_ROUNDING_MODE);
|
|
var result = utils.padLeft(utils.toTwosComplement(value).round().toString(16), padding);
|
|
return new SolidityParam(result);
|
|
};
|
|
|
|
/**
|
|
* Formats input value to byte representation of string
|
|
*
|
|
* @method formatInputBytes
|
|
* @param {String}
|
|
* @returns {SolidityParam}
|
|
*/
|
|
var formatInputBytes = function (value) {
|
|
var result = utils.fromAscii(value, c.ETH_PADDING).substr(2);
|
|
return new SolidityParam(result);
|
|
};
|
|
|
|
/**
|
|
* Formats input value to byte representation of string
|
|
*
|
|
* @method formatInputDynamicBytes
|
|
* @param {String}
|
|
* @returns {SolidityParam}
|
|
*/
|
|
var formatInputDynamicBytes = function (value) {
|
|
var result = utils.fromAscii(value, c.ETH_PADDING).substr(2);
|
|
return new SolidityParam(formatInputInt(value.length).value + result, 32);
|
|
};
|
|
|
|
/**
|
|
* Formats input value to byte representation of bool
|
|
*
|
|
* @method formatInputBool
|
|
* @param {Boolean}
|
|
* @returns {SolidityParam}
|
|
*/
|
|
var formatInputBool = function (value) {
|
|
var result = '000000000000000000000000000000000000000000000000000000000000000' + (value ? '1' : '0');
|
|
return new SolidityParam(result);
|
|
};
|
|
|
|
/**
|
|
* Formats input value to byte representation of real
|
|
* Values are multiplied by 2^m and encoded as integers
|
|
*
|
|
* @method formatInputReal
|
|
* @param {String|Number|BigNumber}
|
|
* @returns {SolidityParam}
|
|
*/
|
|
var formatInputReal = function (value) {
|
|
return formatInputInt(new BigNumber(value).times(new BigNumber(2).pow(128)));
|
|
};
|
|
|
|
/**
|
|
* Check if input value is negative
|
|
*
|
|
* @method signedIsNegative
|
|
* @param {String} value is hex format
|
|
* @returns {Boolean} true if it is negative, otherwise false
|
|
*/
|
|
var signedIsNegative = function (value) {
|
|
return (new BigNumber(value.substr(0, 1), 16).toString(2).substr(0, 1)) === '1';
|
|
};
|
|
|
|
/**
|
|
* Formats right-aligned output bytes to int
|
|
*
|
|
* @method formatOutputInt
|
|
* @param {SolidityParam} param
|
|
* @returns {BigNumber} right-aligned output bytes formatted to big number
|
|
*/
|
|
var formatOutputInt = function (param) {
|
|
var value = param.staticPart() || "0";
|
|
|
|
// check if it's negative number
|
|
// it it is, return two's complement
|
|
if (signedIsNegative(value)) {
|
|
return new BigNumber(value, 16).minus(new BigNumber('ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff', 16)).minus(1);
|
|
}
|
|
return new BigNumber(value, 16);
|
|
};
|
|
|
|
/**
|
|
* Formats right-aligned output bytes to uint
|
|
*
|
|
* @method formatOutputUInt
|
|
* @param {SolidityParam}
|
|
* @returns {BigNumeber} right-aligned output bytes formatted to uint
|
|
*/
|
|
var formatOutputUInt = function (param) {
|
|
var value = param.staticPart() || "0";
|
|
return new BigNumber(value, 16);
|
|
};
|
|
|
|
/**
|
|
* Formats right-aligned output bytes to real
|
|
*
|
|
* @method formatOutputReal
|
|
* @param {SolidityParam}
|
|
* @returns {BigNumber} input bytes formatted to real
|
|
*/
|
|
var formatOutputReal = function (param) {
|
|
return formatOutputInt(param).dividedBy(new BigNumber(2).pow(128));
|
|
};
|
|
|
|
/**
|
|
* Formats right-aligned output bytes to ureal
|
|
*
|
|
* @method formatOutputUReal
|
|
* @param {SolidityParam}
|
|
* @returns {BigNumber} input bytes formatted to ureal
|
|
*/
|
|
var formatOutputUReal = function (param) {
|
|
return formatOutputUInt(param).dividedBy(new BigNumber(2).pow(128));
|
|
};
|
|
|
|
/**
|
|
* Should be used to format output bool
|
|
*
|
|
* @method formatOutputBool
|
|
* @param {SolidityParam}
|
|
* @returns {Boolean} right-aligned input bytes formatted to bool
|
|
*/
|
|
var formatOutputBool = function (param) {
|
|
return param.staticPart() === '0000000000000000000000000000000000000000000000000000000000000001' ? true : false;
|
|
};
|
|
|
|
/**
|
|
* Should be used to format output string
|
|
*
|
|
* @method formatOutputBytes
|
|
* @param {SolidityParam} left-aligned hex representation of string
|
|
* @returns {String} ascii string
|
|
*/
|
|
var formatOutputBytes = function (param) {
|
|
// length might also be important!
|
|
return utils.toAscii(param.staticPart());
|
|
};
|
|
|
|
/**
|
|
* Should be used to format output string
|
|
*
|
|
* @method formatOutputDynamicBytes
|
|
* @param {SolidityParam} left-aligned hex representation of string
|
|
* @returns {String} ascii string
|
|
*/
|
|
var formatOutputDynamicBytes = function (param) {
|
|
// length might also be important!
|
|
return utils.toAscii(param.dynamicPart().slice(64));
|
|
};
|
|
|
|
/**
|
|
* Should be used to format output address
|
|
*
|
|
* @method formatOutputAddress
|
|
* @param {SolidityParam} right-aligned input bytes
|
|
* @returns {String} address
|
|
*/
|
|
var formatOutputAddress = function (param) {
|
|
var value = param.staticPart();
|
|
return "0x" + value.slice(value.length - 40, value.length);
|
|
};
|
|
|
|
module.exports = {
|
|
formatInputInt: formatInputInt,
|
|
formatInputBytes: formatInputBytes,
|
|
formatInputDynamicBytes: formatInputDynamicBytes,
|
|
formatInputBool: formatInputBool,
|
|
formatInputReal: formatInputReal,
|
|
formatOutputInt: formatOutputInt,
|
|
formatOutputUInt: formatOutputUInt,
|
|
formatOutputReal: formatOutputReal,
|
|
formatOutputUReal: formatOutputUReal,
|
|
formatOutputBool: formatOutputBool,
|
|
formatOutputBytes: formatOutputBytes,
|
|
formatOutputDynamicBytes: formatOutputDynamicBytes,
|
|
formatOutputAddress: formatOutputAddress
|
|
};
|
|
|
|
|
|
},{"../utils/config":5,"../utils/utils":7,"./param":3,"bignumber.js":"bignumber.js"}],3:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file param.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var utils = require('../utils/utils');
|
|
|
|
/**
|
|
* SolidityParam object prototype.
|
|
* Should be used when encoding, decoding solidity bytes
|
|
*/
|
|
var SolidityParam = function (value, offset) {
|
|
this.value = value || '';
|
|
this.offset = offset; // offset in bytes
|
|
};
|
|
|
|
/**
|
|
* This method should be used to get length of params's dynamic part
|
|
*
|
|
* @method dynamicPartLength
|
|
* @returns {Number} length of dynamic part (in bytes)
|
|
*/
|
|
SolidityParam.prototype.dynamicPartLength = function () {
|
|
return this.dynamicPart().length / 2;
|
|
};
|
|
|
|
/**
|
|
* This method should be used to create copy of solidity param with different offset
|
|
*
|
|
* @method withOffset
|
|
* @param {Number} offset length in bytes
|
|
* @returns {SolidityParam} new solidity param with applied offset
|
|
*/
|
|
SolidityParam.prototype.withOffset = function (offset) {
|
|
return new SolidityParam(this.value, offset);
|
|
};
|
|
|
|
/**
|
|
* This method should be used to combine solidity params together
|
|
* eg. when appending an array
|
|
*
|
|
* @method combine
|
|
* @param {SolidityParam} param with which we should combine
|
|
* @param {SolidityParam} result of combination
|
|
*/
|
|
SolidityParam.prototype.combine = function (param) {
|
|
return new SolidityParam(this.value + param.value);
|
|
};
|
|
|
|
/**
|
|
* This method should be called to check if param has dynamic size.
|
|
* If it has, it returns true, otherwise false
|
|
*
|
|
* @method isDynamic
|
|
* @returns {Boolean}
|
|
*/
|
|
SolidityParam.prototype.isDynamic = function () {
|
|
return this.value.length > 64 || this.offset !== undefined;
|
|
};
|
|
|
|
/**
|
|
* This method should be called to transform offset to bytes
|
|
*
|
|
* @method offsetAsBytes
|
|
* @returns {String} bytes representation of offset
|
|
*/
|
|
SolidityParam.prototype.offsetAsBytes = function () {
|
|
return !this.isDynamic() ? '' : utils.padLeft(utils.toTwosComplement(this.offset).toString(16), 64);
|
|
};
|
|
|
|
/**
|
|
* This method should be called to get static part of param
|
|
*
|
|
* @method staticPart
|
|
* @returns {String} offset if it is a dynamic param, otherwise value
|
|
*/
|
|
SolidityParam.prototype.staticPart = function () {
|
|
if (!this.isDynamic()) {
|
|
return this.value;
|
|
}
|
|
return this.offsetAsBytes();
|
|
};
|
|
|
|
/**
|
|
* This method should be called to get dynamic part of param
|
|
*
|
|
* @method dynamicPart
|
|
* @returns {String} returns a value if it is a dynamic param, otherwise empty string
|
|
*/
|
|
SolidityParam.prototype.dynamicPart = function () {
|
|
return this.isDynamic() ? this.value : '';
|
|
};
|
|
|
|
/**
|
|
* This method should be called to encode param
|
|
*
|
|
* @method encode
|
|
* @returns {String}
|
|
*/
|
|
SolidityParam.prototype.encode = function () {
|
|
return this.staticPart() + this.dynamicPart();
|
|
};
|
|
|
|
/**
|
|
* This method should be called to encode array of params
|
|
*
|
|
* @method encodeList
|
|
* @param {Array[SolidityParam]} params
|
|
* @returns {String}
|
|
*/
|
|
SolidityParam.encodeList = function (params) {
|
|
|
|
// updating offsets
|
|
var totalOffset = params.length * 32;
|
|
var offsetParams = params.map(function (param) {
|
|
if (!param.isDynamic()) {
|
|
return param;
|
|
}
|
|
var offset = totalOffset;
|
|
totalOffset += param.dynamicPartLength();
|
|
return param.withOffset(offset);
|
|
});
|
|
|
|
// encode everything!
|
|
return offsetParams.reduce(function (result, param) {
|
|
return result + param.dynamicPart();
|
|
}, offsetParams.reduce(function (result, param) {
|
|
return result + param.staticPart();
|
|
}, ''));
|
|
};
|
|
|
|
/**
|
|
* This method should be used to decode plain (static) solidity param at given index
|
|
*
|
|
* @method decodeParam
|
|
* @param {String} bytes
|
|
* @param {Number} index
|
|
* @returns {SolidityParam}
|
|
*/
|
|
SolidityParam.decodeParam = function (bytes, index) {
|
|
index = index || 0;
|
|
return new SolidityParam(bytes.substr(index * 64, 64));
|
|
};
|
|
|
|
/**
|
|
* This method should be called to get offset value from bytes at given index
|
|
*
|
|
* @method getOffset
|
|
* @param {String} bytes
|
|
* @param {Number} index
|
|
* @returns {Number} offset as number
|
|
*/
|
|
var getOffset = function (bytes, index) {
|
|
// we can do this cause offset is rather small
|
|
return parseInt('0x' + bytes.substr(index * 64, 64));
|
|
};
|
|
|
|
/**
|
|
* This method should be called to decode solidity bytes param at given index
|
|
*
|
|
* @method decodeBytes
|
|
* @param {String} bytes
|
|
* @param {Number} index
|
|
* @returns {SolidityParam}
|
|
*/
|
|
SolidityParam.decodeBytes = function (bytes, index) {
|
|
index = index || 0;
|
|
//TODO add support for strings longer than 32 bytes
|
|
//var length = parseInt('0x' + bytes.substr(offset * 64, 64));
|
|
|
|
var offset = getOffset(bytes, index);
|
|
|
|
// 2 * , cause we also parse length
|
|
return new SolidityParam(bytes.substr(offset * 2, 2 * 64), 0);
|
|
};
|
|
|
|
/**
|
|
* This method should be used to decode solidity array at given index
|
|
*
|
|
* @method decodeArray
|
|
* @param {String} bytes
|
|
* @param {Number} index
|
|
* @returns {SolidityParam}
|
|
*/
|
|
SolidityParam.decodeArray = function (bytes, index) {
|
|
index = index || 0;
|
|
var offset = getOffset(bytes, index);
|
|
var length = parseInt('0x' + bytes.substr(offset * 2, 64));
|
|
return new SolidityParam(bytes.substr(offset * 2, (length + 1) * 64), 0);
|
|
};
|
|
|
|
module.exports = SolidityParam;
|
|
|
|
|
|
},{"../utils/utils":7}],4:[function(require,module,exports){
|
|
'use strict';
|
|
|
|
// go env doesn't have and need XMLHttpRequest
|
|
if (typeof XMLHttpRequest === 'undefined') {
|
|
exports.XMLHttpRequest = {};
|
|
} else {
|
|
exports.XMLHttpRequest = XMLHttpRequest; // jshint ignore:line
|
|
}
|
|
|
|
|
|
},{}],5:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file config.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
/**
|
|
* Utils
|
|
*
|
|
* @module utils
|
|
*/
|
|
|
|
/**
|
|
* Utility functions
|
|
*
|
|
* @class [utils] config
|
|
* @constructor
|
|
*/
|
|
|
|
/// required to define ETH_BIGNUMBER_ROUNDING_MODE
|
|
var BigNumber = require('bignumber.js');
|
|
|
|
var ETH_UNITS = [
|
|
'wei',
|
|
'kwei',
|
|
'Mwei',
|
|
'Gwei',
|
|
'szabo',
|
|
'finney',
|
|
'femtoether',
|
|
'picoether',
|
|
'nanoether',
|
|
'microether',
|
|
'milliether',
|
|
'nano',
|
|
'micro',
|
|
'milli',
|
|
'ether',
|
|
'grand',
|
|
'Mether',
|
|
'Gether',
|
|
'Tether',
|
|
'Pether',
|
|
'Eether',
|
|
'Zether',
|
|
'Yether',
|
|
'Nether',
|
|
'Dether',
|
|
'Vether',
|
|
'Uether'
|
|
];
|
|
|
|
module.exports = {
|
|
ETH_PADDING: 32,
|
|
ETH_SIGNATURE_LENGTH: 4,
|
|
ETH_UNITS: ETH_UNITS,
|
|
ETH_BIGNUMBER_ROUNDING_MODE: { ROUNDING_MODE: BigNumber.ROUND_DOWN },
|
|
ETH_POLLING_TIMEOUT: 1000,
|
|
defaultBlock: 'latest',
|
|
defaultAccount: undefined
|
|
};
|
|
|
|
|
|
},{"bignumber.js":"bignumber.js"}],6:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file sha3.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var utils = require('./utils');
|
|
var sha3 = require('crypto-js/sha3');
|
|
|
|
module.exports = function (str, isNew) {
|
|
if (str.substr(0, 2) === '0x' && !isNew) {
|
|
console.warn('requirement of using web3.fromAscii before sha3 is deprecated');
|
|
console.warn('new usage: \'web3.sha3("hello")\'');
|
|
console.warn('see https://github.com/ethereum/web3.js/pull/205');
|
|
console.warn('if you need to hash hex value, you can do \'sha3("0xfff", true)\'');
|
|
str = utils.toAscii(str);
|
|
}
|
|
|
|
return sha3(str, {
|
|
outputLength: 256
|
|
}).toString();
|
|
};
|
|
|
|
|
|
},{"./utils":7,"crypto-js/sha3":33}],7:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file utils.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
/**
|
|
* Utils
|
|
*
|
|
* @module utils
|
|
*/
|
|
|
|
/**
|
|
* Utility functions
|
|
*
|
|
* @class [utils] utils
|
|
* @constructor
|
|
*/
|
|
|
|
var BigNumber = require('bignumber.js');
|
|
|
|
var unitMap = {
|
|
'wei': '1',
|
|
'kwei': '1000',
|
|
'ada': '1000',
|
|
'femtoether': '1000',
|
|
'mwei': '1000000',
|
|
'babbage': '1000000',
|
|
'picoether': '1000000',
|
|
'gwei': '1000000000',
|
|
'shannon': '1000000000',
|
|
'nanoether': '1000000000',
|
|
'nano': '1000000000',
|
|
'szabo': '1000000000000',
|
|
'microether': '1000000000000',
|
|
'micro': '1000000000000',
|
|
'finney': '1000000000000000',
|
|
'milliether': '1000000000000000',
|
|
'milli': '1000000000000000',
|
|
'ether': '1000000000000000000',
|
|
'kether': '1000000000000000000000',
|
|
'grand': '1000000000000000000000',
|
|
'einstein': '1000000000000000000000',
|
|
'mether': '1000000000000000000000000',
|
|
'gether': '1000000000000000000000000000',
|
|
'tether': '1000000000000000000000000000000'
|
|
};
|
|
|
|
/**
|
|
* Should be called to pad string to expected length
|
|
*
|
|
* @method padLeft
|
|
* @param {String} string to be padded
|
|
* @param {Number} characters that result string should have
|
|
* @param {String} sign, by default 0
|
|
* @returns {String} right aligned string
|
|
*/
|
|
var padLeft = function (string, chars, sign) {
|
|
return new Array(chars - string.length + 1).join(sign ? sign : "0") + string;
|
|
};
|
|
|
|
/**
|
|
* Should be called to get sting from it's hex representation
|
|
*
|
|
* @method toAscii
|
|
* @param {String} string in hex
|
|
* @returns {String} ascii string representation of hex value
|
|
*/
|
|
var toAscii = function(hex) {
|
|
// Find termination
|
|
var str = "";
|
|
var i = 0, l = hex.length;
|
|
if (hex.substring(0, 2) === '0x') {
|
|
i = 2;
|
|
}
|
|
for (; i < l; i+=2) {
|
|
var code = parseInt(hex.substr(i, 2), 16);
|
|
if (code === 0) {
|
|
break;
|
|
}
|
|
|
|
str += String.fromCharCode(code);
|
|
}
|
|
|
|
return str;
|
|
};
|
|
|
|
/**
|
|
* Shold be called to get hex representation (prefixed by 0x) of ascii string
|
|
*
|
|
* @method toHexNative
|
|
* @param {String} string
|
|
* @returns {String} hex representation of input string
|
|
*/
|
|
var toHexNative = function(str) {
|
|
var hex = "";
|
|
for(var i = 0; i < str.length; i++) {
|
|
var n = str.charCodeAt(i).toString(16);
|
|
hex += n.length < 2 ? '0' + n : n;
|
|
}
|
|
|
|
return hex;
|
|
};
|
|
|
|
/**
|
|
* Shold be called to get hex representation (prefixed by 0x) of ascii string
|
|
*
|
|
* @method fromAscii
|
|
* @param {String} string
|
|
* @param {Number} optional padding
|
|
* @returns {String} hex representation of input string
|
|
*/
|
|
var fromAscii = function(str, pad) {
|
|
pad = pad === undefined ? 0 : pad;
|
|
var hex = toHexNative(str);
|
|
while (hex.length < pad*2)
|
|
hex += "00";
|
|
return "0x" + hex;
|
|
};
|
|
|
|
/**
|
|
* Should be used to create full function/event name from json abi
|
|
*
|
|
* @method transformToFullName
|
|
* @param {Object} json-abi
|
|
* @return {String} full fnction/event name
|
|
*/
|
|
var transformToFullName = function (json) {
|
|
if (json.name.indexOf('(') !== -1) {
|
|
return json.name;
|
|
}
|
|
|
|
var typeName = json.inputs.map(function(i){return i.type; }).join();
|
|
return json.name + '(' + typeName + ')';
|
|
};
|
|
|
|
/**
|
|
* Should be called to get display name of contract function
|
|
*
|
|
* @method extractDisplayName
|
|
* @param {String} name of function/event
|
|
* @returns {String} display name for function/event eg. multiply(uint256) -> multiply
|
|
*/
|
|
var extractDisplayName = function (name) {
|
|
var length = name.indexOf('(');
|
|
return length !== -1 ? name.substr(0, length) : name;
|
|
};
|
|
|
|
/// @returns overloaded part of function/event name
|
|
var extractTypeName = function (name) {
|
|
/// TODO: make it invulnerable
|
|
var length = name.indexOf('(');
|
|
return length !== -1 ? name.substr(length + 1, name.length - 1 - (length + 1)).replace(' ', '') : "";
|
|
};
|
|
|
|
/**
|
|
* Converts value to it's decimal representation in string
|
|
*
|
|
* @method toDecimal
|
|
* @param {String|Number|BigNumber}
|
|
* @return {String}
|
|
*/
|
|
var toDecimal = function (value) {
|
|
return toBigNumber(value).toNumber();
|
|
};
|
|
|
|
/**
|
|
* Converts value to it's hex representation
|
|
*
|
|
* @method fromDecimal
|
|
* @param {String|Number|BigNumber}
|
|
* @return {String}
|
|
*/
|
|
var fromDecimal = function (value) {
|
|
var number = toBigNumber(value);
|
|
var result = number.toString(16);
|
|
|
|
return number.lessThan(0) ? '-0x' + result.substr(1) : '0x' + result;
|
|
};
|
|
|
|
/**
|
|
* Auto converts any given value into it's hex representation.
|
|
*
|
|
* And even stringifys objects before.
|
|
*
|
|
* @method toHex
|
|
* @param {String|Number|BigNumber|Object}
|
|
* @return {String}
|
|
*/
|
|
var toHex = function (val) {
|
|
/*jshint maxcomplexity:7 */
|
|
|
|
if (isBoolean(val))
|
|
return fromDecimal(+val);
|
|
|
|
if (isBigNumber(val))
|
|
return fromDecimal(val);
|
|
|
|
if (isObject(val))
|
|
return fromAscii(JSON.stringify(val));
|
|
|
|
// if its a negative number, pass it through fromDecimal
|
|
if (isString(val)) {
|
|
if (val.indexOf('-0x') === 0)
|
|
return fromDecimal(val);
|
|
else if (!isFinite(val))
|
|
return fromAscii(val);
|
|
}
|
|
|
|
return fromDecimal(val);
|
|
};
|
|
|
|
/**
|
|
* Returns value of unit in Wei
|
|
*
|
|
* @method getValueOfUnit
|
|
* @param {String} unit the unit to convert to, default ether
|
|
* @returns {BigNumber} value of the unit (in Wei)
|
|
* @throws error if the unit is not correct:w
|
|
*/
|
|
var getValueOfUnit = function (unit) {
|
|
unit = unit ? unit.toLowerCase() : 'ether';
|
|
var unitValue = unitMap[unit];
|
|
if (unitValue === undefined) {
|
|
throw new Error('This unit doesn\'t exists, please use the one of the following units' + JSON.stringify(unitMap, null, 2));
|
|
}
|
|
return new BigNumber(unitValue, 10);
|
|
};
|
|
|
|
/**
|
|
* Takes a number of wei and converts it to any other ether unit.
|
|
*
|
|
* Possible units are:
|
|
* SI Short SI Full Effigy Other
|
|
* - kwei femtoether ada
|
|
* - mwei picoether babbage
|
|
* - gwei nanoether shannon nano
|
|
* - -- microether szabo micro
|
|
* - -- milliether finney milli
|
|
* - ether -- --
|
|
* - kether einstein grand
|
|
* - mether
|
|
* - gether
|
|
* - tether
|
|
*
|
|
* @method fromWei
|
|
* @param {Number|String} number can be a number, number string or a HEX of a decimal
|
|
* @param {String} unit the unit to convert to, default ether
|
|
* @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number
|
|
*/
|
|
var fromWei = function(number, unit) {
|
|
var returnValue = toBigNumber(number).dividedBy(getValueOfUnit(unit));
|
|
|
|
return isBigNumber(number) ? returnValue : returnValue.toString(10);
|
|
};
|
|
|
|
/**
|
|
* Takes a number of a unit and converts it to wei.
|
|
*
|
|
* Possible units are:
|
|
* SI Short SI Full Effigy Other
|
|
* - kwei femtoether ada
|
|
* - mwei picoether babbage
|
|
* - gwei nanoether shannon nano
|
|
* - -- microether szabo micro
|
|
* - -- milliether finney milli
|
|
* - ether -- --
|
|
* - kether einstein grand
|
|
* - mether
|
|
* - gether
|
|
* - tether
|
|
*
|
|
* @method toWei
|
|
* @param {Number|String|BigNumber} number can be a number, number string or a HEX of a decimal
|
|
* @param {String} unit the unit to convert from, default ether
|
|
* @return {String|Object} When given a BigNumber object it returns one as well, otherwise a number
|
|
*/
|
|
var toWei = function(number, unit) {
|
|
var returnValue = toBigNumber(number).times(getValueOfUnit(unit));
|
|
|
|
return isBigNumber(number) ? returnValue : returnValue.toString(10);
|
|
};
|
|
|
|
/**
|
|
* Takes an input and transforms it into an bignumber
|
|
*
|
|
* @method toBigNumber
|
|
* @param {Number|String|BigNumber} a number, string, HEX string or BigNumber
|
|
* @return {BigNumber} BigNumber
|
|
*/
|
|
var toBigNumber = function(number) {
|
|
/*jshint maxcomplexity:5 */
|
|
number = number || 0;
|
|
if (isBigNumber(number))
|
|
return number;
|
|
|
|
if (isString(number) && (number.indexOf('0x') === 0 || number.indexOf('-0x') === 0)) {
|
|
return new BigNumber(number.replace('0x',''), 16);
|
|
}
|
|
|
|
return new BigNumber(number.toString(10), 10);
|
|
};
|
|
|
|
/**
|
|
* Takes and input transforms it into bignumber and if it is negative value, into two's complement
|
|
*
|
|
* @method toTwosComplement
|
|
* @param {Number|String|BigNumber}
|
|
* @return {BigNumber}
|
|
*/
|
|
var toTwosComplement = function (number) {
|
|
var bigNumber = toBigNumber(number);
|
|
if (bigNumber.lessThan(0)) {
|
|
return new BigNumber("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", 16).plus(bigNumber).plus(1);
|
|
}
|
|
return bigNumber;
|
|
};
|
|
|
|
/**
|
|
* Checks if the given string is strictly an address
|
|
*
|
|
* @method isStrictAddress
|
|
* @param {String} address the given HEX adress
|
|
* @return {Boolean}
|
|
*/
|
|
var isStrictAddress = function (address) {
|
|
return /^0x[0-9a-f]{40}$/.test(address);
|
|
};
|
|
|
|
/**
|
|
* Checks if the given string is an address
|
|
*
|
|
* @method isAddress
|
|
* @param {String} address the given HEX adress
|
|
* @return {Boolean}
|
|
*/
|
|
var isAddress = function (address) {
|
|
return /^(0x)?[0-9a-f]{40}$/.test(address);
|
|
};
|
|
|
|
/**
|
|
* Transforms given string to valid 20 bytes-length addres with 0x prefix
|
|
*
|
|
* @method toAddress
|
|
* @param {String} address
|
|
* @return {String} formatted address
|
|
*/
|
|
var toAddress = function (address) {
|
|
if (isStrictAddress(address)) {
|
|
return address;
|
|
}
|
|
|
|
if (/^[0-9a-f]{40}$/.test(address)) {
|
|
return '0x' + address;
|
|
}
|
|
|
|
return '0x' + padLeft(toHex(address).substr(2), 40);
|
|
};
|
|
|
|
|
|
/**
|
|
* Returns true if object is BigNumber, otherwise false
|
|
*
|
|
* @method isBigNumber
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isBigNumber = function (object) {
|
|
return object instanceof BigNumber ||
|
|
(object && object.constructor && object.constructor.name === 'BigNumber');
|
|
};
|
|
|
|
/**
|
|
* Returns true if object is string, otherwise false
|
|
*
|
|
* @method isString
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isString = function (object) {
|
|
return typeof object === 'string' ||
|
|
(object && object.constructor && object.constructor.name === 'String');
|
|
};
|
|
|
|
/**
|
|
* Returns true if object is function, otherwise false
|
|
*
|
|
* @method isFunction
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isFunction = function (object) {
|
|
return typeof object === 'function';
|
|
};
|
|
|
|
/**
|
|
* Returns true if object is Objet, otherwise false
|
|
*
|
|
* @method isObject
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isObject = function (object) {
|
|
return typeof object === 'object';
|
|
};
|
|
|
|
/**
|
|
* Returns true if object is boolean, otherwise false
|
|
*
|
|
* @method isBoolean
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isBoolean = function (object) {
|
|
return typeof object === 'boolean';
|
|
};
|
|
|
|
/**
|
|
* Returns true if object is array, otherwise false
|
|
*
|
|
* @method isArray
|
|
* @param {Object}
|
|
* @return {Boolean}
|
|
*/
|
|
var isArray = function (object) {
|
|
return object instanceof Array;
|
|
};
|
|
|
|
/**
|
|
* Returns true if given string is valid json object
|
|
*
|
|
* @method isJson
|
|
* @param {String}
|
|
* @return {Boolean}
|
|
*/
|
|
var isJson = function (str) {
|
|
try {
|
|
return !!JSON.parse(str);
|
|
} catch (e) {
|
|
return false;
|
|
}
|
|
};
|
|
|
|
/**
|
|
* This method should be called to check if string is valid ethereum IBAN number
|
|
* Supports direct and indirect IBANs
|
|
*
|
|
* @method isIBAN
|
|
* @param {String}
|
|
* @return {Boolean}
|
|
*/
|
|
var isIBAN = function (iban) {
|
|
return /^XE[0-9]{2}(ETH[0-9A-Z]{13}|[0-9A-Z]{30})$/.test(iban);
|
|
};
|
|
|
|
module.exports = {
|
|
padLeft: padLeft,
|
|
toHex: toHex,
|
|
toDecimal: toDecimal,
|
|
fromDecimal: fromDecimal,
|
|
toAscii: toAscii,
|
|
fromAscii: fromAscii,
|
|
transformToFullName: transformToFullName,
|
|
extractDisplayName: extractDisplayName,
|
|
extractTypeName: extractTypeName,
|
|
toWei: toWei,
|
|
fromWei: fromWei,
|
|
toBigNumber: toBigNumber,
|
|
toTwosComplement: toTwosComplement,
|
|
toAddress: toAddress,
|
|
isBigNumber: isBigNumber,
|
|
isStrictAddress: isStrictAddress,
|
|
isAddress: isAddress,
|
|
isFunction: isFunction,
|
|
isString: isString,
|
|
isObject: isObject,
|
|
isBoolean: isBoolean,
|
|
isArray: isArray,
|
|
isJson: isJson,
|
|
isIBAN: isIBAN
|
|
};
|
|
|
|
|
|
},{"bignumber.js":"bignumber.js"}],8:[function(require,module,exports){
|
|
module.exports={
|
|
"version": "0.5.0"
|
|
}
|
|
|
|
},{}],9:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file web3.js
|
|
* @authors:
|
|
* Jeffrey Wilcke <jeff@ethdev.com>
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* Marian Oancea <marian@ethdev.com>
|
|
* Fabian Vogelsteller <fabian@ethdev.com>
|
|
* Gav Wood <g@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var version = require('./version.json');
|
|
var net = require('./web3/net');
|
|
var eth = require('./web3/eth');
|
|
var db = require('./web3/db');
|
|
var shh = require('./web3/shh');
|
|
var watches = require('./web3/watches');
|
|
var Filter = require('./web3/filter');
|
|
var utils = require('./utils/utils');
|
|
var formatters = require('./web3/formatters');
|
|
var RequestManager = require('./web3/requestmanager');
|
|
var c = require('./utils/config');
|
|
var Property = require('./web3/property');
|
|
var Batch = require('./web3/batch');
|
|
var sha3 = require('./utils/sha3');
|
|
|
|
var web3Properties = [
|
|
new Property({
|
|
name: 'version.client',
|
|
getter: 'web3_clientVersion'
|
|
}),
|
|
new Property({
|
|
name: 'version.network',
|
|
getter: 'net_version',
|
|
inputFormatter: utils.toDecimal
|
|
}),
|
|
new Property({
|
|
name: 'version.ethereum',
|
|
getter: 'eth_protocolVersion',
|
|
inputFormatter: utils.toDecimal
|
|
}),
|
|
new Property({
|
|
name: 'version.whisper',
|
|
getter: 'shh_version',
|
|
inputFormatter: utils.toDecimal
|
|
})
|
|
];
|
|
|
|
/// creates methods in a given object based on method description on input
|
|
/// setups api calls for these methods
|
|
var setupMethods = function (obj, methods) {
|
|
methods.forEach(function (method) {
|
|
method.attachToObject(obj);
|
|
});
|
|
};
|
|
|
|
/// creates properties in a given object based on properties description on input
|
|
/// setups api calls for these properties
|
|
var setupProperties = function (obj, properties) {
|
|
properties.forEach(function (property) {
|
|
property.attachToObject(obj);
|
|
});
|
|
};
|
|
|
|
/// setups web3 object, and it's in-browser executed methods
|
|
var web3 = {};
|
|
web3.providers = {};
|
|
web3.version = {};
|
|
web3.version.api = version.version;
|
|
web3.eth = {};
|
|
|
|
/*jshint maxparams:4 */
|
|
web3.eth.filter = function (fil, eventParams, options, formatter) {
|
|
|
|
// if its event, treat it differently
|
|
// TODO: simplify and remove
|
|
if (fil._isEvent) {
|
|
return fil(eventParams, options);
|
|
}
|
|
|
|
// what outputLogFormatter? that's wrong
|
|
//return new Filter(fil, watches.eth(), formatters.outputLogFormatter);
|
|
return new Filter(fil, watches.eth(), formatter || formatters.outputLogFormatter);
|
|
};
|
|
/*jshint maxparams:3 */
|
|
|
|
web3.shh = {};
|
|
web3.shh.filter = function (fil) {
|
|
return new Filter(fil, watches.shh(), formatters.outputPostFormatter);
|
|
};
|
|
web3.net = {};
|
|
web3.db = {};
|
|
web3.setProvider = function (provider) {
|
|
RequestManager.getInstance().setProvider(provider);
|
|
};
|
|
web3.reset = function () {
|
|
RequestManager.getInstance().reset();
|
|
c.defaultBlock = 'latest';
|
|
c.defaultAccount = undefined;
|
|
};
|
|
web3.toHex = utils.toHex;
|
|
web3.toAscii = utils.toAscii;
|
|
web3.fromAscii = utils.fromAscii;
|
|
web3.toDecimal = utils.toDecimal;
|
|
web3.fromDecimal = utils.fromDecimal;
|
|
web3.toBigNumber = utils.toBigNumber;
|
|
web3.toWei = utils.toWei;
|
|
web3.fromWei = utils.fromWei;
|
|
web3.isAddress = utils.isAddress;
|
|
web3.isIBAN = utils.isIBAN;
|
|
web3.sha3 = sha3;
|
|
web3.createBatch = function () {
|
|
return new Batch();
|
|
};
|
|
|
|
// ADD defaultblock
|
|
Object.defineProperty(web3.eth, 'defaultBlock', {
|
|
get: function () {
|
|
return c.defaultBlock;
|
|
},
|
|
set: function (val) {
|
|
c.defaultBlock = val;
|
|
return val;
|
|
}
|
|
});
|
|
|
|
Object.defineProperty(web3.eth, 'defaultAccount', {
|
|
get: function () {
|
|
return c.defaultAccount;
|
|
},
|
|
set: function (val) {
|
|
c.defaultAccount = val;
|
|
return val;
|
|
}
|
|
});
|
|
|
|
|
|
// EXTEND
|
|
web3.extend = function(extension){
|
|
/*jshint maxcomplexity: 6 */
|
|
|
|
if(extension.property && !web3[extension.property])
|
|
web3[extension.property] = {};
|
|
|
|
setupMethods(web3[extension.property] || web3, extension.methods || []);
|
|
setupProperties(web3[extension.property] || web3, extension.properties || []);
|
|
};
|
|
web3.extend.formatters = formatters;
|
|
web3.extend.utils = utils;
|
|
web3.extend.Method = require('./web3/method');
|
|
web3.extend.Property = require('./web3/property');
|
|
|
|
|
|
/// setups all api methods
|
|
setupProperties(web3, web3Properties);
|
|
setupMethods(web3.net, net.methods);
|
|
setupProperties(web3.net, net.properties);
|
|
setupMethods(web3.eth, eth.methods);
|
|
setupProperties(web3.eth, eth.properties);
|
|
setupMethods(web3.db, db.methods);
|
|
setupMethods(web3.shh, shh.methods);
|
|
|
|
module.exports = web3;
|
|
|
|
|
|
},{"./utils/config":5,"./utils/sha3":6,"./utils/utils":7,"./version.json":8,"./web3/batch":10,"./web3/db":12,"./web3/eth":14,"./web3/filter":16,"./web3/formatters":17,"./web3/method":22,"./web3/net":24,"./web3/property":25,"./web3/requestmanager":27,"./web3/shh":28,"./web3/watches":30}],10:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file batch.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var RequestManager = require('./requestmanager');
|
|
|
|
var Batch = function () {
|
|
this.requests = [];
|
|
};
|
|
|
|
/**
|
|
* Should be called to add create new request to batch request
|
|
*
|
|
* @method add
|
|
* @param {Object} jsonrpc requet object
|
|
*/
|
|
Batch.prototype.add = function (request) {
|
|
this.requests.push(request);
|
|
};
|
|
|
|
/**
|
|
* Should be called to execute batch request
|
|
*
|
|
* @method execute
|
|
*/
|
|
Batch.prototype.execute = function () {
|
|
var requests = this.requests;
|
|
RequestManager.getInstance().sendBatch(requests, function (err, results) {
|
|
results = results || [];
|
|
requests.map(function (request, index) {
|
|
return results[index] || {};
|
|
}).map(function (result, index) {
|
|
return requests[index].format ? requests[index].format(result.result) : result.result;
|
|
}).forEach(function (result, index) {
|
|
if (requests[index].callback) {
|
|
requests[index].callback(err, result);
|
|
}
|
|
});
|
|
});
|
|
};
|
|
|
|
module.exports = Batch;
|
|
|
|
|
|
},{"./requestmanager":27}],11:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file contract.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var web3 = require('../web3');
|
|
var utils = require('../utils/utils');
|
|
var coder = require('../solidity/coder');
|
|
var SolidityEvent = require('./event');
|
|
var SolidityFunction = require('./function');
|
|
|
|
/**
|
|
* Should be called to encode constructor params
|
|
*
|
|
* @method encodeConstructorParams
|
|
* @param {Array} abi
|
|
* @param {Array} constructor params
|
|
*/
|
|
var encodeConstructorParams = function (abi, params) {
|
|
return abi.filter(function (json) {
|
|
return json.type === 'constructor' && json.inputs.length === params.length;
|
|
}).map(function (json) {
|
|
return json.inputs.map(function (input) {
|
|
return input.type;
|
|
});
|
|
}).map(function (types) {
|
|
return coder.encodeParams(types, params);
|
|
})[0] || '';
|
|
};
|
|
|
|
/**
|
|
* Should be called to add functions to contract object
|
|
*
|
|
* @method addFunctionsToContract
|
|
* @param {Contract} contract
|
|
* @param {Array} abi
|
|
*/
|
|
var addFunctionsToContract = function (contract, abi) {
|
|
abi.filter(function (json) {
|
|
return json.type === 'function';
|
|
}).map(function (json) {
|
|
return new SolidityFunction(json, contract.address);
|
|
}).forEach(function (f) {
|
|
f.attachToContract(contract);
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be called to add events to contract object
|
|
*
|
|
* @method addEventsToContract
|
|
* @param {Contract} contract
|
|
* @param {Array} abi
|
|
*/
|
|
var addEventsToContract = function (contract, abi) {
|
|
abi.filter(function (json) {
|
|
return json.type === 'event';
|
|
}).map(function (json) {
|
|
return new SolidityEvent(json, contract.address);
|
|
}).forEach(function (e) {
|
|
e.attachToContract(contract);
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be called to create new ContractFactory
|
|
*
|
|
* @method contract
|
|
* @param {Array} abi
|
|
* @returns {ContractFactory} new contract factory
|
|
*/
|
|
var contract = function (abi) {
|
|
return new ContractFactory(abi);
|
|
};
|
|
|
|
/**
|
|
* Should be called to create new ContractFactory instance
|
|
*
|
|
* @method ContractFactory
|
|
* @param {Array} abi
|
|
*/
|
|
var ContractFactory = function (abi) {
|
|
this.abi = abi;
|
|
};
|
|
|
|
/**
|
|
* Should be called to create new contract on a blockchain
|
|
*
|
|
* @method new
|
|
* @param {Any} contract constructor param1 (optional)
|
|
* @param {Any} contract constructor param2 (optional)
|
|
* @param {Object} contract transaction object (required)
|
|
* @param {Function} callback
|
|
* @returns {Contract} returns contract if no callback was passed,
|
|
* otherwise calls callback function (err, contract)
|
|
*/
|
|
ContractFactory.prototype.new = function () {
|
|
// parse arguments
|
|
var options = {}; // required!
|
|
var callback;
|
|
|
|
var args = Array.prototype.slice.call(arguments);
|
|
if (utils.isFunction(args[args.length - 1])) {
|
|
callback = args.pop();
|
|
}
|
|
|
|
var last = args[args.length - 1];
|
|
if (utils.isObject(last) && !utils.isArray(last)) {
|
|
options = args.pop();
|
|
}
|
|
|
|
// throw an error if there are no options
|
|
|
|
var bytes = encodeConstructorParams(this.abi, args);
|
|
options.data += bytes;
|
|
|
|
if (!callback) {
|
|
var address = web3.eth.sendTransaction(options);
|
|
return this.at(address);
|
|
}
|
|
|
|
var self = this;
|
|
web3.eth.sendTransaction(options, function (err, address) {
|
|
if (err) {
|
|
callback(err);
|
|
}
|
|
self.at(address, callback);
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be called to get access to existing contract on a blockchain
|
|
*
|
|
* @method at
|
|
* @param {Address} contract address (required)
|
|
* @param {Function} callback {optional)
|
|
* @returns {Contract} returns contract if no callback was passed,
|
|
* otherwise calls callback function (err, contract)
|
|
*/
|
|
ContractFactory.prototype.at = function (address, callback) {
|
|
// TODO: address is required
|
|
|
|
if (callback) {
|
|
callback(null, new Contract(this.abi, address));
|
|
}
|
|
return new Contract(this.abi, address);
|
|
};
|
|
|
|
/**
|
|
* Should be called to create new contract instance
|
|
*
|
|
* @method Contract
|
|
* @param {Array} abi
|
|
* @param {Address} contract address
|
|
*/
|
|
var Contract = function (abi, address) {
|
|
this.address = address;
|
|
addFunctionsToContract(this, abi);
|
|
addEventsToContract(this, abi);
|
|
};
|
|
|
|
module.exports = contract;
|
|
|
|
|
|
},{"../solidity/coder":1,"../utils/utils":7,"../web3":9,"./event":15,"./function":18}],12:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file db.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var Method = require('./method');
|
|
|
|
var putString = new Method({
|
|
name: 'putString',
|
|
call: 'db_putString',
|
|
params: 3
|
|
});
|
|
|
|
|
|
var getString = new Method({
|
|
name: 'getString',
|
|
call: 'db_getString',
|
|
params: 2
|
|
});
|
|
|
|
var putHex = new Method({
|
|
name: 'putHex',
|
|
call: 'db_putHex',
|
|
params: 3
|
|
});
|
|
|
|
var getHex = new Method({
|
|
name: 'getHex',
|
|
call: 'db_getHex',
|
|
params: 2
|
|
});
|
|
|
|
var methods = [
|
|
putString, getString, putHex, getHex
|
|
];
|
|
|
|
module.exports = {
|
|
methods: methods
|
|
};
|
|
|
|
},{"./method":22}],13:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file errors.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
module.exports = {
|
|
InvalidNumberOfParams: function () {
|
|
return new Error('Invalid number of input parameters');
|
|
},
|
|
InvalidConnection: function (host){
|
|
return new Error('CONNECTION ERROR: Couldn\'t connect to node '+ host +', is it running?');
|
|
},
|
|
InvalidProvider: function () {
|
|
return new Error('Providor not set or invalid');
|
|
},
|
|
InvalidResponse: function (result){
|
|
var message = !!result && !!result.error && !!result.error.message ? result.error.message : 'Invalid JSON RPC response';
|
|
return new Error(message);
|
|
}
|
|
};
|
|
|
|
|
|
},{}],14:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file eth.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @author Fabian Vogelsteller <fabian@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
/**
|
|
* Web3
|
|
*
|
|
* @module web3
|
|
*/
|
|
|
|
/**
|
|
* Eth methods and properties
|
|
*
|
|
* An example method object can look as follows:
|
|
*
|
|
* {
|
|
* name: 'getBlock',
|
|
* call: blockCall,
|
|
* params: 2,
|
|
* outputFormatter: formatters.outputBlockFormatter,
|
|
* inputFormatter: [ // can be a formatter funciton or an array of functions. Where each item in the array will be used for one parameter
|
|
* utils.toHex, // formats paramter 1
|
|
* function(param){ return !!param; } // formats paramter 2
|
|
* ]
|
|
* },
|
|
*
|
|
* @class [web3] eth
|
|
* @constructor
|
|
*/
|
|
|
|
"use strict";
|
|
|
|
var formatters = require('./formatters');
|
|
var utils = require('../utils/utils');
|
|
var Method = require('./method');
|
|
var Property = require('./property');
|
|
|
|
var blockCall = function (args) {
|
|
return (utils.isString(args[0]) && args[0].indexOf('0x') === 0) ? "eth_getBlockByHash" : "eth_getBlockByNumber";
|
|
};
|
|
|
|
var transactionFromBlockCall = function (args) {
|
|
return (utils.isString(args[0]) && args[0].indexOf('0x') === 0) ? 'eth_getTransactionByBlockHashAndIndex' : 'eth_getTransactionByBlockNumberAndIndex';
|
|
};
|
|
|
|
var uncleCall = function (args) {
|
|
return (utils.isString(args[0]) && args[0].indexOf('0x') === 0) ? 'eth_getUncleByBlockHashAndIndex' : 'eth_getUncleByBlockNumberAndIndex';
|
|
};
|
|
|
|
var getBlockTransactionCountCall = function (args) {
|
|
return (utils.isString(args[0]) && args[0].indexOf('0x') === 0) ? 'eth_getBlockTransactionCountByHash' : 'eth_getBlockTransactionCountByNumber';
|
|
};
|
|
|
|
var uncleCountCall = function (args) {
|
|
return (utils.isString(args[0]) && args[0].indexOf('0x') === 0) ? 'eth_getUncleCountByBlockHash' : 'eth_getUncleCountByBlockNumber';
|
|
};
|
|
|
|
/// @returns an array of objects describing web3.eth api methods
|
|
|
|
var getBalance = new Method({
|
|
name: 'getBalance',
|
|
call: 'eth_getBalance',
|
|
params: 2,
|
|
inputFormatter: [utils.toAddress, formatters.inputDefaultBlockNumberFormatter],
|
|
outputFormatter: formatters.outputBigNumberFormatter
|
|
});
|
|
|
|
var getStorageAt = new Method({
|
|
name: 'getStorageAt',
|
|
call: 'eth_getStorageAt',
|
|
params: 3,
|
|
inputFormatter: [null, utils.toHex, formatters.inputDefaultBlockNumberFormatter]
|
|
});
|
|
|
|
var getCode = new Method({
|
|
name: 'getCode',
|
|
call: 'eth_getCode',
|
|
params: 2,
|
|
inputFormatter: [utils.toAddress, formatters.inputDefaultBlockNumberFormatter]
|
|
});
|
|
|
|
var getBlock = new Method({
|
|
name: 'getBlock',
|
|
call: blockCall,
|
|
params: 2,
|
|
inputFormatter: [formatters.inputBlockNumberFormatter, function (val) { return !!val; }],
|
|
outputFormatter: formatters.outputBlockFormatter
|
|
});
|
|
|
|
var getUncle = new Method({
|
|
name: 'getUncle',
|
|
call: uncleCall,
|
|
params: 2,
|
|
inputFormatter: [formatters.inputBlockNumberFormatter, utils.toHex],
|
|
outputFormatter: formatters.outputBlockFormatter,
|
|
|
|
});
|
|
|
|
var getCompilers = new Method({
|
|
name: 'getCompilers',
|
|
call: 'eth_getCompilers',
|
|
params: 0
|
|
});
|
|
|
|
var getBlockTransactionCount = new Method({
|
|
name: 'getBlockTransactionCount',
|
|
call: getBlockTransactionCountCall,
|
|
params: 1,
|
|
inputFormatter: [formatters.inputBlockNumberFormatter],
|
|
outputFormatter: utils.toDecimal
|
|
});
|
|
|
|
var getBlockUncleCount = new Method({
|
|
name: 'getBlockUncleCount',
|
|
call: uncleCountCall,
|
|
params: 1,
|
|
inputFormatter: [formatters.inputBlockNumberFormatter],
|
|
outputFormatter: utils.toDecimal
|
|
});
|
|
|
|
var getTransaction = new Method({
|
|
name: 'getTransaction',
|
|
call: 'eth_getTransactionByHash',
|
|
params: 1,
|
|
outputFormatter: formatters.outputTransactionFormatter
|
|
});
|
|
|
|
var getTransactionFromBlock = new Method({
|
|
name: 'getTransactionFromBlock',
|
|
call: transactionFromBlockCall,
|
|
params: 2,
|
|
inputFormatter: [formatters.inputBlockNumberFormatter, utils.toHex],
|
|
outputFormatter: formatters.outputTransactionFormatter
|
|
});
|
|
|
|
var getTransactionCount = new Method({
|
|
name: 'getTransactionCount',
|
|
call: 'eth_getTransactionCount',
|
|
params: 2,
|
|
inputFormatter: [null, formatters.inputDefaultBlockNumberFormatter],
|
|
outputFormatter: utils.toDecimal
|
|
});
|
|
|
|
var sendTransaction = new Method({
|
|
name: 'sendTransaction',
|
|
call: 'eth_sendTransaction',
|
|
params: 1,
|
|
inputFormatter: [formatters.inputTransactionFormatter]
|
|
});
|
|
|
|
var call = new Method({
|
|
name: 'call',
|
|
call: 'eth_call',
|
|
params: 2,
|
|
inputFormatter: [formatters.inputTransactionFormatter, formatters.inputDefaultBlockNumberFormatter]
|
|
});
|
|
|
|
var estimateGas = new Method({
|
|
name: 'estimateGas',
|
|
call: 'eth_estimateGas',
|
|
params: 1,
|
|
inputFormatter: [formatters.inputTransactionFormatter],
|
|
outputFormatter: utils.toDecimal
|
|
});
|
|
|
|
var compileSolidity = new Method({
|
|
name: 'compile.solidity',
|
|
call: 'eth_compileSolidity',
|
|
params: 1
|
|
});
|
|
|
|
var compileLLL = new Method({
|
|
name: 'compile.lll',
|
|
call: 'eth_compileLLL',
|
|
params: 1
|
|
});
|
|
|
|
var compileSerpent = new Method({
|
|
name: 'compile.serpent',
|
|
call: 'eth_compileSerpent',
|
|
params: 1
|
|
});
|
|
|
|
var submitWork = new Method({
|
|
name: 'submitWork',
|
|
call: 'eth_submitWork',
|
|
params: 3
|
|
});
|
|
|
|
var getWork = new Method({
|
|
name: 'getWork',
|
|
call: 'eth_getWork',
|
|
params: 0
|
|
});
|
|
|
|
var methods = [
|
|
getBalance,
|
|
getStorageAt,
|
|
getCode,
|
|
getBlock,
|
|
getUncle,
|
|
getCompilers,
|
|
getBlockTransactionCount,
|
|
getBlockUncleCount,
|
|
getTransaction,
|
|
getTransactionFromBlock,
|
|
getTransactionCount,
|
|
call,
|
|
estimateGas,
|
|
sendTransaction,
|
|
compileSolidity,
|
|
compileLLL,
|
|
compileSerpent,
|
|
submitWork,
|
|
getWork
|
|
];
|
|
|
|
/// @returns an array of objects describing web3.eth api properties
|
|
|
|
|
|
|
|
var properties = [
|
|
new Property({
|
|
name: 'coinbase',
|
|
getter: 'eth_coinbase'
|
|
}),
|
|
new Property({
|
|
name: 'mining',
|
|
getter: 'eth_mining'
|
|
}),
|
|
new Property({
|
|
name: 'hashrate',
|
|
getter: 'eth_hashrate',
|
|
outputFormatter: utils.toDecimal
|
|
}),
|
|
new Property({
|
|
name: 'gasPrice',
|
|
getter: 'eth_gasPrice',
|
|
outputFormatter: formatters.outputBigNumberFormatter
|
|
}),
|
|
new Property({
|
|
name: 'accounts',
|
|
getter: 'eth_accounts'
|
|
}),
|
|
new Property({
|
|
name: 'blockNumber',
|
|
getter: 'eth_blockNumber',
|
|
outputFormatter: utils.toDecimal
|
|
})
|
|
];
|
|
|
|
module.exports = {
|
|
methods: methods,
|
|
properties: properties
|
|
};
|
|
|
|
|
|
},{"../utils/utils":7,"./formatters":17,"./method":22,"./property":25}],15:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file event.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var utils = require('../utils/utils');
|
|
var coder = require('../solidity/coder');
|
|
var web3 = require('../web3');
|
|
var formatters = require('./formatters');
|
|
var sha3 = require('../utils/sha3');
|
|
|
|
/**
|
|
* This prototype should be used to create event filters
|
|
*/
|
|
var SolidityEvent = function (json, address) {
|
|
this._params = json.inputs;
|
|
this._name = utils.transformToFullName(json);
|
|
this._address = address;
|
|
this._anonymous = json.anonymous;
|
|
};
|
|
|
|
/**
|
|
* Should be used to get filtered param types
|
|
*
|
|
* @method types
|
|
* @param {Bool} decide if returned typed should be indexed
|
|
* @return {Array} array of types
|
|
*/
|
|
SolidityEvent.prototype.types = function (indexed) {
|
|
return this._params.filter(function (i) {
|
|
return i.indexed === indexed;
|
|
}).map(function (i) {
|
|
return i.type;
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be used to get event display name
|
|
*
|
|
* @method displayName
|
|
* @return {String} event display name
|
|
*/
|
|
SolidityEvent.prototype.displayName = function () {
|
|
return utils.extractDisplayName(this._name);
|
|
};
|
|
|
|
/**
|
|
* Should be used to get event type name
|
|
*
|
|
* @method typeName
|
|
* @return {String} event type name
|
|
*/
|
|
SolidityEvent.prototype.typeName = function () {
|
|
return utils.extractTypeName(this._name);
|
|
};
|
|
|
|
/**
|
|
* Should be used to get event signature
|
|
*
|
|
* @method signature
|
|
* @return {String} event signature
|
|
*/
|
|
SolidityEvent.prototype.signature = function () {
|
|
return sha3(this._name);
|
|
};
|
|
|
|
/**
|
|
* Should be used to encode indexed params and options to one final object
|
|
*
|
|
* @method encode
|
|
* @param {Object} indexed
|
|
* @param {Object} options
|
|
* @return {Object} everything combined together and encoded
|
|
*/
|
|
SolidityEvent.prototype.encode = function (indexed, options) {
|
|
indexed = indexed || {};
|
|
options = options || {};
|
|
var result = {};
|
|
|
|
['fromBlock', 'toBlock'].filter(function (f) {
|
|
return options[f] !== undefined;
|
|
}).forEach(function (f) {
|
|
result[f] = formatters.inputBlockNumberFormatter(options[f]);
|
|
});
|
|
|
|
result.topics = [];
|
|
|
|
if (!this._anonymous) {
|
|
result.address = this._address;
|
|
result.topics.push('0x' + this.signature());
|
|
}
|
|
|
|
var indexedTopics = this._params.filter(function (i) {
|
|
return i.indexed === true;
|
|
}).map(function (i) {
|
|
var value = indexed[i.name];
|
|
if (value === undefined || value === null) {
|
|
return null;
|
|
}
|
|
|
|
if (utils.isArray(value)) {
|
|
return value.map(function (v) {
|
|
return '0x' + coder.encodeParam(i.type, v);
|
|
});
|
|
}
|
|
return '0x' + coder.encodeParam(i.type, value);
|
|
});
|
|
|
|
result.topics = result.topics.concat(indexedTopics);
|
|
|
|
return result;
|
|
};
|
|
|
|
/**
|
|
* Should be used to decode indexed params and options
|
|
*
|
|
* @method decode
|
|
* @param {Object} data
|
|
* @return {Object} result object with decoded indexed && not indexed params
|
|
*/
|
|
SolidityEvent.prototype.decode = function (data) {
|
|
|
|
data.data = data.data || '';
|
|
data.topics = data.topics || [];
|
|
|
|
var argTopics = this._anonymous ? data.topics : data.topics.slice(1);
|
|
var indexedData = argTopics.map(function (topics) { return topics.slice(2); }).join("");
|
|
var indexedParams = coder.decodeParams(this.types(true), indexedData);
|
|
|
|
var notIndexedData = data.data.slice(2);
|
|
var notIndexedParams = coder.decodeParams(this.types(false), notIndexedData);
|
|
|
|
var result = formatters.outputLogFormatter(data);
|
|
result.event = this.displayName();
|
|
result.address = data.address;
|
|
|
|
result.args = this._params.reduce(function (acc, current) {
|
|
acc[current.name] = current.indexed ? indexedParams.shift() : notIndexedParams.shift();
|
|
return acc;
|
|
}, {});
|
|
|
|
delete result.data;
|
|
delete result.topics;
|
|
|
|
return result;
|
|
};
|
|
|
|
/**
|
|
* Should be used to create new filter object from event
|
|
*
|
|
* @method execute
|
|
* @param {Object} indexed
|
|
* @param {Object} options
|
|
* @return {Object} filter object
|
|
*/
|
|
SolidityEvent.prototype.execute = function (indexed, options) {
|
|
var o = this.encode(indexed, options);
|
|
var formatter = this.decode.bind(this);
|
|
return web3.eth.filter(o, undefined, undefined, formatter);
|
|
};
|
|
|
|
/**
|
|
* Should be used to attach event to contract object
|
|
*
|
|
* @method attachToContract
|
|
* @param {Contract}
|
|
*/
|
|
SolidityEvent.prototype.attachToContract = function (contract) {
|
|
var execute = this.execute.bind(this);
|
|
var displayName = this.displayName();
|
|
if (!contract[displayName]) {
|
|
contract[displayName] = execute;
|
|
}
|
|
contract[displayName][this.typeName()] = this.execute.bind(this, contract);
|
|
};
|
|
|
|
module.exports = SolidityEvent;
|
|
|
|
|
|
},{"../solidity/coder":1,"../utils/sha3":6,"../utils/utils":7,"../web3":9,"./formatters":17}],16:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file filter.js
|
|
* @authors:
|
|
* Jeffrey Wilcke <jeff@ethdev.com>
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* Marian Oancea <marian@ethdev.com>
|
|
* Fabian Vogelsteller <fabian@ethdev.com>
|
|
* Gav Wood <g@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var RequestManager = require('./requestmanager');
|
|
var formatters = require('./formatters');
|
|
var utils = require('../utils/utils');
|
|
|
|
/**
|
|
* Converts a given topic to a hex string, but also allows null values.
|
|
*
|
|
* @param {Mixed} value
|
|
* @return {String}
|
|
*/
|
|
var toTopic = function(value){
|
|
|
|
if(value === null || typeof value === 'undefined')
|
|
return null;
|
|
|
|
value = String(value);
|
|
|
|
if(value.indexOf('0x') === 0)
|
|
return value;
|
|
else
|
|
return utils.fromAscii(value);
|
|
};
|
|
|
|
/// This method should be called on options object, to verify deprecated properties && lazy load dynamic ones
|
|
/// @param should be string or object
|
|
/// @returns options string or object
|
|
var getOptions = function (options) {
|
|
|
|
if (utils.isString(options)) {
|
|
return options;
|
|
}
|
|
|
|
options = options || {};
|
|
|
|
// make sure topics, get converted to hex
|
|
options.topics = options.topics || [];
|
|
options.topics = options.topics.map(function(topic){
|
|
return (utils.isArray(topic)) ? topic.map(toTopic) : toTopic(topic);
|
|
});
|
|
|
|
// lazy load
|
|
return {
|
|
topics: options.topics,
|
|
to: options.to,
|
|
address: options.address,
|
|
fromBlock: formatters.inputBlockNumberFormatter(options.fromBlock),
|
|
toBlock: formatters.inputBlockNumberFormatter(options.toBlock)
|
|
};
|
|
};
|
|
|
|
var Filter = function (options, methods, formatter) {
|
|
var implementation = {};
|
|
methods.forEach(function (method) {
|
|
method.attachToObject(implementation);
|
|
});
|
|
this.options = getOptions(options);
|
|
this.implementation = implementation;
|
|
this.callbacks = [];
|
|
this.formatter = formatter;
|
|
this.filterId = this.implementation.newFilter(this.options);
|
|
};
|
|
|
|
Filter.prototype.watch = function (callback) {
|
|
this.callbacks.push(callback);
|
|
var self = this;
|
|
|
|
var onMessage = function (error, messages) {
|
|
if (error) {
|
|
return self.callbacks.forEach(function (callback) {
|
|
callback(error);
|
|
});
|
|
}
|
|
|
|
messages.forEach(function (message) {
|
|
message = self.formatter ? self.formatter(message) : message;
|
|
self.callbacks.forEach(function (callback) {
|
|
callback(null, message);
|
|
});
|
|
});
|
|
};
|
|
|
|
// call getFilterLogs on start
|
|
if (!utils.isString(this.options)) {
|
|
this.get(function (err, messages) {
|
|
// don't send all the responses to all the watches again... just to this one
|
|
if (err) {
|
|
callback(err);
|
|
}
|
|
|
|
messages.forEach(function (message) {
|
|
callback(null, message);
|
|
});
|
|
});
|
|
}
|
|
|
|
RequestManager.getInstance().startPolling({
|
|
method: this.implementation.poll.call,
|
|
params: [this.filterId],
|
|
}, this.filterId, onMessage, this.stopWatching.bind(this));
|
|
};
|
|
|
|
Filter.prototype.stopWatching = function () {
|
|
RequestManager.getInstance().stopPolling(this.filterId);
|
|
this.implementation.uninstallFilter(this.filterId);
|
|
this.callbacks = [];
|
|
};
|
|
|
|
Filter.prototype.get = function (callback) {
|
|
var self = this;
|
|
if (utils.isFunction(callback)) {
|
|
this.implementation.getLogs(this.filterId, function(err, res){
|
|
if (err) {
|
|
callback(err);
|
|
} else {
|
|
callback(null, res.map(function (log) {
|
|
return self.formatter ? self.formatter(log) : log;
|
|
}));
|
|
}
|
|
});
|
|
} else {
|
|
var logs = this.implementation.getLogs(this.filterId);
|
|
return logs.map(function (log) {
|
|
return self.formatter ? self.formatter(log) : log;
|
|
});
|
|
}
|
|
};
|
|
|
|
module.exports = Filter;
|
|
|
|
|
|
},{"../utils/utils":7,"./formatters":17,"./requestmanager":27}],17:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file formatters.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @author Fabian Vogelsteller <fabian@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var utils = require('../utils/utils');
|
|
var config = require('../utils/config');
|
|
|
|
/**
|
|
* Should the format output to a big number
|
|
*
|
|
* @method outputBigNumberFormatter
|
|
* @param {String|Number|BigNumber}
|
|
* @returns {BigNumber} object
|
|
*/
|
|
var outputBigNumberFormatter = function (number) {
|
|
return utils.toBigNumber(number);
|
|
};
|
|
|
|
var isPredefinedBlockNumber = function (blockNumber) {
|
|
return blockNumber === 'latest' || blockNumber === 'pending' || blockNumber === 'earliest';
|
|
};
|
|
|
|
var inputDefaultBlockNumberFormatter = function (blockNumber) {
|
|
if (blockNumber === undefined) {
|
|
return config.defaultBlock;
|
|
}
|
|
return inputBlockNumberFormatter(blockNumber);
|
|
};
|
|
|
|
var inputBlockNumberFormatter = function (blockNumber) {
|
|
if (blockNumber === undefined) {
|
|
return undefined;
|
|
} else if (isPredefinedBlockNumber(blockNumber)) {
|
|
return blockNumber;
|
|
}
|
|
return utils.toHex(blockNumber);
|
|
};
|
|
|
|
/**
|
|
* Formats the input of a transaction and converts all values to HEX
|
|
*
|
|
* @method inputTransactionFormatter
|
|
* @param {Object} transaction options
|
|
* @returns object
|
|
*/
|
|
var inputTransactionFormatter = function (options){
|
|
|
|
options.from = options.from || config.defaultAccount;
|
|
|
|
// make code -> data
|
|
if (options.code) {
|
|
options.data = options.code;
|
|
delete options.code;
|
|
}
|
|
|
|
['gasPrice', 'gas', 'value', 'nonce'].filter(function (key) {
|
|
return options[key] !== undefined;
|
|
}).forEach(function(key){
|
|
options[key] = utils.fromDecimal(options[key]);
|
|
});
|
|
|
|
return options;
|
|
};
|
|
|
|
/**
|
|
* Formats the output of a transaction to its proper values
|
|
*
|
|
* @method outputTransactionFormatter
|
|
* @param {Object} transaction
|
|
* @returns {Object} transaction
|
|
*/
|
|
var outputTransactionFormatter = function (tx){
|
|
tx.blockNumber = utils.toDecimal(tx.blockNumber);
|
|
tx.transactionIndex = utils.toDecimal(tx.transactionIndex);
|
|
tx.nonce = utils.toDecimal(tx.nonce);
|
|
tx.gas = utils.toDecimal(tx.gas);
|
|
tx.gasPrice = utils.toBigNumber(tx.gasPrice);
|
|
tx.value = utils.toBigNumber(tx.value);
|
|
return tx;
|
|
};
|
|
|
|
/**
|
|
* Formats the output of a block to its proper values
|
|
*
|
|
* @method outputBlockFormatter
|
|
* @param {Object} block object
|
|
* @returns {Object} block object
|
|
*/
|
|
var outputBlockFormatter = function(block) {
|
|
|
|
// transform to number
|
|
block.gasLimit = utils.toDecimal(block.gasLimit);
|
|
block.gasUsed = utils.toDecimal(block.gasUsed);
|
|
block.size = utils.toDecimal(block.size);
|
|
block.timestamp = utils.toDecimal(block.timestamp);
|
|
block.number = utils.toDecimal(block.number);
|
|
|
|
block.difficulty = utils.toBigNumber(block.difficulty);
|
|
block.totalDifficulty = utils.toBigNumber(block.totalDifficulty);
|
|
|
|
if (utils.isArray(block.transactions)) {
|
|
block.transactions.forEach(function(item){
|
|
if(!utils.isString(item))
|
|
return outputTransactionFormatter(item);
|
|
});
|
|
}
|
|
|
|
return block;
|
|
};
|
|
|
|
/**
|
|
* Formats the output of a log
|
|
*
|
|
* @method outputLogFormatter
|
|
* @param {Object} log object
|
|
* @returns {Object} log
|
|
*/
|
|
var outputLogFormatter = function(log) {
|
|
if (log === null) { // 'pending' && 'latest' filters are nulls
|
|
return null;
|
|
}
|
|
|
|
log.blockNumber = utils.toDecimal(log.blockNumber);
|
|
log.transactionIndex = utils.toDecimal(log.transactionIndex);
|
|
log.logIndex = utils.toDecimal(log.logIndex);
|
|
|
|
return log;
|
|
};
|
|
|
|
/**
|
|
* Formats the input of a whisper post and converts all values to HEX
|
|
*
|
|
* @method inputPostFormatter
|
|
* @param {Object} transaction object
|
|
* @returns {Object}
|
|
*/
|
|
var inputPostFormatter = function(post) {
|
|
|
|
post.payload = utils.toHex(post.payload);
|
|
post.ttl = utils.fromDecimal(post.ttl);
|
|
post.workToProve = utils.fromDecimal(post.workToProve);
|
|
post.priority = utils.fromDecimal(post.priority);
|
|
|
|
// fallback
|
|
if (!utils.isArray(post.topics)) {
|
|
post.topics = post.topics ? [post.topics] : [];
|
|
}
|
|
|
|
// format the following options
|
|
post.topics = post.topics.map(function(topic){
|
|
return utils.fromAscii(topic);
|
|
});
|
|
|
|
return post;
|
|
};
|
|
|
|
/**
|
|
* Formats the output of a received post message
|
|
*
|
|
* @method outputPostFormatter
|
|
* @param {Object}
|
|
* @returns {Object}
|
|
*/
|
|
var outputPostFormatter = function(post){
|
|
|
|
post.expiry = utils.toDecimal(post.expiry);
|
|
post.sent = utils.toDecimal(post.sent);
|
|
post.ttl = utils.toDecimal(post.ttl);
|
|
post.workProved = utils.toDecimal(post.workProved);
|
|
post.payloadRaw = post.payload;
|
|
post.payload = utils.toAscii(post.payload);
|
|
|
|
if (utils.isJson(post.payload)) {
|
|
post.payload = JSON.parse(post.payload);
|
|
}
|
|
|
|
// format the following options
|
|
if (!post.topics) {
|
|
post.topics = [];
|
|
}
|
|
post.topics = post.topics.map(function(topic){
|
|
return utils.toAscii(topic);
|
|
});
|
|
|
|
return post;
|
|
};
|
|
|
|
module.exports = {
|
|
inputDefaultBlockNumberFormatter: inputDefaultBlockNumberFormatter,
|
|
inputBlockNumberFormatter: inputBlockNumberFormatter,
|
|
inputTransactionFormatter: inputTransactionFormatter,
|
|
inputPostFormatter: inputPostFormatter,
|
|
outputBigNumberFormatter: outputBigNumberFormatter,
|
|
outputTransactionFormatter: outputTransactionFormatter,
|
|
outputBlockFormatter: outputBlockFormatter,
|
|
outputLogFormatter: outputLogFormatter,
|
|
outputPostFormatter: outputPostFormatter
|
|
};
|
|
|
|
|
|
},{"../utils/config":5,"../utils/utils":7}],18:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file function.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var web3 = require('../web3');
|
|
var coder = require('../solidity/coder');
|
|
var utils = require('../utils/utils');
|
|
var sha3 = require('../utils/sha3');
|
|
|
|
/**
|
|
* This prototype should be used to call/sendTransaction to solidity functions
|
|
*/
|
|
var SolidityFunction = function (json, address) {
|
|
this._inputTypes = json.inputs.map(function (i) {
|
|
return i.type;
|
|
});
|
|
this._outputTypes = json.outputs.map(function (i) {
|
|
return i.type;
|
|
});
|
|
this._constant = json.constant;
|
|
this._name = utils.transformToFullName(json);
|
|
this._address = address;
|
|
};
|
|
|
|
SolidityFunction.prototype.extractCallback = function (args) {
|
|
if (utils.isFunction(args[args.length - 1])) {
|
|
return args.pop(); // modify the args array!
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should be used to create payload from arguments
|
|
*
|
|
* @method toPayload
|
|
* @param {Array} solidity function params
|
|
* @param {Object} optional payload options
|
|
*/
|
|
SolidityFunction.prototype.toPayload = function (args) {
|
|
var options = {};
|
|
if (args.length > this._inputTypes.length && utils.isObject(args[args.length -1])) {
|
|
options = args[args.length - 1];
|
|
}
|
|
options.to = this._address;
|
|
options.data = '0x' + this.signature() + coder.encodeParams(this._inputTypes, args);
|
|
return options;
|
|
};
|
|
|
|
/**
|
|
* Should be used to get function signature
|
|
*
|
|
* @method signature
|
|
* @return {String} function signature
|
|
*/
|
|
SolidityFunction.prototype.signature = function () {
|
|
return sha3(this._name).slice(0, 8);
|
|
};
|
|
|
|
|
|
SolidityFunction.prototype.unpackOutput = function (output) {
|
|
if (!output) {
|
|
return;
|
|
}
|
|
|
|
output = output.length >= 2 ? output.slice(2) : output;
|
|
var result = coder.decodeParams(this._outputTypes, output);
|
|
return result.length === 1 ? result[0] : result;
|
|
};
|
|
|
|
/**
|
|
* Calls a contract function.
|
|
*
|
|
* @method call
|
|
* @param {...Object} Contract function arguments
|
|
* @param {function} If the last argument is a function, the contract function
|
|
* call will be asynchronous, and the callback will be passed the
|
|
* error and result.
|
|
* @return {String} output bytes
|
|
*/
|
|
SolidityFunction.prototype.call = function () {
|
|
var args = Array.prototype.slice.call(arguments).filter(function (a) {return a !== undefined; });
|
|
var callback = this.extractCallback(args);
|
|
var payload = this.toPayload(args);
|
|
|
|
if (!callback) {
|
|
var output = web3.eth.call(payload);
|
|
return this.unpackOutput(output);
|
|
}
|
|
|
|
var self = this;
|
|
web3.eth.call(payload, function (error, output) {
|
|
callback(error, self.unpackOutput(output));
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be used to sendTransaction to solidity function
|
|
*
|
|
* @method sendTransaction
|
|
* @param {Object} options
|
|
*/
|
|
SolidityFunction.prototype.sendTransaction = function () {
|
|
var args = Array.prototype.slice.call(arguments).filter(function (a) {return a !== undefined; });
|
|
var callback = this.extractCallback(args);
|
|
var payload = this.toPayload(args);
|
|
|
|
if (!callback) {
|
|
return web3.eth.sendTransaction(payload);
|
|
}
|
|
|
|
web3.eth.sendTransaction(payload, callback);
|
|
};
|
|
|
|
/**
|
|
* Should be used to estimateGas of solidity function
|
|
*
|
|
* @method estimateGas
|
|
* @param {Object} options
|
|
*/
|
|
SolidityFunction.prototype.estimateGas = function () {
|
|
var args = Array.prototype.slice.call(arguments);
|
|
var callback = this.extractCallback(args);
|
|
var payload = this.toPayload(args);
|
|
|
|
if (!callback) {
|
|
return web3.eth.estimateGas(payload);
|
|
}
|
|
|
|
web3.eth.estimateGas(payload, callback);
|
|
};
|
|
|
|
/**
|
|
* Should be used to get function display name
|
|
*
|
|
* @method displayName
|
|
* @return {String} display name of the function
|
|
*/
|
|
SolidityFunction.prototype.displayName = function () {
|
|
return utils.extractDisplayName(this._name);
|
|
};
|
|
|
|
/**
|
|
* Should be used to get function type name
|
|
*
|
|
* @method typeName
|
|
* @return {String} type name of the function
|
|
*/
|
|
SolidityFunction.prototype.typeName = function () {
|
|
return utils.extractTypeName(this._name);
|
|
};
|
|
|
|
/**
|
|
* Should be called to get rpc requests from solidity function
|
|
*
|
|
* @method request
|
|
* @returns {Object}
|
|
*/
|
|
SolidityFunction.prototype.request = function () {
|
|
var args = Array.prototype.slice.call(arguments);
|
|
var callback = this.extractCallback(args);
|
|
var payload = this.toPayload(args);
|
|
var format = this.unpackOutput.bind(this);
|
|
|
|
return {
|
|
callback: callback,
|
|
payload: payload,
|
|
format: format
|
|
};
|
|
};
|
|
|
|
/**
|
|
* Should be called to execute function
|
|
*
|
|
* @method execute
|
|
*/
|
|
SolidityFunction.prototype.execute = function () {
|
|
var transaction = !this._constant;
|
|
|
|
// send transaction
|
|
if (transaction) {
|
|
return this.sendTransaction.apply(this, Array.prototype.slice.call(arguments));
|
|
}
|
|
|
|
// call
|
|
return this.call.apply(this, Array.prototype.slice.call(arguments));
|
|
};
|
|
|
|
/**
|
|
* Should be called to attach function to contract
|
|
*
|
|
* @method attachToContract
|
|
* @param {Contract}
|
|
*/
|
|
SolidityFunction.prototype.attachToContract = function (contract) {
|
|
var execute = this.execute.bind(this);
|
|
execute.request = this.request.bind(this);
|
|
execute.call = this.call.bind(this);
|
|
execute.sendTransaction = this.sendTransaction.bind(this);
|
|
execute.estimateGas = this.estimateGas.bind(this);
|
|
var displayName = this.displayName();
|
|
if (!contract[displayName]) {
|
|
contract[displayName] = execute;
|
|
}
|
|
contract[displayName][this.typeName()] = execute; // circular!!!!
|
|
};
|
|
|
|
module.exports = SolidityFunction;
|
|
|
|
|
|
},{"../solidity/coder":1,"../utils/sha3":6,"../utils/utils":7,"../web3":9}],19:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file httpprovider.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* Marian Oancea <marian@ethdev.com>
|
|
* Fabian Vogelsteller <fabian@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
"use strict";
|
|
|
|
var XMLHttpRequest = require('xmlhttprequest').XMLHttpRequest; // jshint ignore:line
|
|
var errors = require('./errors');
|
|
|
|
var HttpProvider = function (host) {
|
|
this.host = host || 'http://localhost:8545';
|
|
};
|
|
|
|
HttpProvider.prototype.send = function (payload) {
|
|
var request = new XMLHttpRequest();
|
|
|
|
request.open('POST', this.host, false);
|
|
|
|
try {
|
|
request.send(JSON.stringify(payload));
|
|
} catch(error) {
|
|
throw errors.InvalidConnection(this.host);
|
|
}
|
|
|
|
|
|
// check request.status
|
|
// TODO: throw an error here! it cannot silently fail!!!
|
|
//if (request.status !== 200) {
|
|
//return;
|
|
//}
|
|
|
|
var result = request.responseText;
|
|
|
|
try {
|
|
result = JSON.parse(result);
|
|
} catch(e) {
|
|
throw errors.InvalidResponse(result);
|
|
}
|
|
|
|
return result;
|
|
};
|
|
|
|
HttpProvider.prototype.sendAsync = function (payload, callback) {
|
|
var request = new XMLHttpRequest();
|
|
request.onreadystatechange = function() {
|
|
if (request.readyState === 4) {
|
|
var result = request.responseText;
|
|
var error = null;
|
|
|
|
try {
|
|
result = JSON.parse(result);
|
|
} catch(e) {
|
|
error = errors.InvalidResponse(result);
|
|
}
|
|
|
|
callback(error, result);
|
|
}
|
|
};
|
|
|
|
request.open('POST', this.host, true);
|
|
|
|
try {
|
|
request.send(JSON.stringify(payload));
|
|
} catch(error) {
|
|
callback(errors.InvalidConnection(this.host));
|
|
}
|
|
};
|
|
|
|
module.exports = HttpProvider;
|
|
|
|
|
|
},{"./errors":13,"xmlhttprequest":4}],20:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file icap.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var utils = require('../utils/utils');
|
|
|
|
/**
|
|
* This prototype should be used to extract necessary information from iban address
|
|
*
|
|
* @param {String} iban
|
|
*/
|
|
var ICAP = function (iban) {
|
|
this._iban = iban;
|
|
};
|
|
|
|
/**
|
|
* Should be called to check if icap is correct
|
|
*
|
|
* @method isValid
|
|
* @returns {Boolean} true if it is, otherwise false
|
|
*/
|
|
ICAP.prototype.isValid = function () {
|
|
return utils.isIBAN(this._iban);
|
|
};
|
|
|
|
/**
|
|
* Should be called to check if iban number is direct
|
|
*
|
|
* @method isDirect
|
|
* @returns {Boolean} true if it is, otherwise false
|
|
*/
|
|
ICAP.prototype.isDirect = function () {
|
|
return this._iban.length === 34;
|
|
};
|
|
|
|
/**
|
|
* Should be called to check if iban number if indirect
|
|
*
|
|
* @method isIndirect
|
|
* @returns {Boolean} true if it is, otherwise false
|
|
*/
|
|
ICAP.prototype.isIndirect = function () {
|
|
return this._iban.length === 20;
|
|
};
|
|
|
|
/**
|
|
* Should be called to get iban checksum
|
|
* Uses the mod-97-10 checksumming protocol (ISO/IEC 7064:2003)
|
|
*
|
|
* @method checksum
|
|
* @returns {String} checksum
|
|
*/
|
|
ICAP.prototype.checksum = function () {
|
|
return this._iban.substr(2, 2);
|
|
};
|
|
|
|
/**
|
|
* Should be called to get institution identifier
|
|
* eg. XREG
|
|
*
|
|
* @method institution
|
|
* @returns {String} institution identifier
|
|
*/
|
|
ICAP.prototype.institution = function () {
|
|
return this.isIndirect() ? this._iban.substr(7, 4) : '';
|
|
};
|
|
|
|
/**
|
|
* Should be called to get client identifier within institution
|
|
* eg. GAVOFYORK
|
|
*
|
|
* @method client
|
|
* @returns {String} client identifier
|
|
*/
|
|
ICAP.prototype.client = function () {
|
|
return this.isIndirect() ? this._iban.substr(11) : '';
|
|
};
|
|
|
|
/**
|
|
* Should be called to get client direct address
|
|
*
|
|
* @method address
|
|
* @returns {String} client direct address
|
|
*/
|
|
ICAP.prototype.address = function () {
|
|
return this.isDirect() ? this._iban.substr(4) : '';
|
|
};
|
|
|
|
module.exports = ICAP;
|
|
|
|
|
|
},{"../utils/utils":7}],21:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file jsonrpc.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var Jsonrpc = function () {
|
|
// singleton pattern
|
|
if (arguments.callee._singletonInstance) {
|
|
return arguments.callee._singletonInstance;
|
|
}
|
|
arguments.callee._singletonInstance = this;
|
|
|
|
this.messageId = 1;
|
|
};
|
|
|
|
/**
|
|
* @return {Jsonrpc} singleton
|
|
*/
|
|
Jsonrpc.getInstance = function () {
|
|
var instance = new Jsonrpc();
|
|
return instance;
|
|
};
|
|
|
|
/**
|
|
* Should be called to valid json create payload object
|
|
*
|
|
* @method toPayload
|
|
* @param {Function} method of jsonrpc call, required
|
|
* @param {Array} params, an array of method params, optional
|
|
* @returns {Object} valid jsonrpc payload object
|
|
*/
|
|
Jsonrpc.prototype.toPayload = function (method, params) {
|
|
if (!method)
|
|
console.error('jsonrpc method should be specified!');
|
|
|
|
return {
|
|
jsonrpc: '2.0',
|
|
method: method,
|
|
params: params || [],
|
|
id: this.messageId++
|
|
};
|
|
};
|
|
|
|
/**
|
|
* Should be called to check if jsonrpc response is valid
|
|
*
|
|
* @method isValidResponse
|
|
* @param {Object}
|
|
* @returns {Boolean} true if response is valid, otherwise false
|
|
*/
|
|
Jsonrpc.prototype.isValidResponse = function (response) {
|
|
return !!response &&
|
|
!response.error &&
|
|
response.jsonrpc === '2.0' &&
|
|
typeof response.id === 'number' &&
|
|
response.result !== undefined; // only undefined is not valid json object
|
|
};
|
|
|
|
/**
|
|
* Should be called to create batch payload object
|
|
*
|
|
* @method toBatchPayload
|
|
* @param {Array} messages, an array of objects with method (required) and params (optional) fields
|
|
* @returns {Array} batch payload
|
|
*/
|
|
Jsonrpc.prototype.toBatchPayload = function (messages) {
|
|
var self = this;
|
|
return messages.map(function (message) {
|
|
return self.toPayload(message.method, message.params);
|
|
});
|
|
};
|
|
|
|
module.exports = Jsonrpc;
|
|
|
|
|
|
},{}],22:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file method.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var RequestManager = require('./requestmanager');
|
|
var utils = require('../utils/utils');
|
|
var errors = require('./errors');
|
|
|
|
var Method = function (options) {
|
|
this.name = options.name;
|
|
this.call = options.call;
|
|
this.params = options.params || 0;
|
|
this.inputFormatter = options.inputFormatter;
|
|
this.outputFormatter = options.outputFormatter;
|
|
};
|
|
|
|
/**
|
|
* Should be used to determine name of the jsonrpc method based on arguments
|
|
*
|
|
* @method getCall
|
|
* @param {Array} arguments
|
|
* @return {String} name of jsonrpc method
|
|
*/
|
|
Method.prototype.getCall = function (args) {
|
|
return utils.isFunction(this.call) ? this.call(args) : this.call;
|
|
};
|
|
|
|
/**
|
|
* Should be used to extract callback from array of arguments. Modifies input param
|
|
*
|
|
* @method extractCallback
|
|
* @param {Array} arguments
|
|
* @return {Function|Null} callback, if exists
|
|
*/
|
|
Method.prototype.extractCallback = function (args) {
|
|
if (utils.isFunction(args[args.length - 1])) {
|
|
return args.pop(); // modify the args array!
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should be called to check if the number of arguments is correct
|
|
*
|
|
* @method validateArgs
|
|
* @param {Array} arguments
|
|
* @throws {Error} if it is not
|
|
*/
|
|
Method.prototype.validateArgs = function (args) {
|
|
if (args.length !== this.params) {
|
|
throw errors.InvalidNumberOfParams();
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should be called to format input args of method
|
|
*
|
|
* @method formatInput
|
|
* @param {Array}
|
|
* @return {Array}
|
|
*/
|
|
Method.prototype.formatInput = function (args) {
|
|
if (!this.inputFormatter) {
|
|
return args;
|
|
}
|
|
|
|
return this.inputFormatter.map(function (formatter, index) {
|
|
return formatter ? formatter(args[index]) : args[index];
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be called to format output(result) of method
|
|
*
|
|
* @method formatOutput
|
|
* @param {Object}
|
|
* @return {Object}
|
|
*/
|
|
Method.prototype.formatOutput = function (result) {
|
|
return this.outputFormatter && result !== null ? this.outputFormatter(result) : result;
|
|
};
|
|
|
|
/**
|
|
* Should attach function to method
|
|
*
|
|
* @method attachToObject
|
|
* @param {Object}
|
|
* @param {Function}
|
|
*/
|
|
Method.prototype.attachToObject = function (obj) {
|
|
var func = this.send.bind(this);
|
|
func.request = this.request.bind(this);
|
|
func.call = this.call; // that's ugly. filter.js uses it
|
|
var name = this.name.split('.');
|
|
if (name.length > 1) {
|
|
obj[name[0]] = obj[name[0]] || {};
|
|
obj[name[0]][name[1]] = func;
|
|
} else {
|
|
obj[name[0]] = func;
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should create payload from given input args
|
|
*
|
|
* @method toPayload
|
|
* @param {Array} args
|
|
* @return {Object}
|
|
*/
|
|
Method.prototype.toPayload = function (args) {
|
|
var call = this.getCall(args);
|
|
var callback = this.extractCallback(args);
|
|
var params = this.formatInput(args);
|
|
this.validateArgs(params);
|
|
|
|
return {
|
|
method: call,
|
|
params: params,
|
|
callback: callback
|
|
};
|
|
};
|
|
|
|
/**
|
|
* Should be called to create pure JSONRPC request which can be used in batch request
|
|
*
|
|
* @method request
|
|
* @param {...} params
|
|
* @return {Object} jsonrpc request
|
|
*/
|
|
Method.prototype.request = function () {
|
|
var payload = this.toPayload(Array.prototype.slice.call(arguments));
|
|
payload.format = this.formatOutput.bind(this);
|
|
return payload;
|
|
};
|
|
|
|
/**
|
|
* Should send request to the API
|
|
*
|
|
* @method send
|
|
* @param list of params
|
|
* @return result
|
|
*/
|
|
Method.prototype.send = function () {
|
|
var payload = this.toPayload(Array.prototype.slice.call(arguments));
|
|
if (payload.callback) {
|
|
var self = this;
|
|
return RequestManager.getInstance().sendAsync(payload, function (err, result) {
|
|
payload.callback(err, self.formatOutput(result));
|
|
});
|
|
}
|
|
return this.formatOutput(RequestManager.getInstance().send(payload));
|
|
};
|
|
|
|
module.exports = Method;
|
|
|
|
|
|
},{"../utils/utils":7,"./errors":13,"./requestmanager":27}],23:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file namereg.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var contract = require('./contract');
|
|
|
|
var address = '0xc6d9d2cd449a754c494264e1809c50e34d64562b';
|
|
|
|
var abi = [
|
|
{"constant":true,"inputs":[{"name":"_owner","type":"address"}],"name":"name","outputs":[{"name":"o_name","type":"bytes32"}],"type":"function"},
|
|
{"constant":true,"inputs":[{"name":"_name","type":"bytes32"}],"name":"owner","outputs":[{"name":"","type":"address"}],"type":"function"},
|
|
{"constant":true,"inputs":[{"name":"_name","type":"bytes32"}],"name":"content","outputs":[{"name":"","type":"bytes32"}],"type":"function"},
|
|
{"constant":true,"inputs":[{"name":"_name","type":"bytes32"}],"name":"addr","outputs":[{"name":"","type":"address"}],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"}],"name":"reserve","outputs":[],"type":"function"},
|
|
{"constant":true,"inputs":[{"name":"_name","type":"bytes32"}],"name":"subRegistrar","outputs":[{"name":"o_subRegistrar","type":"address"}],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"},{"name":"_newOwner","type":"address"}],"name":"transfer","outputs":[],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"},{"name":"_registrar","type":"address"}],"name":"setSubRegistrar","outputs":[],"type":"function"},
|
|
{"constant":false,"inputs":[],"name":"Registrar","outputs":[],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"},{"name":"_a","type":"address"},{"name":"_primary","type":"bool"}],"name":"setAddress","outputs":[],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"},{"name":"_content","type":"bytes32"}],"name":"setContent","outputs":[],"type":"function"},
|
|
{"constant":false,"inputs":[{"name":"_name","type":"bytes32"}],"name":"disown","outputs":[],"type":"function"},
|
|
{"constant":true,"inputs":[{"name":"_name","type":"bytes32"}],"name":"register","outputs":[{"name":"","type":"address"}],"type":"function"},
|
|
{"anonymous":false,"inputs":[{"indexed":true,"name":"name","type":"bytes32"}],"name":"Changed","type":"event"},
|
|
{"anonymous":false,"inputs":[{"indexed":true,"name":"name","type":"bytes32"},{"indexed":true,"name":"addr","type":"address"}],"name":"PrimaryChanged","type":"event"}
|
|
];
|
|
|
|
module.exports = contract(abi).at(address);
|
|
|
|
|
|
},{"./contract":11}],24:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file eth.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var utils = require('../utils/utils');
|
|
var Property = require('./property');
|
|
|
|
/// @returns an array of objects describing web3.eth api methods
|
|
var methods = [
|
|
];
|
|
|
|
/// @returns an array of objects describing web3.eth api properties
|
|
var properties = [
|
|
new Property({
|
|
name: 'listening',
|
|
getter: 'net_listening'
|
|
}),
|
|
new Property({
|
|
name: 'peerCount',
|
|
getter: 'net_peerCount',
|
|
outputFormatter: utils.toDecimal
|
|
})
|
|
];
|
|
|
|
|
|
module.exports = {
|
|
methods: methods,
|
|
properties: properties
|
|
};
|
|
|
|
|
|
},{"../utils/utils":7,"./property":25}],25:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file property.js
|
|
* @author Fabian Vogelsteller <fabian@frozeman.de>
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var RequestManager = require('./requestmanager');
|
|
|
|
var Property = function (options) {
|
|
this.name = options.name;
|
|
this.getter = options.getter;
|
|
this.setter = options.setter;
|
|
this.outputFormatter = options.outputFormatter;
|
|
this.inputFormatter = options.inputFormatter;
|
|
};
|
|
|
|
/**
|
|
* Should be called to format input args of method
|
|
*
|
|
* @method formatInput
|
|
* @param {Array}
|
|
* @return {Array}
|
|
*/
|
|
Property.prototype.formatInput = function (arg) {
|
|
return this.inputFormatter ? this.inputFormatter(arg) : arg;
|
|
};
|
|
|
|
/**
|
|
* Should be called to format output(result) of method
|
|
*
|
|
* @method formatOutput
|
|
* @param {Object}
|
|
* @return {Object}
|
|
*/
|
|
Property.prototype.formatOutput = function (result) {
|
|
return this.outputFormatter && result !== null ? this.outputFormatter(result) : result;
|
|
};
|
|
|
|
/**
|
|
* Should attach function to method
|
|
*
|
|
* @method attachToObject
|
|
* @param {Object}
|
|
* @param {Function}
|
|
*/
|
|
Property.prototype.attachToObject = function (obj) {
|
|
var proto = {
|
|
get: this.get.bind(this),
|
|
};
|
|
|
|
var names = this.name.split('.');
|
|
var name = names[0];
|
|
if (names.length > 1) {
|
|
obj[names[0]] = obj[names[0]] || {};
|
|
obj = obj[names[0]];
|
|
name = names[1];
|
|
}
|
|
|
|
Object.defineProperty(obj, name, proto);
|
|
|
|
var toAsyncName = function (prefix, name) {
|
|
return prefix + name.charAt(0).toUpperCase() + name.slice(1);
|
|
};
|
|
|
|
obj[toAsyncName('get', name)] = this.getAsync.bind(this);
|
|
};
|
|
|
|
/**
|
|
* Should be used to get value of the property
|
|
*
|
|
* @method get
|
|
* @return {Object} value of the property
|
|
*/
|
|
Property.prototype.get = function () {
|
|
return this.formatOutput(RequestManager.getInstance().send({
|
|
method: this.getter
|
|
}));
|
|
};
|
|
|
|
/**
|
|
* Should be used to asynchrounously get value of property
|
|
*
|
|
* @method getAsync
|
|
* @param {Function}
|
|
*/
|
|
Property.prototype.getAsync = function (callback) {
|
|
var self = this;
|
|
RequestManager.getInstance().sendAsync({
|
|
method: this.getter
|
|
}, function (err, result) {
|
|
if (err) {
|
|
return callback(err);
|
|
}
|
|
callback(err, self.formatOutput(result));
|
|
});
|
|
};
|
|
|
|
module.exports = Property;
|
|
|
|
|
|
},{"./requestmanager":27}],26:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file qtsync.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* Marian Oancea <marian@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var QtSyncProvider = function () {
|
|
};
|
|
|
|
QtSyncProvider.prototype.send = function (payload) {
|
|
var result = navigator.qt.callMethod(JSON.stringify(payload));
|
|
return JSON.parse(result);
|
|
};
|
|
|
|
module.exports = QtSyncProvider;
|
|
|
|
|
|
},{}],27:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file requestmanager.js
|
|
* @author Jeffrey Wilcke <jeff@ethdev.com>
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @author Marian Oancea <marian@ethdev.com>
|
|
* @author Fabian Vogelsteller <fabian@ethdev.com>
|
|
* @author Gav Wood <g@ethdev.com>
|
|
* @date 2014
|
|
*/
|
|
|
|
var Jsonrpc = require('./jsonrpc');
|
|
var utils = require('../utils/utils');
|
|
var c = require('../utils/config');
|
|
var errors = require('./errors');
|
|
|
|
/**
|
|
* It's responsible for passing messages to providers
|
|
* It's also responsible for polling the ethereum node for incoming messages
|
|
* Default poll timeout is 1 second
|
|
* Singleton
|
|
*/
|
|
var RequestManager = function (provider) {
|
|
// singleton pattern
|
|
if (arguments.callee._singletonInstance) {
|
|
return arguments.callee._singletonInstance;
|
|
}
|
|
arguments.callee._singletonInstance = this;
|
|
|
|
this.provider = provider;
|
|
this.polls = [];
|
|
this.timeout = null;
|
|
this.poll();
|
|
};
|
|
|
|
/**
|
|
* @return {RequestManager} singleton
|
|
*/
|
|
RequestManager.getInstance = function () {
|
|
var instance = new RequestManager();
|
|
return instance;
|
|
};
|
|
|
|
/**
|
|
* Should be used to synchronously send request
|
|
*
|
|
* @method send
|
|
* @param {Object} data
|
|
* @return {Object}
|
|
*/
|
|
RequestManager.prototype.send = function (data) {
|
|
if (!this.provider) {
|
|
console.error(errors.InvalidProvider());
|
|
return null;
|
|
}
|
|
|
|
var payload = Jsonrpc.getInstance().toPayload(data.method, data.params);
|
|
var result = this.provider.send(payload);
|
|
|
|
if (!Jsonrpc.getInstance().isValidResponse(result)) {
|
|
throw errors.InvalidResponse(result);
|
|
}
|
|
|
|
return result.result;
|
|
};
|
|
|
|
/**
|
|
* Should be used to asynchronously send request
|
|
*
|
|
* @method sendAsync
|
|
* @param {Object} data
|
|
* @param {Function} callback
|
|
*/
|
|
RequestManager.prototype.sendAsync = function (data, callback) {
|
|
if (!this.provider) {
|
|
return callback(errors.InvalidProvider());
|
|
}
|
|
|
|
var payload = Jsonrpc.getInstance().toPayload(data.method, data.params);
|
|
this.provider.sendAsync(payload, function (err, result) {
|
|
if (err) {
|
|
return callback(err);
|
|
}
|
|
|
|
if (!Jsonrpc.getInstance().isValidResponse(result)) {
|
|
return callback(errors.InvalidResponse(result));
|
|
}
|
|
|
|
callback(null, result.result);
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be called to asynchronously send batch request
|
|
*
|
|
* @method sendBatch
|
|
* @param {Array} batch data
|
|
* @param {Function} callback
|
|
*/
|
|
RequestManager.prototype.sendBatch = function (data, callback) {
|
|
if (!this.provider) {
|
|
return callback(errors.InvalidProvider());
|
|
}
|
|
|
|
var payload = Jsonrpc.getInstance().toBatchPayload(data);
|
|
|
|
this.provider.sendAsync(payload, function (err, results) {
|
|
if (err) {
|
|
return callback(err);
|
|
}
|
|
|
|
if (!utils.isArray(results)) {
|
|
return callback(errors.InvalidResponse(results));
|
|
}
|
|
|
|
callback(err, results);
|
|
});
|
|
};
|
|
|
|
/**
|
|
* Should be used to set provider of request manager
|
|
*
|
|
* @method setProvider
|
|
* @param {Object}
|
|
*/
|
|
RequestManager.prototype.setProvider = function (p) {
|
|
this.provider = p;
|
|
};
|
|
|
|
/*jshint maxparams:4 */
|
|
|
|
/**
|
|
* Should be used to start polling
|
|
*
|
|
* @method startPolling
|
|
* @param {Object} data
|
|
* @param {Number} pollId
|
|
* @param {Function} callback
|
|
* @param {Function} uninstall
|
|
*
|
|
* @todo cleanup number of params
|
|
*/
|
|
RequestManager.prototype.startPolling = function (data, pollId, callback, uninstall) {
|
|
this.polls.push({data: data, id: pollId, callback: callback, uninstall: uninstall});
|
|
};
|
|
/*jshint maxparams:3 */
|
|
|
|
/**
|
|
* Should be used to stop polling for filter with given id
|
|
*
|
|
* @method stopPolling
|
|
* @param {Number} pollId
|
|
*/
|
|
RequestManager.prototype.stopPolling = function (pollId) {
|
|
for (var i = this.polls.length; i--;) {
|
|
var poll = this.polls[i];
|
|
if (poll.id === pollId) {
|
|
this.polls.splice(i, 1);
|
|
}
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Should be called to reset polling mechanism of request manager
|
|
*
|
|
* @method reset
|
|
*/
|
|
RequestManager.prototype.reset = function () {
|
|
this.polls.forEach(function (poll) {
|
|
poll.uninstall(poll.id);
|
|
});
|
|
this.polls = [];
|
|
|
|
if (this.timeout) {
|
|
clearTimeout(this.timeout);
|
|
this.timeout = null;
|
|
}
|
|
this.poll();
|
|
};
|
|
|
|
/**
|
|
* Should be called to poll for changes on filter with given id
|
|
*
|
|
* @method poll
|
|
*/
|
|
RequestManager.prototype.poll = function () {
|
|
this.timeout = setTimeout(this.poll.bind(this), c.ETH_POLLING_TIMEOUT);
|
|
|
|
if (!this.polls.length) {
|
|
return;
|
|
}
|
|
|
|
if (!this.provider) {
|
|
console.error(errors.InvalidProvider());
|
|
return;
|
|
}
|
|
|
|
var payload = Jsonrpc.getInstance().toBatchPayload(this.polls.map(function (data) {
|
|
return data.data;
|
|
}));
|
|
|
|
var self = this;
|
|
this.provider.sendAsync(payload, function (error, results) {
|
|
// TODO: console log?
|
|
if (error) {
|
|
return;
|
|
}
|
|
|
|
if (!utils.isArray(results)) {
|
|
throw errors.InvalidResponse(results);
|
|
}
|
|
|
|
results.map(function (result, index) {
|
|
result.callback = self.polls[index].callback;
|
|
return result;
|
|
}).filter(function (result) {
|
|
var valid = Jsonrpc.getInstance().isValidResponse(result);
|
|
if (!valid) {
|
|
result.callback(errors.InvalidResponse(result));
|
|
}
|
|
return valid;
|
|
}).filter(function (result) {
|
|
return utils.isArray(result.result) && result.result.length > 0;
|
|
}).forEach(function (result) {
|
|
result.callback(null, result.result);
|
|
});
|
|
});
|
|
};
|
|
|
|
module.exports = RequestManager;
|
|
|
|
|
|
},{"../utils/config":5,"../utils/utils":7,"./errors":13,"./jsonrpc":21}],28:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file shh.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var Method = require('./method');
|
|
var formatters = require('./formatters');
|
|
|
|
var post = new Method({
|
|
name: 'post',
|
|
call: 'shh_post',
|
|
params: 1,
|
|
inputFormatter: [formatters.inputPostFormatter]
|
|
});
|
|
|
|
var newIdentity = new Method({
|
|
name: 'newIdentity',
|
|
call: 'shh_newIdentity',
|
|
params: 0
|
|
});
|
|
|
|
var hasIdentity = new Method({
|
|
name: 'hasIdentity',
|
|
call: 'shh_hasIdentity',
|
|
params: 1
|
|
});
|
|
|
|
var newGroup = new Method({
|
|
name: 'newGroup',
|
|
call: 'shh_newGroup',
|
|
params: 0
|
|
});
|
|
|
|
var addToGroup = new Method({
|
|
name: 'addToGroup',
|
|
call: 'shh_addToGroup',
|
|
params: 0
|
|
});
|
|
|
|
var methods = [
|
|
post,
|
|
newIdentity,
|
|
hasIdentity,
|
|
newGroup,
|
|
addToGroup
|
|
];
|
|
|
|
module.exports = {
|
|
methods: methods
|
|
};
|
|
|
|
|
|
},{"./formatters":17,"./method":22}],29:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/**
|
|
* @file transfer.js
|
|
* @author Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var web3 = require('../web3');
|
|
var ICAP = require('./icap');
|
|
var namereg = require('./namereg');
|
|
var contract = require('./contract');
|
|
|
|
/**
|
|
* Should be used to make ICAP transfer
|
|
*
|
|
* @method transfer
|
|
* @param {String} iban number
|
|
* @param {String} from (address)
|
|
* @param {Value} value to be tranfered
|
|
* @param {Function} callback, callback
|
|
*/
|
|
var transfer = function (from, iban, value, callback) {
|
|
var icap = new ICAP(iban);
|
|
if (!icap.isValid()) {
|
|
throw new Error('invalid iban address');
|
|
}
|
|
|
|
if (icap.isDirect()) {
|
|
return transferToAddress(from, icap.address(), value, callback);
|
|
}
|
|
|
|
if (!callback) {
|
|
var address = namereg.addr(icap.institution());
|
|
return deposit(from, address, value, icap.client());
|
|
}
|
|
|
|
namereg.addr(icap.insitution(), function (err, address) {
|
|
return deposit(from, address, value, icap.client(), callback);
|
|
});
|
|
|
|
};
|
|
|
|
/**
|
|
* Should be used to transfer funds to certain address
|
|
*
|
|
* @method transferToAddress
|
|
* @param {String} address
|
|
* @param {String} from (address)
|
|
* @param {Value} value to be tranfered
|
|
* @param {Function} callback, callback
|
|
*/
|
|
var transferToAddress = function (from, address, value, callback) {
|
|
return web3.eth.sendTransaction({
|
|
address: address,
|
|
from: from,
|
|
value: value
|
|
}, callback);
|
|
};
|
|
|
|
/**
|
|
* Should be used to deposit funds to generic Exchange contract (must implement deposit(bytes32) method!)
|
|
*
|
|
* @method deposit
|
|
* @param {String} address
|
|
* @param {String} from (address)
|
|
* @param {Value} value to be tranfered
|
|
* @param {String} client unique identifier
|
|
* @param {Function} callback, callback
|
|
*/
|
|
var deposit = function (from, address, value, client, callback) {
|
|
var abi = [{"constant":false,"inputs":[{"name":"name","type":"bytes32"}],"name":"deposit","outputs":[],"type":"function"}];
|
|
return contract(abi).at(address).deposit(client, {
|
|
from: from,
|
|
value: value
|
|
}, callback);
|
|
};
|
|
|
|
module.exports = transfer;
|
|
|
|
|
|
},{"../web3":9,"./contract":11,"./icap":20,"./namereg":23}],30:[function(require,module,exports){
|
|
/*
|
|
This file is part of ethereum.js.
|
|
|
|
ethereum.js is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
ethereum.js is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with ethereum.js. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
/** @file watches.js
|
|
* @authors:
|
|
* Marek Kotewicz <marek@ethdev.com>
|
|
* @date 2015
|
|
*/
|
|
|
|
var Method = require('./method');
|
|
|
|
/// @returns an array of objects describing web3.eth.filter api methods
|
|
var eth = function () {
|
|
var newFilterCall = function (args) {
|
|
var type = args[0];
|
|
|
|
switch(type) {
|
|
case 'latest':
|
|
args.pop();
|
|
this.params = 0;
|
|
return 'eth_newBlockFilter';
|
|
case 'pending':
|
|
args.pop();
|
|
this.params = 0;
|
|
return 'eth_newPendingTransactionFilter';
|
|
default:
|
|
return 'eth_newFilter';
|
|
}
|
|
};
|
|
|
|
var newFilter = new Method({
|
|
name: 'newFilter',
|
|
call: newFilterCall,
|
|
params: 1
|
|
});
|
|
|
|
var uninstallFilter = new Method({
|
|
name: 'uninstallFilter',
|
|
call: 'eth_uninstallFilter',
|
|
params: 1
|
|
});
|
|
|
|
var getLogs = new Method({
|
|
name: 'getLogs',
|
|
call: 'eth_getFilterLogs',
|
|
params: 1
|
|
});
|
|
|
|
var poll = new Method({
|
|
name: 'poll',
|
|
call: 'eth_getFilterChanges',
|
|
params: 1
|
|
});
|
|
|
|
return [
|
|
newFilter,
|
|
uninstallFilter,
|
|
getLogs,
|
|
poll
|
|
];
|
|
};
|
|
|
|
/// @returns an array of objects describing web3.shh.watch api methods
|
|
var shh = function () {
|
|
var newFilter = new Method({
|
|
name: 'newFilter',
|
|
call: 'shh_newFilter',
|
|
params: 1
|
|
});
|
|
|
|
var uninstallFilter = new Method({
|
|
name: 'uninstallFilter',
|
|
call: 'shh_uninstallFilter',
|
|
params: 1
|
|
});
|
|
|
|
var getLogs = new Method({
|
|
name: 'getLogs',
|
|
call: 'shh_getMessages',
|
|
params: 1
|
|
});
|
|
|
|
var poll = new Method({
|
|
name: 'poll',
|
|
call: 'shh_getFilterChanges',
|
|
params: 1
|
|
});
|
|
|
|
return [
|
|
newFilter,
|
|
uninstallFilter,
|
|
getLogs,
|
|
poll
|
|
];
|
|
};
|
|
|
|
module.exports = {
|
|
eth: eth,
|
|
shh: shh
|
|
};
|
|
|
|
|
|
},{"./method":22}],31:[function(require,module,exports){
|
|
|
|
},{}],32:[function(require,module,exports){
|
|
;(function (root, factory) {
|
|
if (typeof exports === "object") {
|
|
// CommonJS
|
|
module.exports = exports = factory();
|
|
}
|
|
else if (typeof define === "function" && define.amd) {
|
|
// AMD
|
|
define([], factory);
|
|
}
|
|
else {
|
|
// Global (browser)
|
|
root.CryptoJS = factory();
|
|
}
|
|
}(this, function () {
|
|
|
|
/**
|
|
* CryptoJS core components.
|
|
*/
|
|
var CryptoJS = CryptoJS || (function (Math, undefined) {
|
|
/**
|
|
* CryptoJS namespace.
|
|
*/
|
|
var C = {};
|
|
|
|
/**
|
|
* Library namespace.
|
|
*/
|
|
var C_lib = C.lib = {};
|
|
|
|
/**
|
|
* Base object for prototypal inheritance.
|
|
*/
|
|
var Base = C_lib.Base = (function () {
|
|
function F() {}
|
|
|
|
return {
|
|
/**
|
|
* Creates a new object that inherits from this object.
|
|
*
|
|
* @param {Object} overrides Properties to copy into the new object.
|
|
*
|
|
* @return {Object} The new object.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var MyType = CryptoJS.lib.Base.extend({
|
|
* field: 'value',
|
|
*
|
|
* method: function () {
|
|
* }
|
|
* });
|
|
*/
|
|
extend: function (overrides) {
|
|
// Spawn
|
|
F.prototype = this;
|
|
var subtype = new F();
|
|
|
|
// Augment
|
|
if (overrides) {
|
|
subtype.mixIn(overrides);
|
|
}
|
|
|
|
// Create default initializer
|
|
if (!subtype.hasOwnProperty('init')) {
|
|
subtype.init = function () {
|
|
subtype.$super.init.apply(this, arguments);
|
|
};
|
|
}
|
|
|
|
// Initializer's prototype is the subtype object
|
|
subtype.init.prototype = subtype;
|
|
|
|
// Reference supertype
|
|
subtype.$super = this;
|
|
|
|
return subtype;
|
|
},
|
|
|
|
/**
|
|
* Extends this object and runs the init method.
|
|
* Arguments to create() will be passed to init().
|
|
*
|
|
* @return {Object} The new object.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var instance = MyType.create();
|
|
*/
|
|
create: function () {
|
|
var instance = this.extend();
|
|
instance.init.apply(instance, arguments);
|
|
|
|
return instance;
|
|
},
|
|
|
|
/**
|
|
* Initializes a newly created object.
|
|
* Override this method to add some logic when your objects are created.
|
|
*
|
|
* @example
|
|
*
|
|
* var MyType = CryptoJS.lib.Base.extend({
|
|
* init: function () {
|
|
* // ...
|
|
* }
|
|
* });
|
|
*/
|
|
init: function () {
|
|
},
|
|
|
|
/**
|
|
* Copies properties into this object.
|
|
*
|
|
* @param {Object} properties The properties to mix in.
|
|
*
|
|
* @example
|
|
*
|
|
* MyType.mixIn({
|
|
* field: 'value'
|
|
* });
|
|
*/
|
|
mixIn: function (properties) {
|
|
for (var propertyName in properties) {
|
|
if (properties.hasOwnProperty(propertyName)) {
|
|
this[propertyName] = properties[propertyName];
|
|
}
|
|
}
|
|
|
|
// IE won't copy toString using the loop above
|
|
if (properties.hasOwnProperty('toString')) {
|
|
this.toString = properties.toString;
|
|
}
|
|
},
|
|
|
|
/**
|
|
* Creates a copy of this object.
|
|
*
|
|
* @return {Object} The clone.
|
|
*
|
|
* @example
|
|
*
|
|
* var clone = instance.clone();
|
|
*/
|
|
clone: function () {
|
|
return this.init.prototype.extend(this);
|
|
}
|
|
};
|
|
}());
|
|
|
|
/**
|
|
* An array of 32-bit words.
|
|
*
|
|
* @property {Array} words The array of 32-bit words.
|
|
* @property {number} sigBytes The number of significant bytes in this word array.
|
|
*/
|
|
var WordArray = C_lib.WordArray = Base.extend({
|
|
/**
|
|
* Initializes a newly created word array.
|
|
*
|
|
* @param {Array} words (Optional) An array of 32-bit words.
|
|
* @param {number} sigBytes (Optional) The number of significant bytes in the words.
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.lib.WordArray.create();
|
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
|
|
* var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
|
|
*/
|
|
init: function (words, sigBytes) {
|
|
words = this.words = words || [];
|
|
|
|
if (sigBytes != undefined) {
|
|
this.sigBytes = sigBytes;
|
|
} else {
|
|
this.sigBytes = words.length * 4;
|
|
}
|
|
},
|
|
|
|
/**
|
|
* Converts this word array to a string.
|
|
*
|
|
* @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex
|
|
*
|
|
* @return {string} The stringified word array.
|
|
*
|
|
* @example
|
|
*
|
|
* var string = wordArray + '';
|
|
* var string = wordArray.toString();
|
|
* var string = wordArray.toString(CryptoJS.enc.Utf8);
|
|
*/
|
|
toString: function (encoder) {
|
|
return (encoder || Hex).stringify(this);
|
|
},
|
|
|
|
/**
|
|
* Concatenates a word array to this word array.
|
|
*
|
|
* @param {WordArray} wordArray The word array to append.
|
|
*
|
|
* @return {WordArray} This word array.
|
|
*
|
|
* @example
|
|
*
|
|
* wordArray1.concat(wordArray2);
|
|
*/
|
|
concat: function (wordArray) {
|
|
// Shortcuts
|
|
var thisWords = this.words;
|
|
var thatWords = wordArray.words;
|
|
var thisSigBytes = this.sigBytes;
|
|
var thatSigBytes = wordArray.sigBytes;
|
|
|
|
// Clamp excess bits
|
|
this.clamp();
|
|
|
|
// Concat
|
|
if (thisSigBytes % 4) {
|
|
// Copy one byte at a time
|
|
for (var i = 0; i < thatSigBytes; i++) {
|
|
var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
|
|
thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);
|
|
}
|
|
} else if (thatWords.length > 0xffff) {
|
|
// Copy one word at a time
|
|
for (var i = 0; i < thatSigBytes; i += 4) {
|
|
thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2];
|
|
}
|
|
} else {
|
|
// Copy all words at once
|
|
thisWords.push.apply(thisWords, thatWords);
|
|
}
|
|
this.sigBytes += thatSigBytes;
|
|
|
|
// Chainable
|
|
return this;
|
|
},
|
|
|
|
/**
|
|
* Removes insignificant bits.
|
|
*
|
|
* @example
|
|
*
|
|
* wordArray.clamp();
|
|
*/
|
|
clamp: function () {
|
|
// Shortcuts
|
|
var words = this.words;
|
|
var sigBytes = this.sigBytes;
|
|
|
|
// Clamp
|
|
words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);
|
|
words.length = Math.ceil(sigBytes / 4);
|
|
},
|
|
|
|
/**
|
|
* Creates a copy of this word array.
|
|
*
|
|
* @return {WordArray} The clone.
|
|
*
|
|
* @example
|
|
*
|
|
* var clone = wordArray.clone();
|
|
*/
|
|
clone: function () {
|
|
var clone = Base.clone.call(this);
|
|
clone.words = this.words.slice(0);
|
|
|
|
return clone;
|
|
},
|
|
|
|
/**
|
|
* Creates a word array filled with random bytes.
|
|
*
|
|
* @param {number} nBytes The number of random bytes to generate.
|
|
*
|
|
* @return {WordArray} The random word array.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.lib.WordArray.random(16);
|
|
*/
|
|
random: function (nBytes) {
|
|
var words = [];
|
|
|
|
var r = (function (m_w) {
|
|
var m_w = m_w;
|
|
var m_z = 0x3ade68b1;
|
|
var mask = 0xffffffff;
|
|
|
|
return function () {
|
|
m_z = (0x9069 * (m_z & 0xFFFF) + (m_z >> 0x10)) & mask;
|
|
m_w = (0x4650 * (m_w & 0xFFFF) + (m_w >> 0x10)) & mask;
|
|
var result = ((m_z << 0x10) + m_w) & mask;
|
|
result /= 0x100000000;
|
|
result += 0.5;
|
|
return result * (Math.random() > .5 ? 1 : -1);
|
|
}
|
|
});
|
|
|
|
for (var i = 0, rcache; i < nBytes; i += 4) {
|
|
var _r = r((rcache || Math.random()) * 0x100000000);
|
|
|
|
rcache = _r() * 0x3ade67b7;
|
|
words.push((_r() * 0x100000000) | 0);
|
|
}
|
|
|
|
return new WordArray.init(words, nBytes);
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Encoder namespace.
|
|
*/
|
|
var C_enc = C.enc = {};
|
|
|
|
/**
|
|
* Hex encoding strategy.
|
|
*/
|
|
var Hex = C_enc.Hex = {
|
|
/**
|
|
* Converts a word array to a hex string.
|
|
*
|
|
* @param {WordArray} wordArray The word array.
|
|
*
|
|
* @return {string} The hex string.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var hexString = CryptoJS.enc.Hex.stringify(wordArray);
|
|
*/
|
|
stringify: function (wordArray) {
|
|
// Shortcuts
|
|
var words = wordArray.words;
|
|
var sigBytes = wordArray.sigBytes;
|
|
|
|
// Convert
|
|
var hexChars = [];
|
|
for (var i = 0; i < sigBytes; i++) {
|
|
var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
|
|
hexChars.push((bite >>> 4).toString(16));
|
|
hexChars.push((bite & 0x0f).toString(16));
|
|
}
|
|
|
|
return hexChars.join('');
|
|
},
|
|
|
|
/**
|
|
* Converts a hex string to a word array.
|
|
*
|
|
* @param {string} hexStr The hex string.
|
|
*
|
|
* @return {WordArray} The word array.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.enc.Hex.parse(hexString);
|
|
*/
|
|
parse: function (hexStr) {
|
|
// Shortcut
|
|
var hexStrLength = hexStr.length;
|
|
|
|
// Convert
|
|
var words = [];
|
|
for (var i = 0; i < hexStrLength; i += 2) {
|
|
words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);
|
|
}
|
|
|
|
return new WordArray.init(words, hexStrLength / 2);
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Latin1 encoding strategy.
|
|
*/
|
|
var Latin1 = C_enc.Latin1 = {
|
|
/**
|
|
* Converts a word array to a Latin1 string.
|
|
*
|
|
* @param {WordArray} wordArray The word array.
|
|
*
|
|
* @return {string} The Latin1 string.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
|
|
*/
|
|
stringify: function (wordArray) {
|
|
// Shortcuts
|
|
var words = wordArray.words;
|
|
var sigBytes = wordArray.sigBytes;
|
|
|
|
// Convert
|
|
var latin1Chars = [];
|
|
for (var i = 0; i < sigBytes; i++) {
|
|
var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
|
|
latin1Chars.push(String.fromCharCode(bite));
|
|
}
|
|
|
|
return latin1Chars.join('');
|
|
},
|
|
|
|
/**
|
|
* Converts a Latin1 string to a word array.
|
|
*
|
|
* @param {string} latin1Str The Latin1 string.
|
|
*
|
|
* @return {WordArray} The word array.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
|
|
*/
|
|
parse: function (latin1Str) {
|
|
// Shortcut
|
|
var latin1StrLength = latin1Str.length;
|
|
|
|
// Convert
|
|
var words = [];
|
|
for (var i = 0; i < latin1StrLength; i++) {
|
|
words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);
|
|
}
|
|
|
|
return new WordArray.init(words, latin1StrLength);
|
|
}
|
|
};
|
|
|
|
/**
|
|
* UTF-8 encoding strategy.
|
|
*/
|
|
var Utf8 = C_enc.Utf8 = {
|
|
/**
|
|
* Converts a word array to a UTF-8 string.
|
|
*
|
|
* @param {WordArray} wordArray The word array.
|
|
*
|
|
* @return {string} The UTF-8 string.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
|
|
*/
|
|
stringify: function (wordArray) {
|
|
try {
|
|
return decodeURIComponent(escape(Latin1.stringify(wordArray)));
|
|
} catch (e) {
|
|
throw new Error('Malformed UTF-8 data');
|
|
}
|
|
},
|
|
|
|
/**
|
|
* Converts a UTF-8 string to a word array.
|
|
*
|
|
* @param {string} utf8Str The UTF-8 string.
|
|
*
|
|
* @return {WordArray} The word array.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
|
|
*/
|
|
parse: function (utf8Str) {
|
|
return Latin1.parse(unescape(encodeURIComponent(utf8Str)));
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Abstract buffered block algorithm template.
|
|
*
|
|
* The property blockSize must be implemented in a concrete subtype.
|
|
*
|
|
* @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0
|
|
*/
|
|
var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({
|
|
/**
|
|
* Resets this block algorithm's data buffer to its initial state.
|
|
*
|
|
* @example
|
|
*
|
|
* bufferedBlockAlgorithm.reset();
|
|
*/
|
|
reset: function () {
|
|
// Initial values
|
|
this._data = new WordArray.init();
|
|
this._nDataBytes = 0;
|
|
},
|
|
|
|
/**
|
|
* Adds new data to this block algorithm's buffer.
|
|
*
|
|
* @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.
|
|
*
|
|
* @example
|
|
*
|
|
* bufferedBlockAlgorithm._append('data');
|
|
* bufferedBlockAlgorithm._append(wordArray);
|
|
*/
|
|
_append: function (data) {
|
|
// Convert string to WordArray, else assume WordArray already
|
|
if (typeof data == 'string') {
|
|
data = Utf8.parse(data);
|
|
}
|
|
|
|
// Append
|
|
this._data.concat(data);
|
|
this._nDataBytes += data.sigBytes;
|
|
},
|
|
|
|
/**
|
|
* Processes available data blocks.
|
|
*
|
|
* This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.
|
|
*
|
|
* @param {boolean} doFlush Whether all blocks and partial blocks should be processed.
|
|
*
|
|
* @return {WordArray} The processed data.
|
|
*
|
|
* @example
|
|
*
|
|
* var processedData = bufferedBlockAlgorithm._process();
|
|
* var processedData = bufferedBlockAlgorithm._process(!!'flush');
|
|
*/
|
|
_process: function (doFlush) {
|
|
// Shortcuts
|
|
var data = this._data;
|
|
var dataWords = data.words;
|
|
var dataSigBytes = data.sigBytes;
|
|
var blockSize = this.blockSize;
|
|
var blockSizeBytes = blockSize * 4;
|
|
|
|
// Count blocks ready
|
|
var nBlocksReady = dataSigBytes / blockSizeBytes;
|
|
if (doFlush) {
|
|
// Round up to include partial blocks
|
|
nBlocksReady = Math.ceil(nBlocksReady);
|
|
} else {
|
|
// Round down to include only full blocks,
|
|
// less the number of blocks that must remain in the buffer
|
|
nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);
|
|
}
|
|
|
|
// Count words ready
|
|
var nWordsReady = nBlocksReady * blockSize;
|
|
|
|
// Count bytes ready
|
|
var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);
|
|
|
|
// Process blocks
|
|
if (nWordsReady) {
|
|
for (var offset = 0; offset < nWordsReady; offset += blockSize) {
|
|
// Perform concrete-algorithm logic
|
|
this._doProcessBlock(dataWords, offset);
|
|
}
|
|
|
|
// Remove processed words
|
|
var processedWords = dataWords.splice(0, nWordsReady);
|
|
data.sigBytes -= nBytesReady;
|
|
}
|
|
|
|
// Return processed words
|
|
return new WordArray.init(processedWords, nBytesReady);
|
|
},
|
|
|
|
/**
|
|
* Creates a copy of this object.
|
|
*
|
|
* @return {Object} The clone.
|
|
*
|
|
* @example
|
|
*
|
|
* var clone = bufferedBlockAlgorithm.clone();
|
|
*/
|
|
clone: function () {
|
|
var clone = Base.clone.call(this);
|
|
clone._data = this._data.clone();
|
|
|
|
return clone;
|
|
},
|
|
|
|
_minBufferSize: 0
|
|
});
|
|
|
|
/**
|
|
* Abstract hasher template.
|
|
*
|
|
* @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)
|
|
*/
|
|
var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({
|
|
/**
|
|
* Configuration options.
|
|
*/
|
|
cfg: Base.extend(),
|
|
|
|
/**
|
|
* Initializes a newly created hasher.
|
|
*
|
|
* @param {Object} cfg (Optional) The configuration options to use for this hash computation.
|
|
*
|
|
* @example
|
|
*
|
|
* var hasher = CryptoJS.algo.SHA256.create();
|
|
*/
|
|
init: function (cfg) {
|
|
// Apply config defaults
|
|
this.cfg = this.cfg.extend(cfg);
|
|
|
|
// Set initial values
|
|
this.reset();
|
|
},
|
|
|
|
/**
|
|
* Resets this hasher to its initial state.
|
|
*
|
|
* @example
|
|
*
|
|
* hasher.reset();
|
|
*/
|
|
reset: function () {
|
|
// Reset data buffer
|
|
BufferedBlockAlgorithm.reset.call(this);
|
|
|
|
// Perform concrete-hasher logic
|
|
this._doReset();
|
|
},
|
|
|
|
/**
|
|
* Updates this hasher with a message.
|
|
*
|
|
* @param {WordArray|string} messageUpdate The message to append.
|
|
*
|
|
* @return {Hasher} This hasher.
|
|
*
|
|
* @example
|
|
*
|
|
* hasher.update('message');
|
|
* hasher.update(wordArray);
|
|
*/
|
|
update: function (messageUpdate) {
|
|
// Append
|
|
this._append(messageUpdate);
|
|
|
|
// Update the hash
|
|
this._process();
|
|
|
|
// Chainable
|
|
return this;
|
|
},
|
|
|
|
/**
|
|
* Finalizes the hash computation.
|
|
* Note that the finalize operation is effectively a destructive, read-once operation.
|
|
*
|
|
* @param {WordArray|string} messageUpdate (Optional) A final message update.
|
|
*
|
|
* @return {WordArray} The hash.
|
|
*
|
|
* @example
|
|
*
|
|
* var hash = hasher.finalize();
|
|
* var hash = hasher.finalize('message');
|
|
* var hash = hasher.finalize(wordArray);
|
|
*/
|
|
finalize: function (messageUpdate) {
|
|
// Final message update
|
|
if (messageUpdate) {
|
|
this._append(messageUpdate);
|
|
}
|
|
|
|
// Perform concrete-hasher logic
|
|
var hash = this._doFinalize();
|
|
|
|
return hash;
|
|
},
|
|
|
|
blockSize: 512/32,
|
|
|
|
/**
|
|
* Creates a shortcut function to a hasher's object interface.
|
|
*
|
|
* @param {Hasher} hasher The hasher to create a helper for.
|
|
*
|
|
* @return {Function} The shortcut function.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
|
|
*/
|
|
_createHelper: function (hasher) {
|
|
return function (message, cfg) {
|
|
return new hasher.init(cfg).finalize(message);
|
|
};
|
|
},
|
|
|
|
/**
|
|
* Creates a shortcut function to the HMAC's object interface.
|
|
*
|
|
* @param {Hasher} hasher The hasher to use in this HMAC helper.
|
|
*
|
|
* @return {Function} The shortcut function.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
|
|
*/
|
|
_createHmacHelper: function (hasher) {
|
|
return function (message, key) {
|
|
return new C_algo.HMAC.init(hasher, key).finalize(message);
|
|
};
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Algorithm namespace.
|
|
*/
|
|
var C_algo = C.algo = {};
|
|
|
|
return C;
|
|
}(Math));
|
|
|
|
|
|
return CryptoJS;
|
|
|
|
}));
|
|
},{}],33:[function(require,module,exports){
|
|
;(function (root, factory, undef) {
|
|
if (typeof exports === "object") {
|
|
// CommonJS
|
|
module.exports = exports = factory(require("./core"), require("./x64-core"));
|
|
}
|
|
else if (typeof define === "function" && define.amd) {
|
|
// AMD
|
|
define(["./core", "./x64-core"], factory);
|
|
}
|
|
else {
|
|
// Global (browser)
|
|
factory(root.CryptoJS);
|
|
}
|
|
}(this, function (CryptoJS) {
|
|
|
|
(function (Math) {
|
|
// Shortcuts
|
|
var C = CryptoJS;
|
|
var C_lib = C.lib;
|
|
var WordArray = C_lib.WordArray;
|
|
var Hasher = C_lib.Hasher;
|
|
var C_x64 = C.x64;
|
|
var X64Word = C_x64.Word;
|
|
var C_algo = C.algo;
|
|
|
|
// Constants tables
|
|
var RHO_OFFSETS = [];
|
|
var PI_INDEXES = [];
|
|
var ROUND_CONSTANTS = [];
|
|
|
|
// Compute Constants
|
|
(function () {
|
|
// Compute rho offset constants
|
|
var x = 1, y = 0;
|
|
for (var t = 0; t < 24; t++) {
|
|
RHO_OFFSETS[x + 5 * y] = ((t + 1) * (t + 2) / 2) % 64;
|
|
|
|
var newX = y % 5;
|
|
var newY = (2 * x + 3 * y) % 5;
|
|
x = newX;
|
|
y = newY;
|
|
}
|
|
|
|
// Compute pi index constants
|
|
for (var x = 0; x < 5; x++) {
|
|
for (var y = 0; y < 5; y++) {
|
|
PI_INDEXES[x + 5 * y] = y + ((2 * x + 3 * y) % 5) * 5;
|
|
}
|
|
}
|
|
|
|
// Compute round constants
|
|
var LFSR = 0x01;
|
|
for (var i = 0; i < 24; i++) {
|
|
var roundConstantMsw = 0;
|
|
var roundConstantLsw = 0;
|
|
|
|
for (var j = 0; j < 7; j++) {
|
|
if (LFSR & 0x01) {
|
|
var bitPosition = (1 << j) - 1;
|
|
if (bitPosition < 32) {
|
|
roundConstantLsw ^= 1 << bitPosition;
|
|
} else /* if (bitPosition >= 32) */ {
|
|
roundConstantMsw ^= 1 << (bitPosition - 32);
|
|
}
|
|
}
|
|
|
|
// Compute next LFSR
|
|
if (LFSR & 0x80) {
|
|
// Primitive polynomial over GF(2): x^8 + x^6 + x^5 + x^4 + 1
|
|
LFSR = (LFSR << 1) ^ 0x71;
|
|
} else {
|
|
LFSR <<= 1;
|
|
}
|
|
}
|
|
|
|
ROUND_CONSTANTS[i] = X64Word.create(roundConstantMsw, roundConstantLsw);
|
|
}
|
|
}());
|
|
|
|
// Reusable objects for temporary values
|
|
var T = [];
|
|
(function () {
|
|
for (var i = 0; i < 25; i++) {
|
|
T[i] = X64Word.create();
|
|
}
|
|
}());
|
|
|
|
/**
|
|
* SHA-3 hash algorithm.
|
|
*/
|
|
var SHA3 = C_algo.SHA3 = Hasher.extend({
|
|
/**
|
|
* Configuration options.
|
|
*
|
|
* @property {number} outputLength
|
|
* The desired number of bits in the output hash.
|
|
* Only values permitted are: 224, 256, 384, 512.
|
|
* Default: 512
|
|
*/
|
|
cfg: Hasher.cfg.extend({
|
|
outputLength: 512
|
|
}),
|
|
|
|
_doReset: function () {
|
|
var state = this._state = []
|
|
for (var i = 0; i < 25; i++) {
|
|
state[i] = new X64Word.init();
|
|
}
|
|
|
|
this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
|
|
},
|
|
|
|
_doProcessBlock: function (M, offset) {
|
|
// Shortcuts
|
|
var state = this._state;
|
|
var nBlockSizeLanes = this.blockSize / 2;
|
|
|
|
// Absorb
|
|
for (var i = 0; i < nBlockSizeLanes; i++) {
|
|
// Shortcuts
|
|
var M2i = M[offset + 2 * i];
|
|
var M2i1 = M[offset + 2 * i + 1];
|
|
|
|
// Swap endian
|
|
M2i = (
|
|
(((M2i << 8) | (M2i >>> 24)) & 0x00ff00ff) |
|
|
(((M2i << 24) | (M2i >>> 8)) & 0xff00ff00)
|
|
);
|
|
M2i1 = (
|
|
(((M2i1 << 8) | (M2i1 >>> 24)) & 0x00ff00ff) |
|
|
(((M2i1 << 24) | (M2i1 >>> 8)) & 0xff00ff00)
|
|
);
|
|
|
|
// Absorb message into state
|
|
var lane = state[i];
|
|
lane.high ^= M2i1;
|
|
lane.low ^= M2i;
|
|
}
|
|
|
|
// Rounds
|
|
for (var round = 0; round < 24; round++) {
|
|
// Theta
|
|
for (var x = 0; x < 5; x++) {
|
|
// Mix column lanes
|
|
var tMsw = 0, tLsw = 0;
|
|
for (var y = 0; y < 5; y++) {
|
|
var lane = state[x + 5 * y];
|
|
tMsw ^= lane.high;
|
|
tLsw ^= lane.low;
|
|
}
|
|
|
|
// Temporary values
|
|
var Tx = T[x];
|
|
Tx.high = tMsw;
|
|
Tx.low = tLsw;
|
|
}
|
|
for (var x = 0; x < 5; x++) {
|
|
// Shortcuts
|
|
var Tx4 = T[(x + 4) % 5];
|
|
var Tx1 = T[(x + 1) % 5];
|
|
var Tx1Msw = Tx1.high;
|
|
var Tx1Lsw = Tx1.low;
|
|
|
|
// Mix surrounding columns
|
|
var tMsw = Tx4.high ^ ((Tx1Msw << 1) | (Tx1Lsw >>> 31));
|
|
var tLsw = Tx4.low ^ ((Tx1Lsw << 1) | (Tx1Msw >>> 31));
|
|
for (var y = 0; y < 5; y++) {
|
|
var lane = state[x + 5 * y];
|
|
lane.high ^= tMsw;
|
|
lane.low ^= tLsw;
|
|
}
|
|
}
|
|
|
|
// Rho Pi
|
|
for (var laneIndex = 1; laneIndex < 25; laneIndex++) {
|
|
// Shortcuts
|
|
var lane = state[laneIndex];
|
|
var laneMsw = lane.high;
|
|
var laneLsw = lane.low;
|
|
var rhoOffset = RHO_OFFSETS[laneIndex];
|
|
|
|
// Rotate lanes
|
|
if (rhoOffset < 32) {
|
|
var tMsw = (laneMsw << rhoOffset) | (laneLsw >>> (32 - rhoOffset));
|
|
var tLsw = (laneLsw << rhoOffset) | (laneMsw >>> (32 - rhoOffset));
|
|
} else /* if (rhoOffset >= 32) */ {
|
|
var tMsw = (laneLsw << (rhoOffset - 32)) | (laneMsw >>> (64 - rhoOffset));
|
|
var tLsw = (laneMsw << (rhoOffset - 32)) | (laneLsw >>> (64 - rhoOffset));
|
|
}
|
|
|
|
// Transpose lanes
|
|
var TPiLane = T[PI_INDEXES[laneIndex]];
|
|
TPiLane.high = tMsw;
|
|
TPiLane.low = tLsw;
|
|
}
|
|
|
|
// Rho pi at x = y = 0
|
|
var T0 = T[0];
|
|
var state0 = state[0];
|
|
T0.high = state0.high;
|
|
T0.low = state0.low;
|
|
|
|
// Chi
|
|
for (var x = 0; x < 5; x++) {
|
|
for (var y = 0; y < 5; y++) {
|
|
// Shortcuts
|
|
var laneIndex = x + 5 * y;
|
|
var lane = state[laneIndex];
|
|
var TLane = T[laneIndex];
|
|
var Tx1Lane = T[((x + 1) % 5) + 5 * y];
|
|
var Tx2Lane = T[((x + 2) % 5) + 5 * y];
|
|
|
|
// Mix rows
|
|
lane.high = TLane.high ^ (~Tx1Lane.high & Tx2Lane.high);
|
|
lane.low = TLane.low ^ (~Tx1Lane.low & Tx2Lane.low);
|
|
}
|
|
}
|
|
|
|
// Iota
|
|
var lane = state[0];
|
|
var roundConstant = ROUND_CONSTANTS[round];
|
|
lane.high ^= roundConstant.high;
|
|
lane.low ^= roundConstant.low;;
|
|
}
|
|
},
|
|
|
|
_doFinalize: function () {
|
|
// Shortcuts
|
|
var data = this._data;
|
|
var dataWords = data.words;
|
|
var nBitsTotal = this._nDataBytes * 8;
|
|
var nBitsLeft = data.sigBytes * 8;
|
|
var blockSizeBits = this.blockSize * 32;
|
|
|
|
// Add padding
|
|
dataWords[nBitsLeft >>> 5] |= 0x1 << (24 - nBitsLeft % 32);
|
|
dataWords[((Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits) >>> 5) - 1] |= 0x80;
|
|
data.sigBytes = dataWords.length * 4;
|
|
|
|
// Hash final blocks
|
|
this._process();
|
|
|
|
// Shortcuts
|
|
var state = this._state;
|
|
var outputLengthBytes = this.cfg.outputLength / 8;
|
|
var outputLengthLanes = outputLengthBytes / 8;
|
|
|
|
// Squeeze
|
|
var hashWords = [];
|
|
for (var i = 0; i < outputLengthLanes; i++) {
|
|
// Shortcuts
|
|
var lane = state[i];
|
|
var laneMsw = lane.high;
|
|
var laneLsw = lane.low;
|
|
|
|
// Swap endian
|
|
laneMsw = (
|
|
(((laneMsw << 8) | (laneMsw >>> 24)) & 0x00ff00ff) |
|
|
(((laneMsw << 24) | (laneMsw >>> 8)) & 0xff00ff00)
|
|
);
|
|
laneLsw = (
|
|
(((laneLsw << 8) | (laneLsw >>> 24)) & 0x00ff00ff) |
|
|
(((laneLsw << 24) | (laneLsw >>> 8)) & 0xff00ff00)
|
|
);
|
|
|
|
// Squeeze state to retrieve hash
|
|
hashWords.push(laneLsw);
|
|
hashWords.push(laneMsw);
|
|
}
|
|
|
|
// Return final computed hash
|
|
return new WordArray.init(hashWords, outputLengthBytes);
|
|
},
|
|
|
|
clone: function () {
|
|
var clone = Hasher.clone.call(this);
|
|
|
|
var state = clone._state = this._state.slice(0);
|
|
for (var i = 0; i < 25; i++) {
|
|
state[i] = state[i].clone();
|
|
}
|
|
|
|
return clone;
|
|
}
|
|
});
|
|
|
|
/**
|
|
* Shortcut function to the hasher's object interface.
|
|
*
|
|
* @param {WordArray|string} message The message to hash.
|
|
*
|
|
* @return {WordArray} The hash.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var hash = CryptoJS.SHA3('message');
|
|
* var hash = CryptoJS.SHA3(wordArray);
|
|
*/
|
|
C.SHA3 = Hasher._createHelper(SHA3);
|
|
|
|
/**
|
|
* Shortcut function to the HMAC's object interface.
|
|
*
|
|
* @param {WordArray|string} message The message to hash.
|
|
* @param {WordArray|string} key The secret key.
|
|
*
|
|
* @return {WordArray} The HMAC.
|
|
*
|
|
* @static
|
|
*
|
|
* @example
|
|
*
|
|
* var hmac = CryptoJS.HmacSHA3(message, key);
|
|
*/
|
|
C.HmacSHA3 = Hasher._createHmacHelper(SHA3);
|
|
}(Math));
|
|
|
|
|
|
return CryptoJS.SHA3;
|
|
|
|
}));
|
|
},{"./core":32,"./x64-core":34}],34:[function(require,module,exports){
|
|
;(function (root, factory) {
|
|
if (typeof exports === "object") {
|
|
// CommonJS
|
|
module.exports = exports = factory(require("./core"));
|
|
}
|
|
else if (typeof define === "function" && define.amd) {
|
|
// AMD
|
|
define(["./core"], factory);
|
|
}
|
|
else {
|
|
// Global (browser)
|
|
factory(root.CryptoJS);
|
|
}
|
|
}(this, function (CryptoJS) {
|
|
|
|
(function (undefined) {
|
|
// Shortcuts
|
|
var C = CryptoJS;
|
|
var C_lib = C.lib;
|
|
var Base = C_lib.Base;
|
|
var X32WordArray = C_lib.WordArray;
|
|
|
|
/**
|
|
* x64 namespace.
|
|
*/
|
|
var C_x64 = C.x64 = {};
|
|
|
|
/**
|
|
* A 64-bit word.
|
|
*/
|
|
var X64Word = C_x64.Word = Base.extend({
|
|
/**
|
|
* Initializes a newly created 64-bit word.
|
|
*
|
|
* @param {number} high The high 32 bits.
|
|
* @param {number} low The low 32 bits.
|
|
*
|
|
* @example
|
|
*
|
|
* var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);
|
|
*/
|
|
init: function (high, low) {
|
|
this.high = high;
|
|
this.low = low;
|
|
}
|
|
|
|
/**
|
|
* Bitwise NOTs this word.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after negating.
|
|
*
|
|
* @example
|
|
*
|
|
* var negated = x64Word.not();
|
|
*/
|
|
// not: function () {
|
|
// var high = ~this.high;
|
|
// var low = ~this.low;
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Bitwise ANDs this word with the passed word.
|
|
*
|
|
* @param {X64Word} word The x64-Word to AND with this word.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after ANDing.
|
|
*
|
|
* @example
|
|
*
|
|
* var anded = x64Word.and(anotherX64Word);
|
|
*/
|
|
// and: function (word) {
|
|
// var high = this.high & word.high;
|
|
// var low = this.low & word.low;
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Bitwise ORs this word with the passed word.
|
|
*
|
|
* @param {X64Word} word The x64-Word to OR with this word.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after ORing.
|
|
*
|
|
* @example
|
|
*
|
|
* var ored = x64Word.or(anotherX64Word);
|
|
*/
|
|
// or: function (word) {
|
|
// var high = this.high | word.high;
|
|
// var low = this.low | word.low;
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Bitwise XORs this word with the passed word.
|
|
*
|
|
* @param {X64Word} word The x64-Word to XOR with this word.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after XORing.
|
|
*
|
|
* @example
|
|
*
|
|
* var xored = x64Word.xor(anotherX64Word);
|
|
*/
|
|
// xor: function (word) {
|
|
// var high = this.high ^ word.high;
|
|
// var low = this.low ^ word.low;
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Shifts this word n bits to the left.
|
|
*
|
|
* @param {number} n The number of bits to shift.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after shifting.
|
|
*
|
|
* @example
|
|
*
|
|
* var shifted = x64Word.shiftL(25);
|
|
*/
|
|
// shiftL: function (n) {
|
|
// if (n < 32) {
|
|
// var high = (this.high << n) | (this.low >>> (32 - n));
|
|
// var low = this.low << n;
|
|
// } else {
|
|
// var high = this.low << (n - 32);
|
|
// var low = 0;
|
|
// }
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Shifts this word n bits to the right.
|
|
*
|
|
* @param {number} n The number of bits to shift.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after shifting.
|
|
*
|
|
* @example
|
|
*
|
|
* var shifted = x64Word.shiftR(7);
|
|
*/
|
|
// shiftR: function (n) {
|
|
// if (n < 32) {
|
|
// var low = (this.low >>> n) | (this.high << (32 - n));
|
|
// var high = this.high >>> n;
|
|
// } else {
|
|
// var low = this.high >>> (n - 32);
|
|
// var high = 0;
|
|
// }
|
|
|
|
// return X64Word.create(high, low);
|
|
// },
|
|
|
|
/**
|
|
* Rotates this word n bits to the left.
|
|
*
|
|
* @param {number} n The number of bits to rotate.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after rotating.
|
|
*
|
|
* @example
|
|
*
|
|
* var rotated = x64Word.rotL(25);
|
|
*/
|
|
// rotL: function (n) {
|
|
// return this.shiftL(n).or(this.shiftR(64 - n));
|
|
// },
|
|
|
|
/**
|
|
* Rotates this word n bits to the right.
|
|
*
|
|
* @param {number} n The number of bits to rotate.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after rotating.
|
|
*
|
|
* @example
|
|
*
|
|
* var rotated = x64Word.rotR(7);
|
|
*/
|
|
// rotR: function (n) {
|
|
// return this.shiftR(n).or(this.shiftL(64 - n));
|
|
// },
|
|
|
|
/**
|
|
* Adds this word with the passed word.
|
|
*
|
|
* @param {X64Word} word The x64-Word to add with this word.
|
|
*
|
|
* @return {X64Word} A new x64-Word object after adding.
|
|
*
|
|
* @example
|
|
*
|
|
* var added = x64Word.add(anotherX64Word);
|
|
*/
|
|
// add: function (word) {
|
|
// var low = (this.low + word.low) | 0;
|
|
// var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;
|
|
// var high = (this.high + word.high + carry) | 0;
|
|
|
|
// return X64Word.create(high, low);
|
|
// }
|
|
});
|
|
|
|
/**
|
|
* An array of 64-bit words.
|
|
*
|
|
* @property {Array} words The array of CryptoJS.x64.Word objects.
|
|
* @property {number} sigBytes The number of significant bytes in this word array.
|
|
*/
|
|
var X64WordArray = C_x64.WordArray = Base.extend({
|
|
/**
|
|
* Initializes a newly created word array.
|
|
*
|
|
* @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.
|
|
* @param {number} sigBytes (Optional) The number of significant bytes in the words.
|
|
*
|
|
* @example
|
|
*
|
|
* var wordArray = CryptoJS.x64.WordArray.create();
|
|
*
|
|
* var wordArray = CryptoJS.x64.WordArray.create([
|
|
* CryptoJS.x64.Word.create(0x00010203, 0x04050607),
|
|
* CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
|
|
* ]);
|
|
*
|
|
* var wordArray = CryptoJS.x64.WordArray.create([
|
|
* CryptoJS.x64.Word.create(0x00010203, 0x04050607),
|
|
* CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
|
|
* ], 10);
|
|
*/
|
|
init: function (words, sigBytes) {
|
|
words = this.words = words || [];
|
|
|
|
if (sigBytes != undefined) {
|
|
this.sigBytes = sigBytes;
|
|
} else {
|
|
this.sigBytes = words.length * 8;
|
|
}
|
|
},
|
|
|
|
/**
|
|
* Converts this 64-bit word array to a 32-bit word array.
|
|
*
|
|
* @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.
|
|
*
|
|
* @example
|
|
*
|
|
* var x32WordArray = x64WordArray.toX32();
|
|
*/
|
|
toX32: function () {
|
|
// Shortcuts
|
|
var x64Words = this.words;
|
|
var x64WordsLength = x64Words.length;
|
|
|
|
// Convert
|
|
var x32Words = [];
|
|
for (var i = 0; i < x64WordsLength; i++) {
|
|
var x64Word = x64Words[i];
|
|
x32Words.push(x64Word.high);
|
|
x32Words.push(x64Word.low);
|
|
}
|
|
|
|
return X32WordArray.create(x32Words, this.sigBytes);
|
|
},
|
|
|
|
/**
|
|
* Creates a copy of this word array.
|
|
*
|
|
* @return {X64WordArray} The clone.
|
|
*
|
|
* @example
|
|
*
|
|
* var clone = x64WordArray.clone();
|
|
*/
|
|
clone: function () {
|
|
var clone = Base.clone.call(this);
|
|
|
|
// Clone "words" array
|
|
var words = clone.words = this.words.slice(0);
|
|
|
|
// Clone each X64Word object
|
|
var wordsLength = words.length;
|
|
for (var i = 0; i < wordsLength; i++) {
|
|
words[i] = words[i].clone();
|
|
}
|
|
|
|
return clone;
|
|
}
|
|
});
|
|
}());
|
|
|
|
|
|
return CryptoJS;
|
|
|
|
}));
|
|
},{"./core":32}],"bignumber.js":[function(require,module,exports){
|
|
/*! bignumber.js v2.0.7 https://github.com/MikeMcl/bignumber.js/LICENCE */
|
|
|
|
;(function (global) {
|
|
'use strict';
|
|
|
|
/*
|
|
bignumber.js v2.0.7
|
|
A JavaScript library for arbitrary-precision arithmetic.
|
|
https://github.com/MikeMcl/bignumber.js
|
|
Copyright (c) 2015 Michael Mclaughlin <M8ch88l@gmail.com>
|
|
MIT Expat Licence
|
|
*/
|
|
|
|
|
|
var BigNumber, crypto, parseNumeric,
|
|
isNumeric = /^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
|
|
mathceil = Math.ceil,
|
|
mathfloor = Math.floor,
|
|
notBool = ' not a boolean or binary digit',
|
|
roundingMode = 'rounding mode',
|
|
tooManyDigits = 'number type has more than 15 significant digits',
|
|
ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_',
|
|
BASE = 1e14,
|
|
LOG_BASE = 14,
|
|
MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1
|
|
// MAX_INT32 = 0x7fffffff, // 2^31 - 1
|
|
POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],
|
|
SQRT_BASE = 1e7,
|
|
|
|
/*
|
|
* The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and
|
|
* the arguments to toExponential, toFixed, toFormat, and toPrecision, beyond which an
|
|
* exception is thrown (if ERRORS is true).
|
|
*/
|
|
MAX = 1E9; // 0 to MAX_INT32
|
|
|
|
|
|
/*
|
|
* Create and return a BigNumber constructor.
|
|
*/
|
|
function another(configObj) {
|
|
var div,
|
|
|
|
// id tracks the caller function, so its name can be included in error messages.
|
|
id = 0,
|
|
P = BigNumber.prototype,
|
|
ONE = new BigNumber(1),
|
|
|
|
|
|
/********************************* EDITABLE DEFAULTS **********************************/
|
|
|
|
|
|
/*
|
|
* The default values below must be integers within the inclusive ranges stated.
|
|
* The values can also be changed at run-time using BigNumber.config.
|
|
*/
|
|
|
|
// The maximum number of decimal places for operations involving division.
|
|
DECIMAL_PLACES = 20, // 0 to MAX
|
|
|
|
/*
|
|
* The rounding mode used when rounding to the above decimal places, and when using
|
|
* toExponential, toFixed, toFormat and toPrecision, and round (default value).
|
|
* UP 0 Away from zero.
|
|
* DOWN 1 Towards zero.
|
|
* CEIL 2 Towards +Infinity.
|
|
* FLOOR 3 Towards -Infinity.
|
|
* HALF_UP 4 Towards nearest neighbour. If equidistant, up.
|
|
* HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.
|
|
* HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.
|
|
* HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.
|
|
* HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
|
|
*/
|
|
ROUNDING_MODE = 4, // 0 to 8
|
|
|
|
// EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]
|
|
|
|
// The exponent value at and beneath which toString returns exponential notation.
|
|
// Number type: -7
|
|
TO_EXP_NEG = -7, // 0 to -MAX
|
|
|
|
// The exponent value at and above which toString returns exponential notation.
|
|
// Number type: 21
|
|
TO_EXP_POS = 21, // 0 to MAX
|
|
|
|
// RANGE : [MIN_EXP, MAX_EXP]
|
|
|
|
// The minimum exponent value, beneath which underflow to zero occurs.
|
|
// Number type: -324 (5e-324)
|
|
MIN_EXP = -1e7, // -1 to -MAX
|
|
|
|
// The maximum exponent value, above which overflow to Infinity occurs.
|
|
// Number type: 308 (1.7976931348623157e+308)
|
|
// For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.
|
|
MAX_EXP = 1e7, // 1 to MAX
|
|
|
|
// Whether BigNumber Errors are ever thrown.
|
|
ERRORS = true, // true or false
|
|
|
|
// Change to intValidatorNoErrors if ERRORS is false.
|
|
isValidInt = intValidatorWithErrors, // intValidatorWithErrors/intValidatorNoErrors
|
|
|
|
// Whether to use cryptographically-secure random number generation, if available.
|
|
CRYPTO = false, // true or false
|
|
|
|
/*
|
|
* The modulo mode used when calculating the modulus: a mod n.
|
|
* The quotient (q = a / n) is calculated according to the corresponding rounding mode.
|
|
* The remainder (r) is calculated as: r = a - n * q.
|
|
*
|
|
* UP 0 The remainder is positive if the dividend is negative, else is negative.
|
|
* DOWN 1 The remainder has the same sign as the dividend.
|
|
* This modulo mode is commonly known as 'truncated division' and is
|
|
* equivalent to (a % n) in JavaScript.
|
|
* FLOOR 3 The remainder has the same sign as the divisor (Python %).
|
|
* HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.
|
|
* EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).
|
|
* The remainder is always positive.
|
|
*
|
|
* The truncated division, floored division, Euclidian division and IEEE 754 remainder
|
|
* modes are commonly used for the modulus operation.
|
|
* Although the other rounding modes can also be used, they may not give useful results.
|
|
*/
|
|
MODULO_MODE = 1, // 0 to 9
|
|
|
|
// The maximum number of significant digits of the result of the toPower operation.
|
|
// If POW_PRECISION is 0, there will be unlimited significant digits.
|
|
POW_PRECISION = 100, // 0 to MAX
|
|
|
|
// The format specification used by the BigNumber.prototype.toFormat method.
|
|
FORMAT = {
|
|
decimalSeparator: '.',
|
|
groupSeparator: ',',
|
|
groupSize: 3,
|
|
secondaryGroupSize: 0,
|
|
fractionGroupSeparator: '\xA0', // non-breaking space
|
|
fractionGroupSize: 0
|
|
};
|
|
|
|
|
|
/******************************************************************************************/
|
|
|
|
|
|
// CONSTRUCTOR
|
|
|
|
|
|
/*
|
|
* The BigNumber constructor and exported function.
|
|
* Create and return a new instance of a BigNumber object.
|
|
*
|
|
* n {number|string|BigNumber} A numeric value.
|
|
* [b] {number} The base of n. Integer, 2 to 64 inclusive.
|
|
*/
|
|
function BigNumber( n, b ) {
|
|
var c, e, i, num, len, str,
|
|
x = this;
|
|
|
|
// Enable constructor usage without new.
|
|
if ( !( x instanceof BigNumber ) ) {
|
|
|
|
// 'BigNumber() constructor call without new: {n}'
|
|
if (ERRORS) raise( 26, 'constructor call without new', n );
|
|
return new BigNumber( n, b );
|
|
}
|
|
|
|
// 'new BigNumber() base not an integer: {b}'
|
|
// 'new BigNumber() base out of range: {b}'
|
|
if ( b == null || !isValidInt( b, 2, 64, id, 'base' ) ) {
|
|
|
|
// Duplicate.
|
|
if ( n instanceof BigNumber ) {
|
|
x.s = n.s;
|
|
x.e = n.e;
|
|
x.c = ( n = n.c ) ? n.slice() : n;
|
|
id = 0;
|
|
return;
|
|
}
|
|
|
|
if ( ( num = typeof n == 'number' ) && n * 0 == 0 ) {
|
|
x.s = 1 / n < 0 ? ( n = -n, -1 ) : 1;
|
|
|
|
// Fast path for integers.
|
|
if ( n === ~~n ) {
|
|
for ( e = 0, i = n; i >= 10; i /= 10, e++ );
|
|
x.e = e;
|
|
x.c = [n];
|
|
id = 0;
|
|
return;
|
|
}
|
|
|
|
str = n + '';
|
|
} else {
|
|
if ( !isNumeric.test( str = n + '' ) ) return parseNumeric( x, str, num );
|
|
x.s = str.charCodeAt(0) === 45 ? ( str = str.slice(1), -1 ) : 1;
|
|
}
|
|
} else {
|
|
b = b | 0;
|
|
str = n + '';
|
|
|
|
// Ensure return value is rounded to DECIMAL_PLACES as with other bases.
|
|
// Allow exponential notation to be used with base 10 argument.
|
|
if ( b == 10 ) {
|
|
x = new BigNumber( n instanceof BigNumber ? n : str );
|
|
return round( x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE );
|
|
}
|
|
|
|
// Avoid potential interpretation of Infinity and NaN as base 44+ values.
|
|
// Any number in exponential form will fail due to the [Ee][+-].
|
|
if ( ( num = typeof n == 'number' ) && n * 0 != 0 ||
|
|
!( new RegExp( '^-?' + ( c = '[' + ALPHABET.slice( 0, b ) + ']+' ) +
|
|
'(?:\\.' + c + ')?$',b < 37 ? 'i' : '' ) ).test(str) ) {
|
|
return parseNumeric( x, str, num, b );
|
|
}
|
|
|
|
if (num) {
|
|
x.s = 1 / n < 0 ? ( str = str.slice(1), -1 ) : 1;
|
|
|
|
if ( ERRORS && str.replace( /^0\.0*|\./, '' ).length > 15 ) {
|
|
|
|
// 'new BigNumber() number type has more than 15 significant digits: {n}'
|
|
raise( id, tooManyDigits, n );
|
|
}
|
|
|
|
// Prevent later check for length on converted number.
|
|
num = false;
|
|
} else {
|
|
x.s = str.charCodeAt(0) === 45 ? ( str = str.slice(1), -1 ) : 1;
|
|
}
|
|
|
|
str = convertBase( str, 10, b, x.s );
|
|
}
|
|
|
|
// Decimal point?
|
|
if ( ( e = str.indexOf('.') ) > -1 ) str = str.replace( '.', '' );
|
|
|
|
// Exponential form?
|
|
if ( ( i = str.search( /e/i ) ) > 0 ) {
|
|
|
|
// Determine exponent.
|
|
if ( e < 0 ) e = i;
|
|
e += +str.slice( i + 1 );
|
|
str = str.substring( 0, i );
|
|
} else if ( e < 0 ) {
|
|
|
|
// Integer.
|
|
e = str.length;
|
|
}
|
|
|
|
// Determine leading zeros.
|
|
for ( i = 0; str.charCodeAt(i) === 48; i++ );
|
|
|
|
// Determine trailing zeros.
|
|
for ( len = str.length; str.charCodeAt(--len) === 48; );
|
|
str = str.slice( i, len + 1 );
|
|
|
|
if (str) {
|
|
len = str.length;
|
|
|
|
// Disallow numbers with over 15 significant digits if number type.
|
|
// 'new BigNumber() number type has more than 15 significant digits: {n}'
|
|
if ( num && ERRORS && len > 15 ) raise( id, tooManyDigits, x.s * n );
|
|
|
|
e = e - i - 1;
|
|
|
|
// Overflow?
|
|
if ( e > MAX_EXP ) {
|
|
|
|
// Infinity.
|
|
x.c = x.e = null;
|
|
|
|
// Underflow?
|
|
} else if ( e < MIN_EXP ) {
|
|
|
|
// Zero.
|
|
x.c = [ x.e = 0 ];
|
|
} else {
|
|
x.e = e;
|
|
x.c = [];
|
|
|
|
// Transform base
|
|
|
|
// e is the base 10 exponent.
|
|
// i is where to slice str to get the first element of the coefficient array.
|
|
i = ( e + 1 ) % LOG_BASE;
|
|
if ( e < 0 ) i += LOG_BASE;
|
|
|
|
if ( i < len ) {
|
|
if (i) x.c.push( +str.slice( 0, i ) );
|
|
|
|
for ( len -= LOG_BASE; i < len; ) {
|
|
x.c.push( +str.slice( i, i += LOG_BASE ) );
|
|
}
|
|
|
|
str = str.slice(i);
|
|
i = LOG_BASE - str.length;
|
|
} else {
|
|
i -= len;
|
|
}
|
|
|
|
for ( ; i--; str += '0' );
|
|
x.c.push( +str );
|
|
}
|
|
} else {
|
|
|
|
// Zero.
|
|
x.c = [ x.e = 0 ];
|
|
}
|
|
|
|
id = 0;
|
|
}
|
|
|
|
|
|
// CONSTRUCTOR PROPERTIES
|
|
|
|
|
|
BigNumber.another = another;
|
|
|
|
BigNumber.ROUND_UP = 0;
|
|
BigNumber.ROUND_DOWN = 1;
|
|
BigNumber.ROUND_CEIL = 2;
|
|
BigNumber.ROUND_FLOOR = 3;
|
|
BigNumber.ROUND_HALF_UP = 4;
|
|
BigNumber.ROUND_HALF_DOWN = 5;
|
|
BigNumber.ROUND_HALF_EVEN = 6;
|
|
BigNumber.ROUND_HALF_CEIL = 7;
|
|
BigNumber.ROUND_HALF_FLOOR = 8;
|
|
BigNumber.EUCLID = 9;
|
|
|
|
|
|
/*
|
|
* Configure infrequently-changing library-wide settings.
|
|
*
|
|
* Accept an object or an argument list, with one or many of the following properties or
|
|
* parameters respectively:
|
|
*
|
|
* DECIMAL_PLACES {number} Integer, 0 to MAX inclusive
|
|
* ROUNDING_MODE {number} Integer, 0 to 8 inclusive
|
|
* EXPONENTIAL_AT {number|number[]} Integer, -MAX to MAX inclusive or
|
|
* [integer -MAX to 0 incl., 0 to MAX incl.]
|
|
* RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or
|
|
* [integer -MAX to -1 incl., integer 1 to MAX incl.]
|
|
* ERRORS {boolean|number} true, false, 1 or 0
|
|
* CRYPTO {boolean|number} true, false, 1 or 0
|
|
* MODULO_MODE {number} 0 to 9 inclusive
|
|
* POW_PRECISION {number} 0 to MAX inclusive
|
|
* FORMAT {object} See BigNumber.prototype.toFormat
|
|
* decimalSeparator {string}
|
|
* groupSeparator {string}
|
|
* groupSize {number}
|
|
* secondaryGroupSize {number}
|
|
* fractionGroupSeparator {string}
|
|
* fractionGroupSize {number}
|
|
*
|
|
* (The values assigned to the above FORMAT object properties are not checked for validity.)
|
|
*
|
|
* E.g.
|
|
* BigNumber.config(20, 4) is equivalent to
|
|
* BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })
|
|
*
|
|
* Ignore properties/parameters set to null or undefined.
|
|
* Return an object with the properties current values.
|
|
*/
|
|
BigNumber.config = function () {
|
|
var v, p,
|
|
i = 0,
|
|
r = {},
|
|
a = arguments,
|
|
o = a[0],
|
|
has = o && typeof o == 'object'
|
|
? function () { if ( o.hasOwnProperty(p) ) return ( v = o[p] ) != null; }
|
|
: function () { if ( a.length > i ) return ( v = a[i++] ) != null; };
|
|
|
|
// DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.
|
|
// 'config() DECIMAL_PLACES not an integer: {v}'
|
|
// 'config() DECIMAL_PLACES out of range: {v}'
|
|
if ( has( p = 'DECIMAL_PLACES' ) && isValidInt( v, 0, MAX, 2, p ) ) {
|
|
DECIMAL_PLACES = v | 0;
|
|
}
|
|
r[p] = DECIMAL_PLACES;
|
|
|
|
// ROUNDING_MODE {number} Integer, 0 to 8 inclusive.
|
|
// 'config() ROUNDING_MODE not an integer: {v}'
|
|
// 'config() ROUNDING_MODE out of range: {v}'
|
|
if ( has( p = 'ROUNDING_MODE' ) && isValidInt( v, 0, 8, 2, p ) ) {
|
|
ROUNDING_MODE = v | 0;
|
|
}
|
|
r[p] = ROUNDING_MODE;
|
|
|
|
// EXPONENTIAL_AT {number|number[]}
|
|
// Integer, -MAX to MAX inclusive or [integer -MAX to 0 inclusive, 0 to MAX inclusive].
|
|
// 'config() EXPONENTIAL_AT not an integer: {v}'
|
|
// 'config() EXPONENTIAL_AT out of range: {v}'
|
|
if ( has( p = 'EXPONENTIAL_AT' ) ) {
|
|
|
|
if ( isArray(v) ) {
|
|
if ( isValidInt( v[0], -MAX, 0, 2, p ) && isValidInt( v[1], 0, MAX, 2, p ) ) {
|
|
TO_EXP_NEG = v[0] | 0;
|
|
TO_EXP_POS = v[1] | 0;
|
|
}
|
|
} else if ( isValidInt( v, -MAX, MAX, 2, p ) ) {
|
|
TO_EXP_NEG = -( TO_EXP_POS = ( v < 0 ? -v : v ) | 0 );
|
|
}
|
|
}
|
|
r[p] = [ TO_EXP_NEG, TO_EXP_POS ];
|
|
|
|
// RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or
|
|
// [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].
|
|
// 'config() RANGE not an integer: {v}'
|
|
// 'config() RANGE cannot be zero: {v}'
|
|
// 'config() RANGE out of range: {v}'
|
|
if ( has( p = 'RANGE' ) ) {
|
|
|
|
if ( isArray(v) ) {
|
|
if ( isValidInt( v[0], -MAX, -1, 2, p ) && isValidInt( v[1], 1, MAX, 2, p ) ) {
|
|
MIN_EXP = v[0] | 0;
|
|
MAX_EXP = v[1] | 0;
|
|
}
|
|
} else if ( isValidInt( v, -MAX, MAX, 2, p ) ) {
|
|
if ( v | 0 ) MIN_EXP = -( MAX_EXP = ( v < 0 ? -v : v ) | 0 );
|
|
else if (ERRORS) raise( 2, p + ' cannot be zero', v );
|
|
}
|
|
}
|
|
r[p] = [ MIN_EXP, MAX_EXP ];
|
|
|
|
// ERRORS {boolean|number} true, false, 1 or 0.
|
|
// 'config() ERRORS not a boolean or binary digit: {v}'
|
|
if ( has( p = 'ERRORS' ) ) {
|
|
|
|
if ( v === !!v || v === 1 || v === 0 ) {
|
|
id = 0;
|
|
isValidInt = ( ERRORS = !!v ) ? intValidatorWithErrors : intValidatorNoErrors;
|
|
} else if (ERRORS) {
|
|
raise( 2, p + notBool, v );
|
|
}
|
|
}
|
|
r[p] = ERRORS;
|
|
|
|
// CRYPTO {boolean|number} true, false, 1 or 0.
|
|
// 'config() CRYPTO not a boolean or binary digit: {v}'
|
|
// 'config() crypto unavailable: {crypto}'
|
|
if ( has( p = 'CRYPTO' ) ) {
|
|
|
|
if ( v === !!v || v === 1 || v === 0 ) {
|
|
CRYPTO = !!( v && crypto && typeof crypto == 'object' );
|
|
if ( v && !CRYPTO && ERRORS ) raise( 2, 'crypto unavailable', crypto );
|
|
} else if (ERRORS) {
|
|
raise( 2, p + notBool, v );
|
|
}
|
|
}
|
|
r[p] = CRYPTO;
|
|
|
|
// MODULO_MODE {number} Integer, 0 to 9 inclusive.
|
|
// 'config() MODULO_MODE not an integer: {v}'
|
|
// 'config() MODULO_MODE out of range: {v}'
|
|
if ( has( p = 'MODULO_MODE' ) && isValidInt( v, 0, 9, 2, p ) ) {
|
|
MODULO_MODE = v | 0;
|
|
}
|
|
r[p] = MODULO_MODE;
|
|
|
|
// POW_PRECISION {number} Integer, 0 to MAX inclusive.
|
|
// 'config() POW_PRECISION not an integer: {v}'
|
|
// 'config() POW_PRECISION out of range: {v}'
|
|
if ( has( p = 'POW_PRECISION' ) && isValidInt( v, 0, MAX, 2, p ) ) {
|
|
POW_PRECISION = v | 0;
|
|
}
|
|
r[p] = POW_PRECISION;
|
|
|
|
// FORMAT {object}
|
|
// 'config() FORMAT not an object: {v}'
|
|
if ( has( p = 'FORMAT' ) ) {
|
|
|
|
if ( typeof v == 'object' ) {
|
|
FORMAT = v;
|
|
} else if (ERRORS) {
|
|
raise( 2, p + ' not an object', v );
|
|
}
|
|
}
|
|
r[p] = FORMAT;
|
|
|
|
return r;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the maximum of the arguments.
|
|
*
|
|
* arguments {number|string|BigNumber}
|
|
*/
|
|
BigNumber.max = function () { return maxOrMin( arguments, P.lt ); };
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the minimum of the arguments.
|
|
*
|
|
* arguments {number|string|BigNumber}
|
|
*/
|
|
BigNumber.min = function () { return maxOrMin( arguments, P.gt ); };
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber with a random value equal to or greater than 0 and less than 1,
|
|
* and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing
|
|
* zeros are produced).
|
|
*
|
|
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
|
|
*
|
|
* 'random() decimal places not an integer: {dp}'
|
|
* 'random() decimal places out of range: {dp}'
|
|
* 'random() crypto unavailable: {crypto}'
|
|
*/
|
|
BigNumber.random = (function () {
|
|
var pow2_53 = 0x20000000000000;
|
|
|
|
// Return a 53 bit integer n, where 0 <= n < 9007199254740992.
|
|
// Check if Math.random() produces more than 32 bits of randomness.
|
|
// If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.
|
|
// 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.
|
|
var random53bitInt = (Math.random() * pow2_53) & 0x1fffff
|
|
? function () { return mathfloor( Math.random() * pow2_53 ); }
|
|
: function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +
|
|
(Math.random() * 0x800000 | 0); };
|
|
|
|
return function (dp) {
|
|
var a, b, e, k, v,
|
|
i = 0,
|
|
c = [],
|
|
rand = new BigNumber(ONE);
|
|
|
|
dp = dp == null || !isValidInt( dp, 0, MAX, 14 ) ? DECIMAL_PLACES : dp | 0;
|
|
k = mathceil( dp / LOG_BASE );
|
|
|
|
if (CRYPTO) {
|
|
|
|
// Browsers supporting crypto.getRandomValues.
|
|
if ( crypto && crypto.getRandomValues ) {
|
|
|
|
a = crypto.getRandomValues( new Uint32Array( k *= 2 ) );
|
|
|
|
for ( ; i < k; ) {
|
|
|
|
// 53 bits:
|
|
// ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)
|
|
// 11111 11111111 11111111 11111111 11100000 00000000 00000000
|
|
// ((Math.pow(2, 32) - 1) >>> 11).toString(2)
|
|
// 11111 11111111 11111111
|
|
// 0x20000 is 2^21.
|
|
v = a[i] * 0x20000 + (a[i + 1] >>> 11);
|
|
|
|
// Rejection sampling:
|
|
// 0 <= v < 9007199254740992
|
|
// Probability that v >= 9e15, is
|
|
// 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251
|
|
if ( v >= 9e15 ) {
|
|
b = crypto.getRandomValues( new Uint32Array(2) );
|
|
a[i] = b[0];
|
|
a[i + 1] = b[1];
|
|
} else {
|
|
|
|
// 0 <= v <= 8999999999999999
|
|
// 0 <= (v % 1e14) <= 99999999999999
|
|
c.push( v % 1e14 );
|
|
i += 2;
|
|
}
|
|
}
|
|
i = k / 2;
|
|
|
|
// Node.js supporting crypto.randomBytes.
|
|
} else if ( crypto && crypto.randomBytes ) {
|
|
|
|
// buffer
|
|
a = crypto.randomBytes( k *= 7 );
|
|
|
|
for ( ; i < k; ) {
|
|
|
|
// 0x1000000000000 is 2^48, 0x10000000000 is 2^40
|
|
// 0x100000000 is 2^32, 0x1000000 is 2^24
|
|
// 11111 11111111 11111111 11111111 11111111 11111111 11111111
|
|
// 0 <= v < 9007199254740992
|
|
v = ( ( a[i] & 31 ) * 0x1000000000000 ) + ( a[i + 1] * 0x10000000000 ) +
|
|
( a[i + 2] * 0x100000000 ) + ( a[i + 3] * 0x1000000 ) +
|
|
( a[i + 4] << 16 ) + ( a[i + 5] << 8 ) + a[i + 6];
|
|
|
|
if ( v >= 9e15 ) {
|
|
crypto.randomBytes(7).copy( a, i );
|
|
} else {
|
|
|
|
// 0 <= (v % 1e14) <= 99999999999999
|
|
c.push( v % 1e14 );
|
|
i += 7;
|
|
}
|
|
}
|
|
i = k / 7;
|
|
} else if (ERRORS) {
|
|
raise( 14, 'crypto unavailable', crypto );
|
|
}
|
|
}
|
|
|
|
// Use Math.random: CRYPTO is false or crypto is unavailable and ERRORS is false.
|
|
if (!i) {
|
|
|
|
for ( ; i < k; ) {
|
|
v = random53bitInt();
|
|
if ( v < 9e15 ) c[i++] = v % 1e14;
|
|
}
|
|
}
|
|
|
|
k = c[--i];
|
|
dp %= LOG_BASE;
|
|
|
|
// Convert trailing digits to zeros according to dp.
|
|
if ( k && dp ) {
|
|
v = POWS_TEN[LOG_BASE - dp];
|
|
c[i] = mathfloor( k / v ) * v;
|
|
}
|
|
|
|
// Remove trailing elements which are zero.
|
|
for ( ; c[i] === 0; c.pop(), i-- );
|
|
|
|
// Zero?
|
|
if ( i < 0 ) {
|
|
c = [ e = 0 ];
|
|
} else {
|
|
|
|
// Remove leading elements which are zero and adjust exponent accordingly.
|
|
for ( e = -1 ; c[0] === 0; c.shift(), e -= LOG_BASE);
|
|
|
|
// Count the digits of the first element of c to determine leading zeros, and...
|
|
for ( i = 1, v = c[0]; v >= 10; v /= 10, i++);
|
|
|
|
// adjust the exponent accordingly.
|
|
if ( i < LOG_BASE ) e -= LOG_BASE - i;
|
|
}
|
|
|
|
rand.e = e;
|
|
rand.c = c;
|
|
return rand;
|
|
};
|
|
})();
|
|
|
|
|
|
// PRIVATE FUNCTIONS
|
|
|
|
|
|
// Convert a numeric string of baseIn to a numeric string of baseOut.
|
|
function convertBase( str, baseOut, baseIn, sign ) {
|
|
var d, e, k, r, x, xc, y,
|
|
i = str.indexOf( '.' ),
|
|
dp = DECIMAL_PLACES,
|
|
rm = ROUNDING_MODE;
|
|
|
|
if ( baseIn < 37 ) str = str.toLowerCase();
|
|
|
|
// Non-integer.
|
|
if ( i >= 0 ) {
|
|
k = POW_PRECISION;
|
|
|
|
// Unlimited precision.
|
|
POW_PRECISION = 0;
|
|
str = str.replace( '.', '' );
|
|
y = new BigNumber(baseIn);
|
|
x = y.pow( str.length - i );
|
|
POW_PRECISION = k;
|
|
|
|
// Convert str as if an integer, then restore the fraction part by dividing the
|
|
// result by its base raised to a power.
|
|
y.c = toBaseOut( toFixedPoint( coeffToString( x.c ), x.e ), 10, baseOut );
|
|
y.e = y.c.length;
|
|
}
|
|
|
|
// Convert the number as integer.
|
|
xc = toBaseOut( str, baseIn, baseOut );
|
|
e = k = xc.length;
|
|
|
|
// Remove trailing zeros.
|
|
for ( ; xc[--k] == 0; xc.pop() );
|
|
if ( !xc[0] ) return '0';
|
|
|
|
if ( i < 0 ) {
|
|
--e;
|
|
} else {
|
|
x.c = xc;
|
|
x.e = e;
|
|
|
|
// sign is needed for correct rounding.
|
|
x.s = sign;
|
|
x = div( x, y, dp, rm, baseOut );
|
|
xc = x.c;
|
|
r = x.r;
|
|
e = x.e;
|
|
}
|
|
|
|
d = e + dp + 1;
|
|
|
|
// The rounding digit, i.e. the digit to the right of the digit that may be rounded up.
|
|
i = xc[d];
|
|
k = baseOut / 2;
|
|
r = r || d < 0 || xc[d + 1] != null;
|
|
|
|
r = rm < 4 ? ( i != null || r ) && ( rm == 0 || rm == ( x.s < 0 ? 3 : 2 ) )
|
|
: i > k || i == k &&( rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||
|
|
rm == ( x.s < 0 ? 8 : 7 ) );
|
|
|
|
if ( d < 1 || !xc[0] ) {
|
|
|
|
// 1^-dp or 0.
|
|
str = r ? toFixedPoint( '1', -dp ) : '0';
|
|
} else {
|
|
xc.length = d;
|
|
|
|
if (r) {
|
|
|
|
// Rounding up may mean the previous digit has to be rounded up and so on.
|
|
for ( --baseOut; ++xc[--d] > baseOut; ) {
|
|
xc[d] = 0;
|
|
|
|
if ( !d ) {
|
|
++e;
|
|
xc.unshift(1);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Determine trailing zeros.
|
|
for ( k = xc.length; !xc[--k]; );
|
|
|
|
// E.g. [4, 11, 15] becomes 4bf.
|
|
for ( i = 0, str = ''; i <= k; str += ALPHABET.charAt( xc[i++] ) );
|
|
str = toFixedPoint( str, e );
|
|
}
|
|
|
|
// The caller will add the sign.
|
|
return str;
|
|
}
|
|
|
|
|
|
// Perform division in the specified base. Called by div and convertBase.
|
|
div = (function () {
|
|
|
|
// Assume non-zero x and k.
|
|
function multiply( x, k, base ) {
|
|
var m, temp, xlo, xhi,
|
|
carry = 0,
|
|
i = x.length,
|
|
klo = k % SQRT_BASE,
|
|
khi = k / SQRT_BASE | 0;
|
|
|
|
for ( x = x.slice(); i--; ) {
|
|
xlo = x[i] % SQRT_BASE;
|
|
xhi = x[i] / SQRT_BASE | 0;
|
|
m = khi * xlo + xhi * klo;
|
|
temp = klo * xlo + ( ( m % SQRT_BASE ) * SQRT_BASE ) + carry;
|
|
carry = ( temp / base | 0 ) + ( m / SQRT_BASE | 0 ) + khi * xhi;
|
|
x[i] = temp % base;
|
|
}
|
|
|
|
if (carry) x.unshift(carry);
|
|
|
|
return x;
|
|
}
|
|
|
|
function compare( a, b, aL, bL ) {
|
|
var i, cmp;
|
|
|
|
if ( aL != bL ) {
|
|
cmp = aL > bL ? 1 : -1;
|
|
} else {
|
|
|
|
for ( i = cmp = 0; i < aL; i++ ) {
|
|
|
|
if ( a[i] != b[i] ) {
|
|
cmp = a[i] > b[i] ? 1 : -1;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return cmp;
|
|
}
|
|
|
|
function subtract( a, b, aL, base ) {
|
|
var i = 0;
|
|
|
|
// Subtract b from a.
|
|
for ( ; aL--; ) {
|
|
a[aL] -= i;
|
|
i = a[aL] < b[aL] ? 1 : 0;
|
|
a[aL] = i * base + a[aL] - b[aL];
|
|
}
|
|
|
|
// Remove leading zeros.
|
|
for ( ; !a[0] && a.length > 1; a.shift() );
|
|
}
|
|
|
|
// x: dividend, y: divisor.
|
|
return function ( x, y, dp, rm, base ) {
|
|
var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,
|
|
yL, yz,
|
|
s = x.s == y.s ? 1 : -1,
|
|
xc = x.c,
|
|
yc = y.c;
|
|
|
|
// Either NaN, Infinity or 0?
|
|
if ( !xc || !xc[0] || !yc || !yc[0] ) {
|
|
|
|
return new BigNumber(
|
|
|
|
// Return NaN if either NaN, or both Infinity or 0.
|
|
!x.s || !y.s || ( xc ? yc && xc[0] == yc[0] : !yc ) ? NaN :
|
|
|
|
// Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
|
|
xc && xc[0] == 0 || !yc ? s * 0 : s / 0
|
|
);
|
|
}
|
|
|
|
q = new BigNumber(s);
|
|
qc = q.c = [];
|
|
e = x.e - y.e;
|
|
s = dp + e + 1;
|
|
|
|
if ( !base ) {
|
|
base = BASE;
|
|
e = bitFloor( x.e / LOG_BASE ) - bitFloor( y.e / LOG_BASE );
|
|
s = s / LOG_BASE | 0;
|
|
}
|
|
|
|
// Result exponent may be one less then the current value of e.
|
|
// The coefficients of the BigNumbers from convertBase may have trailing zeros.
|
|
for ( i = 0; yc[i] == ( xc[i] || 0 ); i++ );
|
|
if ( yc[i] > ( xc[i] || 0 ) ) e--;
|
|
|
|
if ( s < 0 ) {
|
|
qc.push(1);
|
|
more = true;
|
|
} else {
|
|
xL = xc.length;
|
|
yL = yc.length;
|
|
i = 0;
|
|
s += 2;
|
|
|
|
// Normalise xc and yc so highest order digit of yc is >= base / 2.
|
|
|
|
n = mathfloor( base / ( yc[0] + 1 ) );
|
|
|
|
// Not necessary, but to handle odd bases where yc[0] == ( base / 2 ) - 1.
|
|
// if ( n > 1 || n++ == 1 && yc[0] < base / 2 ) {
|
|
if ( n > 1 ) {
|
|
yc = multiply( yc, n, base );
|
|
xc = multiply( xc, n, base );
|
|
yL = yc.length;
|
|
xL = xc.length;
|
|
}
|
|
|
|
xi = yL;
|
|
rem = xc.slice( 0, yL );
|
|
remL = rem.length;
|
|
|
|
// Add zeros to make remainder as long as divisor.
|
|
for ( ; remL < yL; rem[remL++] = 0 );
|
|
yz = yc.slice();
|
|
yz.unshift(0);
|
|
yc0 = yc[0];
|
|
if ( yc[1] >= base / 2 ) yc0++;
|
|
// Not necessary, but to prevent trial digit n > base, when using base 3.
|
|
// else if ( base == 3 && yc0 == 1 ) yc0 = 1 + 1e-15;
|
|
|
|
do {
|
|
n = 0;
|
|
|
|
// Compare divisor and remainder.
|
|
cmp = compare( yc, rem, yL, remL );
|
|
|
|
// If divisor < remainder.
|
|
if ( cmp < 0 ) {
|
|
|
|
// Calculate trial digit, n.
|
|
|
|
rem0 = rem[0];
|
|
if ( yL != remL ) rem0 = rem0 * base + ( rem[1] || 0 );
|
|
|
|
// n is how many times the divisor goes into the current remainder.
|
|
n = mathfloor( rem0 / yc0 );
|
|
|
|
// Algorithm:
|
|
// 1. product = divisor * trial digit (n)
|
|
// 2. if product > remainder: product -= divisor, n--
|
|
// 3. remainder -= product
|
|
// 4. if product was < remainder at 2:
|
|
// 5. compare new remainder and divisor
|
|
// 6. If remainder > divisor: remainder -= divisor, n++
|
|
|
|
if ( n > 1 ) {
|
|
|
|
// n may be > base only when base is 3.
|
|
if (n >= base) n = base - 1;
|
|
|
|
// product = divisor * trial digit.
|
|
prod = multiply( yc, n, base );
|
|
prodL = prod.length;
|
|
remL = rem.length;
|
|
|
|
// Compare product and remainder.
|
|
// If product > remainder.
|
|
// Trial digit n too high.
|
|
// n is 1 too high about 5% of the time, and is not known to have
|
|
// ever been more than 1 too high.
|
|
while ( compare( prod, rem, prodL, remL ) == 1 ) {
|
|
n--;
|
|
|
|
// Subtract divisor from product.
|
|
subtract( prod, yL < prodL ? yz : yc, prodL, base );
|
|
prodL = prod.length;
|
|
cmp = 1;
|
|
}
|
|
} else {
|
|
|
|
// n is 0 or 1, cmp is -1.
|
|
// If n is 0, there is no need to compare yc and rem again below,
|
|
// so change cmp to 1 to avoid it.
|
|
// If n is 1, leave cmp as -1, so yc and rem are compared again.
|
|
if ( n == 0 ) {
|
|
|
|
// divisor < remainder, so n must be at least 1.
|
|
cmp = n = 1;
|
|
}
|
|
|
|
// product = divisor
|
|
prod = yc.slice();
|
|
prodL = prod.length;
|
|
}
|
|
|
|
if ( prodL < remL ) prod.unshift(0);
|
|
|
|
// Subtract product from remainder.
|
|
subtract( rem, prod, remL, base );
|
|
remL = rem.length;
|
|
|
|
// If product was < remainder.
|
|
if ( cmp == -1 ) {
|
|
|
|
// Compare divisor and new remainder.
|
|
// If divisor < new remainder, subtract divisor from remainder.
|
|
// Trial digit n too low.
|
|
// n is 1 too low about 5% of the time, and very rarely 2 too low.
|
|
while ( compare( yc, rem, yL, remL ) < 1 ) {
|
|
n++;
|
|
|
|
// Subtract divisor from remainder.
|
|
subtract( rem, yL < remL ? yz : yc, remL, base );
|
|
remL = rem.length;
|
|
}
|
|
}
|
|
} else if ( cmp === 0 ) {
|
|
n++;
|
|
rem = [0];
|
|
} // else cmp === 1 and n will be 0
|
|
|
|
// Add the next digit, n, to the result array.
|
|
qc[i++] = n;
|
|
|
|
// Update the remainder.
|
|
if ( rem[0] ) {
|
|
rem[remL++] = xc[xi] || 0;
|
|
} else {
|
|
rem = [ xc[xi] ];
|
|
remL = 1;
|
|
}
|
|
} while ( ( xi++ < xL || rem[0] != null ) && s-- );
|
|
|
|
more = rem[0] != null;
|
|
|
|
// Leading zero?
|
|
if ( !qc[0] ) qc.shift();
|
|
}
|
|
|
|
if ( base == BASE ) {
|
|
|
|
// To calculate q.e, first get the number of digits of qc[0].
|
|
for ( i = 1, s = qc[0]; s >= 10; s /= 10, i++ );
|
|
round( q, dp + ( q.e = i + e * LOG_BASE - 1 ) + 1, rm, more );
|
|
|
|
// Caller is convertBase.
|
|
} else {
|
|
q.e = e;
|
|
q.r = +more;
|
|
}
|
|
|
|
return q;
|
|
};
|
|
})();
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of BigNumber n in fixed-point or exponential
|
|
* notation rounded to the specified decimal places or significant digits.
|
|
*
|
|
* n is a BigNumber.
|
|
* i is the index of the last digit required (i.e. the digit that may be rounded up).
|
|
* rm is the rounding mode.
|
|
* caller is caller id: toExponential 19, toFixed 20, toFormat 21, toPrecision 24.
|
|
*/
|
|
function format( n, i, rm, caller ) {
|
|
var c0, e, ne, len, str;
|
|
|
|
rm = rm != null && isValidInt( rm, 0, 8, caller, roundingMode )
|
|
? rm | 0 : ROUNDING_MODE;
|
|
|
|
if ( !n.c ) return n.toString();
|
|
c0 = n.c[0];
|
|
ne = n.e;
|
|
|
|
if ( i == null ) {
|
|
str = coeffToString( n.c );
|
|
str = caller == 19 || caller == 24 && ne <= TO_EXP_NEG
|
|
? toExponential( str, ne )
|
|
: toFixedPoint( str, ne );
|
|
} else {
|
|
n = round( new BigNumber(n), i, rm );
|
|
|
|
// n.e may have changed if the value was rounded up.
|
|
e = n.e;
|
|
|
|
str = coeffToString( n.c );
|
|
len = str.length;
|
|
|
|
// toPrecision returns exponential notation if the number of significant digits
|
|
// specified is less than the number of digits necessary to represent the integer
|
|
// part of the value in fixed-point notation.
|
|
|
|
// Exponential notation.
|
|
if ( caller == 19 || caller == 24 && ( i <= e || e <= TO_EXP_NEG ) ) {
|
|
|
|
// Append zeros?
|
|
for ( ; len < i; str += '0', len++ );
|
|
str = toExponential( str, e );
|
|
|
|
// Fixed-point notation.
|
|
} else {
|
|
i -= ne;
|
|
str = toFixedPoint( str, e );
|
|
|
|
// Append zeros?
|
|
if ( e + 1 > len ) {
|
|
if ( --i > 0 ) for ( str += '.'; i--; str += '0' );
|
|
} else {
|
|
i += e - len;
|
|
if ( i > 0 ) {
|
|
if ( e + 1 == len ) str += '.';
|
|
for ( ; i--; str += '0' );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return n.s < 0 && c0 ? '-' + str : str;
|
|
}
|
|
|
|
|
|
// Handle BigNumber.max and BigNumber.min.
|
|
function maxOrMin( args, method ) {
|
|
var m, n,
|
|
i = 0;
|
|
|
|
if ( isArray( args[0] ) ) args = args[0];
|
|
m = new BigNumber( args[0] );
|
|
|
|
for ( ; ++i < args.length; ) {
|
|
n = new BigNumber( args[i] );
|
|
|
|
// If any number is NaN, return NaN.
|
|
if ( !n.s ) {
|
|
m = n;
|
|
break;
|
|
} else if ( method.call( m, n ) ) {
|
|
m = n;
|
|
}
|
|
}
|
|
|
|
return m;
|
|
}
|
|
|
|
|
|
/*
|
|
* Return true if n is an integer in range, otherwise throw.
|
|
* Use for argument validation when ERRORS is true.
|
|
*/
|
|
function intValidatorWithErrors( n, min, max, caller, name ) {
|
|
if ( n < min || n > max || n != truncate(n) ) {
|
|
raise( caller, ( name || 'decimal places' ) +
|
|
( n < min || n > max ? ' out of range' : ' not an integer' ), n );
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
|
|
/*
|
|
* Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.
|
|
* Called by minus, plus and times.
|
|
*/
|
|
function normalise( n, c, e ) {
|
|
var i = 1,
|
|
j = c.length;
|
|
|
|
// Remove trailing zeros.
|
|
for ( ; !c[--j]; c.pop() );
|
|
|
|
// Calculate the base 10 exponent. First get the number of digits of c[0].
|
|
for ( j = c[0]; j >= 10; j /= 10, i++ );
|
|
|
|
// Overflow?
|
|
if ( ( e = i + e * LOG_BASE - 1 ) > MAX_EXP ) {
|
|
|
|
// Infinity.
|
|
n.c = n.e = null;
|
|
|
|
// Underflow?
|
|
} else if ( e < MIN_EXP ) {
|
|
|
|
// Zero.
|
|
n.c = [ n.e = 0 ];
|
|
} else {
|
|
n.e = e;
|
|
n.c = c;
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|
|
|
|
// Handle values that fail the validity test in BigNumber.
|
|
parseNumeric = (function () {
|
|
var basePrefix = /^(-?)0([xbo])/i,
|
|
dotAfter = /^([^.]+)\.$/,
|
|
dotBefore = /^\.([^.]+)$/,
|
|
isInfinityOrNaN = /^-?(Infinity|NaN)$/,
|
|
whitespaceOrPlus = /^\s*\+|^\s+|\s+$/g;
|
|
|
|
return function ( x, str, num, b ) {
|
|
var base,
|
|
s = num ? str : str.replace( whitespaceOrPlus, '' );
|
|
|
|
// No exception on ±Infinity or NaN.
|
|
if ( isInfinityOrNaN.test(s) ) {
|
|
x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
|
|
} else {
|
|
if ( !num ) {
|
|
|
|
// basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i
|
|
s = s.replace( basePrefix, function ( m, p1, p2 ) {
|
|
base = ( p2 = p2.toLowerCase() ) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
|
|
return !b || b == base ? p1 : m;
|
|
});
|
|
|
|
if (b) {
|
|
base = b;
|
|
|
|
// E.g. '1.' to '1', '.1' to '0.1'
|
|
s = s.replace( dotAfter, '$1' ).replace( dotBefore, '0.$1' );
|
|
}
|
|
|
|
if ( str != s ) return new BigNumber( s, base );
|
|
}
|
|
|
|
// 'new BigNumber() not a number: {n}'
|
|
// 'new BigNumber() not a base {b} number: {n}'
|
|
if (ERRORS) raise( id, 'not a' + ( b ? ' base ' + b : '' ) + ' number', str );
|
|
x.s = null;
|
|
}
|
|
|
|
x.c = x.e = null;
|
|
id = 0;
|
|
}
|
|
})();
|
|
|
|
|
|
// Throw a BigNumber Error.
|
|
function raise( caller, msg, val ) {
|
|
var error = new Error( [
|
|
'new BigNumber', // 0
|
|
'cmp', // 1
|
|
'config', // 2
|
|
'div', // 3
|
|
'divToInt', // 4
|
|
'eq', // 5
|
|
'gt', // 6
|
|
'gte', // 7
|
|
'lt', // 8
|
|
'lte', // 9
|
|
'minus', // 10
|
|
'mod', // 11
|
|
'plus', // 12
|
|
'precision', // 13
|
|
'random', // 14
|
|
'round', // 15
|
|
'shift', // 16
|
|
'times', // 17
|
|
'toDigits', // 18
|
|
'toExponential', // 19
|
|
'toFixed', // 20
|
|
'toFormat', // 21
|
|
'toFraction', // 22
|
|
'pow', // 23
|
|
'toPrecision', // 24
|
|
'toString', // 25
|
|
'BigNumber' // 26
|
|
][caller] + '() ' + msg + ': ' + val );
|
|
|
|
error.name = 'BigNumber Error';
|
|
id = 0;
|
|
throw error;
|
|
}
|
|
|
|
|
|
/*
|
|
* Round x to sd significant digits using rounding mode rm. Check for over/under-flow.
|
|
* If r is truthy, it is known that there are more digits after the rounding digit.
|
|
*/
|
|
function round( x, sd, rm, r ) {
|
|
var d, i, j, k, n, ni, rd,
|
|
xc = x.c,
|
|
pows10 = POWS_TEN;
|
|
|
|
// if x is not Infinity or NaN...
|
|
if (xc) {
|
|
|
|
// rd is the rounding digit, i.e. the digit after the digit that may be rounded up.
|
|
// n is a base 1e14 number, the value of the element of array x.c containing rd.
|
|
// ni is the index of n within x.c.
|
|
// d is the number of digits of n.
|
|
// i is the index of rd within n including leading zeros.
|
|
// j is the actual index of rd within n (if < 0, rd is a leading zero).
|
|
out: {
|
|
|
|
// Get the number of digits of the first element of xc.
|
|
for ( d = 1, k = xc[0]; k >= 10; k /= 10, d++ );
|
|
i = sd - d;
|
|
|
|
// If the rounding digit is in the first element of xc...
|
|
if ( i < 0 ) {
|
|
i += LOG_BASE;
|
|
j = sd;
|
|
n = xc[ ni = 0 ];
|
|
|
|
// Get the rounding digit at index j of n.
|
|
rd = n / pows10[ d - j - 1 ] % 10 | 0;
|
|
} else {
|
|
ni = mathceil( ( i + 1 ) / LOG_BASE );
|
|
|
|
if ( ni >= xc.length ) {
|
|
|
|
if (r) {
|
|
|
|
// Needed by sqrt.
|
|
for ( ; xc.length <= ni; xc.push(0) );
|
|
n = rd = 0;
|
|
d = 1;
|
|
i %= LOG_BASE;
|
|
j = i - LOG_BASE + 1;
|
|
} else {
|
|
break out;
|
|
}
|
|
} else {
|
|
n = k = xc[ni];
|
|
|
|
// Get the number of digits of n.
|
|
for ( d = 1; k >= 10; k /= 10, d++ );
|
|
|
|
// Get the index of rd within n.
|
|
i %= LOG_BASE;
|
|
|
|
// Get the index of rd within n, adjusted for leading zeros.
|
|
// The number of leading zeros of n is given by LOG_BASE - d.
|
|
j = i - LOG_BASE + d;
|
|
|
|
// Get the rounding digit at index j of n.
|
|
rd = j < 0 ? 0 : n / pows10[ d - j - 1 ] % 10 | 0;
|
|
}
|
|
}
|
|
|
|
r = r || sd < 0 ||
|
|
|
|
// Are there any non-zero digits after the rounding digit?
|
|
// The expression n % pows10[ d - j - 1 ] returns all digits of n to the right
|
|
// of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
|
|
xc[ni + 1] != null || ( j < 0 ? n : n % pows10[ d - j - 1 ] );
|
|
|
|
r = rm < 4
|
|
? ( rd || r ) && ( rm == 0 || rm == ( x.s < 0 ? 3 : 2 ) )
|
|
: rd > 5 || rd == 5 && ( rm == 4 || r || rm == 6 &&
|
|
|
|
// Check whether the digit to the left of the rounding digit is odd.
|
|
( ( i > 0 ? j > 0 ? n / pows10[ d - j ] : 0 : xc[ni - 1] ) % 10 ) & 1 ||
|
|
rm == ( x.s < 0 ? 8 : 7 ) );
|
|
|
|
if ( sd < 1 || !xc[0] ) {
|
|
xc.length = 0;
|
|
|
|
if (r) {
|
|
|
|
// Convert sd to decimal places.
|
|
sd -= x.e + 1;
|
|
|
|
// 1, 0.1, 0.01, 0.001, 0.0001 etc.
|
|
xc[0] = pows10[ sd % LOG_BASE ];
|
|
x.e = -sd || 0;
|
|
} else {
|
|
|
|
// Zero.
|
|
xc[0] = x.e = 0;
|
|
}
|
|
|
|
return x;
|
|
}
|
|
|
|
// Remove excess digits.
|
|
if ( i == 0 ) {
|
|
xc.length = ni;
|
|
k = 1;
|
|
ni--;
|
|
} else {
|
|
xc.length = ni + 1;
|
|
k = pows10[ LOG_BASE - i ];
|
|
|
|
// E.g. 56700 becomes 56000 if 7 is the rounding digit.
|
|
// j > 0 means i > number of leading zeros of n.
|
|
xc[ni] = j > 0 ? mathfloor( n / pows10[ d - j ] % pows10[j] ) * k : 0;
|
|
}
|
|
|
|
// Round up?
|
|
if (r) {
|
|
|
|
for ( ; ; ) {
|
|
|
|
// If the digit to be rounded up is in the first element of xc...
|
|
if ( ni == 0 ) {
|
|
|
|
// i will be the length of xc[0] before k is added.
|
|
for ( i = 1, j = xc[0]; j >= 10; j /= 10, i++ );
|
|
j = xc[0] += k;
|
|
for ( k = 1; j >= 10; j /= 10, k++ );
|
|
|
|
// if i != k the length has increased.
|
|
if ( i != k ) {
|
|
x.e++;
|
|
if ( xc[0] == BASE ) xc[0] = 1;
|
|
}
|
|
|
|
break;
|
|
} else {
|
|
xc[ni] += k;
|
|
if ( xc[ni] != BASE ) break;
|
|
xc[ni--] = 0;
|
|
k = 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
// Remove trailing zeros.
|
|
for ( i = xc.length; xc[--i] === 0; xc.pop() );
|
|
}
|
|
|
|
// Overflow? Infinity.
|
|
if ( x.e > MAX_EXP ) {
|
|
x.c = x.e = null;
|
|
|
|
// Underflow? Zero.
|
|
} else if ( x.e < MIN_EXP ) {
|
|
x.c = [ x.e = 0 ];
|
|
}
|
|
}
|
|
|
|
return x;
|
|
}
|
|
|
|
|
|
// PROTOTYPE/INSTANCE METHODS
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the absolute value of this BigNumber.
|
|
*/
|
|
P.absoluteValue = P.abs = function () {
|
|
var x = new BigNumber(this);
|
|
if ( x.s < 0 ) x.s = 1;
|
|
return x;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber rounded to a whole
|
|
* number in the direction of Infinity.
|
|
*/
|
|
P.ceil = function () {
|
|
return round( new BigNumber(this), this.e + 1, 2 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return
|
|
* 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),
|
|
* -1 if the value of this BigNumber is less than the value of BigNumber(y, b),
|
|
* 0 if they have the same value,
|
|
* or null if the value of either is NaN.
|
|
*/
|
|
P.comparedTo = P.cmp = function ( y, b ) {
|
|
id = 1;
|
|
return compare( this, new BigNumber( y, b ) );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return the number of decimal places of the value of this BigNumber, or null if the value
|
|
* of this BigNumber is ±Infinity or NaN.
|
|
*/
|
|
P.decimalPlaces = P.dp = function () {
|
|
var n, v,
|
|
c = this.c;
|
|
|
|
if ( !c ) return null;
|
|
n = ( ( v = c.length - 1 ) - bitFloor( this.e / LOG_BASE ) ) * LOG_BASE;
|
|
|
|
// Subtract the number of trailing zeros of the last number.
|
|
if ( v = c[v] ) for ( ; v % 10 == 0; v /= 10, n-- );
|
|
if ( n < 0 ) n = 0;
|
|
|
|
return n;
|
|
};
|
|
|
|
|
|
/*
|
|
* n / 0 = I
|
|
* n / N = N
|
|
* n / I = 0
|
|
* 0 / n = 0
|
|
* 0 / 0 = N
|
|
* 0 / N = N
|
|
* 0 / I = 0
|
|
* N / n = N
|
|
* N / 0 = N
|
|
* N / N = N
|
|
* N / I = N
|
|
* I / n = I
|
|
* I / 0 = I
|
|
* I / N = N
|
|
* I / I = N
|
|
*
|
|
* Return a new BigNumber whose value is the value of this BigNumber divided by the value of
|
|
* BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.
|
|
*/
|
|
P.dividedBy = P.div = function ( y, b ) {
|
|
id = 3;
|
|
return div( this, new BigNumber( y, b ), DECIMAL_PLACES, ROUNDING_MODE );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the integer part of dividing the value of this
|
|
* BigNumber by the value of BigNumber(y, b).
|
|
*/
|
|
P.dividedToIntegerBy = P.divToInt = function ( y, b ) {
|
|
id = 4;
|
|
return div( this, new BigNumber( y, b ), 0, 1 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),
|
|
* otherwise returns false.
|
|
*/
|
|
P.equals = P.eq = function ( y, b ) {
|
|
id = 5;
|
|
return compare( this, new BigNumber( y, b ) ) === 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber rounded to a whole
|
|
* number in the direction of -Infinity.
|
|
*/
|
|
P.floor = function () {
|
|
return round( new BigNumber(this), this.e + 1, 3 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),
|
|
* otherwise returns false.
|
|
*/
|
|
P.greaterThan = P.gt = function ( y, b ) {
|
|
id = 6;
|
|
return compare( this, new BigNumber( y, b ) ) > 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is greater than or equal to the value of
|
|
* BigNumber(y, b), otherwise returns false.
|
|
*/
|
|
P.greaterThanOrEqualTo = P.gte = function ( y, b ) {
|
|
id = 7;
|
|
return ( b = compare( this, new BigNumber( y, b ) ) ) === 1 || b === 0;
|
|
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is a finite number, otherwise returns false.
|
|
*/
|
|
P.isFinite = function () {
|
|
return !!this.c;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is an integer, otherwise return false.
|
|
*/
|
|
P.isInteger = P.isInt = function () {
|
|
return !!this.c && bitFloor( this.e / LOG_BASE ) > this.c.length - 2;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is NaN, otherwise returns false.
|
|
*/
|
|
P.isNaN = function () {
|
|
return !this.s;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is negative, otherwise returns false.
|
|
*/
|
|
P.isNegative = P.isNeg = function () {
|
|
return this.s < 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is 0 or -0, otherwise returns false.
|
|
*/
|
|
P.isZero = function () {
|
|
return !!this.c && this.c[0] == 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is less than the value of BigNumber(y, b),
|
|
* otherwise returns false.
|
|
*/
|
|
P.lessThan = P.lt = function ( y, b ) {
|
|
id = 8;
|
|
return compare( this, new BigNumber( y, b ) ) < 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return true if the value of this BigNumber is less than or equal to the value of
|
|
* BigNumber(y, b), otherwise returns false.
|
|
*/
|
|
P.lessThanOrEqualTo = P.lte = function ( y, b ) {
|
|
id = 9;
|
|
return ( b = compare( this, new BigNumber( y, b ) ) ) === -1 || b === 0;
|
|
};
|
|
|
|
|
|
/*
|
|
* n - 0 = n
|
|
* n - N = N
|
|
* n - I = -I
|
|
* 0 - n = -n
|
|
* 0 - 0 = 0
|
|
* 0 - N = N
|
|
* 0 - I = -I
|
|
* N - n = N
|
|
* N - 0 = N
|
|
* N - N = N
|
|
* N - I = N
|
|
* I - n = I
|
|
* I - 0 = I
|
|
* I - N = N
|
|
* I - I = N
|
|
*
|
|
* Return a new BigNumber whose value is the value of this BigNumber minus the value of
|
|
* BigNumber(y, b).
|
|
*/
|
|
P.minus = P.sub = function ( y, b ) {
|
|
var i, j, t, xLTy,
|
|
x = this,
|
|
a = x.s;
|
|
|
|
id = 10;
|
|
y = new BigNumber( y, b );
|
|
b = y.s;
|
|
|
|
// Either NaN?
|
|
if ( !a || !b ) return new BigNumber(NaN);
|
|
|
|
// Signs differ?
|
|
if ( a != b ) {
|
|
y.s = -b;
|
|
return x.plus(y);
|
|
}
|
|
|
|
var xe = x.e / LOG_BASE,
|
|
ye = y.e / LOG_BASE,
|
|
xc = x.c,
|
|
yc = y.c;
|
|
|
|
if ( !xe || !ye ) {
|
|
|
|
// Either Infinity?
|
|
if ( !xc || !yc ) return xc ? ( y.s = -b, y ) : new BigNumber( yc ? x : NaN );
|
|
|
|
// Either zero?
|
|
if ( !xc[0] || !yc[0] ) {
|
|
|
|
// Return y if y is non-zero, x if x is non-zero, or zero if both are zero.
|
|
return yc[0] ? ( y.s = -b, y ) : new BigNumber( xc[0] ? x :
|
|
|
|
// IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
|
|
ROUNDING_MODE == 3 ? -0 : 0 );
|
|
}
|
|
}
|
|
|
|
xe = bitFloor(xe);
|
|
ye = bitFloor(ye);
|
|
xc = xc.slice();
|
|
|
|
// Determine which is the bigger number.
|
|
if ( a = xe - ye ) {
|
|
|
|
if ( xLTy = a < 0 ) {
|
|
a = -a;
|
|
t = xc;
|
|
} else {
|
|
ye = xe;
|
|
t = yc;
|
|
}
|
|
|
|
t.reverse();
|
|
|
|
// Prepend zeros to equalise exponents.
|
|
for ( b = a; b--; t.push(0) );
|
|
t.reverse();
|
|
} else {
|
|
|
|
// Exponents equal. Check digit by digit.
|
|
j = ( xLTy = ( a = xc.length ) < ( b = yc.length ) ) ? a : b;
|
|
|
|
for ( a = b = 0; b < j; b++ ) {
|
|
|
|
if ( xc[b] != yc[b] ) {
|
|
xLTy = xc[b] < yc[b];
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
// x < y? Point xc to the array of the bigger number.
|
|
if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;
|
|
|
|
b = ( j = yc.length ) - ( i = xc.length );
|
|
|
|
// Append zeros to xc if shorter.
|
|
// No need to add zeros to yc if shorter as subtract only needs to start at yc.length.
|
|
if ( b > 0 ) for ( ; b--; xc[i++] = 0 );
|
|
b = BASE - 1;
|
|
|
|
// Subtract yc from xc.
|
|
for ( ; j > a; ) {
|
|
|
|
if ( xc[--j] < yc[j] ) {
|
|
for ( i = j; i && !xc[--i]; xc[i] = b );
|
|
--xc[i];
|
|
xc[j] += BASE;
|
|
}
|
|
|
|
xc[j] -= yc[j];
|
|
}
|
|
|
|
// Remove leading zeros and adjust exponent accordingly.
|
|
for ( ; xc[0] == 0; xc.shift(), --ye );
|
|
|
|
// Zero?
|
|
if ( !xc[0] ) {
|
|
|
|
// Following IEEE 754 (2008) 6.3,
|
|
// n - n = +0 but n - n = -0 when rounding towards -Infinity.
|
|
y.s = ROUNDING_MODE == 3 ? -1 : 1;
|
|
y.c = [ y.e = 0 ];
|
|
return y;
|
|
}
|
|
|
|
// No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity
|
|
// for finite x and y.
|
|
return normalise( y, xc, ye );
|
|
};
|
|
|
|
|
|
/*
|
|
* n % 0 = N
|
|
* n % N = N
|
|
* n % I = n
|
|
* 0 % n = 0
|
|
* -0 % n = -0
|
|
* 0 % 0 = N
|
|
* 0 % N = N
|
|
* 0 % I = 0
|
|
* N % n = N
|
|
* N % 0 = N
|
|
* N % N = N
|
|
* N % I = N
|
|
* I % n = N
|
|
* I % 0 = N
|
|
* I % N = N
|
|
* I % I = N
|
|
*
|
|
* Return a new BigNumber whose value is the value of this BigNumber modulo the value of
|
|
* BigNumber(y, b). The result depends on the value of MODULO_MODE.
|
|
*/
|
|
P.modulo = P.mod = function ( y, b ) {
|
|
var q, s,
|
|
x = this;
|
|
|
|
id = 11;
|
|
y = new BigNumber( y, b );
|
|
|
|
// Return NaN if x is Infinity or NaN, or y is NaN or zero.
|
|
if ( !x.c || !y.s || y.c && !y.c[0] ) {
|
|
return new BigNumber(NaN);
|
|
|
|
// Return x if y is Infinity or x is zero.
|
|
} else if ( !y.c || x.c && !x.c[0] ) {
|
|
return new BigNumber(x);
|
|
}
|
|
|
|
if ( MODULO_MODE == 9 ) {
|
|
|
|
// Euclidian division: q = sign(y) * floor(x / abs(y))
|
|
// r = x - qy where 0 <= r < abs(y)
|
|
s = y.s;
|
|
y.s = 1;
|
|
q = div( x, y, 0, 3 );
|
|
y.s = s;
|
|
q.s *= s;
|
|
} else {
|
|
q = div( x, y, 0, MODULO_MODE );
|
|
}
|
|
|
|
return x.minus( q.times(y) );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber negated,
|
|
* i.e. multiplied by -1.
|
|
*/
|
|
P.negated = P.neg = function () {
|
|
var x = new BigNumber(this);
|
|
x.s = -x.s || null;
|
|
return x;
|
|
};
|
|
|
|
|
|
/*
|
|
* n + 0 = n
|
|
* n + N = N
|
|
* n + I = I
|
|
* 0 + n = n
|
|
* 0 + 0 = 0
|
|
* 0 + N = N
|
|
* 0 + I = I
|
|
* N + n = N
|
|
* N + 0 = N
|
|
* N + N = N
|
|
* N + I = N
|
|
* I + n = I
|
|
* I + 0 = I
|
|
* I + N = N
|
|
* I + I = I
|
|
*
|
|
* Return a new BigNumber whose value is the value of this BigNumber plus the value of
|
|
* BigNumber(y, b).
|
|
*/
|
|
P.plus = P.add = function ( y, b ) {
|
|
var t,
|
|
x = this,
|
|
a = x.s;
|
|
|
|
id = 12;
|
|
y = new BigNumber( y, b );
|
|
b = y.s;
|
|
|
|
// Either NaN?
|
|
if ( !a || !b ) return new BigNumber(NaN);
|
|
|
|
// Signs differ?
|
|
if ( a != b ) {
|
|
y.s = -b;
|
|
return x.minus(y);
|
|
}
|
|
|
|
var xe = x.e / LOG_BASE,
|
|
ye = y.e / LOG_BASE,
|
|
xc = x.c,
|
|
yc = y.c;
|
|
|
|
if ( !xe || !ye ) {
|
|
|
|
// Return ±Infinity if either ±Infinity.
|
|
if ( !xc || !yc ) return new BigNumber( a / 0 );
|
|
|
|
// Either zero?
|
|
// Return y if y is non-zero, x if x is non-zero, or zero if both are zero.
|
|
if ( !xc[0] || !yc[0] ) return yc[0] ? y : new BigNumber( xc[0] ? x : a * 0 );
|
|
}
|
|
|
|
xe = bitFloor(xe);
|
|
ye = bitFloor(ye);
|
|
xc = xc.slice();
|
|
|
|
// Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.
|
|
if ( a = xe - ye ) {
|
|
if ( a > 0 ) {
|
|
ye = xe;
|
|
t = yc;
|
|
} else {
|
|
a = -a;
|
|
t = xc;
|
|
}
|
|
|
|
t.reverse();
|
|
for ( ; a--; t.push(0) );
|
|
t.reverse();
|
|
}
|
|
|
|
a = xc.length;
|
|
b = yc.length;
|
|
|
|
// Point xc to the longer array, and b to the shorter length.
|
|
if ( a - b < 0 ) t = yc, yc = xc, xc = t, b = a;
|
|
|
|
// Only start adding at yc.length - 1 as the further digits of xc can be ignored.
|
|
for ( a = 0; b; ) {
|
|
a = ( xc[--b] = xc[b] + yc[b] + a ) / BASE | 0;
|
|
xc[b] %= BASE;
|
|
}
|
|
|
|
if (a) {
|
|
xc.unshift(a);
|
|
++ye;
|
|
}
|
|
|
|
// No need to check for zero, as +x + +y != 0 && -x + -y != 0
|
|
// ye = MAX_EXP + 1 possible
|
|
return normalise( y, xc, ye );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return the number of significant digits of the value of this BigNumber.
|
|
*
|
|
* [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
|
|
*/
|
|
P.precision = P.sd = function (z) {
|
|
var n, v,
|
|
x = this,
|
|
c = x.c;
|
|
|
|
// 'precision() argument not a boolean or binary digit: {z}'
|
|
if ( z != null && z !== !!z && z !== 1 && z !== 0 ) {
|
|
if (ERRORS) raise( 13, 'argument' + notBool, z );
|
|
if ( z != !!z ) z = null;
|
|
}
|
|
|
|
if ( !c ) return null;
|
|
v = c.length - 1;
|
|
n = v * LOG_BASE + 1;
|
|
|
|
if ( v = c[v] ) {
|
|
|
|
// Subtract the number of trailing zeros of the last element.
|
|
for ( ; v % 10 == 0; v /= 10, n-- );
|
|
|
|
// Add the number of digits of the first element.
|
|
for ( v = c[0]; v >= 10; v /= 10, n++ );
|
|
}
|
|
|
|
if ( z && x.e + 1 > n ) n = x.e + 1;
|
|
|
|
return n;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber rounded to a maximum of
|
|
* dp decimal places using rounding mode rm, or to 0 and ROUNDING_MODE respectively if
|
|
* omitted.
|
|
*
|
|
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'round() decimal places out of range: {dp}'
|
|
* 'round() decimal places not an integer: {dp}'
|
|
* 'round() rounding mode not an integer: {rm}'
|
|
* 'round() rounding mode out of range: {rm}'
|
|
*/
|
|
P.round = function ( dp, rm ) {
|
|
var n = new BigNumber(this);
|
|
|
|
if ( dp == null || isValidInt( dp, 0, MAX, 15 ) ) {
|
|
round( n, ~~dp + this.e + 1, rm == null ||
|
|
!isValidInt( rm, 0, 8, 15, roundingMode ) ? ROUNDING_MODE : rm | 0 );
|
|
}
|
|
|
|
return n;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber shifted by k places
|
|
* (powers of 10). Shift to the right if n > 0, and to the left if n < 0.
|
|
*
|
|
* k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.
|
|
*
|
|
* If k is out of range and ERRORS is false, the result will be ±0 if k < 0, or ±Infinity
|
|
* otherwise.
|
|
*
|
|
* 'shift() argument not an integer: {k}'
|
|
* 'shift() argument out of range: {k}'
|
|
*/
|
|
P.shift = function (k) {
|
|
var n = this;
|
|
return isValidInt( k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER, 16, 'argument' )
|
|
|
|
// k < 1e+21, or truncate(k) will produce exponential notation.
|
|
? n.times( '1e' + truncate(k) )
|
|
: new BigNumber( n.c && n.c[0] && ( k < -MAX_SAFE_INTEGER || k > MAX_SAFE_INTEGER )
|
|
? n.s * ( k < 0 ? 0 : 1 / 0 )
|
|
: n );
|
|
};
|
|
|
|
|
|
/*
|
|
* sqrt(-n) = N
|
|
* sqrt( N) = N
|
|
* sqrt(-I) = N
|
|
* sqrt( I) = I
|
|
* sqrt( 0) = 0
|
|
* sqrt(-0) = -0
|
|
*
|
|
* Return a new BigNumber whose value is the square root of the value of this BigNumber,
|
|
* rounded according to DECIMAL_PLACES and ROUNDING_MODE.
|
|
*/
|
|
P.squareRoot = P.sqrt = function () {
|
|
var m, n, r, rep, t,
|
|
x = this,
|
|
c = x.c,
|
|
s = x.s,
|
|
e = x.e,
|
|
dp = DECIMAL_PLACES + 4,
|
|
half = new BigNumber('0.5');
|
|
|
|
// Negative/NaN/Infinity/zero?
|
|
if ( s !== 1 || !c || !c[0] ) {
|
|
return new BigNumber( !s || s < 0 && ( !c || c[0] ) ? NaN : c ? x : 1 / 0 );
|
|
}
|
|
|
|
// Initial estimate.
|
|
s = Math.sqrt( +x );
|
|
|
|
// Math.sqrt underflow/overflow?
|
|
// Pass x to Math.sqrt as integer, then adjust the exponent of the result.
|
|
if ( s == 0 || s == 1 / 0 ) {
|
|
n = coeffToString(c);
|
|
if ( ( n.length + e ) % 2 == 0 ) n += '0';
|
|
s = Math.sqrt(n);
|
|
e = bitFloor( ( e + 1 ) / 2 ) - ( e < 0 || e % 2 );
|
|
|
|
if ( s == 1 / 0 ) {
|
|
n = '1e' + e;
|
|
} else {
|
|
n = s.toExponential();
|
|
n = n.slice( 0, n.indexOf('e') + 1 ) + e;
|
|
}
|
|
|
|
r = new BigNumber(n);
|
|
} else {
|
|
r = new BigNumber( s + '' );
|
|
}
|
|
|
|
// Check for zero.
|
|
// r could be zero if MIN_EXP is changed after the this value was created.
|
|
// This would cause a division by zero (x/t) and hence Infinity below, which would cause
|
|
// coeffToString to throw.
|
|
if ( r.c[0] ) {
|
|
e = r.e;
|
|
s = e + dp;
|
|
if ( s < 3 ) s = 0;
|
|
|
|
// Newton-Raphson iteration.
|
|
for ( ; ; ) {
|
|
t = r;
|
|
r = half.times( t.plus( div( x, t, dp, 1 ) ) );
|
|
|
|
if ( coeffToString( t.c ).slice( 0, s ) === ( n =
|
|
coeffToString( r.c ) ).slice( 0, s ) ) {
|
|
|
|
// The exponent of r may here be one less than the final result exponent,
|
|
// e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits
|
|
// are indexed correctly.
|
|
if ( r.e < e ) --s;
|
|
n = n.slice( s - 3, s + 1 );
|
|
|
|
// The 4th rounding digit may be in error by -1 so if the 4 rounding digits
|
|
// are 9999 or 4999 (i.e. approaching a rounding boundary) continue the
|
|
// iteration.
|
|
if ( n == '9999' || !rep && n == '4999' ) {
|
|
|
|
// On the first iteration only, check to see if rounding up gives the
|
|
// exact result as the nines may infinitely repeat.
|
|
if ( !rep ) {
|
|
round( t, t.e + DECIMAL_PLACES + 2, 0 );
|
|
|
|
if ( t.times(t).eq(x) ) {
|
|
r = t;
|
|
break;
|
|
}
|
|
}
|
|
|
|
dp += 4;
|
|
s += 4;
|
|
rep = 1;
|
|
} else {
|
|
|
|
// If rounding digits are null, 0{0,4} or 50{0,3}, check for exact
|
|
// result. If not, then there are further digits and m will be truthy.
|
|
if ( !+n || !+n.slice(1) && n.charAt(0) == '5' ) {
|
|
|
|
// Truncate to the first rounding digit.
|
|
round( r, r.e + DECIMAL_PLACES + 2, 1 );
|
|
m = !r.times(r).eq(x);
|
|
}
|
|
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return round( r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m );
|
|
};
|
|
|
|
|
|
/*
|
|
* n * 0 = 0
|
|
* n * N = N
|
|
* n * I = I
|
|
* 0 * n = 0
|
|
* 0 * 0 = 0
|
|
* 0 * N = N
|
|
* 0 * I = N
|
|
* N * n = N
|
|
* N * 0 = N
|
|
* N * N = N
|
|
* N * I = N
|
|
* I * n = I
|
|
* I * 0 = N
|
|
* I * N = N
|
|
* I * I = I
|
|
*
|
|
* Return a new BigNumber whose value is the value of this BigNumber times the value of
|
|
* BigNumber(y, b).
|
|
*/
|
|
P.times = P.mul = function ( y, b ) {
|
|
var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,
|
|
base, sqrtBase,
|
|
x = this,
|
|
xc = x.c,
|
|
yc = ( id = 17, y = new BigNumber( y, b ) ).c;
|
|
|
|
// Either NaN, ±Infinity or ±0?
|
|
if ( !xc || !yc || !xc[0] || !yc[0] ) {
|
|
|
|
// Return NaN if either is NaN, or one is 0 and the other is Infinity.
|
|
if ( !x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc ) {
|
|
y.c = y.e = y.s = null;
|
|
} else {
|
|
y.s *= x.s;
|
|
|
|
// Return ±Infinity if either is ±Infinity.
|
|
if ( !xc || !yc ) {
|
|
y.c = y.e = null;
|
|
|
|
// Return ±0 if either is ±0.
|
|
} else {
|
|
y.c = [0];
|
|
y.e = 0;
|
|
}
|
|
}
|
|
|
|
return y;
|
|
}
|
|
|
|
e = bitFloor( x.e / LOG_BASE ) + bitFloor( y.e / LOG_BASE );
|
|
y.s *= x.s;
|
|
xcL = xc.length;
|
|
ycL = yc.length;
|
|
|
|
// Ensure xc points to longer array and xcL to its length.
|
|
if ( xcL < ycL ) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;
|
|
|
|
// Initialise the result array with zeros.
|
|
for ( i = xcL + ycL, zc = []; i--; zc.push(0) );
|
|
|
|
base = BASE;
|
|
sqrtBase = SQRT_BASE;
|
|
|
|
for ( i = ycL; --i >= 0; ) {
|
|
c = 0;
|
|
ylo = yc[i] % sqrtBase;
|
|
yhi = yc[i] / sqrtBase | 0;
|
|
|
|
for ( k = xcL, j = i + k; j > i; ) {
|
|
xlo = xc[--k] % sqrtBase;
|
|
xhi = xc[k] / sqrtBase | 0;
|
|
m = yhi * xlo + xhi * ylo;
|
|
xlo = ylo * xlo + ( ( m % sqrtBase ) * sqrtBase ) + zc[j] + c;
|
|
c = ( xlo / base | 0 ) + ( m / sqrtBase | 0 ) + yhi * xhi;
|
|
zc[j--] = xlo % base;
|
|
}
|
|
|
|
zc[j] = c;
|
|
}
|
|
|
|
if (c) {
|
|
++e;
|
|
} else {
|
|
zc.shift();
|
|
}
|
|
|
|
return normalise( y, zc, e );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber rounded to a maximum of
|
|
* sd significant digits using rounding mode rm, or ROUNDING_MODE if rm is omitted.
|
|
*
|
|
* [sd] {number} Significant digits. Integer, 1 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'toDigits() precision out of range: {sd}'
|
|
* 'toDigits() precision not an integer: {sd}'
|
|
* 'toDigits() rounding mode not an integer: {rm}'
|
|
* 'toDigits() rounding mode out of range: {rm}'
|
|
*/
|
|
P.toDigits = function ( sd, rm ) {
|
|
var n = new BigNumber(this);
|
|
sd = sd == null || !isValidInt( sd, 1, MAX, 18, 'precision' ) ? null : sd | 0;
|
|
rm = rm == null || !isValidInt( rm, 0, 8, 18, roundingMode ) ? ROUNDING_MODE : rm | 0;
|
|
return sd ? round( n, sd, rm ) : n;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of this BigNumber in exponential notation and
|
|
* rounded using ROUNDING_MODE to dp fixed decimal places.
|
|
*
|
|
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'toExponential() decimal places not an integer: {dp}'
|
|
* 'toExponential() decimal places out of range: {dp}'
|
|
* 'toExponential() rounding mode not an integer: {rm}'
|
|
* 'toExponential() rounding mode out of range: {rm}'
|
|
*/
|
|
P.toExponential = function ( dp, rm ) {
|
|
return format( this,
|
|
dp != null && isValidInt( dp, 0, MAX, 19 ) ? ~~dp + 1 : null, rm, 19 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of this BigNumber in fixed-point notation rounding
|
|
* to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.
|
|
*
|
|
* Note: as with JavaScript's number type, (-0).toFixed(0) is '0',
|
|
* but e.g. (-0.00001).toFixed(0) is '-0'.
|
|
*
|
|
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'toFixed() decimal places not an integer: {dp}'
|
|
* 'toFixed() decimal places out of range: {dp}'
|
|
* 'toFixed() rounding mode not an integer: {rm}'
|
|
* 'toFixed() rounding mode out of range: {rm}'
|
|
*/
|
|
P.toFixed = function ( dp, rm ) {
|
|
return format( this, dp != null && isValidInt( dp, 0, MAX, 20 )
|
|
? ~~dp + this.e + 1 : null, rm, 20 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of this BigNumber in fixed-point notation rounded
|
|
* using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties
|
|
* of the FORMAT object (see BigNumber.config).
|
|
*
|
|
* FORMAT = {
|
|
* decimalSeparator : '.',
|
|
* groupSeparator : ',',
|
|
* groupSize : 3,
|
|
* secondaryGroupSize : 0,
|
|
* fractionGroupSeparator : '\xA0', // non-breaking space
|
|
* fractionGroupSize : 0
|
|
* };
|
|
*
|
|
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'toFormat() decimal places not an integer: {dp}'
|
|
* 'toFormat() decimal places out of range: {dp}'
|
|
* 'toFormat() rounding mode not an integer: {rm}'
|
|
* 'toFormat() rounding mode out of range: {rm}'
|
|
*/
|
|
P.toFormat = function ( dp, rm ) {
|
|
var str = format( this, dp != null && isValidInt( dp, 0, MAX, 21 )
|
|
? ~~dp + this.e + 1 : null, rm, 21 );
|
|
|
|
if ( this.c ) {
|
|
var i,
|
|
arr = str.split('.'),
|
|
g1 = +FORMAT.groupSize,
|
|
g2 = +FORMAT.secondaryGroupSize,
|
|
groupSeparator = FORMAT.groupSeparator,
|
|
intPart = arr[0],
|
|
fractionPart = arr[1],
|
|
isNeg = this.s < 0,
|
|
intDigits = isNeg ? intPart.slice(1) : intPart,
|
|
len = intDigits.length;
|
|
|
|
if (g2) i = g1, g1 = g2, g2 = i, len -= i;
|
|
|
|
if ( g1 > 0 && len > 0 ) {
|
|
i = len % g1 || g1;
|
|
intPart = intDigits.substr( 0, i );
|
|
|
|
for ( ; i < len; i += g1 ) {
|
|
intPart += groupSeparator + intDigits.substr( i, g1 );
|
|
}
|
|
|
|
if ( g2 > 0 ) intPart += groupSeparator + intDigits.slice(i);
|
|
if (isNeg) intPart = '-' + intPart;
|
|
}
|
|
|
|
str = fractionPart
|
|
? intPart + FORMAT.decimalSeparator + ( ( g2 = +FORMAT.fractionGroupSize )
|
|
? fractionPart.replace( new RegExp( '\\d{' + g2 + '}\\B', 'g' ),
|
|
'$&' + FORMAT.fractionGroupSeparator )
|
|
: fractionPart )
|
|
: intPart;
|
|
}
|
|
|
|
return str;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string array representing the value of this BigNumber as a simple fraction with
|
|
* an integer numerator and an integer denominator. The denominator will be a positive
|
|
* non-zero value less than or equal to the specified maximum denominator. If a maximum
|
|
* denominator is not specified, the denominator will be the lowest value necessary to
|
|
* represent the number exactly.
|
|
*
|
|
* [md] {number|string|BigNumber} Integer >= 1 and < Infinity. The maximum denominator.
|
|
*
|
|
* 'toFraction() max denominator not an integer: {md}'
|
|
* 'toFraction() max denominator out of range: {md}'
|
|
*/
|
|
P.toFraction = function (md) {
|
|
var arr, d0, d2, e, exp, n, n0, q, s,
|
|
k = ERRORS,
|
|
x = this,
|
|
xc = x.c,
|
|
d = new BigNumber(ONE),
|
|
n1 = d0 = new BigNumber(ONE),
|
|
d1 = n0 = new BigNumber(ONE);
|
|
|
|
if ( md != null ) {
|
|
ERRORS = false;
|
|
n = new BigNumber(md);
|
|
ERRORS = k;
|
|
|
|
if ( !( k = n.isInt() ) || n.lt(ONE) ) {
|
|
|
|
if (ERRORS) {
|
|
raise( 22,
|
|
'max denominator ' + ( k ? 'out of range' : 'not an integer' ), md );
|
|
}
|
|
|
|
// ERRORS is false:
|
|
// If md is a finite non-integer >= 1, round it to an integer and use it.
|
|
md = !k && n.c && round( n, n.e + 1, 1 ).gte(ONE) ? n : null;
|
|
}
|
|
}
|
|
|
|
if ( !xc ) return x.toString();
|
|
s = coeffToString(xc);
|
|
|
|
// Determine initial denominator.
|
|
// d is a power of 10 and the minimum max denominator that specifies the value exactly.
|
|
e = d.e = s.length - x.e - 1;
|
|
d.c[0] = POWS_TEN[ ( exp = e % LOG_BASE ) < 0 ? LOG_BASE + exp : exp ];
|
|
md = !md || n.cmp(d) > 0 ? ( e > 0 ? d : n1 ) : n;
|
|
|
|
exp = MAX_EXP;
|
|
MAX_EXP = 1 / 0;
|
|
n = new BigNumber(s);
|
|
|
|
// n0 = d1 = 0
|
|
n0.c[0] = 0;
|
|
|
|
for ( ; ; ) {
|
|
q = div( n, d, 0, 1 );
|
|
d2 = d0.plus( q.times(d1) );
|
|
if ( d2.cmp(md) == 1 ) break;
|
|
d0 = d1;
|
|
d1 = d2;
|
|
n1 = n0.plus( q.times( d2 = n1 ) );
|
|
n0 = d2;
|
|
d = n.minus( q.times( d2 = d ) );
|
|
n = d2;
|
|
}
|
|
|
|
d2 = div( md.minus(d0), d1, 0, 1 );
|
|
n0 = n0.plus( d2.times(n1) );
|
|
d0 = d0.plus( d2.times(d1) );
|
|
n0.s = n1.s = x.s;
|
|
e *= 2;
|
|
|
|
// Determine which fraction is closer to x, n0/d0 or n1/d1
|
|
arr = div( n1, d1, e, ROUNDING_MODE ).minus(x).abs().cmp(
|
|
div( n0, d0, e, ROUNDING_MODE ).minus(x).abs() ) < 1
|
|
? [ n1.toString(), d1.toString() ]
|
|
: [ n0.toString(), d0.toString() ];
|
|
|
|
MAX_EXP = exp;
|
|
return arr;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return the value of this BigNumber converted to a number primitive.
|
|
*/
|
|
P.toNumber = function () {
|
|
var x = this;
|
|
|
|
// Ensure zero has correct sign.
|
|
return +x || ( x.s ? x.s * 0 : NaN );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a BigNumber whose value is the value of this BigNumber raised to the power n.
|
|
* If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.
|
|
* If POW_PRECISION is not 0, round to POW_PRECISION using ROUNDING_MODE.
|
|
*
|
|
* n {number} Integer, -9007199254740992 to 9007199254740992 inclusive.
|
|
* (Performs 54 loop iterations for n of 9007199254740992.)
|
|
*
|
|
* 'pow() exponent not an integer: {n}'
|
|
* 'pow() exponent out of range: {n}'
|
|
*/
|
|
P.toPower = P.pow = function (n) {
|
|
var k, y,
|
|
i = mathfloor( n < 0 ? -n : +n ),
|
|
x = this;
|
|
|
|
// Pass ±Infinity to Math.pow if exponent is out of range.
|
|
if ( !isValidInt( n, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER, 23, 'exponent' ) &&
|
|
( !isFinite(n) || i > MAX_SAFE_INTEGER && ( n /= 0 ) ||
|
|
parseFloat(n) != n && !( n = NaN ) ) ) {
|
|
return new BigNumber( Math.pow( +x, n ) );
|
|
}
|
|
|
|
// Truncating each coefficient array to a length of k after each multiplication equates
|
|
// to truncating significant digits to POW_PRECISION + [28, 41], i.e. there will be a
|
|
// minimum of 28 guard digits retained. (Using + 1.5 would give [9, 21] guard digits.)
|
|
k = POW_PRECISION ? mathceil( POW_PRECISION / LOG_BASE + 2 ) : 0;
|
|
y = new BigNumber(ONE);
|
|
|
|
for ( ; ; ) {
|
|
|
|
if ( i % 2 ) {
|
|
y = y.times(x);
|
|
if ( !y.c ) break;
|
|
if ( k && y.c.length > k ) y.c.length = k;
|
|
}
|
|
|
|
i = mathfloor( i / 2 );
|
|
if ( !i ) break;
|
|
|
|
x = x.times(x);
|
|
if ( k && x.c && x.c.length > k ) x.c.length = k;
|
|
}
|
|
|
|
if ( n < 0 ) y = ONE.div(y);
|
|
return k ? round( y, POW_PRECISION, ROUNDING_MODE ) : y;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of this BigNumber rounded to sd significant digits
|
|
* using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits
|
|
* necessary to represent the integer part of the value in fixed-point notation, then use
|
|
* exponential notation.
|
|
*
|
|
* [sd] {number} Significant digits. Integer, 1 to MAX inclusive.
|
|
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
|
|
*
|
|
* 'toPrecision() precision not an integer: {sd}'
|
|
* 'toPrecision() precision out of range: {sd}'
|
|
* 'toPrecision() rounding mode not an integer: {rm}'
|
|
* 'toPrecision() rounding mode out of range: {rm}'
|
|
*/
|
|
P.toPrecision = function ( sd, rm ) {
|
|
return format( this, sd != null && isValidInt( sd, 1, MAX, 24, 'precision' )
|
|
? sd | 0 : null, rm, 24 );
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a string representing the value of this BigNumber in base b, or base 10 if b is
|
|
* omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and
|
|
* ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent
|
|
* that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than
|
|
* TO_EXP_NEG, return exponential notation.
|
|
*
|
|
* [b] {number} Integer, 2 to 64 inclusive.
|
|
*
|
|
* 'toString() base not an integer: {b}'
|
|
* 'toString() base out of range: {b}'
|
|
*/
|
|
P.toString = function (b) {
|
|
var str,
|
|
n = this,
|
|
s = n.s,
|
|
e = n.e;
|
|
|
|
// Infinity or NaN?
|
|
if ( e === null ) {
|
|
|
|
if (s) {
|
|
str = 'Infinity';
|
|
if ( s < 0 ) str = '-' + str;
|
|
} else {
|
|
str = 'NaN';
|
|
}
|
|
} else {
|
|
str = coeffToString( n.c );
|
|
|
|
if ( b == null || !isValidInt( b, 2, 64, 25, 'base' ) ) {
|
|
str = e <= TO_EXP_NEG || e >= TO_EXP_POS
|
|
? toExponential( str, e )
|
|
: toFixedPoint( str, e );
|
|
} else {
|
|
str = convertBase( toFixedPoint( str, e ), b | 0, 10, s );
|
|
}
|
|
|
|
if ( s < 0 && n.c[0] ) str = '-' + str;
|
|
}
|
|
|
|
return str;
|
|
};
|
|
|
|
|
|
/*
|
|
* Return a new BigNumber whose value is the value of this BigNumber truncated to a whole
|
|
* number.
|
|
*/
|
|
P.truncated = P.trunc = function () {
|
|
return round( new BigNumber(this), this.e + 1, 1 );
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
* Return as toString, but do not accept a base argument.
|
|
*/
|
|
P.valueOf = P.toJSON = function () {
|
|
return this.toString();
|
|
};
|
|
|
|
|
|
// Aliases for BigDecimal methods.
|
|
//P.add = P.plus; // P.add included above
|
|
//P.subtract = P.minus; // P.sub included above
|
|
//P.multiply = P.times; // P.mul included above
|
|
//P.divide = P.div;
|
|
//P.remainder = P.mod;
|
|
//P.compareTo = P.cmp;
|
|
//P.negate = P.neg;
|
|
|
|
|
|
if ( configObj != null ) BigNumber.config(configObj);
|
|
|
|
return BigNumber;
|
|
}
|
|
|
|
|
|
// PRIVATE HELPER FUNCTIONS
|
|
|
|
|
|
function bitFloor(n) {
|
|
var i = n | 0;
|
|
return n > 0 || n === i ? i : i - 1;
|
|
}
|
|
|
|
|
|
// Return a coefficient array as a string of base 10 digits.
|
|
function coeffToString(a) {
|
|
var s, z,
|
|
i = 1,
|
|
j = a.length,
|
|
r = a[0] + '';
|
|
|
|
for ( ; i < j; ) {
|
|
s = a[i++] + '';
|
|
z = LOG_BASE - s.length;
|
|
for ( ; z--; s = '0' + s );
|
|
r += s;
|
|
}
|
|
|
|
// Determine trailing zeros.
|
|
for ( j = r.length; r.charCodeAt(--j) === 48; );
|
|
return r.slice( 0, j + 1 || 1 );
|
|
}
|
|
|
|
|
|
// Compare the value of BigNumbers x and y.
|
|
function compare( x, y ) {
|
|
var a, b,
|
|
xc = x.c,
|
|
yc = y.c,
|
|
i = x.s,
|
|
j = y.s,
|
|
k = x.e,
|
|
l = y.e;
|
|
|
|
// Either NaN?
|
|
if ( !i || !j ) return null;
|
|
|
|
a = xc && !xc[0];
|
|
b = yc && !yc[0];
|
|
|
|
// Either zero?
|
|
if ( a || b ) return a ? b ? 0 : -j : i;
|
|
|
|
// Signs differ?
|
|
if ( i != j ) return i;
|
|
|
|
a = i < 0;
|
|
b = k == l;
|
|
|
|
// Either Infinity?
|
|
if ( !xc || !yc ) return b ? 0 : !xc ^ a ? 1 : -1;
|
|
|
|
// Compare exponents.
|
|
if ( !b ) return k > l ^ a ? 1 : -1;
|
|
|
|
j = ( k = xc.length ) < ( l = yc.length ) ? k : l;
|
|
|
|
// Compare digit by digit.
|
|
for ( i = 0; i < j; i++ ) if ( xc[i] != yc[i] ) return xc[i] > yc[i] ^ a ? 1 : -1;
|
|
|
|
// Compare lengths.
|
|
return k == l ? 0 : k > l ^ a ? 1 : -1;
|
|
}
|
|
|
|
|
|
/*
|
|
* Return true if n is a valid number in range, otherwise false.
|
|
* Use for argument validation when ERRORS is false.
|
|
* Note: parseInt('1e+1') == 1 but parseFloat('1e+1') == 10.
|
|
*/
|
|
function intValidatorNoErrors( n, min, max ) {
|
|
return ( n = truncate(n) ) >= min && n <= max;
|
|
}
|
|
|
|
|
|
function isArray(obj) {
|
|
return Object.prototype.toString.call(obj) == '[object Array]';
|
|
}
|
|
|
|
|
|
/*
|
|
* Convert string of baseIn to an array of numbers of baseOut.
|
|
* Eg. convertBase('255', 10, 16) returns [15, 15].
|
|
* Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
|
|
*/
|
|
function toBaseOut( str, baseIn, baseOut ) {
|
|
var j,
|
|
arr = [0],
|
|
arrL,
|
|
i = 0,
|
|
len = str.length;
|
|
|
|
for ( ; i < len; ) {
|
|
for ( arrL = arr.length; arrL--; arr[arrL] *= baseIn );
|
|
arr[ j = 0 ] += ALPHABET.indexOf( str.charAt( i++ ) );
|
|
|
|
for ( ; j < arr.length; j++ ) {
|
|
|
|
if ( arr[j] > baseOut - 1 ) {
|
|
if ( arr[j + 1] == null ) arr[j + 1] = 0;
|
|
arr[j + 1] += arr[j] / baseOut | 0;
|
|
arr[j] %= baseOut;
|
|
}
|
|
}
|
|
}
|
|
|
|
return arr.reverse();
|
|
}
|
|
|
|
|
|
function toExponential( str, e ) {
|
|
return ( str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str ) +
|
|
( e < 0 ? 'e' : 'e+' ) + e;
|
|
}
|
|
|
|
|
|
function toFixedPoint( str, e ) {
|
|
var len, z;
|
|
|
|
// Negative exponent?
|
|
if ( e < 0 ) {
|
|
|
|
// Prepend zeros.
|
|
for ( z = '0.'; ++e; z += '0' );
|
|
str = z + str;
|
|
|
|
// Positive exponent
|
|
} else {
|
|
len = str.length;
|
|
|
|
// Append zeros.
|
|
if ( ++e > len ) {
|
|
for ( z = '0', e -= len; --e; z += '0' );
|
|
str += z;
|
|
} else if ( e < len ) {
|
|
str = str.slice( 0, e ) + '.' + str.slice(e);
|
|
}
|
|
}
|
|
|
|
return str;
|
|
}
|
|
|
|
|
|
function truncate(n) {
|
|
n = parseFloat(n);
|
|
return n < 0 ? mathceil(n) : mathfloor(n);
|
|
}
|
|
|
|
|
|
// EXPORT
|
|
|
|
|
|
BigNumber = another();
|
|
|
|
// AMD.
|
|
if ( typeof define == 'function' && define.amd ) {
|
|
define( function () { return BigNumber; } );
|
|
|
|
// Node and other environments that support module.exports.
|
|
} else if ( typeof module != 'undefined' && module.exports ) {
|
|
module.exports = BigNumber;
|
|
if ( !crypto ) try { crypto = require('crypto'); } catch (e) {}
|
|
|
|
// Browser.
|
|
} else {
|
|
global.BigNumber = BigNumber;
|
|
}
|
|
})(this);
|
|
|
|
},{"crypto":31}],"web3":[function(require,module,exports){
|
|
var web3 = require('./lib/web3');
|
|
web3.providers.HttpProvider = require('./lib/web3/httpprovider');
|
|
web3.providers.QtSyncProvider = require('./lib/web3/qtsync');
|
|
web3.eth.contract = require('./lib/web3/contract');
|
|
web3.eth.namereg = require('./lib/web3/namereg');
|
|
web3.eth.sendIBANTransaction = require('./lib/web3/transfer');
|
|
|
|
// dont override global variable
|
|
if (typeof window !== 'undefined' && typeof window.web3 === 'undefined') {
|
|
window.web3 = web3;
|
|
}
|
|
|
|
module.exports = web3;
|
|
|
|
|
|
},{"./lib/web3":9,"./lib/web3/contract":11,"./lib/web3/httpprovider":19,"./lib/web3/namereg":23,"./lib/web3/qtsync":26,"./lib/web3/transfer":29}]},{},["web3"])
|
|
|
|
|
|
//# sourceMappingURL=web3.js.map
|
|
` |