diff --git a/libnatspec/natspecjs/.gitignore b/libnatspec/natspecjs/.gitignore new file mode 100644 index 000000000..95b26b70d --- /dev/null +++ b/libnatspec/natspecjs/.gitignore @@ -0,0 +1,3 @@ +# VIM stuff +*.swp +node_modules/ diff --git a/libnatspec/natspecjs/.travis.yml b/libnatspec/natspecjs/.travis.yml new file mode 100644 index 000000000..dca4078ce --- /dev/null +++ b/libnatspec/natspecjs/.travis.yml @@ -0,0 +1,8 @@ +language: node_js +node_js: + - "0.11" + - "0.10" +before_script: + - npm install +after_script: + - npm run-script test-coveralls diff --git a/libnatspec/natspecjs/README.md b/libnatspec/natspecjs/README.md new file mode 100644 index 000000000..63f08e47a --- /dev/null +++ b/libnatspec/natspecjs/README.md @@ -0,0 +1,47 @@ +# natspec.js +Javascript Library used to evaluate natspec expressions + +[![Build Status][travis-image]][travis-url] [![Coverage Status][coveralls-image]][coveralls-url] + +[travis-image]: https://travis-ci.org/ethereum/natspec.js.svg +[travis-url]: https://travis-ci.org/ethereum/natspec.js +[coveralls-image]: https://coveralls.io/repos/ethereum/natspec.js/badge.svg?branch=master +[coveralls-url]: https://coveralls.io/r/ethereum/natspec.js?branch=master + +## Usage + +It exposes global object `natspec` with method `evaluateExpression`. + +```javascript +var natspec = require('natspec'); + +var natspecExpression = "Will multiply `a` by 7 and return `a * 7`."; +var call = { + method: 'multiply', + abi: abi, + transaction: transaction +}; + +var evaluatedExpression = natspec.evaluateExpression(natspecExpression, call); +console.log(evaluatedExpression); // "Will multiply 4 by 7 and return 28." +``` + +More examples are available [here](https://github.com/ethereum/natspec.js/blob/master/test/test.js). + +## Building + +```bash +npm run-script build +``` + +## Testing (mocha) + +```bash +npm test +``` + +## Wiki + +* [Ethereum Natural Specification Format](https://github.com/ethereum/wiki/wiki/Ethereum-Natural-Specification-Format) +* [Natspec Example](https://github.com/ethereum/wiki/wiki/Natspec-Example) + diff --git a/libnatspec/natspecjs/dist/natspec.js b/libnatspec/natspecjs/dist/natspec.js new file mode 100644 index 000000000..a2256414b --- /dev/null +++ b/libnatspec/natspecjs/dist/natspec.js @@ -0,0 +1,3570 @@ +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. +*/ +/** @file abi.js + * @authors: + * Marek Kotewicz + * Gav Wood + * @date 2014 + */ + +var utils = require('./utils'); +var types = require('./types'); +var c = require('./const'); +var f = require('./formatters'); + +var displayTypeError = function (type) { + console.error('parser does not support type: ' + type); +}; + +/// This method should be called if we want to check if givent type is an array type +/// @returns true if it is, otherwise false +var arrayType = function (type) { + return type.slice(-2) === '[]'; +}; + +var dynamicTypeBytes = function (type, value) { + // TODO: decide what to do with array of strings + if (arrayType(type) || type === 'string') // only string itself that is dynamic; stringX is static length. + return f.formatInputInt(value.length); + return ""; +}; + +var inputTypes = types.inputTypes(); + +/// Formats input params to bytes +/// @param abi contract method inputs +/// @param array of params that will be formatted to bytes +/// @returns bytes representation of input params +var formatInput = function (inputs, params) { + var bytes = ""; + var toAppendConstant = ""; + var toAppendArrayContent = ""; + + /// first we iterate in search for dynamic + inputs.forEach(function (input, index) { + bytes += dynamicTypeBytes(input.type, params[index]); + }); + + inputs.forEach(function (input, i) { + /*jshint maxcomplexity:5 */ + var typeMatch = false; + for (var j = 0; j < inputTypes.length && !typeMatch; j++) { + typeMatch = inputTypes[j].type(inputs[i].type, params[i]); + } + if (!typeMatch) { + displayTypeError(inputs[i].type); + } + + var formatter = inputTypes[j - 1].format; + + if (arrayType(inputs[i].type)) + toAppendArrayContent += params[i].reduce(function (acc, curr) { + return acc + formatter(curr); + }, ""); + else if (inputs[i].type === 'string') + toAppendArrayContent += formatter(params[i]); + else + toAppendConstant += formatter(params[i]); + }); + + bytes += toAppendConstant + toAppendArrayContent; + + return bytes; +}; + +var dynamicBytesLength = function (type) { + if (arrayType(type) || type === 'string') // only string itself that is dynamic; stringX is static length. + return c.ETH_PADDING * 2; + return 0; +}; + +var outputTypes = types.outputTypes(); + +/// Formats output bytes back to param list +/// @param contract abi method outputs +/// @param bytes representtion of output +/// @returns array of output params +var formatOutput = function (outs, output) { + + output = output.slice(2); + var result = []; + var padding = c.ETH_PADDING * 2; + + var dynamicPartLength = outs.reduce(function (acc, curr) { + return acc + dynamicBytesLength(curr.type); + }, 0); + + var dynamicPart = output.slice(0, dynamicPartLength); + output = output.slice(dynamicPartLength); + + outs.forEach(function (out, i) { + /*jshint maxcomplexity:6 */ + var typeMatch = false; + for (var j = 0; j < outputTypes.length && !typeMatch; j++) { + typeMatch = outputTypes[j].type(outs[i].type); + } + + if (!typeMatch) { + displayTypeError(outs[i].type); + } + + var formatter = outputTypes[j - 1].format; + if (arrayType(outs[i].type)) { + var size = f.formatOutputUInt(dynamicPart.slice(0, padding)); + dynamicPart = dynamicPart.slice(padding); + var array = []; + for (var k = 0; k < size; k++) { + array.push(formatter(output.slice(0, padding))); + output = output.slice(padding); + } + result.push(array); + } + else if (types.prefixedType('string')(outs[i].type)) { + dynamicPart = dynamicPart.slice(padding); + result.push(formatter(output.slice(0, padding))); + output = output.slice(padding); + } else { + result.push(formatter(output.slice(0, padding))); + output = output.slice(padding); + } + }); + + return result; +}; + +/// @param json abi for contract +/// @returns input parser object for given json abi +/// TODO: refactor creating the parser, do not double logic from contract +var inputParser = function (json) { + var parser = {}; + json.forEach(function (method) { + var displayName = utils.extractDisplayName(method.name); + var typeName = utils.extractTypeName(method.name); + + var impl = function () { + var params = Array.prototype.slice.call(arguments); + return formatInput(method.inputs, params); + }; + + if (parser[displayName] === undefined) { + parser[displayName] = impl; + } + + parser[displayName][typeName] = impl; + }); + + return parser; +}; + +/// @param json abi for contract +/// @returns output parser for given json abi +var outputParser = function (json) { + var parser = {}; + json.forEach(function (method) { + + var displayName = utils.extractDisplayName(method.name); + var typeName = utils.extractTypeName(method.name); + + var impl = function (output) { + return formatOutput(method.outputs, output); + }; + + if (parser[displayName] === undefined) { + parser[displayName] = impl; + } + + parser[displayName][typeName] = impl; + }); + + return parser; +}; + +module.exports = { + inputParser: inputParser, + outputParser: outputParser, + formatInput: formatInput, + formatOutput: formatOutput +}; + +},{"./const":4,"./formatters":5,"./types":6,"./utils":7}],4:[function(require,module,exports){ +(function (process){ +/* + 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 . +*/ +/** @file const.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +/// required to define ETH_BIGNUMBER_ROUNDING_MODE +if (process.env.NODE_ENV !== 'build') { + var BigNumber = require('bignumber.js'); // jshint ignore:line +} + +var ETH_UNITS = [ + 'wei', + 'Kwei', + 'Mwei', + 'Gwei', + 'szabo', + 'finney', + '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 +}; + + +}).call(this,require('_process')) +},{"_process":2,"bignumber.js":8}],5:[function(require,module,exports){ +(function (process){ +/* + 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 . +*/ +/** @file formatters.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +if (process.env.NODE_ENV !== 'build') { + var BigNumber = require('bignumber.js'); // jshint ignore:line +} + +var utils = require('./utils'); +var c = require('./const'); + +/// @param string string to be padded +/// @param number of characters that result string should have +/// @param sign, by default 0 +/// @returns right aligned string +var padLeft = function (string, chars, sign) { + return new Array(chars - string.length + 1).join(sign ? sign : "0") + string; +}; + +/// 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 +/// @returns right-aligned byte representation of int +var formatInputInt = function (value) { + /*jshint maxcomplexity:7 */ + var padding = c.ETH_PADDING * 2; + if (value instanceof BigNumber || typeof value === 'number') { + if (typeof value === 'number') + value = new BigNumber(value); + BigNumber.config(c.ETH_BIGNUMBER_ROUNDING_MODE); + value = value.round(); + + if (value.lessThan(0)) + value = new BigNumber("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff", 16).plus(value).plus(1); + value = value.toString(16); + } + else if (value.indexOf('0x') === 0) + value = value.substr(2); + else if (typeof value === 'string') + value = formatInputInt(new BigNumber(value)); + else + value = (+value).toString(16); + return padLeft(value, padding); +}; + +/// Formats input value to byte representation of string +/// @returns left-algined byte representation of string +var formatInputString = function (value) { + return utils.fromAscii(value, c.ETH_PADDING).substr(2); +}; + +/// Formats input value to byte representation of bool +/// @returns right-aligned byte representation bool +var formatInputBool = function (value) { + return '000000000000000000000000000000000000000000000000000000000000000' + (value ? '1' : '0'); +}; + +/// Formats input value to byte representation of real +/// Values are multiplied by 2^m and encoded as integers +/// @returns byte representation of real +var formatInputReal = function (value) { + return formatInputInt(new BigNumber(value).times(new BigNumber(2).pow(128))); +}; + + +/// Check if input value is negative +/// @param value is hex format +/// @returns 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 input right-aligned input bytes to int +/// @returns right-aligned input bytes formatted to int +var formatOutputInt = function (value) { + value = value || "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 big right-aligned input bytes to uint +/// @returns right-aligned input bytes formatted to uint +var formatOutputUInt = function (value) { + value = value || "0"; + return new BigNumber(value, 16); +}; + +/// @returns input bytes formatted to real +var formatOutputReal = function (value) { + return formatOutputInt(value).dividedBy(new BigNumber(2).pow(128)); +}; + +/// @returns input bytes formatted to ureal +var formatOutputUReal = function (value) { + return formatOutputUInt(value).dividedBy(new BigNumber(2).pow(128)); +}; + +/// @returns right-aligned input bytes formatted to hex +var formatOutputHash = function (value) { + return "0x" + value; +}; + +/// @returns right-aligned input bytes formatted to bool +var formatOutputBool = function (value) { + return value === '0000000000000000000000000000000000000000000000000000000000000001' ? true : false; +}; + +/// @returns left-aligned input bytes formatted to ascii string +var formatOutputString = function (value) { + return utils.toAscii(value); +}; + +/// @returns right-aligned input bytes formatted to address +var formatOutputAddress = function (value) { + return "0x" + value.slice(value.length - 40, value.length); +}; + + +module.exports = { + formatInputInt: formatInputInt, + formatInputString: formatInputString, + formatInputBool: formatInputBool, + formatInputReal: formatInputReal, + formatOutputInt: formatOutputInt, + formatOutputUInt: formatOutputUInt, + formatOutputReal: formatOutputReal, + formatOutputUReal: formatOutputUReal, + formatOutputHash: formatOutputHash, + formatOutputBool: formatOutputBool, + formatOutputString: formatOutputString, + formatOutputAddress: formatOutputAddress +}; + + +}).call(this,require('_process')) +},{"./const":4,"./utils":7,"_process":2,"bignumber.js":8}],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 . +*/ +/** @file types.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +var f = require('./formatters'); + +/// @param expected type prefix (string) +/// @returns function which checks if type has matching prefix. if yes, returns true, otherwise false +var prefixedType = function (prefix) { + return function (type) { + return type.indexOf(prefix) === 0; + }; +}; + +/// @param expected type name (string) +/// @returns function which checks if type is matching expected one. if yes, returns true, otherwise false +var namedType = function (name) { + return function (type) { + return name === type; + }; +}; + +/// Setups input formatters for solidity types +/// @returns an array of input formatters +var inputTypes = function () { + + return [ + { type: prefixedType('uint'), format: f.formatInputInt }, + { type: prefixedType('int'), format: f.formatInputInt }, + { type: prefixedType('hash'), format: f.formatInputInt }, + { type: prefixedType('string'), format: f.formatInputString }, + { type: prefixedType('real'), format: f.formatInputReal }, + { type: prefixedType('ureal'), format: f.formatInputReal }, + { type: namedType('address'), format: f.formatInputInt }, + { type: namedType('bool'), format: f.formatInputBool } + ]; +}; + +/// Setups output formaters for solidity types +/// @returns an array of output formatters +var outputTypes = function () { + + return [ + { type: prefixedType('uint'), format: f.formatOutputUInt }, + { type: prefixedType('int'), format: f.formatOutputInt }, + { type: prefixedType('hash'), format: f.formatOutputHash }, + { type: prefixedType('string'), format: f.formatOutputString }, + { type: prefixedType('real'), format: f.formatOutputReal }, + { type: prefixedType('ureal'), format: f.formatOutputUReal }, + { type: namedType('address'), format: f.formatOutputAddress }, + { type: namedType('bool'), format: f.formatOutputBool } + ]; +}; + +module.exports = { + prefixedType: prefixedType, + namedType: namedType, + inputTypes: inputTypes, + outputTypes: outputTypes +}; + + +},{"./formatters":5}],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 . +*/ +/** @file utils.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +var c = require('./const'); + +/// Finds first index of array element matching pattern +/// @param array +/// @param callback pattern +/// @returns index of element +var findIndex = function (array, callback) { + var end = false; + var i = 0; + for (; i < array.length && !end; i++) { + end = callback(array[i]); + } + return end ? i - 1 : -1; +}; + +/// @returns ascii string representation of hex value prefixed with 0x +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; +}; + +var toHex = 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; +}; + +/// @returns hex representation (prefixed by 0x) of ascii string +var fromAscii = function(str, pad) { + pad = pad === undefined ? 0 : pad; + var hex = toHex(str); + while (hex.length < pad*2) + hex += "00"; + return "0x" + hex; +}; + +/// @returns 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(' ', '') : ""; +}; + +/// Filters all function from input abi +/// @returns abi array with filtered objects of type 'function' +var filterFunctions = function (json) { + return json.filter(function (current) { + return current.type === 'function'; + }); +}; + +/// Filters all events form input abi +/// @returns abi array with filtered objects of type 'event' +var filterEvents = function (json) { + return json.filter(function (current) { + return current.type === 'event'; + }); +}; + +/// used to transform value/string to eth string +/// TODO: use BigNumber.js to parse int +/// TODO: add tests for it! +var toEth = function (str) { + /*jshint maxcomplexity:7 */ + var val = typeof str === "string" ? str.indexOf('0x') === 0 ? parseInt(str.substr(2), 16) : parseInt(str) : str; + var unit = 0; + var units = c.ETH_UNITS; + while (val > 3000 && unit < units.length - 1) + { + val /= 1000; + unit++; + } + var s = val.toString().length < val.toFixed(2).length ? val.toString() : val.toFixed(2); + var replaceFunction = function($0, $1, $2) { + return $1 + ',' + $2; + }; + + while (true) { + var o = s; + s = s.replace(/(\d)(\d\d\d[\.\,])/, replaceFunction); + if (o === s) + break; + } + return s + ' ' + units[unit]; +}; + +module.exports = { + findIndex: findIndex, + toAscii: toAscii, + fromAscii: fromAscii, + extractDisplayName: extractDisplayName, + extractTypeName: extractTypeName, + filterFunctions: filterFunctions, + filterEvents: filterEvents, + toEth: toEth +}; + + +},{"./const":4}],8:[function(require,module,exports){ +/*! bignumber.js v2.0.3 https://github.com/MikeMcl/bignumber.js/LICENCE */ + +;(function (global) { + 'use strict'; + + /* + bignumber.js v2.0.3 + A JavaScript library for arbitrary-precision arithmetic. + https://github.com/MikeMcl/bignumber.js + Copyright (c) 2015 Michael Mclaughlin + 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 ) ); + + 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++; + + 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 ) { + 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. + cmp = compare( prod, rem, prodL, remL ); + + // product > remainder. + if ( cmp == 1 ) { + n--; + + // Subtract divisor from product. + subtract( prod, yL < prodL ? yz : yc, prodL, base ); + } + } else { + + // 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, compare yc and rem again below. + if ( n == 0 ) cmp = n = 1; + prod = yc.slice(); + } + + prodL = prod.length; + if ( prodL < remL ) prod.unshift(0); + + // Subtract product from remainder. + subtract( rem, prod, remL, base ); + + // If product was < previous remainder. + if ( cmp == -1 ) { + remL = rem.length; + + // Compare divisor and new remainder. + cmp = compare( yc, rem, yL, remL ); + + // If divisor < new remainder, subtract divisor from remainder. + if ( cmp < 1 ) { + n++; + + // Subtract divisor from remainder. + subtract( rem, yL < remL ? yz : yc, remL, base ); + } + } + remL = rem.length; + } else if ( cmp === 0 ) { + n++; + rem = [0]; + } + // if cmp === 1, n will be 0 + + // Add the next digit, n, to the result array. + qc[i++] = n; + + // Update the remainder. + if ( cmp && 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])(?=\w[\w.]*$)/i, + dotAfter = /^([^.]+)\.$/, + dotBefore = /^\.([^.]+)$/, + isInfinityOrNaN = /^-?(Infinity|NaN)$/, + whitespaceOrPlus = /^\s*\+(?=[\w.])|^\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":1}],"natspec":[function(require,module,exports){ +/* + This file is part of natspec.js. + + natspec.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. + + natspec.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 natspec.js. If not, see . +*/ +/** @file natspec.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +var abi = require('./node_modules/ethereum.js/lib/abi.js'); + +/** + * This object should be used to evaluate natspec expression + * It has one method evaluateExpression which shoul be used + */ +var natspec = (function () { + /** + * Helper method + * Should be called to copy values from object to global context + * + * @method copyToContext + * @param {Object} object from which we want to copy properties + * @param {Object} object to which we copy + */ + var copyToContext = function (obj, context) { + Object.keys(obj).forEach(function (key) { + context[key] = obj[key]; + }); + } + + /** + * Should be used to generate codes, which will be evaluated + * + * @method generateCode + * @param {Object} object from which code will be generated + * @return {String} javascript code which is used to initalized variables + */ + var generateCode = function (obj) { + return Object.keys(obj).reduce(function (acc, key) { + return acc + "var " + key + " = context['" + key + "'];\n"; + }, ""); + }; + + /** + * Helper method + * Should be called to get method with given name from the abi + * + * @method getMethodWithName + * @param {Array} contract's abi + * @param {String} name of the method that we are looking for + * @return {Object} abi for method with name + */ + var getMethodWithName = function(abi, name) { + return abi.filter(function (method) { + return method.name === name; + })[0]; + }; + + /** + * Should be used to get all contract method input variables + * + * @method getMethodInputParams + * @param {Object} abi for certain method + * @param {Object} transaction object + * @return {Object} object with all contract's method input variables + */ + var getMethodInputParams = function (method, transaction) { + // do it with output formatter (cause we have to decode) + var params = abi.formatOutput(method.inputs, '0x' + transaction.params[0].data.slice(10)); + + return method.inputs.reduce(function (acc, current, index) { + acc[current.name] = params[index]; + return acc; + }, {}); + }; + + /** + * Should be called when we want to evaluate natspec expression + * Replaces all natspec 'subexpressions' with evaluated value + * + * @method mapExpressionToEvaluate + * @param {String} expression to evaluate + * @param {Function} callback which is called to evaluate te expression + * @return {String} evaluated expression + */ + var mapExpressionsToEvaluate = function (expression, cb) { + var evaluatedExpression = ""; + + // match everything in `` quotes + var pattern = /\`(?:\\.|[^`\\])*\`/gim + var match; + var lastIndex = 0; + try { + while ((match = pattern.exec(expression)) !== null) { + var startIndex = pattern.lastIndex - match[0].length; + var toEval = match[0].slice(1, match[0].length - 1); + evaluatedExpression += expression.slice(lastIndex, startIndex); + var evaluatedPart = cb(toEval); + evaluatedExpression += evaluatedPart; + lastIndex = pattern.lastIndex; + } + + evaluatedExpression += expression.slice(lastIndex); + } + catch (err) { + throw new Error("Natspec evaluation failed, wrong input params"); + } + + return evaluatedExpression; + }; + + /** + * Should be called to evaluate single expression + * Is internally using javascript's 'eval' method + * + * @method evaluateExpression + * @param {String} expression which should be evaluated + * @param {Object} [call] object containing contract abi, transaction, called method + * @return {String} evaluated expression + * @throws exception if method is not found or we are trying to evaluate input params that does not exists + */ + var evaluateExpression = function (expression, call) { + //var self = this; + var context = {}; + + if (!!call) { + try { + var method = getMethodWithName(call.abi, call.method); + var params = getMethodInputParams(method, call.transaction); + copyToContext(params, context); + } + catch (err) { + throw new Error("Natspec evaluation failed, method does not exist"); + } + } + + var code = generateCode(context); + + var evaluatedExpression = mapExpressionsToEvaluate(expression, function (toEval) { + var fn = new Function("context", code + "return " + toEval + ";"); + return fn(context).toString(); + }); + + return evaluatedExpression; + }; + + /** + * Safe version of evaluateExpression + * Instead of throwing an exception it returns it as a string + * + * @method evaluateExpressionSafe + * @param {String} expression which should be evaluated + * @param {Object} [call] object containing contract abi, transaction, called method + * @return {String} evaluated expression + */ + var evaluateExpressionSafe = function (expression, call) { + try { + return evaluateExpression(expression, call); + } + catch (err) { + return err.message; + } + }; + + return { + evaluateExpression: evaluateExpression, + evaluateExpressionSafe: evaluateExpressionSafe + }; + +})(); + +module.exports = natspec; + + +},{"./node_modules/ethereum.js/lib/abi.js":3}]},{},[]); diff --git a/libnatspec/natspecjs/dist/natspec.js.map b/libnatspec/natspecjs/dist/natspec.js.map new file mode 100644 index 000000000..126dc498d --- /dev/null +++ b/libnatspec/natspecjs/dist/natspec.js.map @@ -0,0 +1 @@ +{"version":3,"file":"natspec.min.js","sources":["natspec.js"],"names":["require","e","t","n","r","s","o","u","a","i","f","Error","code","l","exports","call","length",1,2,"module","drainQueue","draining","currentQueue","len","queue","noop","process","nextTick","fun","push","setTimeout","title","browser","env","argv","version","on","addListener","once","off","removeListener","removeAllListeners","emit","binding","cwd","chdir","umask",3,"utils","types","c","displayTypeError","type","console","error","arrayType","slice","dynamicTypeBytes","value","formatInputInt","inputTypes","formatInput","inputs","params","bytes","toAppendConstant","toAppendArrayContent","forEach","input","index","typeMatch","j","formatter","format","reduce","acc","curr","dynamicBytesLength","ETH_PADDING","outputTypes","formatOutput","outs","output","result","padding","dynamicPartLength","dynamicPart","out","size","formatOutputUInt","array","k","prefixedType","inputParser","json","parser","method","displayName","extractDisplayName","name","typeName","extractTypeName","impl","Array","prototype","arguments","undefined","outputParser","outputs","./const","./formatters","./types","./utils",4,"NODE_ENV","BigNumber","ETH_UNITS","ETH_SIGNATURE_LENGTH","ETH_BIGNUMBER_ROUNDING_MODE","ROUNDING_MODE","ROUND_DOWN","ETH_POLLING_TIMEOUT","this","_process","bignumber.js",5,"padLeft","string","chars","sign","join","config","round","lessThan","plus","toString","indexOf","substr","formatInputString","fromAscii","formatInputBool","formatInputReal","times","pow","signedIsNegative","formatOutputInt","minus","formatOutputReal","dividedBy","formatOutputUReal","formatOutputHash","formatOutputBool","formatOutputString","toAscii","formatOutputAddress",6,"prefix","namedType",7,"findIndex","callback","end","hex","str","substring","parseInt","String","fromCharCode","toHex","charCodeAt","pad","replace","filterFunctions","filter","current","filterEvents","toEth","val","unit","units","toFixed","replaceFunction","$0","$1","$2",8,"global","another","configObj","b","num","x","ERRORS","raise","isValidInt","id","DECIMAL_PLACES","RegExp","ALPHABET","test","parseNumeric","tooManyDigits","convertBase","isNumeric","search","MAX_EXP","MIN_EXP","LOG_BASE","baseOut","baseIn","d","xc","y","dp","rm","toLowerCase","POW_PRECISION","toBaseOut","toFixedPoint","coeffToString","pop","div","unshift","charAt","caller","c0","ne","roundingMode","TO_EXP_NEG","toExponential","maxOrMin","args","m","isArray","intValidatorWithErrors","min","max","truncate","normalise","msg","sd","ni","rd","pows10","POWS_TEN","mathceil","mathfloor","BASE","P","ONE","TO_EXP_POS","CRYPTO","MODULO_MODE","FORMAT","decimalSeparator","groupSeparator","groupSize","secondaryGroupSize","fractionGroupSeparator","fractionGroupSize","ROUND_UP","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","v","p","has","hasOwnProperty","MAX","intValidatorNoErrors","notBool","crypto","lt","gt","random","pow2_53","random53bitInt","Math","rand","getRandomValues","Uint32Array","randomBytes","copy","shift","multiply","base","temp","xlo","xhi","carry","klo","SQRT_BASE","khi","compare","aL","bL","cmp","subtract","more","prod","prodL","q","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","yc","NaN","bitFloor","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","isNaN","p1","p2","absoluteValue","abs","ceil","comparedTo","decimalPlaces","dividedToIntegerBy","divToInt","equals","eq","floor","greaterThan","greaterThanOrEqualTo","gte","isFinite","isInteger","isInt","isNegative","isNeg","isZero","lessThanOrEqualTo","lte","sub","xLTy","xe","ye","reverse","modulo","mod","negated","neg","add","precision","z","MAX_SAFE_INTEGER","squareRoot","sqrt","rep","half","mul","xcL","ycL","ylo","yhi","zc","sqrtBase","toDigits","toFormat","arr","split","g1","g2","intPart","fractionPart","intDigits","toFraction","md","d0","d2","exp","n0","n1","d1","toNumber","toPower","parseFloat","toPrecision","truncated","trunc","valueOf","toJSON","obj","Object","arrL","define","amd","natspec","abi","copyToContext","context","keys","key","generateCode","getMethodWithName","getMethodInputParams","transaction","data","mapExpressionsToEvaluate","expression","cb","match","evaluatedExpression","pattern","lastIndex","exec","startIndex","toEval","evaluatedPart","err","evaluateExpression","fn","Function","evaluateExpressionSafe","message","./node_modules/ethereum.js/lib/abi.js"],"mappings":"AAAAA,QAAQ,QAAUC,GAAEC,EAAEC,EAAEC,GAAG,QAASC,GAAEC,EAAEC,GAAG,IAAIJ,EAAEG,GAAG,CAAC,IAAIJ,EAAEI,GAAG,CAAC,GAAIE,GAAkB,kBAATR,UAAqBA,OAAQ,KAAIO,GAAGC,EAAE,MAAOA,GAAEF,GAAE,EAAI,IAAGG,EAAE,MAAOA,GAAEH,GAAE,EAAI,IAAII,GAAE,GAAIC,OAAM,uBAAuBL,EAAE,IAAK,MAAMI,GAAEE,KAAK,mBAAmBF,EAAE,GAAIG,GAAEV,EAAEG,IAAIQ,WAAYZ,GAAEI,GAAG,GAAGS,KAAKF,EAAEC,QAAQ,SAASb,GAAG,GAAIE,GAAED,EAAEI,GAAG,GAAGL,EAAG,OAAOI,GAAEF,EAAEA,EAAEF,IAAIY,EAAEA,EAAEC,QAAQb,EAAEC,EAAEC,EAAEC,GAAG,MAAOD,GAAEG,GAAGQ,QAAkD,IAAI,GAA1CL,GAAkB,kBAATT,UAAqBA,QAAgBM,EAAE,EAAEA,EAAEF,EAAEY,OAAOV,IAAID,EAAED,EAAEE,GAAI,OAAOD,KAAKY,GAAG,iBAEjcC,GAAG,SAASlB,EAAQmB,GAO1B,QAASC,KACL,IAAIC,EAAJ,CAGAA,GAAW,CAGX,KAFA,GAAIC,GACAC,EAAMC,EAAMR,OACVO,GAAK,CACPD,EAAeE,EACfA,IAEA,KADA,GAAIf,GAAI,KACCA,EAAIc,GACTD,EAAab,IAEjBc,GAAMC,EAAMR,OAEhBK,GAAW,GAef,QAASI,MAnCT,GAAIC,GAAUP,EAAOL,WACjBU,KACAH,GAAW,CAoBfK,GAAQC,SAAW,SAAUC,GACzBJ,EAAMK,KAAKD,GACNP,GACDS,WAAWV,EAAY,IAI/BM,EAAQK,MAAQ,UAChBL,EAAQM,SAAU,EAClBN,EAAQO,OACRP,EAAQQ,QACRR,EAAQS,QAAU,GAIlBT,EAAQU,GAAKX,EACbC,EAAQW,YAAcZ,EACtBC,EAAQY,KAAOb,EACfC,EAAQa,IAAMd,EACdC,EAAQc,eAAiBf,EACzBC,EAAQe,mBAAqBhB,EAC7BC,EAAQgB,KAAOjB,EAEfC,EAAQiB,QAAU,WACd,KAAM,IAAIhC,OAAM,qCAIpBe,EAAQkB,IAAM,WAAc,MAAO,KACnClB,EAAQmB,MAAQ,WACZ,KAAM,IAAIlC,OAAM,mCAEpBe,EAAQoB,MAAQ,WAAa,MAAO,SAE9BC,GAAG,SAAS/C,EAAQmB,GAwB1B,GAAI6B,GAAQhD,EAAQ,WAChBiD,EAAQjD,EAAQ,WAChBkD,EAAIlD,EAAQ,WACZU,EAAIV,EAAQ,gBAEZmD,EAAmB,SAAUC,GAC7BC,QAAQC,MAAM,iCAAmCF,IAKjDG,EAAY,SAAUH,GACtB,MAA0B,OAAnBA,EAAKI,MAAM,KAGlBC,EAAmB,SAAUL,EAAMM,GAEnC,MAAIH,GAAUH,IAAkB,WAATA,EACZ1C,EAAEiD,eAAeD,EAAM1C,QAC3B,IAGP4C,EAAaX,EAAMW,aAMnBC,EAAc,SAAUC,EAAQC,GAChC,GAAIC,GAAQ,GACRC,EAAmB,GACnBC,EAAuB,EA+B3B,OA5BAJ,GAAOK,QAAQ,SAAUC,EAAOC,GAC5BL,GAASP,EAAiBW,EAAMhB,KAAMW,EAAOM,MAGjDP,EAAOK,QAAQ,SAAUC,EAAO3D,GAG5B,IAAK,GADD6D,IAAY,EACPC,EAAI,EAAGA,EAAIX,EAAW5C,SAAWsD,EAAWC,IACjDD,EAAYV,EAAWW,GAAGnB,KAAKU,EAAOrD,GAAG2C,KAAMW,EAAOtD,GAErD6D,IACDnB,EAAiBW,EAAOrD,GAAG2C,KAG/B,IAAIoB,GAAYZ,EAAWW,EAAI,GAAGE,MAE9BlB,GAAUO,EAAOrD,GAAG2C,MACpBc,GAAwBH,EAAOtD,GAAGiE,OAAO,SAAUC,EAAKC,GACpD,MAAOD,GAAMH,EAAUI,IACxB,IACqB,WAAnBd,EAAOrD,GAAG2C,KACfc,GAAwBM,EAAUT,EAAOtD,IAEzCwD,GAAoBO,EAAUT,EAAOtD,MAG7CuD,GAASC,EAAmBC,GAK5BW,EAAqB,SAAUzB,GAC/B,MAAIG,GAAUH,IAAkB,WAATA,EACI,EAAhBF,EAAE4B,YACN,GAGPC,EAAc9B,EAAM8B,cAMpBC,EAAe,SAAUC,EAAMC,GAE/BA,EAASA,EAAO1B,MAAM,EACtB,IAAI2B,MACAC,EAA0B,EAAhBlC,EAAE4B,YAEZO,EAAoBJ,EAAKP,OAAO,SAAUC,EAAKC,GAC/C,MAAOD,GAAME,EAAmBD,EAAKxB,OACtC,GAECkC,EAAcJ,EAAO1B,MAAM,EAAG6B,EAmClC,OAlCAH,GAASA,EAAO1B,MAAM6B,GAEtBJ,EAAKd,QAAQ,SAAUoB,EAAK9E,GAGxB,IAAK,GADD6D,IAAY,EACPC,EAAI,EAAGA,EAAIQ,EAAY/D,SAAWsD,EAAWC,IAClDD,EAAYS,EAAYR,GAAGnB,KAAK6B,EAAKxE,GAAG2C,KAGvCkB,IACDnB,EAAiB8B,EAAKxE,GAAG2C,KAG7B,IAAIoB,GAAYO,EAAYR,EAAI,GAAGE,MACnC,IAAIlB,EAAU0B,EAAKxE,GAAG2C,MAAO,CACzB,GAAIoC,GAAO9E,EAAE+E,iBAAiBH,EAAY9B,MAAM,EAAG4B,GACnDE,GAAcA,EAAY9B,MAAM4B,EAEhC,KAAK,GADDM,MACKC,EAAI,EAAOH,EAAJG,EAAUA,IACtBD,EAAM7D,KAAK2C,EAAUU,EAAO1B,MAAM,EAAG4B,KACrCF,EAASA,EAAO1B,MAAM4B,EAE1BD,GAAOtD,KAAK6D,OAEPzC,GAAM2C,aAAa,UAAUX,EAAKxE,GAAG2C,OAC1CkC,EAAcA,EAAY9B,MAAM4B,GAChCD,EAAOtD,KAAK2C,EAAUU,EAAO1B,MAAM,EAAG4B,KACtCF,EAASA,EAAO1B,MAAM4B,KAEtBD,EAAOtD,KAAK2C,EAAUU,EAAO1B,MAAM,EAAG4B,KACtCF,EAASA,EAAO1B,MAAM4B,MAIvBD,GAMPU,EAAc,SAAUC,GACxB,GAAIC,KAiBJ,OAhBAD,GAAK3B,QAAQ,SAAU6B,GACnB,GAAIC,GAAcjD,EAAMkD,mBAAmBF,EAAOG,MAC9CC,EAAWpD,EAAMqD,gBAAgBL,EAAOG,MAExCG,EAAO,WACP,GAAIvC,GAASwC,MAAMC,UAAUhD,MAAMzC,KAAK0F,UACxC,OAAO5C,GAAYmC,EAAOlC,OAAQC,GAGV2C,UAAxBX,EAAOE,KACPF,EAAOE,GAAeK,GAG1BP,EAAOE,GAAaG,GAAYE,IAG7BP,GAKPY,EAAe,SAAUb,GACzB,GAAIC,KAiBJ,OAhBAD,GAAK3B,QAAQ,SAAU6B,GAEnB,GAAIC,GAAcjD,EAAMkD,mBAAmBF,EAAOG,MAC9CC,EAAWpD,EAAMqD,gBAAgBL,EAAOG,MAExCG,EAAO,SAAUpB,GACjB,MAAOF,GAAagB,EAAOY,QAAS1B,GAGZwB,UAAxBX,EAAOE,KACPF,EAAOE,GAAeK,GAG1BP,EAAOE,GAAaG,GAAYE,IAG7BP,EAGX5E,GAAOL,SACH+E,YAAaA,EACbc,aAAcA,EACd9C,YAAaA,EACbmB,aAAcA,KAGf6B,UAAU,EAAEC,eAAe,EAAEC,UAAU,EAAEC,UAAU,IAAIC,GAAG,SAASjH,EAAQmB,IAC9E,SAAWO,GAwBX,GAA6B,UAAzBA,EAAQO,IAAIiF,SACZ,GAAIC,GAAYnH,EAAQ,eAG5B,IAAIoH,IACA,MACA,OACA,OACA,OACA,QACA,SACA,QACA,QACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SACA,SAGJjG,GAAOL,SACHgE,YAAa,GACbuC,qBAAsB,EACtBD,UAAWA,EACXE,6BAA+BC,cAAeJ,EAAUK,YACxDC,oBAAqB,OAItB1G,KAAK2G,KAAK1H,EAAQ,eAClB2H,SAAW,EAAEC,eAAe,IAAIC,GAAG,SAAS7H,EAAQmB,IACvD,SAAWO,GAuBX,GAA6B,UAAzBA,EAAQO,IAAIiF,SACZ,GAAIC,GAAYnH,EAAQ,eAG5B,IAAIgD,GAAQhD,EAAQ,WAChBkD,EAAIlD,EAAQ,WAMZ8H,EAAU,SAAUC,EAAQC,EAAOC,GACnC,MAAO,IAAI1B,OAAMyB,EAAQD,EAAO/G,OAAS,GAAGkH,KAAKD,EAAOA,EAAO,KAAOF,GAOtEpE,EAAiB,SAAUD,GAE3B,GAAI0B,GAA0B,EAAhBlC,EAAE4B,WAiBhB,OAhBIpB,aAAiByD,IAA8B,gBAAVzD,IAChB,gBAAVA,KACPA,EAAQ,GAAIyD,GAAUzD,IAC1ByD,EAAUgB,OAAOjF,EAAEoE,6BACnB5D,EAAQA,EAAM0E,QAEV1E,EAAM2E,SAAS,KACf3E,EAAQ,GAAIyD,GAAU,mEAAoE,IAAImB,KAAK5E,GAAO4E,KAAK,IACnH5E,EAAQA,EAAM6E,SAAS,KAGvB7E,EAD6B,IAAxBA,EAAM8E,QAAQ,MACX9E,EAAM+E,OAAO,GACC,gBAAV/E,GACJC,EAAe,GAAIwD,GAAUzD,MAE3BA,GAAO6E,SAAS,IACvBT,EAAQpE,EAAO0B,IAKtBsD,EAAoB,SAAUhF,GAC9B,MAAOV,GAAM2F,UAAUjF,EAAOR,EAAE4B,aAAa2D,OAAO,IAKpDG,EAAkB,SAAUlF,GAC5B,MAAO,mEAAqEA,EAAS,IAAM,MAM3FmF,EAAkB,SAAUnF,GAC5B,MAAOC,GAAe,GAAIwD,GAAUzD,GAAOoF,MAAM,GAAI3B,GAAU,GAAG4B,IAAI,QAOtEC,EAAmB,SAAUtF,GAC7B,MAA4E,MAApE,GAAIyD,GAAUzD,EAAM+E,OAAO,EAAG,GAAI,IAAIF,SAAS,GAAGE,OAAO,EAAG,IAKpEQ,EAAkB,SAAUvF,GAI5B,MAHAA,GAAQA,GAAS,IAGbsF,EAAiBtF,GACV,GAAIyD,GAAUzD,EAAO,IAAIwF,MAAM,GAAI/B,GAAU,mEAAoE,KAAK+B,MAAM,GAEhI,GAAI/B,GAAUzD,EAAO,KAK5B+B,EAAmB,SAAU/B,GAE7B,MADAA,GAAQA,GAAS,IACV,GAAIyD,GAAUzD,EAAO,KAI5ByF,EAAmB,SAAUzF,GAC7B,MAAOuF,GAAgBvF,GAAO0F,UAAU,GAAIjC,GAAU,GAAG4B,IAAI,OAI7DM,EAAoB,SAAU3F,GAC9B,MAAO+B,GAAiB/B,GAAO0F,UAAU,GAAIjC,GAAU,GAAG4B,IAAI,OAI9DO,EAAmB,SAAU5F,GAC7B,MAAO,KAAOA,GAId6F,EAAmB,SAAU7F,GAC7B,MAAiB,qEAAVA,GAA+E,GAAO,GAI7F8F,EAAqB,SAAU9F,GAC/B,MAAOV,GAAMyG,QAAQ/F,IAIrBgG,EAAsB,SAAUhG,GAChC,MAAO,KAAOA,EAAMF,MAAME,EAAM1C,OAAS,GAAI0C,EAAM1C,QAIvDG,GAAOL,SACH6C,eAAgBA,EAChB+E,kBAAmBA,EACnBE,gBAAiBA,EACjBC,gBAAiBA,EACjBI,gBAAiBA,EACjBxD,iBAAkBA,EAClB0D,iBAAkBA,EAClBE,kBAAmBA,EACnBC,iBAAkBA,EAClBC,iBAAkBA,EAClBC,mBAAoBA,EACpBE,oBAAqBA,KAItB3I,KAAK2G,KAAK1H,EAAQ,eAClB6G,UAAU,EAAEG,UAAU,EAAEW,SAAW,EAAEC,eAAe,IAAI+B,GAAG,SAAS3J,EAAQmB,GAuB/E,GAAIT,GAAIV,EAAQ,gBAIZ4F,EAAe,SAAUgE,GACzB,MAAO,UAAUxG,GACb,MAAgC,KAAzBA,EAAKoF,QAAQoB,KAMxBC,EAAY,SAAU1D,GACtB,MAAO,UAAU/C,GACb,MAAO+C,KAAS/C,IAMpBQ,EAAa,WAEb,QACMR,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAEiD,iBACtCP,KAAMwC,EAAa,OAAQnB,OAAQ/D,EAAEiD,iBACrCP,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAEiD,iBACtCP,KAAMwC,EAAa,UAAWnB,OAAQ/D,EAAEgI,oBACxCtF,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAEmI,kBACtCzF,KAAMwC,EAAa,SAAUnB,OAAQ/D,EAAEmI,kBACvCzF,KAAMyG,EAAU,WAAYpF,OAAQ/D,EAAEiD,iBACtCP,KAAMyG,EAAU,QAASpF,OAAQ/D,EAAEkI,mBAMzC7D,EAAc,WAEd,QACM3B,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAE+E,mBACtCrC,KAAMwC,EAAa,OAAQnB,OAAQ/D,EAAEuI,kBACrC7F,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAE4I,mBACtClG,KAAMwC,EAAa,UAAWnB,OAAQ/D,EAAE8I,qBACxCpG,KAAMwC,EAAa,QAASnB,OAAQ/D,EAAEyI,mBACtC/F,KAAMwC,EAAa,SAAUnB,OAAQ/D,EAAE2I,oBACvCjG,KAAMyG,EAAU,WAAYpF,OAAQ/D,EAAEgJ,sBACtCtG,KAAMyG,EAAU,QAASpF,OAAQ/D,EAAE6I,mBAI7CpI,GAAOL,SACH8E,aAAcA,EACdiE,UAAWA,EACXjG,WAAYA,EACZmB,YAAaA,KAId+B,eAAe,IAAIgD,GAAG,SAAS9J,EAAQmB,GAuB1C,GAAI+B,GAAIlD,EAAQ,WAMZ+J,EAAY,SAAUrE,EAAOsE,GAG7B,IAFA,GAAIC,IAAM,EACNxJ,EAAI,EACDA,EAAIiF,EAAM1E,SAAWiJ,EAAKxJ,IAC7BwJ,EAAMD,EAAStE,EAAMjF,GAEzB,OAAOwJ,GAAMxJ,EAAI,EAAI,IAIrBgJ,EAAU,SAASS,GAEnB,GAAIC,GAAM,GACN1J,EAAI,EAAGI,EAAIqJ,EAAIlJ,MAInB,KAH4B,OAAxBkJ,EAAIE,UAAU,EAAG,KACjB3J,EAAI,GAEGI,EAAJJ,EAAOA,GAAG,EAAG,CAChB,GAAIG,GAAOyJ,SAASH,EAAIzB,OAAOhI,EAAG,GAAI,GACtC,IAAa,IAATG,EACA,KAGJuJ,IAAOG,OAAOC,aAAa3J,GAG/B,MAAOuJ,IAGPK,EAAQ,SAASL,GAEjB,IAAI,GADAD,GAAM,GACFzJ,EAAI,EAAGA,EAAI0J,EAAInJ,OAAQP,IAAK,CAChC,GAAIN,GAAIgK,EAAIM,WAAWhK,GAAG8H,SAAS,GACnC2B,IAAO/J,EAAEa,OAAS,EAAI,IAAMb,EAAIA,EAGpC,MAAO+J,IAIPvB,EAAY,SAASwB,EAAKO,GAC1BA,EAAchE,SAARgE,EAAoB,EAAIA,CAE9B,KADA,GAAIR,GAAMM,EAAML,GACTD,EAAIlJ,OAAa,EAAJ0J,GAChBR,GAAO,IACX,OAAO,KAAOA,GAIdhE,EAAqB,SAAUC,GAC/B,GAAInF,GAASmF,EAAKqC,QAAQ,IAC1B,OAAkB,KAAXxH,EAAgBmF,EAAKsC,OAAO,EAAGzH,GAAUmF,GAIhDE,EAAkB,SAAUF,GAE5B,GAAInF,GAASmF,EAAKqC,QAAQ,IAC1B,OAAkB,KAAXxH,EAAgBmF,EAAKsC,OAAOzH,EAAS,EAAGmF,EAAKnF,OAAS,GAAKA,EAAS,IAAI2J,QAAQ,IAAK,IAAM,IAKlGC,EAAkB,SAAU9E,GAC5B,MAAOA,GAAK+E,OAAO,SAAUC,GACzB,MAAwB,aAAjBA,EAAQ1H,QAMnB2H,EAAe,SAAUjF,GACzB,MAAOA,GAAK+E,OAAO,SAAUC,GACzB,MAAwB,UAAjBA,EAAQ1H,QAOnB4H,EAAQ,SAAUb,GAKlB,IAHA,GAAIc,GAAqB,gBAARd,GAAyC,IAAtBA,EAAI3B,QAAQ,MAAc6B,SAASF,EAAI1B,OAAO,GAAI,IAAM4B,SAASF,GAAOA,EACxGe,EAAO,EACPC,EAAQjI,EAAEkE,UACP6D,EAAM,KAAQC,EAAOC,EAAMnK,OAAS,GAEvCiK,GAAO,IACPC,GAOJ,KALA,GAAI7K,GAAI4K,EAAI1C,WAAWvH,OAASiK,EAAIG,QAAQ,GAAGpK,OAASiK,EAAI1C,WAAa0C,EAAIG,QAAQ,GACjFC,EAAkB,SAASC,EAAIC,EAAIC,GACnC,MAAOD,GAAK,IAAMC,KAGT,CACT,GAAIlL,GAAID,CAER,IADAA,EAAIA,EAAEsK,QAAQ,qBAAsBU,GAChC/K,IAAMD,EACN,MAER,MAAOA,GAAI,IAAM8K,EAAMD,GAG3B/J,GAAOL,SACHiJ,UAAWA,EACXN,QAASA,EACTd,UAAWA,EACXzC,mBAAoBA,EACpBG,gBAAiBA,EACjBuE,gBAAiBA,EACjBG,aAAcA,EACdC,MAAOA,KAIRnE,UAAU,IAAI4E,GAAG,SAASzL,EAAQmB,IAGpC,SAAWuK,GACR,YAqCA,SAASC,GAAQC,GAiHb,QAASzE,GAAWhH,EAAG0L,GACnB,GAAI3I,GAAGjD,EAAGQ,EAAGqL,EAAKvK,EAAK4I,EACnB4B,EAAIrE,IAGR,MAAQqE,YAAa5E,IAIjB,MADI6E,IAAQC,EAAO,GAAI,+BAAgC9L,GAChD,GAAIgH,GAAWhH,EAAG0L,EAK7B,IAAU,MAALA,GAAcK,EAAYL,EAAG,EAAG,GAAIM,EAAI,QA4BtC,CAMH,GALAN,EAAQ,EAAJA,EACJ1B,EAAMhK,EAAI,GAIA,IAAL0L,EAED,MADAE,GAAI,GAAI5E,GAAWhH,YAAagH,GAAYhH,EAAIgK,GACzC/B,EAAO2D,EAAGK,EAAiBL,EAAE9L,EAAI,EAAGsH,EAK/C,KAAOuE,EAAkB,gBAAL3L,KAAuB,EAAJA,GAAS,IAC7C,GAAMkM,QAAQ,OAAUnJ,EAAI,IAAMoJ,EAAS9I,MAAO,EAAGqI,GAAM,MAC1D,SAAW3I,EAAI,MAAU,GAAJ2I,EAAS,IAAM,IAAOU,KAAKpC,GAChD,MAAOqC,GAAcT,EAAG5B,EAAK2B,EAAKD,EAGlCC,IACAC,EAAE1L,EAAY,EAAR,EAAIF,GAAUgK,EAAMA,EAAI3G,MAAM,GAAI,IAAO,EAE1CwI,GAAU7B,EAAIQ,QAAS,YAAa,IAAK3J,OAAS,IAGnDiL,EAAOE,EAAIM,EAAetM,GAI9B2L,GAAM,GAENC,EAAE1L,EAA0B,KAAtB8J,EAAIM,WAAW,IAAcN,EAAMA,EAAI3G,MAAM,GAAI,IAAO,EAGlE2G,EAAMuC,EAAavC,EAAK,GAAI0B,EAAGE,EAAE1L,OA9DmB,CAGpD,GAAKF,YAAagH,GAKd,MAJA4E,GAAE1L,EAAIF,EAAEE,EACR0L,EAAE9L,EAAIE,EAAEF,EACR8L,EAAE7I,GAAM/C,EAAIA,EAAE+C,GAAM/C,EAAEqD,QAAUrD,OAChCgM,EAAK,EAIT,KAAOL,EAAkB,gBAAL3L,KAAuB,EAAJA,GAAS,EAAI,CAIhD,GAHA4L,EAAE1L,EAAY,EAAR,EAAIF,GAAUA,GAAKA,EAAG,IAAO,EAG9BA,MAAQA,EAAI,CACb,IAAMF,EAAI,EAAGQ,EAAIN,EAAGM,GAAK,GAAIA,GAAK,GAAIR,KAItC,MAHA8L,GAAE9L,EAAIA,EACN8L,EAAE7I,GAAK/C,QACPgM,EAAK,GAIThC,EAAMhK,EAAI,OACP,CACH,IAAMwM,EAAUJ,KAAMpC,EAAMhK,EAAI,IAAO,MAAOqM,GAAcT,EAAG5B,EAAK2B,EACpEC,GAAE1L,EAA0B,KAAtB8J,EAAIM,WAAW,IAAcN,EAAMA,EAAI3G,MAAM,GAAI,IAAO,GAwDtE,KAhBOvD,EAAIkK,EAAI3B,QAAQ,MAAS,KAAK2B,EAAMA,EAAIQ,QAAS,IAAK,MAGtDlK,EAAI0J,EAAIyC,OAAQ,OAAW,GAGrB,EAAJ3M,IAAQA,EAAIQ,GACjBR,IAAMkK,EAAI3G,MAAO/C,EAAI,GACrB0J,EAAMA,EAAIC,UAAW,EAAG3J,IACZ,EAAJR,IAGRA,EAAIkK,EAAInJ,QAINP,EAAI,EAAyB,KAAtB0J,EAAIM,WAAWhK,GAAWA,KAGvC,IAAMc,EAAM4I,EAAInJ,OAAkC,KAA1BmJ,EAAIM,aAAalJ,KAGzC,GAFA4I,EAAMA,EAAI3G,MAAO/C,EAAGc,EAAM,GAYtB,GATAA,EAAM4I,EAAInJ,OAIL8K,GAAOE,GAAUzK,EAAM,IAAK0K,EAAOE,EAAIM,EAAeV,EAAE1L,EAAIF,GAEjEF,EAAIA,EAAIQ,EAAI,EAGPR,EAAI4M,EAGLd,EAAE7I,EAAI6I,EAAE9L,EAAI,SAGT,IAAS6M,EAAJ7M,EAGR8L,EAAE7I,GAAM6I,EAAE9L,EAAI,OACX,CAWH,GAVA8L,EAAE9L,EAAIA,EACN8L,EAAE7I,KAMFzC,GAAMR,EAAI,GAAM8M,EACP,EAAJ9M,IAAQQ,GAAKsM,GAETxL,EAAJd,EAAU,CAGX,IAFIA,GAAGsL,EAAE7I,EAAErB,MAAOsI,EAAI3G,MAAO,EAAG/C,IAE1Bc,GAAOwL,EAAcxL,EAAJd,GACnBsL,EAAE7I,EAAErB,MAAOsI,EAAI3G,MAAO/C,EAAGA,GAAKsM,GAGlC5C,GAAMA,EAAI3G,MAAM/C,GAChBA,EAAIsM,EAAW5C,EAAInJ,WAEnBP,IAAKc,CAGT,MAAQd,IAAK0J,GAAO,KACpB4B,EAAE7I,EAAErB,MAAOsI,OAKf4B,GAAE7I,GAAM6I,EAAE9L,EAAI,EAGlBkM,GAAK,EAgVT,QAASO,GAAavC,EAAK6C,EAASC,EAAQhF,GACxC,GAAIiF,GAAGjN,EAAG0F,EAAGvF,EAAG2L,EAAGoB,EAAIC,EACnB3M,EAAI0J,EAAI3B,QAAS,KACjB6E,EAAKjB,EACLkB,EAAK/F,CA0BT,KAxBc,GAAT0F,IAAc9C,EAAMA,EAAIoD,eAGxB9M,GAAK,IACNkF,EAAI6H,EAGJA,EAAgB,EAChBrD,EAAMA,EAAIQ,QAAS,IAAK,IACxByC,EAAI,GAAIjG,GAAU8F,GAClBlB,EAAIqB,EAAErE,IAAKoB,EAAInJ,OAASP,GACxB+M,EAAgB7H,EAIhByH,EAAElK,EAAIuK,EAAWC,EAAcC,EAAe5B,EAAE7I,GAAK6I,EAAE9L,GAAK,GAAI+M,GAChEI,EAAEnN,EAAImN,EAAElK,EAAElC,QAIdmM,EAAKM,EAAWtD,EAAK8C,EAAQD,GAC7B/M,EAAI0F,EAAIwH,EAAGnM,OAGQ,GAAXmM,IAAKxH,GAASwH,EAAGS,OACzB,IAAMT,EAAG,GAAK,MAAO,GA2BrB,IAzBS,EAAJ1M,IACCR,GAEF8L,EAAE7I,EAAIiK,EACNpB,EAAE9L,EAAIA,EAGN8L,EAAE1L,EAAI4H,EACN8D,EAAI8B,EAAK9B,EAAGqB,EAAGC,EAAIC,EAAIN,GACvBG,EAAKpB,EAAE7I,EACP9C,EAAI2L,EAAE3L,EACNH,EAAI8L,EAAE9L,GAGViN,EAAIjN,EAAIoN,EAAK,EAGb5M,EAAI0M,EAAGD,GACPvH,EAAIqH,EAAU,EACd5M,EAAIA,GAAS,EAAJ8M,GAAsB,MAAbC,EAAGD,EAAI,GAEzB9M,EAAS,EAALkN,GAAgB,MAAL7M,GAAaL,KAAe,GAANkN,GAAWA,IAAQvB,EAAE1L,EAAI,EAAI,EAAI,IACzDI,EAAIkF,GAAKlF,GAAKkF,IAAY,GAAN2H,GAAWlN,GAAW,GAANkN,GAAuB,EAAZH,EAAGD,EAAI,IACtDI,IAAQvB,EAAE1L,EAAI,EAAI,EAAI,IAE1B,EAAJ6M,IAAUC,EAAG,GAGdhD,EAAM/J,EAAIsN,EAAc,KAAML,GAAO,QAClC,CAGH,GAFAF,EAAGnM,OAASkM,EAER9M,EAGA,MAAQ4M,IAAWG,IAAKD,GAAKF,GACzBG,EAAGD,GAAK,EAEFA,MACAjN,EACFkN,EAAGW,QAAQ,GAMvB,KAAMnI,EAAIwH,EAAGnM,QAASmM,IAAKxH,KAG3B,IAAMlF,EAAI,EAAG0J,EAAM,GAASxE,GAALlF,EAAQ0J,GAAOmC,EAASyB,OAAQZ,EAAG1M,OAC1D0J,EAAMuD,EAAcvD,EAAKlK,GAI7B,MAAOkK,GA8PX,QAAS1F,GAAQtE,EAAGM,EAAG6M,EAAIU,GACvB,GAAIC,GAAIhO,EAAGiO,EAAI3M,EAAK4I,CAKpB,IAHAmD,EAAW,MAANA,GAAcpB,EAAYoB,EAAI,EAAG,EAAGU,EAAQG,GACxC,EAALb,EAAS/F,GAEPpH,EAAE+C,EAAI,MAAO/C,GAAEoI,UAIrB,IAHA0F,EAAK9N,EAAE+C,EAAE,GACTgL,EAAK/N,EAAEF,EAEG,MAALQ,EACD0J,EAAMwD,EAAexN,EAAE+C,GACvBiH,EAAgB,IAAV6D,GAA0B,IAAVA,GAAsBI,GAANF,EAClCG,EAAelE,EAAK+D,GACpBR,EAAcvD,EAAK+D,OAevB,IAbA/N,EAAIiI,EAAO,GAAIjB,GAAUhH,GAAIM,EAAG6M,GAGhCrN,EAAIE,EAAEF,EAENkK,EAAMwD,EAAexN,EAAE+C,GACvB3B,EAAM4I,EAAInJ,OAOK,IAAVgN,GAA0B,IAAVA,IAAuB/N,GAALQ,GAAe2N,GAALnO,GAAoB,CAGjE,KAAcQ,EAANc,EAAS4I,GAAO,IAAK5I,KAC7B4I,EAAMkE,EAAelE,EAAKlK,OAQ1B,IAJAQ,GAAKyN,EACL/D,EAAMuD,EAAcvD,EAAKlK,GAGpBA,EAAI,EAAIsB,GACT,KAAOd,EAAI,EAAI,IAAM0J,GAAO,IAAK1J,IAAK0J,GAAO,UAG7C,IADA1J,GAAKR,EAAIsB,EACJd,EAAI,EAEL,IADKR,EAAI,GAAKsB,IAAM4I,GAAO,KACnB1J,IAAK0J,GAAO,KAMpC,MAAOhK,GAAEE,EAAI,GAAK4N,EAAK,IAAM9D,EAAMA,EAKvC,QAASmE,GAAUC,EAAMvI,GACrB,GAAIwI,GAAGrO,EACHM,EAAI,CAKR,KAHKgO,EAASF,EAAK,MAAOA,EAAOA,EAAK,IACtCC,EAAI,GAAIrH,GAAWoH,EAAK,MAEd9N,EAAI8N,EAAKvN,QAAU,CAIzB,GAHAb,EAAI,GAAIgH,GAAWoH,EAAK9N,KAGlBN,EAAEE,EAAI,CACRmO,EAAIrO,CACJ,OACQ6F,EAAOjF,KAAMyN,EAAGrO,KACxBqO,EAAIrO,GAIZ,MAAOqO,GAQX,QAASE,GAAwBvO,EAAGwO,EAAKC,EAAKZ,EAAQ7H,GAMlD,OALSwI,EAAJxO,GAAWA,EAAIyO,GAAOzO,GAAK0O,EAAS1O,KACrC8L,EAAO+B,GAAU7H,GAAQ,mBACjBwI,EAAJxO,GAAWA,EAAIyO,EAAM,gBAAkB,mBAAqBzO,IAG7D,EAQX,QAAS2O,GAAW3O,EAAG+C,EAAGjD,GAKtB,IAJA,GAAIQ,GAAI,EACJ8D,EAAIrB,EAAElC,QAGDkC,IAAIqB,GAAIrB,EAAE0K,OAGnB,IAAMrJ,EAAIrB,EAAE,GAAIqB,GAAK,GAAIA,GAAK,GAAI9D,KAkBlC,OAfOR,EAAIQ,EAAIR,EAAI8M,EAAW,GAAMF,EAGhC1M,EAAE+C,EAAI/C,EAAEF,EAAI,KAGA6M,EAAJ7M,EAGRE,EAAE+C,GAAM/C,EAAEF,EAAI,IAEdE,EAAEF,EAAIA,EACNE,EAAE+C,EAAIA,GAGH/C,EAmDX,QAAS8L,GAAO+B,EAAQe,EAAK9D,GACzB,GAAI3H,GAAQ,GAAI3C,QACZ,gBACA,MACA,SACA,MACA,WACA,KACA,KACA,MACA,KACA,MACA,QACA,MACA,OACA,YACA,SACA,QACA,QACA,QACA,WACA,gBACA,UACA,WACA,aACA,MACA,cACA,WACA,aACFqN,GAAU,MAAQe,EAAM,KAAO9D,EAIjC,MAFA3H,GAAM6C,KAAO,kBACbgG,EAAK,EACC7I,EAQV,QAAS8E,GAAO2D,EAAGiD,EAAI1B,EAAIlN,GACvB,GAAI8M,GAAGzM,EAAG8D,EAAGoB,EAAGxF,EAAG8O,EAAIC,EACnB/B,EAAKpB,EAAE7I,EACPiM,EAASC,CAGb,IAAIjC,EAAI,CAQJ5H,EAAK,CAGD,IAAM2H,EAAI,EAAGvH,EAAIwH,EAAG,GAAIxH,GAAK,GAAIA,GAAK,GAAIuH,KAI1C,GAHAzM,EAAIuO,EAAK9B,EAGA,EAAJzM,EACDA,GAAKsM,EACLxI,EAAIyK,EACJ7O,EAAIgN,EAAI8B,EAAK,GAGbC,EAAK/O,EAAIgP,EAAQjC,EAAI3I,EAAI,GAAM,GAAK,MAIpC,IAFA0K,EAAKI,GAAY5O,EAAI,GAAMsM,GAEtBkC,GAAM9B,EAAGnM,OAAS,CAEnB,IAAIZ,EASA,KAAMmF,EANN,MAAQ4H,EAAGnM,QAAUiO,EAAI9B,EAAGtL,KAAK,IACjC1B,EAAI+O,EAAK,EACThC,EAAI,EACJzM,GAAKsM,EACLxI,EAAI9D,EAAIsM,EAAW,MAIpB,CAIH,IAHA5M,EAAIwF,EAAIwH,EAAG8B,GAGL/B,EAAI,EAAGvH,GAAK,GAAIA,GAAK,GAAIuH,KAG/BzM,GAAKsM,EAILxI,EAAI9D,EAAIsM,EAAWG,EAGnBgC,EAAS,EAAJ3K,EAAQ,EAAIpE,EAAIgP,EAAQjC,EAAI3I,EAAI,GAAM,GAAK,EAmBxD,GAfAnE,EAAIA,GAAU,EAAL4O,GAKO,MAAd7B,EAAG8B,EAAK,KAAoB,EAAJ1K,EAAQpE,EAAIA,EAAIgP,EAAQjC,EAAI3I,EAAI,IAE1DnE,EAAS,EAALkN,GACE4B,GAAM9O,KAAe,GAANkN,GAAWA,IAAQvB,EAAE1L,EAAI,EAAI,EAAI,IAClD6O,EAAK,GAAW,GAANA,IAAmB,GAAN5B,GAAWlN,GAAW,GAANkN,IAGnC7M,EAAI,EAAI8D,EAAI,EAAIpE,EAAIgP,EAAQjC,EAAI3I,GAAM,EAAI4I,EAAG8B,EAAK,IAAO,GAAO,GAClE3B,IAAQvB,EAAE1L,EAAI,EAAI,EAAI,IAElB,EAAL2O,IAAW7B,EAAG,GAiBf,MAhBAA,GAAGnM,OAAS,EAERZ,GAGA4O,GAAMjD,EAAE9L,EAAI,EAGZkN,EAAG,GAAKgC,EAAQH,EAAKjC,GACrBhB,EAAE9L,GAAK+O,GAAM,GAIb7B,EAAG,GAAKpB,EAAE9L,EAAI,EAGX8L,CAkBX,IAdU,GAALtL,GACD0M,EAAGnM,OAASiO,EACZtJ,EAAI,EACJsJ,MAEA9B,EAAGnM,OAASiO,EAAK,EACjBtJ,EAAIwJ,EAAQpC,EAAWtM,GAIvB0M,EAAG8B,GAAM1K,EAAI,EAAI+K,EAAWnP,EAAIgP,EAAQjC,EAAI3I,GAAM4K,EAAO5K,IAAOoB,EAAI,GAIpEvF,EAEA,OAAY,CAGR,GAAW,GAAN6O,EAAU,CAGX,IAAMxO,EAAI,EAAG8D,EAAI4I,EAAG,GAAI5I,GAAK,GAAIA,GAAK,GAAI9D,KAE1C,IADA8D,EAAI4I,EAAG,IAAMxH,EACPA,EAAI,EAAGpB,GAAK,GAAIA,GAAK,GAAIoB,KAG1BlF,GAAKkF,IACNoG,EAAE9L,IACGkN,EAAG,IAAMoC,IAAOpC,EAAG,GAAK,GAGjC,OAGA,GADAA,EAAG8B,IAAOtJ,EACLwH,EAAG8B,IAAOM,EAAO,KACtBpC,GAAG8B,KAAQ,EACXtJ,EAAI,EAMhB,IAAMlF,EAAI0M,EAAGnM,OAAoB,IAAZmM,IAAK1M,GAAU0M,EAAGS,QAItC7B,EAAE9L,EAAI4M,EACPd,EAAE7I,EAAI6I,EAAE9L,EAAI,KAGJ8L,EAAE9L,EAAI6M,IACdf,EAAE7I,GAAM6I,EAAE9L,EAAI,IAItB,MAAO8L,GAnyCX,GAAI8B,GAGA1B,EAAK,EACLqD,EAAIrI,EAAUX,UACdiJ,EAAM,GAAItI,GAAU,GAYpBiF,EAAiB,GAejB7E,EAAgB,EAMhB6G,EAAa,GAIbsB,EAAa,GAMb5C,EAAU,KAKVD,EAAU,IAGVb,GAAS,EAGTE,EAAawC,EAGbiB,GAAS,EAoBTC,EAAc,EAIdpC,EAAgB,IAGhBqC,GACIC,iBAAkB,IAClBC,eAAgB,IAChBC,UAAW,EACXC,mBAAoB,EACpBC,uBAAwB,IACxBC,kBAAmB,EAozE3B,OAjoEAhJ,GAAUwE,QAAUA,EAEpBxE,EAAUiJ,SAAW,EACrBjJ,EAAUK,WAAa,EACvBL,EAAUkJ,WAAa,EACvBlJ,EAAUmJ,YAAc,EACxBnJ,EAAUoJ,cAAgB,EAC1BpJ,EAAUqJ,gBAAkB,EAC5BrJ,EAAUsJ,gBAAkB,EAC5BtJ,EAAUuJ,gBAAkB,EAC5BvJ,EAAUwJ,iBAAmB,EAC7BxJ,EAAUyJ,OAAS,EAoCnBzJ,EAAUgB,OAAS,WACf,GAAI0I,GAAGC,EACHrQ,EAAI,EACJL,KACAI,EAAIiG,UACJnG,EAAIE,EAAE,GACNuQ,EAAMzQ,GAAiB,gBAALA,GACd,WAAc,MAAKA,GAAE0Q,eAAeF,GAA4B,OAAdD,EAAIvQ,EAAEwQ,IAA1C,QACd,WAAc,MAAKtQ,GAAEQ,OAASP,EAA6B,OAAhBoQ,EAAIrQ,EAAEC,MAAnC,OA6GtB,OAxGKsQ,GAAKD,EAAI,mBAAsB5E,EAAY2E,EAAG,EAAGI,EAAK,EAAGH,KAC1D1E,EAAqB,EAAJyE,GAErBzQ,EAAE0Q,GAAK1E,EAKF2E,EAAKD,EAAI,kBAAqB5E,EAAY2E,EAAG,EAAG,EAAG,EAAGC,KACvDvJ,EAAoB,EAAJsJ,GAEpBzQ,EAAE0Q,GAAKvJ,EAMFwJ,EAAKD,EAAI,oBAELrC,EAAQoC,GACJ3E,EAAY2E,EAAE,IAAKI,EAAK,EAAG,EAAGH,IAAO5E,EAAY2E,EAAE,GAAI,EAAGI,EAAK,EAAGH,KACnE1C,EAAoB,EAAPyC,EAAE,GACfnB,EAAoB,EAAPmB,EAAE,IAEX3E,EAAY2E,GAAII,EAAKA,EAAK,EAAGH,KACrC1C,IAAgBsB,EAAkC,GAAf,EAAJmB,GAASA,EAAIA,MAGpDzQ,EAAE0Q,IAAO1C,EAAYsB,GAOhBqB,EAAKD,EAAI,WAELrC,EAAQoC,GACJ3E,EAAY2E,EAAE,IAAKI,EAAK,GAAI,EAAGH,IAAO5E,EAAY2E,EAAE,GAAI,EAAGI,EAAK,EAAGH,KACpEhE,EAAiB,EAAP+D,EAAE,GACZhE,EAAiB,EAAPgE,EAAE,IAER3E,EAAY2E,GAAII,EAAKA,EAAK,EAAGH,KAC5B,EAAJD,EAAQ/D,IAAaD,EAA+B,GAAf,EAAJgE,GAASA,EAAIA,IAC1C7E,GAAQC,EAAO,EAAG6E,EAAI,kBAAmBD,KAG1DzQ,EAAE0Q,IAAOhE,EAASD,GAIbkE,EAAKD,EAAI,YAELD,MAAQA,GAAW,IAANA,GAAiB,IAANA,GACzB1E,EAAK,EACLD,GAAeF,IAAW6E,GAAMnC,EAAyBwC,GAClDlF,GACPC,EAAO,EAAG6E,EAAIK,EAASN,IAG/BzQ,EAAE0Q,GAAK9E,EAKF+E,EAAKD,EAAI,YAELD,MAAQA,GAAW,IAANA,GAAiB,IAANA,GACzBlB,KAAakB,IAAKO,GAA2B,gBAAVA,IAC9BP,IAAMlB,GAAU3D,GAASC,EAAO,EAAG,qBAAsBmF,IACvDpF,GACPC,EAAO,EAAG6E,EAAIK,EAASN,IAG/BzQ,EAAE0Q,GAAKnB,EAKFoB,EAAKD,EAAI,gBAAmB5E,EAAY2E,EAAG,EAAG,EAAG,EAAGC,KACrDlB,EAAkB,EAAJiB,GAElBzQ,EAAE0Q,GAAKlB,EAKFmB,EAAKD,EAAI,kBAAqB5E,EAAY2E,EAAG,EAAGI,EAAK,EAAGH,KACzDtD,EAAoB,EAAJqD,GAEpBzQ,EAAE0Q,GAAKtD,EAIFuD,EAAKD,EAAI,YAEO,gBAALD,GACRhB,EAASgB,EACF7E,GACPC,EAAO,EAAG6E,EAAI,iBAAkBD,IAGxCzQ,EAAE0Q,GAAKjB,EAEAzP,GASX+G,EAAUyH,IAAM,WAAc,MAAON,GAAU7H,UAAW+I,EAAE6B,KAQ5DlK,EAAUwH,IAAM,WAAc,MAAOL,GAAU7H,UAAW+I,EAAE8B,KAc5DnK,EAAUoK,OAAS,WACf,GAAIC,GAAU,iBAMVC,EAAkBC,KAAKH,SAAWC,EAAW,QAC7C,WAAc,MAAOlC,GAAWoC,KAAKH,SAAWC,IAChD,WAAc,MAA2C,UAAlB,WAAhBE,KAAKH,SAAwB,IACjC,QAAhBG,KAAKH,SAAsB,GAElC,OAAO,UAAUlE,GACb,GAAI7M,GAAGqL,EAAG5L,EAAG0F,EAAGkL,EACZpQ,EAAI,EACJyC,KACAyO,EAAO,GAAIxK,GAAUsI,EAKzB,IAHApC,EAAW,MAANA,GAAenB,EAAYmB,EAAI,EAAG4D,EAAK,IAA6B,EAAL5D,EAAjBjB,EACnDzG,EAAI0J,EAAUhC,EAAKN,GAEf4C,EAGA,GAAKyB,GAAUA,EAAOQ,gBAAkB,CAIpC,IAFApR,EAAI4Q,EAAOQ,gBAAiB,GAAIC,aAAalM,GAAK,IAEtCA,EAAJlF,GAQJoQ,EAAW,OAAPrQ,EAAEC,IAAgBD,EAAEC,EAAI,KAAO,IAM9BoQ,GAAK,MACNhF,EAAIuF,EAAOQ,gBAAiB,GAAIC,aAAY,IAC5CrR,EAAEC,GAAKoL,EAAE,GACTrL,EAAEC,EAAI,GAAKoL,EAAE,KAKb3I,EAAErB,KAAMgP,EAAI,MACZpQ,GAAK,EAGbA,GAAIkF,EAAI,MAGL,IAAKyL,GAAUA,EAAOU,YAAc,CAKvC,IAFAtR,EAAI4Q,EAAOU,YAAanM,GAAK,GAEjBA,EAAJlF,GAMJoQ,EAAsB,iBAAP,GAAPrQ,EAAEC,IAA6C,cAAXD,EAAEC,EAAI,GAC/B,WAAXD,EAAEC,EAAI,GAAkC,SAAXD,EAAEC,EAAI,IACnCD,EAAEC,EAAI,IAAM,KAASD,EAAEC,EAAI,IAAM,GAAMD,EAAEC,EAAI,GAEhDoQ,GAAK,KACNO,EAAOU,YAAY,GAAGC,KAAMvR,EAAGC,IAI/ByC,EAAErB,KAAMgP,EAAI,MACZpQ,GAAK,EAGbA,GAAIkF,EAAI,MACDqG,IACPC,EAAO,GAAI,qBAAsBmF,EAKzC,KAAK3Q,EAED,KAAYkF,EAAJlF,GACJoQ,EAAIY,IACK,KAAJZ,IAAW3N,EAAEzC,KAAOoQ,EAAI,KAcrC,KAVAlL,EAAIzC,IAAIzC,GACR4M,GAAMN,EAGDpH,GAAK0H,IACNwD,EAAIzB,EAASrC,EAAWM,GACxBnK,EAAEzC,GAAK6O,EAAW3J,EAAIkL,GAAMA,GAIf,IAAT3N,EAAEzC,GAAUyC,EAAE0K,MAAOnN,KAG7B,GAAS,EAAJA,EACDyC,GAAMjD,EAAI,OACP,CAGH,IAAMA,EAAI,GAAc,IAATiD,EAAE,GAAUA,EAAE8O,QAAS/R,GAAK8M,GAG3C,IAAMtM,EAAI,EAAGoQ,EAAI3N,EAAE,GAAI2N,GAAK,GAAIA,GAAK,GAAIpQ,KAGhCsM,EAAJtM,IAAeR,GAAK8M,EAAWtM,GAKxC,MAFAkR,GAAK1R,EAAIA,EACT0R,EAAKzO,EAAIA,EACFyO,MAqGf9D,EAAM,WAGF,QAASoE,GAAUlG,EAAGpG,EAAGuM,GACrB,GAAI1D,GAAG2D,EAAMC,EAAKC,EACdC,EAAQ,EACR7R,EAAIsL,EAAE/K,OACNuR,EAAM5M,EAAI6M,EACVC,EAAM9M,EAAI6M,EAAY,CAE1B,KAAMzG,EAAIA,EAAEvI,QAAS/C,KACjB2R,EAAMrG,EAAEtL,GAAK+R,EACbH,EAAMtG,EAAEtL,GAAK+R,EAAY,EACzBhE,EAAIiE,EAAML,EAAMC,EAAME,EACtBJ,EAAOI,EAAMH,EAAU5D,EAAIgE,EAAcA,EAAcF,EACvDA,GAAUH,EAAOD,EAAO,IAAQ1D,EAAIgE,EAAY,GAAMC,EAAMJ,EAC5DtG,EAAEtL,GAAK0R,EAAOD,CAKlB,OAFII,IAAOvG,EAAE+B,QAAQwE,GAEdvG,EAGX,QAAS2G,GAASlS,EAAGqL,EAAG8G,EAAIC,GACxB,GAAInS,GAAGoS,CAEP,IAAKF,GAAMC,EACPC,EAAMF,EAAKC,EAAK,EAAI,OAGpB,KAAMnS,EAAIoS,EAAM,EAAOF,EAAJlS,EAAQA,IAEvB,GAAKD,EAAEC,IAAMoL,EAAEpL,GAAK,CAChBoS,EAAMrS,EAAEC,GAAKoL,EAAEpL,GAAK,EAAI,EACxB,OAIZ,MAAOoS,GAGX,QAASC,GAAUtS,EAAGqL,EAAG8G,EAAIT,GAIzB,IAHA,GAAIzR,GAAI,EAGAkS,KACJnS,EAAEmS,IAAOlS,EACTA,EAAID,EAAEmS,GAAM9G,EAAE8G,GAAM,EAAI,EACxBnS,EAAEmS,GAAMlS,EAAIyR,EAAO1R,EAAEmS,GAAM9G,EAAE8G,EAIjC,OAASnS,EAAE,IAAMA,EAAEQ,OAAS,EAAGR,EAAEwR,UAIrC,MAAO,UAAWjG,EAAGqB,EAAGC,EAAIC,EAAI4E,GAC5B,GAAIW,GAAK5S,EAAGQ,EAAGsS,EAAM5S,EAAG6S,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACjEC,EAAIC,EACJtT,EAAI0L,EAAE1L,GAAK+M,EAAE/M,EAAI,EAAI,GACrB8M,EAAKpB,EAAE7I,EACP0Q,EAAKxG,EAAElK,CAGX,MAAMiK,GAAOA,EAAG,IAAOyG,GAAOA,EAAG,IAE7B,MAAO,IAAIzM,GAGR4E,EAAE1L,GAAM+M,EAAE/M,IAAO8M,GAAKyG,GAAMzG,EAAG,IAAMyG,EAAG,GAAMA,GAG7CzG,GAAe,GAATA,EAAG,KAAYyG,EAAS,EAAJvT,EAAQA,EAAI,EAHcwT,IAoB5D,KAbAX,EAAI,GAAI/L,GAAU9G,GAClB8S,EAAKD,EAAEhQ,KACPjD,EAAI8L,EAAE9L,EAAImN,EAAEnN,EACZI,EAAIgN,EAAKpN,EAAI,EAEPiS,IACFA,EAAO3C,EACPtP,EAAI6T,EAAU/H,EAAE9L,EAAI8M,GAAa+G,EAAU1G,EAAEnN,EAAI8M,GACjD1M,EAAIA,EAAI0M,EAAW,GAKjBtM,EAAI,EAAGmT,EAAGnT,KAAQ0M,EAAG1M,IAAM,GAAKA,KAGtC,GAFKmT,EAAGnT,IAAO0M,EAAG1M,IAAM,IAAMR,IAErB,EAAJI,EACD8S,EAAGtR,KAAK,GACRkR,GAAO,MACJ,CAsBH,IArBAS,EAAKrG,EAAGnM,OACR0S,EAAKE,EAAG5S,OACRP,EAAI,EACJJ,GAAK,EAILF,EAAImP,EAAW4C,GAAS0B,EAAG,GAAK,IAE3BzT,EAAI,IACLyT,EAAK3B,EAAU2B,EAAIzT,EAAG+R,GACtB/E,EAAK8E,EAAU9E,EAAIhN,EAAG+R,GACtBwB,EAAKE,EAAG5S,OACRwS,EAAKrG,EAAGnM,QAGZuS,EAAKG,EACLN,EAAMjG,EAAG3J,MAAO,EAAGkQ,GACnBL,EAAOD,EAAIpS,OAGI0S,EAAPL,EAAWD,EAAIC,KAAU,GACjCM,EAAKC,EAAGpQ,QACRmQ,EAAG7F,QAAQ,GACX2F,EAAMG,EAAG,GACJA,EAAG,IAAM1B,EAAO,GAAIuB,GAEzB,GACItT,GAAI,EAGJ0S,EAAMH,EAASkB,EAAIR,EAAKM,EAAIL,GAGjB,EAANR,GAIDS,EAAOF,EAAI,GACNM,GAAML,IAAOC,EAAOA,EAAOpB,GAASkB,EAAI,IAAM,IAGnDjT,EAAImP,EAAWgE,EAAOG,GAUjBtT,EAAI,GACAA,GAAK+R,IAAO/R,EAAI+R,EAAO,GAG5Bc,EAAOf,EAAU2B,EAAIzT,EAAG+R,GACxBe,EAAQD,EAAKhS,OACbqS,EAAOD,EAAIpS,OAGX6R,EAAMH,EAASM,EAAMI,EAAKH,EAAOI,GAGrB,GAAPR,IACD1S,IAGA2S,EAAUE,EAAWC,EAALS,EAAaC,EAAKC,EAAIX,EAAOf,MAQvC,GAAL/R,IAAS0S,EAAM1S,EAAI,GACxB6S,EAAOY,EAAGpQ,SAGdyP,EAAQD,EAAKhS,OACAqS,EAARJ,GAAeD,EAAKlF,QAAQ,GAGjCgF,EAAUM,EAAKJ,EAAMK,EAAMnB,GAGf,IAAPW,IACDQ,EAAOD,EAAIpS,OAGX6R,EAAMH,EAASkB,EAAIR,EAAKM,EAAIL,GAGjB,EAANR,IACD1S,IAGA2S,EAAUM,EAAUC,EAALK,EAAYC,EAAKC,EAAIP,EAAMnB,KAGlDmB,EAAOD,EAAIpS,QACK,IAAR6R,IACR1S,IACAiT,GAAO,IAKXD,EAAG1S,KAAON,EAGL0S,GAAOO,EAAI,GACZA,EAAIC,KAAUlG,EAAGoG,IAAO,GAExBH,GAAQjG,EAAGoG,IACXF,EAAO,UAEHE,IAAOC,GAAgB,MAAVJ,EAAI,KAAgB/S,IAE7C0S,GAAiB,MAAVK,EAAI,GAGLD,EAAG,IAAKA,EAAGnB,QAGrB,GAAKE,GAAQ3C,EAAO,CAGhB,IAAM9O,EAAI,EAAGJ,EAAI8S,EAAG,GAAI9S,GAAK,GAAIA,GAAK,GAAII,KAC1C2H,EAAO8K,EAAG7F,GAAO6F,EAAEjT,EAAIQ,EAAIR,EAAI8M,EAAW,GAAM,EAAGO,EAAIyF,OAIvDG,GAAEjT,EAAIA,EACNiT,EAAE9S,GAAK2S,CAGX,OAAOG,OAgJf1G,EAAe,WACX,GAAIuH,GAAa,8BACbC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,4BAEvB,OAAO,UAAWpI,EAAG5B,EAAK2B,EAAKD,GAC3B,GAAIqG,GACA7R,EAAIyL,EAAM3B,EAAMA,EAAIQ,QAASwJ,EAAkB,GAGnD,IAAKD,EAAgB3H,KAAKlM,GACtB0L,EAAE1L,EAAI+T,MAAM/T,GAAK,KAAW,EAAJA,EAAQ,GAAK,MAClC,CACH,IAAMyL,IAGFzL,EAAIA,EAAEsK,QAASoJ,EAAY,SAAWvF,EAAG6F,EAAIC,GAEzC,MADApC,GAAoC,MAA3BoC,EAAKA,EAAG/G,eAAyB,GAAW,KAAN+G,EAAY,EAAI,EACvDzI,GAAKA,GAAKqG,EAAY1D,EAAL6F,IAGzBxI,IACAqG,EAAOrG,EAGPxL,EAAIA,EAAEsK,QAASqJ,EAAU,MAAOrJ,QAASsJ,EAAW,SAGnD9J,GAAO9J,GAAI,MAAO,IAAI8G,GAAW9G,EAAG6R,EAKzClG,IAAQC,EAAOE,EAAI,SAAYN,EAAI,SAAWA,EAAI,IAAO,UAAW1B,GACxE4B,EAAE1L,EAAI,KAGV0L,EAAE7I,EAAI6I,EAAE9L,EAAI,KACZkM,EAAK,MAmNbqD,EAAE+E,cAAgB/E,EAAEgF,IAAM,WACtB,GAAIzI,GAAI,GAAI5E,GAAUO,KAEtB,OADKqE,GAAE1L,EAAI,IAAI0L,EAAE1L,EAAI,GACd0L,GAQXyD,EAAEiF,KAAO,WACL,MAAOrM,GAAO,GAAIjB,GAAUO,MAAOA,KAAKzH,EAAI,EAAG,IAWnDuP,EAAEkF,WAAalF,EAAEqD,IAAM,SAAWzF,EAAGvB,GAEjC,MADAM,GAAK,EACEuG,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,KAQ5C2D,EAAEmF,cAAgBnF,EAAEnC,GAAK,WACrB,GAAIlN,GAAG0Q,EACH3N,EAAIwE,KAAKxE,CAEb,KAAMA,EAAI,MAAO,KAIjB,IAHA/C,IAAQ0Q,EAAI3N,EAAElC,OAAS,GAAM8S,EAAUpM,KAAKzH,EAAI8M,IAAeA,EAG1D8D,EAAI3N,EAAE2N,GAAK,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAI1Q,KAG9C,MAFS,GAAJA,IAAQA,EAAI,GAEVA,GAwBXqP,EAAEpG,UAAYoG,EAAE3B,IAAM,SAAWT,EAAGvB,GAEhC,MADAM,GAAK,EACE0B,EAAKnG,KAAM,GAAIP,GAAWiG,EAAGvB,GAAKO,EAAgB7E,IAQ7DiI,EAAEoF,mBAAqBpF,EAAEqF,SAAW,SAAWzH,EAAGvB,GAE9C,MADAM,GAAK,EACE0B,EAAKnG,KAAM,GAAIP,GAAWiG,EAAGvB,GAAK,EAAG,IAQhD2D,EAAEsF,OAAStF,EAAEuF,GAAK,SAAW3H,EAAGvB,GAE5B,MADAM,GAAK,EAC6C,IAA3CuG,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,KAQ5C2D,EAAEwF,MAAQ,WACN,MAAO5M,GAAO,GAAIjB,GAAUO,MAAOA,KAAKzH,EAAI,EAAG,IAQnDuP,EAAEyF,YAAczF,EAAE8B,GAAK,SAAWlE,EAAGvB,GAEjC,MADAM,GAAK,EACEuG,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,IAAQ,GAQpD2D,EAAE0F,qBAAuB1F,EAAE2F,IAAM,SAAW/H,EAAGvB,GAE3C,MADAM,GAAK,EACqD,KAAjDN,EAAI6G,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,MAAuB,IAANA,GAQnE2D,EAAE4F,SAAW,WACT,QAAS1N,KAAKxE,GAOlBsM,EAAE6F,UAAY7F,EAAE8F,MAAQ,WACpB,QAAS5N,KAAKxE,GAAK4Q,EAAUpM,KAAKzH,EAAI8M,GAAarF,KAAKxE,EAAElC,OAAS,GAOvEwO,EAAE4E,MAAQ,WACN,OAAQ1M,KAAKrH,GAOjBmP,EAAE+F,WAAa/F,EAAEgG,MAAQ,WACrB,MAAO9N,MAAKrH,EAAI,GAOpBmP,EAAEiG,OAAS,WACP,QAAS/N,KAAKxE,GAAkB,GAAbwE,KAAKxE,EAAE,IAQ9BsM,EAAEnH,SAAWmH,EAAE6B,GAAK,SAAWjE,EAAGvB,GAE9B,MADAM,GAAK,EACEuG,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,IAAQ,GAQpD2D,EAAEkG,kBAAoBlG,EAAEmG,IAAM,SAAWvI,EAAGvB,GAExC,MADAM,GAAK,EACqD,MAAjDN,EAAI6G,EAAShL,KAAM,GAAIP,GAAWiG,EAAGvB,MAAwB,IAANA,GAwBpE2D,EAAEtG,MAAQsG,EAAEoG,IAAM,SAAWxI,EAAGvB,GAC5B,GAAIpL,GAAG8D,EAAGrE,EAAG2V,EACT9J,EAAIrE,KACJlH,EAAIuL,EAAE1L,CAOV,IALA8L,EAAK,GACLiB,EAAI,GAAIjG,GAAWiG,EAAGvB,GACtBA,EAAIuB,EAAE/M,GAGAG,IAAMqL,EAAI,MAAO,IAAI1E,GAAU0M,IAGrC,IAAKrT,GAAKqL,EAEN,MADAuB,GAAE/M,GAAKwL,EACAE,EAAEzD,KAAK8E,EAGlB,IAAI0I,GAAK/J,EAAE9L,EAAI8M,EACXgJ,EAAK3I,EAAEnN,EAAI8M,EACXI,EAAKpB,EAAE7I,EACP0Q,EAAKxG,EAAElK,CAEX,KAAM4S,IAAOC,EAAK,CAGd,IAAM5I,IAAOyG,EAAK,MAAOzG,IAAOC,EAAE/M,GAAKwL,EAAGuB,GAAM,GAAIjG,GAAWyM,EAAK7H,EAAI8H,IAGxE,KAAM1G,EAAG,KAAOyG,EAAG,GAGf,MAAOA,GAAG,IAAOxG,EAAE/M,GAAKwL,EAAGuB,GAAM,GAAIjG,GAAWgG,EAAG,GAAKpB,EAGrC,GAAjBxE,GAAsB,EAAI,GASpC,GALAuO,EAAKhC,EAASgC,GACdC,EAAKjC,EAASiC,GACd5I,EAAKA,EAAG3J,QAGHhD,EAAIsV,EAAKC,EAAK,CAaf,KAXKF,EAAW,EAAJrV,IACRA,GAAKA,EACLN,EAAIiN,IAEJ4I,EAAKD,EACL5V,EAAI0T,GAGR1T,EAAE8V,UAGInK,EAAIrL,EAAGqL,IAAK3L,EAAE2B,KAAK,IACzB3B,EAAE8V,cAMF,KAFAzR,GAAMsR,GAASrV,EAAI2M,EAAGnM,SAAa6K,EAAI+H,EAAG5S,SAAaR,EAAIqL,EAErDrL,EAAIqL,EAAI,EAAOtH,EAAJsH,EAAOA,IAEpB,GAAKsB,EAAGtB,IAAM+H,EAAG/H,GAAK,CAClBgK,EAAO1I,EAAGtB,GAAK+H,EAAG/H,EAClB,OAYZ,GANIgK,IAAM3V,EAAIiN,EAAIA,EAAKyG,EAAIA,EAAK1T,EAAGkN,EAAE/M,GAAK+M,EAAE/M,GAE5CwL,GAAMtH,EAAIqP,EAAG5S,SAAaP,EAAI0M,EAAGnM,QAI5B6K,EAAI,EAAI,KAAQA,IAAKsB,EAAG1M,KAAO,GAIpC,IAHAoL,EAAI0D,EAAO,EAGHhL,EAAI/D,GAAK,CAEb,GAAK2M,IAAK5I,GAAKqP,EAAGrP,GAAK,CACnB,IAAM9D,EAAI8D,EAAG9D,IAAM0M,IAAK1M,GAAI0M,EAAG1M,GAAKoL,KAClCsB,EAAG1M,GACL0M,EAAG5I,IAAMgL,EAGbpC,EAAG5I,IAAMqP,EAAGrP,GAIhB,KAAiB,GAAT4I,EAAG,GAASA,EAAG6E,UAAW+D,GAGlC,MAAM5I,GAAG,GAWF2B,EAAW1B,EAAGD,EAAI4I,IAPrB3I,EAAE/M,EAAqB,GAAjBkH,EAAqB,GAAK,EAChC6F,EAAElK,GAAMkK,EAAEnN,EAAI,GACPmN,IA8BfoC,EAAEyG,OAASzG,EAAE0G,IAAM,SAAW9I,EAAGvB,GAC7B,GAAIqH,GAAG7S,EACH0L,EAAIrE,IAMR,OAJAyE,GAAK,GACLiB,EAAI,GAAIjG,GAAWiG,EAAGvB,IAGhBE,EAAE7I,IAAMkK,EAAE/M,GAAK+M,EAAElK,IAAMkK,EAAElK,EAAE,GACtB,GAAIiE,GAAU0M,MAGZzG,EAAElK,GAAK6I,EAAE7I,IAAM6I,EAAE7I,EAAE,GACrB,GAAIiE,GAAU4E,IAGL,GAAf6D,GAIDvP,EAAI+M,EAAE/M,EACN+M,EAAE/M,EAAI,EACN6S,EAAIrF,EAAK9B,EAAGqB,EAAG,EAAG,GAClBA,EAAE/M,EAAIA,EACN6S,EAAE7S,GAAKA,GAEP6S,EAAIrF,EAAK9B,EAAGqB,EAAG,EAAGwC,GAGf7D,EAAE7C,MAAOgK,EAAEpK,MAAMsE,MAQ5BoC,EAAE2G,QAAU3G,EAAE4G,IAAM,WAChB,GAAIrK,GAAI,GAAI5E,GAAUO,KAEtB,OADAqE,GAAE1L,GAAK0L,EAAE1L,GAAK,KACP0L,GAwBXyD,EAAElH,KAAOkH,EAAE6G,IAAM,SAAWjJ,EAAGvB,GAC3B,GAAI3L,GACA6L,EAAIrE,KACJlH,EAAIuL,EAAE1L,CAOV,IALA8L,EAAK,GACLiB,EAAI,GAAIjG,GAAWiG,EAAGvB,GACtBA,EAAIuB,EAAE/M,GAGAG,IAAMqL,EAAI,MAAO,IAAI1E,GAAU0M,IAGpC,IAAKrT,GAAKqL,EAEP,MADAuB,GAAE/M,GAAKwL,EACAE,EAAE7C,MAAMkE,EAGnB,IAAI0I,GAAK/J,EAAE9L,EAAI8M,EACXgJ,EAAK3I,EAAEnN,EAAI8M,EACXI,EAAKpB,EAAE7I,EACP0Q,EAAKxG,EAAElK,CAEX,KAAM4S,IAAOC,EAAK,CAGd,IAAM5I,IAAOyG,EAAK,MAAO,IAAIzM,GAAW3G,EAAI,EAI5C,KAAM2M,EAAG,KAAOyG,EAAG,GAAK,MAAOA,GAAG,GAAKxG,EAAI,GAAIjG,GAAWgG,EAAG,GAAKpB,EAAQ,EAAJvL,GAQ1E,GALAsV,EAAKhC,EAASgC,GACdC,EAAKjC,EAASiC,GACd5I,EAAKA,EAAG3J,QAGHhD,EAAIsV,EAAKC,EAAK,CAUf,IATKvV,EAAI,GACLuV,EAAKD,EACL5V,EAAI0T,IAEJpT,GAAKA,EACLN,EAAIiN,GAGRjN,EAAE8V,UACMxV,IAAKN,EAAE2B,KAAK,IACpB3B,EAAE8V,UAUN,IAPAxV,EAAI2M,EAAGnM,OACP6K,EAAI+H,EAAG5S,OAGM,EAARR,EAAIqL,IAAQ3L,EAAI0T,EAAIA,EAAKzG,EAAIA,EAAKjN,EAAG2L,EAAIrL,GAGxCA,EAAI,EAAGqL,GACTrL,GAAM2M,IAAKtB,GAAKsB,EAAGtB,GAAK+H,EAAG/H,GAAKrL,GAAM+O,EAAO,EAC7CpC,EAAGtB,IAAM0D,CAUb,OAPI/O,KACA2M,EAAGW,QAAQtN,KACTuV,GAKCjH,EAAW1B,EAAGD,EAAI4I,IAS7BvG,EAAE8G,UAAY9G,EAAER,GAAK,SAAUuH,GAC3B,GAAIpW,GAAG0Q,EACH9E,EAAIrE,KACJxE,EAAI6I,EAAE7I,CAQV,IALU,MAALqT,GAAaA,MAAQA,GAAW,IAANA,GAAiB,IAANA,IAClCvK,GAAQC,EAAO,GAAI,WAAakF,EAASoF,GACxCA,KAAOA,IAAIA,EAAI,QAGlBrT,EAAI,MAAO,KAIjB,IAHA2N,EAAI3N,EAAElC,OAAS,EACfb,EAAI0Q,EAAI9D,EAAW,EAEd8D,EAAI3N,EAAE2N,GAAK,CAGZ,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAI1Q,KAG9B,IAAM0Q,EAAI3N,EAAE,GAAI2N,GAAK,GAAIA,GAAK,GAAI1Q,MAKtC,MAFKoW,IAAKxK,EAAE9L,EAAI,EAAIE,IAAIA,EAAI4L,EAAE9L,EAAI,GAE3BE,GAiBXqP,EAAEpH,MAAQ,SAAWiF,EAAIC,GACrB,GAAInN,GAAI,GAAIgH,GAAUO,KAOtB,QALW,MAAN2F,GAAcnB,EAAYmB,EAAI,EAAG4D,EAAK,MACvC7I,EAAOjI,IAAKkN,EAAK3F,KAAKzH,EAAI,EAAS,MAANqN,GAC1BpB,EAAYoB,EAAI,EAAG,EAAG,GAAIa,GAAsC,EAALb,EAAhB/F,GAG3CpH,GAgBXqP,EAAEwC,MAAQ,SAAUrM,GAChB,GAAIxF,GAAIuH,IACR,OAAOwE,GAAYvG,GAAI6Q,EAAkBA,EAAkB,GAAI,YAG3DrW,EAAE2I,MAAO,KAAO+F,EAASlJ,IACzB,GAAIwB,GAAWhH,EAAE+C,GAAK/C,EAAE+C,EAAE,MAAasT,EAAL7Q,GAAyBA,EAAI6Q,GAC7DrW,EAAEE,GAAU,EAAJsF,EAAQ,EAAI,EAAI,GACxBxF,IAeVqP,EAAEiH,WAAajH,EAAEkH,KAAO,WACpB,GAAIlI,GAAGrO,EAAGC,EAAGuW,EAAKzW,EACd6L,EAAIrE,KACJxE,EAAI6I,EAAE7I,EACN7C,EAAI0L,EAAE1L,EACNJ,EAAI8L,EAAE9L,EACNoN,EAAKjB,EAAiB,EACtBwK,EAAO,GAAIzP,GAAU,MAGzB,IAAW,IAAN9G,IAAY6C,IAAMA,EAAE,GACrB,MAAO,IAAIiE,IAAY9G,GAAS,EAAJA,KAAY6C,GAAKA,EAAE,IAAO2Q,IAAM3Q,EAAI6I,EAAI,EAAI,EA8B5E,IA1BA1L,EAAIqR,KAAKgF,MAAO3K,GAIN,GAAL1L,GAAUA,GAAK,EAAI,GACpBF,EAAIwN,EAAczK,IACX/C,EAAEa,OAASf,GAAM,GAAK,IAAIE,GAAK,KACtCE,EAAIqR,KAAKgF,KAAKvW,GACdF,EAAI6T,GAAY7T,EAAI,GAAM,IAAY,EAAJA,GAASA,EAAI,GAE1CI,GAAK,EAAI,EACVF,EAAI,KAAOF,GAEXE,EAAIE,EAAEgO,gBACNlO,EAAIA,EAAEqD,MAAO,EAAGrD,EAAEqI,QAAQ,KAAO,GAAMvI,GAG3CG,EAAI,GAAI+G,GAAUhH,IAElBC,EAAI,GAAI+G,GAAW9G,EAAI,IAOtBD,EAAE8C,EAAE,GAML,IALAjD,EAAIG,EAAEH,EACNI,EAAIJ,EAAIoN,EACC,EAAJhN,IAAQA,EAAI,KAOb,GAHAH,EAAIE,EACJA,EAAIwW,EAAK9N,MAAO5I,EAAEoI,KAAMuF,EAAK9B,EAAG7L,EAAGmN,EAAI,KAElCM,EAAezN,EAAEgD,GAAMM,MAAO,EAAGnD,MAAUF,EAC3CwN,EAAevN,EAAE8C,IAAMM,MAAO,EAAGnD,GAAM,CAWxC,GANKD,EAAEH,EAAIA,KAAMI,EACjBF,EAAIA,EAAEqD,MAAOnD,EAAI,EAAGA,EAAI,GAKd,QAALF,IAAgBwW,GAAY,QAALxW,GAgBrB,IAIIA,KAAOA,EAAEqD,MAAM,IAAqB,KAAfrD,EAAE4N,OAAO,MAGjC3F,EAAOhI,EAAGA,EAAEH,EAAImM,EAAiB,EAAG,GACpCoC,GAAKpO,EAAE0I,MAAM1I,GAAG2U,GAAGhJ,GAGvB,OAvBA,IAAM4K,IACFvO,EAAOlI,EAAGA,EAAED,EAAImM,EAAiB,EAAG,GAE/BlM,EAAE4I,MAAM5I,GAAG6U,GAAGhJ,IAAK,CACpB3L,EAAIF,CACJ,OAIRmN,GAAM,EACNhN,GAAK,EACLsW,EAAM,EAkBtB,MAAOvO,GAAOhI,EAAGA,EAAEH,EAAImM,EAAiB,EAAG7E,EAAeiH,IAwB9DgB,EAAE1G,MAAQ0G,EAAEqH,IAAM,SAAWzJ,EAAGvB,GAC5B,GAAI3I,GAAGjD,EAAGQ,EAAG8D,EAAGoB,EAAG6I,EAAGsI,EAAK1E,EAAKC,EAAK0E,EAAKC,EAAKC,EAAKC,EAChDhF,EAAMiF,EACNpL,EAAIrE,KACJyF,EAAKpB,EAAE7I,EACP0Q,GAAOzH,EAAK,GAAIiB,EAAI,GAAIjG,GAAWiG,EAAGvB,IAAM3I,CAGhD,MAAMiK,GAAOyG,GAAOzG,EAAG,IAAOyG,EAAG,IAmB7B,OAhBM7H,EAAE1L,IAAM+M,EAAE/M,GAAK8M,IAAOA,EAAG,KAAOyG,GAAMA,IAAOA,EAAG,KAAOzG,EACzDC,EAAElK,EAAIkK,EAAEnN,EAAImN,EAAE/M,EAAI,MAElB+M,EAAE/M,GAAK0L,EAAE1L,EAGH8M,GAAOyG,GAKTxG,EAAElK,GAAK,GACPkK,EAAEnN,EAAI,GALNmN,EAAElK,EAAIkK,EAAEnN,EAAI,MASbmN,CAYX,KATAnN,EAAI6T,EAAU/H,EAAE9L,EAAI8M,GAAa+G,EAAU1G,EAAEnN,EAAI8M,GACjDK,EAAE/M,GAAK0L,EAAE1L,EACTyW,EAAM3J,EAAGnM,OACT+V,EAAMnD,EAAG5S,OAGE+V,EAAND,IAAYI,EAAK/J,EAAIA,EAAKyG,EAAIA,EAAKsD,EAAIzW,EAAIqW,EAAKA,EAAMC,EAAKA,EAAMtW,GAGhEA,EAAIqW,EAAMC,EAAKG,KAASzW,IAAKyW,EAAGrV,KAAK,IAK3C,IAHAqQ,EAAO3C,EACP4H,EAAW3E,EAEL/R,EAAIsW,IAAOtW,GAAK,GAAK,CAKvB,IAJAyC,EAAI,EACJ8T,EAAMpD,EAAGnT,GAAK0W,EACdF,EAAMrD,EAAGnT,GAAK0W,EAAW,EAEnBxR,EAAImR,EAAKvS,EAAI9D,EAAIkF,EAAGpB,EAAI9D,GAC1B2R,EAAMjF,IAAKxH,GAAKwR,EAChB9E,EAAMlF,EAAGxH,GAAKwR,EAAW,EACzB3I,EAAIyI,EAAM7E,EAAMC,EAAM2E,EACtB5E,EAAM4E,EAAM5E,EAAU5D,EAAI2I,EAAaA,EAAaD,EAAG3S,GAAKrB,EAC5DA,GAAMkP,EAAMF,EAAO,IAAQ1D,EAAI2I,EAAW,GAAMF,EAAM5E,EACtD6E,EAAG3S,KAAO6N,EAAMF,CAGpBgF,GAAG3S,GAAKrB,EASZ,MANIA,KACEjD,EAEFiX,EAAGlF,QAGAlD,EAAW1B,EAAG8J,EAAIjX,IAgB7BuP,EAAE4H,SAAW,SAAWpI,EAAI1B,GACxB,GAAInN,GAAI,GAAIgH,GAAUO,KAGtB,OAFAsH,GAAW,MAANA,GAAe9C,EAAY8C,EAAI,EAAGiC,EAAK,GAAI,aAA4B,EAALjC,EAAP,KAChE1B,EAAW,MAANA,GAAepB,EAAYoB,EAAI,EAAG,EAAG,GAAIa,GAAsC,EAALb,EAAhB/F,EACxDyH,EAAK5G,EAAOjI,EAAG6O,EAAI1B,GAAOnN,GAgBrCqP,EAAEnB,cAAgB,SAAWhB,EAAIC,GAC7B,MAAO7I,GAAQiD,KACP,MAAN2F,GAAcnB,EAAYmB,EAAI,EAAG4D,EAAK,MAAS5D,EAAK,EAAI,KAAMC,EAAI,KAmBxEkC,EAAEpE,QAAU,SAAWiC,EAAIC,GACvB,MAAO7I,GAAQiD,KAAY,MAAN2F,GAAcnB,EAAYmB,EAAI,EAAG4D,EAAK,MACrD5D,EAAK3F,KAAKzH,EAAI,EAAI,KAAMqN,EAAI,KA0BtCkC,EAAE6H,SAAW,SAAWhK,EAAIC,GACxB,GAAInD,GAAM1F,EAAQiD,KAAY,MAAN2F,GAAcnB,EAAYmB,EAAI,EAAG4D,EAAK,MACxD5D,EAAK3F,KAAKzH,EAAI,EAAI,KAAMqN,EAAI,GAElC,IAAK5F,KAAKxE,EAAI,CACV,GAAIzC,GACA6W,EAAMnN,EAAIoN,MAAM,KAChBC,GAAM3H,EAAOG,UACbyH,GAAM5H,EAAOI,mBACbF,EAAiBF,EAAOE,eACxB2H,EAAUJ,EAAI,GACdK,EAAeL,EAAI,GACnB9B,EAAQ9N,KAAKrH,EAAI,EACjBuX,EAAYpC,EAAQkC,EAAQlU,MAAM,GAAKkU,EACvCnW,EAAMqW,EAAU5W,MAIpB,IAFIyW,IAAIhX,EAAI+W,EAAIA,EAAKC,EAAIA,EAAKhX,EAAGc,GAAOd,GAEnC+W,EAAK,GAAKjW,EAAM,EAAI,CAIrB,IAHAd,EAAIc,EAAMiW,GAAMA,EAChBE,EAAUE,EAAUnP,OAAQ,EAAGhI,GAEnBc,EAAJd,EAASA,GAAK+W,EAClBE,GAAW3H,EAAiB6H,EAAUnP,OAAQhI,EAAG+W,EAGhDC,GAAK,IAAIC,GAAW3H,EAAiB6H,EAAUpU,MAAM/C,IACtD+U,IAAOkC,EAAU,IAAMA,GAG/BvN,EAAMwN,EACFD,EAAU7H,EAAOC,mBAAuB2H,GAAM5H,EAAOM,mBACnDwH,EAAahN,QAAS,GAAI0B,QAAQ,OAASoL,EAAK,OAAQ,KACxD,KAAO5H,EAAOK,wBACdyH,GACFD,EAGR,MAAOvN,IAgBXqF,EAAEqI,WAAa,SAAUC,GACrB,GAAIR,GAAKS,EAAIC,EAAI/X,EAAGgY,EAAK9X,EAAG+X,EAAIhF,EAAG7S,EAC/BsF,EAAIqG,EACJD,EAAIrE,KACJyF,EAAKpB,EAAE7I,EACPgK,EAAI,GAAI/F,GAAUsI,GAClB0I,EAAKJ,EAAK,GAAI5Q,GAAUsI,GACxB2I,EAAKF,EAAK,GAAI/Q,GAAUsI,EAoB5B,IAlBW,MAANqI,IACD9L,GAAS,EACT7L,EAAI,GAAIgH,GAAU2Q,GAClB9L,EAASrG,KAEDA,EAAIxF,EAAEmV,UAAanV,EAAEkR,GAAG5B,MAExBzD,GACAC,EAAO,GACL,oBAAuBtG,EAAI,eAAiB,kBAAoBmS,GAKtEA,GAAMnS,GAAKxF,EAAE+C,GAAKkF,EAAOjI,EAAGA,EAAEF,EAAI,EAAG,GAAIkV,IAAI1F,GAAOtP,EAAI,QAI1DgN,EAAK,MAAOpB,GAAExD,UAgBpB,KAfAlI,EAAIsN,EAAcR,GAIlBlN,EAAIiN,EAAEjN,EAAII,EAAEW,OAAS+K,EAAE9L,EAAI,EAC3BiN,EAAEhK,EAAE,GAAKkM,GAAY6I,EAAMhY,EAAI8M,GAAa,EAAIA,EAAWkL,EAAMA,GACjEH,GAAMA,GAAM3X,EAAE0S,IAAI3F,GAAK,EAAMjN,EAAI,EAAIiN,EAAIiL,EAAOhY,EAEhD8X,EAAMpL,EACNA,EAAU,EAAI,EACd1M,EAAI,GAAIgH,GAAU9G,GAGlB6X,EAAGhV,EAAE,GAAK,EAGNgQ,EAAIrF,EAAK1N,EAAG+M,EAAG,EAAG,GAClB8K,EAAKD,EAAGzP,KAAM4K,EAAEpK,MAAMsP,IACH,GAAdJ,EAAGnF,IAAIiF,IACZC,EAAKK,EACLA,EAAKJ,EACLG,EAAKD,EAAG5P,KAAM4K,EAAEpK,MAAOkP,EAAKG,IAC5BD,EAAKF,EACL9K,EAAI/M,EAAE+I,MAAOgK,EAAEpK,MAAOkP,EAAK9K,IAC3B/M,EAAI6X,CAgBR,OAbAA,GAAKnK,EAAKiK,EAAG5O,MAAM6O,GAAKK,EAAI,EAAG,GAC/BF,EAAKA,EAAG5P,KAAM0P,EAAGlP,MAAMqP,IACvBJ,EAAKA,EAAGzP,KAAM0P,EAAGlP,MAAMsP,IACvBF,EAAG7X,EAAI8X,EAAG9X,EAAI0L,EAAE1L,EAChBJ,GAAK,EAGLqX,EAAMzJ,EAAKsK,EAAIC,EAAInY,EAAGsH,GAAgB2B,MAAM6C,GAAGyI,MAAM3B,IAC/ChF,EAAKqK,EAAIH,EAAI9X,EAAGsH,GAAgB2B,MAAM6C,GAAGyI,OAAU,GAC7C2D,EAAG5P,WAAY6P,EAAG7P,aAClB2P,EAAG3P,WAAYwP,EAAGxP,YAE9BsE,EAAUoL,EACHX,GAOX9H,EAAE6I,SAAW,WACT,GAAItM,GAAIrE,IAGR,QAAQqE,IAAOA,EAAE1L,EAAU,EAAN0L,EAAE1L,EAAQwT,MAenCrE,EAAE8I,QAAU9I,EAAEzG,IAAM,SAAU5I,GAC1B,GAAIwF,GAAGyH,EACH3M,EAAI6O,EAAe,EAAJnP,GAASA,GAAKA,GAC7B4L,EAAIrE,IAGR,KAAMwE,EAAY/L,GAAIqW,EAAkBA,EAAkB,GAAI,eACzDpB,SAASjV,IAAMM,EAAI+V,IAAsBrW,GAAK,IAC/CoY,WAAWpY,IAAMA,KAAQA,EAAI0T,MAC7B,MAAO,IAAI1M,GAAWuK,KAAK3I,KAAMgD,EAAG5L,GASxC,KAHAwF,EAAI6H,EAAgB6B,EAAU7B,EAAgBT,EAAW,GAAM,EAC/DK,EAAI,GAAIjG,GAAUsI,KAEN,CAER,GAAKhP,EAAI,EAAI,CAET,GADA2M,EAAIA,EAAEtE,MAAMiD,IACNqB,EAAElK,EAAI,KACPyC,IAAKyH,EAAElK,EAAElC,OAAS2E,IAAIyH,EAAElK,EAAElC,OAAS2E,GAI5C,GADAlF,EAAI6O,EAAW7O,EAAI,IACbA,EAAI,KAEVsL,GAAIA,EAAEjD,MAAMiD,GACPpG,GAAKoG,EAAE7I,GAAK6I,EAAE7I,EAAElC,OAAS2E,IAAIoG,EAAE7I,EAAElC,OAAS2E,GAInD,MADS,GAAJxF,IAAQiN,EAAIqC,EAAI5B,IAAIT,IAClBzH,EAAIyC,EAAOgF,EAAGI,EAAejG,GAAkB6F,GAkB1DoC,EAAEgJ,YAAc,SAAWxJ,EAAI1B,GAC3B,MAAO7I,GAAQiD,KAAY,MAANsH,GAAc9C,EAAY8C,EAAI,EAAGiC,EAAK,GAAI,aACtD,EAALjC,EAAS,KAAM1B,EAAI,KAgB3BkC,EAAEjH,SAAW,SAAUsD,GACnB,GAAI1B,GACAhK,EAAIuH,KACJrH,EAAIF,EAAEE,EACNJ,EAAIE,EAAEF,CAyBV,OAtBW,QAANA,EAEGI,GACA8J,EAAM,WACG,EAAJ9J,IAAQ8J,EAAM,IAAMA,IAEzBA,EAAM,OAGVA,EAAMwD,EAAexN,EAAE+C,GAOnBiH,EALM,MAAL0B,GAAcK,EAAYL,EAAG,EAAG,GAAI,GAAI,QAKnCa,EAAagB,EAAcvD,EAAKlK,GAAS,EAAJ4L,EAAO,GAAIxL,GAJ3C+N,GAALnO,GAAmBA,GAAKyP,EAC1BrB,EAAelE,EAAKlK,GACpByN,EAAcvD,EAAKlK,GAKlB,EAAJI,GAASF,EAAE+C,EAAE,KAAKiH,EAAM,IAAMA,IAGhCA,GAQXqF,EAAEiJ,UAAYjJ,EAAEkJ,MAAQ,WACpB,MAAOtQ,GAAO,GAAIjB,GAAUO,MAAOA,KAAKzH,EAAI,EAAG,IAQnDuP,EAAEmJ,QAAUnJ,EAAEoJ,OAAS,WACnB,MAAOlR,MAAKa,YAcE,MAAbqD,GAAoBzE,EAAUgB,OAAOyD,GAEnCzE,EAOX,QAAS2M,GAAS3T,GACd,GAAIM,GAAQ,EAAJN,CACR,OAAOA,GAAI,GAAKA,IAAMM,EAAIA,EAAIA,EAAI,EAKtC,QAASkN,GAAcnN,GAMnB,IALA,GAAIH,GAAGkW,EACH9V,EAAI,EACJ8D,EAAI/D,EAAEQ,OACNZ,EAAII,EAAE,GAAK,GAEH+D,EAAJ9D,GAAS,CAGb,IAFAJ,EAAIG,EAAEC,KAAO,GACb8V,EAAIxJ,EAAW1M,EAAEW,OACTuV,IAAKlW,EAAI,IAAMA,GACvBD,GAAKC,EAIT,IAAMkE,EAAInE,EAAEY,OAA8B,KAAtBZ,EAAEqK,aAAalG,KACnC,MAAOnE,GAAEoD,MAAO,EAAGe,EAAI,GAAK,GAKhC,QAASmO,GAAS3G,EAAGqB,GACjB,GAAI5M,GAAGqL,EACHsB,EAAKpB,EAAE7I,EACP0Q,EAAKxG,EAAElK,EACPzC,EAAIsL,EAAE1L,EACNkE,EAAI6I,EAAE/M,EACNsF,EAAIoG,EAAE9L,EACNY,EAAIuM,EAAEnN,CAGV,KAAMQ,IAAM8D,EAAI,MAAO,KAMvB,IAJA/D,EAAI2M,IAAOA,EAAG,GACdtB,EAAI+H,IAAOA,EAAG,GAGTpT,GAAKqL,EAAI,MAAOrL,GAAIqL,EAAI,GAAKtH,EAAI9D,CAGtC,IAAKA,GAAK8D,EAAI,MAAO9D,EAMrB,IAJAD,EAAQ,EAAJC,EACJoL,EAAIlG,GAAK9E,GAGHsM,IAAOyG,EAAK,MAAO/H,GAAI,GAAKsB,EAAK3M,EAAI,EAAI,EAG/C,KAAMqL,EAAI,MAAOlG,GAAI9E,EAAIL,EAAI,EAAI,EAKjC,KAHA+D,GAAMoB,EAAIwH,EAAGnM,SAAaH,EAAI+S,EAAG5S,QAAW2E,EAAI9E,EAG1CJ,EAAI,EAAO8D,EAAJ9D,EAAOA,IAAM,GAAK0M,EAAG1M,IAAMmT,EAAGnT,GAAK,MAAO0M,GAAG1M,GAAKmT,EAAGnT,GAAKD,EAAI,EAAI,EAG/E,OAAOmF,IAAK9E,EAAI,EAAI8E,EAAI9E,EAAIL,EAAI,EAAI,GASxC,QAAS0Q,GAAsB/Q,EAAGwO,EAAKC,GACnC,OAASzO,EAAI0O,EAAS1O,KAAQwO,GAAYC,GAALzO,EAIzC,QAASsO,GAAQoK,GACb,MAA8C,kBAAvCC,OAAOtS,UAAU+B,SAASxH,KAAK8X,GAS1C,QAASpL,GAAWtD,EAAK8C,EAAQD,GAO7B,IANA,GAAIzI,GAEAwU,EADAzB,GAAO,GAEP7W,EAAI,EACJc,EAAM4I,EAAInJ,OAEFO,EAAJd,GAAW,CACf,IAAMsY,EAAOzB,EAAItW,OAAQ+X,IAAQzB,EAAIyB,IAAS9L,GAG9C,IAFAqK,EAAK/S,EAAI,IAAO+H,EAAS9D,QAAS2B,EAAI4D,OAAQtN,MAEtC8D,EAAI+S,EAAItW,OAAQuD,IAEf+S,EAAI/S,GAAKyI,EAAU,IACD,MAAdsK,EAAI/S,EAAI,KAAa+S,EAAI/S,EAAI,GAAK,GACvC+S,EAAI/S,EAAI,IAAM+S,EAAI/S,GAAKyI,EAAU,EACjCsK,EAAI/S,IAAMyI,GAKtB,MAAOsK,GAAItB,UAIf,QAAS3H,GAAelE,EAAKlK,GACzB,OAASkK,EAAInJ,OAAS,EAAImJ,EAAI4D,OAAO,GAAK,IAAM5D,EAAI3G,MAAM,GAAK2G,IACvD,EAAJlK,EAAQ,IAAM,MAASA,EAI/B,QAASyN,GAAcvD,EAAKlK,GACxB,GAAIsB,GAAKgV,CAGT,IAAS,EAAJtW,EAAQ,CAGT,IAAMsW,EAAI,OAAQtW,EAAGsW,GAAK,KAC1BpM,EAAMoM,EAAIpM,MAOV,IAHA5I,EAAM4I,EAAInJ,SAGHf,EAAIsB,EAAM,CACb,IAAMgV,EAAI,IAAKtW,GAAKsB,IAAOtB,EAAGsW,GAAK,KACnCpM,GAAOoM,MACKhV,GAAJtB,IACRkK,EAAMA,EAAI3G,MAAO,EAAGvD,GAAM,IAAMkK,EAAI3G,MAAMvD,GAIlD,OAAOkK,GAIX,QAAS0E,GAAS1O,GAEd,MADAA,GAAIoY,WAAWpY,GACJ,EAAJA,EAAQkP,EAASlP,GAAKmP,EAAUnP,GAxkF3C,GAAIgH,GAAWiK,EAAQ5E,EACnBG,EAAY,uCACZ0C,EAAWqC,KAAK+C,KAChBnF,EAAYoC,KAAKsD,MACjB7D,EAAU,iCACVhD,EAAe,gBACf1B,EAAgB,kDAChBH,EAAW,mEACXiD,EAAO,KACPxC,EAAW,GACXyJ,EAAmB,iBAEnBpH,GAAY,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAC7EoD,EAAY,IAOZvB,EAAM,GA8jFV,IAHA9J,EAAYwE,IAGU,kBAAVqN,SAAwBA,OAAOC,IACvCD,OAAQ,WAAc,MAAO7R,SAG1B,IAAsB,mBAAVhG,IAAyBA,EAAOL,SAE/C,GADAK,EAAOL,QAAUqG,GACXiK,EAAS,IAAMA,EAASpR,EAAQ,UAAa,MAAOC,SAI1DyL,GAAOvE,UAAYA,GAExBO,QAEA0J,OAAS,IAAI8H,SAAW,SAASlZ,EAAQmB,GAuB5C,GAAIgY,GAAMnZ,EAAQ,yCAMdkZ,EAAU,WASV,GAAIE,GAAgB,SAAUP,EAAKQ,GAC/BP,OAAOQ,KAAKT,GAAK1U,QAAQ,SAAUoV,GAC/BF,EAAQE,GAAOV,EAAIU,MAWvBC,EAAe,SAAUX,GACzB,MAAOC,QAAOQ,KAAKT,GAAKnU,OAAO,SAAUC,EAAK4U,GAC1C,MAAO5U,GAAM,OAAS4U,EAAM,eAAiBA,EAAM,SACpD,KAYHE,EAAoB,SAASN,EAAKhT,GAClC,MAAOgT,GAAItO,OAAO,SAAU7E,GACxB,MAAOA,GAAOG,OAASA,IACxB,IAWHuT,EAAuB,SAAU1T,EAAQ2T,GAEzC,GAAI5V,GAASoV,EAAInU,aAAagB,EAAOlC,OAAQ,KAAO6V,EAAY5V,OAAO,GAAG6V,KAAKpW,MAAM,IAErF,OAAOwC,GAAOlC,OAAOY,OAAO,SAAUC,EAAKmG,EAASzG,GAEhD,MADAM,GAAImG,EAAQ3E,MAAQpC,EAAOM,GACpBM,QAaXkV,EAA2B,SAAUC,EAAYC,GACjD,GAIIC,GAJAC,EAAsB,GAGtBC,EAAU,yBAEVC,EAAY,CAChB,KACI,KAA8C,QAAtCH,EAAQE,EAAQE,KAAKN,KAAuB,CAChD,GAAIO,GAAaH,EAAQC,UAAYH,EAAM,GAAGhZ,OAC1CsZ,EAASN,EAAM,GAAGxW,MAAM,EAAGwW,EAAM,GAAGhZ,OAAS,EACjDiZ,IAAuBH,EAAWtW,MAAM2W,EAAWE,EACnD,IAAIE,GAAgBR,EAAGO,EACvBL,IAAuBM,EACvBJ,EAAYD,EAAQC,UAGxBF,GAAuBH,EAAWtW,MAAM2W,GAE5C,MAAOK,GACH,KAAM,IAAI7Z,OAAM,iDAGpB,MAAOsZ,IAaPQ,EAAqB,SAAUX,EAAY/Y,GAE3C,GAAIsY,KAEJ,IAAMtY,EACF,IACI,GAAIiF,GAASyT,EAAkB1Y,EAAKoY,IAAKpY,EAAKiF,QAC1CjC,EAAS2V,EAAqB1T,EAAQjF,EAAK4Y,YAC/CP,GAAcrV,EAAQsV,GAE1B,MAAOmB,GACH,KAAM,IAAI7Z,OAAM,oDAIxB,GAAIC,GAAO4Y,EAAaH,GAEpBY,EAAsBJ,EAAyBC,EAAY,SAAUQ,GACrE,GAAII,GAAK,GAAIC,UAAS,UAAW/Z,EAAO,UAAY0Z,EAAS,IAC7D,OAAOI,GAAGrB,GAAS9Q,YAGvB,OAAO0R,IAYPW,EAAyB,SAAUd,EAAY/Y,GAC/C,IACI,MAAO0Z,GAAmBX,EAAY/Y,GAE1C,MAAOyZ,GACH,MAAOA,GAAIK,SAInB,QACIJ,mBAAoBA,EACpBG,uBAAwBA,KAKhCzZ,GAAOL,QAAUoY,IAGd4B,wCAAwC"} \ No newline at end of file diff --git a/libnatspec/natspecjs/dist/natspec.min.js b/libnatspec/natspecjs/dist/natspec.min.js new file mode 100644 index 000000000..6cf28d756 --- /dev/null +++ b/libnatspec/natspecjs/dist/natspec.min.js @@ -0,0 +1,2 @@ +require=function t(e,n,r){function i(f,u){if(!n[f]){if(!e[f]){var s="function"==typeof require&&require;if(!u&&s)return s(f,!0);if(o)return o(f,!0);var c=new Error("Cannot find module '"+f+"'");throw c.code="MODULE_NOT_FOUND",c}var a=n[f]={exports:{}};e[f][0].call(a.exports,function(t){var n=e[f][1][t];return i(n?n:t)},a,a.exports,t,e,n,r)}return n[f].exports}for(var o="function"==typeof require&&require,f=0;fv;v++)d.push(g(e.slice(0,s))),e=e.slice(s);n.push(d)}else r.prefixedType("string")(t[c].type)?(a=a.slice(s),n.push(g(e.slice(0,s))),e=e.slice(s)):(n.push(g(e.slice(0,s))),e=e.slice(s))}),n},g=function(t){var e={};return t.forEach(function(t){var r=n.extractDisplayName(t.name),i=n.extractTypeName(t.name),o=function(){var e=Array.prototype.slice.call(arguments);return a(t.inputs,e)};void 0===e[r]&&(e[r]=o),e[r][i]=o}),e},m=function(t){var e={};return t.forEach(function(t){var r=n.extractDisplayName(t.name),i=n.extractTypeName(t.name),o=function(e){return h(t.outputs,e)};void 0===e[r]&&(e[r]=o),e[r][i]=o}),e};e.exports={inputParser:g,outputParser:m,formatInput:a,formatOutput:h}},{"./const":4,"./formatters":5,"./types":6,"./utils":7}],4:[function(t,e){(function(n){if("build"!==n.env.NODE_ENV)var r=t("bignumber.js");var i=["wei","Kwei","Mwei","Gwei","szabo","finney","ether","grand","Mether","Gether","Tether","Pether","Eether","Zether","Yether","Nether","Dether","Vether","Uether"];e.exports={ETH_PADDING:32,ETH_SIGNATURE_LENGTH:4,ETH_UNITS:i,ETH_BIGNUMBER_ROUNDING_MODE:{ROUNDING_MODE:r.ROUND_DOWN},ETH_POLLING_TIMEOUT:1e3}}).call(this,t("_process"))},{_process:2,"bignumber.js":8}],5:[function(t,e){(function(n){if("build"!==n.env.NODE_ENV)var r=t("bignumber.js");var i=t("./utils"),o=t("./const"),f=function(t,e,n){return new Array(e-t.length+1).join(n?n:"0")+t},u=function(t){var e=2*o.ETH_PADDING;return t instanceof r||"number"==typeof t?("number"==typeof t&&(t=new r(t)),r.config(o.ETH_BIGNUMBER_ROUNDING_MODE),t=t.round(),t.lessThan(0)&&(t=new r("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",16).plus(t).plus(1)),t=t.toString(16)):t=0===t.indexOf("0x")?t.substr(2):"string"==typeof t?u(new r(t)):(+t).toString(16),f(t,e)},s=function(t){return i.fromAscii(t,o.ETH_PADDING).substr(2)},c=function(t){return"000000000000000000000000000000000000000000000000000000000000000"+(t?"1":"0")},a=function(t){return u(new r(t).times(new r(2).pow(128)))},l=function(t){return"1"===new r(t.substr(0,1),16).toString(2).substr(0,1)},p=function(t){return t=t||"0",l(t)?new r(t,16).minus(new r("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",16)).minus(1):new r(t,16)},h=function(t){return t=t||"0",new r(t,16)},g=function(t){return p(t).dividedBy(new r(2).pow(128))},m=function(t){return h(t).dividedBy(new r(2).pow(128))},d=function(t){return"0x"+t},v=function(t){return"0000000000000000000000000000000000000000000000000000000000000001"===t?!0:!1},w=function(t){return i.toAscii(t)},y=function(t){return"0x"+t.slice(t.length-40,t.length)};e.exports={formatInputInt:u,formatInputString:s,formatInputBool:c,formatInputReal:a,formatOutputInt:p,formatOutputUInt:h,formatOutputReal:g,formatOutputUReal:m,formatOutputHash:d,formatOutputBool:v,formatOutputString:w,formatOutputAddress:y}}).call(this,t("_process"))},{"./const":4,"./utils":7,_process:2,"bignumber.js":8}],6:[function(t,e){var n=t("./formatters"),r=function(t){return function(e){return 0===e.indexOf(t)}},i=function(t){return function(e){return t===e}},o=function(){return[{type:r("uint"),format:n.formatInputInt},{type:r("int"),format:n.formatInputInt},{type:r("hash"),format:n.formatInputInt},{type:r("string"),format:n.formatInputString},{type:r("real"),format:n.formatInputReal},{type:r("ureal"),format:n.formatInputReal},{type:i("address"),format:n.formatInputInt},{type:i("bool"),format:n.formatInputBool}]},f=function(){return[{type:r("uint"),format:n.formatOutputUInt},{type:r("int"),format:n.formatOutputInt},{type:r("hash"),format:n.formatOutputHash},{type:r("string"),format:n.formatOutputString},{type:r("real"),format:n.formatOutputReal},{type:r("ureal"),format:n.formatOutputUReal},{type:i("address"),format:n.formatOutputAddress},{type:i("bool"),format:n.formatOutputBool}]};e.exports={prefixedType:r,namedType:i,inputTypes:o,outputTypes:f}},{"./formatters":5}],7:[function(t,e){var n=t("./const"),r=function(t,e){for(var n=!1,r=0;rn;n+=2){var i=parseInt(t.substr(n,2),16);if(0===i)break;e+=String.fromCharCode(i)}return e},o=function(t){for(var e="",n=0;n3e3&&rr?"i":"").test(c))return m(a,c,u,r);u?(a.s=0>1/t?(c=c.slice(1),-1):1,$&&c.replace(/^0\.0*|\./,"").length>15&&U(L,O,t),u=!1):a.s=45===c.charCodeAt(0)?(c=c.slice(1),-1):1,c=n(c,10,r,a.s)}else{if(t instanceof e)return a.s=t.s,a.e=t.e,a.c=(t=t.c)?t.slice():t,void(L=0);if((u="number"==typeof t)&&0*t==0){if(a.s=0>1/t?(t=-t,-1):1,t===~~t){for(o=0,f=t;f>=10;f/=10,o++);return a.e=o,a.c=[t],void(L=0)}c=t+""}else{if(!d.test(c=t+""))return m(a,c,u);a.s=45===c.charCodeAt(0)?(c=c.slice(1),-1):1}}for((o=c.indexOf("."))>-1&&(c=c.replace(".","")),(f=c.search(/e/i))>0?(0>o&&(o=f),o+=+c.slice(f+1),c=c.substring(0,f)):0>o&&(o=c.length),f=0;48===c.charCodeAt(f);f++);for(s=c.length;48===c.charCodeAt(--s););if(c=c.slice(f,s+1))if(s=c.length,u&&$&&s>15&&U(L,O,a.s*t),o=o-f-1,o>q)a.c=a.e=null;else if(k>o)a.c=[a.e=0];else{if(a.e=o,a.c=[],f=(o+1)%I,0>o&&(f+=I),s>f){for(f&&a.c.push(+c.slice(0,f)),s-=I;s>f;)a.c.push(+c.slice(f,f+=I));c=c.slice(f),f=I-c.length}else f-=s;for(;f--;c+="0");a.c.push(+c)}else a.c=[a.e=0];L=0}function n(t,n,r,i){var f,u,s,a,p,h,g,m=t.indexOf("."),d=B,v=H;for(37>r&&(t=t.toLowerCase()),m>=0&&(s=Y,Y=0,t=t.replace(".",""),g=new e(r),p=g.pow(t.length-m),Y=s,g.c=c(l(o(p.c),p.e),10,n),g.e=g.c.length),h=c(t,r,n),u=s=h.length;0==h[--s];h.pop());if(!h[0])return"0";if(0>m?--u:(p.c=h,p.e=u,p.s=i,p=G(p,g,d,v,n),h=p.c,a=p.r,u=p.e),f=u+d+1,m=h[f],s=n/2,a=a||0>f||null!=h[f+1],a=4>v?(null!=m||a)&&(0==v||v==(p.s<0?3:2)):m>s||m==s&&(4==v||a||6==v&&1&h[f-1]||v==(p.s<0?8:7)),1>f||!h[0])t=a?l("1",-d):"0";else{if(h.length=f,a)for(--n;++h[--f]>n;)h[f]=0,f||(++u,h.unshift(1));for(s=h.length;!h[--s];);for(m=0,t="";s>=m;t+=N.charAt(h[m++]));t=l(t,u)}return t}function h(t,n,r,i){var f,u,s,c,p;if(r=null!=r&&z(r,0,8,i,b)?0|r:H,!t.c)return t.toString();if(f=t.c[0],s=t.e,null==n)p=o(t.c),p=19==i||24==i&&C>=s?a(p,s):l(p,s);else if(t=F(new e(t),n,r),u=t.e,p=o(t.c),c=p.length,19==i||24==i&&(u>=n||C>=u)){for(;n>c;p+="0",c++);p=a(p,u)}else if(n-=s,p=l(p,u),u+1>c){if(--n>0)for(p+=".";n--;p+="0");}else if(n+=u-c,n>0)for(u+1==c&&(p+=".");n--;p+="0");return t.s<0&&f?"-"+p:p}function S(t,n){var r,i,o=0;for(s(t[0])&&(t=t[0]),r=new e(t[0]);++ot||t>n||t!=p(t))&&U(r,(i||"decimal places")+(e>t||t>n?" out of range":" not an integer"),t),!0}function R(t,e,n){for(var r=1,i=e.length;!e[--i];e.pop());for(i=e[0];i>=10;i/=10,r++);return(n=r+n*I-1)>q?t.c=t.e=null:k>n?t.c=[t.e=0]:(t.e=n,t.c=e),t}function U(t,e,n){var r=new Error(["new BigNumber","cmp","config","div","divToInt","eq","gt","gte","lt","lte","minus","mod","plus","precision","random","round","shift","times","toDigits","toExponential","toFixed","toFormat","toFraction","pow","toPrecision","toString","BigNumber"][t]+"() "+e+": "+n);throw r.name="BigNumber Error",L=0,r}function F(t,e,n,r){var i,o,f,u,s,c,a,l=t.c,p=_;if(l){t:{for(i=1,u=l[0];u>=10;u/=10,i++);if(o=e-i,0>o)o+=I,f=e,s=l[c=0],a=s/p[i-f-1]%10|0;else if(c=v((o+1)/I),c>=l.length){if(!r)break t;for(;l.length<=c;l.push(0));s=a=0,i=1,o%=I,f=o-I+1}else{for(s=u=l[c],i=1;u>=10;u/=10,i++);o%=I,f=o-I+i,a=0>f?0:s/p[i-f-1]%10|0}if(r=r||0>e||null!=l[c+1]||(0>f?s:s%p[i-f-1]),r=4>n?(a||r)&&(0==n||n==(t.s<0?3:2)):a>5||5==a&&(4==n||r||6==n&&(o>0?f>0?s/p[i-f]:0:l[c-1])%10&1||n==(t.s<0?8:7)),1>e||!l[0])return l.length=0,r?(e-=t.e+1,l[0]=p[e%I],t.e=-e||0):l[0]=t.e=0,t;if(0==o?(l.length=c,u=1,c--):(l.length=c+1,u=p[I-o],l[c]=f>0?w(s/p[i-f]%p[f])*u:0),r)for(;;){if(0==c){for(o=1,f=l[0];f>=10;f/=10,o++);for(f=l[0]+=u,u=1;f>=10;f/=10,u++);o!=u&&(t.e++,l[0]==E&&(l[0]=1));break}if(l[c]+=u,l[c]!=E)break;l[c--]=0,u=1}for(o=l.length;0===l[--o];l.pop());}t.e>q?t.c=t.e=null:t.en?null!=(t=i[n++]):void 0};return f(e="DECIMAL_PLACES")&&z(t,0,D,2,e)&&(B=0|t),r[e]=B,f(e="ROUNDING_MODE")&&z(t,0,8,2,e)&&(H=0|t),r[e]=H,f(e="EXPONENTIAL_AT")&&(s(t)?z(t[0],-D,0,2,e)&&z(t[1],0,D,2,e)&&(C=0|t[0],j=0|t[1]):z(t,-D,D,2,e)&&(C=-(j=0|(0>t?-t:t)))),r[e]=[C,j],f(e="RANGE")&&(s(t)?z(t[0],-D,-1,2,e)&&z(t[1],1,D,2,e)&&(k=0|t[0],q=0|t[1]):z(t,-D,D,2,e)&&(0|t?k=-(q=0|(0>t?-t:t)):$&&U(2,e+" cannot be zero",t))),r[e]=[k,q],f(e="ERRORS")&&(t===!!t||1===t||0===t?(L=0,z=($=!!t)?A:u):$&&U(2,e+y,t)),r[e]=$,f(e="CRYPTO")&&(t===!!t||1===t||0===t?(V=!(!t||!g||"object"!=typeof g),t&&!V&&$&&U(2,"crypto unavailable",g)):$&&U(2,e+y,t)),r[e]=V,f(e="MODULO_MODE")&&z(t,0,9,2,e)&&(W=0|t),r[e]=W,f(e="POW_PRECISION")&&z(t,0,D,2,e)&&(Y=0|t),r[e]=Y,f(e="FORMAT")&&("object"==typeof t?Z=t:$&&U(2,e+" not an object",t)),r[e]=Z,r},e.max=function(){return S(arguments,M.lt)},e.min=function(){return S(arguments,M.gt)},e.random=function(){var t=9007199254740992,n=Math.random()*t&2097151?function(){return w(Math.random()*t)}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)};return function(t){var r,i,o,f,u,s=0,c=[],a=new e(P);if(t=null!=t&&z(t,0,D,14)?0|t:B,f=v(t/I),V)if(g&&g.getRandomValues){for(r=g.getRandomValues(new Uint32Array(f*=2));f>s;)u=131072*r[s]+(r[s+1]>>>11),u>=9e15?(i=g.getRandomValues(new Uint32Array(2)),r[s]=i[0],r[s+1]=i[1]):(c.push(u%1e14),s+=2);s=f/2}else if(g&&g.randomBytes){for(r=g.randomBytes(f*=7);f>s;)u=281474976710656*(31&r[s])+1099511627776*r[s+1]+4294967296*r[s+2]+16777216*r[s+3]+(r[s+4]<<16)+(r[s+5]<<8)+r[s+6],u>=9e15?g.randomBytes(7).copy(r,s):(c.push(u%1e14),s+=7);s=f/7}else $&&U(14,"crypto unavailable",g);if(!s)for(;f>s;)u=n(),9e15>u&&(c[s++]=u%1e14);for(f=c[--s],t%=I,f&&t&&(u=_[I-t],c[s]=w(f/u)*u);0===c[s];c.pop(),s--);if(0>s)c=[o=0];else{for(o=-1;0===c[0];c.shift(),o-=I);for(s=1,u=c[0];u>=10;u/=10,s++);I>s&&(o-=I-s)}return a.e=o,a.c=c,a}}(),G=function(){function t(t,e,n){var r,i,o,f,u=0,s=t.length,c=e%T,a=e/T|0;for(t=t.slice();s--;)o=t[s]%T,f=t[s]/T|0,r=a*o+f*c,i=c*o+r%T*T+u,u=(i/n|0)+(r/T|0)+a*f,t[s]=i%n;return u&&t.unshift(u),t}function n(t,e,n,r){var i,o;if(n!=r)o=n>r?1:-1;else for(i=o=0;n>i;i++)if(t[i]!=e[i]){o=t[i]>e[i]?1:-1;break}return o}function r(t,e,n,r){for(var i=0;n--;)t[n]-=i,i=t[n]1;t.shift());}return function(o,f,u,s,c){var a,l,p,h,g,m,d,v,y,b,O,N,x,_,T,D,S,A=o.s==f.s?1:-1,R=o.c,U=f.c;if(!(R&&R[0]&&U&&U[0]))return new e(o.s&&f.s&&(R?!U||R[0]!=U[0]:U)?R&&0==R[0]||!U?0*A:A/0:0/0);for(v=new e(A),y=v.c=[],l=o.e-f.e,A=u+l+1,c||(c=E,l=i(o.e/I)-i(f.e/I),A=A/I|0),p=0;U[p]==(R[p]||0);p++);if(U[p]>(R[p]||0)&&l--,0>A)y.push(1),h=!0;else{for(_=R.length,D=U.length,p=0,A+=2,g=w(c/(U[0]+1)),g>1&&(U=t(U,g,c),R=t(R,g,c),D=U.length,_=R.length),x=D,b=R.slice(0,D),O=b.length;D>O;b[O++]=0);S=U.slice(),S.unshift(0),T=U[0],U[1]>=c/2&&T++;do g=0,a=n(U,b,D,O),0>a?(N=b[0],D!=O&&(N=N*c+(b[1]||0)),g=w(N/T),g>1?(g>=c&&(g=c-1),m=t(U,g,c),d=m.length,O=b.length,a=n(m,b,d,O),1==a&&(g--,r(m,d>D?S:U,d,c))):(0==g&&(a=g=1),m=U.slice()),d=m.length,O>d&&m.unshift(0),r(b,m,O,c),-1==a&&(O=b.length,a=n(U,b,D,O),1>a&&(g++,r(b,O>D?S:U,O,c))),O=b.length):0===a&&(g++,b=[0]),y[p++]=g,a&&b[0]?b[O++]=R[x]||0:(b=[R[x]],O=1);while((x++<_||null!=b[0])&&A--);h=null!=b[0],y[0]||y.shift()}if(c==E){for(p=1,A=y[0];A>=10;A/=10,p++);F(v,u+(v.e=p+l*I-1)+1,s,h)}else v.e=l,v.r=+h;return v}}(),m=function(){var t=/^(-?)0([xbo])(?=\w[\w.]*$)/i,n=/^([^.]+)\.$/,r=/^\.([^.]+)$/,i=/^-?(Infinity|NaN)$/,o=/^\s*\+(?=[\w.])|^\s+|\s+$/g;return function(f,u,s,c){var a,l=s?u:u.replace(o,"");if(i.test(l))f.s=isNaN(l)?null:0>l?-1:1;else{if(!s&&(l=l.replace(t,function(t,e,n){return a="x"==(n=n.toLowerCase())?16:"b"==n?2:8,c&&c!=a?t:e}),c&&(a=c,l=l.replace(n,"$1").replace(r,"0.$1")),u!=l))return new e(l,a);$&&U(L,"not a"+(c?" base "+c:"")+" number",u),f.s=null}f.c=f.e=null,L=0}}(),M.absoluteValue=M.abs=function(){var t=new e(this);return t.s<0&&(t.s=1),t},M.ceil=function(){return F(new e(this),this.e+1,2)},M.comparedTo=M.cmp=function(t,n){return L=1,f(this,new e(t,n))},M.decimalPlaces=M.dp=function(){var t,e,n=this.c;if(!n)return null;if(t=((e=n.length-1)-i(this.e/I))*I,e=n[e])for(;e%10==0;e/=10,t--);return 0>t&&(t=0),t},M.dividedBy=M.div=function(t,n){return L=3,G(this,new e(t,n),B,H)},M.dividedToIntegerBy=M.divToInt=function(t,n){return L=4,G(this,new e(t,n),0,1)},M.equals=M.eq=function(t,n){return L=5,0===f(this,new e(t,n))},M.floor=function(){return F(new e(this),this.e+1,3)},M.greaterThan=M.gt=function(t,n){return L=6,f(this,new e(t,n))>0},M.greaterThanOrEqualTo=M.gte=function(t,n){return L=7,1===(n=f(this,new e(t,n)))||0===n},M.isFinite=function(){return!!this.c},M.isInteger=M.isInt=function(){return!!this.c&&i(this.e/I)>this.c.length-2},M.isNaN=function(){return!this.s},M.isNegative=M.isNeg=function(){return this.s<0},M.isZero=function(){return!!this.c&&0==this.c[0]},M.lessThan=M.lt=function(t,n){return L=8,f(this,new e(t,n))<0},M.lessThanOrEqualTo=M.lte=function(t,n){return L=9,-1===(n=f(this,new e(t,n)))||0===n},M.minus=M.sub=function(t,n){var r,o,f,u,s=this,c=s.s;if(L=10,t=new e(t,n),n=t.s,!c||!n)return new e(0/0);if(c!=n)return t.s=-n,s.plus(t);var a=s.e/I,l=t.e/I,p=s.c,h=t.c;if(!a||!l){if(!p||!h)return p?(t.s=-n,t):new e(h?s:0/0);if(!p[0]||!h[0])return h[0]?(t.s=-n,t):new e(p[0]?s:3==H?-0:0)}if(a=i(a),l=i(l),p=p.slice(),c=a-l){for((u=0>c)?(c=-c,f=p):(l=a,f=h),f.reverse(),n=c;n--;f.push(0));f.reverse()}else for(o=(u=(c=p.length)<(n=h.length))?c:n,c=n=0;o>n;n++)if(p[n]!=h[n]){u=p[n]0)for(;n--;p[r++]=0);for(n=E-1;o>c;){if(p[--o]0?(s=u,r=a):(f=-f,r=c),r.reverse();f--;r.push(0));r.reverse()}for(f=c.length,n=a.length,0>f-n&&(r=a,a=c,c=r,n=f),f=0;n;)f=(c[--n]=c[n]+a[n]+f)/E|0,c[n]%=E;return f&&(c.unshift(f),++s),R(t,c,s)},M.precision=M.sd=function(t){var e,n,r=this,i=r.c;if(null!=t&&t!==!!t&&1!==t&&0!==t&&($&&U(13,"argument"+y,t),t!=!!t&&(t=null)),!i)return null;if(n=i.length-1,e=n*I+1,n=i[n]){for(;n%10==0;n/=10,e--);for(n=i[0];n>=10;n/=10,e++);}return t&&r.e+1>e&&(e=r.e+1),e},M.round=function(t,n){var r=new e(this);return(null==t||z(t,0,D,15))&&F(r,~~t+this.e+1,null!=n&&z(n,0,8,15,b)?0|n:H),r},M.shift=function(t){var n=this;return z(t,-x,x,16,"argument")?n.times("1e"+p(t)):new e(n.c&&n.c[0]&&(-x>t||t>x)?n.s*(0>t?0:1/0):n)},M.squareRoot=M.sqrt=function(){var t,n,r,f,u,s=this,c=s.c,a=s.s,l=s.e,p=B+4,h=new e("0.5");if(1!==a||!c||!c[0])return new e(!a||0>a&&(!c||c[0])?0/0:c?s:1/0);if(a=Math.sqrt(+s),0==a||a==1/0?(n=o(c),(n.length+l)%2==0&&(n+="0"),a=Math.sqrt(n),l=i((l+1)/2)-(0>l||l%2),a==1/0?n="1e"+l:(n=a.toExponential(),n=n.slice(0,n.indexOf("e")+1)+l),r=new e(n)):r=new e(a+""),r.c[0])for(l=r.e,a=l+p,3>a&&(a=0);;)if(u=r,r=h.times(u.plus(G(s,u,p,1))),o(u.c).slice(0,a)===(n=o(r.c)).slice(0,a)){if(r.ea&&(d=b,b=O,O=d,f=a,a=h,h=f),f=a+h,d=[];f--;d.push(0));for(v=E,w=T,f=h;--f>=0;){for(r=0,g=O[f]%w,m=O[f]/w|0,s=a,u=f+s;u>f;)l=b[--s]%w,p=b[s]/w|0,c=m*l+p*g,l=g*l+c%w*w+d[u]+r,r=(l/v|0)+(c/w|0)+m*p,d[u--]=l%v;d[u]=r}return r?++o:d.shift(),R(t,d,o)},M.toDigits=function(t,n){var r=new e(this);return t=null!=t&&z(t,1,D,18,"precision")?0|t:null,n=null!=n&&z(n,0,8,18,b)?0|n:H,t?F(r,t,n):r},M.toExponential=function(t,e){return h(this,null!=t&&z(t,0,D,19)?~~t+1:null,e,19)},M.toFixed=function(t,e){return h(this,null!=t&&z(t,0,D,20)?~~t+this.e+1:null,e,20)},M.toFormat=function(t,e){var n=h(this,null!=t&&z(t,0,D,21)?~~t+this.e+1:null,e,21);if(this.c){var r,i=n.split("."),o=+Z.groupSize,f=+Z.secondaryGroupSize,u=Z.groupSeparator,s=i[0],c=i[1],a=this.s<0,l=a?s.slice(1):s,p=l.length;if(f&&(r=o,o=f,f=r,p-=r),o>0&&p>0){for(r=p%o||o,s=l.substr(0,r);p>r;r+=o)s+=u+l.substr(r,o);f>0&&(s+=u+l.slice(r)),a&&(s="-"+s)}n=c?s+Z.decimalSeparator+((f=+Z.fractionGroupSize)?c.replace(new RegExp("\\d{"+f+"}\\B","g"),"$&"+Z.fractionGroupSeparator):c):s}return n},M.toFraction=function(t){var n,r,i,f,u,s,c,a,l,p=$,h=this,g=h.c,m=new e(P),d=r=new e(P),v=c=new e(P);if(null!=t&&($=!1,s=new e(t),$=p,(!(p=s.isInt())||s.lt(P))&&($&&U(22,"max denominator "+(p?"out of range":"not an integer"),t),t=!p&&s.c&&F(s,s.e+1,1).gte(P)?s:null)),!g)return h.toString();for(l=o(g),f=m.e=l.length-h.e-1,m.c[0]=_[(u=f%I)<0?I+u:u],t=!t||s.cmp(m)>0?f>0?m:d:s,u=q,q=1/0,s=new e(l),c.c[0]=0;a=G(s,m,0,1),i=r.plus(a.times(v)),1!=i.cmp(t);)r=v,v=i,d=c.plus(a.times(i=d)),c=i,m=s.minus(a.times(i=m)),s=i;return i=G(t.minus(r),v,0,1),c=c.plus(i.times(d)),r=r.plus(i.times(v)),c.s=d.s=h.s,f*=2,n=G(d,v,f,H).minus(h).abs().cmp(G(c,r,f,H).minus(h).abs())<1?[d.toString(),v.toString()]:[c.toString(),r.toString()],q=u,n},M.toNumber=function(){var t=this;return+t||(t.s?0*t.s:0/0)},M.toPower=M.pow=function(t){var n,r,i=w(0>t?-t:+t),o=this;if(!z(t,-x,x,23,"exponent")&&(!isFinite(t)||i>x&&(t/=0)||parseFloat(t)!=t&&!(t=0/0)))return new e(Math.pow(+o,t));for(n=Y?v(Y/I+2):0,r=new e(P);;){if(i%2){if(r=r.times(o),!r.c)break;n&&r.c.length>n&&(r.c.length=n)}if(i=w(i/2),!i)break;o=o.times(o),n&&o.c&&o.c.length>n&&(o.c.length=n)}return 0>t&&(r=P.div(r)),n?F(r,Y,H):r},M.toPrecision=function(t,e){return h(this,null!=t&&z(t,1,D,24,"precision")?0|t:null,e,24)},M.toString=function(t){var e,r=this,i=r.s,f=r.e;return null===f?i?(e="Infinity",0>i&&(e="-"+e)):e="NaN":(e=o(r.c),e=null!=t&&z(t,2,64,25,"base")?n(l(e,f),0|t,10,i):C>=f||f>=j?a(e,f):l(e,f),0>i&&r.c[0]&&(e="-"+e)),e},M.truncated=M.trunc=function(){return F(new e(this),this.e+1,1)},M.valueOf=M.toJSON=function(){return this.toString()},null!=t&&e.config(t),e}function i(t){var e=0|t;return t>0||t===e?e:e-1}function o(t){for(var e,n,r=1,i=t.length,o=t[0]+"";i>r;){for(e=t[r++]+"",n=I-e.length;n--;e="0"+e);o+=e}for(i=o.length;48===o.charCodeAt(--i););return o.slice(0,i+1||1)}function f(t,e){var n,r,i=t.c,o=e.c,f=t.s,u=e.s,s=t.e,c=e.e;if(!f||!u)return null;if(n=i&&!i[0],r=o&&!o[0],n||r)return n?r?0:-u:f;if(f!=u)return f;if(n=0>f,r=s==c,!i||!o)return r?0:!i^n?1:-1;if(!r)return s>c^n?1:-1;for(u=(s=i.length)<(c=o.length)?s:c,f=0;u>f;f++)if(i[f]!=o[f])return i[f]>o[f]^n?1:-1;return s==c?0:s>c^n?1:-1}function u(t,e,n){return(t=p(t))>=e&&n>=t}function s(t){return"[object Array]"==Object.prototype.toString.call(t)}function c(t,e,n){for(var r,i,o=[0],f=0,u=t.length;u>f;){for(i=o.length;i--;o[i]*=e);for(o[r=0]+=N.indexOf(t.charAt(f++));rn-1&&(null==o[r+1]&&(o[r+1]=0),o[r+1]+=o[r]/n|0,o[r]%=n)}return o.reverse()}function a(t,e){return(t.length>1?t.charAt(0)+"."+t.slice(1):t)+(0>e?"e":"e+")+e}function l(t,e){var n,r;if(0>e){for(r="0.";++e;r+="0");t=r+t}else if(n=t.length,++e>n){for(r="0",e-=n;--e;r+="0");t+=r}else n>e&&(t=t.slice(0,e)+"."+t.slice(e));return t}function p(t){return t=parseFloat(t),0>t?v(t):w(t)}var h,g,m,d=/^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,v=Math.ceil,w=Math.floor,y=" not a boolean or binary digit",b="rounding mode",O="number type has more than 15 significant digits",N="0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_",E=1e14,I=14,x=9007199254740991,_=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],T=1e7,D=1e9;if(h=r(),"function"==typeof define&&define.amd)define(function(){return h});else if("undefined"!=typeof e&&e.exports){if(e.exports=h,!g)try{g=t("crypto")}catch(S){}}else n.BigNumber=h}(this)},{crypto:1}],natspec:[function(t,e){var n=t("./node_modules/ethereum.js/lib/abi.js"),r=function(){var t=function(t,e){Object.keys(t).forEach(function(n){e[n]=t[n]})},e=function(t){return Object.keys(t).reduce(function(t,e){return t+"var "+e+" = context['"+e+"'];\n"},"")},r=function(t,e){return t.filter(function(t){return t.name===e})[0]},i=function(t,e){var r=n.formatOutput(t.inputs,"0x"+e.params[0].data.slice(10));return t.inputs.reduce(function(t,e,n){return t[e.name]=r[n],t},{})},o=function(t,e){var n,r="",i=/\`(?:\\.|[^`\\])*\`/gim,o=0;try{for(;null!==(n=i.exec(t));){var f=i.lastIndex-n[0].length,u=n[0].slice(1,n[0].length-1);r+=t.slice(o,f);var s=e(u);r+=s,o=i.lastIndex}r+=t.slice(o)}catch(c){throw new Error("Natspec evaluation failed, wrong input params")}return r},f=function(n,f){var u={};if(f)try{var s=r(f.abi,f.method),c=i(s,f.transaction);t(c,u)}catch(a){throw new Error("Natspec evaluation failed, method does not exist")}var l=e(u),p=o(n,function(t){var e=new Function("context",l+"return "+t+";");return e(u).toString()});return p},u=function(t,e){try{return f(t,e)}catch(n){return n.message}};return{evaluateExpression:f,evaluateExpressionSafe:u}}();e.exports=r},{"./node_modules/ethereum.js/lib/abi.js":3}]},{},[]); +//# sourceMappingURL=natspec.js.map \ No newline at end of file diff --git a/libnatspec/natspecjs/example/example.html b/libnatspec/natspecjs/example/example.html new file mode 100644 index 000000000..26388bee3 --- /dev/null +++ b/libnatspec/natspecjs/example/example.html @@ -0,0 +1,13 @@ + + + + + + + + + + + diff --git a/libnatspec/natspecjs/natspec.js b/libnatspec/natspecjs/natspec.js new file mode 100644 index 000000000..277cad2aa --- /dev/null +++ b/libnatspec/natspecjs/natspec.js @@ -0,0 +1,186 @@ +/* + This file is part of natspec.js. + + natspec.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. + + natspec.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 natspec.js. If not, see . +*/ +/** @file natspec.js + * @authors: + * Marek Kotewicz + * @date 2015 + */ + +var abi = require('./node_modules/ethereum.js/lib/abi.js'); + +/** + * This object should be used to evaluate natspec expression + * It has one method evaluateExpression which shoul be used + */ +var natspec = (function () { + /** + * Helper method + * Should be called to copy values from object to global context + * + * @method copyToContext + * @param {Object} object from which we want to copy properties + * @param {Object} object to which we copy + */ + var copyToContext = function (obj, context) { + Object.keys(obj).forEach(function (key) { + context[key] = obj[key]; + }); + } + + /** + * Should be used to generate codes, which will be evaluated + * + * @method generateCode + * @param {Object} object from which code will be generated + * @return {String} javascript code which is used to initalized variables + */ + var generateCode = function (obj) { + return Object.keys(obj).reduce(function (acc, key) { + return acc + "var " + key + " = context['" + key + "'];\n"; + }, ""); + }; + + /** + * Helper method + * Should be called to get method with given name from the abi + * + * @method getMethodWithName + * @param {Array} contract's abi + * @param {String} name of the method that we are looking for + * @return {Object} abi for method with name + */ + var getMethodWithName = function(abi, name) { + return abi.filter(function (method) { + return method.name === name; + })[0]; + }; + + /** + * Should be used to get all contract method input variables + * + * @method getMethodInputParams + * @param {Object} abi for certain method + * @param {Object} transaction object + * @return {Object} object with all contract's method input variables + */ + var getMethodInputParams = function (method, transaction) { + // do it with output formatter (cause we have to decode) + var params = abi.formatOutput(method.inputs, '0x' + transaction.params[0].data.slice(10)); + + return method.inputs.reduce(function (acc, current, index) { + acc[current.name] = params[index]; + return acc; + }, {}); + }; + + /** + * Should be called when we want to evaluate natspec expression + * Replaces all natspec 'subexpressions' with evaluated value + * + * @method mapExpressionToEvaluate + * @param {String} expression to evaluate + * @param {Function} callback which is called to evaluate te expression + * @return {String} evaluated expression + */ + var mapExpressionsToEvaluate = function (expression, cb) { + var evaluatedExpression = ""; + + // match everything in `` quotes + var pattern = /\`(?:\\.|[^`\\])*\`/gim + var match; + var lastIndex = 0; + try { + while ((match = pattern.exec(expression)) !== null) { + var startIndex = pattern.lastIndex - match[0].length; + var toEval = match[0].slice(1, match[0].length - 1); + evaluatedExpression += expression.slice(lastIndex, startIndex); + var evaluatedPart = cb(toEval); + evaluatedExpression += evaluatedPart; + lastIndex = pattern.lastIndex; + } + + evaluatedExpression += expression.slice(lastIndex); + } + catch (err) { + throw new Error("Natspec evaluation failed, wrong input params"); + } + + return evaluatedExpression; + }; + + /** + * Should be called to evaluate single expression + * Is internally using javascript's 'eval' method + * + * @method evaluateExpression + * @param {String} expression which should be evaluated + * @param {Object} [call] object containing contract abi, transaction, called method + * @return {String} evaluated expression + * @throws exception if method is not found or we are trying to evaluate input params that does not exists + */ + var evaluateExpression = function (expression, call) { + //var self = this; + var context = {}; + + if (!!call) { + try { + var method = getMethodWithName(call.abi, call.method); + var params = getMethodInputParams(method, call.transaction); + copyToContext(params, context); + } + catch (err) { + throw new Error("Natspec evaluation failed, method does not exist"); + } + } + + var code = generateCode(context); + + var evaluatedExpression = mapExpressionsToEvaluate(expression, function (toEval) { + var fn = new Function("context", code + "return " + toEval + ";"); + return fn(context).toString(); + }); + + return evaluatedExpression; + }; + + /** + * Safe version of evaluateExpression + * Instead of throwing an exception it returns it as a string + * + * @method evaluateExpressionSafe + * @param {String} expression which should be evaluated + * @param {Object} [call] object containing contract abi, transaction, called method + * @return {String} evaluated expression + */ + var evaluateExpressionSafe = function (expression, call) { + try { + return evaluateExpression(expression, call); + } + catch (err) { + return err.message; + } + }; + + return { + evaluateExpression: evaluateExpression, + evaluateExpressionSafe: evaluateExpressionSafe + }; + +})(); + +module.exports = natspec; + diff --git a/libnatspec/natspecjs/package.json b/libnatspec/natspecjs/package.json new file mode 100644 index 000000000..ed2f252db --- /dev/null +++ b/libnatspec/natspecjs/package.json @@ -0,0 +1,24 @@ +{ + "name": "natspec.js", + "version": "0.0.1", + "description": "Javascript Library used to evaluate natspec expressions", + "main": "natspec.js", + "scripts": { + "build": "cd dist && browserify -r ../natspec.js:natspec -i crypto -o natspec.js && uglifyjs natspec.js --source-map natspec.js.map -c -m -o natspec.min.js", + "test": "mocha", + "test-coveralls": "istanbul cover _mocha -- -R spec && cat coverage/lcov.info | coveralls --verbose" + }, + "author": "", + "dependencies": { + "ethereum.js": "ethereum/ethereum.js#master" + }, + "devDependencies": { + "browserify": "^9.0.3", + "chai": "^2.1.0", + "coveralls": "^2.11.2", + "istanbul": "^0.3.6", + "mocha": "^2.1.0", + "uglify-js": "^2.4.16" + }, + "license": "LGPL-3.0" +} diff --git a/libnatspec/natspecjs/test/test.js b/libnatspec/natspecjs/test/test.js new file mode 100644 index 000000000..59f46cdab --- /dev/null +++ b/libnatspec/natspecjs/test/test.js @@ -0,0 +1,149 @@ +var chai = require('chai'); +var natspec = require('../natspec.js'); +var assert = chai.assert; + +describe('natspec', function () { + it('should evaluate simple expression', function () { + // given + var expression = "`x = 1` + `y = 2` will be equal `x + y`"; + + // when + var result = natspec.evaluateExpression(expression); + var result2 = natspec.evaluateExpressionSafe(expression); + + // then + assert.equal(result, "1 + 2 will be equal 3"); + assert.equal(result2, "1 + 2 will be equal 3"); + }); + + it('should evalute expression using input params', function () { + //given + var expression = "Will multiply `a` by 7 and return `a * 7`."; + var method = 'multiply'; + var abi = [{ + "name": "multiply", + "constant": false, + "type": "function", + "inputs": [{ + "name": "a", + "type": "uint256" + }], + "outputs": [{ + "name": "d", + "type": "uint256" + }] + }]; + + var transaction = { + "jsonrpc": "2.0", + "method": "eth_call", + "params": [{ + "to": "0x8521742d3f456bd237e312d6e30724960f72517a", + "data": "0xc6888fa1000000000000000000000000000000000000000000000000000000000000007a" + }], + "id": 6 + }; + + var call = { + method: method, + abi: abi, + transaction: transaction + }; + + // when + var result = natspec.evaluateExpression(expression, call); + var result2 = natspec.evaluateExpressionSafe(expression, call); + + // then + assert.equal(result, "Will multiply 122 by 7 and return 854."); + assert.equal(result2, "Will multiply 122 by 7 and return 854."); + }); + + it('should evalute expression using input params', function () { + //given + var expression = "Will multiply `a` by 7 and return `a * 7`."; + var method = 'multiply'; + var abi = [{ + "name": "multiply", + "constant": false, + "type": "function", + "inputs": [{ + "name": "b", + "type": "uint256" + }], + "outputs": [{ + "name": "d", + "type": "uint256" + }] + }]; + + var transaction = { + "jsonrpc": "2.0", + "method": "eth_call", + "params": [{ + "to": "0x8521742d3f456bd237e312d6e30724960f72517a", + "data": "0xc6888fa1000000000000000000000000000000000000000000000000000000000000007a" + }], + "id": 6 + }; + + var call = { + method: method, + abi: abi, + transaction: transaction + }; + + // when + var exceptionThrow = function () { natspec.evaluateExpression(expression, call);} + var result = natspec.evaluateExpressionSafe(expression, call); + + // then + assert.equal(result, "Natspec evaluation failed, wrong input params"); + assert.throws(exceptionThrow, "Natspec evaluation failed, wrong input params"); + }); + + it('should evalute expression using input params', function () { + //given + var expression = "Will multiply `a` by 7 and return `a * 7`."; + var method = 'multiply2'; + var abi = [{ + "name": "multiply", + "constant": false, + "type": "function", + "inputs": [{ + "name": "a", + "type": "uint256" + }], + "outputs": [{ + "name": "d", + "type": "uint256" + }] + }]; + + var transaction = { + "jsonrpc": "2.0", + "method": "eth_call", + "params": [{ + "to": "0x8521742d3f456bd237e312d6e30724960f72517a", + "data": "0xc6888fa1000000000000000000000000000000000000000000000000000000000000007a" + }], + "id": 6 + }; + + var call = { + method: method, + abi: abi, + transaction: transaction + }; + + // when + var exceptionThrow = function () { natspec.evaluateExpression(expression, call);} + var result = natspec.evaluateExpressionSafe(expression, call); + + // then + assert.equal(result, "Natspec evaluation failed, method does not exist"); + assert.throws(exceptionThrow, "Natspec evaluation failed, method does not exist"); + }); +}); + +