+++ /dev/null
-// [AIV_SHORT] Build version: 2.2.0 - Thursday, June 4th, 2020, 2:31:20 PM
- webpackJsonp([6],{
-
-/***/ 532:
-/***/ (function(module, exports, __webpack_require__) {
-
-"use strict";
-
-
-exports.__esModule = true;
-
-var _assign = __webpack_require__(69);
-
-var _assign2 = _interopRequireDefault(_assign);
-
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
-exports.default = _assign2.default || function (target) {
- for (var i = 1; i < arguments.length; i++) {
- var source = arguments[i];
-
- for (var key in source) {
- if (Object.prototype.hasOwnProperty.call(source, key)) {
- target[key] = source[key];
- }
- }
- }
-
- return target;
-};
-
-/***/ }),
-
-/***/ 545:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-Object.defineProperty(__webpack_exports__, "__esModule", { value: true });
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_voteConfirm_vue__ = __webpack_require__(602);
-/* empty harmony namespace reexport */
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_59f3fab1_hasScoped_true_buble_transforms_node_modules_vue_loader_lib_selector_type_template_index_0_voteConfirm_vue__ = __webpack_require__(652);
-function injectStyle (ssrContext) {
- __webpack_require__(650)
-}
-var normalizeComponent = __webpack_require__(266)
-/* script */
-
-
-/* template */
-
-/* template functional */
-var __vue_template_functional__ = false
-/* styles */
-var __vue_styles__ = injectStyle
-/* scopeId */
-var __vue_scopeId__ = "data-v-59f3fab1"
-/* moduleIdentifier (server only) */
-var __vue_module_identifier__ = null
-var Component = normalizeComponent(
- __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_voteConfirm_vue__["a" /* default */],
- __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_59f3fab1_hasScoped_true_buble_transforms_node_modules_vue_loader_lib_selector_type_template_index_0_voteConfirm_vue__["a" /* default */],
- __vue_template_functional__,
- __vue_styles__,
- __vue_scopeId__,
- __vue_module_identifier__
-)
-
-/* harmony default export */ __webpack_exports__["default"] = (Component.exports);
-
-
-/***/ }),
-
-/***/ 576:
-/***/ (function(module, exports, __webpack_require__) {
-
-var __WEBPACK_AMD_DEFINE_RESULT__;;(function (globalObject) {\r
- 'use strict';\r
-\r
-/*\r
- * bignumber.js v9.0.0\r
- * A JavaScript library for arbitrary-precision arithmetic.\r
- * https://github.com/MikeMcl/bignumber.js\r
- * Copyright (c) 2019 Michael Mclaughlin <M8ch88l@gmail.com>\r
- * MIT Licensed.\r
- *\r
- * BigNumber.prototype methods | BigNumber methods\r
- * |\r
- * absoluteValue abs | clone\r
- * comparedTo | config set\r
- * decimalPlaces dp | DECIMAL_PLACES\r
- * dividedBy div | ROUNDING_MODE\r
- * dividedToIntegerBy idiv | EXPONENTIAL_AT\r
- * exponentiatedBy pow | RANGE\r
- * integerValue | CRYPTO\r
- * isEqualTo eq | MODULO_MODE\r
- * isFinite | POW_PRECISION\r
- * isGreaterThan gt | FORMAT\r
- * isGreaterThanOrEqualTo gte | ALPHABET\r
- * isInteger | isBigNumber\r
- * isLessThan lt | maximum max\r
- * isLessThanOrEqualTo lte | minimum min\r
- * isNaN | random\r
- * isNegative | sum\r
- * isPositive |\r
- * isZero |\r
- * minus |\r
- * modulo mod |\r
- * multipliedBy times |\r
- * negated |\r
- * plus |\r
- * precision sd |\r
- * shiftedBy |\r
- * squareRoot sqrt |\r
- * toExponential |\r
- * toFixed |\r
- * toFormat |\r
- * toFraction |\r
- * toJSON |\r
- * toNumber |\r
- * toPrecision |\r
- * toString |\r
- * valueOf |\r
- *\r
- */\r
-\r
-\r
- var BigNumber,\r
- isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,\r
- mathceil = Math.ceil,\r
- mathfloor = Math.floor,\r
-\r
- bignumberError = '[BigNumber Error] ',\r
- tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r
-\r
- BASE = 1e14,\r
- LOG_BASE = 14,\r
- MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r
- // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r
- POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r
- SQRT_BASE = 1e7,\r
-\r
- // EDITABLE\r
- // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r
- // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r
- MAX = 1E9; // 0 to MAX_INT32\r
-\r
-\r
- /*\r
- * Create and return a BigNumber constructor.\r
- */\r
- function clone(configObject) {\r
- var div, convertBase, parseNumeric,\r
- P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r
- ONE = new BigNumber(1),\r
-\r
-\r
- //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r
-\r
-\r
- // The default values below must be integers within the inclusive ranges stated.\r
- // The values can also be changed at run-time using BigNumber.set.\r
-\r
- // The maximum number of decimal places for operations involving division.\r
- DECIMAL_PLACES = 20, // 0 to MAX\r
-\r
- // The rounding mode used when rounding to the above decimal places, and when using\r
- // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r
- // UP 0 Away from zero.\r
- // DOWN 1 Towards zero.\r
- // CEIL 2 Towards +Infinity.\r
- // FLOOR 3 Towards -Infinity.\r
- // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r
- // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r
- // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r
- // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r
- // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r
- ROUNDING_MODE = 4, // 0 to 8\r
-\r
- // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r
-\r
- // The exponent value at and beneath which toString returns exponential notation.\r
- // Number type: -7\r
- TO_EXP_NEG = -7, // 0 to -MAX\r
-\r
- // The exponent value at and above which toString returns exponential notation.\r
- // Number type: 21\r
- TO_EXP_POS = 21, // 0 to MAX\r
-\r
- // RANGE : [MIN_EXP, MAX_EXP]\r
-\r
- // The minimum exponent value, beneath which underflow to zero occurs.\r
- // Number type: -324 (5e-324)\r
- MIN_EXP = -1e7, // -1 to -MAX\r
-\r
- // The maximum exponent value, above which overflow to Infinity occurs.\r
- // Number type: 308 (1.7976931348623157e+308)\r
- // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r
- MAX_EXP = 1e7, // 1 to MAX\r
-\r
- // Whether to use cryptographically-secure random number generation, if available.\r
- CRYPTO = false, // true or false\r
-\r
- // The modulo mode used when calculating the modulus: a mod n.\r
- // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r
- // The remainder (r) is calculated as: r = a - n * q.\r
- //\r
- // UP 0 The remainder is positive if the dividend is negative, else is negative.\r
- // DOWN 1 The remainder has the same sign as the dividend.\r
- // This modulo mode is commonly known as 'truncated division' and is\r
- // equivalent to (a % n) in JavaScript.\r
- // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r
- // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r
- // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r
- // The remainder is always positive.\r
- //\r
- // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r
- // modes are commonly used for the modulus operation.\r
- // Although the other rounding modes can also be used, they may not give useful results.\r
- MODULO_MODE = 1, // 0 to 9\r
-\r
- // The maximum number of significant digits of the result of the exponentiatedBy operation.\r
- // If POW_PRECISION is 0, there will be unlimited significant digits.\r
- POW_PRECISION = 0, // 0 to MAX\r
-\r
- // The format specification used by the BigNumber.prototype.toFormat method.\r
- FORMAT = {\r
- prefix: '',\r
- groupSize: 3,\r
- secondaryGroupSize: 0,\r
- groupSeparator: ',',\r
- decimalSeparator: '.',\r
- fractionGroupSize: 0,\r
- fractionGroupSeparator: '\xA0', // non-breaking space\r
- suffix: ''\r
- },\r
-\r
- // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r
- // '-', '.', whitespace, or repeated character.\r
- // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r
- ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r
-\r
-\r
- //------------------------------------------------------------------------------------------\r
-\r
-\r
- // CONSTRUCTOR\r
-\r
-\r
- /*\r
- * The BigNumber constructor and exported function.\r
- * Create and return a new instance of a BigNumber object.\r
- *\r
- * v {number|string|BigNumber} A numeric value.\r
- * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r
- */\r
- function BigNumber(v, b) {\r
- var alphabet, c, caseChanged, e, i, isNum, len, str,\r
- x = this;\r
-\r
- // Enable constructor call without `new`.\r
- if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r
-\r
- if (b == null) {\r
-\r
- if (v && v._isBigNumber === true) {\r
- x.s = v.s;\r
-\r
- if (!v.c || v.e > MAX_EXP) {\r
- x.c = x.e = null;\r
- } else if (v.e < MIN_EXP) {\r
- x.c = [x.e = 0];\r
- } else {\r
- x.e = v.e;\r
- x.c = v.c.slice();\r
- }\r
-\r
- return;\r
- }\r
-\r
- if ((isNum = typeof v == 'number') && v * 0 == 0) {\r
-\r
- // Use `1 / n` to handle minus zero also.\r
- x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r
-\r
- // Fast path for integers, where n < 2147483648 (2**31).\r
- if (v === ~~v) {\r
- for (e = 0, i = v; i >= 10; i /= 10, e++);\r
-\r
- if (e > MAX_EXP) {\r
- x.c = x.e = null;\r
- } else {\r
- x.e = e;\r
- x.c = [v];\r
- }\r
-\r
- return;\r
- }\r
-\r
- str = String(v);\r
- } else {\r
-\r
- if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r
-\r
- x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r
- }\r
-\r
- // Decimal point?\r
- if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r
-\r
- // Exponential form?\r
- if ((i = str.search(/e/i)) > 0) {\r
-\r
- // Determine exponent.\r
- if (e < 0) e = i;\r
- e += +str.slice(i + 1);\r
- str = str.substring(0, i);\r
- } else if (e < 0) {\r
-\r
- // Integer.\r
- e = str.length;\r
- }\r
-\r
- } else {\r
-\r
- // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r
- intCheck(b, 2, ALPHABET.length, 'Base');\r
-\r
- // Allow exponential notation to be used with base 10 argument, while\r
- // also rounding to DECIMAL_PLACES as with other bases.\r
- if (b == 10) {\r
- x = new BigNumber(v);\r
- return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r
- }\r
-\r
- str = String(v);\r
-\r
- if (isNum = typeof v == 'number') {\r
-\r
- // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r
- if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r
-\r
- x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r
-\r
- // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r
- if (BigNumber.DEBUG && str.replace(/^0\.0*|\./, '').length > 15) {\r
- throw Error\r
- (tooManyDigits + v);\r
- }\r
- } else {\r
- x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r
- }\r
-\r
- alphabet = ALPHABET.slice(0, b);\r
- e = i = 0;\r
-\r
- // Check that str is a valid base b number.\r
- // Don't use RegExp, so alphabet can contain special characters.\r
- for (len = str.length; i < len; i++) {\r
- if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r
- if (c == '.') {\r
-\r
- // If '.' is not the first character and it has not be found before.\r
- if (i > e) {\r
- e = len;\r
- continue;\r
- }\r
- } else if (!caseChanged) {\r
-\r
- // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r
- if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r
- str == str.toLowerCase() && (str = str.toUpperCase())) {\r
- caseChanged = true;\r
- i = -1;\r
- e = 0;\r
- continue;\r
- }\r
- }\r
-\r
- return parseNumeric(x, String(v), isNum, b);\r
- }\r
- }\r
-\r
- // Prevent later check for length on converted number.\r
- isNum = false;\r
- str = convertBase(str, b, 10, x.s);\r
-\r
- // Decimal point?\r
- if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r
- else e = str.length;\r
- }\r
-\r
- // Determine leading zeros.\r
- for (i = 0; str.charCodeAt(i) === 48; i++);\r
-\r
- // Determine trailing zeros.\r
- for (len = str.length; str.charCodeAt(--len) === 48;);\r
-\r
- if (str = str.slice(i, ++len)) {\r
- len -= i;\r
-\r
- // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r
- if (isNum && BigNumber.DEBUG &&\r
- len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r
- throw Error\r
- (tooManyDigits + (x.s * v));\r
- }\r
-\r
- // Overflow?\r
- if ((e = e - i - 1) > MAX_EXP) {\r
-\r
- // Infinity.\r
- x.c = x.e = null;\r
-\r
- // Underflow?\r
- } else if (e < MIN_EXP) {\r
-\r
- // Zero.\r
- x.c = [x.e = 0];\r
- } else {\r
- x.e = e;\r
- x.c = [];\r
-\r
- // Transform base\r
-\r
- // e is the base 10 exponent.\r
- // i is where to slice str to get the first element of the coefficient array.\r
- i = (e + 1) % LOG_BASE;\r
- if (e < 0) i += LOG_BASE; // i < 1\r
-\r
- if (i < len) {\r
- if (i) x.c.push(+str.slice(0, i));\r
-\r
- for (len -= LOG_BASE; i < len;) {\r
- x.c.push(+str.slice(i, i += LOG_BASE));\r
- }\r
-\r
- i = LOG_BASE - (str = str.slice(i)).length;\r
- } else {\r
- i -= len;\r
- }\r
-\r
- for (; i--; str += '0');\r
- x.c.push(+str);\r
- }\r
- } else {\r
-\r
- // Zero.\r
- x.c = [x.e = 0];\r
- }\r
- }\r
-\r
-\r
- // CONSTRUCTOR PROPERTIES\r
-\r
-\r
- BigNumber.clone = clone;\r
-\r
- BigNumber.ROUND_UP = 0;\r
- BigNumber.ROUND_DOWN = 1;\r
- BigNumber.ROUND_CEIL = 2;\r
- BigNumber.ROUND_FLOOR = 3;\r
- BigNumber.ROUND_HALF_UP = 4;\r
- BigNumber.ROUND_HALF_DOWN = 5;\r
- BigNumber.ROUND_HALF_EVEN = 6;\r
- BigNumber.ROUND_HALF_CEIL = 7;\r
- BigNumber.ROUND_HALF_FLOOR = 8;\r
- BigNumber.EUCLID = 9;\r
-\r
-\r
- /*\r
- * Configure infrequently-changing library-wide settings.\r
- *\r
- * Accept an object with the following optional properties (if the value of a property is\r
- * a number, it must be an integer within the inclusive range stated):\r
- *\r
- * DECIMAL_PLACES {number} 0 to MAX\r
- * ROUNDING_MODE {number} 0 to 8\r
- * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r
- * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r
- * CRYPTO {boolean} true or false\r
- * MODULO_MODE {number} 0 to 9\r
- * POW_PRECISION {number} 0 to MAX\r
- * ALPHABET {string} A string of two or more unique characters which does\r
- * not contain '.'.\r
- * FORMAT {object} An object with some of the following properties:\r
- * prefix {string}\r
- * groupSize {number}\r
- * secondaryGroupSize {number}\r
- * groupSeparator {string}\r
- * decimalSeparator {string}\r
- * fractionGroupSize {number}\r
- * fractionGroupSeparator {string}\r
- * suffix {string}\r
- *\r
- * (The values assigned to the above FORMAT object properties are not checked for validity.)\r
- *\r
- * E.g.\r
- * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r
- *\r
- * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r
- *\r
- * Return an object with the properties current values.\r
- */\r
- BigNumber.config = BigNumber.set = function (obj) {\r
- var p, v;\r
-\r
- if (obj != null) {\r
-\r
- if (typeof obj == 'object') {\r
-\r
- // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r
- // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r
- if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r
- v = obj[p];\r
- intCheck(v, 0, MAX, p);\r
- DECIMAL_PLACES = v;\r
- }\r
-\r
- // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r
- // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r
- if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r
- v = obj[p];\r
- intCheck(v, 0, 8, p);\r
- ROUNDING_MODE = v;\r
- }\r
-\r
- // EXPONENTIAL_AT {number|number[]}\r
- // Integer, -MAX to MAX inclusive or\r
- // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r
- // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r
- if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r
- v = obj[p];\r
- if (v && v.pop) {\r
- intCheck(v[0], -MAX, 0, p);\r
- intCheck(v[1], 0, MAX, p);\r
- TO_EXP_NEG = v[0];\r
- TO_EXP_POS = v[1];\r
- } else {\r
- intCheck(v, -MAX, MAX, p);\r
- TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r
- }\r
- }\r
-\r
- // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r
- // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r
- // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r
- if (obj.hasOwnProperty(p = 'RANGE')) {\r
- v = obj[p];\r
- if (v && v.pop) {\r
- intCheck(v[0], -MAX, -1, p);\r
- intCheck(v[1], 1, MAX, p);\r
- MIN_EXP = v[0];\r
- MAX_EXP = v[1];\r
- } else {\r
- intCheck(v, -MAX, MAX, p);\r
- if (v) {\r
- MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r
- } else {\r
- throw Error\r
- (bignumberError + p + ' cannot be zero: ' + v);\r
- }\r
- }\r
- }\r
-\r
- // CRYPTO {boolean} true or false.\r
- // '[BigNumber Error] CRYPTO not true or false: {v}'\r
- // '[BigNumber Error] crypto unavailable'\r
- if (obj.hasOwnProperty(p = 'CRYPTO')) {\r
- v = obj[p];\r
- if (v === !!v) {\r
- if (v) {\r
- if (typeof crypto != 'undefined' && crypto &&\r
- (crypto.getRandomValues || crypto.randomBytes)) {\r
- CRYPTO = v;\r
- } else {\r
- CRYPTO = !v;\r
- throw Error\r
- (bignumberError + 'crypto unavailable');\r
- }\r
- } else {\r
- CRYPTO = v;\r
- }\r
- } else {\r
- throw Error\r
- (bignumberError + p + ' not true or false: ' + v);\r
- }\r
- }\r
-\r
- // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r
- // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r
- if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r
- v = obj[p];\r
- intCheck(v, 0, 9, p);\r
- MODULO_MODE = v;\r
- }\r
-\r
- // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r
- // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r
- if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r
- v = obj[p];\r
- intCheck(v, 0, MAX, p);\r
- POW_PRECISION = v;\r
- }\r
-\r
- // FORMAT {object}\r
- // '[BigNumber Error] FORMAT not an object: {v}'\r
- if (obj.hasOwnProperty(p = 'FORMAT')) {\r
- v = obj[p];\r
- if (typeof v == 'object') FORMAT = v;\r
- else throw Error\r
- (bignumberError + p + ' not an object: ' + v);\r
- }\r
-\r
- // ALPHABET {string}\r
- // '[BigNumber Error] ALPHABET invalid: {v}'\r
- if (obj.hasOwnProperty(p = 'ALPHABET')) {\r
- v = obj[p];\r
-\r
- // Disallow if only one character,\r
- // or if it contains '+', '-', '.', whitespace, or a repeated character.\r
- if (typeof v == 'string' && !/^.$|[+-.\s]|(.).*\1/.test(v)) {\r
- ALPHABET = v;\r
- } else {\r
- throw Error\r
- (bignumberError + p + ' invalid: ' + v);\r
- }\r
- }\r
-\r
- } else {\r
-\r
- // '[BigNumber Error] Object expected: {v}'\r
- throw Error\r
- (bignumberError + 'Object expected: ' + obj);\r
- }\r
- }\r
-\r
- return {\r
- DECIMAL_PLACES: DECIMAL_PLACES,\r
- ROUNDING_MODE: ROUNDING_MODE,\r
- EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r
- RANGE: [MIN_EXP, MAX_EXP],\r
- CRYPTO: CRYPTO,\r
- MODULO_MODE: MODULO_MODE,\r
- POW_PRECISION: POW_PRECISION,\r
- FORMAT: FORMAT,\r
- ALPHABET: ALPHABET\r
- };\r
- };\r
-\r
-\r
- /*\r
- * Return true if v is a BigNumber instance, otherwise return false.\r
- *\r
- * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r
- *\r
- * v {any}\r
- *\r
- * '[BigNumber Error] Invalid BigNumber: {v}'\r
- */\r
- BigNumber.isBigNumber = function (v) {\r
- if (!v || v._isBigNumber !== true) return false;\r
- if (!BigNumber.DEBUG) return true;\r
-\r
- var i, n,\r
- c = v.c,\r
- e = v.e,\r
- s = v.s;\r
-\r
- out: if ({}.toString.call(c) == '[object Array]') {\r
-\r
- if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r
-\r
- // If the first element is zero, the BigNumber value must be zero.\r
- if (c[0] === 0) {\r
- if (e === 0 && c.length === 1) return true;\r
- break out;\r
- }\r
-\r
- // Calculate number of digits that c[0] should have, based on the exponent.\r
- i = (e + 1) % LOG_BASE;\r
- if (i < 1) i += LOG_BASE;\r
-\r
- // Calculate number of digits of c[0].\r
- //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r
- if (String(c[0]).length == i) {\r
-\r
- for (i = 0; i < c.length; i++) {\r
- n = c[i];\r
- if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r
- }\r
-\r
- // Last element cannot be zero, unless it is the only element.\r
- if (n !== 0) return true;\r
- }\r
- }\r
-\r
- // Infinity/NaN\r
- } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r
- return true;\r
- }\r
-\r
- throw Error\r
- (bignumberError + 'Invalid BigNumber: ' + v);\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the maximum of the arguments.\r
- *\r
- * arguments {number|string|BigNumber}\r
- */\r
- BigNumber.maximum = BigNumber.max = function () {\r
- return maxOrMin(arguments, P.lt);\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the minimum of the arguments.\r
- *\r
- * arguments {number|string|BigNumber}\r
- */\r
- BigNumber.minimum = BigNumber.min = function () {\r
- return maxOrMin(arguments, P.gt);\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r
- * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r
- * zeros are produced).\r
- *\r
- * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r
- * '[BigNumber Error] crypto unavailable'\r
- */\r
- BigNumber.random = (function () {\r
- var pow2_53 = 0x20000000000000;\r
-\r
- // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r
- // Check if Math.random() produces more than 32 bits of randomness.\r
- // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r
- // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r
- var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r
- ? function () { return mathfloor(Math.random() * pow2_53); }\r
- : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r
- (Math.random() * 0x800000 | 0); };\r
-\r
- return function (dp) {\r
- var a, b, e, k, v,\r
- i = 0,\r
- c = [],\r
- rand = new BigNumber(ONE);\r
-\r
- if (dp == null) dp = DECIMAL_PLACES;\r
- else intCheck(dp, 0, MAX);\r
-\r
- k = mathceil(dp / LOG_BASE);\r
-\r
- if (CRYPTO) {\r
-\r
- // Browsers supporting crypto.getRandomValues.\r
- if (crypto.getRandomValues) {\r
-\r
- a = crypto.getRandomValues(new Uint32Array(k *= 2));\r
-\r
- for (; i < k;) {\r
-\r
- // 53 bits:\r
- // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r
- // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r
- // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r
- // 11111 11111111 11111111\r
- // 0x20000 is 2^21.\r
- v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r
-\r
- // Rejection sampling:\r
- // 0 <= v < 9007199254740992\r
- // Probability that v >= 9e15, is\r
- // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r
- if (v >= 9e15) {\r
- b = crypto.getRandomValues(new Uint32Array(2));\r
- a[i] = b[0];\r
- a[i + 1] = b[1];\r
- } else {\r
-\r
- // 0 <= v <= 8999999999999999\r
- // 0 <= (v % 1e14) <= 99999999999999\r
- c.push(v % 1e14);\r
- i += 2;\r
- }\r
- }\r
- i = k / 2;\r
-\r
- // Node.js supporting crypto.randomBytes.\r
- } else if (crypto.randomBytes) {\r
-\r
- // buffer\r
- a = crypto.randomBytes(k *= 7);\r
-\r
- for (; i < k;) {\r
-\r
- // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r
- // 0x100000000 is 2^32, 0x1000000 is 2^24\r
- // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r
- // 0 <= v < 9007199254740992\r
- v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r
- (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r
- (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r
-\r
- if (v >= 9e15) {\r
- crypto.randomBytes(7).copy(a, i);\r
- } else {\r
-\r
- // 0 <= (v % 1e14) <= 99999999999999\r
- c.push(v % 1e14);\r
- i += 7;\r
- }\r
- }\r
- i = k / 7;\r
- } else {\r
- CRYPTO = false;\r
- throw Error\r
- (bignumberError + 'crypto unavailable');\r
- }\r
- }\r
-\r
- // Use Math.random.\r
- if (!CRYPTO) {\r
-\r
- for (; i < k;) {\r
- v = random53bitInt();\r
- if (v < 9e15) c[i++] = v % 1e14;\r
- }\r
- }\r
-\r
- k = c[--i];\r
- dp %= LOG_BASE;\r
-\r
- // Convert trailing digits to zeros according to dp.\r
- if (k && dp) {\r
- v = POWS_TEN[LOG_BASE - dp];\r
- c[i] = mathfloor(k / v) * v;\r
- }\r
-\r
- // Remove trailing elements which are zero.\r
- for (; c[i] === 0; c.pop(), i--);\r
-\r
- // Zero?\r
- if (i < 0) {\r
- c = [e = 0];\r
- } else {\r
-\r
- // Remove leading elements which are zero and adjust exponent accordingly.\r
- for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r
-\r
- // Count the digits of the first element of c to determine leading zeros, and...\r
- for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r
-\r
- // adjust the exponent accordingly.\r
- if (i < LOG_BASE) e -= LOG_BASE - i;\r
- }\r
-\r
- rand.e = e;\r
- rand.c = c;\r
- return rand;\r
- };\r
- })();\r
-\r
-\r
- /*\r
- * Return a BigNumber whose value is the sum of the arguments.\r
- *\r
- * arguments {number|string|BigNumber}\r
- */\r
- BigNumber.sum = function () {\r
- var i = 1,\r
- args = arguments,\r
- sum = new BigNumber(args[0]);\r
- for (; i < args.length;) sum = sum.plus(args[i++]);\r
- return sum;\r
- };\r
-\r
-\r
- // PRIVATE FUNCTIONS\r
-\r
-\r
- // Called by BigNumber and BigNumber.prototype.toString.\r
- convertBase = (function () {\r
- var decimal = '0123456789';\r
-\r
- /*\r
- * Convert string of baseIn to an array of numbers of baseOut.\r
- * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r
- * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r
- */\r
- function toBaseOut(str, baseIn, baseOut, alphabet) {\r
- var j,\r
- arr = [0],\r
- arrL,\r
- i = 0,\r
- len = str.length;\r
-\r
- for (; i < len;) {\r
- for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r
-\r
- arr[0] += alphabet.indexOf(str.charAt(i++));\r
-\r
- for (j = 0; j < arr.length; j++) {\r
-\r
- if (arr[j] > baseOut - 1) {\r
- if (arr[j + 1] == null) arr[j + 1] = 0;\r
- arr[j + 1] += arr[j] / baseOut | 0;\r
- arr[j] %= baseOut;\r
- }\r
- }\r
- }\r
-\r
- return arr.reverse();\r
- }\r
-\r
- // Convert a numeric string of baseIn to a numeric string of baseOut.\r
- // If the caller is toString, we are converting from base 10 to baseOut.\r
- // If the caller is BigNumber, we are converting from baseIn to base 10.\r
- return function (str, baseIn, baseOut, sign, callerIsToString) {\r
- var alphabet, d, e, k, r, x, xc, y,\r
- i = str.indexOf('.'),\r
- dp = DECIMAL_PLACES,\r
- rm = ROUNDING_MODE;\r
-\r
- // Non-integer.\r
- if (i >= 0) {\r
- k = POW_PRECISION;\r
-\r
- // Unlimited precision.\r
- POW_PRECISION = 0;\r
- str = str.replace('.', '');\r
- y = new BigNumber(baseIn);\r
- x = y.pow(str.length - i);\r
- POW_PRECISION = k;\r
-\r
- // Convert str as if an integer, then restore the fraction part by dividing the\r
- // result by its base raised to a power.\r
-\r
- y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r
- 10, baseOut, decimal);\r
- y.e = y.c.length;\r
- }\r
-\r
- // Convert the number as integer.\r
-\r
- xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r
- ? (alphabet = ALPHABET, decimal)\r
- : (alphabet = decimal, ALPHABET));\r
-\r
- // xc now represents str as an integer and converted to baseOut. e is the exponent.\r
- e = k = xc.length;\r
-\r
- // Remove trailing zeros.\r
- for (; xc[--k] == 0; xc.pop());\r
-\r
- // Zero?\r
- if (!xc[0]) return alphabet.charAt(0);\r
-\r
- // Does str represent an integer? If so, no need for the division.\r
- if (i < 0) {\r
- --e;\r
- } else {\r
- x.c = xc;\r
- x.e = e;\r
-\r
- // The sign is needed for correct rounding.\r
- x.s = sign;\r
- x = div(x, y, dp, rm, baseOut);\r
- xc = x.c;\r
- r = x.r;\r
- e = x.e;\r
- }\r
-\r
- // xc now represents str converted to baseOut.\r
-\r
- // THe index of the rounding digit.\r
- d = e + dp + 1;\r
-\r
- // The rounding digit: the digit to the right of the digit that may be rounded up.\r
- i = xc[d];\r
-\r
- // Look at the rounding digits and mode to determine whether to round up.\r
-\r
- k = baseOut / 2;\r
- r = r || d < 0 || xc[d + 1] != null;\r
-\r
- r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r
- : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r
- rm == (x.s < 0 ? 8 : 7));\r
-\r
- // If the index of the rounding digit is not greater than zero, or xc represents\r
- // zero, then the result of the base conversion is zero or, if rounding up, a value\r
- // such as 0.00001.\r
- if (d < 1 || !xc[0]) {\r
-\r
- // 1^-dp or 0\r
- str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r
- } else {\r
-\r
- // Truncate xc to the required number of decimal places.\r
- xc.length = d;\r
-\r
- // Round up?\r
- if (r) {\r
-\r
- // Rounding up may mean the previous digit has to be rounded up and so on.\r
- for (--baseOut; ++xc[--d] > baseOut;) {\r
- xc[d] = 0;\r
-\r
- if (!d) {\r
- ++e;\r
- xc = [1].concat(xc);\r
- }\r
- }\r
- }\r
-\r
- // Determine trailing zeros.\r
- for (k = xc.length; !xc[--k];);\r
-\r
- // E.g. [4, 11, 15] becomes 4bf.\r
- for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r
-\r
- // Add leading zeros, decimal point and trailing zeros as required.\r
- str = toFixedPoint(str, e, alphabet.charAt(0));\r
- }\r
-\r
- // The caller will add the sign.\r
- return str;\r
- };\r
- })();\r
-\r
-\r
- // Perform division in the specified base. Called by div and convertBase.\r
- div = (function () {\r
-\r
- // Assume non-zero x and k.\r
- function multiply(x, k, base) {\r
- var m, temp, xlo, xhi,\r
- carry = 0,\r
- i = x.length,\r
- klo = k % SQRT_BASE,\r
- khi = k / SQRT_BASE | 0;\r
-\r
- for (x = x.slice(); i--;) {\r
- xlo = x[i] % SQRT_BASE;\r
- xhi = x[i] / SQRT_BASE | 0;\r
- m = khi * xlo + xhi * klo;\r
- temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r
- carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r
- x[i] = temp % base;\r
- }\r
-\r
- if (carry) x = [carry].concat(x);\r
-\r
- return x;\r
- }\r
-\r
- function compare(a, b, aL, bL) {\r
- var i, cmp;\r
-\r
- if (aL != bL) {\r
- cmp = aL > bL ? 1 : -1;\r
- } else {\r
-\r
- for (i = cmp = 0; i < aL; i++) {\r
-\r
- if (a[i] != b[i]) {\r
- cmp = a[i] > b[i] ? 1 : -1;\r
- break;\r
- }\r
- }\r
- }\r
-\r
- return cmp;\r
- }\r
-\r
- function subtract(a, b, aL, base) {\r
- var i = 0;\r
-\r
- // Subtract b from a.\r
- for (; aL--;) {\r
- a[aL] -= i;\r
- i = a[aL] < b[aL] ? 1 : 0;\r
- a[aL] = i * base + a[aL] - b[aL];\r
- }\r
-\r
- // Remove leading zeros.\r
- for (; !a[0] && a.length > 1; a.splice(0, 1));\r
- }\r
-\r
- // x: dividend, y: divisor.\r
- return function (x, y, dp, rm, base) {\r
- var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r
- yL, yz,\r
- s = x.s == y.s ? 1 : -1,\r
- xc = x.c,\r
- yc = y.c;\r
-\r
- // Either NaN, Infinity or 0?\r
- if (!xc || !xc[0] || !yc || !yc[0]) {\r
-\r
- return new BigNumber(\r
-\r
- // Return NaN if either NaN, or both Infinity or 0.\r
- !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r
-\r
- // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r
- xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r
- );\r
- }\r
-\r
- q = new BigNumber(s);\r
- qc = q.c = [];\r
- e = x.e - y.e;\r
- s = dp + e + 1;\r
-\r
- if (!base) {\r
- base = BASE;\r
- e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r
- s = s / LOG_BASE | 0;\r
- }\r
-\r
- // Result exponent may be one less then the current value of e.\r
- // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r
- for (i = 0; yc[i] == (xc[i] || 0); i++);\r
-\r
- if (yc[i] > (xc[i] || 0)) e--;\r
-\r
- if (s < 0) {\r
- qc.push(1);\r
- more = true;\r
- } else {\r
- xL = xc.length;\r
- yL = yc.length;\r
- i = 0;\r
- s += 2;\r
-\r
- // Normalise xc and yc so highest order digit of yc is >= base / 2.\r
-\r
- n = mathfloor(base / (yc[0] + 1));\r
-\r
- // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r
- // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r
- if (n > 1) {\r
- yc = multiply(yc, n, base);\r
- xc = multiply(xc, n, base);\r
- yL = yc.length;\r
- xL = xc.length;\r
- }\r
-\r
- xi = yL;\r
- rem = xc.slice(0, yL);\r
- remL = rem.length;\r
-\r
- // Add zeros to make remainder as long as divisor.\r
- for (; remL < yL; rem[remL++] = 0);\r
- yz = yc.slice();\r
- yz = [0].concat(yz);\r
- yc0 = yc[0];\r
- if (yc[1] >= base / 2) yc0++;\r
- // Not necessary, but to prevent trial digit n > base, when using base 3.\r
- // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r
-\r
- do {\r
- n = 0;\r
-\r
- // Compare divisor and remainder.\r
- cmp = compare(yc, rem, yL, remL);\r
-\r
- // If divisor < remainder.\r
- if (cmp < 0) {\r
-\r
- // Calculate trial digit, n.\r
-\r
- rem0 = rem[0];\r
- if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r
-\r
- // n is how many times the divisor goes into the current remainder.\r
- n = mathfloor(rem0 / yc0);\r
-\r
- // Algorithm:\r
- // product = divisor multiplied by trial digit (n).\r
- // Compare product and remainder.\r
- // If product is greater than remainder:\r
- // Subtract divisor from product, decrement trial digit.\r
- // Subtract product from remainder.\r
- // If product was less than remainder at the last compare:\r
- // Compare new remainder and divisor.\r
- // If remainder is greater than divisor:\r
- // Subtract divisor from remainder, increment trial digit.\r
-\r
- if (n > 1) {\r
-\r
- // n may be > base only when base is 3.\r
- if (n >= base) n = base - 1;\r
-\r
- // product = divisor * trial digit.\r
- prod = multiply(yc, n, base);\r
- prodL = prod.length;\r
- remL = rem.length;\r
-\r
- // Compare product and remainder.\r
- // If product > remainder then trial digit n too high.\r
- // n is 1 too high about 5% of the time, and is not known to have\r
- // ever been more than 1 too high.\r
- while (compare(prod, rem, prodL, remL) == 1) {\r
- n--;\r
-\r
- // Subtract divisor from product.\r
- subtract(prod, yL < prodL ? yz : yc, prodL, base);\r
- prodL = prod.length;\r
- cmp = 1;\r
- }\r
- } else {\r
-\r
- // n is 0 or 1, cmp is -1.\r
- // If n is 0, there is no need to compare yc and rem again below,\r
- // so change cmp to 1 to avoid it.\r
- // If n is 1, leave cmp as -1, so yc and rem are compared again.\r
- if (n == 0) {\r
-\r
- // divisor < remainder, so n must be at least 1.\r
- cmp = n = 1;\r
- }\r
-\r
- // product = divisor\r
- prod = yc.slice();\r
- prodL = prod.length;\r
- }\r
-\r
- if (prodL < remL) prod = [0].concat(prod);\r
-\r
- // Subtract product from remainder.\r
- subtract(rem, prod, remL, base);\r
- remL = rem.length;\r
-\r
- // If product was < remainder.\r
- if (cmp == -1) {\r
-\r
- // Compare divisor and new remainder.\r
- // If divisor < new remainder, subtract divisor from remainder.\r
- // Trial digit n too low.\r
- // n is 1 too low about 5% of the time, and very rarely 2 too low.\r
- while (compare(yc, rem, yL, remL) < 1) {\r
- n++;\r
-\r
- // Subtract divisor from remainder.\r
- subtract(rem, yL < remL ? yz : yc, remL, base);\r
- remL = rem.length;\r
- }\r
- }\r
- } else if (cmp === 0) {\r
- n++;\r
- rem = [0];\r
- } // else cmp === 1 and n will be 0\r
-\r
- // Add the next digit, n, to the result array.\r
- qc[i++] = n;\r
-\r
- // Update the remainder.\r
- if (rem[0]) {\r
- rem[remL++] = xc[xi] || 0;\r
- } else {\r
- rem = [xc[xi]];\r
- remL = 1;\r
- }\r
- } while ((xi++ < xL || rem[0] != null) && s--);\r
-\r
- more = rem[0] != null;\r
-\r
- // Leading zero?\r
- if (!qc[0]) qc.splice(0, 1);\r
- }\r
-\r
- if (base == BASE) {\r
-\r
- // To calculate q.e, first get the number of digits of qc[0].\r
- for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r
-\r
- round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r
-\r
- // Caller is convertBase.\r
- } else {\r
- q.e = e;\r
- q.r = +more;\r
- }\r
-\r
- return q;\r
- };\r
- })();\r
-\r
-\r
- /*\r
- * Return a string representing the value of BigNumber n in fixed-point or exponential\r
- * notation rounded to the specified decimal places or significant digits.\r
- *\r
- * n: a BigNumber.\r
- * i: the index of the last digit required (i.e. the digit that may be rounded up).\r
- * rm: the rounding mode.\r
- * id: 1 (toExponential) or 2 (toPrecision).\r
- */\r
- function format(n, i, rm, id) {\r
- var c0, e, ne, len, str;\r
-\r
- if (rm == null) rm = ROUNDING_MODE;\r
- else intCheck(rm, 0, 8);\r
-\r
- if (!n.c) return n.toString();\r
-\r
- c0 = n.c[0];\r
- ne = n.e;\r
-\r
- if (i == null) {\r
- str = coeffToString(n.c);\r
- str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r
- ? toExponential(str, ne)\r
- : toFixedPoint(str, ne, '0');\r
- } else {\r
- n = round(new BigNumber(n), i, rm);\r
-\r
- // n.e may have changed if the value was rounded up.\r
- e = n.e;\r
-\r
- str = coeffToString(n.c);\r
- len = str.length;\r
-\r
- // toPrecision returns exponential notation if the number of significant digits\r
- // specified is less than the number of digits necessary to represent the integer\r
- // part of the value in fixed-point notation.\r
-\r
- // Exponential notation.\r
- if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r
-\r
- // Append zeros?\r
- for (; len < i; str += '0', len++);\r
- str = toExponential(str, e);\r
-\r
- // Fixed-point notation.\r
- } else {\r
- i -= ne;\r
- str = toFixedPoint(str, e, '0');\r
-\r
- // Append zeros?\r
- if (e + 1 > len) {\r
- if (--i > 0) for (str += '.'; i--; str += '0');\r
- } else {\r
- i += e - len;\r
- if (i > 0) {\r
- if (e + 1 == len) str += '.';\r
- for (; i--; str += '0');\r
- }\r
- }\r
- }\r
- }\r
-\r
- return n.s < 0 && c0 ? '-' + str : str;\r
- }\r
-\r
-\r
- // Handle BigNumber.max and BigNumber.min.\r
- function maxOrMin(args, method) {\r
- var n,\r
- i = 1,\r
- m = new BigNumber(args[0]);\r
-\r
- for (; i < args.length; i++) {\r
- n = new BigNumber(args[i]);\r
-\r
- // If any number is NaN, return NaN.\r
- if (!n.s) {\r
- m = n;\r
- break;\r
- } else if (method.call(m, n)) {\r
- m = n;\r
- }\r
- }\r
-\r
- return m;\r
- }\r
-\r
-\r
- /*\r
- * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r
- * Called by minus, plus and times.\r
- */\r
- function normalise(n, c, e) {\r
- var i = 1,\r
- j = c.length;\r
-\r
- // Remove trailing zeros.\r
- for (; !c[--j]; c.pop());\r
-\r
- // Calculate the base 10 exponent. First get the number of digits of c[0].\r
- for (j = c[0]; j >= 10; j /= 10, i++);\r
-\r
- // Overflow?\r
- if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r
-\r
- // Infinity.\r
- n.c = n.e = null;\r
-\r
- // Underflow?\r
- } else if (e < MIN_EXP) {\r
-\r
- // Zero.\r
- n.c = [n.e = 0];\r
- } else {\r
- n.e = e;\r
- n.c = c;\r
- }\r
-\r
- return n;\r
- }\r
-\r
-\r
- // Handle values that fail the validity test in BigNumber.\r
- parseNumeric = (function () {\r
- var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i,\r
- dotAfter = /^([^.]+)\.$/,\r
- dotBefore = /^\.([^.]+)$/,\r
- isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r
- whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;\r
-\r
- return function (x, str, isNum, b) {\r
- var base,\r
- s = isNum ? str : str.replace(whitespaceOrPlus, '');\r
-\r
- // No exception on ±Infinity or NaN.\r
- if (isInfinityOrNaN.test(s)) {\r
- x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r
- } else {\r
- if (!isNum) {\r
-\r
- // basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i\r
- s = s.replace(basePrefix, function (m, p1, p2) {\r
- base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r
- return !b || b == base ? p1 : m;\r
- });\r
-\r
- if (b) {\r
- base = b;\r
-\r
- // E.g. '1.' to '1', '.1' to '0.1'\r
- s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r
- }\r
-\r
- if (str != s) return new BigNumber(s, base);\r
- }\r
-\r
- // '[BigNumber Error] Not a number: {n}'\r
- // '[BigNumber Error] Not a base {b} number: {n}'\r
- if (BigNumber.DEBUG) {\r
- throw Error\r
- (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r
- }\r
-\r
- // NaN\r
- x.s = null;\r
- }\r
-\r
- x.c = x.e = null;\r
- }\r
- })();\r
-\r
-\r
- /*\r
- * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r
- * If r is truthy, it is known that there are more digits after the rounding digit.\r
- */\r
- function round(x, sd, rm, r) {\r
- var d, i, j, k, n, ni, rd,\r
- xc = x.c,\r
- pows10 = POWS_TEN;\r
-\r
- // if x is not Infinity or NaN...\r
- if (xc) {\r
-\r
- // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r
- // n is a base 1e14 number, the value of the element of array x.c containing rd.\r
- // ni is the index of n within x.c.\r
- // d is the number of digits of n.\r
- // i is the index of rd within n including leading zeros.\r
- // j is the actual index of rd within n (if < 0, rd is a leading zero).\r
- out: {\r
-\r
- // Get the number of digits of the first element of xc.\r
- for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r
- i = sd - d;\r
-\r
- // If the rounding digit is in the first element of xc...\r
- if (i < 0) {\r
- i += LOG_BASE;\r
- j = sd;\r
- n = xc[ni = 0];\r
-\r
- // Get the rounding digit at index j of n.\r
- rd = n / pows10[d - j - 1] % 10 | 0;\r
- } else {\r
- ni = mathceil((i + 1) / LOG_BASE);\r
-\r
- if (ni >= xc.length) {\r
-\r
- if (r) {\r
-\r
- // Needed by sqrt.\r
- for (; xc.length <= ni; xc.push(0));\r
- n = rd = 0;\r
- d = 1;\r
- i %= LOG_BASE;\r
- j = i - LOG_BASE + 1;\r
- } else {\r
- break out;\r
- }\r
- } else {\r
- n = k = xc[ni];\r
-\r
- // Get the number of digits of n.\r
- for (d = 1; k >= 10; k /= 10, d++);\r
-\r
- // Get the index of rd within n.\r
- i %= LOG_BASE;\r
-\r
- // Get the index of rd within n, adjusted for leading zeros.\r
- // The number of leading zeros of n is given by LOG_BASE - d.\r
- j = i - LOG_BASE + d;\r
-\r
- // Get the rounding digit at index j of n.\r
- rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r
- }\r
- }\r
-\r
- r = r || sd < 0 ||\r
-\r
- // Are there any non-zero digits after the rounding digit?\r
- // The expression n % pows10[d - j - 1] returns all digits of n to the right\r
- // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r
- xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r
-\r
- r = rm < 4\r
- ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r
- : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r
-\r
- // Check whether the digit to the left of the rounding digit is odd.\r
- ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r
- rm == (x.s < 0 ? 8 : 7));\r
-\r
- if (sd < 1 || !xc[0]) {\r
- xc.length = 0;\r
-\r
- if (r) {\r
-\r
- // Convert sd to decimal places.\r
- sd -= x.e + 1;\r
-\r
- // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r
- xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r
- x.e = -sd || 0;\r
- } else {\r
-\r
- // Zero.\r
- xc[0] = x.e = 0;\r
- }\r
-\r
- return x;\r
- }\r
-\r
- // Remove excess digits.\r
- if (i == 0) {\r
- xc.length = ni;\r
- k = 1;\r
- ni--;\r
- } else {\r
- xc.length = ni + 1;\r
- k = pows10[LOG_BASE - i];\r
-\r
- // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r
- // j > 0 means i > number of leading zeros of n.\r
- xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r
- }\r
-\r
- // Round up?\r
- if (r) {\r
-\r
- for (; ;) {\r
-\r
- // If the digit to be rounded up is in the first element of xc...\r
- if (ni == 0) {\r
-\r
- // i will be the length of xc[0] before k is added.\r
- for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r
- j = xc[0] += k;\r
- for (k = 1; j >= 10; j /= 10, k++);\r
-\r
- // if i != k the length has increased.\r
- if (i != k) {\r
- x.e++;\r
- if (xc[0] == BASE) xc[0] = 1;\r
- }\r
-\r
- break;\r
- } else {\r
- xc[ni] += k;\r
- if (xc[ni] != BASE) break;\r
- xc[ni--] = 0;\r
- k = 1;\r
- }\r
- }\r
- }\r
-\r
- // Remove trailing zeros.\r
- for (i = xc.length; xc[--i] === 0; xc.pop());\r
- }\r
-\r
- // Overflow? Infinity.\r
- if (x.e > MAX_EXP) {\r
- x.c = x.e = null;\r
-\r
- // Underflow? Zero.\r
- } else if (x.e < MIN_EXP) {\r
- x.c = [x.e = 0];\r
- }\r
- }\r
-\r
- return x;\r
- }\r
-\r
-\r
- function valueOf(n) {\r
- var str,\r
- e = n.e;\r
-\r
- if (e === null) return n.toString();\r
-\r
- str = coeffToString(n.c);\r
-\r
- str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r
- ? toExponential(str, e)\r
- : toFixedPoint(str, e, '0');\r
-\r
- return n.s < 0 ? '-' + str : str;\r
- }\r
-\r
-\r
- // PROTOTYPE/INSTANCE METHODS\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the absolute value of this BigNumber.\r
- */\r
- P.absoluteValue = P.abs = function () {\r
- var x = new BigNumber(this);\r
- if (x.s < 0) x.s = 1;\r
- return x;\r
- };\r
-\r
-\r
- /*\r
- * Return\r
- * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r
- * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r
- * 0 if they have the same value,\r
- * or null if the value of either is NaN.\r
- */\r
- P.comparedTo = function (y, b) {\r
- return compare(this, new BigNumber(y, b));\r
- };\r
-\r
-\r
- /*\r
- * If dp is undefined or null or true or false, return the number of decimal places of the\r
- * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r
- *\r
- * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r
- * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r
- * ROUNDING_MODE if rm is omitted.\r
- *\r
- * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r
- */\r
- P.decimalPlaces = P.dp = function (dp, rm) {\r
- var c, n, v,\r
- x = this;\r
-\r
- if (dp != null) {\r
- intCheck(dp, 0, MAX);\r
- if (rm == null) rm = ROUNDING_MODE;\r
- else intCheck(rm, 0, 8);\r
-\r
- return round(new BigNumber(x), dp + x.e + 1, rm);\r
- }\r
-\r
- if (!(c = x.c)) return null;\r
- n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r
-\r
- // Subtract the number of trailing zeros of the last number.\r
- if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r
- if (n < 0) n = 0;\r
-\r
- return n;\r
- };\r
-\r
-\r
- /*\r
- * n / 0 = I\r
- * n / N = N\r
- * n / I = 0\r
- * 0 / n = 0\r
- * 0 / 0 = N\r
- * 0 / N = N\r
- * 0 / I = 0\r
- * N / n = N\r
- * N / 0 = N\r
- * N / N = N\r
- * N / I = N\r
- * I / n = I\r
- * I / 0 = I\r
- * I / N = N\r
- * I / I = N\r
- *\r
- * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r
- * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r
- */\r
- P.dividedBy = P.div = function (y, b) {\r
- return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the integer part of dividing the value of this\r
- * BigNumber by the value of BigNumber(y, b).\r
- */\r
- P.dividedToIntegerBy = P.idiv = function (y, b) {\r
- return div(this, new BigNumber(y, b), 0, 1);\r
- };\r
-\r
-\r
- /*\r
- * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r
- *\r
- * If m is present, return the result modulo m.\r
- * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r
- * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r
- *\r
- * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r
- * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r
- *\r
- * n {number|string|BigNumber} The exponent. An integer.\r
- * [m] {number|string|BigNumber} The modulus.\r
- *\r
- * '[BigNumber Error] Exponent not an integer: {n}'\r
- */\r
- P.exponentiatedBy = P.pow = function (n, m) {\r
- var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r
- x = this;\r
-\r
- n = new BigNumber(n);\r
-\r
- // Allow NaN and ±Infinity, but not other non-integers.\r
- if (n.c && !n.isInteger()) {\r
- throw Error\r
- (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r
- }\r
-\r
- if (m != null) m = new BigNumber(m);\r
-\r
- // Exponent of MAX_SAFE_INTEGER is 15.\r
- nIsBig = n.e > 14;\r
-\r
- // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r
- if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r
-\r
- // The sign of the result of pow when x is negative depends on the evenness of n.\r
- // If +n overflows to ±Infinity, the evenness of n would be not be known.\r
- y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? 2 - isOdd(n) : +valueOf(n)));\r
- return m ? y.mod(m) : y;\r
- }\r
-\r
- nIsNeg = n.s < 0;\r
-\r
- if (m) {\r
-\r
- // x % m returns NaN if abs(m) is zero, or m is NaN.\r
- if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r
-\r
- isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r
-\r
- if (isModExp) x = x.mod(m);\r
-\r
- // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r
- // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r
- } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r
- // [1, 240000000]\r
- ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r
- // [80000000000000] [99999750000000]\r
- : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r
-\r
- // If x is negative and n is odd, k = -0, else k = 0.\r
- k = x.s < 0 && isOdd(n) ? -0 : 0;\r
-\r
- // If x >= 1, k = ±Infinity.\r
- if (x.e > -1) k = 1 / k;\r
-\r
- // If n is negative return ±0, else return ±Infinity.\r
- return new BigNumber(nIsNeg ? 1 / k : k);\r
-\r
- } else if (POW_PRECISION) {\r
-\r
- // Truncating each coefficient array to a length of k after each multiplication\r
- // equates to truncating significant digits to POW_PRECISION + [28, 41],\r
- // i.e. there will be a minimum of 28 guard digits retained.\r
- k = mathceil(POW_PRECISION / LOG_BASE + 2);\r
- }\r
-\r
- if (nIsBig) {\r
- half = new BigNumber(0.5);\r
- if (nIsNeg) n.s = 1;\r
- nIsOdd = isOdd(n);\r
- } else {\r
- i = Math.abs(+valueOf(n));\r
- nIsOdd = i % 2;\r
- }\r
-\r
- y = new BigNumber(ONE);\r
-\r
- // Performs 54 loop iterations for n of 9007199254740991.\r
- for (; ;) {\r
-\r
- if (nIsOdd) {\r
- y = y.times(x);\r
- if (!y.c) break;\r
-\r
- if (k) {\r
- if (y.c.length > k) y.c.length = k;\r
- } else if (isModExp) {\r
- y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r
- }\r
- }\r
-\r
- if (i) {\r
- i = mathfloor(i / 2);\r
- if (i === 0) break;\r
- nIsOdd = i % 2;\r
- } else {\r
- n = n.times(half);\r
- round(n, n.e + 1, 1);\r
-\r
- if (n.e > 14) {\r
- nIsOdd = isOdd(n);\r
- } else {\r
- i = +valueOf(n);\r
- if (i === 0) break;\r
- nIsOdd = i % 2;\r
- }\r
- }\r
-\r
- x = x.times(x);\r
-\r
- if (k) {\r
- if (x.c && x.c.length > k) x.c.length = k;\r
- } else if (isModExp) {\r
- x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r
- }\r
- }\r
-\r
- if (isModExp) return y;\r
- if (nIsNeg) y = ONE.div(y);\r
-\r
- return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r
- * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r
- *\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r
- */\r
- P.integerValue = function (rm) {\r
- var n = new BigNumber(this);\r
- if (rm == null) rm = ROUNDING_MODE;\r
- else intCheck(rm, 0, 8);\r
- return round(n, n.e + 1, rm);\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r
- * otherwise return false.\r
- */\r
- P.isEqualTo = P.eq = function (y, b) {\r
- return compare(this, new BigNumber(y, b)) === 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is a finite number, otherwise return false.\r
- */\r
- P.isFinite = function () {\r
- return !!this.c;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r
- * otherwise return false.\r
- */\r
- P.isGreaterThan = P.gt = function (y, b) {\r
- return compare(this, new BigNumber(y, b)) > 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is greater than or equal to the value of\r
- * BigNumber(y, b), otherwise return false.\r
- */\r
- P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r
- return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r
-\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is an integer, otherwise return false.\r
- */\r
- P.isInteger = function () {\r
- return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r
- * otherwise return false.\r
- */\r
- P.isLessThan = P.lt = function (y, b) {\r
- return compare(this, new BigNumber(y, b)) < 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is less than or equal to the value of\r
- * BigNumber(y, b), otherwise return false.\r
- */\r
- P.isLessThanOrEqualTo = P.lte = function (y, b) {\r
- return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is NaN, otherwise return false.\r
- */\r
- P.isNaN = function () {\r
- return !this.s;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is negative, otherwise return false.\r
- */\r
- P.isNegative = function () {\r
- return this.s < 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is positive, otherwise return false.\r
- */\r
- P.isPositive = function () {\r
- return this.s > 0;\r
- };\r
-\r
-\r
- /*\r
- * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r
- */\r
- P.isZero = function () {\r
- return !!this.c && this.c[0] == 0;\r
- };\r
-\r
-\r
- /*\r
- * n - 0 = n\r
- * n - N = N\r
- * n - I = -I\r
- * 0 - n = -n\r
- * 0 - 0 = 0\r
- * 0 - N = N\r
- * 0 - I = -I\r
- * N - n = N\r
- * N - 0 = N\r
- * N - N = N\r
- * N - I = N\r
- * I - n = I\r
- * I - 0 = I\r
- * I - N = N\r
- * I - I = N\r
- *\r
- * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r
- * BigNumber(y, b).\r
- */\r
- P.minus = function (y, b) {\r
- var i, j, t, xLTy,\r
- x = this,\r
- a = x.s;\r
-\r
- y = new BigNumber(y, b);\r
- b = y.s;\r
-\r
- // Either NaN?\r
- if (!a || !b) return new BigNumber(NaN);\r
-\r
- // Signs differ?\r
- if (a != b) {\r
- y.s = -b;\r
- return x.plus(y);\r
- }\r
-\r
- var xe = x.e / LOG_BASE,\r
- ye = y.e / LOG_BASE,\r
- xc = x.c,\r
- yc = y.c;\r
-\r
- if (!xe || !ye) {\r
-\r
- // Either Infinity?\r
- if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r
-\r
- // Either zero?\r
- if (!xc[0] || !yc[0]) {\r
-\r
- // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r
- return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r
-\r
- // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r
- ROUNDING_MODE == 3 ? -0 : 0);\r
- }\r
- }\r
-\r
- xe = bitFloor(xe);\r
- ye = bitFloor(ye);\r
- xc = xc.slice();\r
-\r
- // Determine which is the bigger number.\r
- if (a = xe - ye) {\r
-\r
- if (xLTy = a < 0) {\r
- a = -a;\r
- t = xc;\r
- } else {\r
- ye = xe;\r
- t = yc;\r
- }\r
-\r
- t.reverse();\r
-\r
- // Prepend zeros to equalise exponents.\r
- for (b = a; b--; t.push(0));\r
- t.reverse();\r
- } else {\r
-\r
- // Exponents equal. Check digit by digit.\r
- j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r
-\r
- for (a = b = 0; b < j; b++) {\r
-\r
- if (xc[b] != yc[b]) {\r
- xLTy = xc[b] < yc[b];\r
- break;\r
- }\r
- }\r
- }\r
-\r
- // x < y? Point xc to the array of the bigger number.\r
- if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r
-\r
- b = (j = yc.length) - (i = xc.length);\r
-\r
- // Append zeros to xc if shorter.\r
- // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r
- if (b > 0) for (; b--; xc[i++] = 0);\r
- b = BASE - 1;\r
-\r
- // Subtract yc from xc.\r
- for (; j > a;) {\r
-\r
- if (xc[--j] < yc[j]) {\r
- for (i = j; i && !xc[--i]; xc[i] = b);\r
- --xc[i];\r
- xc[j] += BASE;\r
- }\r
-\r
- xc[j] -= yc[j];\r
- }\r
-\r
- // Remove leading zeros and adjust exponent accordingly.\r
- for (; xc[0] == 0; xc.splice(0, 1), --ye);\r
-\r
- // Zero?\r
- if (!xc[0]) {\r
-\r
- // Following IEEE 754 (2008) 6.3,\r
- // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r
- y.s = ROUNDING_MODE == 3 ? -1 : 1;\r
- y.c = [y.e = 0];\r
- return y;\r
- }\r
-\r
- // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r
- // for finite x and y.\r
- return normalise(y, xc, ye);\r
- };\r
-\r
-\r
- /*\r
- * n % 0 = N\r
- * n % N = N\r
- * n % I = n\r
- * 0 % n = 0\r
- * -0 % n = -0\r
- * 0 % 0 = N\r
- * 0 % N = N\r
- * 0 % I = 0\r
- * N % n = N\r
- * N % 0 = N\r
- * N % N = N\r
- * N % I = N\r
- * I % n = N\r
- * I % 0 = N\r
- * I % N = N\r
- * I % I = N\r
- *\r
- * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r
- * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r
- */\r
- P.modulo = P.mod = function (y, b) {\r
- var q, s,\r
- x = this;\r
-\r
- y = new BigNumber(y, b);\r
-\r
- // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r
- if (!x.c || !y.s || y.c && !y.c[0]) {\r
- return new BigNumber(NaN);\r
-\r
- // Return x if y is Infinity or x is zero.\r
- } else if (!y.c || x.c && !x.c[0]) {\r
- return new BigNumber(x);\r
- }\r
-\r
- if (MODULO_MODE == 9) {\r
-\r
- // Euclidian division: q = sign(y) * floor(x / abs(y))\r
- // r = x - qy where 0 <= r < abs(y)\r
- s = y.s;\r
- y.s = 1;\r
- q = div(x, y, 0, 3);\r
- y.s = s;\r
- q.s *= s;\r
- } else {\r
- q = div(x, y, 0, MODULO_MODE);\r
- }\r
-\r
- y = x.minus(q.times(y));\r
-\r
- // To match JavaScript %, ensure sign of zero is sign of dividend.\r
- if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r
-\r
- return y;\r
- };\r
-\r
-\r
- /*\r
- * n * 0 = 0\r
- * n * N = N\r
- * n * I = I\r
- * 0 * n = 0\r
- * 0 * 0 = 0\r
- * 0 * N = N\r
- * 0 * I = N\r
- * N * n = N\r
- * N * 0 = N\r
- * N * N = N\r
- * N * I = N\r
- * I * n = I\r
- * I * 0 = N\r
- * I * N = N\r
- * I * I = I\r
- *\r
- * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r
- * of BigNumber(y, b).\r
- */\r
- P.multipliedBy = P.times = function (y, b) {\r
- var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r
- base, sqrtBase,\r
- x = this,\r
- xc = x.c,\r
- yc = (y = new BigNumber(y, b)).c;\r
-\r
- // Either NaN, ±Infinity or ±0?\r
- if (!xc || !yc || !xc[0] || !yc[0]) {\r
-\r
- // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r
- if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r
- y.c = y.e = y.s = null;\r
- } else {\r
- y.s *= x.s;\r
-\r
- // Return ±Infinity if either is ±Infinity.\r
- if (!xc || !yc) {\r
- y.c = y.e = null;\r
-\r
- // Return ±0 if either is ±0.\r
- } else {\r
- y.c = [0];\r
- y.e = 0;\r
- }\r
- }\r
-\r
- return y;\r
- }\r
-\r
- e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r
- y.s *= x.s;\r
- xcL = xc.length;\r
- ycL = yc.length;\r
-\r
- // Ensure xc points to longer array and xcL to its length.\r
- if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r
-\r
- // Initialise the result array with zeros.\r
- for (i = xcL + ycL, zc = []; i--; zc.push(0));\r
-\r
- base = BASE;\r
- sqrtBase = SQRT_BASE;\r
-\r
- for (i = ycL; --i >= 0;) {\r
- c = 0;\r
- ylo = yc[i] % sqrtBase;\r
- yhi = yc[i] / sqrtBase | 0;\r
-\r
- for (k = xcL, j = i + k; j > i;) {\r
- xlo = xc[--k] % sqrtBase;\r
- xhi = xc[k] / sqrtBase | 0;\r
- m = yhi * xlo + xhi * ylo;\r
- xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r
- c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r
- zc[j--] = xlo % base;\r
- }\r
-\r
- zc[j] = c;\r
- }\r
-\r
- if (c) {\r
- ++e;\r
- } else {\r
- zc.splice(0, 1);\r
- }\r
-\r
- return normalise(y, zc, e);\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the value of this BigNumber negated,\r
- * i.e. multiplied by -1.\r
- */\r
- P.negated = function () {\r
- var x = new BigNumber(this);\r
- x.s = -x.s || null;\r
- return x;\r
- };\r
-\r
-\r
- /*\r
- * n + 0 = n\r
- * n + N = N\r
- * n + I = I\r
- * 0 + n = n\r
- * 0 + 0 = 0\r
- * 0 + N = N\r
- * 0 + I = I\r
- * N + n = N\r
- * N + 0 = N\r
- * N + N = N\r
- * N + I = N\r
- * I + n = I\r
- * I + 0 = I\r
- * I + N = N\r
- * I + I = I\r
- *\r
- * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r
- * BigNumber(y, b).\r
- */\r
- P.plus = function (y, b) {\r
- var t,\r
- x = this,\r
- a = x.s;\r
-\r
- y = new BigNumber(y, b);\r
- b = y.s;\r
-\r
- // Either NaN?\r
- if (!a || !b) return new BigNumber(NaN);\r
-\r
- // Signs differ?\r
- if (a != b) {\r
- y.s = -b;\r
- return x.minus(y);\r
- }\r
-\r
- var xe = x.e / LOG_BASE,\r
- ye = y.e / LOG_BASE,\r
- xc = x.c,\r
- yc = y.c;\r
-\r
- if (!xe || !ye) {\r
-\r
- // Return ±Infinity if either ±Infinity.\r
- if (!xc || !yc) return new BigNumber(a / 0);\r
-\r
- // Either zero?\r
- // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r
- if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r
- }\r
-\r
- xe = bitFloor(xe);\r
- ye = bitFloor(ye);\r
- xc = xc.slice();\r
-\r
- // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r
- if (a = xe - ye) {\r
- if (a > 0) {\r
- ye = xe;\r
- t = yc;\r
- } else {\r
- a = -a;\r
- t = xc;\r
- }\r
-\r
- t.reverse();\r
- for (; a--; t.push(0));\r
- t.reverse();\r
- }\r
-\r
- a = xc.length;\r
- b = yc.length;\r
-\r
- // Point xc to the longer array, and b to the shorter length.\r
- if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r
-\r
- // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r
- for (a = 0; b;) {\r
- a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r
- xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r
- }\r
-\r
- if (a) {\r
- xc = [a].concat(xc);\r
- ++ye;\r
- }\r
-\r
- // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r
- // ye = MAX_EXP + 1 possible\r
- return normalise(y, xc, ye);\r
- };\r
-\r
-\r
- /*\r
- * If sd is undefined or null or true or false, return the number of significant digits of\r
- * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r
- * If sd is true include integer-part trailing zeros in the count.\r
- *\r
- * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r
- * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r
- * ROUNDING_MODE if rm is omitted.\r
- *\r
- * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r
- * boolean: whether to count integer-part trailing zeros: true or false.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r
- */\r
- P.precision = P.sd = function (sd, rm) {\r
- var c, n, v,\r
- x = this;\r
-\r
- if (sd != null && sd !== !!sd) {\r
- intCheck(sd, 1, MAX);\r
- if (rm == null) rm = ROUNDING_MODE;\r
- else intCheck(rm, 0, 8);\r
-\r
- return round(new BigNumber(x), sd, rm);\r
- }\r
-\r
- if (!(c = x.c)) return null;\r
- v = c.length - 1;\r
- n = v * LOG_BASE + 1;\r
-\r
- if (v = c[v]) {\r
-\r
- // Subtract the number of trailing zeros of the last element.\r
- for (; v % 10 == 0; v /= 10, n--);\r
-\r
- // Add the number of digits of the first element.\r
- for (v = c[0]; v >= 10; v /= 10, n++);\r
- }\r
-\r
- if (sd && x.e + 1 > n) n = x.e + 1;\r
-\r
- return n;\r
- };\r
-\r
-\r
- /*\r
- * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r
- * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r
- *\r
- * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r
- */\r
- P.shiftedBy = function (k) {\r
- intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r
- return this.times('1e' + k);\r
- };\r
-\r
-\r
- /*\r
- * sqrt(-n) = N\r
- * sqrt(N) = N\r
- * sqrt(-I) = N\r
- * sqrt(I) = I\r
- * sqrt(0) = 0\r
- * sqrt(-0) = -0\r
- *\r
- * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r
- * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r
- */\r
- P.squareRoot = P.sqrt = function () {\r
- var m, n, r, rep, t,\r
- x = this,\r
- c = x.c,\r
- s = x.s,\r
- e = x.e,\r
- dp = DECIMAL_PLACES + 4,\r
- half = new BigNumber('0.5');\r
-\r
- // Negative/NaN/Infinity/zero?\r
- if (s !== 1 || !c || !c[0]) {\r
- return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r
- }\r
-\r
- // Initial estimate.\r
- s = Math.sqrt(+valueOf(x));\r
-\r
- // Math.sqrt underflow/overflow?\r
- // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r
- if (s == 0 || s == 1 / 0) {\r
- n = coeffToString(c);\r
- if ((n.length + e) % 2 == 0) n += '0';\r
- s = Math.sqrt(+n);\r
- e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r
-\r
- if (s == 1 / 0) {\r
- n = '1e' + e;\r
- } else {\r
- n = s.toExponential();\r
- n = n.slice(0, n.indexOf('e') + 1) + e;\r
- }\r
-\r
- r = new BigNumber(n);\r
- } else {\r
- r = new BigNumber(s + '');\r
- }\r
-\r
- // Check for zero.\r
- // r could be zero if MIN_EXP is changed after the this value was created.\r
- // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r
- // coeffToString to throw.\r
- if (r.c[0]) {\r
- e = r.e;\r
- s = e + dp;\r
- if (s < 3) s = 0;\r
-\r
- // Newton-Raphson iteration.\r
- for (; ;) {\r
- t = r;\r
- r = half.times(t.plus(div(x, t, dp, 1)));\r
-\r
- if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r
-\r
- // The exponent of r may here be one less than the final result exponent,\r
- // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r
- // are indexed correctly.\r
- if (r.e < e) --s;\r
- n = n.slice(s - 3, s + 1);\r
-\r
- // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r
- // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r
- // iteration.\r
- if (n == '9999' || !rep && n == '4999') {\r
-\r
- // On the first iteration only, check to see if rounding up gives the\r
- // exact result as the nines may infinitely repeat.\r
- if (!rep) {\r
- round(t, t.e + DECIMAL_PLACES + 2, 0);\r
-\r
- if (t.times(t).eq(x)) {\r
- r = t;\r
- break;\r
- }\r
- }\r
-\r
- dp += 4;\r
- s += 4;\r
- rep = 1;\r
- } else {\r
-\r
- // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r
- // result. If not, then there are further digits and m will be truthy.\r
- if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r
-\r
- // Truncate to the first rounding digit.\r
- round(r, r.e + DECIMAL_PLACES + 2, 1);\r
- m = !r.times(r).eq(x);\r
- }\r
-\r
- break;\r
- }\r
- }\r
- }\r
- }\r
-\r
- return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r
- };\r
-\r
-\r
- /*\r
- * Return a string representing the value of this BigNumber in exponential notation and\r
- * rounded using ROUNDING_MODE to dp fixed decimal places.\r
- *\r
- * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r
- */\r
- P.toExponential = function (dp, rm) {\r
- if (dp != null) {\r
- intCheck(dp, 0, MAX);\r
- dp++;\r
- }\r
- return format(this, dp, rm, 1);\r
- };\r
-\r
-\r
- /*\r
- * Return a string representing the value of this BigNumber in fixed-point notation rounding\r
- * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r
- *\r
- * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r
- * but e.g. (-0.00001).toFixed(0) is '-0'.\r
- *\r
- * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r
- */\r
- P.toFixed = function (dp, rm) {\r
- if (dp != null) {\r
- intCheck(dp, 0, MAX);\r
- dp = dp + this.e + 1;\r
- }\r
- return format(this, dp, rm);\r
- };\r
-\r
-\r
- /*\r
- * Return a string representing the value of this BigNumber in fixed-point notation rounded\r
- * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r
- * of the format or FORMAT object (see BigNumber.set).\r
- *\r
- * The formatting object may contain some or all of the properties shown below.\r
- *\r
- * FORMAT = {\r
- * prefix: '',\r
- * groupSize: 3,\r
- * secondaryGroupSize: 0,\r
- * groupSeparator: ',',\r
- * decimalSeparator: '.',\r
- * fractionGroupSize: 0,\r
- * fractionGroupSeparator: '\xA0', // non-breaking space\r
- * suffix: ''\r
- * };\r
- *\r
- * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- * [format] {object} Formatting options. See FORMAT pbject above.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r
- * '[BigNumber Error] Argument not an object: {format}'\r
- */\r
- P.toFormat = function (dp, rm, format) {\r
- var str,\r
- x = this;\r
-\r
- if (format == null) {\r
- if (dp != null && rm && typeof rm == 'object') {\r
- format = rm;\r
- rm = null;\r
- } else if (dp && typeof dp == 'object') {\r
- format = dp;\r
- dp = rm = null;\r
- } else {\r
- format = FORMAT;\r
- }\r
- } else if (typeof format != 'object') {\r
- throw Error\r
- (bignumberError + 'Argument not an object: ' + format);\r
- }\r
-\r
- str = x.toFixed(dp, rm);\r
-\r
- if (x.c) {\r
- var i,\r
- arr = str.split('.'),\r
- g1 = +format.groupSize,\r
- g2 = +format.secondaryGroupSize,\r
- groupSeparator = format.groupSeparator || '',\r
- intPart = arr[0],\r
- fractionPart = arr[1],\r
- isNeg = x.s < 0,\r
- intDigits = isNeg ? intPart.slice(1) : intPart,\r
- len = intDigits.length;\r
-\r
- if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r
-\r
- if (g1 > 0 && len > 0) {\r
- i = len % g1 || g1;\r
- intPart = intDigits.substr(0, i);\r
- for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r
- if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r
- if (isNeg) intPart = '-' + intPart;\r
- }\r
-\r
- str = fractionPart\r
- ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r
- ? fractionPart.replace(new RegExp('\\d{' + g2 + '}\\B', 'g'),\r
- '$&' + (format.fractionGroupSeparator || ''))\r
- : fractionPart)\r
- : intPart;\r
- }\r
-\r
- return (format.prefix || '') + str + (format.suffix || '');\r
- };\r
-\r
-\r
- /*\r
- * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r
- * fraction with an integer numerator and an integer denominator.\r
- * The denominator will be a positive non-zero value less than or equal to the specified\r
- * maximum denominator. If a maximum denominator is not specified, the denominator will be\r
- * the lowest value necessary to represent the number exactly.\r
- *\r
- * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r
- *\r
- * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r
- */\r
- P.toFraction = function (md) {\r
- var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r
- x = this,\r
- xc = x.c;\r
-\r
- if (md != null) {\r
- n = new BigNumber(md);\r
-\r
- // Throw if md is less than one or is not an integer, unless it is Infinity.\r
- if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r
- throw Error\r
- (bignumberError + 'Argument ' +\r
- (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r
- }\r
- }\r
-\r
- if (!xc) return new BigNumber(x);\r
-\r
- d = new BigNumber(ONE);\r
- n1 = d0 = new BigNumber(ONE);\r
- d1 = n0 = new BigNumber(ONE);\r
- s = coeffToString(xc);\r
-\r
- // Determine initial denominator.\r
- // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r
- e = d.e = s.length - x.e - 1;\r
- d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r
- md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r
-\r
- exp = MAX_EXP;\r
- MAX_EXP = 1 / 0;\r
- n = new BigNumber(s);\r
-\r
- // n0 = d1 = 0\r
- n0.c[0] = 0;\r
-\r
- for (; ;) {\r
- q = div(n, d, 0, 1);\r
- d2 = d0.plus(q.times(d1));\r
- if (d2.comparedTo(md) == 1) break;\r
- d0 = d1;\r
- d1 = d2;\r
- n1 = n0.plus(q.times(d2 = n1));\r
- n0 = d2;\r
- d = n.minus(q.times(d2 = d));\r
- n = d2;\r
- }\r
-\r
- d2 = div(md.minus(d0), d1, 0, 1);\r
- n0 = n0.plus(d2.times(n1));\r
- d0 = d0.plus(d2.times(d1));\r
- n0.s = n1.s = x.s;\r
- e = e * 2;\r
-\r
- // Determine which fraction is closer to x, n0/d0 or n1/d1\r
- r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r
- div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r
-\r
- MAX_EXP = exp;\r
-\r
- return r;\r
- };\r
-\r
-\r
- /*\r
- * Return the value of this BigNumber converted to a number primitive.\r
- */\r
- P.toNumber = function () {\r
- return +valueOf(this);\r
- };\r
-\r
-\r
- /*\r
- * Return a string representing the value of this BigNumber rounded to sd significant digits\r
- * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r
- * necessary to represent the integer part of the value in fixed-point notation, then use\r
- * exponential notation.\r
- *\r
- * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r
- * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r
- *\r
- * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r
- */\r
- P.toPrecision = function (sd, rm) {\r
- if (sd != null) intCheck(sd, 1, MAX);\r
- return format(this, sd, rm, 2);\r
- };\r
-\r
-\r
- /*\r
- * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r
- * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r
- * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r
- * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r
- * TO_EXP_NEG, return exponential notation.\r
- *\r
- * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r
- *\r
- * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r
- */\r
- P.toString = function (b) {\r
- var str,\r
- n = this,\r
- s = n.s,\r
- e = n.e;\r
-\r
- // Infinity or NaN?\r
- if (e === null) {\r
- if (s) {\r
- str = 'Infinity';\r
- if (s < 0) str = '-' + str;\r
- } else {\r
- str = 'NaN';\r
- }\r
- } else {\r
- if (b == null) {\r
- str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r
- ? toExponential(coeffToString(n.c), e)\r
- : toFixedPoint(coeffToString(n.c), e, '0');\r
- } else if (b === 10) {\r
- n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r
- str = toFixedPoint(coeffToString(n.c), n.e, '0');\r
- } else {\r
- intCheck(b, 2, ALPHABET.length, 'Base');\r
- str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r
- }\r
-\r
- if (s < 0 && n.c[0]) str = '-' + str;\r
- }\r
-\r
- return str;\r
- };\r
-\r
-\r
- /*\r
- * Return as toString, but do not accept a base argument, and include the minus sign for\r
- * negative zero.\r
- */\r
- P.valueOf = P.toJSON = function () {\r
- return valueOf(this);\r
- };\r
-\r
-\r
- P._isBigNumber = true;\r
-\r
- if (configObject != null) BigNumber.set(configObject);\r
-\r
- return BigNumber;\r
- }\r
-\r
-\r
- // PRIVATE HELPER FUNCTIONS\r
-\r
- // These functions don't need access to variables,\r
- // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r
-\r
-\r
- function bitFloor(n) {\r
- var i = n | 0;\r
- return n > 0 || n === i ? i : i - 1;\r
- }\r
-\r
-\r
- // Return a coefficient array as a string of base 10 digits.\r
- function coeffToString(a) {\r
- var s, z,\r
- i = 1,\r
- j = a.length,\r
- r = a[0] + '';\r
-\r
- for (; i < j;) {\r
- s = a[i++] + '';\r
- z = LOG_BASE - s.length;\r
- for (; z--; s = '0' + s);\r
- r += s;\r
- }\r
-\r
- // Determine trailing zeros.\r
- for (j = r.length; r.charCodeAt(--j) === 48;);\r
-\r
- return r.slice(0, j + 1 || 1);\r
- }\r
-\r
-\r
- // Compare the value of BigNumbers x and y.\r
- function compare(x, y) {\r
- var a, b,\r
- xc = x.c,\r
- yc = y.c,\r
- i = x.s,\r
- j = y.s,\r
- k = x.e,\r
- l = y.e;\r
-\r
- // Either NaN?\r
- if (!i || !j) return null;\r
-\r
- a = xc && !xc[0];\r
- b = yc && !yc[0];\r
-\r
- // Either zero?\r
- if (a || b) return a ? b ? 0 : -j : i;\r
-\r
- // Signs differ?\r
- if (i != j) return i;\r
-\r
- a = i < 0;\r
- b = k == l;\r
-\r
- // Either Infinity?\r
- if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r
-\r
- // Compare exponents.\r
- if (!b) return k > l ^ a ? 1 : -1;\r
-\r
- j = (k = xc.length) < (l = yc.length) ? k : l;\r
-\r
- // Compare digit by digit.\r
- for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r
-\r
- // Compare lengths.\r
- return k == l ? 0 : k > l ^ a ? 1 : -1;\r
- }\r
-\r
-\r
- /*\r
- * Check that n is a primitive number, an integer, and in range, otherwise throw.\r
- */\r
- function intCheck(n, min, max, name) {\r
- if (n < min || n > max || n !== mathfloor(n)) {\r
- throw Error\r
- (bignumberError + (name || 'Argument') + (typeof n == 'number'\r
- ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r
- : ' not a primitive number: ') + String(n));\r
- }\r
- }\r
-\r
-\r
- // Assumes finite n.\r
- function isOdd(n) {\r
- var k = n.c.length - 1;\r
- return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r
- }\r
-\r
-\r
- function toExponential(str, e) {\r
- return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r
- (e < 0 ? 'e' : 'e+') + e;\r
- }\r
-\r
-\r
- function toFixedPoint(str, e, z) {\r
- var len, zs;\r
-\r
- // Negative exponent?\r
- if (e < 0) {\r
-\r
- // Prepend zeros.\r
- for (zs = z + '.'; ++e; zs += z);\r
- str = zs + str;\r
-\r
- // Positive exponent\r
- } else {\r
- len = str.length;\r
-\r
- // Append zeros.\r
- if (++e > len) {\r
- for (zs = z, e -= len; --e; zs += z);\r
- str += zs;\r
- } else if (e < len) {\r
- str = str.slice(0, e) + '.' + str.slice(e);\r
- }\r
- }\r
-\r
- return str;\r
- }\r
-\r
-\r
- // EXPORT\r
-\r
-\r
- BigNumber = clone();\r
- BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r
-\r
- // AMD.\r
- if (true) {\r
- !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { return BigNumber; }).call(exports, __webpack_require__, exports, module),
- __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\r
-\r
- // Node.js and other environments that support module.exports.\r
- } else if (typeof module != 'undefined' && module.exports) {\r
- module.exports = BigNumber;\r
-\r
- // Browser.\r
- } else {\r
- if (!globalObject) {\r
- globalObject = typeof self != 'undefined' && self ? self : window;\r
- }\r
-\r
- globalObject.BigNumber = BigNumber;\r
- }\r
-})(this);\r
-
-
-/***/ }),
-
-/***/ 577:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify__ = __webpack_require__(144);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise__ = __webpack_require__(76);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_2__bytom__ = __webpack_require__(436);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_3__utils_utils__ = __webpack_require__(578);
-
-
-
-
-
-var transaction = {};
-
-transaction.list = function (guid, asset_id, start, limit, tx_types) {
- var filter = { asset_id: asset_id };
- if (tx_types) {
- filter.tx_types = tx_types;
- }
- return __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.list(guid, filter, null, start, limit);
-};
-
-transaction.convertArgument = function (argArray) {
- var fn = function asyncConvert(object) {
- var type = object.type;
- var value = object.value;
- return __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.convertArgument(type, value).then(function (resp) {
- return resp.value;
- });
- };
-
- var actionFunction = argArray.map(fn);
- return __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a.all(actionFunction);
-};
-
-transaction.chainStatus = function () {
- return __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].query.getblockcount();
-};
-
-transaction.asset = function (asset_id) {
- return __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].query.asset(asset_id);
-};
-
-transaction.build = function (address, to, asset, amount, fee, confirmations) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.buildPayment(address, to, asset, amount.toString(), fee, confirmations).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.buildCrossChain = function (address, to, asset, amount, confirmations) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.buildCrossChain(address, to, asset, amount.toString(), confirmations).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.buildVote = function (address, vote, amount, confirmations, memo) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.buildVote(address, vote, amount.toString(), confirmations, memo).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.buildVeto = function (address, vote, amount, confirmations, memo) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.buildVeto(address, vote, amount.toString(), confirmations, memo).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.buildTransaction = function (address, inputs, outputs, gas, confirmations) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.buildTransaction(address, inputs, outputs, gas, confirmations).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.signTransaction = function (guid, transaction, password) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.signTransaction(guid, __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify___default()(Object(__WEBPACK_IMPORTED_MODULE_3__utils_utils__["b" /* snakeize */])(transaction)), password).then(function (res) {
- resolve(res);
- }).catch(function (error) {
- reject(error);
- });
- });
- return retPromise;
-};
-
-transaction.transfer = function (guid, transaction, password, address) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.signTransaction(guid, __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify___default()(Object(__WEBPACK_IMPORTED_MODULE_3__utils_utils__["b" /* snakeize */])(transaction)), password).then(function (ret) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.submitPayment(address, ret.raw_transaction, ret.signatures).then(function (res3) {
- var object = {
- transactionHash: res3.txHash
- };
- resolve(object);
- }).catch(function (error) {
- reject(error);
- });
- }).catch(function (error) {
- reject(error);
- });
- });
-
- return retPromise;
-};
-
-transaction.signMessage = function (message, password, address) {
- return __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].keys.signMessage(message, password, address);
-};
-
-transaction.advancedTransfer = function (guid, transaction, password, arrayData, address) {
- var retPromise = new __WEBPACK_IMPORTED_MODULE_1_babel_runtime_core_js_promise___default.a(function (resolve, reject) {
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.signTransaction(guid, __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_json_stringify___default()(Object(__WEBPACK_IMPORTED_MODULE_3__utils_utils__["b" /* snakeize */])(transaction)), password).then(function (ret) {
- var signatures = ret.signatures;
- if (arrayData) {
- signatures[0] = arrayData;
- }
- __WEBPACK_IMPORTED_MODULE_2__bytom__["a" /* default */].transaction.submitPayment(address, ret.raw_transaction, signatures).then(function (res3) {
- var object = {
- transactionHash: res3.txHash
- };
- resolve(object);
- }).catch(function (error) {
- reject(error);
- });
- }).catch(function (error) {
- reject(error);
- });
- });
-
- return retPromise;
-};
-
-/* harmony default export */ __webpack_exports__["a"] = (transaction);
-
-/***/ }),
-
-/***/ 578:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "a", function() { return camelize; });
-/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, "b", function() { return snakeize; });
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof__ = __webpack_require__(145);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof__);
-
-var camelize = function camelize(object) {
- if ((typeof object === 'undefined' ? 'undefined' : __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof___default()(object)) == 'object') {
- for (var key in object) {
- var value = object[key];
- var newKey = key;
-
- if (/_/.test(key)) {
- newKey = key.replace(/([_][a-z])/g, function (v) {
- return v[1].toUpperCase();
- });
- delete object[key];
- }
-
- if ((typeof value === 'undefined' ? 'undefined' : __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof___default()(value)) == 'object') {
- value = camelize(value);
- }
-
- object[newKey] = value;
- }
-
- return object;
- } else {
- return object.replace(/([_][a-z])/g, function (v) {
- return v[1].toUpperCase();
- });
- }
-};
-
-var snakeize = function snakeize(object) {
- for (var key in object) {
- var value = object[key];
- var newKey = key;
-
- // Skip all-caps keys
- if (/^[A-Z]+$/.test(key)) {
- continue;
- }
-
- if (/[A-Z]/.test(key)) {
- newKey = key.replace(/([A-Z])/g, function (v) {
- return '_' + v.toLowerCase();
- });
- delete object[key];
- }
-
- if ((typeof value === 'undefined' ? 'undefined' : __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_typeof___default()(value)) == 'object') {
- value = snakeize(value);
- }
-
- object[newKey] = value;
- }
-
- return object;
-};
-
-/***/ }),
-
-/***/ 579:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__cn__ = __webpack_require__(581);
-
-
-var sdkLang = {
- cn: __WEBPACK_IMPORTED_MODULE_0__cn__["a" /* default */]
-};
-
-function getLang(str, lang) {
- if (sdkLang[lang] && sdkLang[lang][str]) {
- return sdkLang[lang][str];
- }
- return str;
-}
-
-/* harmony default export */ __webpack_exports__["a"] = (getLang);
-
-/***/ }),
-
-/***/ 581:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-var cn = {
- "key alias already exists": "秘钥别名已经存在",
- "db insert error": "数据库写入异常",
- "db get error": "数据库查询异常",
- "not found by XPub": "未找到私钥数据",
- "db update error": "数据库更新失败",
- "db update error: not found by rootXPub": "数据库更新失败：未找到相应的私钥数据",
- "duplicate account alias": "账户别名已存在",
- "The wallet already has account data. Can't restore.": "当前钱包存在数据，无法从备份覆盖恢复",
- "could not decrypt key with given passphrase": "无法解密私钥，请检查密码是否正确",
- "unknown address type": "未知的地址类型"
-};
-
-/* harmony default export */ __webpack_exports__["a"] = (cn);
-
-/***/ }),
-
-/***/ 582:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_extends__ = __webpack_require__(532);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_extends___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_extends__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1__assets_language__ = __webpack_require__(438);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_2_vuex__ = __webpack_require__(433);
-
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-
-
-
-
-var CLASS_CN = "form-item-content form-item-content-cn";
-var CLASS_EN = "form-item-content form-item-content-en";
-/* harmony default export */ __webpack_exports__["a"] = ({
- data: function data() {
- return {
- show: false,
- passwd: ""
- };
- },
-
- props: {
- i18n: {
- type: String,
- default: 'cn'
- }
- },
- computed: __WEBPACK_IMPORTED_MODULE_0_babel_runtime_helpers_extends___default()({
- passwdStyle: function passwdStyle() {
- if (this.i18n == "cn") {
- return CLASS_CN;
- } else if (this.i18n == "en") {
- return CLASS_EN;
- }
- return CLASS_CN;
- }
- }, Object(__WEBPACK_IMPORTED_MODULE_2_vuex__["c" /* mapGetters */])(['language'])),
- methods: {
- open: function open() {
- this.i18n = Object(__WEBPACK_IMPORTED_MODULE_1__assets_language__["b" /* getLanguage */])(this.language);
- this.show = true;
- this.passwd = "";
- },
- close: function close() {
- this.show = false;
- },
- confirm: function confirm() {
- if (this.passwd == "") {
- this.$dialog.show({
- body: this.$t("transfer.emptyPassword")
- });
- return;
- }
-
- this.close();
- this.$emit("confirm", this.passwd);
- }
- }
-});
-
-/***/ }),
-
-/***/ 584:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_modal_passwd_vue__ = __webpack_require__(582);
-/* unused harmony namespace reexport */
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_2a9f9bf0_hasScoped_true_buble_transforms_node_modules_vue_loader_lib_selector_type_template_index_0_modal_passwd_vue__ = __webpack_require__(587);
-function injectStyle (ssrContext) {
- __webpack_require__(585)
-}
-var normalizeComponent = __webpack_require__(266)
-/* script */
-
-
-/* template */
-
-/* template functional */
-var __vue_template_functional__ = false
-/* styles */
-var __vue_styles__ = injectStyle
-/* scopeId */
-var __vue_scopeId__ = "data-v-2a9f9bf0"
-/* moduleIdentifier (server only) */
-var __vue_module_identifier__ = null
-var Component = normalizeComponent(
- __WEBPACK_IMPORTED_MODULE_0__babel_loader_node_modules_vue_loader_lib_selector_type_script_index_0_modal_passwd_vue__["a" /* default */],
- __WEBPACK_IMPORTED_MODULE_1__node_modules_vue_loader_lib_template_compiler_index_id_data_v_2a9f9bf0_hasScoped_true_buble_transforms_node_modules_vue_loader_lib_selector_type_template_index_0_modal_passwd_vue__["a" /* default */],
- __vue_template_functional__,
- __vue_styles__,
- __vue_scopeId__,
- __vue_module_identifier__
-)
-
-/* harmony default export */ __webpack_exports__["a"] = (Component.exports);
-
-
-/***/ }),
-
-/***/ 585:
-/***/ (function(module, exports, __webpack_require__) {
-
-// style-loader: Adds some css to the DOM by adding a <style> tag
-
-// load the styles
-var content = __webpack_require__(586);
-if(typeof content === 'string') content = [[module.i, content, '']];
-if(content.locals) module.exports = content.locals;
-// add the styles to the DOM
-var update = __webpack_require__(84)("c3761858", content, true, {});
-
-/***/ }),
-
-/***/ 586:
-/***/ (function(module, exports, __webpack_require__) {
-
-exports = module.exports = __webpack_require__(83)(false);
-// imports
-
-
-// module
-exports.push([module.i, ".mask[data-v-2a9f9bf0]{z-index:3!important;top:60px!important}.confirm[data-v-2a9f9bf0]{padding:10px 20px;position:fixed;width:310px;left:0;bottom:0;right:0;z-index:4}.btn-inline[data-v-2a9f9bf0]{display:flex;padding:0}.btn-inline .btn[data-v-2a9f9bf0]{margin:10px 15px}.form-item-content-en[data-v-2a9f9bf0]{margin-left:145px}.form-item-content-cn[data-v-2a9f9bf0]{margin-left:85px}", ""]);
-
-// exports
-
-
-/***/ }),
-
-/***/ 587:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',[_c('section',{directives:[{name:"show",rawName:"v-show",value:(_vm.show),expression:"show"}],staticClass:"mask"}),_vm._v(" "),_c('div',{directives:[{name:"show",rawName:"v-show",value:(_vm.show),expression:"show"}],staticClass:"confirm form bg-gray"},[_c('div',{staticClass:"form-item"},[_c('label',{staticClass:"form-item-label"},[_vm._v(_vm._s(_vm.$t('transfer.confirmPassword')))]),_vm._v(" "),_c('div',{class:_vm.passwdStyle},[_c('input',{directives:[{name:"model",rawName:"v-model",value:(_vm.passwd),expression:"passwd"}],attrs:{"type":"password","autofocus":""},domProps:{"value":(_vm.passwd)},on:{"input":function($event){if($event.target.composing){ return; }_vm.passwd=$event.target.value}}})])]),_vm._v(" "),_c('div',{staticClass:"btn-group btn-inline"},[_c('div',{staticClass:"btn bg-green",on:{"click":_vm.confirm}},[_vm._v(_vm._s(_vm.$t('welcome.confirm')))]),_vm._v(" "),_c('div',{staticClass:"btn bg-red",on:{"click":_vm.close}},[_vm._v(_vm._s(_vm.$t('welcome.cancel')))])])])])}
-var staticRenderFns = []
-var esExports = { render: render, staticRenderFns: staticRenderFns }
-/* harmony default export */ __webpack_exports__["a"] = (esExports);
-
-/***/ }),
-
-/***/ 602:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_promise__ = __webpack_require__(76);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_promise___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_promise__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1_babel_runtime_helpers_extends__ = __webpack_require__(532);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_1_babel_runtime_helpers_extends___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_1_babel_runtime_helpers_extends__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_2__utils_address__ = __webpack_require__(437);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_3__models_transaction__ = __webpack_require__(577);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_4_bignumber_js__ = __webpack_require__(576);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_4_bignumber_js___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_4_bignumber_js__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_5__models_account__ = __webpack_require__(435);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_6__components_modal_passwd__ = __webpack_require__(584);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_7__assets_language_sdk__ = __webpack_require__(579);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_8_extension_streams__ = __webpack_require__(137);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_8_extension_streams___default = __webpack_require__.n(__WEBPACK_IMPORTED_MODULE_8_extension_streams__);
-/* harmony import */ var __WEBPACK_IMPORTED_MODULE_9_vuex__ = __webpack_require__(433);
-
-
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-//
-
-
-
-
-
-
-
-
-
-
-/* harmony default export */ __webpack_exports__["a"] = ({
- components: {
- modalPasswd: __WEBPACK_IMPORTED_MODULE_6__components_modal_passwd__["a" /* default */]
- },
- data: function data() {
- return {
- full: false,
- title: null,
- accountLabel: this.$t('listVote.voteAccount'),
- rawData: {},
- account: {},
- transaction: {
- to: "",
- toShort: "",
- amount: 0,
- fee: ""
- },
- password: '',
- assetAlias: null
- };
- },
- beforeRouteEnter: function beforeRouteEnter(to, from, next) {
- next(function (vm) {
- if (from.name === 'veto') {
- vm.title = vm.$t('vote.vetoDetials');
- vm.accountLabel = vm.$t('listVote.vetoAccount');
- }
-
- next();
- });
- },
-
- computed: __WEBPACK_IMPORTED_MODULE_1_babel_runtime_helpers_extends___default()({
- totalAmount: function totalAmount() {
- if (this.assetAlias && this.assetAlias.toUpperCase() === 'BTM') {
- var n = new __WEBPACK_IMPORTED_MODULE_4_bignumber_js___default.a(this.transaction.amount);
- return n.plus(this.transaction.fee).toNumber();
- } else {
- return Number(this.transaction.amount);
- }
- }
- }, Object(__WEBPACK_IMPORTED_MODULE_9_vuex__["d" /* mapState */])(['selectVote']), Object(__WEBPACK_IMPORTED_MODULE_9_vuex__["c" /* mapGetters */])(['language', 'net'])),
- methods: {
- shortAddress: function shortAddress(add) {
- return __WEBPACK_IMPORTED_MODULE_2__utils_address__["a" /* default */].short(add);
- },
- transfer: function transfer() {
- var _this = this;
-
- if (this.password == "") {
- this.$dialog.show({
- body: this.$t("transfer.emptyPassword")
- });
- return;
- }
- var loader = this.$loading.show({
- // Optional parameters
- container: null,
- canCancel: true,
- onCancel: this.onCancel
- });
-
- __WEBPACK_IMPORTED_MODULE_0_babel_runtime_core_js_promise___default.a.all(this.rawData.map(function (rawdata) {
- return __WEBPACK_IMPORTED_MODULE_3__models_transaction__["a" /* default */].transfer(_this.account.guid, rawdata, _this.password, _this.account.vpAddress);
- })).then(function (ret) {
- loader.hide();
- if (_this.$route.params.type == 'popup') {
- __WEBPACK_IMPORTED_MODULE_8_extension_streams__["LocalStream"].send({ method: 'transfer', action: 'success', message: ret[ret.length - 1] });
- window.close();
- }
- _this.$dialog.show({
- type: 'success',
- body: _this.$t("transfer.success")
- });
- _this.$router.push('/');
- if (_this.transaction.type === 'toVapor') {
- __WEBPACK_IMPORTED_MODULE_5__models_account__["a" /* default */].setupNet(_this.net + "vapor");
- }
- }).catch(function (error) {
- loader.hide();
- _this.$dialog.show({
- body: Object(__WEBPACK_IMPORTED_MODULE_7__assets_language_sdk__["a" /* default */])(error.message, _this.language)
- });
- });
- }
- }, mounted: function mounted() {
- var params = this.$route.params;
-
- this.account = params.account;
- this.transaction = params.transaction;
- this.transaction.toShort = params.transaction.to;
- this.rawData = params.rawData;
-
- this.assetAlias = params.assetAlias;
- }
-});
-
-/***/ }),
-
-/***/ 650:
-/***/ (function(module, exports, __webpack_require__) {
-
-// style-loader: Adds some css to the DOM by adding a <style> tag
-
-// load the styles
-var content = __webpack_require__(651);
-if(typeof content === 'string') content = [[module.i, content, '']];
-if(content.locals) module.exports = content.locals;
-// add the styles to the DOM
-var update = __webpack_require__(84)("62272a1a", content, true, {});
-
-/***/ }),
-
-/***/ 651:
-/***/ (function(module, exports, __webpack_require__) {
-
-exports = module.exports = __webpack_require__(83)(false);
-// imports
-
-
-// module
-exports.push([module.i, ".warp[data-v-59f3fab1]{position:absolute;top:0;left:0;right:0;height:600px;z-index:2}.header[data-v-59f3fab1]{display:flex}.header p[data-v-59f3fab1]{text-align:center;width:270px;padding-top:17px}.content[data-v-59f3fab1]{margin:20px;padding:20px;overflow:hidden;border-radius:4px;width:280px}.ft[data-v-59f3fab1]{border-radius:5px;padding:0 20px!important;line-height:45px;margin-bottom:20px}.ft .from[data-v-59f3fab1]{overflow-x:hidden;width:90px}.ft .to[data-v-59f3fab1]{overflow-x:hidden;padding-left:20px;float:right}.right-arrow[data-v-59f3fab1]{width:32px;height:32px;border-top:12px solid #3c454b;border-right:12px solid #3c454b;transform:rotate(45deg);position:absolute;left:105px}.divider[data-v-59f3fab1]{margin:15px 0}.value .uint[data-v-59f3fab1]{font-size:12px;margin-left:3px;text-transform:uppercase}.fee-intro[data-v-59f3fab1]{font-size:10px}.btn-inline[data-v-59f3fab1]{display:flex;padding:0}.btn-inline .btn[data-v-59f3fab1]{margin:10px 15px}.row[data-v-59f3fab1]{word-break:break-all}.col[data-v-59f3fab1]{font-size:14px;width:35%}.label[data-v-59f3fab1]{color:#7b7b7b}.value[data-v-59f3fab1]{color:#282828;width:60%}.asset[data-v-59f3fab1]{text-transform:uppercase}table[data-v-59f3fab1]{width:100%}.form-item[data-v-59f3fab1]{padding:0;margin:0;margin-bottom:10px}.scorll-panel[data-v-59f3fab1]{overflow:scroll;height:545px}.view-link[data-v-59f3fab1]{font-size:14px;color:#035bd4}", ""]);
-
-// exports
-
-
-/***/ }),
-
-/***/ 652:
-/***/ (function(module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-var render = function () {var _vm=this;var _h=_vm.$createElement;var _c=_vm._self._c||_h;return _c('div',{staticClass:"warp bg-gray"},[_c('section',{staticClass:"header bg-header"},[_c('i',{staticClass:"iconfont icon-back",on:{"click":function($event){_vm.$router.go(-1)}}}),_vm._v(" "),_c('p',[_vm._v(_vm._s(_vm.title || _vm.$t('vote.voteDetials')))])]),_vm._v(" "),_c('div',{staticClass:"scorll-panel"},[_c('section',{staticClass:"content bg-white"},[_c('table',[_c('tbody',[_c('tr',{staticClass:"row"},[_c('td',{staticClass:"col label"},[_vm._v(_vm._s(_vm.accountLabel))]),_vm._v(" "),_c('td',{staticClass:"col value"},[_vm._v(_vm._s(_vm.account.alias))])]),_vm._v(" "),(_vm.selectVote.name)?_c('tr',{staticClass:"row"},[_c('td',{staticClass:"col label"},[_vm._v(_vm._s(_vm.$t('listVote.bpName')))]),_vm._v(" "),_c('td',{staticClass:"col value"},[_vm._v(_vm._s(_vm.selectVote.name))])]):_c('tr',{staticClass:"row"},[_c('td',{staticClass:"col label"},[_vm._v(_vm._s(_vm.$t('listVote.bpPubkey')))]),_vm._v(" "),_c('td',{staticClass:"col value"},[_vm._v(_vm._s(_vm.transaction.toShort))])]),_vm._v(" "),_c('div',{staticClass:"divider"}),_vm._v(" "),_c('tr',{staticClass:"row"},[_c('td',{staticClass:"col label"},[_vm._v(_vm._s(_vm.$t('listVote.votes')))]),_vm._v(" "),_c('td',{staticClass:"col value"},[_vm._v(_vm._s(_vm.transaction.amount)),(_vm.assetAlias)?_c('span',{staticClass:"uint"},[_vm._v(_vm._s(_vm.assetAlias))]):_vm._e()])]),_vm._v(" "),_c('tr',{staticClass:"row"},[_c('td',{staticClass:"col label"},[_vm._v(_vm._s(_vm.$t('transfer.fee')))]),_vm._v(" "),_c('td',{staticClass:"col value"},[_vm._v(_vm._s(_vm.transaction.fee)),_c('span',{staticClass:"uint"},[_vm._v("BTM")])])])])])]),_vm._v(" "),_c('section',{staticClass:"content bg-white"},[_c('div',{staticClass:"form"},[_c('div',{staticClass:"form-item"},[_c('label',{staticClass:"form-item-label"},[_vm._v(_vm._s(_vm.$t('transfer.confirmPassword')))]),_vm._v(" "),_c('div',{staticClass:"form-item-content"},[_c('input',{directives:[{name:"model",rawName:"v-model",value:(_vm.password),expression:"password"}],attrs:{"type":"password","autofocus":""},domProps:{"value":(_vm.password)},on:{"input":function($event){if($event.target.composing){ return; }_vm.password=$event.target.value}}})])])])]),_vm._v(" "),_c('div',{staticClass:"row",staticStyle:{"margin":"20px"}},[_c('div',{staticClass:"btn bg-green",on:{"click":_vm.transfer}},[_vm._v(_vm._s(_vm.$t('transfer.confirm')))])])])])}
-var staticRenderFns = []
-var esExports = { render: render, staticRenderFns: staticRenderFns }
-/* harmony default export */ __webpack_exports__["a"] = (esExports);
-
-/***/ })
-
-});
-//# sourceMappingURL=6.js.map
\ No newline at end of file
OSDN Git Service
