From 0cfdcf6adaba97844ceea914ddb3ca69c1713a31 Mon Sep 17 00:00:00 2001 From: rjbaucells Date: Mon, 27 Apr 2015 20:02:14 -0400 Subject: [PATCH] build --- dist/math.js | 57348 ++++++++++++++++++++++++--------------------- dist/math.map | 2 +- dist/math.min.js | 24 +- 3 files changed, 30867 insertions(+), 26507 deletions(-) diff --git a/dist/math.js b/dist/math.js index bba8855eb..58eec0666 100644 --- a/dist/math.js +++ b/dist/math.js @@ -1,29 +1,29 @@ -/** - * math.js - * https://github.com/josdejong/mathjs - * - * Math.js is an extensive math library for JavaScript and Node.js, - * It features real and complex numbers, units, matrices, a large set of - * mathematical functions, and a flexible expression parser. - * - * @version 2.0.0-SNAPSHOT - * @date 2015-03-01 - * - * @license - * Copyright (C) 2013-2015 Jos de Jong - * - * Licensed under the Apache License, Version 2.0 (the "License"); you may not - * use this file except in compliance with the License. You may obtain a copy - * of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT - * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the - * License for the specific language governing permissions and limitations under - * the License. - */ +/** + * math.js + * https://github.com/josdejong/mathjs + * + * Math.js is an extensive math library for JavaScript and Node.js, + * It features real and complex numbers, units, matrices, a large set of + * mathematical functions, and a flexible expression parser. + * + * @version 2.0.0-SNAPSHOT + * @date 2015-04-27 + * + * @license + * Copyright (C) 2013-2015 Jos de Jong + * + * Licensed under the Apache License, Version 2.0 (the "License"); you may not + * use this file except in compliance with the License. You may obtain a copy + * of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT + * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the + * License for the specific language governing permissions and limitations under + * the License. + */ (function webpackUniversalModuleDefinition(root, factory) { if(typeof exports === 'object' && typeof module === 'object') @@ -38,41 +38,41 @@ return /******/ (function(modules) { // webpackBootstrap /******/ // The module cache /******/ var installedModules = {}; -/******/ + /******/ // The require function /******/ function __webpack_require__(moduleId) { -/******/ + /******/ // Check if module is in cache /******/ if(installedModules[moduleId]) /******/ return installedModules[moduleId].exports; -/******/ + /******/ // Create a new module (and put it into the cache) /******/ var module = installedModules[moduleId] = { /******/ exports: {}, /******/ id: moduleId, /******/ loaded: false /******/ }; -/******/ + /******/ // Execute the module function /******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__); -/******/ + /******/ // Flag the module as loaded /******/ module.loaded = true; -/******/ + /******/ // Return the exports of the module /******/ return module.exports; /******/ } -/******/ -/******/ + + /******/ // expose the modules object (__webpack_modules__) /******/ __webpack_require__.m = modules; -/******/ + /******/ // expose the module cache /******/ __webpack_require__.c = installedModules; -/******/ + /******/ // __webpack_public_path__ /******/ __webpack_require__.p = ""; -/******/ + /******/ // Load entry module and return exports /******/ return __webpack_require__(0); /******/ }) @@ -81,17593 +81,19242 @@ return /******/ (function(modules) { // webpackBootstrap /* 0 */ /***/ function(module, exports, __webpack_require__) { - module.exports = __webpack_require__(1); + var loader = __webpack_require__(1); + + /** + * math.js factory function. Creates a new instance of math.js + * + * @param {Object} [config] Available configuration options: + * {String} matrix + * A string 'matrix' (default) or 'array'. + * {String} number + * A string 'number' (default) or 'bignumber' + * {Number} precision + * The number of significant digits for BigNumbers. + * Not applicable for Numbers. + */ + function create (config) { + // create a new, empty math.js instance + var math = loader.create(); + math.create = create; + + var _config = math._config; // TODO: cleanup as soon as redundant + + // util methods for Arrays and Matrices + math.import(__webpack_require__(2)); + + // expression (parse, Parser, nodes, docs) + math.expression = {}; + math.expression.node = __webpack_require__(15); + math.import(__webpack_require__(13)); + math.import(__webpack_require__(14)); + math.expression.docs = __webpack_require__(16); + + // data types (Matrix, Complex, Unit, ...) + math.type.Complex = __webpack_require__(3); + math.type.Range = __webpack_require__(4); + math.type.Index = __webpack_require__(5); + math.import(__webpack_require__(6)); + math.type.Unit = __webpack_require__(7); + math.type.Help = __webpack_require__(8); + math.type.ResultSet = __webpack_require__(9); + math.import(__webpack_require__(10)); + math.import(__webpack_require__(11)); + + // matrix storage formats + math.import(__webpack_require__(17)); + math.import(__webpack_require__(18)); + + // sparse accumulator + math.import(__webpack_require__(19)); + + // serialization utilities + // math.json.* + math.import(__webpack_require__(20)); + + // functions - algebra/decomposition + math.import(__webpack_require__(164)); + + // functions - algebra/solver + math.import(__webpack_require__(165)); + + // functions - arithmetic + math.import(__webpack_require__(31)); + math.import(__webpack_require__(32)); + math.import(__webpack_require__(33)); + math.import(__webpack_require__(34)); + math.import(__webpack_require__(35)); + math.import(__webpack_require__(36)); + math.import(__webpack_require__(37)); + math.import(__webpack_require__(38)); + math.import(__webpack_require__(39)); + math.import(__webpack_require__(40)); + math.import(__webpack_require__(41)); + math.import(__webpack_require__(42)); + math.import(__webpack_require__(43)); + math.import(__webpack_require__(44)); + math.import(__webpack_require__(45)); + math.import(__webpack_require__(46)); + math.import(__webpack_require__(47)); + math.import(__webpack_require__(48)); + math.import(__webpack_require__(49)); + math.import(__webpack_require__(50)); + math.import(__webpack_require__(51)); + math.import(__webpack_require__(52)); + math.import(__webpack_require__(53)); + math.import(__webpack_require__(54)); + math.import(__webpack_require__(55)); + math.import(__webpack_require__(56)); + math.import(__webpack_require__(57)); + math.import(__webpack_require__(58)); + + // functions - bitwise + math.import(__webpack_require__(59)); + math.import(__webpack_require__(60)); + math.import(__webpack_require__(61)); + math.import(__webpack_require__(62)); + math.import(__webpack_require__(63)); + math.import(__webpack_require__(64)); + math.import(__webpack_require__(65)); + + // functions - complex + math.import(__webpack_require__(66)); + math.import(__webpack_require__(67)); + math.import(__webpack_require__(68)); + math.import(__webpack_require__(69)); + + // functions - construction + math.import(__webpack_require__(70)); + math.import(__webpack_require__(71)); + math.import(__webpack_require__(72)); + math.import(__webpack_require__(73)); + math.import(__webpack_require__(74)); + math.import(__webpack_require__(75)); + math.import(__webpack_require__(76)); + math.import(__webpack_require__(77)); + math.import(__webpack_require__(78)); + math.import(__webpack_require__(79)); + math.import(__webpack_require__(80)); + + // expression parser + math.import(__webpack_require__(81)); + math.import(__webpack_require__(82)); + math.import(__webpack_require__(83)); + math.import(__webpack_require__(84)); + + // functions - logical + math.import(__webpack_require__(85)); + math.import(__webpack_require__(86)); + math.import(__webpack_require__(87)); + math.import(__webpack_require__(88)); + + // functions - matrix + math.import(__webpack_require__(89)); + math.import(__webpack_require__(90)); + math.import(__webpack_require__(91)); + math.import(__webpack_require__(92)); + math.import(__webpack_require__(93)); + math.import(__webpack_require__(94)); + math.import(__webpack_require__(95)); + math.import(__webpack_require__(96)); + __webpack_require__(97)(math, _config); + __webpack_require__(98)(math, _config); + __webpack_require__(99)(math, _config); + math.import(__webpack_require__(100)); + math.import(__webpack_require__(101)); + __webpack_require__(102)(math, _config); + math.import(__webpack_require__(103)); + math.import(__webpack_require__(104)); + __webpack_require__(105)(math, _config); + + // functions - probability + //math.import(require('./lib/function/probability/distribution')); // TODO: rethink math.distribution + math.import(__webpack_require__(106)); + math.import(__webpack_require__(107)); + math.import(__webpack_require__(108)); + math.import(__webpack_require__(109)); + math.import(__webpack_require__(110)); + math.import(__webpack_require__(111)); + math.import(__webpack_require__(112)); + + // functions - relational + math.import(__webpack_require__(113)); + math.import(__webpack_require__(114)); + math.import(__webpack_require__(115)); + math.import(__webpack_require__(116)); + math.import(__webpack_require__(117)); + math.import(__webpack_require__(118)); + math.import(__webpack_require__(119)); + math.import(__webpack_require__(120)); + + // functions - statistics + math.import(__webpack_require__(121)); + math.import(__webpack_require__(122)); + math.import(__webpack_require__(123)); + math.import(__webpack_require__(124)); + math.import(__webpack_require__(125)); + math.import(__webpack_require__(126)); + math.import(__webpack_require__(127)); + math.import(__webpack_require__(128)); + + // functions - trigonometry + math.import(__webpack_require__(129)); + math.import(__webpack_require__(130)); + math.import(__webpack_require__(131)); + math.import(__webpack_require__(132)); + math.import(__webpack_require__(133)); + math.import(__webpack_require__(134)); + math.import(__webpack_require__(135)); + math.import(__webpack_require__(136)); + math.import(__webpack_require__(137)); + math.import(__webpack_require__(138)); + math.import(__webpack_require__(139)); + math.import(__webpack_require__(140)); + math.import(__webpack_require__(141)); + math.import(__webpack_require__(142)); + math.import(__webpack_require__(143)); + math.import(__webpack_require__(144)); + math.import(__webpack_require__(145)); + math.import(__webpack_require__(146)); + math.import(__webpack_require__(147)); + math.import(__webpack_require__(148)); + math.import(__webpack_require__(149)); + math.import(__webpack_require__(150)); + math.import(__webpack_require__(151)); + math.import(__webpack_require__(152)); + math.import(__webpack_require__(153)); + + // functions - units + math.import(__webpack_require__(154)); + + // functions - utils + math.import(__webpack_require__(155)); + math.import(__webpack_require__(156)); + math.import(__webpack_require__(157)); + math.import(__webpack_require__(158)); + // note: import is already loaded by loader.js + math.import(__webpack_require__(159)); + math.import(__webpack_require__(160)); + math.import(__webpack_require__(161)); + math.import(__webpack_require__(162)); + math.import(__webpack_require__(163)); + + // attach transform functions (for converting one-based indices to zero-based) + math.expression.transform = { + concat: __webpack_require__(21)(math, _config), + filter: __webpack_require__(22)(math, _config), + forEach:__webpack_require__(23)(math, _config), + index: __webpack_require__(30)(math, _config), + map: __webpack_require__(24)(math, _config), + max: __webpack_require__(25)(math, _config), + mean: __webpack_require__(26)(math, _config), + min: __webpack_require__(27)(math, _config), + range: __webpack_require__(28)(math, _config), + subset: __webpack_require__(29)(math, _config) + }; + + // create Chain, and create proxies for all functions/constants in the math + // namespace. + math.type.Chain = __webpack_require__(12)(); + math.type.Chain.createProxy(math); + + // apply custom options + math.config(config); + + return math; + } + + // return a new instance of math.js + module.exports = create(); /***/ }, /* 1 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var typed = __webpack_require__(163); - var object = __webpack_require__(2); - var digits = __webpack_require__(3).digits; - var Complex = __webpack_require__(4); - var Range = __webpack_require__(5); - var Index = __webpack_require__(6); - var Matrix = __webpack_require__(7); - var Unit = __webpack_require__(8); - var Help = __webpack_require__(9); - var ResultSet = __webpack_require__(10); - - /** - * math.js factory function. - * - * @param {Object} [config] Available configuration options: - * {String} matrix - * A string 'matrix' (default) or 'array'. - * {String} number - * A string 'number' (default) or 'bignumber' - * {Number} precision - * The number of significant digits for BigNumbers. - * Not applicable for Numbers. - */ - function create (config) { - // simple test for ES5 support - if (typeof Object.create !== 'function') { - throw new Error('ES5 not supported by this JavaScript engine. ' + - 'Please load the es5-shim and es5-sham library for compatibility.'); - } - - // create namespace - var math = {}; - - // create configuration options. These are private - var _config = { - // type of default matrix output. Choose 'matrix' (default) or 'array' - matrix: 'matrix', - - // type of default number output. Choose 'number' (default) or 'bignumber' - number: 'number', - - // number of significant digits in BigNumbers - precision: 64, - - // minimum relative difference between two compared values, - // used by all comparison functions - epsilon: 1e-14 - }; - - /** - * Set configuration options for math.js, and get current options - * @param {Object} [options] Available options: - * {String} matrix - * A string 'matrix' (default) or 'array'. - * {String} number - * A string 'number' (default) or 'bignumber' - * {Number} precision - * The number of significant digits for BigNumbers. - * Not applicable for Numbers. - * @return {Object} Returns the current configuration - */ - math.config = function(options) { - if (options) { - // merge options - object.deepExtend(_config, options); - - if (options.precision) { - math.type.BigNumber.config({ - precision: options.precision - }); - } - - // reload the constants (they depend on option number and precision) - // this must be done after math.type.BigNumber.config is applied - __webpack_require__(11)(math, _config); - - // TODO: remove deprecated setting some day (deprecated since version 0.17.0) - if (options.number && options.number.defaultType) { - throw new Error('setting `number.defaultType` is deprecated. Use `number` instead.') - } - - // TODO: remove deprecated setting some day (deprecated since version 0.17.0) - if (options.number && options.number.precision) { - throw new Error('setting `number.precision` is deprecated. Use `precision` instead.') - } - - // TODO: remove deprecated setting some day (deprecated since version 0.17.0) - if (options.matrix && options.matrix.defaultType) { - throw new Error('setting `matrix.defaultType` is deprecated. Use `matrix` instead.') - } - - // TODO: remove deprecated setting some day (deprecated since version 0.15.0) - if (options.matrix && options.matrix['default']) { - throw new Error('setting `matrix.default` is deprecated. Use `matrix` instead.') - } - - // TODO: remove deprecated setting some day (deprecated since version 0.20.0) - if (options.decimals) { - throw new Error('setting `decimals` is deprecated. Use `precision` instead.') - } - } - - // return a clone of the settings - return object.clone(_config); - }; - - /** - * math.js factory function. Creates a new instance of math.js - * - * @param {Object} [config] Available configuration options: - * {String} matrix - * A string 'matrix' (default) or 'array'. - * {String} number - * A string 'number' (default) or 'bignumber' - * {Number} precision - * The number of significant digits for BigNumbers. - * Not applicable for Numbers. - */ - math.create = create; - - // create a new BigNumber factory for this instance of math.js - var BigNumber = __webpack_require__(12).constructor(); - - // TODO: remove BigNumber.convert - // extend BigNumber with a function convert - if (typeof BigNumber.convert !== 'function' || true) { // FIXME: remove BigNumber.convert - /** - * Try to convert a Number in to a BigNumber. - * If the number has 15 or mor significant digits, the Number cannot be - * converted to BigNumber and will return the original number. - * @param {Number} number - * @return {BigNumber | Number} bignumber - */ - BigNumber.convert = function(number) { - if (digits(number) > 15) { - return number; - } - else { - return new BigNumber(number); - } - }; - } - else { - throw new Error('Cannot add function convert to BigNumber: function already exists'); - } - - // errors - math.error = __webpack_require__(13); - - // types (Matrix, Complex, Unit, ...) - math.type = { - Complex: Complex, - Range: Range, - Index: Index, - Matrix: Matrix, - Unit: Unit, - Help: Help, - ResultSet: ResultSet, - BigNumber: BigNumber - }; - - // configure typed functions - typed.types['Complex'] = function (x) { return x instanceof Complex; }; - typed.types['Range'] = function (x) { return x instanceof Range; }; - typed.types['Index'] = function (x) { return x instanceof Index; }; - typed.types['Matrix'] = function (x) { return x instanceof Matrix; }; - typed.types['Unit'] = function (x) { return x instanceof Unit; }; - typed.types['Help'] = function (x) { return x instanceof Help; }; - typed.types['ResultSet'] = function (x) { return x instanceof ResultSet; }; - typed.types['BigNumber'] = function (x) { return x instanceof BigNumber; }; - - typed.conversions = [ - { - from: 'number', - to: 'Complex', - convert: function (x) { - return new Complex(x, 0); - } - }, { - from: 'BigNumber', - to: 'Complex', - convert: function (x) { - return new Complex(x.toNumber(), 0); - } - }, { - from: 'number', - to: 'string', - convert: function (x) { - return x + ''; - } - }, { - from: 'number', - to: 'BigNumber', - convert: function (x) { - // note: conversion from number to BigNumber can fail if x has >15 digits - if (digits(x) > 15) { - throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + - '(value: ' + x + '). ' + - 'Use function bignumber(x) to convert to BigNumber.'); - } - return new BigNumber(x); - } - }, { - from: 'boolean', - to: 'number', - convert: function (x) { - return +x; - } - }, { - from: 'boolean', - to: 'string', - convert: function (x) { - return +x; - } - }, { - from: 'boolean', - to: 'BigNumber', - convert: function (x) { - return new BigNumber(+x); - } - }, { - from: 'null', - to: 'number', - convert: function () { - return 0; - } - }, { - from: 'null', - to: 'string', - convert: function () { - return 'null'; - } - }, { - from: 'null', - to: 'BigNumber', - convert: function () { - return new BigNumber(0); - } - }, { - from: 'Array', - to: 'Matrix', - convert: function (array) { - return new Matrix(array); - } - } - ]; - - math.collection = __webpack_require__(14); - - // expression (parse, Parser, nodes, docs) - math.expression = {}; - math.expression.node = __webpack_require__(15); - math.expression.parse = __webpack_require__(16); - math.expression.Parser = __webpack_require__(17); - math.expression.docs = __webpack_require__(18); - - // serialization utilities - math.json = { - reviver: __webpack_require__(19) - }; - - // expression parser - __webpack_require__(31)(math, _config); - __webpack_require__(32)(math, _config); - __webpack_require__(33)(math, _config); - __webpack_require__(34)(math, _config); - - // functions - arithmetic - math.abs = __webpack_require__(35)(_config); - math.add = __webpack_require__(36)(_config); - __webpack_require__(37)(math, _config); - __webpack_require__(38)(math, _config); - math.divide = __webpack_require__(39)(_config); - __webpack_require__(40)(math, _config); - __webpack_require__(41)(math, _config); - __webpack_require__(42)(math, _config); - math.exp = __webpack_require__(43)(_config); - __webpack_require__(44)(math, _config); - __webpack_require__(45)(math, _config); - __webpack_require__(46)(math, _config); - __webpack_require__(47)(math, _config); - math.log = __webpack_require__(48)(_config); - __webpack_require__(49)(math, _config); - __webpack_require__(50)(math, _config); - math.multiply = __webpack_require__(51)(_config); - __webpack_require__(52)(math, _config); - __webpack_require__(53)(math, _config); - math.pow = __webpack_require__(54)(_config); - __webpack_require__(55)(math, _config); - __webpack_require__(56)(math, _config); - math.sqrt = __webpack_require__(57)(_config); - __webpack_require__(58)(math, _config); - math.subtract = __webpack_require__(59)(_config); - math.unaryMinus = __webpack_require__(60)(_config); - __webpack_require__(61)(math, _config); - __webpack_require__(62)(math, _config); - - // functions - bitwise - math.bitAnd = __webpack_require__(63)(_config); - __webpack_require__(64)(math, _config); - __webpack_require__(65)(math, _config); - __webpack_require__(66)(math, _config); - __webpack_require__(67)(math, _config); - __webpack_require__(68)(math, _config); - __webpack_require__(69)(math, _config); - - // functions - complex - __webpack_require__(70)(math, _config); - __webpack_require__(71)(math, _config); - __webpack_require__(72)(math, _config); - __webpack_require__(73)(math, _config); - - // functions - construction - __webpack_require__(74)(math, _config); - __webpack_require__(75)(math, _config); - __webpack_require__(76)(math, _config); - __webpack_require__(77)(math, _config); - __webpack_require__(78)(math, _config); - __webpack_require__(79)(math, _config); - __webpack_require__(80)(math, _config); - __webpack_require__(81)(math, _config); - __webpack_require__(82)(math, _config); - __webpack_require__(83)(math, _config); - - // functions - logical - __webpack_require__(84)(math, _config); - __webpack_require__(85)(math, _config); - __webpack_require__(86)(math, _config); - __webpack_require__(87)(math, _config); - - // functions - matrix - __webpack_require__(88)(math, _config); - __webpack_require__(89)(math, _config); - math.det = __webpack_require__(90)(_config); - __webpack_require__(91)(math, _config); - __webpack_require__(92)(math, _config); - math.eye = __webpack_require__(93)(_config); - __webpack_require__(94)(math, _config); - math.inv = __webpack_require__(95)(_config); - __webpack_require__(96)(math, _config); - __webpack_require__(97)(math, _config); - __webpack_require__(98)(math, _config); - __webpack_require__(99)(math, _config); - __webpack_require__(100)(math, _config); - __webpack_require__(101)(math, _config); - __webpack_require__(102)(math, _config); - __webpack_require__(103)(math, _config); - __webpack_require__(104)(math, _config); - - // functions - probability - //require('./function/probability/distribution')(math, _config); // TODO: rethink math.distribution - __webpack_require__(105)(math, _config); - __webpack_require__(106)(math, _config); - __webpack_require__(107)(math, _config); - __webpack_require__(108)(math, _config); - __webpack_require__(109)(math, _config); - __webpack_require__(110)(math, _config); - __webpack_require__(111)(math, _config); - - // functions - relational - __webpack_require__(112)(math, _config); - __webpack_require__(113)(math, _config); - math.equal = __webpack_require__(114)(_config); - math.larger = __webpack_require__(115)(_config); - __webpack_require__(116)(math, _config); - math.smaller = __webpack_require__(117)(_config); - __webpack_require__(118)(math, _config); - __webpack_require__(119)(math, _config); - - // functions - statistics - math.min = __webpack_require__(120)(_config); - __webpack_require__(121)(math, _config); - __webpack_require__(122)(math, _config); - __webpack_require__(123)(math, _config); - __webpack_require__(124)(math, _config); - __webpack_require__(125)(math, _config); - math.sum = __webpack_require__(126)(_config); - __webpack_require__(127)(math, _config); - - // functions - trigonometry - __webpack_require__(128)(math, _config); - __webpack_require__(129)(math, _config); - __webpack_require__(130)(math, _config); - __webpack_require__(131)(math, _config); - __webpack_require__(132)(math, _config); - __webpack_require__(133)(math, _config); - __webpack_require__(134)(math, _config); - __webpack_require__(135)(math, _config); - __webpack_require__(136)(math, _config); - __webpack_require__(137)(math, _config); - __webpack_require__(138)(math, _config); - __webpack_require__(139)(math, _config); - __webpack_require__(140)(math, _config); - __webpack_require__(141)(math, _config); - __webpack_require__(142)(math, _config); - __webpack_require__(143)(math, _config); - __webpack_require__(144)(math, _config); - __webpack_require__(145)(math, _config); - __webpack_require__(146)(math, _config); - __webpack_require__(147)(math, _config); - __webpack_require__(148)(math, _config); - __webpack_require__(149)(math, _config); - __webpack_require__(150)(math, _config); - __webpack_require__(151)(math, _config); - __webpack_require__(152)(math, _config); - - // functions - units - __webpack_require__(153)(math, _config); - - // functions - utils - __webpack_require__(154)(math, _config); - __webpack_require__(155)(math, _config); - __webpack_require__(156)(math, _config); - __webpack_require__(157)(math, _config); - __webpack_require__(158)(math, _config); - __webpack_require__(159)(math, _config); - __webpack_require__(160)(math, _config); - __webpack_require__(161)(math, _config); - __webpack_require__(162)(math, _config); - - // TODO: deprecated since version 0.25.0, remove some day. - math.ifElse = function () { - throw new Error('Function ifElse is deprecated. Use the conditional operator instead.'); - }; - - // constants - __webpack_require__(11)(math, _config); - - // attach transform functions (for converting one-based indices to zero-based) - math.expression.transform = { - concat: __webpack_require__(20)(math, _config), - filter: __webpack_require__(21)(math, _config), - forEach:__webpack_require__(22)(math, _config), - index: __webpack_require__(23)(math, _config), - map: __webpack_require__(24)(math, _config), - max: __webpack_require__(25)(math, _config), - mean: __webpack_require__(26)(math, _config), - min: __webpack_require__(27)(math, _config), - range: __webpack_require__(28)(math, _config), - subset: __webpack_require__(29)(math, _config) - }; - - // selector (we initialize after all functions are loaded) - math.chaining = {}; - math.chaining.Chain = __webpack_require__(30)(math, _config); - math.chaining.Selector = math.chaining.Chain; // TODO: deprecate in v2.0 - - // apply provided configuration options - math.config(_config); // apply the default options - math.config(config); // apply custom options - - // return the new instance - return math; - } - - // create a default instance of math.js - var math = create(); - - if (typeof window !== 'undefined') { - window.mathjs = math; // TODO: deprecate the mathjs namespace some day (replaced with 'math' since version 0.25.0) - } - - // export the default instance - module.exports = math; - + var isFactory = __webpack_require__(166).isFactory; + + /** + * Math.js loader. Creates a new, empty math.js instance + * @returns {Object} Returns a math.js instance containing + * a function `import` to add new functions + */ + exports.create = function create () { + // simple test for ES5 support + if (typeof Object.create !== 'function') { + throw new Error('ES5 not supported by this JavaScript engine. ' + + 'Please load the es5-shim and es5-sham library for compatibility.'); + } + + // cached factories and instances + var factories = []; + var instances = []; + + // create a namespace for the mathjs instance + var math = { + type: {} + }; + + // create a new typed instance + var typed = __webpack_require__(167).create(math); + + // create configuration options. These are private + var _config = { + // type of default matrix output. Choose 'matrix' (default) or 'array' + matrix: 'matrix', + + // type of default number output. Choose 'number' (default) or 'bignumber' + number: 'number', + + // number of significant digits in BigNumbers + precision: 64, + + // minimum relative difference between two compared values, + // used by all comparison functions + epsilon: 1e-14 + }; + + /** + * Load a function or data type from a factory. + * If the function or data type already exists, the existing instance is + * returned. + * @param {{type: string, name: string, factory: function}} factory + * @returns {*} + */ + function load (factory) { + if (!isFactory(factory)) { + throw new Error('Factory object with properties `type`, `name`, and `factory` expected'); + } + + var index = factories.indexOf(factory); + var instance; + if (index === -1) { + // doesn't yet exist + if (factory.math) { + // pass with math namespace + instance = factory.factory(math.type, _config, load, typed, math); + } + else { + instance = factory.factory(math.type, _config, load, typed); + } + + // append to the cache + factories.push(factory); + instances.push(instance); + } + else { + // already existing function, return the cached instance + instance = instances[index]; + } + + return instance; + } + + // load the import function, which can be used to load all other functions, + // constants, and types + math['import'] = load(__webpack_require__(168)); + + // FIXME: load constants via math.import() like all functions (problem: it must be reloaded when config changes) + // constants + __webpack_require__(169)(math, _config); + + math._config = _config; // TODO: cleanup when everything is refactored + + // TODO: remove errors from the namespace as soon as all functions are refactored + // errors + math.error = __webpack_require__(170); + + return math; + }; /***/ }, /* 2 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(336); - - /** - * Clone an object - * - * clone(x) - * - * Can clone any primitive type, array, and object. - * If x has a function clone, this function will be invoked to clone the object. - * - * @param {*} x - * @return {*} clone - */ - exports.clone = function clone(x) { - var type = typeof x; - - // immutable primitive types - if (type === 'number' || type === 'string' || type === 'boolean' || - x === null || x === undefined) { - return x; - } - - // use clone function of the object when available - if (typeof x.clone === 'function') { - return x.clone(); - } - - // array - if (Array.isArray(x)) { - return x.map(function (value) { - return clone(value); - }); - } - - if (x instanceof Number) return new Number(x.valueOf()); - if (x instanceof String) return new String(x.valueOf()); - if (x instanceof Boolean) return new Boolean(x.valueOf()); - if (x instanceof Date) return new Date(x.valueOf()); - if (x instanceof BigNumber) return x; // bignumbers are immutable - if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp - - // object - var m = {}; - for (var key in x) { - if (x.hasOwnProperty(key)) { - m[key] = clone(x[key]); - } - } - return m; - }; - - /** - * Extend object a with the properties of object b - * @param {Object} a - * @param {Object} b - * @return {Object} a - */ - exports.extend = function(a, b) { - for (var prop in b) { - if (b.hasOwnProperty(prop)) { - a[prop] = b[prop]; - } - } - return a; - }; - - /** - * Deep extend an object a with the properties of object b - * @param {Object} a - * @param {Object} b - * @returns {Object} - */ - exports.deepExtend = function deepExtend (a, b) { - // TODO: add support for Arrays to deepExtend - if (Array.isArray(b)) { - throw new TypeError('Arrays are not supported by deepExtend'); - } - - for (var prop in b) { - if (b.hasOwnProperty(prop)) { - if (b[prop] && b[prop].constructor === Object) { - if (a[prop] === undefined) { - a[prop] = {}; - } - if (a[prop].constructor === Object) { - deepExtend(a[prop], b[prop]); - } - else { - a[prop] = b[prop]; - } - } else if (Array.isArray(b[prop])) { - throw new TypeError('Arrays are not supported by deepExtend'); - } else { - a[prop] = b[prop]; - } - } - } - return a; - }; - - /** - * Deep test equality of all fields in two pairs of arrays or objects. - * @param {Array | Object} a - * @param {Array | Object} b - * @returns {boolean} - */ - exports.deepEqual = function deepEqual (a, b) { - var prop, i, len; - if (Array.isArray(a)) { - if (!Array.isArray(b)) { - return false; - } - - if (a.length != b.length) { - return false; - } - - for (i = 0, len = a.length; i < len; i++) { - if (!exports.deepEqual(a[i], b[i])) { - return false; - } - } - return true; - } - else if (a instanceof Object) { - if (Array.isArray(b) || !(b instanceof Object)) { - return false; - } - - for (prop in a) { - //noinspection JSUnfilteredForInLoop - if (!exports.deepEqual(a[prop], b[prop])) { - return false; - } - } - for (prop in b) { - //noinspection JSUnfilteredForInLoop - if (!exports.deepEqual(a[prop], b[prop])) { - return false; - } - } - return true; - } - else { - return (typeof a === typeof b) && (a == b); - } - }; - - /** - * Test whether the current JavaScript engine supports Object.defineProperty - * @returns {boolean} returns true if supported - */ - exports.canDefineProperty = function () { - // test needed for broken IE8 implementation - try { - if (Object.defineProperty) { - Object.defineProperty({}, 'x', {}); - return true; - } - } catch (e) {} - - return false; - }; - - /** - * Attach a lazy loading property to a constant. - * The given function `fn` is called once when the property is first requested. - * On older browsers (= size.length) { + // TODO: would be more clear when throwing a DimensionError here + throw new IndexError(dim, size.length); + } + + if (mat instanceof type.Matrix) { + return matrix(_reduce(mat.valueOf(), dim, callback)); + }else { + return _reduce(mat, dim, callback); + } + }; + + /** + * Recursively reduce a matrix + * @param {Array} mat + * @param {Number} dim + * @param {Function} callback + * @returns {Array} ret + * @private + */ + function _reduce(mat, dim, callback){ + var i, ret, val, tran; + + if(dim<=0){ + if( !Array.isArray(mat[0]) ){ + val = mat[0]; + for(i=1; i 0) { - return 1; - } - else if (x < 0) { - return -1; - } - else { - return 0; - } - }; - - /** - * Convert a number to a formatted string representation. - * - * Syntax: - * - * format(value) - * format(value, options) - * format(value, precision) - * format(value, fn) - * - * Where: - * - * {Number} value The value to be formatted - * {Object} options An object with formatting options. Available options: - * {String} notation - * Number notation. Choose from: - * 'fixed' Always use regular number notation. - * For example '123.40' and '14000000' - * 'exponential' Always use exponential notation. - * For example '1.234e+2' and '1.4e+7' - * 'auto' (default) Regular number notation for numbers - * having an absolute value between - * `lower` and `upper` bounds, and uses - * exponential notation elsewhere. - * Lower bound is included, upper bound - * is excluded. - * For example '123.4' and '1.4e7'. - * {Number} precision A number between 0 and 16 to round - * the digits of the number. - * In case of notations 'exponential' and - * 'auto', `precision` defines the total - * number of significant digits returned - * and is undefined by default. - * In case of notation 'fixed', - * `precision` defines the number of - * significant digits after the decimal - * point, and is 0 by default. - * {Object} exponential An object containing two parameters, - * {Number} lower and {Number} upper, - * used by notation 'auto' to determine - * when to return exponential notation. - * Default values are `lower=1e-3` and - * `upper=1e5`. - * Only applicable for notation `auto`. - * {Function} fn A custom formatting function. Can be used to override the - * built-in notations. Function `fn` is called with `value` as - * parameter and must return a string. Is useful for example to - * format all values inside a matrix in a particular way. - * - * Examples: - * - * format(6.4); // '6.4' - * format(1240000); // '1.24e6' - * format(1/3); // '0.3333333333333333' - * format(1/3, 3); // '0.333' - * format(21385, 2); // '21000' - * format(12.071, {notation: 'fixed'}); // '12' - * format(2.3, {notation: 'fixed', precision: 2}); // '2.30' - * format(52.8, {notation: 'exponential'}); // '5.28e+1' - * - * @param {Number} value - * @param {Object | Function | Number} [options] - * @return {String} str The formatted value - */ - exports.format = function(value, options) { - if (typeof options === 'function') { - // handle format(value, fn) - return options(value); - } - - // handle special cases - if (value === Infinity) { - return 'Infinity'; - } - else if (value === -Infinity) { - return '-Infinity'; - } - else if (isNaN(value)) { - return 'NaN'; - } - - // default values for options - var notation = 'auto'; - var precision = undefined; - - if (options) { - // determine notation from options - if (options.notation) { - notation = options.notation; - } - - // determine precision from options - if (exports.isNumber(options)) { - precision = options; - } - else if (options.precision) { - precision = options.precision; - } - } - - // handle the various notations - switch (notation) { - case 'fixed': - return exports.toFixed(value, precision); - - case 'exponential': - return exports.toExponential(value, precision); - - case 'auto': - // determine lower and upper bound for exponential notation. - // TODO: implement support for upper and lower to be BigNumbers themselves - var lower = 1e-3; - var upper = 1e5; - if (options && options.exponential) { - if (options.exponential.lower !== undefined) { - lower = options.exponential.lower; - } - if (options.exponential.upper !== undefined) { - upper = options.exponential.upper; - } - } - - // handle special case zero - if (value === 0) return '0'; - - // determine whether or not to output exponential notation - var str; - var abs = Math.abs(value); - if (abs >= lower && abs < upper) { - // normal number notation - // Note: IE7 does not allow value.toPrecision(undefined) - var valueStr = precision ? - value.toPrecision(Math.min(precision, 21)) : - value.toPrecision(); - str = parseFloat(valueStr) + ''; - } - else { - // exponential notation - str = exports.toExponential(value, precision); - } - - // remove trailing zeros after the decimal point - return str.replace(/((\.\d*?)(0+))($|e)/, function () { - var digits = arguments[2]; - var e = arguments[4]; - return (digits !== '.') ? digits + e : e; - }); - - default: - throw new Error('Unknown notation "' + notation + '". ' + - 'Choose "auto", "exponential", or "fixed".'); - } - }; - - /** - * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3' - * @param {Number} value - * @param {Number} [precision] Number of digits in formatted output. - * If not provided, the maximum available digits - * is used. - * @returns {string} str - */ - exports.toExponential = function(value, precision) { - if (precision !== undefined) { - return value.toExponential(Math.min(precision - 1, 20)); - } - else { - return value.toExponential(); - } - }; - - /** - * Format a number with fixed notation. - * @param {Number} value - * @param {Number} [precision=0] Optional number of decimals after the - * decimal point. Zero by default. - */ - exports.toFixed = function(value, precision) { - return value.toFixed(Math.min(precision, 20)); - }; - - /** - * Count the number of significant digits of a number. - * - * For example: - * 2.34 returns 3 - * 0.0034 returns 2 - * 120.5e+30 returns 4 - * - * @param {Number} value - * @return {Number} digits Number of significant digits - */ - exports.digits = function(value) { - return value - .toExponential() - .replace(/e.*$/, '') // remove exponential notation - .replace( /^0\.?0*|\./, '') // remove decimal point and leading zeros - .length - }; - - /** - * Minimum number added to one that makes the result different than one - */ - exports.DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16; - - /** - * Compares two floating point numbers. - * @param {Number} x First value to compare - * @param {Number} y Second value to compare - * @param {Number} [epsilon] The maximum relative difference between x and y - * If epsilon is undefined or null, the function will - * test whether x and y are exactly equal. - * @return {boolean} whether the two numbers are equal - */ - exports.nearlyEqual = function(x, y, epsilon) { - // if epsilon is null or undefined, test whether x and y are exactly equal - if (epsilon == null) return x == y; - - // use "==" operator, handles infinities - if (x == y) return true; - - // NaN - if (isNaN(x) || isNaN(y)) return false; - - // at this point x and y should be finite - if(isFinite(x) && isFinite(y)) { - // check numbers are very close, needed when comparing numbers near zero - var diff = Math.abs(x - y); - if (diff < exports.DBL_EPSILON) { - return true; - } - else { - // use relative error - return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon; - } - } - - // Infinite and Number or negative Infinite and positive Infinite cases - return false; - }; + 'use strict'; + + var util = __webpack_require__(171), + Unit = __webpack_require__(7), + number = util.number, + + isNumber = util.number.isNumber, + isUnit = Unit.isUnit, + isString = util.string.isString; + + /** + * @constructor Complex + * + * A complex value can be constructed in the following ways: + * var a = new Complex(); + * var b = new Complex(re, im); + * var c = Complex.parse(str); + * + * Example usage: + * var a = new Complex(3, -4); // 3 - 4i + * a.re = 5; // a = 5 - 4i + * var i = a.im; // -4; + * var b = Complex.parse('2 + 6i'); // 2 + 6i + * var c = new Complex(); // 0 + 0i + * var d = math.add(a, b); // 5 + 2i + * + * @param {Number} re The real part of the complex value + * @param {Number} [im] The imaginary part of the complex value + */ + function Complex(re, im) { + if (!(this instanceof Complex)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + switch (arguments.length) { + case 0: + this.re = 0; + this.im = 0; + break; + + case 1: + var arg = arguments[0]; + if (typeof arg === 'object') { + if('re' in arg && 'im' in arg) { + var construct = new Complex(arg.re, arg.im); // pass on input validation + this.re = construct.re; + this.im = construct.im; + break; + } else if ('r' in arg && 'phi' in arg) { + var construct = Complex.fromPolar(arg.r, arg.phi); + this.re = construct.re; + this.im = construct.im; + break; + } + } + throw new SyntaxError('Object with the re and im or r and phi properties expected.'); + + case 2: + if (!isNumber(re) || !isNumber(im)) { + throw new TypeError('Two numbers expected in Complex constructor'); + } + this.re = re; + this.im = im; + break; + + default: + throw new SyntaxError('One, two or three arguments expected in Complex constructor'); + } + } + + /** + * Test whether value is a Complex value + * @param {*} value + * @return {Boolean} isComplex + */ + Complex.isComplex = function (value) { + return (value instanceof Complex); + }; + + // private variables and functions for the parser + var text, index, c; + + function skipWhitespace() { + while (c == ' ' || c == '\t') { + next(); + } + } + + function isDigitDot (c) { + return ((c >= '0' && c <= '9') || c == '.'); + } + + function isDigit (c) { + return ((c >= '0' && c <= '9')); + } + + function next() { + index++; + c = text.charAt(index); + } + + function revert(oldIndex) { + index = oldIndex; + c = text.charAt(index); + } + + function parseNumber () { + var number = ''; + var oldIndex; + oldIndex = index; + + if (c == '+') { + next(); + } + else if (c == '-') { + number += c; + next(); + } + + if (!isDigitDot(c)) { + // a + or - must be followed by a digit + revert(oldIndex); + return null; + } + + // get number, can have a single dot + if (c == '.') { + number += c; + next(); + if (!isDigit(c)) { + // this is no legal number, it is just a dot + revert(oldIndex); + return null; + } + } + else { + while (isDigit(c)) { + number += c; + next(); + } + if (c == '.') { + number += c; + next(); + } + } + while (isDigit(c)) { + number += c; + next(); + } + + // check for exponential notation like "2.3e-4" or "1.23e50" + if (c == 'E' || c == 'e') { + number += c; + next(); + + if (c == '+' || c == '-') { + number += c; + next(); + } + + // Scientific notation MUST be followed by an exponent + if (!isDigit(c)) { + // this is no legal number, exponent is missing. + revert(oldIndex); + return null; + } + + while (isDigit(c)) { + number += c; + next(); + } + } + + return number; + } + + function parseComplex () { + // check for 'i', '-i', '+i' + var cnext = text.charAt(index + 1); + if (c == 'I' || c == 'i') { + next(); + return '1'; + } + else if ((c == '+' || c == '-') && (cnext == 'I' || cnext == 'i')) { + var number = (c == '+') ? '1' : '-1'; + next(); + next(); + return number; + } + + return null; + } + + /** + * Parse a complex number from a string. For example Complex.parse("2 + 3i") + * will return a Complex value where re = 2, im = 3. + * Returns null if provided string does not contain a valid complex number. + * @param {String} str + * @returns {Complex | null} complex + */ + Complex.parse = function (str) { + text = str; + index = -1; + c = ''; + + if (!isString(text)) { + return null; + } + + next(); + skipWhitespace(); + var first = parseNumber(); + if (first) { + if (c == 'I' || c == 'i') { + // pure imaginary number + next(); + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + return new Complex(0, Number(first)); + } + else { + // complex and real part + skipWhitespace(); + var separator = c; + if (separator != '+' && separator != '-') { + // pure real number + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + return new Complex(Number(first), 0); + } + else { + // complex and real part + next(); + skipWhitespace(); + var second = parseNumber(); + if (second) { + if (c != 'I' && c != 'i') { + // 'i' missing at the end of the complex number + return null; + } + next(); + } + else { + second = parseComplex(); + if (!second) { + // imaginary number missing after separator + return null; + } + } + + if (separator == '-') { + if (second[0] == '-') { + second = '+' + second.substring(1); + } + else { + second = '-' + second; + } + } + + next(); + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + return new Complex(Number(first), Number(second)); + } + } + } + else { + // check for 'i', '-i', '+i' + first = parseComplex(); + if (first) { + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + return new Complex(0, Number(first)); + } + } + + return null; + }; + + /** + * Create a complex number from polar coordinates + * + * Usage: + * + * Complex.fromPolar(r: Number, phi: Number) : Complex + * Complex.fromPolar({r: Number, phi: Number}) : Complex + * + * @param {*} args... + * @return {Complex} + */ + Complex.fromPolar = function (args) { + switch (arguments.length) { + case 1: + var arg = arguments[0]; + if(typeof arg === 'object') { + return Complex.fromPolar(arg.r, arg.phi); + } + throw new TypeError('Input has to be an object with r and phi keys.'); + + case 2: + var r = arguments[0], + phi = arguments[1]; + if(isNumber(r)) { + if (isUnit(phi) && phi.hasBase(Unit.BASE_UNITS.ANGLE)) { + // convert unit to a number in radians + phi = phi.toNumber('rad'); + } + + if(isNumber(phi)) { + return new Complex(r * Math.cos(phi), r * Math.sin(phi)); + } + + throw new TypeError('Phi is not a number nor an angle unit.'); + } else { + throw new TypeError('Radius r is not a number.'); + } + + default: + throw new SyntaxError('Wrong number of arguments in function fromPolar'); + } + }; + + /* + * Return the value of the complex number in polar notation + * The angle phi will be set in the interval of [-pi, pi]. + * @return {{r: number, phi: number}} Returns and object with properties r and phi. + */ + Complex.prototype.toPolar = function() { + return { + r: Math.sqrt(this.re * this.re + this.im * this.im), + phi: Math.atan2(this.im, this.re) + }; + }; + + /** + * Create a copy of the complex value + * @return {Complex} clone + */ + Complex.prototype.clone = function () { + return new Complex(this.re, this.im); + }; + + /** + * Test whether this complex number equals an other complex value. + * Two complex numbers are equal when both their real and imaginary parts + * are equal. + * @param {Complex} other + * @return {boolean} isEqual + */ + Complex.prototype.equals = function (other) { + return (this.re === other.re) && (this.im === other.im); + }; + + /** + * Get a string representation of the complex number, + * with optional formatting options. + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @return {String} str + */ + Complex.prototype.format = function (options) { + var str = ''; + var im = this.im; + var re = this.re; + var strRe = number.format(this.re, options); + var strIm = number.format(this.im, options); + + // round either re or im when smaller than the configured precision + var precision = isNumber(options) ? options : options ? options.precision : null; + if (precision !== null) { + var epsilon = Math.pow(10, -precision); + if (Math.abs(re / im) < epsilon) {re = 0;} + if (Math.abs(im / re) < epsilon) {im = 0;} + } + + if (im == 0) { + // real value + str = strRe; + } + else if (re == 0) { + // purely complex value + if (im == 1) { + str = 'i'; + } + else if (im == -1) { + str = '-i'; + } + else { + str = strIm + 'i'; + } + } + else { + // complex value + if (im > 0) { + if (im == 1) { + str = strRe + ' + i'; + } + else { + str = strRe + ' + ' + strIm + 'i'; + } + } + else { + if (im == -1) { + str = strRe + ' - i'; + } + else { + str = strRe + ' - ' + strIm.substring(1) + 'i'; + } + } + } + + return str; + }; + + /** + * Get a string representation of the complex number. + * @return {String} str + */ + Complex.prototype.toString = function () { + return this.format(); + }; + + /** + * Get a JSON representation of the complex number + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "Complex", "re": 2, "im": 3}` + */ + Complex.prototype.toJSON = function () { + return { + mathjs: 'Complex', + re: this.re, + im: this.im + }; + }; + + /** + * Create a Complex number from a JSON object + * @param {Object} json A JSON Object structured as + * {"mathjs": "Complex", "re": 2, "im": 3} + * All properties are optional, default values + * for `re` and `im` are 0. + * @return {Complex} Returns a new Complex number + */ + Complex.fromJSON = function (json) { + return new Complex(json); + }; + + /** + * Returns a string representation of the complex number. + * @return {String} str + */ + Complex.prototype.valueOf = Complex.prototype.toString; + + // exports + module.exports = Complex; /***/ }, /* 4 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164), - Unit = __webpack_require__(8), - number = util.number, - - isNumber = util.number.isNumber, - isUnit = Unit.isUnit, - isString = util.string.isString; - - /** - * @constructor Complex - * - * A complex value can be constructed in the following ways: - * var a = new Complex(); - * var b = new Complex(re, im); - * var c = Complex.parse(str); - * - * Example usage: - * var a = new Complex(3, -4); // 3 - 4i - * a.re = 5; // a = 5 - 4i - * var i = a.im; // -4; - * var b = Complex.parse('2 + 6i'); // 2 + 6i - * var c = new Complex(); // 0 + 0i - * var d = math.add(a, b); // 5 + 2i - * - * @param {Number} re The real part of the complex value - * @param {Number} [im] The imaginary part of the complex value - */ - function Complex(re, im) { - if (!(this instanceof Complex)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - switch (arguments.length) { - case 0: - this.re = 0; - this.im = 0; - break; - - case 1: - var arg = arguments[0]; - if (typeof arg === 'object') { - if('re' in arg && 'im' in arg) { - var construct = new Complex(arg.re, arg.im); // pass on input validation - this.re = construct.re; - this.im = construct.im; - break; - } else if ('r' in arg && 'phi' in arg) { - var construct = Complex.fromPolar(arg.r, arg.phi); - this.re = construct.re; - this.im = construct.im; - break; - } - } - throw new SyntaxError('Object with the re and im or r and phi properties expected.'); - - case 2: - if (!isNumber(re) || !isNumber(im)) { - throw new TypeError('Two numbers expected in Complex constructor'); - } - this.re = re; - this.im = im; - break; - - default: - throw new SyntaxError('One, two or three arguments expected in Complex constructor'); - } - } - - /** - * Test whether value is a Complex value - * @param {*} value - * @return {Boolean} isComplex - */ - Complex.isComplex = function (value) { - return (value instanceof Complex); - }; - - // private variables and functions for the parser - var text, index, c; - - function skipWhitespace() { - while (c == ' ' || c == '\t') { - next(); - } - } - - function isDigitDot (c) { - return ((c >= '0' && c <= '9') || c == '.'); - } - - function isDigit (c) { - return ((c >= '0' && c <= '9')); - } - - function next() { - index++; - c = text.charAt(index); - } - - function revert(oldIndex) { - index = oldIndex; - c = text.charAt(index); - } - - function parseNumber () { - var number = ''; - var oldIndex; - oldIndex = index; - - if (c == '+') { - next(); - } - else if (c == '-') { - number += c; - next(); - } - - if (!isDigitDot(c)) { - // a + or - must be followed by a digit - revert(oldIndex); - return null; - } - - // get number, can have a single dot - if (c == '.') { - number += c; - next(); - if (!isDigit(c)) { - // this is no legal number, it is just a dot - revert(oldIndex); - return null; - } - } - else { - while (isDigit(c)) { - number += c; - next(); - } - if (c == '.') { - number += c; - next(); - } - } - while (isDigit(c)) { - number += c; - next(); - } - - // check for exponential notation like "2.3e-4" or "1.23e50" - if (c == 'E' || c == 'e') { - number += c; - next(); - - if (c == '+' || c == '-') { - number += c; - next(); - } - - // Scientific notation MUST be followed by an exponent - if (!isDigit(c)) { - // this is no legal number, exponent is missing. - revert(oldIndex); - return null; - } - - while (isDigit(c)) { - number += c; - next(); - } - } - - return number; - } - - function parseComplex () { - // check for 'i', '-i', '+i' - var cnext = text.charAt(index + 1); - if (c == 'I' || c == 'i') { - next(); - return '1'; - } - else if ((c == '+' || c == '-') && (cnext == 'I' || cnext == 'i')) { - var number = (c == '+') ? '1' : '-1'; - next(); - next(); - return number; - } - - return null; - } - - /** - * Parse a complex number from a string. For example Complex.parse("2 + 3i") - * will return a Complex value where re = 2, im = 3. - * Returns null if provided string does not contain a valid complex number. - * @param {String} str - * @returns {Complex | null} complex - */ - Complex.parse = function (str) { - text = str; - index = -1; - c = ''; - - if (!isString(text)) { - return null; - } - - next(); - skipWhitespace(); - var first = parseNumber(); - if (first) { - if (c == 'I' || c == 'i') { - // pure imaginary number - next(); - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - return new Complex(0, Number(first)); - } - else { - // complex and real part - skipWhitespace(); - var separator = c; - if (separator != '+' && separator != '-') { - // pure real number - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - return new Complex(Number(first), 0); - } - else { - // complex and real part - next(); - skipWhitespace(); - var second = parseNumber(); - if (second) { - if (c != 'I' && c != 'i') { - // 'i' missing at the end of the complex number - return null; - } - next(); - } - else { - second = parseComplex(); - if (!second) { - // imaginary number missing after separator - return null; - } - } - - if (separator == '-') { - if (second[0] == '-') { - second = '+' + second.substring(1); - } - else { - second = '-' + second; - } - } - - next(); - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - return new Complex(Number(first), Number(second)); - } - } - } - else { - // check for 'i', '-i', '+i' - first = parseComplex(); - if (first) { - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - return new Complex(0, Number(first)); - } - } - - return null; - }; - - /** - * Create a complex number from polar coordinates - * - * Usage: - * - * Complex.fromPolar(r: Number, phi: Number) : Complex - * Complex.fromPolar({r: Number, phi: Number}) : Complex - * - * @param {*} args... - * @return {Complex} - */ - Complex.fromPolar = function (args) { - switch (arguments.length) { - case 1: - var arg = arguments[0]; - if(typeof arg === 'object') { - return Complex.fromPolar(arg.r, arg.phi); - } - throw new TypeError('Input has to be an object with r and phi keys.'); - - case 2: - var r = arguments[0], - phi = arguments[1]; - if(isNumber(r)) { - if (isUnit(phi) && phi.hasBase(Unit.BASE_UNITS.ANGLE)) { - // convert unit to a number in radians - phi = phi.toNumber('rad'); - } - - if(isNumber(phi)) { - return new Complex(r * Math.cos(phi), r * Math.sin(phi)); - } - - throw new TypeError('Phi is not a number nor an angle unit.'); - } else { - throw new TypeError('Radius r is not a number.'); - } - - default: - throw new SyntaxError('Wrong number of arguments in function fromPolar'); - } - }; - - /* - * Return the value of the complex number in polar notation - * The angle phi will be set in the interval of [-pi, pi]. - * @return {{r: number, phi: number}} Returns and object with properties r and phi. - */ - Complex.prototype.toPolar = function() { - return { - r: Math.sqrt(this.re * this.re + this.im * this.im), - phi: Math.atan2(this.im, this.re) - }; - }; - - /** - * Create a copy of the complex value - * @return {Complex} clone - */ - Complex.prototype.clone = function () { - return new Complex(this.re, this.im); - }; - - /** - * Test whether this complex number equals an other complex value. - * Two complex numbers are equal when both their real and imaginary parts - * are equal. - * @param {Complex} other - * @return {boolean} isEqual - */ - Complex.prototype.equals = function (other) { - return (this.re === other.re) && (this.im === other.im); - }; - - /** - * Get a string representation of the complex number, - * with optional formatting options. - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @return {String} str - */ - Complex.prototype.format = function (options) { - var str = ''; - var im = this.im; - var re = this.re; - var strRe = number.format(this.re, options); - var strIm = number.format(this.im, options); - - // round either re or im when smaller than the configured precision - var precision = isNumber(options) ? options : options ? options.precision : null; - if (precision !== null) { - var epsilon = Math.pow(10, -precision); - if (Math.abs(re / im) < epsilon) {re = 0;} - if (Math.abs(im / re) < epsilon) {im = 0;} - } - - if (im == 0) { - // real value - str = strRe; - } - else if (re == 0) { - // purely complex value - if (im == 1) { - str = 'i'; - } - else if (im == -1) { - str = '-i'; - } - else { - str = strIm + 'i'; - } - } - else { - // complex value - if (im > 0) { - if (im == 1) { - str = strRe + ' + i'; - } - else { - str = strRe + ' + ' + strIm + 'i'; - } - } - else { - if (im == -1) { - str = strRe + ' - i'; - } - else { - str = strRe + ' - ' + strIm.substring(1) + 'i'; - } - } - } - - return str; - }; - - /** - * Get a string representation of the complex number. - * @return {String} str - */ - Complex.prototype.toString = function () { - return this.format(); - }; - - /** - * Get a JSON representation of the complex number - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "Complex", "re": 2, "im": 3}` - */ - Complex.prototype.toJSON = function () { - return { - mathjs: 'Complex', - re: this.re, - im: this.im - }; - }; - - /** - * Create a Complex number from a JSON object - * @param {Object} json A JSON Object structured as - * {"mathjs": "Complex", "re": 2, "im": 3} - * All properties are optional, default values - * for `re` and `im` are 0. - * @return {Complex} Returns a new Complex number - */ - Complex.fromJSON = function (json) { - return new Complex(json); - }; - - /** - * Returns a string representation of the complex number. - * @return {String} str - */ - Complex.prototype.valueOf = Complex.prototype.toString; - - // exports - module.exports = Complex; + 'use strict'; + + var util = __webpack_require__(171); + + var number = util.number; + var string = util.string; + var array = util.array; + + /** + * @constructor Range + * Create a range. A range has a start, step, and end, and contains functions + * to iterate over the range. + * + * A range can be constructed as: + * var range = new Range(start, end); + * var range = new Range(start, end, step); + * + * To get the result of the range: + * range.forEach(function (x) { + * console.log(x); + * }); + * range.map(function (x) { + * return math.sin(x); + * }); + * range.toArray(); + * + * Example usage: + * var c = new Range(2, 6); // 2:1:5 + * c.toArray(); // [2, 3, 4, 5] + * var d = new Range(2, -3, -1); // 2:-1:-2 + * d.toArray(); // [2, 1, 0, -1, -2] + * + * @param {Number} start included lower bound + * @param {Number} end excluded upper bound + * @param {Number} [step] step size, default value is 1 + */ + function Range(start, end, step) { + if (!(this instanceof Range)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + if (start != null && !number.isNumber(start)) { + throw new TypeError('Parameter start must be a number'); + } + if (end != null && !number.isNumber(end)) { + throw new TypeError('Parameter end must be a number'); + } + if (step != null && !number.isNumber(step)) { + throw new TypeError('Parameter step must be a number'); + } + + this.start = (start != null) ? parseFloat(start) : 0; + this.end = (end != null) ? parseFloat(end) : 0; + this.step = (step != null) ? parseFloat(step) : 1; + } + + /** + * Parse a string into a range, + * The string contains the start, optional step, and end, separated by a colon. + * If the string does not contain a valid range, null is returned. + * For example str='0:2:11'. + * @param {String} str + * @return {Range | null} range + */ + Range.parse = function (str) { + if (!string.isString(str)) { + return null; + } + + var args = str.split(':'); + var nums = args.map(function (arg) { + return parseFloat(arg); + }); + + var invalid = nums.some(function (num) { + return isNaN(num); + }); + if(invalid) { + return null; + } + + switch (nums.length) { + case 2: return new Range(nums[0], nums[1]); + case 3: return new Range(nums[0], nums[2], nums[1]); + default: return null; + } + }; + + /** + * Create a clone of the range + * @return {Range} clone + */ + Range.prototype.clone = function () { + return new Range(this.start, this.end, this.step); + }; + + /** + * Test whether an object is a Range + * @param {*} object + * @return {Boolean} isRange + */ + Range.isRange = function (object) { + return (object instanceof Range); + }; + + /** + * Retrieve the size of the range. + * Returns an array containing one number, the number of elements in the range. + * @returns {Number[]} size + */ + Range.prototype.size = function () { + var len = 0, + start = this.start, + step = this.step, + end = this.end, + diff = end - start; + + if (number.sign(step) == number.sign(diff)) { + len = Math.ceil((diff) / step); + } + else if (diff == 0) { + len = 0; + } + + if (isNaN(len)) { + len = 0; + } + return [len]; + }; + + /** + * Calculate the minimum value in the range + * @return {Number | undefined} min + */ + Range.prototype.min = function () { + var size = this.size()[0]; + + if (size > 0) { + if (this.step > 0) { + // positive step + return this.start; + } + else { + // negative step + return this.start + (size - 1) * this.step; + } + } + else { + return undefined; + } + }; + + /** + * Calculate the maximum value in the range + * @return {Number | undefined} max + */ + Range.prototype.max = function () { + var size = this.size()[0]; + + if (size > 0) { + if (this.step > 0) { + // positive step + return this.start + (size - 1) * this.step; + } + else { + // negative step + return this.start; + } + } + else { + return undefined; + } + }; + + + /** + * Execute a callback function for each value in the range. + * @param {function} callback The callback method is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + */ + Range.prototype.forEach = function (callback) { + var x = this.start; + var step = this.step; + var end = this.end; + var i = 0; + + if (step > 0) { + while (x < end) { + callback(x, i, this); + x += step; + i++; + } + } + else if (step < 0) { + while (x > end) { + callback(x, i, this); + x += step; + i++; + } + } + }; + + /** + * Execute a callback function for each value in the Range, and return the + * results as an array + * @param {function} callback The callback method is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + * @returns {Array} array + */ + Range.prototype.map = function (callback) { + var array = []; + this.forEach(function (value, index, obj) { + array[index] = callback(value, index, obj); + }); + return array; + }; + + /** + * Create an Array with a copy of the Ranges data + * @returns {Array} array + */ + Range.prototype.toArray = function () { + var array = []; + this.forEach(function (value, index) { + array[index] = value; + }); + return array; + }; + + /** + * Get the primitive value of the Range, a one dimensional array + * @returns {Array} array + */ + Range.prototype.valueOf = function () { + // TODO: implement a caching mechanism for range.valueOf() + return this.toArray(); + }; + + /** + * Get a string representation of the range, with optional formatting options. + * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11' + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @returns {String} str + */ + Range.prototype.format = function (options) { + var str = number.format(this.start, options); + + if (this.step != 1) { + str += ':' + number.format(this.step, options); + } + str += ':' + number.format(this.end, options); + return str; + }; + + /** + * Get a string representation of the range. + * @returns {String} + */ + Range.prototype.toString = function () { + return this.format(); + }; + + /** + * Get a JSON representation of the range + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}` + */ + Range.prototype.toJSON = function () { + return { + mathjs: 'Range', + start: this.start, + end: this.end, + step: this.step + }; + }; + + /** + * Instantiate a Range from a JSON object + * @param {Object} json A JSON object structured as: + * `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}` + * @return {Range} + */ + Range.fromJSON = function (json) { + return new Range(json.start, json.end, json.step); + }; + + // exports + module.exports = Range; /***/ }, /* 5 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164); - - var number = util.number; - var string = util.string; - var array = util.array; - - /** - * @constructor Range - * Create a range. A range has a start, step, and end, and contains functions - * to iterate over the range. - * - * A range can be constructed as: - * var range = new Range(start, end); - * var range = new Range(start, end, step); - * - * To get the result of the range: - * range.forEach(function (x) { - * console.log(x); - * }); - * range.map(function (x) { - * return math.sin(x); - * }); - * range.toArray(); - * - * Example usage: - * var c = new Range(2, 6); // 2:1:5 - * c.toArray(); // [2, 3, 4, 5] - * var d = new Range(2, -3, -1); // 2:-1:-2 - * d.toArray(); // [2, 1, 0, -1, -2] - * - * @param {Number} start included lower bound - * @param {Number} end excluded upper bound - * @param {Number} [step] step size, default value is 1 - */ - function Range(start, end, step) { - if (!(this instanceof Range)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (start != null && !number.isNumber(start)) { - throw new TypeError('Parameter start must be a number'); - } - if (end != null && !number.isNumber(end)) { - throw new TypeError('Parameter end must be a number'); - } - if (step != null && !number.isNumber(step)) { - throw new TypeError('Parameter step must be a number'); - } - - this.start = (start != null) ? parseFloat(start) : 0; - this.end = (end != null) ? parseFloat(end) : 0; - this.step = (step != null) ? parseFloat(step) : 1; - } - - /** - * Parse a string into a range, - * The string contains the start, optional step, and end, separated by a colon. - * If the string does not contain a valid range, null is returned. - * For example str='0:2:11'. - * @param {String} str - * @return {Range | null} range - */ - Range.parse = function (str) { - if (!string.isString(str)) { - return null; - } - - var args = str.split(':'); - var nums = args.map(function (arg) { - return parseFloat(arg); - }); - - var invalid = nums.some(function (num) { - return isNaN(num); - }); - if(invalid) { - return null; - } - - switch (nums.length) { - case 2: return new Range(nums[0], nums[1]); - case 3: return new Range(nums[0], nums[2], nums[1]); - default: return null; - } - }; - - /** - * Create a clone of the range - * @return {Range} clone - */ - Range.prototype.clone = function () { - return new Range(this.start, this.end, this.step); - }; - - /** - * Test whether an object is a Range - * @param {*} object - * @return {Boolean} isRange - */ - Range.isRange = function (object) { - return (object instanceof Range); - }; - - /** - * Retrieve the size of the range. - * Returns an array containing one number, the number of elements in the range. - * @returns {Number[]} size - */ - Range.prototype.size = function () { - var len = 0, - start = this.start, - step = this.step, - end = this.end, - diff = end - start; - - if (number.sign(step) == number.sign(diff)) { - len = Math.ceil((diff) / step); - } - else if (diff == 0) { - len = 0; - } - - if (isNaN(len)) { - len = 0; - } - return [len]; - }; - - /** - * Calculate the minimum value in the range - * @return {Number | undefined} min - */ - Range.prototype.min = function () { - var size = this.size()[0]; - - if (size > 0) { - if (this.step > 0) { - // positive step - return this.start; - } - else { - // negative step - return this.start + (size - 1) * this.step; - } - } - else { - return undefined; - } - }; - - /** - * Calculate the maximum value in the range - * @return {Number | undefined} max - */ - Range.prototype.max = function () { - var size = this.size()[0]; - - if (size > 0) { - if (this.step > 0) { - // positive step - return this.start + (size - 1) * this.step; - } - else { - // negative step - return this.start; - } - } - else { - return undefined; - } - }; - - - /** - * Execute a callback function for each value in the range. - * @param {function} callback The callback method is invoked with three - * parameters: the value of the element, the index - * of the element, and the Matrix being traversed. - */ - Range.prototype.forEach = function (callback) { - var x = this.start; - var step = this.step; - var end = this.end; - var i = 0; - - if (step > 0) { - while (x < end) { - callback(x, i, this); - x += step; - i++; - } - } - else if (step < 0) { - while (x > end) { - callback(x, i, this); - x += step; - i++; - } - } - }; - - /** - * Execute a callback function for each value in the Range, and return the - * results as an array - * @param {function} callback The callback method is invoked with three - * parameters: the value of the element, the index - * of the element, and the Matrix being traversed. - * @returns {Array} array - */ - Range.prototype.map = function (callback) { - var array = []; - this.forEach(function (value, index, obj) { - array[index] = callback(value, index, obj); - }); - return array; - }; - - /** - * Create an Array with a copy of the Ranges data - * @returns {Array} array - */ - Range.prototype.toArray = function () { - var array = []; - this.forEach(function (value, index) { - array[index] = value; - }); - return array; - }; - - /** - * Get the primitive value of the Range, a one dimensional array - * @returns {Array} array - */ - Range.prototype.valueOf = function () { - // TODO: implement a caching mechanism for range.valueOf() - return this.toArray(); - }; - - /** - * Get a string representation of the range, with optional formatting options. - * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11' - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @returns {String} str - */ - Range.prototype.format = function (options) { - var str = number.format(this.start, options); - - if (this.step != 1) { - str += ':' + number.format(this.step, options); - } - str += ':' + number.format(this.end, options); - return str; - }; - - /** - * Get a string representation of the range. - * @returns {String} - */ - Range.prototype.toString = function () { - return this.format(); - }; - - /** - * Get a JSON representation of the range - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}` - */ - Range.prototype.toJSON = function () { - return { - mathjs: 'Range', - start: this.start, - end: this.end, - step: this.step - }; - }; - - /** - * Instantiate a Range from a JSON object - * @param {Object} json A JSON object structured as: - * `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}` - * @return {Range} - */ - Range.fromJSON = function (json) { - return new Range(json.start, json.end, json.step); - }; - - // exports - module.exports = Range; + 'use strict'; + + var util = __webpack_require__(171), + + Range = __webpack_require__(4), + + number = util.number, + + isNumber = number.isNumber, + isInteger = number.isInteger, + isArray = Array.isArray; + + /** + * @Constructor Index + * Create an index. An Index can store ranges having start, step, and end + * for multiple dimensions. + * Matrix.get, Matrix.set, and math.subset accept an Index as input. + * + * Usage: + * var index = new Index(range1, range2, ...); + * + * Where each range can be any of: + * An array [start, end] + * An array [start, end, step] + * A number + * An instance of Range + * + * The parameters start, end, and step must be integer numbers. + * + * @param {...*} ranges + */ + function Index(ranges) { + if (!(this instanceof Index)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this._ranges = []; + this._isScalar = true; + + for (var i = 0, ii = arguments.length; i < ii; i++) { + var arg = arguments[i]; + + if (arg instanceof Range) { + this._ranges.push(arg); + this._isScalar = false; + } + else if (isArray(arg)) { + this._ranges.push(_createRange(arg)); + this._isScalar = false; + } + else if (isNumber(arg)) { + this._ranges.push(_createRange([arg, arg + 1])); + } + // TODO: implement support for wildcard '*' + else { + var primitive = arg.valueOf(); // for example turn a Matrix into an Array + if (isArray(primitive)) { + this._ranges.push(_createRange(primitive)); + this._isScalar = false; + } + else { + throw new TypeError('Ranges must be an Array, Number, or Range'); + } + } + } + } + + /** + * Parse an argument into a range and validate the range + * @param {Array} arg An array with [start: Number, end: Number] and + * optional a third element step:Number + * @return {Range} range + * @private + */ + function _createRange(arg) { + // TODO: make function _createRange simpler/faster + + // test whether all arguments are integers + var num = arg.length; + for (var i = 0; i < num; i++) { + if (!isNumber(arg[i]) || !isInteger(arg[i])) { + throw new TypeError('Index parameters must be integer numbers'); + } + } + + switch (arg.length) { + case 2: + return new Range(arg[0], arg[1]); // start, end + case 3: + return new Range(arg[0], arg[1], arg[2]); // start, end, step + default: + // TODO: improve error message + throw new SyntaxError('Wrong number of arguments in Index (2 or 3 expected)'); + } + } + + /** + * Create a clone of the index + * @return {Index} clone + */ + Index.prototype.clone = function () { + var index = new Index(); + index._ranges = util.object.clone(this._ranges); + index._isScalar = this._isScalar; + return index; + }; + + /** + * Test whether an object is an Index + * @param {*} object + * @return {Boolean} isIndex + */ + Index.isIndex = function (object) { + return (object instanceof Index); + }; + + /** + * Create an index from an array with ranges/numbers + * @param {Array.} ranges + * @return {Index} index + * @private + */ + Index.create = function (ranges) { + var index = new Index(); + Index.apply(index, ranges); + return index; + }; + + /** + * Retrieve the size of the index, the number of elements for each dimension. + * @returns {Number[]} size + */ + Index.prototype.size = function () { + var size = []; + + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + var range = this._ranges[i]; + + size[i] = range.size()[0]; + } + + return size; + }; + + /** + * Get the maximum value for each of the indexes ranges. + * @returns {Number[]} max + */ + Index.prototype.max = function () { + var values = []; + + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + var range = this._ranges[i]; + values[i] = range.max(); + } + + return values; + }; + + /** + * Get the minimum value for each of the indexes ranges. + * @returns {Number[]} min + */ + Index.prototype.min = function () { + var values = []; + + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + var range = this._ranges[i]; + + values[i] = range.min(); + } + + return values; + }; + + /** + * Loop over each of the ranges of the index + * @param {function} callback Called for each range with a Range as first + * argument, the dimension as second, and the + * index object as third. + */ + Index.prototype.forEach = function (callback) { + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + callback(this._ranges[i], i, this); + } + }; + + /** + * Retrieve the range for a given dimension number from the index + * @param {Number} dim Number of the dimension + * @returns {Range | null} range + */ + Index.prototype.range = function(dim) { + return this._ranges[dim] || null; + }; + + /** + * Test whether this index contains only a single value. + * + * This is the case when the index is created with only scalar values as ranges, + * not for ranges resolving into a single value. + * @return {boolean} isScalar + */ + Index.prototype.isScalar = function () { + return this._isScalar; + }; + + /** + * Expand the Index into an array. + * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]] + * @returns {Array} array + */ + Index.prototype.toArray = function () { + var array = []; + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + var range = this._ranges[i], + row = [], + x = range.start, + end = range.end, + step = range.step; + + if (step > 0) { + while (x < end) { + row.push(x); + x += step; + } + } + else if (step < 0) { + while (x > end) { + row.push(x); + x += step; + } + } + + array.push(row); + } + + return array; + }; + + /** + * Get the primitive value of the Index, a two dimensional array. + * Equivalent to Index.toArray(). + * @returns {Array} array + */ + Index.prototype.valueOf = Index.prototype.toArray; + + /** + * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7]' + * @returns {String} str + */ + Index.prototype.toString = function () { + var strings = []; + + for (var i = 0, ii = this._ranges.length; i < ii; i++) { + var range = this._ranges[i]; + var str = number.format(range.start); + if (range.step != 1) { + str += ':' + number.format(range.step); + } + str += ':' + number.format(range.end); + strings.push(str); + } + + return '[' + strings.join(', ') + ']'; + }; + + /** + * Get a JSON representation of the Index + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}` + */ + Index.prototype.toJSON = function () { + return { + mathjs: 'Index', + ranges: this._ranges + }; + }; + + /** + * Instantiate an Index from a JSON object + * @param {Object} json A JSON object structured as: + * `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}` + * @return {Index} + */ + Index.fromJSON = function (json) { + return Index.create(json.ranges); + }; + + // exports + module.exports = Index; /***/ }, /* 6 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164), - - Range = __webpack_require__(5), - - number = util.number, - - isNumber = number.isNumber, - isInteger = number.isInteger, - isArray = Array.isArray; - - /** - * @Constructor Index - * Create an index. An Index can store ranges having start, step, and end - * for multiple dimensions. - * Matrix.get, Matrix.set, and math.subset accept an Index as input. - * - * Usage: - * var index = new Index(range1, range2, ...); - * - * Where each range can be any of: - * An array [start, end] - * An array [start, end, step] - * A number - * An instance of Range - * - * The parameters start, end, and step must be integer numbers. - * - * @param {...*} ranges - */ - function Index(ranges) { - if (!(this instanceof Index)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this._ranges = []; - this._isScalar = true; - - for (var i = 0, ii = arguments.length; i < ii; i++) { - var arg = arguments[i]; - - if (arg instanceof Range) { - this._ranges.push(arg); - this._isScalar = false; - } - else if (isArray(arg)) { - this._ranges.push(_createRange(arg)); - this._isScalar = false; - } - else if (isNumber(arg)) { - this._ranges.push(_createRange([arg, arg + 1])); - } - // TODO: implement support for wildcard '*' - else { - var primitive = arg.valueOf(); // for example turn a Matrix into an Array - if (isArray(primitive)) { - this._ranges.push(_createRange(primitive)); - this._isScalar = false; - } - else { - throw new TypeError('Ranges must be an Array, Number, or Range'); - } - } - } - } - - /** - * Parse an argument into a range and validate the range - * @param {Array} arg An array with [start: Number, end: Number] and - * optional a third element step:Number - * @return {Range} range - * @private - */ - function _createRange(arg) { - // TODO: make function _createRange simpler/faster - - // test whether all arguments are integers - var num = arg.length; - for (var i = 0; i < num; i++) { - if (!isNumber(arg[i]) || !isInteger(arg[i])) { - throw new TypeError('Index parameters must be integer numbers'); - } - } - - switch (arg.length) { - case 2: - return new Range(arg[0], arg[1]); // start, end - case 3: - return new Range(arg[0], arg[1], arg[2]); // start, end, step - default: - // TODO: improve error message - throw new SyntaxError('Wrong number of arguments in Index (2 or 3 expected)'); - } - } - - /** - * Create a clone of the index - * @return {Index} clone - */ - Index.prototype.clone = function () { - var index = new Index(); - index._ranges = util.object.clone(this._ranges); - index._isScalar = this._isScalar; - return index; - }; - - /** - * Test whether an object is an Index - * @param {*} object - * @return {Boolean} isIndex - */ - Index.isIndex = function (object) { - return (object instanceof Index); - }; - - /** - * Create an index from an array with ranges/numbers - * @param {Array.} ranges - * @return {Index} index - * @private - */ - Index.create = function (ranges) { - var index = new Index(); - Index.apply(index, ranges); - return index; - }; - - /** - * Retrieve the size of the index, the number of elements for each dimension. - * @returns {Number[]} size - */ - Index.prototype.size = function () { - var size = []; - - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - var range = this._ranges[i]; - - size[i] = range.size()[0]; - } - - return size; - }; - - /** - * Get the maximum value for each of the indexes ranges. - * @returns {Number[]} max - */ - Index.prototype.max = function () { - var values = []; - - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - var range = this._ranges[i]; - values[i] = range.max(); - } - - return values; - }; - - /** - * Get the minimum value for each of the indexes ranges. - * @returns {Number[]} min - */ - Index.prototype.min = function () { - var values = []; - - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - var range = this._ranges[i]; - - values[i] = range.min(); - } - - return values; - }; - - /** - * Loop over each of the ranges of the index - * @param {function} callback Called for each range with a Range as first - * argument, the dimension as second, and the - * index object as third. - */ - Index.prototype.forEach = function (callback) { - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - callback(this._ranges[i], i, this); - } - }; - - /** - * Retrieve the range for a given dimension number from the index - * @param {Number} dim Number of the dimension - * @returns {Range | null} range - */ - Index.prototype.range = function(dim) { - return this._ranges[dim] || null; - }; - - /** - * Test whether this index contains only a single value. - * - * This is the case when the index is created with only scalar values as ranges, - * not for ranges resolving into a single value. - * @return {boolean} isScalar - */ - Index.prototype.isScalar = function () { - return this._isScalar; - }; - - /** - * Expand the Index into an array. - * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]] - * @returns {Array} array - */ - Index.prototype.toArray = function () { - var array = []; - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - var range = this._ranges[i], - row = [], - x = range.start, - end = range.end, - step = range.step; - - if (step > 0) { - while (x < end) { - row.push(x); - x += step; - } - } - else if (step < 0) { - while (x > end) { - row.push(x); - x += step; - } - } - - array.push(row); - } - - return array; - }; - - /** - * Get the primitive value of the Index, a two dimensional array. - * Equivalent to Index.toArray(). - * @returns {Array} array - */ - Index.prototype.valueOf = Index.prototype.toArray; - - /** - * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7]' - * @returns {String} str - */ - Index.prototype.toString = function () { - var strings = []; - - for (var i = 0, ii = this._ranges.length; i < ii; i++) { - var range = this._ranges[i]; - var str = number.format(range.start); - if (range.step != 1) { - str += ':' + number.format(range.step); - } - str += ':' + number.format(range.end); - strings.push(str); - } - - return '[' + strings.join(', ') + ']'; - }; - - /** - * Get a JSON representation of the Index - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}` - */ - Index.prototype.toJSON = function () { - return { - mathjs: 'Index', - ranges: this._ranges - }; - }; - - /** - * Instantiate an Index from a JSON object - * @param {Object} json A JSON object structured as: - * `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}` - * @return {Index} - */ - Index.fromJSON = function (json) { - return Index.create(json.ranges); - }; - - // exports - module.exports = Index; + 'use strict'; + + var util = __webpack_require__(171); + + var string = util.string; + + var isString = string.isString; + + function factory (type, config, load, typed) { + /** + * @constructor Matrix + * + * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional + * array. A matrix can be constructed as: + * var matrix = math.matrix(data) + * + * Matrix contains the functions to resize, get and set values, get the size, + * clone the matrix and to convert the matrix to a vector, array, or scalar. + * Furthermore, one can iterate over the matrix using map and forEach. + * The internal Array of the Matrix can be accessed using the function valueOf. + * + * Example usage: + * var matrix = math.matrix([[1, 2], [3, 4]]); + * matix.size(); // [2, 2] + * matrix.resize([3, 2], 5); + * matrix.valueOf(); // [[1, 2], [3, 4], [5, 5]] + * matrix.subset([1,2]) // 3 (indexes are zero-based) + * + */ + function Matrix() { + if (!(this instanceof Matrix)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + } + + /** + * Test whether an object is a Matrix + * @param {*} object + * @return {Boolean} isMatrix + */ + Matrix.isMatrix = function (object) { + return (object instanceof Matrix); + }; + + /** + * Get the Matrix storage constructor for the given format. + * + * @param {string} format The Matrix storage format. + * + * @return {Function} The Matrix storage constructor. + */ + Matrix.storage = function (format) { + // check storage format is a string + if (!isString(format)) { + throw new TypeError('format must be a string value'); + } + + // get storage format constructor + var constructor = Matrix._storage[format]; + if (!constructor) { + throw new SyntaxError('Unsupported matrix storage format: ' + format); + } + + // return storage constructor + return constructor; + }; + + // a map with all constructors for all storage types + Matrix._storage = {}; + + /** + * Get the storage format used by the matrix. + * + * Usage: + * var format = matrix.storage() // retrieve storage format + * + * @return {string} The storage format. + */ + Matrix.prototype.storage = function () { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke storage on a Matrix interface'); + }; + + /** + * Get a subset of the matrix, or replace a subset of the matrix. + * + * Usage: + * var subset = matrix.subset(index) // retrieve subset + * var value = matrix.subset(index, replacement) // replace subset + * + * @param {Index} index + * @param {Array | Matrix | *} [replacement] + * @param {*} [defaultValue=0] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be filled with zeros. + */ + Matrix.prototype.subset = function (index, replacement, defaultValue) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke subset on a Matrix interface'); + }; + + /** + * Get a single element from the matrix. + * @param {Number[]} index Zero-based index + * @return {*} value + */ + Matrix.prototype.get = function (index) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke get on a Matrix interface'); + }; + + /** + * Replace a single element in the matrix. + * @param {Number[]} index Zero-based index + * @param {*} value + * @param {*} [defaultValue] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be left undefined. + * @return {Matrix} self + */ + Matrix.prototype.set = function (index, value, defaultValue) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke set on a Matrix interface'); + }; + + /** + * Resize the matrix to the given size. Returns a copy of the matrix when + * `copy=true`, otherwise return the matrix itself (resize in place). + * + * @param {Number[]} size The new size the matrix should have. + * @param {*} [defaultValue=0] Default value, filled in on new entries. + * If not provided, the matrix elements will + * be filled with zeros. + * @param {boolean} [copy] Return a resized copy of the matrix + * + * @return {Matrix} The resized matrix + */ + Matrix.prototype.resize = function (size, defaultValue) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke resize on a Matrix interface'); + }; + + /** + * Create a clone of the matrix + * @return {Matrix} clone + */ + Matrix.prototype.clone = function () { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke clone on a Matrix interface'); + }; + + /** + * Retrieve the size of the matrix. + * @returns {Number[]} size + */ + Matrix.prototype.size = function() { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke size on a Matrix interface'); + }; + + /** + * Create a new matrix with the results of the callback function executed on + * each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + * @param {boolean} [skipZeros] Invoke callback function for non-zero values only. + * + * @return {Matrix} matrix + */ + Matrix.prototype.map = function (callback, skipZeros) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke map on a Matrix interface'); + }; + + /** + * Execute a callback function on each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + */ + Matrix.prototype.forEach = function (callback) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke forEach on a Matrix interface'); + }; + + /** + * Create an Array with a copy of the data of the Matrix + * @returns {Array} array + */ + Matrix.prototype.toArray = function () { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke toArray on a Matrix interface'); + }; + + /** + * Get the primitive value of the Matrix: a multidimensional array + * @returns {Array} array + */ + Matrix.prototype.valueOf = function () { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke valueOf on a Matrix interface'); + }; + + /** + * Get a string representation of the matrix, with optional formatting options. + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @returns {String} str + */ + Matrix.prototype.format = function (options) { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke format on a Matrix interface'); + }; + + /** + * Get a string representation of the matrix + * @returns {String} str + */ + Matrix.prototype.toString = function () { + // must be implemented by each of the Matrix implementations + throw new Error('Cannot invoke toString on a Matrix interface'); + }; + + // exports + return Matrix; + } + + exports.name = 'Matrix'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 7 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164); - var DimensionError = __webpack_require__(165); - - var Index = __webpack_require__(6); - - var number = util.number; - var string = util.string; - var array = util.array; - var object = util.object; - - var isArray = Array.isArray; - var validateIndex = array.validateIndex; - - /** - * @constructor Matrix - * - * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional - * array. A matrix can be constructed as: - * var matrix = new Matrix(data) - * - * Matrix contains the functions to resize, get and set values, get the size, - * clone the matrix and to convert the matrix to a vector, array, or scalar. - * Furthermore, one can iterate over the matrix using map and forEach. - * The internal Array of the Matrix can be accessed using the function valueOf. - * - * Example usage: - * var matrix = new Matrix([[1, 2], [3, 4]); - * matix.size(); // [2, 2] - * matrix.resize([3, 2], 5); - * matrix.valueOf(); // [[1, 2], [3, 4], [5, 5]] - * matrix.subset([1,2]) // 3 (indexes are zero-based) - * - * @param {Array | Matrix} [data] A multi dimensional array - */ - function Matrix(data) { - if (!(this instanceof Matrix)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (data instanceof Matrix) { - // clone data from a Matrix - this._data = data.clone()._data; - } - else if (isArray(data)) { - // use array - // replace nested Matrices with Arrays - this._data = preprocess(data); - } - else if (data != null) { - // unsupported type - throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')'); - } - else { - // nothing provided - this._data = []; - } - - // verify the size of the array - this._size = array.size(this._data); - } - - /** - * Test whether an object is a Matrix - * @param {*} object - * @return {Boolean} isMatrix - */ - Matrix.isMatrix = function (object) { - return (object instanceof Matrix); - }; - - /** - * Get a subset of the matrix, or replace a subset of the matrix. - * - * Usage: - * var subset = matrix.subset(index) // retrieve subset - * var value = matrix.subset(index, replacement) // replace subset - * - * @param {Index} index - * @param {Array | Matrix | *} [replacement] - * @param {*} [defaultValue=0] Default value, filled in on new entries when - * the matrix is resized. If not provided, - * new matrix elements will be filled with zeros. - */ - Matrix.prototype.subset = function (index, replacement, defaultValue) { - switch (arguments.length) { - case 1: - return _get(this, index); - - // intentional fall through - case 2: - case 3: - return _set(this, index, replacement, defaultValue); - - default: - throw new SyntaxError('Wrong number of arguments'); - } - }; - - /** - * Get a single element from the matrix. - * @param {Number[]} index Zero-based index - * @return {*} value - */ - Matrix.prototype.get = function (index) { - if (!isArray(index)) { - throw new TypeError('Array expected'); - } - if (index.length != this._size.length) { - throw new DimensionError(index.length, this._size.length); - } - - var data = this._data; - for (var i = 0, ii = index.length; i < ii; i++) { - var index_i = index[i]; - validateIndex(index_i, data.length); - data = data[index_i]; - } - - return object.clone(data); - }; - - /** - * Replace a single element in the matrix. - * @param {Number[]} index Zero-based index - * @param {*} value - * @param {*} [defaultValue] Default value, filled in on new entries when - * the matrix is resized. If not provided, - * new matrix elements will be left undefined. - * @return {Matrix} self - */ - Matrix.prototype.set = function (index, value, defaultValue) { - var i, ii; - - // validate input type and dimensions - if (!isArray(index)) { - throw new Error('Array expected'); - } - if (index.length < this._size.length) { - throw new DimensionError(index.length, this._size.length, '<'); - } - - // enlarge matrix when needed - var size = index.map(function (i) { - return i + 1; - }); - _fit(this, size, defaultValue); - - // traverse over the dimensions - var data = this._data; - for (i = 0, ii = index.length - 1; i < ii; i++) { - var index_i = index[i]; - validateIndex(index_i, data.length); - data = data[index_i]; - } - - // set new value - index_i = index[index.length - 1]; - validateIndex(index_i, data.length); - data[index_i] = value; - - return this; - }; - - /** - * Get a submatrix of this matrix - * @param {Matrix} matrix - * @param {Index} index Zero-based index - * @private - */ - function _get (matrix, index) { - if (!(index instanceof Index)) { - throw new TypeError('Invalid index'); - } - - var isScalar = index.isScalar(); - if (isScalar) { - // return a scalar - return matrix.get(index.min()); - } - else { - // validate dimensions - var size = index.size(); - if (size.length != matrix._size.length) { - throw new DimensionError(size.length, matrix._size.length); - } - - // validate if any of the ranges in the index is out of range - var min = index.min(); - var max = index.max(); - for (var i = 0, ii = matrix._size.length; i < ii; i++) { - validateIndex(min[i], matrix._size[i]); - validateIndex(max[i], matrix._size[i]); - } - - // retrieve submatrix - // TODO: more efficient when creating an empty matrix and setting _data and _size manually - return new Matrix(_getSubmatrix(matrix._data, index, size.length, 0)); - } - } - - /** - * Recursively get a submatrix of a multi dimensional matrix. - * Index is not checked for correct number or length of dimensions. - * @param {Array} data - * @param {Index} index - * @param {number} dims Total number of dimensions - * @param {number} dim Current dimension - * @return {Array} submatrix - * @private - */ - function _getSubmatrix (data, index, dims, dim) { - var last = (dim == dims - 1); - var range = index.range(dim); - - if (last) { - return range.map(function (i) { - return data[i]; - }); - } - else { - return range.map(function (i) { - var child = data[i]; - return _getSubmatrix(child, index, dims, dim + 1); - }); - } - } - - /** - * Replace a submatrix in this matrix - * Indexes are zero-based. - * @param {Matrix} matrix - * @param {Index} index - * @param {Matrix | Array | *} submatrix - * @param {*} defaultValue Default value, filled in on new entries when - * the matrix is resized. - * @return {Matrix} matrix - * @private - */ - function _set (matrix, index, submatrix, defaultValue) { - if (!(index instanceof Index)) { - throw new TypeError('Invalid index'); - } - - // get index size and check whether the index contains a single value - var iSize = index.size(), - isScalar = index.isScalar(); - - // calculate the size of the submatrix, and convert it into an Array if needed - var sSize; - if (submatrix instanceof Matrix) { - sSize = submatrix.size(); - submatrix = submatrix.valueOf(); - } - else { - sSize = array.size(submatrix); - } - - if (isScalar) { - // set a scalar - - // check whether submatrix is a scalar - if (sSize.length != 0) { - throw new TypeError('Scalar expected'); - } - - matrix.set(index.min(), submatrix, defaultValue); - } - else { - // set a submatrix - - // validate dimensions - if (iSize.length < matrix._size.length) { - throw new DimensionError(iSize.length, matrix._size.length, '<'); - } - - if (sSize.length < iSize.length) { - // calculate number of missing outer dimensions - var i = 0; - var outer = 0; - while (iSize[i] === 1 && sSize[i] === 1) { - i++; - } - while (iSize[i] === 1) { - outer++; - i++; - } - - // unsqueeze both outer and inner dimensions - submatrix = array.unsqueeze(submatrix, iSize.length, outer, sSize); - } - - // check whether the size of the submatrix matches the index size - if (!object.deepEqual(iSize, sSize)) { - throw new DimensionError(iSize, sSize, '>'); - } - - // enlarge matrix when needed - var size = index.max().map(function (i) { - return i + 1; - }); - _fit(matrix, size, defaultValue); - - // insert the sub matrix - var dims = iSize.length, - dim = 0; - _setSubmatrix (matrix._data, index, submatrix, dims, dim); - } - - return matrix; - } - - /** - * Replace a submatrix of a multi dimensional matrix. - * @param {Array} data - * @param {Index} index - * @param {Array} submatrix - * @param {number} dims Total number of dimensions - * @param {number} dim - * @private - */ - function _setSubmatrix (data, index, submatrix, dims, dim) { - var last = (dim == dims - 1), - range = index.range(dim); - - if (last) { - range.forEach(function (dataIndex, subIndex) { - validateIndex(dataIndex); - data[dataIndex] = submatrix[subIndex]; - }); - } - else { - range.forEach(function (dataIndex, subIndex) { - validateIndex(dataIndex); - _setSubmatrix(data[dataIndex], index, submatrix[subIndex], dims, dim + 1); - }); - } - } - - /** - * Resize the matrix - * @param {Number[]} size - * @param {*} [defaultValue=0] Default value, filled in on new entries. - * If not provided, the matrix elements will - * be filled with zeros. - * @return {Matrix} self The matrix itself is returned - */ - Matrix.prototype.resize = function (size, defaultValue) { - this._size = object.clone(size); - this._data = array.resize(this._data, this._size, defaultValue); - - // return the matrix itself - return this; - }; - - /** - * Enlarge the matrix when it is smaller than given size. - * If the matrix is larger or equal sized, nothing is done. - * @param {Matrix} matrix The matrix to be resized - * @param {Number[]} size - * @param {*} defaultValue Default value, filled in on new entries. - * @private - */ - function _fit(matrix, size, defaultValue) { - var newSize = object.clone(matrix._size), - changed = false; - - // add dimensions when needed - while (newSize.length < size.length) { - newSize.push(0); - changed = true; - } - - // enlarge size when needed - for (var i = 0, ii = size.length; i < ii; i++) { - if (size[i] > newSize[i]) { - newSize[i] = size[i]; - changed = true; - } - } - - if (changed) { - // resize only when size is changed - matrix.resize(newSize, defaultValue); - } - } - - /** - * Create a clone of the matrix - * @return {Matrix} clone - */ - Matrix.prototype.clone = function () { - var matrix = new Matrix(); - matrix._data = object.clone(this._data); - matrix._size = object.clone(this._size); - return matrix; - }; - - /** - * Retrieve the size of the matrix. - * @returns {Number[]} size - */ - Matrix.prototype.size = function() { - return this._size; - }; - - /** - * Create a new matrix with the results of the callback function executed on - * each entry of the matrix. - * @param {function} callback The callback function is invoked with three - * parameters: the value of the element, the index - * of the element, and the Matrix being traversed. - * @return {Matrix} matrix - */ - Matrix.prototype.map = function (callback) { - var me = this; - var matrix = new Matrix(); - - var recurse = function (value, index) { - if (isArray(value)) { - return value.map(function (child, i) { - return recurse(child, index.concat(i)); - }); - } - else { - return callback(value, index, me); - } - }; - matrix._data = recurse(this._data, []); - matrix._size = object.clone(this._size); - - return matrix; - }; - - /** - * Execute a callback function on each entry of the matrix. - * @param {function} callback The callback function is invoked with three - * parameters: the value of the element, the index - * of the element, and the Matrix being traversed. - */ - Matrix.prototype.forEach = function (callback) { - var me = this; - - var recurse = function (value, index) { - if (isArray(value)) { - value.forEach(function (child, i) { - recurse(child, index.concat(i)); - }); - } - else { - callback(value, index, me); - } - }; - recurse(this._data, []); - }; - - /** - * Create an Array with a copy of the data of the Matrix - * @returns {Array} array - */ - Matrix.prototype.toArray = function () { - return object.clone(this._data); - }; - - /** - * Get the primitive value of the Matrix: a multidimensional array - * @returns {Array} array - */ - Matrix.prototype.valueOf = function () { - return this._data; - }; - - /** - * Get a string representation of the matrix, with optional formatting options. - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @returns {String} str - */ - Matrix.prototype.format = function (options) { - return string.format(this._data, options); - }; - - /** - * Get a string representation of the matrix - * @returns {String} str - */ - Matrix.prototype.toString = function () { - return string.format(this._data); - }; - - /** - * Get a JSON representation of the matrix - * @returns {Object} - */ - Matrix.prototype.toJSON = function () { - return { - mathjs: 'Matrix', - data: this._data - } - }; - - /** - * Generate a matrix from a JSON object - * @param {Object} json An object structured like - * `{"mathjs": "Matrix", data: []}`, - * where mathjs is optional - * @returns {Matrix} - */ - Matrix.fromJSON = function (json) { - return new Matrix(json.data); - }; - - /** - * Preprocess data, which can be an Array or Matrix with nested Arrays and - * Matrices. Replaces all nested Matrices with Arrays - * @param {Array} data - * @return {Array} data - */ - function preprocess(data) { - for (var i = 0, ii = data.length; i < ii; i++) { - var elem = data[i]; - if (isArray(elem)) { - data[i] = preprocess(elem); - } - else if (elem instanceof Matrix) { - data[i] = preprocess(elem._data); - } - } - - return data; - } - - // exports - module.exports = Matrix; + 'use strict'; + + var util = __webpack_require__(171), + + number = util.number, + string = util.string, + isNumber = util.number.isNumber, + isString = util.string.isString; + + /** + * @constructor Unit + * + * A unit can be constructed in the following ways: + * var a = new Unit(value, name); + * var b = new Unit(null, name); + * var c = Unit.parse(str); + * + * Example usage: + * var a = new Unit(5, 'cm'); // 50 mm + * var b = Unit.parse('23 kg'); // 23 kg + * var c = math.in(a, new Unit(null, 'm'); // 0.05 m + * + * @param {Number} [value] A value like 5.2 + * @param {String} [name] A unit name like "cm" or "inch". Can include a prefix + */ + function Unit(value, name) { + if (!(this instanceof Unit)) { + throw new Error('Constructor must be called with the new operator'); + } + + if (value != undefined && !isNumber(value)) { + throw new TypeError('First parameter in Unit constructor must be a number'); + } + if (name != undefined && (!isString(name) || name == '')) { + throw new TypeError('Second parameter in Unit constructor must be a string'); + } + + if (name != undefined) { + // find the unit and prefix from the string + var res = _findUnit(name); + if (!res) { + throw new SyntaxError('Unknown unit "' + name + '"'); + } + this.unit = res.unit; + this.prefix = res.prefix; + } + else { + this.unit = UNIT_NONE; + this.prefix = PREFIX_NONE; // link to a list with supported prefixes + } + + this.value = (value != undefined) ? this._normalize(value) : null; + this.fixPrefix = false; // if true, function format will not search for the + // best prefix but leave it as initially provided. + // fixPrefix is set true by the method Unit.to + } + + // private variables and functions for the Unit parser + var text, index, c; + + function skipWhitespace() { + while (c == ' ' || c == '\t') { + next(); + } + } + + function isDigitDot (c) { + return ((c >= '0' && c <= '9') || c == '.'); + } + + function isDigit (c) { + return ((c >= '0' && c <= '9')); + } + + function next() { + index++; + c = text.charAt(index); + } + + function revert(oldIndex) { + index = oldIndex; + c = text.charAt(index); + } + + function parseNumber () { + var number = ''; + var oldIndex; + oldIndex = index; + + if (c == '+') { + next(); + } + else if (c == '-') { + number += c; + next(); + } + + if (!isDigitDot(c)) { + // a + or - must be followed by a digit + revert(oldIndex); + return null; + } + + // get number, can have a single dot + if (c == '.') { + number += c; + next(); + if (!isDigit(c)) { + // this is no legal number, it is just a dot + revert(oldIndex); + return null; + } + } + else { + while (isDigit(c)) { + number += c; + next(); + } + if (c == '.') { + number += c; + next(); + } + } + while (isDigit(c)) { + number += c; + next(); + } + + // check for exponential notation like "2.3e-4" or "1.23e50" + if (c == 'E' || c == 'e') { + number += c; + next(); + + if (c == '+' || c == '-') { + number += c; + next(); + } + + // Scientific notation MUST be followed by an exponent + if (!isDigit(c)) { + // this is no legal number, exponent is missing. + revert(oldIndex); + return null; + } + + while (isDigit(c)) { + number += c; + next(); + } + } + + return number; + } + + function parseUnit() { + var unitName = ''; + + skipWhitespace(); + while (c && c != ' ' && c != '\t') { + unitName += c; + next(); + } + + return unitName || null; + } + + /** + * Parse a string into a unit. Returns null if the provided string does not + * contain a valid unit. + * @param {String} str A string like "5.2 inch", "4e2 kg" + * @return {Unit | null} unit + */ + Unit.parse = function(str) { + text = str; + index = -1; + c = ''; + + if (!isString(text)) { + return null; + } + + next(); + skipWhitespace(); + var value = parseNumber(); + var name; + if (value) { + name = parseUnit(); + + next(); + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + if (value && name) { + try { + // constructor will throw an error when unit is not found + return new Unit(Number(value), name); + } + catch (err) {} + } + } + else { + name = parseUnit(); + + next(); + skipWhitespace(); + if (c) { + // garbage at the end. not good. + return null; + } + + if (name) { + try { + // constructor will throw an error when unit is not found + return new Unit(null, name); + } + catch (err) {} + } + } + + return null; + }; + + /** + * Test whether value is of type Unit + * @param {*} value + * @return {Boolean} isUnit + */ + Unit.isUnit = function(value) { + return (value instanceof Unit); + }; + + /** + * create a copy of this unit + * @return {Unit} clone + */ + Unit.prototype.clone = function () { + var clone = new Unit(); + + for (var p in this) { + if (this.hasOwnProperty(p)) { + clone[p] = this[p]; + } + } + + return clone; + }; + + /** + * Normalize a value, based on its currently set unit + * @param {Number} value + * @return {Number} normalized value + * @private + */ + Unit.prototype._normalize = function(value) { + return (value + this.unit.offset) * this.unit.value * this.prefix.value; + }; + + /** + * Denormalize a value, based on its currently set unit + * @param {Number} value + * @param {Number} [prefixValue] Optional prefix value to be used + * @return {Number} denormalized value + * @private + */ + Unit.prototype._denormalize = function (value, prefixValue) { + if (prefixValue == undefined) { + return value / this.unit.value / this.prefix.value - this.unit.offset; + } + else { + return value / this.unit.value / prefixValue - this.unit.offset; + } + }; + + /** + * Find a unit from a string + * @param {String} str A string like 'cm' or 'inch' + * @returns {Object | null} result When found, an object with fields unit and + * prefix is returned. Else, null is returned. + * @private + */ + function _findUnit(str) { + for (var name in UNITS) { + if (UNITS.hasOwnProperty(name)) { + if (string.endsWith(str, name) ) { + var unit = UNITS[name]; + var prefixLen = (str.length - name.length); + var prefixName = str.substring(0, prefixLen); + var prefix = unit.prefixes[prefixName]; + if (prefix !== undefined) { + // store unit, prefix, and value + return { + unit: unit, + prefix: prefix + }; + } + } + } + } + + return null; + } + + /** + * Test if the given expression is a unit. + * The unit can have a prefix but cannot have a value. + * @param {String} name A string to be tested whether it is a value less unit. + * The unit can have prefix, like "cm" + * @return {Boolean} true if the given string is a unit + */ + Unit.isValuelessUnit = function (name) { + return (_findUnit(name) != null); + }; + + /** + * check if this unit has given base unit + * @param {BASE_UNITS | undefined} base + */ + Unit.prototype.hasBase = function(base) { + return (this.unit.base === base); + }; + + /** + * Check if this unit has a base equal to another base + * @param {Unit} other + * @return {Boolean} true if equal base + */ + Unit.prototype.equalBase = function(other) { + return (this.unit.base === other.unit.base); + }; + + /** + * Check if this unit equals another unit + * @param {Unit} other + * @return {Boolean} true if both units are equal + */ + Unit.prototype.equals = function(other) { + return (this.equalBase(other) && this.value == other.value); + }; + + /** + * Create a clone of this unit with a representation + * @param {String | Unit} valuelessUnit A unit without value. Can have prefix, like "cm" + * @returns {Unit} unit having fixed, specified unit + */ + Unit.prototype.to = function (valuelessUnit) { + var other; + var value = this.value == null ? this._normalize(1) : this.value; + if (isString(valuelessUnit)) { + other = new Unit(null, valuelessUnit); + + if (!this.equalBase(other)) { + throw new Error('Units do not match'); + } + + other.value = value; + other.fixPrefix = true; + return other; + } + else if (valuelessUnit instanceof Unit) { + if (!this.equalBase(valuelessUnit)) { + throw new Error('Units do not match'); + } + if (valuelessUnit.value !== null) { + throw new Error('Cannot convert to a unit with a value'); + } + + other = valuelessUnit.clone(); + other.value = value; + other.fixPrefix = true; + return other; + } + else { + throw new Error('String or Unit expected as parameter'); + } + }; + + /** + * Return the value of the unit when represented with given valueless unit + * @param {String | Unit} valuelessUnit For example 'cm' or 'inch' + * @return {Number} value + */ + Unit.prototype.toNumber = function (valuelessUnit) { + var other = this.to(valuelessUnit); + return other._denormalize(other.value, other.prefix.value); + }; + + + /** + * Get a string representation of the unit. + * @return {String} + */ + Unit.prototype.toString = function() { + return this.format(); + }; + + /** + * Get a JSON representation of the unit + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}` + */ + Unit.prototype.toJSON = function () { + return { + mathjs: 'Unit', + value: this._denormalize(this.value), + unit: this.prefix.name + this.unit.name, + fixPrefix: this.fixPrefix + }; + }; + + /** + * Instantiate a Unit from a JSON object + * @param {Object} json A JSON object structured as: + * `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}` + * @return {Unit} + */ + Unit.fromJSON = function (json) { + var unit = new Unit(json.value, json.unit); + unit.fixPrefix = json.fixPrefix || false; + return unit; + }; + + /** + * Returns the string representation of the unit. + * @return {String} + */ + Unit.prototype.valueOf = Unit.prototype.toString; + + /** + * Get a string representation of the Unit, with optional formatting options. + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @return {String} + */ + Unit.prototype.format = function(options) { + var value, + str; + + if (this.value !== null && !this.fixPrefix) { + var bestPrefix = this._bestPrefix(); + value = this._denormalize(this.value, bestPrefix.value); + str = number.format(value, options) + ' '; + str += bestPrefix.name + this.unit.name; + } + else { + value = this._denormalize(this.value); + str = (this.value !== null) ? (number.format(value, options) + ' ') : ''; + str += this.prefix.name + this.unit.name; + } + + return str; + }; + + /** + * Calculate the best prefix using current value. + * @returns {Object} prefix + * @private + */ + Unit.prototype._bestPrefix = function () { + // find the best prefix value (resulting in the value of which + // the absolute value of the log10 is closest to zero, + // though with a little offset of 1.2 for nicer values: you get a + // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ... + var absValue = Math.abs(this.value / this.unit.value); + var bestPrefix = PREFIX_NONE; + var bestDiff = Math.abs( + Math.log(absValue / bestPrefix.value) / Math.LN10 - 1.2); + + var prefixes = this.unit.prefixes; + for (var p in prefixes) { + if (prefixes.hasOwnProperty(p)) { + var prefix = prefixes[p]; + if (prefix.scientific) { + var diff = Math.abs( + Math.log(absValue / prefix.value) / Math.LN10 - 1.2); + + if (diff < bestDiff) { + bestPrefix = prefix; + bestDiff = diff; + } + } + } + } + + return bestPrefix; + }; + + var PREFIXES = { + NONE: { + '': {name: '', value: 1, scientific: true} + }, + SHORT: { + '': {name: '', value: 1, scientific: true}, + + 'da': {name: 'da', value: 1e1, scientific: false}, + 'h': {name: 'h', value: 1e2, scientific: false}, + 'k': {name: 'k', value: 1e3, scientific: true}, + 'M': {name: 'M', value: 1e6, scientific: true}, + 'G': {name: 'G', value: 1e9, scientific: true}, + 'T': {name: 'T', value: 1e12, scientific: true}, + 'P': {name: 'P', value: 1e15, scientific: true}, + 'E': {name: 'E', value: 1e18, scientific: true}, + 'Z': {name: 'Z', value: 1e21, scientific: true}, + 'Y': {name: 'Y', value: 1e24, scientific: true}, + + 'd': {name: 'd', value: 1e-1, scientific: false}, + 'c': {name: 'c', value: 1e-2, scientific: false}, + 'm': {name: 'm', value: 1e-3, scientific: true}, + 'u': {name: 'u', value: 1e-6, scientific: true}, + 'n': {name: 'n', value: 1e-9, scientific: true}, + 'p': {name: 'p', value: 1e-12, scientific: true}, + 'f': {name: 'f', value: 1e-15, scientific: true}, + 'a': {name: 'a', value: 1e-18, scientific: true}, + 'z': {name: 'z', value: 1e-21, scientific: true}, + 'y': {name: 'y', value: 1e-24, scientific: true} + }, + LONG: { + '': {name: '', value: 1, scientific: true}, + + 'deca': {name: 'deca', value: 1e1, scientific: false}, + 'hecto': {name: 'hecto', value: 1e2, scientific: false}, + 'kilo': {name: 'kilo', value: 1e3, scientific: true}, + 'mega': {name: 'mega', value: 1e6, scientific: true}, + 'giga': {name: 'giga', value: 1e9, scientific: true}, + 'tera': {name: 'tera', value: 1e12, scientific: true}, + 'peta': {name: 'peta', value: 1e15, scientific: true}, + 'exa': {name: 'exa', value: 1e18, scientific: true}, + 'zetta': {name: 'zetta', value: 1e21, scientific: true}, + 'yotta': {name: 'yotta', value: 1e24, scientific: true}, + + 'deci': {name: 'deci', value: 1e-1, scientific: false}, + 'centi': {name: 'centi', value: 1e-2, scientific: false}, + 'milli': {name: 'milli', value: 1e-3, scientific: true}, + 'micro': {name: 'micro', value: 1e-6, scientific: true}, + 'nano': {name: 'nano', value: 1e-9, scientific: true}, + 'pico': {name: 'pico', value: 1e-12, scientific: true}, + 'femto': {name: 'femto', value: 1e-15, scientific: true}, + 'atto': {name: 'atto', value: 1e-18, scientific: true}, + 'zepto': {name: 'zepto', value: 1e-21, scientific: true}, + 'yocto': {name: 'yocto', value: 1e-24, scientific: true} + }, + SQUARED: { + '': {name: '', value: 1, scientific: true}, + + 'da': {name: 'da', value: 1e2, scientific: false}, + 'h': {name: 'h', value: 1e4, scientific: false}, + 'k': {name: 'k', value: 1e6, scientific: true}, + 'M': {name: 'M', value: 1e12, scientific: true}, + 'G': {name: 'G', value: 1e18, scientific: true}, + 'T': {name: 'T', value: 1e24, scientific: true}, + 'P': {name: 'P', value: 1e30, scientific: true}, + 'E': {name: 'E', value: 1e36, scientific: true}, + 'Z': {name: 'Z', value: 1e42, scientific: true}, + 'Y': {name: 'Y', value: 1e48, scientific: true}, + + 'd': {name: 'd', value: 1e-2, scientific: false}, + 'c': {name: 'c', value: 1e-4, scientific: false}, + 'm': {name: 'm', value: 1e-6, scientific: true}, + 'u': {name: 'u', value: 1e-12, scientific: true}, + 'n': {name: 'n', value: 1e-18, scientific: true}, + 'p': {name: 'p', value: 1e-24, scientific: true}, + 'f': {name: 'f', value: 1e-30, scientific: true}, + 'a': {name: 'a', value: 1e-36, scientific: true}, + 'z': {name: 'z', value: 1e-42, scientific: true}, + 'y': {name: 'y', value: 1e-42, scientific: true} + }, + CUBIC: { + '': {name: '', value: 1, scientific: true}, + + 'da': {name: 'da', value: 1e3, scientific: false}, + 'h': {name: 'h', value: 1e6, scientific: false}, + 'k': {name: 'k', value: 1e9, scientific: true}, + 'M': {name: 'M', value: 1e18, scientific: true}, + 'G': {name: 'G', value: 1e27, scientific: true}, + 'T': {name: 'T', value: 1e36, scientific: true}, + 'P': {name: 'P', value: 1e45, scientific: true}, + 'E': {name: 'E', value: 1e54, scientific: true}, + 'Z': {name: 'Z', value: 1e63, scientific: true}, + 'Y': {name: 'Y', value: 1e72, scientific: true}, + + 'd': {name: 'd', value: 1e-3, scientific: false}, + 'c': {name: 'c', value: 1e-6, scientific: false}, + 'm': {name: 'm', value: 1e-9, scientific: true}, + 'u': {name: 'u', value: 1e-18, scientific: true}, + 'n': {name: 'n', value: 1e-27, scientific: true}, + 'p': {name: 'p', value: 1e-36, scientific: true}, + 'f': {name: 'f', value: 1e-45, scientific: true}, + 'a': {name: 'a', value: 1e-54, scientific: true}, + 'z': {name: 'z', value: 1e-63, scientific: true}, + 'y': {name: 'y', value: 1e-72, scientific: true} + }, + BINARY_SHORT: { + '': {name: '', value: 1, scientific: true}, + 'k': {name: 'k', value: 1e3, scientific: true}, + 'M': {name: 'M', value: 1e6, scientific: true}, + 'G': {name: 'G', value: 1e9, scientific: true}, + 'T': {name: 'T', value: 1e12, scientific: true}, + 'P': {name: 'P', value: 1e15, scientific: true}, + 'E': {name: 'E', value: 1e18, scientific: true}, + 'Z': {name: 'Z', value: 1e21, scientific: true}, + 'Y': {name: 'Y', value: 1e24, scientific: true}, + + 'Ki': {name: 'Ki', value: 1024, scientific: true}, + 'Mi': {name: 'Mi', value: Math.pow(1024, 2), scientific: true}, + 'Gi': {name: 'Gi', value: Math.pow(1024, 3), scientific: true}, + 'Ti': {name: 'Ti', value: Math.pow(1024, 4), scientific: true}, + 'Pi': {name: 'Pi', value: Math.pow(1024, 5), scientific: true}, + 'Ei': {name: 'Ei', value: Math.pow(1024, 6), scientific: true}, + 'Zi': {name: 'Zi', value: Math.pow(1024, 7), scientific: true}, + 'Yi': {name: 'Yi', value: Math.pow(1024, 8), scientific: true} + }, + BINARY_LONG: { + '': {name: '', value: 1, scientific: true}, + 'kilo': {name: 'kilo', value: 1e3, scientific: true}, + 'mega': {name: 'mega', value: 1e6, scientific: true}, + 'giga': {name: 'giga', value: 1e9, scientific: true}, + 'tera': {name: 'tera', value: 1e12, scientific: true}, + 'peta': {name: 'peta', value: 1e15, scientific: true}, + 'exa': {name: 'exa', value: 1e18, scientific: true}, + 'zetta': {name: 'zetta', value: 1e21, scientific: true}, + 'yotta': {name: 'yotta', value: 1e24, scientific: true}, + + 'kibi': {name: 'kibi', value: 1024, scientific: true}, + 'mebi': {name: 'mebi', value: Math.pow(1024, 2), scientific: true}, + 'gibi': {name: 'gibi', value: Math.pow(1024, 3), scientific: true}, + 'tebi': {name: 'tebi', value: Math.pow(1024, 4), scientific: true}, + 'pebi': {name: 'pebi', value: Math.pow(1024, 5), scientific: true}, + 'exi': {name: 'exi', value: Math.pow(1024, 6), scientific: true}, + 'zebi': {name: 'zebi', value: Math.pow(1024, 7), scientific: true}, + 'yobi': {name: 'yobi', value: Math.pow(1024, 8), scientific: true} + } + }; + + var PREFIX_NONE = {name: '', value: 1, scientific: true}; + + var BASE_UNITS = { + NONE: {}, + + LENGTH: {}, // meter + MASS: {}, // kilogram + TIME: {}, // second + CURRENT: {}, // ampere + TEMPERATURE: {}, // kelvin + LUMINOUS_INTENSITY: {}, // candela + AMOUNT_OF_SUBSTANCE: {}, // mole + + FORCE: {}, // Newton + SURFACE: {}, // m2 + VOLUME: {}, // m3 + ANGLE: {}, // rad + BIT: {} // bit (digital) + }; + + var BASE_UNIT_NONE = {}; + + var UNIT_NONE = {name: '', base: BASE_UNIT_NONE, value: 1, offset: 0}; + + var UNITS = { + // length + meter: {name: 'meter', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.LONG, value: 1, offset: 0}, + inch: {name: 'inch', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0254, offset: 0}, + foot: {name: 'foot', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.3048, offset: 0}, + yard: {name: 'yard', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.9144, offset: 0}, + mile: {name: 'mile', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1609.344, offset: 0}, + link: {name: 'link', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.201168, offset: 0}, + rod: {name: 'rod', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 5.029210, offset: 0}, + chain: {name: 'chain', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 20.1168, offset: 0}, + angstrom: {name: 'angstrom', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1e-10, offset: 0}, + + m: {name: 'm', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, + 'in': {name: 'in', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0254, offset: 0}, + ft: {name: 'ft', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.3048, offset: 0}, + yd: {name: 'yd', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.9144, offset: 0}, + mi: {name: 'mi', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1609.344, offset: 0}, + li: {name: 'li', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.201168, offset: 0}, + rd: {name: 'rd', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 5.029210, offset: 0}, + ch: {name: 'ch', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 20.1168, offset: 0}, + mil: {name: 'mil', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0000254, offset: 0}, // 1/1000 inch + + // Surface + m2: {name: 'm2', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.SQUARED, value: 1, offset: 0}, + sqin: {name: 'sqin', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.00064516, offset: 0}, // 645.16 mm2 + sqft: {name: 'sqft', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.09290304, offset: 0}, // 0.09290304 m2 + sqyd: {name: 'sqyd', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.83612736, offset: 0}, // 0.83612736 m2 + sqmi: {name: 'sqmi', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 2589988.110336, offset: 0}, // 2.589988110336 km2 + sqrd: {name: 'sqrd', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 25.29295, offset: 0}, // 25.29295 m2 + sqch: {name: 'sqch', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 404.6873, offset: 0}, // 404.6873 m2 + sqmil: {name: 'sqmil', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 6.4516e-10, offset: 0}, // 6.4516 * 10^-10 m2 + + // Volume + m3: {name: 'm3', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.CUBIC, value: 1, offset: 0}, + L: {name: 'L', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, // litre + l: {name: 'l', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, // litre + litre: {name: 'litre', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.LONG, value: 0.001, offset: 0}, + cuin: {name: 'cuin', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 1.6387064e-5, offset: 0}, // 1.6387064e-5 m3 + cuft: {name: 'cuft', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.028316846592, offset: 0}, // 28.316 846 592 L + cuyd: {name: 'cuyd', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.764554857984, offset: 0}, // 764.554 857 984 L + teaspoon: {name: 'teaspoon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000005, offset: 0}, // 5 mL + tablespoon: {name: 'tablespoon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000015, offset: 0}, // 15 mL + //{name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL // not possible, we have already another cup + drop: {name: 'drop', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 5e-8, offset: 0}, // 0.05 mL = 5e-8 m3 + gtt: {name: 'gtt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 5e-8, offset: 0}, // 0.05 mL = 5e-8 m3 + + // Liquid volume + minim: {name: 'minim', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL + fluiddram: {name: 'fluiddram', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0000036966911, offset: 0}, // 3.696691 mL + fluidounce: {name: 'fluidounce', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00002957353, offset: 0}, // 29.57353 mL + gill: {name: 'gill', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0001182941, offset: 0}, // 118.2941 mL + cc: {name: 'cc', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 1e-6, offset: 0}, // 1e-6 L + cup: {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0002365882, offset: 0}, // 236.5882 mL + pint: {name: 'pint', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0004731765, offset: 0}, // 473.1765 mL + quart: {name: 'quart', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0009463529, offset: 0}, // 946.3529 mL + gallon: {name: 'gallon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.003785412, offset: 0}, // 3.785412 L + beerbarrel: {name: 'beerbarrel', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1173478, offset: 0}, // 117.3478 L + oilbarrel: {name: 'oilbarrel', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1589873, offset: 0}, // 158.9873 L + hogshead: {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L + + //{name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute + fldr: {name: 'fldr', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0000036966911, offset: 0}, // 3.696691 mL + floz: {name: 'floz', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00002957353, offset: 0}, // 29.57353 mL + gi: {name: 'gi', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0001182941, offset: 0}, // 118.2941 mL + cp: {name: 'cp', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0002365882, offset: 0}, // 236.5882 mL + pt: {name: 'pt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0004731765, offset: 0}, // 473.1765 mL + qt: {name: 'qt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0009463529, offset: 0}, // 946.3529 mL + gal: {name: 'gal', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.003785412, offset: 0}, // 3.785412 L + bbl: {name: 'bbl', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1173478, offset: 0}, // 117.3478 L + obl: {name: 'obl', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1589873, offset: 0}, // 158.9873 L + //{name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh? + + // Mass + g: {name: 'g', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, + gram: {name: 'gram', base: BASE_UNITS.MASS, prefixes: PREFIXES.LONG, value: 0.001, offset: 0}, + + ton: {name: 'ton', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 907.18474, offset: 0}, + tonne: {name: 'tonne', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 1000, offset: 0}, + + grain: {name: 'grain', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 64.79891e-6, offset: 0}, + dram: {name: 'dram', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 1.7718451953125e-3, offset: 0}, + ounce: {name: 'ounce', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 28.349523125e-3, offset: 0}, + poundmass: {name: 'poundmass', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 453.59237e-3, offset: 0}, + hundredweight: {name: 'hundredweight', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 45.359237, offset: 0}, + stick: {name: 'stick', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 115e-3, offset: 0}, + stone: {name: 'stone', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 6350, offset: 0}, + + gr: {name: 'gr', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 64.79891e-6, offset: 0}, + dr: {name: 'dr', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 1.7718451953125e-3, offset: 0}, + oz: {name: 'oz', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 28.349523125e-3, offset: 0}, + lbm: {name: 'lbm', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 453.59237e-3, offset: 0}, + cwt: {name: 'cwt', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 45.359237, offset: 0}, + + // Time + s: {name: 's', base: BASE_UNITS.TIME, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, + min: {name: 'min', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 60, offset: 0}, + h: {name: 'h', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 3600, offset: 0}, + second: {name: 'second', base: BASE_UNITS.TIME, prefixes: PREFIXES.LONG, value: 1, offset: 0}, + sec: {name: 'sec', base: BASE_UNITS.TIME, prefixes: PREFIXES.LONG, value: 1, offset: 0}, + minute: {name: 'minute', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 60, offset: 0}, + hour: {name: 'hour', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 3600, offset: 0}, + day: {name: 'day', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 86400, offset: 0}, + + // Angle + rad: {name: 'rad', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888 + deg: {name: 'deg', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 0.017453292519943295769236907684888, offset: 0}, + // grad = rad / (2*pi) * 400 = rad / 0.015707963267948966192313216916399 + grad: {name: 'grad', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 0.015707963267948966192313216916399, offset: 0}, + // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793 + cycle: {name: 'cycle', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 6.2831853071795864769252867665793, offset: 0}, + + // Electric current + A: {name: 'A', base: BASE_UNITS.CURRENT, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, + ampere: {name: 'ampere', base: BASE_UNITS.CURRENT, prefixes: PREFIXES.LONG, value: 1, offset: 0}, + + // Temperature + // K(C) = °C + 273.15 + // K(F) = (°F + 459.67) / 1.8 + // K(R) = °R / 1.8 + K: {name: 'K', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + degC: {name: 'degC', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 273.15}, + degF: {name: 'degF', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 459.67}, + degR: {name: 'degR', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 0}, + kelvin: {name: 'kelvin', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + celsius: {name: 'celsius', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 273.15}, + fahrenheit: {name: 'fahrenheit', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 459.67}, + rankine: {name: 'rankine', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 0}, + + // amount of substance + mol: {name: 'mol', base: BASE_UNITS.AMOUNT_OF_SUBSTANCE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + mole: {name: 'mole', base: BASE_UNITS.AMOUNT_OF_SUBSTANCE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + + // luminous intensity + cd: {name: 'cd', base: BASE_UNITS.LUMINOUS_INTENSITY, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + candela: {name: 'candela', base: BASE_UNITS.LUMINOUS_INTENSITY, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + // TODO: units STERADIAN + //{name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + //{name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0}, + + // Force + N: {name: 'N', base: BASE_UNITS.FORCE, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, + newton: {name: 'newton', base: BASE_UNITS.FORCE, prefixes: PREFIXES.LONG, value: 1, offset: 0}, + lbf: {name: 'lbf', base: BASE_UNITS.FORCE, prefixes: PREFIXES.NONE, value: 4.4482216152605, offset: 0}, + poundforce: {name: 'poundforce', base: BASE_UNITS.FORCE, prefixes: PREFIXES.NONE, value: 4.4482216152605, offset: 0}, + + // Binary + b: {name: 'b', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_SHORT, value: 1, offset: 0}, + bits: {name: 'bits', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_LONG, value: 1, offset: 0}, + B: {name: 'B', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_SHORT, value: 8, offset: 0}, + bytes: {name: 'bytes', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_LONG, value: 8, offset: 0} + }; + + // plurals + var PLURALS = { + meters: 'meter', + inches: 'inch', + feet: 'foot', + yards: 'yard', + miles: 'mile', + links: 'link', + rods: 'rod', + chains: 'chain', + angstroms: 'angstrom', + + litres: 'litre', + teaspoons: 'teaspoon', + tablespoons: 'tablespoon', + minims: 'minim', + fluiddrams: 'fluiddram', + fluidounces: 'fluidounce', + gills: 'gill', + cups: 'cup', + pints: 'pint', + quarts: 'quart', + gallons: 'gallon', + beerbarrels: 'beerbarrel', + oilbarrels: 'oilbarrel', + hogsheads: 'hogshead', + gtts: 'gtt', + + grams: 'gram', + tons: 'ton', + tonnes: 'tonne', + grains: 'grain', + drams: 'dram', + ounces: 'ounce', + poundmasses: 'poundmass', + hundredweights: 'hundredweight', + sticks: 'stick', + + seconds: 'second', + minutes: 'minute', + hours: 'hour', + days: 'day', + + radians: 'rad', + degrees: 'deg', + gradients: 'grad', + cycles: 'cycle', + + amperes: 'ampere', + moles: 'mole' + }; + + for (var name in PLURALS) { + /* istanbul ignore next (we cannot really test next statement) */ + if (PLURALS.hasOwnProperty(name)) { + var unit = UNITS[PLURALS[name]]; + var plural = Object.create(unit); + plural.name = name; + UNITS[name] = plural; + } + } + + // aliases + UNITS.lt = UNITS.l; + UNITS.liter = UNITS.litre; + UNITS.liters = UNITS.litres; + UNITS.lb = UNITS.lbm; + UNITS.lbs = UNITS.lbm; + + + Unit.PREFIXES = PREFIXES; + Unit.BASE_UNITS = BASE_UNITS; + Unit.UNITS = UNITS; + + // end of unit aliases + + + // exports + module.exports = Unit; /***/ }, /* 8 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164), - - number = util.number, - string = util.string, - isNumber = util.number.isNumber, - isString = util.string.isString; - - /** - * @constructor Unit - * - * A unit can be constructed in the following ways: - * var a = new Unit(value, name); - * var b = new Unit(null, name); - * var c = Unit.parse(str); - * - * Example usage: - * var a = new Unit(5, 'cm'); // 50 mm - * var b = Unit.parse('23 kg'); // 23 kg - * var c = math.in(a, new Unit(null, 'm'); // 0.05 m - * - * @param {Number} [value] A value like 5.2 - * @param {String} [name] A unit name like "cm" or "inch". Can include a prefix - */ - function Unit(value, name) { - if (!(this instanceof Unit)) { - throw new Error('Constructor must be called with the new operator'); - } - - if (value != undefined && !isNumber(value)) { - throw new TypeError('First parameter in Unit constructor must be a number'); - } - if (name != undefined && (!isString(name) || name == '')) { - throw new TypeError('Second parameter in Unit constructor must be a string'); - } - - if (name != undefined) { - // find the unit and prefix from the string - var res = _findUnit(name); - if (!res) { - throw new SyntaxError('Unknown unit "' + name + '"'); - } - this.unit = res.unit; - this.prefix = res.prefix; - } - else { - this.unit = UNIT_NONE; - this.prefix = PREFIX_NONE; // link to a list with supported prefixes - } - - this.value = (value != undefined) ? this._normalize(value) : null; - this.fixPrefix = false; // if true, function format will not search for the - // best prefix but leave it as initially provided. - // fixPrefix is set true by the method Unit.to - } - - // private variables and functions for the Unit parser - var text, index, c; - - function skipWhitespace() { - while (c == ' ' || c == '\t') { - next(); - } - } - - function isDigitDot (c) { - return ((c >= '0' && c <= '9') || c == '.'); - } - - function isDigit (c) { - return ((c >= '0' && c <= '9')); - } - - function next() { - index++; - c = text.charAt(index); - } - - function revert(oldIndex) { - index = oldIndex; - c = text.charAt(index); - } - - function parseNumber () { - var number = ''; - var oldIndex; - oldIndex = index; - - if (c == '+') { - next(); - } - else if (c == '-') { - number += c; - next(); - } - - if (!isDigitDot(c)) { - // a + or - must be followed by a digit - revert(oldIndex); - return null; - } - - // get number, can have a single dot - if (c == '.') { - number += c; - next(); - if (!isDigit(c)) { - // this is no legal number, it is just a dot - revert(oldIndex); - return null; - } - } - else { - while (isDigit(c)) { - number += c; - next(); - } - if (c == '.') { - number += c; - next(); - } - } - while (isDigit(c)) { - number += c; - next(); - } - - // check for exponential notation like "2.3e-4" or "1.23e50" - if (c == 'E' || c == 'e') { - number += c; - next(); - - if (c == '+' || c == '-') { - number += c; - next(); - } - - // Scientific notation MUST be followed by an exponent - if (!isDigit(c)) { - // this is no legal number, exponent is missing. - revert(oldIndex); - return null; - } - - while (isDigit(c)) { - number += c; - next(); - } - } - - return number; - } - - function parseUnit() { - var unitName = ''; - - skipWhitespace(); - while (c && c != ' ' && c != '\t') { - unitName += c; - next(); - } - - return unitName || null; - } - - /** - * Parse a string into a unit. Returns null if the provided string does not - * contain a valid unit. - * @param {String} str A string like "5.2 inch", "4e2 kg" - * @return {Unit | null} unit - */ - Unit.parse = function(str) { - text = str; - index = -1; - c = ''; - - if (!isString(text)) { - return null; - } - - next(); - skipWhitespace(); - var value = parseNumber(); - var name; - if (value) { - name = parseUnit(); - - next(); - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - if (value && name) { - try { - // constructor will throw an error when unit is not found - return new Unit(Number(value), name); - } - catch (err) {} - } - } - else { - name = parseUnit(); - - next(); - skipWhitespace(); - if (c) { - // garbage at the end. not good. - return null; - } - - if (name) { - try { - // constructor will throw an error when unit is not found - return new Unit(null, name); - } - catch (err) {} - } - } - - return null; - }; - - /** - * Test whether value is of type Unit - * @param {*} value - * @return {Boolean} isUnit - */ - Unit.isUnit = function(value) { - return (value instanceof Unit); - }; - - /** - * create a copy of this unit - * @return {Unit} clone - */ - Unit.prototype.clone = function () { - var clone = new Unit(); - - for (var p in this) { - if (this.hasOwnProperty(p)) { - clone[p] = this[p]; - } - } - - return clone; - }; - - /** - * Normalize a value, based on its currently set unit - * @param {Number} value - * @return {Number} normalized value - * @private - */ - Unit.prototype._normalize = function(value) { - return (value + this.unit.offset) * this.unit.value * this.prefix.value; - }; - - /** - * Denormalize a value, based on its currently set unit - * @param {Number} value - * @param {Number} [prefixValue] Optional prefix value to be used - * @return {Number} denormalized value - * @private - */ - Unit.prototype._denormalize = function (value, prefixValue) { - if (prefixValue == undefined) { - return value / this.unit.value / this.prefix.value - this.unit.offset; - } - else { - return value / this.unit.value / prefixValue - this.unit.offset; - } - }; - - /** - * Find a unit from a string - * @param {String} str A string like 'cm' or 'inch' - * @returns {Object | null} result When found, an object with fields unit and - * prefix is returned. Else, null is returned. - * @private - */ - function _findUnit(str) { - for (var name in UNITS) { - if (UNITS.hasOwnProperty(name)) { - if (string.endsWith(str, name) ) { - var unit = UNITS[name]; - var prefixLen = (str.length - name.length); - var prefixName = str.substring(0, prefixLen); - var prefix = unit.prefixes[prefixName]; - if (prefix !== undefined) { - // store unit, prefix, and value - return { - unit: unit, - prefix: prefix - }; - } - } - } - } - - return null; - } - - /** - * Test if the given expression is a unit. - * The unit can have a prefix but cannot have a value. - * @param {String} name A string to be tested whether it is a value less unit. - * The unit can have prefix, like "cm" - * @return {Boolean} true if the given string is a unit - */ - Unit.isValuelessUnit = function (name) { - return (_findUnit(name) != null); - }; - - /** - * check if this unit has given base unit - * @param {BASE_UNITS | undefined} base - */ - Unit.prototype.hasBase = function(base) { - return (this.unit.base === base); - }; - - /** - * Check if this unit has a base equal to another base - * @param {Unit} other - * @return {Boolean} true if equal base - */ - Unit.prototype.equalBase = function(other) { - return (this.unit.base === other.unit.base); - }; - - /** - * Check if this unit equals another unit - * @param {Unit} other - * @return {Boolean} true if both units are equal - */ - Unit.prototype.equals = function(other) { - return (this.equalBase(other) && this.value == other.value); - }; - - /** - * Create a clone of this unit with a representation - * @param {String | Unit} valuelessUnit A unit without value. Can have prefix, like "cm" - * @returns {Unit} unit having fixed, specified unit - */ - Unit.prototype.to = function (valuelessUnit) { - var other; - var value = this.value == null ? this._normalize(1) : this.value; - if (isString(valuelessUnit)) { - other = new Unit(null, valuelessUnit); - - if (!this.equalBase(other)) { - throw new Error('Units do not match'); - } - - other.value = value; - other.fixPrefix = true; - return other; - } - else if (valuelessUnit instanceof Unit) { - if (!this.equalBase(valuelessUnit)) { - throw new Error('Units do not match'); - } - if (valuelessUnit.value !== null) { - throw new Error('Cannot convert to a unit with a value'); - } - - other = valuelessUnit.clone(); - other.value = value; - other.fixPrefix = true; - return other; - } - else { - throw new Error('String or Unit expected as parameter'); - } - }; - - /** - * Return the value of the unit when represented with given valueless unit - * @param {String | Unit} valuelessUnit For example 'cm' or 'inch' - * @return {Number} value - */ - Unit.prototype.toNumber = function (valuelessUnit) { - var other = this.to(valuelessUnit); - return other._denormalize(other.value, other.prefix.value); - }; - - - /** - * Get a string representation of the unit. - * @return {String} - */ - Unit.prototype.toString = function() { - return this.format(); - }; - - /** - * Get a JSON representation of the unit - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}` - */ - Unit.prototype.toJSON = function () { - return { - mathjs: 'Unit', - value: this._denormalize(this.value), - unit: this.prefix.name + this.unit.name, - fixPrefix: this.fixPrefix - }; - }; - - /** - * Instantiate a Unit from a JSON object - * @param {Object} json A JSON object structured as: - * `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}` - * @return {Unit} - */ - Unit.fromJSON = function (json) { - var unit = new Unit(json.value, json.unit); - unit.fixPrefix = json.fixPrefix || false; - return unit; - }; - - /** - * Returns the string representation of the unit. - * @return {String} - */ - Unit.prototype.valueOf = Unit.prototype.toString; - - /** - * Get a string representation of the Unit, with optional formatting options. - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @return {String} - */ - Unit.prototype.format = function(options) { - var value, - str; - - if (this.value !== null && !this.fixPrefix) { - var bestPrefix = this._bestPrefix(); - value = this._denormalize(this.value, bestPrefix.value); - str = number.format(value, options) + ' '; - str += bestPrefix.name + this.unit.name; - } - else { - value = this._denormalize(this.value); - str = (this.value !== null) ? (number.format(value, options) + ' ') : ''; - str += this.prefix.name + this.unit.name; - } - - return str; - }; - - /** - * Calculate the best prefix using current value. - * @returns {Object} prefix - * @private - */ - Unit.prototype._bestPrefix = function () { - // find the best prefix value (resulting in the value of which - // the absolute value of the log10 is closest to zero, - // though with a little offset of 1.2 for nicer values: you get a - // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ... - var absValue = Math.abs(this.value / this.unit.value); - var bestPrefix = PREFIX_NONE; - var bestDiff = Math.abs( - Math.log(absValue / bestPrefix.value) / Math.LN10 - 1.2); - - var prefixes = this.unit.prefixes; - for (var p in prefixes) { - if (prefixes.hasOwnProperty(p)) { - var prefix = prefixes[p]; - if (prefix.scientific) { - var diff = Math.abs( - Math.log(absValue / prefix.value) / Math.LN10 - 1.2); - - if (diff < bestDiff) { - bestPrefix = prefix; - bestDiff = diff; - } - } - } - } - - return bestPrefix; - }; - - var PREFIXES = { - NONE: { - '': {name: '', value: 1, scientific: true} - }, - SHORT: { - '': {name: '', value: 1, scientific: true}, - - 'da': {name: 'da', value: 1e1, scientific: false}, - 'h': {name: 'h', value: 1e2, scientific: false}, - 'k': {name: 'k', value: 1e3, scientific: true}, - 'M': {name: 'M', value: 1e6, scientific: true}, - 'G': {name: 'G', value: 1e9, scientific: true}, - 'T': {name: 'T', value: 1e12, scientific: true}, - 'P': {name: 'P', value: 1e15, scientific: true}, - 'E': {name: 'E', value: 1e18, scientific: true}, - 'Z': {name: 'Z', value: 1e21, scientific: true}, - 'Y': {name: 'Y', value: 1e24, scientific: true}, - - 'd': {name: 'd', value: 1e-1, scientific: false}, - 'c': {name: 'c', value: 1e-2, scientific: false}, - 'm': {name: 'm', value: 1e-3, scientific: true}, - 'u': {name: 'u', value: 1e-6, scientific: true}, - 'n': {name: 'n', value: 1e-9, scientific: true}, - 'p': {name: 'p', value: 1e-12, scientific: true}, - 'f': {name: 'f', value: 1e-15, scientific: true}, - 'a': {name: 'a', value: 1e-18, scientific: true}, - 'z': {name: 'z', value: 1e-21, scientific: true}, - 'y': {name: 'y', value: 1e-24, scientific: true} - }, - LONG: { - '': {name: '', value: 1, scientific: true}, - - 'deca': {name: 'deca', value: 1e1, scientific: false}, - 'hecto': {name: 'hecto', value: 1e2, scientific: false}, - 'kilo': {name: 'kilo', value: 1e3, scientific: true}, - 'mega': {name: 'mega', value: 1e6, scientific: true}, - 'giga': {name: 'giga', value: 1e9, scientific: true}, - 'tera': {name: 'tera', value: 1e12, scientific: true}, - 'peta': {name: 'peta', value: 1e15, scientific: true}, - 'exa': {name: 'exa', value: 1e18, scientific: true}, - 'zetta': {name: 'zetta', value: 1e21, scientific: true}, - 'yotta': {name: 'yotta', value: 1e24, scientific: true}, - - 'deci': {name: 'deci', value: 1e-1, scientific: false}, - 'centi': {name: 'centi', value: 1e-2, scientific: false}, - 'milli': {name: 'milli', value: 1e-3, scientific: true}, - 'micro': {name: 'micro', value: 1e-6, scientific: true}, - 'nano': {name: 'nano', value: 1e-9, scientific: true}, - 'pico': {name: 'pico', value: 1e-12, scientific: true}, - 'femto': {name: 'femto', value: 1e-15, scientific: true}, - 'atto': {name: 'atto', value: 1e-18, scientific: true}, - 'zepto': {name: 'zepto', value: 1e-21, scientific: true}, - 'yocto': {name: 'yocto', value: 1e-24, scientific: true} - }, - SQUARED: { - '': {name: '', value: 1, scientific: true}, - - 'da': {name: 'da', value: 1e2, scientific: false}, - 'h': {name: 'h', value: 1e4, scientific: false}, - 'k': {name: 'k', value: 1e6, scientific: true}, - 'M': {name: 'M', value: 1e12, scientific: true}, - 'G': {name: 'G', value: 1e18, scientific: true}, - 'T': {name: 'T', value: 1e24, scientific: true}, - 'P': {name: 'P', value: 1e30, scientific: true}, - 'E': {name: 'E', value: 1e36, scientific: true}, - 'Z': {name: 'Z', value: 1e42, scientific: true}, - 'Y': {name: 'Y', value: 1e48, scientific: true}, - - 'd': {name: 'd', value: 1e-2, scientific: false}, - 'c': {name: 'c', value: 1e-4, scientific: false}, - 'm': {name: 'm', value: 1e-6, scientific: true}, - 'u': {name: 'u', value: 1e-12, scientific: true}, - 'n': {name: 'n', value: 1e-18, scientific: true}, - 'p': {name: 'p', value: 1e-24, scientific: true}, - 'f': {name: 'f', value: 1e-30, scientific: true}, - 'a': {name: 'a', value: 1e-36, scientific: true}, - 'z': {name: 'z', value: 1e-42, scientific: true}, - 'y': {name: 'y', value: 1e-42, scientific: true} - }, - CUBIC: { - '': {name: '', value: 1, scientific: true}, - - 'da': {name: 'da', value: 1e3, scientific: false}, - 'h': {name: 'h', value: 1e6, scientific: false}, - 'k': {name: 'k', value: 1e9, scientific: true}, - 'M': {name: 'M', value: 1e18, scientific: true}, - 'G': {name: 'G', value: 1e27, scientific: true}, - 'T': {name: 'T', value: 1e36, scientific: true}, - 'P': {name: 'P', value: 1e45, scientific: true}, - 'E': {name: 'E', value: 1e54, scientific: true}, - 'Z': {name: 'Z', value: 1e63, scientific: true}, - 'Y': {name: 'Y', value: 1e72, scientific: true}, - - 'd': {name: 'd', value: 1e-3, scientific: false}, - 'c': {name: 'c', value: 1e-6, scientific: false}, - 'm': {name: 'm', value: 1e-9, scientific: true}, - 'u': {name: 'u', value: 1e-18, scientific: true}, - 'n': {name: 'n', value: 1e-27, scientific: true}, - 'p': {name: 'p', value: 1e-36, scientific: true}, - 'f': {name: 'f', value: 1e-45, scientific: true}, - 'a': {name: 'a', value: 1e-54, scientific: true}, - 'z': {name: 'z', value: 1e-63, scientific: true}, - 'y': {name: 'y', value: 1e-72, scientific: true} - }, - BINARY_SHORT: { - '': {name: '', value: 1, scientific: true}, - 'k': {name: 'k', value: 1e3, scientific: true}, - 'M': {name: 'M', value: 1e6, scientific: true}, - 'G': {name: 'G', value: 1e9, scientific: true}, - 'T': {name: 'T', value: 1e12, scientific: true}, - 'P': {name: 'P', value: 1e15, scientific: true}, - 'E': {name: 'E', value: 1e18, scientific: true}, - 'Z': {name: 'Z', value: 1e21, scientific: true}, - 'Y': {name: 'Y', value: 1e24, scientific: true}, - - 'Ki': {name: 'Ki', value: 1024, scientific: true}, - 'Mi': {name: 'Mi', value: Math.pow(1024, 2), scientific: true}, - 'Gi': {name: 'Gi', value: Math.pow(1024, 3), scientific: true}, - 'Ti': {name: 'Ti', value: Math.pow(1024, 4), scientific: true}, - 'Pi': {name: 'Pi', value: Math.pow(1024, 5), scientific: true}, - 'Ei': {name: 'Ei', value: Math.pow(1024, 6), scientific: true}, - 'Zi': {name: 'Zi', value: Math.pow(1024, 7), scientific: true}, - 'Yi': {name: 'Yi', value: Math.pow(1024, 8), scientific: true} - }, - BINARY_LONG: { - '': {name: '', value: 1, scientific: true}, - 'kilo': {name: 'kilo', value: 1e3, scientific: true}, - 'mega': {name: 'mega', value: 1e6, scientific: true}, - 'giga': {name: 'giga', value: 1e9, scientific: true}, - 'tera': {name: 'tera', value: 1e12, scientific: true}, - 'peta': {name: 'peta', value: 1e15, scientific: true}, - 'exa': {name: 'exa', value: 1e18, scientific: true}, - 'zetta': {name: 'zetta', value: 1e21, scientific: true}, - 'yotta': {name: 'yotta', value: 1e24, scientific: true}, - - 'kibi': {name: 'kibi', value: 1024, scientific: true}, - 'mebi': {name: 'mebi', value: Math.pow(1024, 2), scientific: true}, - 'gibi': {name: 'gibi', value: Math.pow(1024, 3), scientific: true}, - 'tebi': {name: 'tebi', value: Math.pow(1024, 4), scientific: true}, - 'pebi': {name: 'pebi', value: Math.pow(1024, 5), scientific: true}, - 'exi': {name: 'exi', value: Math.pow(1024, 6), scientific: true}, - 'zebi': {name: 'zebi', value: Math.pow(1024, 7), scientific: true}, - 'yobi': {name: 'yobi', value: Math.pow(1024, 8), scientific: true} - } - }; - - var PREFIX_NONE = {name: '', value: 1, scientific: true}; - - var BASE_UNITS = { - NONE: {}, - - LENGTH: {}, // meter - MASS: {}, // kilogram - TIME: {}, // second - CURRENT: {}, // ampere - TEMPERATURE: {}, // kelvin - LUMINOUS_INTENSITY: {}, // candela - AMOUNT_OF_SUBSTANCE: {}, // mole - - FORCE: {}, // Newton - SURFACE: {}, // m2 - VOLUME: {}, // m3 - ANGLE: {}, // rad - BIT: {} // bit (digital) - }; - - var BASE_UNIT_NONE = {}; - - var UNIT_NONE = {name: '', base: BASE_UNIT_NONE, value: 1, offset: 0}; - - var UNITS = { - // length - meter: {name: 'meter', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.LONG, value: 1, offset: 0}, - inch: {name: 'inch', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0254, offset: 0}, - foot: {name: 'foot', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.3048, offset: 0}, - yard: {name: 'yard', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.9144, offset: 0}, - mile: {name: 'mile', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1609.344, offset: 0}, - link: {name: 'link', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.201168, offset: 0}, - rod: {name: 'rod', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 5.029210, offset: 0}, - chain: {name: 'chain', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 20.1168, offset: 0}, - angstrom: {name: 'angstrom', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1e-10, offset: 0}, - - m: {name: 'm', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, - 'in': {name: 'in', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0254, offset: 0}, - ft: {name: 'ft', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.3048, offset: 0}, - yd: {name: 'yd', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.9144, offset: 0}, - mi: {name: 'mi', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 1609.344, offset: 0}, - li: {name: 'li', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.201168, offset: 0}, - rd: {name: 'rd', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 5.029210, offset: 0}, - ch: {name: 'ch', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 20.1168, offset: 0}, - mil: {name: 'mil', base: BASE_UNITS.LENGTH, prefixes: PREFIXES.NONE, value: 0.0000254, offset: 0}, // 1/1000 inch - - // Surface - m2: {name: 'm2', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.SQUARED, value: 1, offset: 0}, - sqin: {name: 'sqin', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.00064516, offset: 0}, // 645.16 mm2 - sqft: {name: 'sqft', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.09290304, offset: 0}, // 0.09290304 m2 - sqyd: {name: 'sqyd', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 0.83612736, offset: 0}, // 0.83612736 m2 - sqmi: {name: 'sqmi', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 2589988.110336, offset: 0}, // 2.589988110336 km2 - sqrd: {name: 'sqrd', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 25.29295, offset: 0}, // 25.29295 m2 - sqch: {name: 'sqch', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 404.6873, offset: 0}, // 404.6873 m2 - sqmil: {name: 'sqmil', base: BASE_UNITS.SURFACE, prefixes: PREFIXES.NONE, value: 6.4516e-10, offset: 0}, // 6.4516 * 10^-10 m2 - - // Volume - m3: {name: 'm3', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.CUBIC, value: 1, offset: 0}, - L: {name: 'L', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, // litre - l: {name: 'l', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, // litre - litre: {name: 'litre', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.LONG, value: 0.001, offset: 0}, - cuin: {name: 'cuin', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 1.6387064e-5, offset: 0}, // 1.6387064e-5 m3 - cuft: {name: 'cuft', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.028316846592, offset: 0}, // 28.316 846 592 L - cuyd: {name: 'cuyd', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.764554857984, offset: 0}, // 764.554 857 984 L - teaspoon: {name: 'teaspoon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000005, offset: 0}, // 5 mL - tablespoon: {name: 'tablespoon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000015, offset: 0}, // 15 mL - //{name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL // not possible, we have already another cup - drop: {name: 'drop', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 5e-8, offset: 0}, // 0.05 mL = 5e-8 m3 - gtt: {name: 'gtt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 5e-8, offset: 0}, // 0.05 mL = 5e-8 m3 - - // Liquid volume - minim: {name: 'minim', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL - fluiddram: {name: 'fluiddram', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0000036966911, offset: 0}, // 3.696691 mL - fluidounce: {name: 'fluidounce', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00002957353, offset: 0}, // 29.57353 mL - gill: {name: 'gill', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0001182941, offset: 0}, // 118.2941 mL - cc: {name: 'cc', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 1e-6, offset: 0}, // 1e-6 L - cup: {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0002365882, offset: 0}, // 236.5882 mL - pint: {name: 'pint', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0004731765, offset: 0}, // 473.1765 mL - quart: {name: 'quart', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0009463529, offset: 0}, // 946.3529 mL - gallon: {name: 'gallon', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.003785412, offset: 0}, // 3.785412 L - beerbarrel: {name: 'beerbarrel', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1173478, offset: 0}, // 117.3478 L - oilbarrel: {name: 'oilbarrel', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1589873, offset: 0}, // 158.9873 L - hogshead: {name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L - - //{name: 'min', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00000006161152, offset: 0}, // 0.06161152 mL // min is already in use as minute - fldr: {name: 'fldr', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0000036966911, offset: 0}, // 3.696691 mL - floz: {name: 'floz', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.00002957353, offset: 0}, // 29.57353 mL - gi: {name: 'gi', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0001182941, offset: 0}, // 118.2941 mL - cp: {name: 'cp', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0002365882, offset: 0}, // 236.5882 mL - pt: {name: 'pt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0004731765, offset: 0}, // 473.1765 mL - qt: {name: 'qt', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.0009463529, offset: 0}, // 946.3529 mL - gal: {name: 'gal', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.003785412, offset: 0}, // 3.785412 L - bbl: {name: 'bbl', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1173478, offset: 0}, // 117.3478 L - obl: {name: 'obl', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.1589873, offset: 0}, // 158.9873 L - //{name: 'hogshead', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.2384810, offset: 0}, // 238.4810 L // TODO: hh? - - // Mass - g: {name: 'g', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 0.001, offset: 0}, - gram: {name: 'gram', base: BASE_UNITS.MASS, prefixes: PREFIXES.LONG, value: 0.001, offset: 0}, - - ton: {name: 'ton', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 907.18474, offset: 0}, - tonne: {name: 'tonne', base: BASE_UNITS.MASS, prefixes: PREFIXES.SHORT, value: 1000, offset: 0}, - - grain: {name: 'grain', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 64.79891e-6, offset: 0}, - dram: {name: 'dram', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 1.7718451953125e-3, offset: 0}, - ounce: {name: 'ounce', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 28.349523125e-3, offset: 0}, - poundmass: {name: 'poundmass', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 453.59237e-3, offset: 0}, - hundredweight: {name: 'hundredweight', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 45.359237, offset: 0}, - stick: {name: 'stick', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 115e-3, offset: 0}, - - gr: {name: 'gr', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 64.79891e-6, offset: 0}, - dr: {name: 'dr', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 1.7718451953125e-3, offset: 0}, - oz: {name: 'oz', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 28.349523125e-3, offset: 0}, - lbm: {name: 'lbm', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 453.59237e-3, offset: 0}, - cwt: {name: 'cwt', base: BASE_UNITS.MASS, prefixes: PREFIXES.NONE, value: 45.359237, offset: 0}, - - // Time - s: {name: 's', base: BASE_UNITS.TIME, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, - min: {name: 'min', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 60, offset: 0}, - h: {name: 'h', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 3600, offset: 0}, - second: {name: 'second', base: BASE_UNITS.TIME, prefixes: PREFIXES.LONG, value: 1, offset: 0}, - sec: {name: 'sec', base: BASE_UNITS.TIME, prefixes: PREFIXES.LONG, value: 1, offset: 0}, - minute: {name: 'minute', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 60, offset: 0}, - hour: {name: 'hour', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 3600, offset: 0}, - day: {name: 'day', base: BASE_UNITS.TIME, prefixes: PREFIXES.NONE, value: 86400, offset: 0}, - - // Angle - rad: {name: 'rad', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888 - deg: {name: 'deg', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 0.017453292519943295769236907684888, offset: 0}, - // grad = rad / (2*pi) * 400 = rad / 0.015707963267948966192313216916399 - grad: {name: 'grad', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 0.015707963267948966192313216916399, offset: 0}, - // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793 - cycle: {name: 'cycle', base: BASE_UNITS.ANGLE, prefixes: PREFIXES.NONE, value: 6.2831853071795864769252867665793, offset: 0}, - - // Electric current - A: {name: 'A', base: BASE_UNITS.CURRENT, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, - ampere: {name: 'ampere', base: BASE_UNITS.CURRENT, prefixes: PREFIXES.LONG, value: 1, offset: 0}, - - // Temperature - // K(C) = °C + 273.15 - // K(F) = (°F + 459.67) / 1.8 - // K(R) = °R / 1.8 - K: {name: 'K', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - degC: {name: 'degC', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 273.15}, - degF: {name: 'degF', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 459.67}, - degR: {name: 'degR', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 0}, - kelvin: {name: 'kelvin', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - celsius: {name: 'celsius', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1, offset: 273.15}, - fahrenheit: {name: 'fahrenheit', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 459.67}, - rankine: {name: 'rankine', base: BASE_UNITS.TEMPERATURE, prefixes: PREFIXES.NONE, value: 1/1.8, offset: 0}, - - // amount of substance - mol: {name: 'mol', base: BASE_UNITS.AMOUNT_OF_SUBSTANCE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - mole: {name: 'mole', base: BASE_UNITS.AMOUNT_OF_SUBSTANCE, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - - // luminous intensity - cd: {name: 'cd', base: BASE_UNITS.LUMINOUS_INTENSITY, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - candela: {name: 'candela', base: BASE_UNITS.LUMINOUS_INTENSITY, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - // TODO: units STERADIAN - //{name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - //{name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0}, - - // Force - N: {name: 'N', base: BASE_UNITS.FORCE, prefixes: PREFIXES.SHORT, value: 1, offset: 0}, - newton: {name: 'newton', base: BASE_UNITS.FORCE, prefixes: PREFIXES.LONG, value: 1, offset: 0}, - lbf: {name: 'lbf', base: BASE_UNITS.FORCE, prefixes: PREFIXES.NONE, value: 4.4482216152605, offset: 0}, - poundforce: {name: 'poundforce', base: BASE_UNITS.FORCE, prefixes: PREFIXES.NONE, value: 4.4482216152605, offset: 0}, - - // Binary - b: {name: 'b', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_SHORT, value: 1, offset: 0}, - bits: {name: 'bits', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_LONG, value: 1, offset: 0}, - B: {name: 'B', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_SHORT, value: 8, offset: 0}, - bytes: {name: 'bytes', base: BASE_UNITS.BIT, prefixes: PREFIXES.BINARY_LONG, value: 8, offset: 0} - }; - - // plurals - var PLURALS = { - meters: 'meter', - inches: 'inch', - feet: 'foot', - yards: 'yard', - miles: 'mile', - links: 'link', - rods: 'rod', - chains: 'chain', - angstroms: 'angstrom', - - litres: 'litre', - teaspoons: 'teaspoon', - tablespoons: 'tablespoon', - minims: 'minim', - fluiddrams: 'fluiddram', - fluidounces: 'fluidounce', - gills: 'gill', - cups: 'cup', - pints: 'pint', - quarts: 'quart', - gallons: 'gallon', - beerbarrels: 'beerbarrel', - oilbarrels: 'oilbarrel', - hogsheads: 'hogshead', - gtts: 'gtt', - - grams: 'gram', - tons: 'ton', - tonnes: 'tonne', - grains: 'grain', - drams: 'dram', - ounces: 'ounce', - poundmasses: 'poundmass', - hundredweights: 'hundredweight', - sticks: 'stick', - - seconds: 'second', - minutes: 'minute', - hours: 'hour', - days: 'day', - - radians: 'rad', - degrees: 'deg', - gradients: 'grad', - cycles: 'cycle', - - amperes: 'ampere', - moles: 'mole' - }; - - for (var name in PLURALS) { - /* istanbul ignore next (we cannot really test next statement) */ - if (PLURALS.hasOwnProperty(name)) { - var unit = UNITS[PLURALS[name]]; - var plural = Object.create(unit); - plural.name = name; - UNITS[name] = plural; - } - } - - // aliases - UNITS.lt = UNITS.l; - UNITS.liter = UNITS.litre; - UNITS.liters = UNITS.litres; - UNITS.lb = UNITS.lbm; - UNITS.lbs = UNITS.lbm; - - - Unit.PREFIXES = PREFIXES; - Unit.BASE_UNITS = BASE_UNITS; - Unit.UNITS = UNITS; - - // end of unit aliases - - - // exports - module.exports = Unit; + 'use strict'; + + var util = __webpack_require__(171); + var object = util.object; + var string = util.string; + + /** + * Documentation object + * @param {Object} doc Object containing properties: + * {String} name + * {String} category + * {String} description + * {String[]} syntax + * {String[]} examples + * {String[]} seealso + * @constructor + */ + function Help (doc) { + if (!(this instanceof Help)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + if (!doc) throw new Error('Argument "doc" missing'); + + this.doc = doc; + } + + /** + * Test whether a value is an instance of Help + * @param {*} value + * @return {Boolean} isHelp + */ + Help.isHelp = function (value) { + return (value instanceof Help); + }; + + /** + * Generate readable description from a Help object + * @param {Object} [math] A math instance, used to evaluate the examples + * @return {String} readableDoc + * @private + */ + Help.prototype.toText = function (math) { + var doc = this.doc || {}; + var desc = '\n'; + + if (doc.name) { + desc += 'Name: ' + doc.name + '\n\n'; + } + if (doc.category) { + desc += 'Category: ' + doc.category + '\n\n'; + } + if (doc.description) { + desc += 'Description:\n ' + doc.description + '\n\n'; + } + if (doc.syntax) { + desc += 'Syntax:\n ' + doc.syntax.join('\n ') + '\n\n'; + } + if (doc.examples) { + var parser = math && math.parser(); + desc += 'Examples:\n'; + for (var i = 0; i < doc.examples.length; i++) { + var expr = doc.examples[i]; + desc += ' ' + expr + '\n'; + + if (parser) { + var res; + try { + res = parser.eval(expr); + } + catch (e) { + res = e; + } + if (res !== undefined && !(res instanceof Help)) { + desc += ' ' + string.format(res, {precision: 14}) + '\n'; + } + } + } + desc += '\n'; + } + if (doc.seealso) { + desc += 'See also: ' + doc.seealso.join(', ') + '\n'; + } + + return desc; + }; + + /** + * Generate a string representation of the Help object + * @return {String} Returns a string + * @private + */ + Help.prototype.toString = function () { + return this.toText(); + }; + + /** + * Export the help object to JSON + */ + Help.prototype.toJSON = function () { + var obj = object.clone(this.doc); + obj.mathjs = 'Help'; + return obj; + }; + + /** + * Instantiate a Help object from a JSON object + * @param {Object} json + * @returns {Help} Returns a new Help object + */ + Help.fromJSON = function (json) { + var doc = {}; + for (var prop in json) { + if (prop !== 'mathjs') { // ignore mathjs field + doc[prop] = json[prop]; + } + } + return new Help(doc); + }; + + /** + * Returns a string representation of the Help object + */ + Help.prototype.valueOf = Help.prototype.toString; + + // exports + module.exports = Help; /***/ }, /* 9 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var util = __webpack_require__(164); - var object = util.object; - var string = util.string; - - /** - * Documentation object - * @param {Object} doc Object containing properties: - * {String} name - * {String} category - * {String} description - * {String[]} syntax - * {String[]} examples - * {String[]} seealso - * @constructor - */ - function Help (doc) { - if (!(this instanceof Help)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (!doc) throw new Error('Argument "doc" missing'); - - this.doc = doc; - } - - /** - * Test whether a value is an instance of Help - * @param {*} value - * @return {Boolean} isHelp - */ - Help.isHelp = function (value) { - return (value instanceof Help); - }; - - /** - * Generate readable description from a Help object - * @param {Object} [math] A math instance, used to evaluate the examples - * @return {String} readableDoc - * @private - */ - Help.prototype.toText = function (math) { - var doc = this.doc || {}; - var desc = '\n'; - - if (doc.name) { - desc += 'Name: ' + doc.name + '\n\n'; - } - if (doc.category) { - desc += 'Category: ' + doc.category + '\n\n'; - } - if (doc.description) { - desc += 'Description:\n ' + doc.description + '\n\n'; - } - if (doc.syntax) { - desc += 'Syntax:\n ' + doc.syntax.join('\n ') + '\n\n'; - } - if (doc.examples) { - var parser = math && math.parser(); - desc += 'Examples:\n'; - for (var i = 0; i < doc.examples.length; i++) { - var expr = doc.examples[i]; - desc += ' ' + expr + '\n'; - - if (parser) { - var res; - try { - res = parser.eval(expr); - } - catch (e) { - res = e; - } - if (res !== undefined && !(res instanceof Help)) { - desc += ' ' + string.format(res, {precision: 14}) + '\n'; - } - } - } - desc += '\n'; - } - if (doc.seealso) { - desc += 'See also: ' + doc.seealso.join(', ') + '\n'; - } - - return desc; - }; - - /** - * Generate a string representation of the Help object - * @return {String} Returns a string - * @private - */ - Help.prototype.toString = function () { - return this.toText(); - }; - - /** - * Export the help object to JSON - */ - Help.prototype.toJSON = function () { - var obj = object.clone(this.doc); - obj.mathjs = 'Help'; - return obj; - }; - - /** - * Instantiate a Help object from a JSON object - * @param {Object} json - * @returns {Help} Returns a new Help object - */ - Help.fromJSON = function (json) { - var doc = {}; - for (var prop in json) { - if (prop !== 'mathjs') { // ignore mathjs field - doc[prop] = json[prop]; - } - } - return new Help(doc); - }; - - /** - * Returns a string representation of the Help object - */ - Help.prototype.valueOf = Help.prototype.toString; - - // exports - module.exports = Help; + 'use strict'; + + /** + * A ResultSet contains a list or results + * @param {Array} entries + * @constructor + */ + function ResultSet(entries) { + if (!(this instanceof ResultSet)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.entries = entries || []; + } + + /** + * Returns the array with results hold by this ResultSet + * @returns {Array} entries + */ + ResultSet.prototype.valueOf = function () { + return this.entries; + }; + + /** + * Returns the stringified results of the ResultSet + * @returns {String} string + */ + ResultSet.prototype.toString = function () { + return '[' + this.entries.join(', ') + ']'; + }; + + /** + * Get a JSON representation of the ResultSet + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "ResultSet", "entries": [...]}` + */ + ResultSet.prototype.toJSON = function () { + return { + mathjs: 'ResultSet', + entries: this.entries + }; + }; + + /** + * Instantiate a ResultSet from a JSON object + * @param {Object} json A JSON object structured as: + * `{"mathjs": "ResultSet", "entries": [...]}` + * @return {ResultSet} + */ + ResultSet.fromJSON = function (json) { + return new ResultSet(json.entries); + }; + + module.exports = ResultSet; /***/ }, /* 10 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * A ResultSet contains a list or results - * @param {Array} entries - * @constructor - */ - function ResultSet(entries) { - if (!(this instanceof ResultSet)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.entries = entries || []; - } - - /** - * Returns the array with results hold by this ResultSet - * @returns {Array} entries - */ - ResultSet.prototype.valueOf = function () { - return this.entries; - }; - - /** - * Returns the stringified results of the ResultSet - * @returns {String} string - */ - ResultSet.prototype.toString = function () { - return '[' + this.entries.join(', ') + ']'; - }; - - /** - * Get a JSON representation of the ResultSet - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "ResultSet", "entries": [...]}` - */ - ResultSet.prototype.toJSON = function () { - return { - mathjs: 'ResultSet', - entries: this.entries - }; - }; - - /** - * Instantiate a ResultSet from a JSON object - * @param {Object} json A JSON object structured as: - * `{"mathjs": "ResultSet", "entries": [...]}` - * @return {ResultSet} - */ - ResultSet.fromJSON = function (json) { - return new ResultSet(json.entries); - }; - - module.exports = ResultSet; + var Decimal = __webpack_require__(350); + var digits = __webpack_require__(175).digits; + + function factory (type, config, load, typed) { + var BigNumber = Decimal.constructor(config); + + /** + * Get a JSON representation of a BigNumber containing + * type information + * @returns {Object} Returns a JSON object structured as: + * `{"mathjs": "BigNumber", "value": "0.2"}` + */ + BigNumber.prototype.toJSON = function () { + return { + mathjs: 'BigNumber', + value: this.toString() + }; + }; + + /** + * Instantiate a BigNumber from a JSON object + * @param {Object} json a JSON object structured as: + * `{"mathjs": "BigNumber", "value": "0.2"}` + * @return {BigNumber} + */ + BigNumber.fromJSON = function (json) { + return new BigNumber(json.value); + }; + + // TODO: remove BigNumber.convert as soon as it's deprecated + // extend BigNumber with a function convert + if (typeof BigNumber.convert !== 'function') { + /** + * Try to convert a Number in to a BigNumber. + * If the number has 15 or mor significant digits, the Number cannot be + * converted to BigNumber and will return the original number. + * @param {Number} number + * @return {BigNumber | Number} bignumber + */ + BigNumber.convert = function(number) { + if (digits(number) > 15) { + return number; + } + else { + return new BigNumber(number); + } + }; + } + else { + throw new Error('Cannot add function convert to BigNumber: function already exists'); + } + + return BigNumber; + } + + exports.name = 'BigNumber'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 11 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var object = __webpack_require__(2); - var bignumber = __webpack_require__(166); - var Complex = __webpack_require__(4); - var BigNumber = math.type.BigNumber; - - math['true'] = true; - math['false'] = false; - math['null'] = null; - math['uninitialized'] = __webpack_require__(167).UNINITIALIZED; - - if (config.number === 'bignumber') { - math['Infinity'] = new BigNumber(Infinity); - math['NaN'] = new BigNumber(NaN); - - object.lazy(math, 'pi', function () {return bignumber.pi(config.precision)}); - object.lazy(math, 'tau', function () {return bignumber.tau(config.precision)}); - object.lazy(math, 'e', function () {return bignumber.e(config.precision)}); - object.lazy(math, 'phi', function () {return bignumber.phi(config.precision)}); // golden ratio, (1+sqrt(5))/2 - - // uppercase constants (for compatibility with built-in Math) - object.lazy(math, 'E', function () {return math.e;}); - object.lazy(math, 'LN2', function () {return new BigNumber(2).ln();}); - object.lazy(math, 'LN10', function () {return new BigNumber(10).ln()}); - object.lazy(math, 'LOG2E', function () {return new BigNumber(1).div(new BigNumber(2).ln());}); - object.lazy(math, 'LOG10E', function () {return new BigNumber(1).div(new BigNumber(10).ln())}); - object.lazy(math, 'PI', function () {return math.pi}); - object.lazy(math, 'SQRT1_2', function () {return new BigNumber('0.5').sqrt()}); - object.lazy(math, 'SQRT2', function () {return new BigNumber(2).sqrt()}); - } - else { - math['Infinity'] = Infinity; - math['NaN'] = NaN; - - math.pi = Math.PI; - math.tau = Math.PI * 2; - math.e = Math.E; - math.phi = 1.61803398874989484820458683436563811772030917980576286213545; // golden ratio, (1+sqrt(5))/2 - - // uppercase constants (for compatibility with built-in Math) - math.E = math.e; - math.LN2 = Math.LN2; - math.LN10 = Math.LN10; - math.LOG2E = Math.LOG2E; - math.LOG10E = Math.LOG10E; - math.PI = math.pi; - math.SQRT1_2 = Math.SQRT1_2; - math.SQRT2 = Math.SQRT2; - } - - // complex i - math.i = new Complex(0, 1); - - // meta information - math.version = __webpack_require__(168); - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var smaller = load(__webpack_require__(118)); + var larger = load(__webpack_require__(116)); + + var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0); + + function FibonacciHeap() { + if (!(this instanceof FibonacciHeap)) + throw new SyntaxError('Constructor must be called with the new operator'); + + // initialize fields + this._minimum = null; + this._size = 0; + } + + /** + * Inserts a new data element into the heap. No heap consolidation is + * performed at this time, the new node is simply inserted into the root + * list of this heap. Running time: O(1) actual. + */ + FibonacciHeap.prototype.insert = function (key, value) { + // create node + var node = { + key: key, + value: value, + degree: 0 + }; + // check we have a node in the minimum + if (this._minimum) { + // minimum node + var minimum = this._minimum; + // update left & right of node + node.left = minimum; + node.right = minimum.right; + minimum.right = node; + node.right.left = node; + // update minimum node in heap if needed + if (smaller(key, minimum.key)) { + // node has a smaller key, use it as minimum + this._minimum = node; + } + } + else { + // set left & right + node.left = node; + node.right = node; + // this is the first node + this._minimum = node; + } + // increment number of nodes in heap + this._size++; + // return node + return node; + }; + + /** + * Returns the number of nodes in heap. Running time: O(1) actual. + */ + FibonacciHeap.prototype.size = function () { + return this._size; + }; + + /** + * Removes all elements from this heap. + */ + FibonacciHeap.prototype.clear = function () { + this._minimum = null; + this._size = 0; + }; + + /** + * Returns true if the heap is empty, otherwise false. + */ + FibonacciHeap.prototype.isEmpty = function () { + return !!this._minimum; + }; + + /** + * Extracts the node with minimum key from heap. Amortized running + * time: O(log n). + */ + FibonacciHeap.prototype.extractMinimum = function () { + // node to remove + var node = this._minimum; + // check we have a minimum + if (node === null) + return node; + // current minimum + var minimum = this._minimum; + // get number of children + var numberOfChildren = node.degree; + // pointer to the first child + var x = node.child; + // for each child of node do... + while (numberOfChildren > 0) { + // store node in right side + var tempRight = x.right; + // remove x from child list + x.left.right = x.right; + x.right.left = x.left; + // add x to root list of heap + x.left = minimum; + x.right = minimum.right; + minimum.right = x; + x.right.left = x; + // set Parent[x] to null + x.parent = null; + x = tempRight; + numberOfChildren--; + } + // remove node from root list of heap + node.left.right = node.right; + node.right.left = node.left; + // update minimum + if (node == node.right) { + // empty + minimum = null; + } + else { + // update minimum + minimum = node.right; + // we need to update the pointer to the root with minimum key + minimum = _findMinimumNode(minimum, this._size); + } + // decrement size of heap + this._size--; + // update minimum + this._minimum = minimum; + // return node + return node; + }; + + /** + * Removes a node from the heap given the reference to the node. The trees + * in the heap will be consolidated, if necessary. This operation may fail + * to remove the correct element if there are nodes with key value -Infinity. + * Running time: O(log n) amortized. + */ + FibonacciHeap.prototype.remove = function (node) { + // decrease key value + this._minimum = _decreaseKey(this._minimum, node, null); + // remove the smallest + this.extractMinimum(); + }; + + /** + * Decreases the key value for a heap node, given the new value to take on. + * The structure of the heap may be changed and will not be consolidated. + * Running time: O(1) amortized. + */ + var _decreaseKey = function (minimum, node, key) { + // set node key + node.key = key; + // get parent node + var parent = node.parent; + if (parent && smaller(node.key, parent.key)) { + // remove node from parent + _cut(minimum, node, parent); + // remove all nodes from parent to the root parent + _cascadingCut(minimum, parent); + } + // update minimum node if needed + if (smaller(node.key, minimum.key)) + minimum = node; + // return minimum + return minimum; + }; + + /** + * The reverse of the link operation: removes node from the child list of parent. + * This method assumes that min is non-null. Running time: O(1). + */ + var _cut = function (minimum, node, parent) { + // remove node from parent children and decrement Degree[parent] + node.left.right = node.right; + node.right.left = node.left; + parent.degree--; + // reset y.child if necessary + if (parent.child == node) + parent.child = node.right; + // remove child if degree is 0 + if (parent.degree === 0) + parent.child = null; + // add node to root list of heap + node.left = minimum; + node.right = minimum.right; + minimum.right = node; + node.right.left = node; + // set parent[node] to null + node.parent = null; + // set mark[node] to false + node.mark = false; + }; + + /** + * Performs a cascading cut operation. This cuts node from its parent and then + * does the same for its parent, and so on up the tree. + * Running time: O(log n); O(1) excluding the recursion. + */ + var _cascadingCut= function (minimum, node) { + // store parent node + var parent = node.parent; + // if there's a parent... + if (!parent) + return; + // if node is unmarked, set it marked + if (!node.mark) { + node.mark = true; + } + else { + // it's marked, cut it from parent + _cut(minimum, node, parent); + // cut its parent as well + _cascadingCut(parent); + } + }; + + /** + * Make the first node a child of the second one. Running time: O(1) actual. + */ + var _linkNodes = function (node, parent) { + // remove node from root list of heap + node.left.right = node.right; + node.right.left = node.left; + // make node a Child of parent + node.parent = parent; + if (!parent.child) { + parent.child = node; + node.right = node; + node.left = node; + } + else { + node.left = parent.child; + node.right = parent.child.right; + parent.child.right = node; + node.right.left = node; + } + // increase degree[parent] + parent.degree++; + // set mark[node] false + node.mark = false; + }; + + var _findMinimumNode = function (minimum, size) { + // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree + var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1; + // create list with initial capacity + var array = new Array(arraySize); + // find the number of root nodes. + var numRoots = 0; + var x = minimum; + if (x) { + numRoots++; + x = x.right; + while (x !== minimum) { + numRoots++; + x = x.right; + } + } + // vars + var y; + // For each node in root list do... + while (numRoots > 0) { + // access this node's degree.. + var d = x.degree; + // get next node + var next = x.right; + // check if there is a node already in array with the same degree + while (true) { + // get node with the same degree is any + y = array[d]; + if (!y) + break; + // make one node with the same degree a child of the other, do this based on the key value. + if (larger(x.key, y.key)) { + var temp = y; + y = x; + x = temp; + } + // make y a child of x + _linkNodes(y, x); + // we have handled this degree, go to next one. + array[d] = null; + d++; + } + // save this node for later when we might encounter another of the same degree. + array[d] = x; + // move forward through list. + x = next; + numRoots--; + } + // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[]. + minimum = null; + // loop nodes in array + for (var i = 0; i < arraySize; i++) { + // get current node + y = array[i]; + if (!y) + continue; + // check if we have a linked list + if (minimum) { + // First remove node from root list. + y.left.right = y.right; + y.right.left = y.left; + // now add to root list, again. + y.left = minimum; + y.right = minimum.right; + minimum.right = y; + y.right.left = y; + // check if this is a new min. + if (smaller(y.key, minimum.key)) + minimum = y; + } + else + minimum = y; + } + return minimum; + }; + + return FibonacciHeap; + } + + exports.name = 'FibonacciHeap'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 12 */ /***/ function(module, exports, __webpack_require__) { - var BigNumber = __webpack_require__(336); - - // FIXME: replace all require('decimal.js') with require('./BigNumber'). - - /** - * Get a JSON representation of a BigNumber containing - * type information - * @returns {Object} Returns a JSON object structured as: - * `{"mathjs": "BigNumber", "value": "0.2"}` - */ - BigNumber.prototype.toJSON = function () { - return { - mathjs: 'BigNumber', - value: this.toString() - }; - }; - - /** - * Instantiate a BigNumber from a JSON object - * @param {Object} json a JSON object structured as: - * `{"mathjs": "BigNumber", "value": "0.2"}` - * @return {BigNumber} - */ - BigNumber.fromJSON = function (json) { - return new BigNumber(json.value); - }; - - module.exports = BigNumber; + 'use strict'; + + // TODO: change to exports.create = function () {...} + module.exports = function () { + var string = __webpack_require__(176); + + /** + * @constructor Chain + * Wrap any value in a chain, allowing to perform chained operations on + * the value. + * + * All methods available in the math.js library can be called upon the chain, + * and then will be evaluated with the value itself as first argument. + * The chain can be closed by executing chain.done(), which will return + * the final value. + * + * The Chain has a number of special functions: + * - done() Finalize the chained operation and return the + * chain's value. + * - valueOf() The same as done() + * - toString() Returns a string representation of the chain's value. + * + * @param {*} [value] + */ + function Chain (value) { + if (!(this instanceof Chain)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + if (value instanceof Chain) { + this.value = value.value; + } + else { + this.value = value; + } + } + + /** + * Close the chain. Returns the final value. + * Does the same as method valueOf() + * @returns {*} value + */ + Chain.prototype.done = function () { + return this.value; + }; + + /** + * Close the chain. Returns the final value. + * Does the same as method done() + * @returns {*} value + */ + Chain.prototype.valueOf = function () { + return this.value; + }; + + /** + * Get a string representation of the value in the chain + * @returns {String} + */ + Chain.prototype.toString = function () { + return string.format(this.value); + }; + + /** + * Create a proxy method for the chain + * @param {String} name + * @param {*} value The value or function to be proxied + */ + function createProxy(name, value) { + var slice = Array.prototype.slice; + if (typeof value === 'function') { + // a function + Chain.prototype[name] = function () { + var args = [this.value].concat(slice.call(arguments, 0)); + return new Chain(value.apply(this, args)); + } + } + else { + // a constant + Chain.prototype[name] = new Chain(value); + } + } + + /** + * Create a proxy for a single method, or an object with multiple methods. + * Example usage: + * + * Chain.createProxy('add', function add (x, y) {...}); + * Chain.createProxy({ + * add: function add (x, y) {...}, + * subtract: function subtract (x, y) {...} + * } + * + * + * @param {String | Object} arg0 A function name (string), or an object with + * methods + * @param {*} [arg1] Function or value, when arg0 is a name + */ + Chain.createProxy = function (arg0, arg1) { + if (typeof arg0 === 'string') { + // createProxy(name, value) + createProxy(arg0, arg1); + } + else { + // createProxy(values) + for (var prop in arg0) { + if (arg0.hasOwnProperty(prop)) { + createProxy(prop, arg0[prop]); + } + } + } + }; + + return Chain; + }; /***/ }, /* 13 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - exports.ArgumentsError = __webpack_require__(169); - exports.DimensionError = __webpack_require__(165); - exports.IndexError = __webpack_require__(170); - exports.UnsupportedTypeError = __webpack_require__(171); - - // TODO: implement an InvalidValueError? + 'use strict'; + + var util = __webpack_require__(171); + + var ArgumentsError = __webpack_require__(177); + + var isString = util.string.isString; + + var ArrayNode = __webpack_require__(178); + var AssignmentNode = __webpack_require__(179); + var BlockNode = __webpack_require__(180); + var ConditionalNode = __webpack_require__(181); + var ConstantNode = __webpack_require__(182); + var FunctionAssignmentNode = __webpack_require__(183); + var IndexNode = __webpack_require__(184); + var OperatorNode = __webpack_require__(185); + var FunctionNode = __webpack_require__(186); + var RangeNode = __webpack_require__(187); + var SymbolNode = __webpack_require__(188); + var UpdateNode = __webpack_require__(189); + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Parse an expression. Returns a node tree, which can be evaluated by + * invoking node.eval(); + * + * Syntax: + * + * parse(expr) + * parse(expr, options) + * parse([expr1, expr2, expr3, ...]) + * parse([expr1, expr2, expr3, ...], options) + * + * Example: + * + * var node = parse('sqrt(3^2 + 4^2)'); + * node.compile(math).eval(); // 5 + * + * var scope = {a:3, b:4} + * var node = parse('a * b'); // 12 + * var code = node.compile(math); + * code.eval(scope); // 12 + * scope.a = 5; + * code.eval(scope); // 20 + * + * var nodes = math.parse(['a = 3', 'b = 4', 'a * b']); + * nodes[2].compile(math).eval(); // 12 + * + * @param {String | String[] | Matrix} expr + * @param {{nodes: Object}} [options] Available options: + * - `nodes` a set of custom nodes + * @return {Node | Node[]} node + * @throws {Error} + */ + function parse (expr, options) { + if (arguments.length != 1 && arguments.length != 2) { + throw new ArgumentsError('parse', arguments.length, 1, 2); + } + + // pass extra nodes + extra_nodes = (options && options.nodes) ? options.nodes : {}; + + if (isString(expr)) { + // parse a single expression + expression = expr; + return parseStart(); + } + else if (Array.isArray(expr) || expr instanceof type.Matrix) { + // parse an array or matrix with expressions + return collection.deepMap(expr, function (elem) { + if (!isString(elem)) throw new TypeError('String expected'); + + expression = elem; + return parseStart(); + }); + } + else { + // oops + throw new TypeError('String or matrix expected'); + } + } + + // token types enumeration + var TOKENTYPE = { + NULL : 0, + DELIMITER : 1, + NUMBER : 2, + SYMBOL : 3, + UNKNOWN : 4 + }; + + // map with all delimiters + var DELIMITERS = { + ',': true, + '(': true, + ')': true, + '[': true, + ']': true, + '\"': true, + ';': true, + + '+': true, + '-': true, + '*': true, + '.*': true, + '/': true, + './': true, + '%': true, + '^': true, + '.^': true, + '~': true, + '!': true, + '&': true, + '|': true, + '^|': true, + '\'': true, + '=': true, + ':': true, + '?': true, + + '==': true, + '!=': true, + '<': true, + '>': true, + '<=': true, + '>=': true, + + '<<': true, + '>>': true, + '>>>': true + }; + + // map with all named delimiters + var NAMED_DELIMITERS = { + 'mod': true, + 'to': true, + 'in': true, + 'and': true, + 'xor': true, + 'or': true, + 'not': true + }; + + var extra_nodes = {}; // current extra nodes + var expression = ''; // current expression + var index = 0; // current index in expr + var c = ''; // current token character in expr + var token = ''; // current token + var token_type = TOKENTYPE.NULL; // type of the token + var nesting_level = 0; // level of nesting inside parameters, used to ignore newline characters + var conditional_level = null; // when a conditional is being parsed, the level of the conditional is stored here + + /** + * Get the first character from the expression. + * The character is stored into the char c. If the end of the expression is + * reached, the function puts an empty string in c. + * @private + */ + function first() { + index = 0; + c = expression.charAt(0); + nesting_level = 0; + conditional_level = null; + } + + /** + * Get the next character from the expression. + * The character is stored into the char c. If the end of the expression is + * reached, the function puts an empty string in c. + * @private + */ + function next() { + index++; + c = expression.charAt(index); + } + + /** + * Preview the next character from the expression. + * @return {String} cNext + * @private + */ + function nextPreview() { + return expression.charAt(index + 1); + } + + /** + * Preview the second next character from the expression. + * @return {String} cNext + * @private + */ + function nextNextPreview() { + return expression.charAt(index + 2); + } + + /** + * Get next token in the current string expr. + * The token and token type are available as token and token_type + * @private + */ + function getToken() { + token_type = TOKENTYPE.NULL; + token = ''; + + // skip over whitespaces + // space, tab, and newline when inside parameters + while (c == ' ' || c == '\t' || (c == '\n' && nesting_level)) { + // TODO: also take '\r' carriage return as newline? Or does that give problems on mac? + next(); + } + + // skip comment + if (c == '#') { + while (c != '\n' && c != '') { + next(); + } + } + + // check for end of expression + if (c == '') { + // token is still empty + token_type = TOKENTYPE.DELIMITER; + return; + } + + // check for new line character + if (c == '\n' && !nesting_level) { + token_type = TOKENTYPE.DELIMITER; + token = c; + next(); + return; + } + + // check for delimiters consisting of 3 characters + var c2 = c + nextPreview(); + var c3 = c2 + nextNextPreview(); + if (c3.length == 3 && DELIMITERS[c3]) { + token_type = TOKENTYPE.DELIMITER; + token = c3; + next(); + next(); + next(); + return; + } + + // check for delimiters consisting of 2 characters + if (c2.length == 2 && DELIMITERS[c2]) { + token_type = TOKENTYPE.DELIMITER; + token = c2; + next(); + next(); + return; + } + + // check for delimiters consisting of 1 character + if (DELIMITERS[c]) { + token_type = TOKENTYPE.DELIMITER; + token = c; + next(); + return; + } + + // check for a number + if (isDigitDot(c)) { + token_type = TOKENTYPE.NUMBER; + + // get number, can have a single dot + if (c == '.') { + token += c; + next(); + + if (!isDigit(c)) { + // this is no legal number, it is just a dot + token_type = TOKENTYPE.UNKNOWN; + } + } + else { + while (isDigit(c)) { + token += c; + next(); + } + if (c == '.') { + token += c; + next(); + } + } + while (isDigit(c)) { + token += c; + next(); + } + + // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4" + c2 = nextPreview(); + if ((c == 'E' || c == 'e') && (isDigit(c2) || c2 == '-' || c2 == '+')) { + token += c; + next(); + + if (c == '+' || c == '-') { + token += c; + next(); + } + + // Scientific notation MUST be followed by an exponent + if (!isDigit(c)) { + // this is no legal number, exponent is missing. + token_type = TOKENTYPE.UNKNOWN; + } + + while (isDigit(c)) { + token += c; + next(); + } + } + + return; + } + + // check for variables, functions, named operators + if (isAlpha(c)) { + while (isAlpha(c) || isDigit(c)) { + token += c; + next(); + } + + if (NAMED_DELIMITERS[token]) { + token_type = TOKENTYPE.DELIMITER; + } + else { + token_type = TOKENTYPE.SYMBOL; + } + + return; + } + + // something unknown is found, wrong characters -> a syntax error + token_type = TOKENTYPE.UNKNOWN; + while (c != '') { + token += c; + next(); + } + throw createSyntaxError('Syntax error in part "' + token + '"'); + } + + /** + * Get next token and skip newline tokens + */ + function getTokenSkipNewline () { + do { + getToken(); + } + while (token == '\n'); + } + + /** + * Open parameters. + * New line characters will be ignored until closeParams() is called + */ + function openParams() { + nesting_level++; + } + + /** + * Close parameters. + * New line characters will no longer be ignored + */ + function closeParams() { + nesting_level--; + } + + /** + * checks if the given char c is a letter (upper or lower case) + * or underscore + * @param {String} c a string with one character + * @return {Boolean} + * @private + */ + function isAlpha (c) { + return ((c >= 'a' && c <= 'z') || + (c >= 'A' && c <= 'Z') || + c == '_'); + } + + /** + * checks if the given char c is a digit or dot + * @param {String} c a string with one character + * @return {Boolean} + * @private + */ + function isDigitDot (c) { + return ((c >= '0' && c <= '9') || + c == '.'); + } + + /** + * checks if the given char c is a digit + * @param {String} c a string with one character + * @return {Boolean} + * @private + */ + function isDigit (c) { + return ((c >= '0' && c <= '9')); + } + + /** + * Start of the parse levels below, in order of precedence + * @return {Node} node + * @private + */ + function parseStart () { + // get the first character in expression + first(); + + getToken(); + + var node = parseBlock(); + + // check for garbage at the end of the expression + // an expression ends with a empty character '' and token_type DELIMITER + if (token != '') { + if (token_type == TOKENTYPE.DELIMITER) { + // user entered a not existing operator like "//" + + // TODO: give hints for aliases, for example with "<>" give as hint " did you mean != ?" + throw createError('Unexpected operator ' + token); + } + else { + throw createSyntaxError('Unexpected part "' + token + '"'); + } + } + + return node; + } + + /** + * Parse a block with expressions. Expressions can be separated by a newline + * character '\n', or by a semicolon ';'. In case of a semicolon, no output + * of the preceding line is returned. + * @return {Node} node + * @private + */ + function parseBlock () { + var node; + var blocks = []; + var visible; + + if (token == '') { + // empty expression + return new ConstantNode('undefined', 'undefined'); + } + + if (token != '\n' && token != ';') { + node = parseFunctionAssignment(); + } + + // TODO: simplify this loop + while (token == '\n' || token == ';') { + if (blocks.length == 0 && node) { + visible = (token != ';'); + blocks.push({ + node: node, + visible: visible + }); + } + + getToken(); + if (token != '\n' && token != ';' && token != '') { + node = parseFunctionAssignment(); + + visible = (token != ';'); + blocks.push({ + node: node, + visible: visible + }); + } + } + + if (blocks.length > 0) { + return new BlockNode(blocks); + } + else { + return node; + } + } + + /** + * Parse a function assignment like "function f(a,b) = a*b" + * @return {Node} node + * @private + */ + function parseFunctionAssignment () { + // TODO: function assignment using keyword 'function' is deprecated since version 0.18.0, cleanup some day + if (token_type == TOKENTYPE.SYMBOL && token == 'function') { + throw createSyntaxError('Deprecated keyword "function". ' + + 'Functions can now be assigned without it, like "f(x) = x^2".'); + } + + return parseAssignment(); + } + + /** + * Assignment of a variable, can be a variable like "a=2.3" or a updating an + * existing variable like "matrix(2,3:5)=[6,7,8]" + * @return {Node} node + * @private + */ + function parseAssignment () { + var name, args, expr, valid; + + var node = parseConditional(); + + if (token == '=') { + if (node instanceof SymbolNode) { + // parse a variable assignment like 'a = 2/3' + name = node.name; + getTokenSkipNewline(); + expr = parseAssignment(); + return new AssignmentNode(name, expr); + } + else if (node instanceof IndexNode) { + // parse a matrix subset assignment like 'A[1,2] = 4' + getTokenSkipNewline(); + expr = parseAssignment(); + return new UpdateNode(node, expr); + } + else if (node instanceof FunctionNode) { + // parse function assignment like 'f(x) = x^2' + valid = true; + args = []; + + name = node.name; + node.args.forEach(function (arg, index) { + if (arg instanceof SymbolNode) { + args[index] = arg.name; + } + else { + valid = false; + } + }); + + if (valid) { + getTokenSkipNewline(); + expr = parseAssignment(); + return new FunctionAssignmentNode(name, args, expr); + } + } + + throw createSyntaxError('Invalid left hand side of assignment operator ='); + } + + return node; + } + + /** + * conditional operation + * + * condition ? truePart : falsePart + * + * Note: conditional operator is right-associative + * + * @return {Node} node + * @private + */ + function parseConditional () { + var node = parseLogicalOr(); + + while (token == '?') { + // set a conditional level, the range operator will be ignored as long + // as conditional_level == nesting_level. + var prev = conditional_level; + conditional_level = nesting_level; + getTokenSkipNewline(); + + var condition = node; + var trueExpr = parseLogicalOr(); + + if (token != ':') throw createSyntaxError('False part of conditional expression expected'); + + conditional_level = null; + getTokenSkipNewline(); + + var falseExpr = parseConditional(); // Note: check for conditional operator again, right associativity + + node = new ConditionalNode(condition, trueExpr, falseExpr); + + // restore the previous conditional level + conditional_level = prev; + } + + return node; + } + + /** + * logical or, 'x or y' + * @return {Node} node + * @private + */ + function parseLogicalOr() { + var node = parseLogicalXor(); + + while (token == 'or') { + getTokenSkipNewline(); + node = new OperatorNode('or', 'or', [node, parseLogicalXor()]); + } + + return node; + } + + /** + * logical exclusive or, 'x xor y' + * @return {Node} node + * @private + */ + function parseLogicalXor() { + var node = parseLogicalAnd(); + + while (token == 'xor') { + getTokenSkipNewline(); + node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd()]); + } + + return node; + } + + /** + * logical and, 'x and y' + * @return {Node} node + * @private + */ + function parseLogicalAnd() { + var node = parseBitwiseOr(); + + while (token == 'and') { + getTokenSkipNewline(); + node = new OperatorNode('and', 'and', [node, parseBitwiseOr()]); + } + + return node; + } + + /** + * bitwise or, 'x | y' + * @return {Node} node + * @private + */ + function parseBitwiseOr() { + var node = parseBitwiseXor(); + + while (token == '|') { + getTokenSkipNewline(); + node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor()]); + } + + return node; + } + + /** + * bitwise exclusive or (xor), 'x ^| y' + * @return {Node} node + * @private + */ + function parseBitwiseXor() { + var node = parseBitwiseAnd(); + + while (token == '^|') { + getTokenSkipNewline(); + node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd()]); + } + + return node; + } + + /** + * bitwise and, 'x & y' + * @return {Node} node + * @private + */ + function parseBitwiseAnd () { + var node = parseRelational(); + + while (token == '&') { + getTokenSkipNewline(); + node = new OperatorNode('&', 'bitAnd', [node, parseRelational()]); + } + + return node; + } + + /** + * relational operators + * @return {Node} node + * @private + */ + function parseRelational () { + var node, operators, name, fn, params; + + node = parseShift(); + + operators = { + '==': 'equal', + '!=': 'unequal', + '<': 'smaller', + '>': 'larger', + '<=': 'smallerEq', + '>=': 'largerEq' + }; + while (token in operators) { + name = token; + fn = operators[name]; + + getTokenSkipNewline(); + params = [node, parseShift()]; + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift + * @return {Node} node + * @private + */ + function parseShift () { + var node, operators, name, fn, params; + + node = parseConversion(); + + operators = { + '<<' : 'leftShift', + '>>' : 'rightArithShift', + '>>>' : 'rightLogShift' + }; + + while (token in operators) { + name = token; + fn = operators[name]; + + getTokenSkipNewline(); + params = [node, parseConversion()]; + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * conversion operators 'to' and 'in' + * @return {Node} node + * @private + */ + function parseConversion () { + var node, operators, name, fn, params; + + node = parseRange(); + + operators = { + 'to' : 'to', + 'in' : 'to' // alias of 'to' + }; + + while (token in operators) { + name = token; + fn = operators[name]; + + getTokenSkipNewline(); + params = [node, parseRange()]; + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc + * @return {Node} node + * @private + */ + function parseRange () { + var node, params = []; + + if (token == ':') { + // implicit start=1 (one-based) + node = new ConstantNode('1', 'number'); + } + else { + // explicit start + node = parseAddSubtract(); + } + + if (token == ':' && (conditional_level !== nesting_level)) { + // we ignore the range operator when a conditional operator is being processed on the same level + params.push(node); + + // parse step and end + while (token == ':' && params.length < 3) { + getTokenSkipNewline(); + + if (token == ')' || token == ']' || token == ',' || token == '') { + // implicit end + params.push(new SymbolNode('end')); + } + else { + // explicit end + params.push(parseAddSubtract()); + } + } + + if (params.length == 3) { + // params = [start, step, end] + node = new RangeNode(params[0], params[2], params[1]); // start, end, step + } + else { // length == 2 + // params = [start, end] + node = new RangeNode(params[0], params[1]); // start, end + } + } + + return node; + } + + /** + * add or subtract + * @return {Node} node + * @private + */ + function parseAddSubtract () { + var node, operators, name, fn, params; + + node = parseMultiplyDivide(); + + operators = { + '+': 'add', + '-': 'subtract' + }; + while (token in operators) { + name = token; + fn = operators[name]; + + getTokenSkipNewline(); + params = [node, parseMultiplyDivide()]; + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * multiply, divide, modulus + * @return {Node} node + * @private + */ + function parseMultiplyDivide () { + var node, operators, name, fn, params; + + node = parseUnary(); + + operators = { + '*': 'multiply', + '.*': 'dotMultiply', + '/': 'divide', + './': 'dotDivide', + '%': 'mod', + 'mod': 'mod' + }; + + if (token in operators) { + while (token in operators) { + name = token; + fn = operators[name]; + + getTokenSkipNewline(); + params = [node, parseUnary()]; + node = new OperatorNode(name, fn, params); + } + } + + // parse implicit multiplication + if ((token_type == TOKENTYPE.SYMBOL) || + (token == 'in' && (node instanceof ConstantNode)) || + (token_type == TOKENTYPE.NUMBER && !(node instanceof ConstantNode)) || + (token == '(' || token == '[')) { + // symbol: implicit multiplication like '2a', '(2+3)a', 'a b' + // number: implicit multiplication like '(2+3)2' + // Note: we don't allow implicit multiplication between numbers, + // like '2 3'. I'm not sure whether that is a good idea. + // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)', '2[1,2,3]' + node = new OperatorNode('*', 'multiply', [node, parseMultiplyDivide()]); + } + + return node; + } + + /** + * Unary plus and minus, and logical and bitwise not + * @return {Node} node + * @private + */ + function parseUnary () { + var name, params; + var fn = { + '-': 'unaryMinus', + '+': 'unaryPlus', + '~': 'bitNot', + 'not': 'not' + }[token]; + + if (fn) { + name = token; + + getTokenSkipNewline(); + params = [parseUnary()]; + + return new OperatorNode(name, fn, params); + } + + return parsePow(); + } + + /** + * power + * Note: power operator is right associative + * @return {Node} node + * @private + */ + function parsePow () { + var node, name, fn, params; + + node = parseLeftHandOperators(); + + if (token == '^' || token == '.^') { + name = token; + fn = (name == '^') ? 'pow' : 'dotPow'; + + getTokenSkipNewline(); + params = [node, parseUnary()]; // Go back to unary, we can have '2^-3' + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * Left hand operators: factorial x!, transpose x' + * @return {Node} node + * @private + */ + function parseLeftHandOperators () { + var node, operators, name, fn, params; + + node = parseCustomNodes(); + + operators = { + '!': 'factorial', + '\'': 'transpose' + }; + + while (token in operators) { + name = token; + fn = operators[name]; + + getToken(); + params = [node]; + + node = new OperatorNode(name, fn, params); + } + + return node; + } + + /** + * Parse a custom node handler. A node handler can be used to process + * nodes in a custom way, for example for handling a plot. + * + * A handler must be passed as second argument of the parse function. + * - must extend math.expression.node.Node + * - must contain a function _compile(defs: Object) : String + * - must contain a function find(filter: Object) : Node[] + * - must contain a function toString() : String + * - the constructor is called with a single argument containing all parameters + * + * For example: + * + * nodes = { + * 'plot': PlotHandler + * }; + * + * The constructor of the handler is called as: + * + * node = new PlotHandler(params); + * + * The handler will be invoked when evaluating an expression like: + * + * node = math.parse('plot(sin(x), x)', nodes); + * + * @return {Node} node + * @private + */ + function parseCustomNodes () { + var params = [], handler; + + if (token_type == TOKENTYPE.SYMBOL && extra_nodes[token]) { + handler = extra_nodes[token]; + + getToken(); + + // parse parameters + if (token == '(') { + params = []; + + openParams(); + getToken(); + + if (token != ')') { + params.push(parseConditional()); + + // parse a list with parameters + while (token == ',') { + getToken(); + params.push(parseConditional()); + } + } + + if (token != ')') { + throw createSyntaxError('Parenthesis ) expected'); + } + closeParams(); + getToken(); + } + + // create a new node handler + //noinspection JSValidateTypes + return new handler(params); + } + + return parseSymbol(); + } + + /** + * parse symbols: functions, variables, constants, units + * @return {Node} node + * @private + */ + function parseSymbol () { + var node, name; + + if (token_type == TOKENTYPE.SYMBOL || + (token_type == TOKENTYPE.DELIMITER && token in NAMED_DELIMITERS)) { + name = token; + + getToken(); + + // parse function parameters and matrix index + node = parseFunctions(name); + node = parseIndex(node); + return node; + } + + return parseString(); + } + + /** + * parse a function call like fn(a, b, c) + * @param {string} name Function name + * @return {FunctionNode | SymbolNode} node + * @private + */ + function parseFunctions (name) { + var params; + + if (token == '(') { + params = []; + + openParams(); + getToken(); + + if (token != ')') { + params.push(parseConditional()); + + // parse a list with parameters + while (token == ',') { + getToken(); + params.push(parseConditional()); + } + } + + if (token != ')') { + throw createSyntaxError('Parenthesis ) expected'); + } + closeParams(); + getToken(); + + return new FunctionNode(name, params); + } + + return new SymbolNode(name); + } + + /** + * parse index parameters, enclosed in square brackets [...], for example A[2,3] + * @param {Node} node Node on which to apply the parameters. If there + * are no parameters in the expression, the node + * itself is returned + * @return {Node} node + * @private + */ + function parseIndex (node) { + var params; + + while (token == '[') { + params = []; + + openParams(); + getToken(); + + if (token != ']') { + params.push(parseConditional()); + + // parse a list with parameters + while (token == ',') { + getToken(); + params.push(parseConditional()); + } + } + + if (token != ']') { + throw createSyntaxError('Parenthesis ] expected'); + } + closeParams(); + getToken(); + + node = new IndexNode(node, params); + } + + return node; + } + + /** + * parse a string. + * A string is enclosed by double quotes + * @return {Node} node + * @private + */ + function parseString () { + var node, str, tPrev; + + if (token == '"') { + // string "..." + str = ''; + tPrev = ''; + while (c != '' && (c != '\"' || tPrev == '\\')) { // also handle escape character + str += c; + tPrev = c; + next(); + } + + getToken(); + if (token != '"') { + throw createSyntaxError('End of string " expected'); + } + getToken(); + + // create constant + node = new ConstantNode(str, 'string'); + + // parse index parameters + node = parseIndex(node); + + return node; + } + + return parseMatrix(); + } + + /** + * parse the matrix + * @return {Node} node + * @private + */ + function parseMatrix () { + var array, params, rows, cols; + + if (token == '[') { + // matrix [...] + openParams(); + getToken(); + + if (token != ']') { + // this is a non-empty matrix + var row = parseRow(); + + if (token == ';') { + // 2 dimensional array + rows = 1; + params = [row]; + + // the rows of the matrix are separated by dot-comma's + while (token == ';') { + getToken(); + + params[rows] = parseRow(); + rows++; + } + + if (token != ']') { + throw createSyntaxError('End of matrix ] expected'); + } + closeParams(); + getToken(); + + // check if the number of columns matches in all rows + cols = params[0].nodes.length; + for (var r = 1; r < rows; r++) { + if (params[r].nodes.length != cols) { + throw createError('Column dimensions mismatch ' + + '(' + params[r].nodes.length + ' != ' + cols + ')'); + } + } + + array = new ArrayNode(params); + } + else { + // 1 dimensional vector + if (token != ']') { + throw createSyntaxError('End of matrix ] expected'); + } + closeParams(); + getToken(); + + array = row; + } + } + else { + // this is an empty matrix "[ ]" + closeParams(); + getToken(); + array = new ArrayNode([]); + } + + return array; + } + + return parseNumber(); + } + + /** + * Parse a single comma-separated row from a matrix, like 'a, b, c' + * @return {ArrayNode} node + */ + function parseRow () { + var params = [parseAssignment()]; + var len = 1; + + while (token == ',') { + getToken(); + + // parse expression + params[len] = parseAssignment(); + len++; + } + + return new ArrayNode(params); + } + + /** + * parse a number + * @return {Node} node + * @private + */ + function parseNumber () { + var number; + + if (token_type == TOKENTYPE.NUMBER) { + // this is a number + number = token; + getToken(); + + return new ConstantNode(number, 'number'); + } + + return parseParentheses(); + } + + /** + * parentheses + * @return {Node} node + * @private + */ + function parseParentheses () { + var node; + + // check if it is a parenthesized expression + if (token == '(') { + // parentheses (...) + openParams(); + getToken(); + + node = parseAssignment(); // start again + + if (token != ')') { + throw createSyntaxError('Parenthesis ) expected'); + } + closeParams(); + getToken(); + + return node; + } + + return parseEnd(); + } + + /** + * Evaluated when the expression is not yet ended but expected to end + * @return {Node} res + * @private + */ + function parseEnd () { + if (token == '') { + // syntax error or unexpected end of expression + throw createSyntaxError('Unexpected end of expression'); + } else { + throw createSyntaxError('Value expected'); + } + } + + /** + * Shortcut for getting the current row value (one based) + * Returns the line of the currently handled expression + * @private + */ + /* TODO: implement keeping track on the row number + function row () { + return null; + } + */ + + /** + * Shortcut for getting the current col value (one based) + * Returns the column (position) where the last token starts + * @private + */ + function col () { + return index - token.length + 1; + } + + /** + * Create an error + * @param {String} message + * @return {SyntaxError} instantiated error + * @private + */ + function createSyntaxError (message) { + var c = col(); + var error = new SyntaxError(message + ' (char ' + c + ')'); + error['char'] = c; + + return error; + } + + /** + * Create an error + * @param {String} message + * @return {Error} instantiated error + * @private + */ + function createError (message) { + var c = col(); + var error = new Error(message + ' (char ' + c + ')'); + error['char'] = c; + + return error; + } + + return parse; + }; + + exports.name = 'parse'; + exports.path = 'expression'; + exports.factory = factory; /***/ }, /* 14 */ /***/ function(module, exports, __webpack_require__) { - // utility methods for arrays and matrices - 'use strict'; - - var util = __webpack_require__(164), - - IndexError = __webpack_require__(170), - DimensionError = __webpack_require__(165), - - Matrix = __webpack_require__(7), - - array = util.array, - isArray = util.array.isArray, - isString = util.string.isString; - - /** - * Convert function arguments to an array. Arguments can have the following - * signature: - * fn() - * fn(n) - * fn(m, n, p, ...) - * fn([m, n, p, ...]) - * @param {...Number | Array | Matrix} args - * @returns {Array} array - */ - exports.argsToArray = function(args) { - if (args.length == 0) { - // fn() - return []; - } - else if (args.length == 1) { - // fn(n) - // fn([m, n, p, ...]) - var array = args[0]; - if (array instanceof Matrix) { - array = array.valueOf(); - } - if (!isArray(array)) { - array = [array]; - } - return array; - } - else { - // fn(m, n, p, ...) - return util.array.argsToArray(args); - } - }; - - - /** - * Test whether a value is a collection: an Array or Matrix - * @param {*} x - * @returns {boolean} isCollection - */ - exports.isCollection = function(x) { - return (isArray(x) || (x instanceof Matrix)); - }; - - /** - * Execute the callback function element wise for each element in array and any - * nested array - * Returns an array with the results - * @param {Array | Matrix} array - * @param {function} callback The callback is called with two parameters: - * value1 and value2, which contain the current - * element of both arrays. - * @return {Array | Matrix} res - */ - exports.deepMap = function deepMap(array, callback) { - if (array && (typeof array.map === 'function')) { - return array.map(function (x) { - return deepMap(x, callback); - }); - } - else { - return callback(array); - } - }; - - /** - * Execute the callback function element wise for each entry in two given arrays, - * and for any nested array. Objects can also be scalar objects. - * Returns an array with the results. - * @param {Array | Matrix | Object} array1 - * @param {Array | Matrix | Object} array2 - * @param {function} callback The callback is called with two parameters: - * value1 and value2, which contain the current - * element of both arrays. - * @return {Array | Matrix} res - */ - exports.deepMap2 = function deepMap2(array1, array2, callback) { - var res, len, i; - - if (isArray(array1)) { - if (isArray(array2)) { - // callback(array, array) - if (array1.length != array2.length) { - throw new DimensionError(array1.length, array2.length); - } - - res = []; - len = array1.length; - for (i = 0; i < len; i++) { - res[i] = deepMap2(array1[i], array2[i], callback); - } - } - else if (array2 instanceof Matrix) { - // callback(array, matrix) - res = deepMap2(array1, array2.valueOf(), callback); - return new Matrix(res); - } - else { - // callback(array, object) - res = []; - len = array1.length; - for (i = 0; i < len; i++) { - res[i] = deepMap2(array1[i], array2, callback); - } - } - } - else if (array1 instanceof Matrix) { - if (array2 instanceof Matrix) { - // callback(matrix, matrix) - res = deepMap2(array1.valueOf(), array2.valueOf(), callback); - return new Matrix(res); - } - else { - // callback(matrix, array) - // callback(matrix, object) - res = deepMap2(array1.valueOf(), array2, callback); - return new Matrix(res); - } - } - else { - if (isArray(array2)) { - // callback(object, array) - res = []; - len = array2.length; - for (i = 0; i < len; i++) { - res[i] = deepMap2(array1, array2[i], callback); - } - } - else if (array2 instanceof Matrix) { - // callback(object, matrix) - res = deepMap2(array1, array2.valueOf(), callback); - return new Matrix(res); - } - else { - // callback(object, object) - res = callback(array1, array2); - } - } - - return res; - }; - - /** - * Reduce a given matrix or array to a new matrix or - * array with one less dimension, applying the given - * callback in the selected dimension. - * @param {Array | Matrix} mat - * @param {Number} dim - * @param {function} callback - * @return {Array | Matrix} res - */ - exports.reduce = function(mat, dim, callback) { - var size = isArray(mat) ? array.size(mat) : mat.size(); - if (dim < 0) { - // TODO: would be more clear when throwing a DimensionError here - throw new IndexError(dim); - } - if (dim >= size.length) { - // TODO: would be more clear when throwing a DimensionError here - throw new IndexError(dim, size.length); - } - - if (mat instanceof Matrix) { - return new Matrix(_reduce(mat.valueOf(), dim, callback)); - }else { - return _reduce(mat, dim, callback); - } - }; - - /** - * Recursively reduce a matrix - * @param {Array} mat - * @param {Number} dim - * @param {Function} callback - * @returns {Array} ret - * @private - */ - function _reduce(mat, dim, callback){ - var i, ret, val, tran; - - if(dim<=0){ - if( !isArray(mat[0]) ){ - val = mat[0]; - for(i=1; i}} [options] Available options: - * - `nodes` a set of custom nodes - * @return {Node | Node[]} node - * @throws {Error} - */ - function parse (expr, options) { - if (arguments.length != 1 && arguments.length != 2) { - throw new ArgumentsError('parse', arguments.length, 1, 2); - } - - // pass extra nodes - extra_nodes = (options && options.nodes) ? options.nodes : {}; - - if (isString(expr)) { - // parse a single expression - expression = expr; - return parseStart(); - } - else if (isArray(expr) || expr instanceof Matrix) { - // parse an array or matrix with expressions - return collection.deepMap(expr, function (elem) { - if (!isString(elem)) throw new TypeError('String expected'); - - expression = elem; - return parseStart(); - }); - } - else { - // oops - throw new TypeError('String or matrix expected'); - } - } - - // token types enumeration - var TOKENTYPE = { - NULL : 0, - DELIMITER : 1, - NUMBER : 2, - SYMBOL : 3, - UNKNOWN : 4 - }; - - // map with all delimiters - var DELIMITERS = { - ',': true, - '(': true, - ')': true, - '[': true, - ']': true, - '\"': true, - ';': true, - - '+': true, - '-': true, - '*': true, - '.*': true, - '/': true, - './': true, - '%': true, - '^': true, - '.^': true, - '~': true, - '!': true, - '&': true, - '|': true, - '^|': true, - '\'': true, - '=': true, - ':': true, - '?': true, - - '==': true, - '!=': true, - '<': true, - '>': true, - '<=': true, - '>=': true, - - '<<': true, - '>>': true, - '>>>': true - }; - - // map with all named delimiters - var NAMED_DELIMITERS = { - 'mod': true, - 'to': true, - 'in': true, - 'and': true, - 'xor': true, - 'or': true, - 'not': true - }; - - var extra_nodes = {}; // current extra nodes - var expression = ''; // current expression - var index = 0; // current index in expr - var c = ''; // current token character in expr - var token = ''; // current token - var token_type = TOKENTYPE.NULL; // type of the token - var nesting_level = 0; // level of nesting inside parameters, used to ignore newline characters - var conditional_level = null; // when a conditional is being parsed, the level of the conditional is stored here - - /** - * Get the first character from the expression. - * The character is stored into the char c. If the end of the expression is - * reached, the function puts an empty string in c. - * @private - */ - function first() { - index = 0; - c = expression.charAt(0); - nesting_level = 0; - conditional_level = null; - } - - /** - * Get the next character from the expression. - * The character is stored into the char c. If the end of the expression is - * reached, the function puts an empty string in c. - * @private - */ - function next() { - index++; - c = expression.charAt(index); - } - - /** - * Preview the next character from the expression. - * @return {String} cNext - * @private - */ - function nextPreview() { - return expression.charAt(index + 1); - } - - /** - * Preview the second next character from the expression. - * @return {String} cNext - * @private - */ - function nextNextPreview() { - return expression.charAt(index + 2); - } - - /** - * Get next token in the current string expr. - * The token and token type are available as token and token_type - * @private - */ - function getToken() { - token_type = TOKENTYPE.NULL; - token = ''; - - // skip over whitespaces - // space, tab, and newline when inside parameters - while (c == ' ' || c == '\t' || (c == '\n' && nesting_level)) { - // TODO: also take '\r' carriage return as newline? Or does that give problems on mac? - next(); - } - - // skip comment - if (c == '#') { - while (c != '\n' && c != '') { - next(); - } - } - - // check for end of expression - if (c == '') { - // token is still empty - token_type = TOKENTYPE.DELIMITER; - return; - } - - // check for new line character - if (c == '\n' && !nesting_level) { - token_type = TOKENTYPE.DELIMITER; - token = c; - next(); - return; - } - - // check for delimiters consisting of 3 characters - var c2 = c + nextPreview(); - var c3 = c2 + nextNextPreview(); - if (c3.length == 3 && DELIMITERS[c3]) { - token_type = TOKENTYPE.DELIMITER; - token = c3; - next(); - next(); - next(); - return; - } - - // check for delimiters consisting of 2 characters - if (c2.length == 2 && DELIMITERS[c2]) { - token_type = TOKENTYPE.DELIMITER; - token = c2; - next(); - next(); - return; - } - - // check for delimiters consisting of 1 character - if (DELIMITERS[c]) { - token_type = TOKENTYPE.DELIMITER; - token = c; - next(); - return; - } - - // check for a number - if (isDigitDot(c)) { - token_type = TOKENTYPE.NUMBER; - - // get number, can have a single dot - if (c == '.') { - token += c; - next(); - - if (!isDigit(c)) { - // this is no legal number, it is just a dot - token_type = TOKENTYPE.UNKNOWN; - } - } - else { - while (isDigit(c)) { - token += c; - next(); - } - if (c == '.') { - token += c; - next(); - } - } - while (isDigit(c)) { - token += c; - next(); - } - - // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4" - c2 = nextPreview(); - if ((c == 'E' || c == 'e') && (isDigit(c2) || c2 == '-' || c2 == '+')) { - token += c; - next(); - - if (c == '+' || c == '-') { - token += c; - next(); - } - - // Scientific notation MUST be followed by an exponent - if (!isDigit(c)) { - // this is no legal number, exponent is missing. - token_type = TOKENTYPE.UNKNOWN; - } - - while (isDigit(c)) { - token += c; - next(); - } - } - - return; - } - - // check for variables, functions, named operators - if (isAlpha(c)) { - while (isAlpha(c) || isDigit(c)) { - token += c; - next(); - } - - if (NAMED_DELIMITERS[token]) { - token_type = TOKENTYPE.DELIMITER; - } - else { - token_type = TOKENTYPE.SYMBOL; - } - - return; - } - - // something unknown is found, wrong characters -> a syntax error - token_type = TOKENTYPE.UNKNOWN; - while (c != '') { - token += c; - next(); - } - throw createSyntaxError('Syntax error in part "' + token + '"'); - } - - /** - * Get next token and skip newline tokens - */ - function getTokenSkipNewline () { - do { - getToken(); - } - while (token == '\n'); - } - - /** - * Open parameters. - * New line characters will be ignored until closeParams() is called - */ - function openParams() { - nesting_level++; - } - - /** - * Close parameters. - * New line characters will no longer be ignored - */ - function closeParams() { - nesting_level--; - } - - /** - * checks if the given char c is a letter (upper or lower case) - * or underscore - * @param {String} c a string with one character - * @return {Boolean} - * @private - */ - function isAlpha (c) { - return ((c >= 'a' && c <= 'z') || - (c >= 'A' && c <= 'Z') || - c == '_'); - } - - /** - * checks if the given char c is a digit or dot - * @param {String} c a string with one character - * @return {Boolean} - * @private - */ - function isDigitDot (c) { - return ((c >= '0' && c <= '9') || - c == '.'); - } - - /** - * checks if the given char c is a digit - * @param {String} c a string with one character - * @return {Boolean} - * @private - */ - function isDigit (c) { - return ((c >= '0' && c <= '9')); - } - - /** - * Start of the parse levels below, in order of precedence - * @return {Node} node - * @private - */ - function parseStart () { - // get the first character in expression - first(); - - getToken(); - - var node = parseBlock(); - - // check for garbage at the end of the expression - // an expression ends with a empty character '' and token_type DELIMITER - if (token != '') { - if (token_type == TOKENTYPE.DELIMITER) { - // user entered a not existing operator like "//" - - // TODO: give hints for aliases, for example with "<>" give as hint " did you mean != ?" - throw createError('Unexpected operator ' + token); - } - else { - throw createSyntaxError('Unexpected part "' + token + '"'); - } - } - - return node; - } - - /** - * Parse a block with expressions. Expressions can be separated by a newline - * character '\n', or by a semicolon ';'. In case of a semicolon, no output - * of the preceding line is returned. - * @return {Node} node - * @private - */ - function parseBlock () { - var node; - var blocks = []; - var visible; - - if (token == '') { - // empty expression - return new ConstantNode('undefined', 'undefined'); - } - - if (token != '\n' && token != ';') { - node = parseFunctionAssignment(); - } - - // TODO: simplify this loop - while (token == '\n' || token == ';') { - if (blocks.length == 0 && node) { - visible = (token != ';'); - blocks.push({ - node: node, - visible: visible - }); - } - - getToken(); - if (token != '\n' && token != ';' && token != '') { - node = parseFunctionAssignment(); - - visible = (token != ';'); - blocks.push({ - node: node, - visible: visible - }); - } - } - - if (blocks.length > 0) { - return new BlockNode(blocks); - } - else { - return node; - } - } - - /** - * Parse a function assignment like "function f(a,b) = a*b" - * @return {Node} node - * @private - */ - function parseFunctionAssignment () { - // TODO: function assignment using keyword 'function' is deprecated since version 0.18.0, cleanup some day - if (token_type == TOKENTYPE.SYMBOL && token == 'function') { - throw createSyntaxError('Deprecated keyword "function". ' + - 'Functions can now be assigned without it, like "f(x) = x^2".'); - } - - return parseAssignment(); - } - - /** - * Assignment of a variable, can be a variable like "a=2.3" or a updating an - * existing variable like "matrix(2,3:5)=[6,7,8]" - * @return {Node} node - * @private - */ - function parseAssignment () { - var name, args, expr, valid; - - var node = parseConditional(); - - if (token == '=') { - if (node instanceof SymbolNode) { - // parse a variable assignment like 'a = 2/3' - name = node.name; - getTokenSkipNewline(); - expr = parseAssignment(); - return new AssignmentNode(name, expr); - } - else if (node instanceof IndexNode) { - // parse a matrix subset assignment like 'A[1,2] = 4' - getTokenSkipNewline(); - expr = parseAssignment(); - return new UpdateNode(node, expr); - } - else if (node instanceof FunctionNode) { - // parse function assignment like 'f(x) = x^2' - valid = true; - args = []; - - name = node.name; - node.args.forEach(function (arg, index) { - if (arg instanceof SymbolNode) { - args[index] = arg.name; - } - else { - valid = false; - } - }); - - if (valid) { - getTokenSkipNewline(); - expr = parseAssignment(); - return new FunctionAssignmentNode(name, args, expr); - } - } - - throw createSyntaxError('Invalid left hand side of assignment operator ='); - } - - return node; - } - - /** - * conditional operation - * - * condition ? truePart : falsePart - * - * Note: conditional operator is right-associative - * - * @return {Node} node - * @private - */ - function parseConditional () { - var node = parseLogicalOr(); - - while (token == '?') { - // set a conditional level, the range operator will be ignored as long - // as conditional_level == nesting_level. - var prev = conditional_level; - conditional_level = nesting_level; - getTokenSkipNewline(); - - var condition = node; - var trueExpr = parseLogicalOr(); - - if (token != ':') throw createSyntaxError('False part of conditional expression expected'); - - conditional_level = null; - getTokenSkipNewline(); - - var falseExpr = parseConditional(); // Note: check for conditional operator again, right associativity - - node = new ConditionalNode(condition, trueExpr, falseExpr); - - // restore the previous conditional level - conditional_level = prev; - } - - return node; - } - - /** - * logical or, 'x or y' - * @return {Node} node - * @private - */ - function parseLogicalOr() { - var node = parseLogicalXor(); - - while (token == 'or') { - getTokenSkipNewline(); - node = new OperatorNode('or', 'or', [node, parseLogicalXor()]); - } - - return node; - } - - /** - * logical exclusive or, 'x xor y' - * @return {Node} node - * @private - */ - function parseLogicalXor() { - var node = parseLogicalAnd(); - - while (token == 'xor') { - getTokenSkipNewline(); - node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd()]); - } - - return node; - } - - /** - * logical and, 'x and y' - * @return {Node} node - * @private - */ - function parseLogicalAnd() { - var node = parseBitwiseOr(); - - while (token == 'and') { - getTokenSkipNewline(); - node = new OperatorNode('and', 'and', [node, parseBitwiseOr()]); - } - - return node; - } - - /** - * bitwise or, 'x | y' - * @return {Node} node - * @private - */ - function parseBitwiseOr() { - var node = parseBitwiseXor(); - - while (token == '|') { - getTokenSkipNewline(); - node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor()]); - } - - return node; - } - - /** - * bitwise exclusive or (xor), 'x ^| y' - * @return {Node} node - * @private - */ - function parseBitwiseXor() { - var node = parseBitwiseAnd(); - - while (token == '^|') { - getTokenSkipNewline(); - node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd()]); - } - - return node; - } - - /** - * bitwise and, 'x & y' - * @return {Node} node - * @private - */ - function parseBitwiseAnd () { - var node = parseRelational(); - - while (token == '&') { - getTokenSkipNewline(); - node = new OperatorNode('&', 'bitAnd', [node, parseRelational()]); - } - - return node; - } - - /** - * relational operators - * @return {Node} node - * @private - */ - function parseRelational () { - var node, operators, name, fn, params; - - node = parseShift(); - - operators = { - '==': 'equal', - '!=': 'unequal', - '<': 'smaller', - '>': 'larger', - '<=': 'smallerEq', - '>=': 'largerEq' - }; - while (token in operators) { - name = token; - fn = operators[name]; - - getTokenSkipNewline(); - params = [node, parseShift()]; - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift - * @return {Node} node - * @private - */ - function parseShift () { - var node, operators, name, fn, params; - - node = parseConversion(); - - operators = { - '<<' : 'leftShift', - '>>' : 'rightArithShift', - '>>>' : 'rightLogShift' - }; - - while (token in operators) { - name = token; - fn = operators[name]; - - getTokenSkipNewline(); - params = [node, parseConversion()]; - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * conversion operators 'to' and 'in' - * @return {Node} node - * @private - */ - function parseConversion () { - var node, operators, name, fn, params; - - node = parseRange(); - - operators = { - 'to' : 'to', - 'in' : 'to' // alias of 'to' - }; - - while (token in operators) { - name = token; - fn = operators[name]; - - getTokenSkipNewline(); - params = [node, parseRange()]; - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc - * @return {Node} node - * @private - */ - function parseRange () { - var node, params = []; - - if (token == ':') { - // implicit start=1 (one-based) - node = new ConstantNode('1', 'number'); - } - else { - // explicit start - node = parseAddSubtract(); - } - - if (token == ':' && (conditional_level !== nesting_level)) { - // we ignore the range operator when a conditional operator is being processed on the same level - params.push(node); - - // parse step and end - while (token == ':' && params.length < 3) { - getTokenSkipNewline(); - - if (token == ')' || token == ']' || token == ',' || token == '') { - // implicit end - params.push(new SymbolNode('end')); - } - else { - // explicit end - params.push(parseAddSubtract()); - } - } - - if (params.length == 3) { - // params = [start, step, end] - node = new RangeNode(params[0], params[2], params[1]); // start, end, step - } - else { // length == 2 - // params = [start, end] - node = new RangeNode(params[0], params[1]); // start, end - } - } - - return node; - } - - /** - * add or subtract - * @return {Node} node - * @private - */ - function parseAddSubtract () { - var node, operators, name, fn, params; - - node = parseMultiplyDivide(); - - operators = { - '+': 'add', - '-': 'subtract' - }; - while (token in operators) { - name = token; - fn = operators[name]; - - getTokenSkipNewline(); - params = [node, parseMultiplyDivide()]; - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * multiply, divide, modulus - * @return {Node} node - * @private - */ - function parseMultiplyDivide () { - var node, operators, name, fn, params; - - node = parseUnary(); - - operators = { - '*': 'multiply', - '.*': 'dotMultiply', - '/': 'divide', - './': 'dotDivide', - '%': 'mod', - 'mod': 'mod' - }; - - if (token in operators) { - while (token in operators) { - name = token; - fn = operators[name]; - - getTokenSkipNewline(); - params = [node, parseUnary()]; - node = new OperatorNode(name, fn, params); - } - } - - // parse implicit multiplication - if ((token_type == TOKENTYPE.SYMBOL) || - (token == 'in' && (node instanceof ConstantNode)) || - (token_type == TOKENTYPE.NUMBER && !(node instanceof ConstantNode)) || - (token == '(' || token == '[')) { - // symbol: implicit multiplication like '2a', '(2+3)a', 'a b' - // number: implicit multiplication like '(2+3)2' - // Note: we don't allow implicit multiplication between numbers, - // like '2 3'. I'm not sure whether that is a good idea. - // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)', '2[1,2,3]' - node = new OperatorNode('*', 'multiply', [node, parseMultiplyDivide()]); - } - - return node; - } - - /** - * Unary plus and minus, and logical and bitwise not - * @return {Node} node - * @private - */ - function parseUnary () { - var name, params; - var fn = { - '-': 'unaryMinus', - '+': 'unaryPlus', - '~': 'bitNot', - 'not': 'not' - }[token]; - - if (fn) { - name = token; - - getTokenSkipNewline(); - params = [parseUnary()]; - - return new OperatorNode(name, fn, params); - } - - return parsePow(); - } - - /** - * power - * Note: power operator is right associative - * @return {Node} node - * @private - */ - function parsePow () { - var node, name, fn, params; - - node = parseLeftHandOperators(); - - if (token == '^' || token == '.^') { - name = token; - fn = (name == '^') ? 'pow' : 'dotPow'; - - getTokenSkipNewline(); - params = [node, parseUnary()]; // Go back to unary, we can have '2^-3' - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * Left hand operators: factorial x!, transpose x' - * @return {Node} node - * @private - */ - function parseLeftHandOperators () { - var node, operators, name, fn, params; - - node = parseCustomNodes(); - - operators = { - '!': 'factorial', - '\'': 'transpose' - }; - - while (token in operators) { - name = token; - fn = operators[name]; - - getToken(); - params = [node]; - - node = new OperatorNode(name, fn, params); - } - - return node; - } - - /** - * Parse a custom node handler. A node handler can be used to process - * nodes in a custom way, for example for handling a plot. - * - * A handler must be passed as second argument of the parse function. - * - must extend math.expression.node.Node - * - must contain a function _compile(defs: Object) : String - * - must contain a function find(filter: Object) : Node[] - * - must contain a function toString() : String - * - the constructor is called with a single argument containing all parameters - * - * For example: - * - * nodes = { - * 'plot': PlotHandler - * }; - * - * The constructor of the handler is called as: - * - * node = new PlotHandler(params); - * - * The handler will be invoked when evaluating an expression like: - * - * node = math.parse('plot(sin(x), x)', nodes); - * - * @return {Node} node - * @private - */ - function parseCustomNodes () { - var params = [], handler; - - if (token_type == TOKENTYPE.SYMBOL && extra_nodes[token]) { - handler = extra_nodes[token]; - - getToken(); - - // parse parameters - if (token == '(') { - params = []; - - openParams(); - getToken(); - - if (token != ')') { - params.push(parseConditional()); - - // parse a list with parameters - while (token == ',') { - getToken(); - params.push(parseConditional()); - } - } - - if (token != ')') { - throw createSyntaxError('Parenthesis ) expected'); - } - closeParams(); - getToken(); - } - - // create a new node handler - //noinspection JSValidateTypes - return new handler(params); - } - - return parseSymbol(); - } - - /** - * parse symbols: functions, variables, constants, units - * @return {Node} node - * @private - */ - function parseSymbol () { - var node, name; - - if (token_type == TOKENTYPE.SYMBOL || - (token_type == TOKENTYPE.DELIMITER && token in NAMED_DELIMITERS)) { - name = token; - - getToken(); - - // parse function parameters and matrix index - node = parseFunctions(name); - node = parseIndex(node); - return node; - } - - return parseString(); - } - - /** - * parse a function call like fn(a, b, c) - * @param {string} name Function name - * @return {FunctionNode | SymbolNode} node - * @private - */ - function parseFunctions (name) { - var params; - - if (token == '(') { - params = []; - - openParams(); - getToken(); - - if (token != ')') { - params.push(parseConditional()); - - // parse a list with parameters - while (token == ',') { - getToken(); - params.push(parseConditional()); - } - } - - if (token != ')') { - throw createSyntaxError('Parenthesis ) expected'); - } - closeParams(); - getToken(); - - return new FunctionNode(name, params); - } - - return new SymbolNode(name); - } - - /** - * parse index parameters, enclosed in square brackets [...], for example A[2,3] - * @param {Node} node Node on which to apply the parameters. If there - * are no parameters in the expression, the node - * itself is returned - * @return {Node} node - * @private - */ - function parseIndex (node) { - var params; - - while (token == '[') { - params = []; - - openParams(); - getToken(); - - if (token != ']') { - params.push(parseConditional()); - - // parse a list with parameters - while (token == ',') { - getToken(); - params.push(parseConditional()); - } - } - - if (token != ']') { - throw createSyntaxError('Parenthesis ] expected'); - } - closeParams(); - getToken(); - - node = new IndexNode(node, params); - } - - return node; - } - - /** - * parse a string. - * A string is enclosed by double quotes - * @return {Node} node - * @private - */ - function parseString () { - var node, str, tPrev; - - if (token == '"') { - // string "..." - str = ''; - tPrev = ''; - while (c != '' && (c != '\"' || tPrev == '\\')) { // also handle escape character - str += c; - tPrev = c; - next(); - } - - getToken(); - if (token != '"') { - throw createSyntaxError('End of string " expected'); - } - getToken(); - - // create constant - node = new ConstantNode(str, 'string'); - - // parse index parameters - node = parseIndex(node); - - return node; - } - - return parseMatrix(); - } - - /** - * parse the matrix - * @return {Node} node - * @private - */ - function parseMatrix () { - var array, params, rows, cols; - - if (token == '[') { - // matrix [...] - openParams(); - getToken(); - - if (token != ']') { - // this is a non-empty matrix - var row = parseRow(); - - if (token == ';') { - // 2 dimensional array - rows = 1; - params = [row]; - - // the rows of the matrix are separated by dot-comma's - while (token == ';') { - getToken(); - - params[rows] = parseRow(); - rows++; - } - - if (token != ']') { - throw createSyntaxError('End of matrix ] expected'); - } - closeParams(); - getToken(); - - // check if the number of columns matches in all rows - cols = params[0].nodes.length; - for (var r = 1; r < rows; r++) { - if (params[r].nodes.length != cols) { - throw createError('Column dimensions mismatch ' + - '(' + params[r].nodes.length + ' != ' + cols + ')'); - } - } - - array = new ArrayNode(params); - } - else { - // 1 dimensional vector - if (token != ']') { - throw createSyntaxError('End of matrix ] expected'); - } - closeParams(); - getToken(); - - array = row; - } - } - else { - // this is an empty matrix "[ ]" - closeParams(); - getToken(); - array = new ArrayNode([]); - } - - return array; - } - - return parseNumber(); - } - - /** - * Parse a single comma-separated row from a matrix, like 'a, b, c' - * @return {ArrayNode} node - */ - function parseRow () { - var params = [parseAssignment()]; - var len = 1; - - while (token == ',') { - getToken(); - - // parse expression - params[len] = parseAssignment(); - len++; - } - - return new ArrayNode(params); - } - - /** - * parse a number - * @return {Node} node - * @private - */ - function parseNumber () { - var number; - - if (token_type == TOKENTYPE.NUMBER) { - // this is a number - number = token; - getToken(); - - return new ConstantNode(number, 'number'); - } - - return parseParentheses(); - } - - /** - * parentheses - * @return {Node} node - * @private - */ - function parseParentheses () { - var node; - - // check if it is a parenthesized expression - if (token == '(') { - // parentheses (...) - openParams(); - getToken(); - - node = parseAssignment(); // start again - - if (token != ')') { - throw createSyntaxError('Parenthesis ) expected'); - } - closeParams(); - getToken(); - - return node; - } - - return parseEnd(); - } - - /** - * Evaluated when the expression is not yet ended but expected to end - * @return {Node} res - * @private - */ - function parseEnd () { - if (token == '') { - // syntax error or unexpected end of expression - throw createSyntaxError('Unexpected end of expression'); - } else { - throw createSyntaxError('Value expected'); - } - } - - /** - * Shortcut for getting the current row value (one based) - * Returns the line of the currently handled expression - * @private - */ - /* TODO: implement keeping track on the row number - function row () { - return null; - } - */ - - /** - * Shortcut for getting the current col value (one based) - * Returns the column (position) where the last token starts - * @private - */ - function col () { - return index - token.length + 1; - } - - /** - * Create an error - * @param {String} message - * @return {SyntaxError} instantiated error - * @private - */ - function createSyntaxError (message) { - var c = col(); - var error = new SyntaxError(message + ' (char ' + c + ')'); - error['char'] = c; - - return error; - } - - /** - * Create an error - * @param {String} message - * @return {Error} instantiated error - * @private - */ - function createError (message) { - var c = col(); - var error = new Error(message + ' (char ' + c + ')'); - error['char'] = c; - - return error; - } - - module.exports = parse; + // constants + exports.e = __webpack_require__(191); + exports.E = __webpack_require__(191); + exports['false'] = __webpack_require__(192); + exports.i = __webpack_require__(193); + exports['Infinity'] = __webpack_require__(194); + exports.LN2 = __webpack_require__(195); + exports.LN10 = __webpack_require__(196); + exports.LOG2E = __webpack_require__(197); + exports.LOG10E = __webpack_require__(198); + exports.NaN = __webpack_require__(199); + exports['null'] = __webpack_require__(200); + exports.pi = __webpack_require__(201); + exports.PI = __webpack_require__(201); + exports.phi = __webpack_require__(202); + exports.SQRT1_2 = __webpack_require__(203); + exports.SQRT2 = __webpack_require__(204); + exports.tau = __webpack_require__(205); + exports['true'] = __webpack_require__(206); + exports.version = __webpack_require__(207); + + // functions - arithmetic + exports.abs = __webpack_require__(219); + exports.add = __webpack_require__(220); + exports.ceil = __webpack_require__(221); + exports.cube = __webpack_require__(222); + exports.divide = __webpack_require__(223); + exports.dotDivide = __webpack_require__(224); + exports.dotMultiply = __webpack_require__(225); + exports.dotPow = __webpack_require__(226); + exports.exp = __webpack_require__(227); + exports.fix = __webpack_require__(228); + exports.floor = __webpack_require__(229); + exports.gcd = __webpack_require__(230); + exports.lcm = __webpack_require__(231); + exports.log = __webpack_require__(232); + exports.log10 = __webpack_require__(233); + exports.mod = __webpack_require__(234); + exports.multiply = __webpack_require__(235); + exports.norm = __webpack_require__(236); + exports.nthRoot = __webpack_require__(237); + exports.pow = __webpack_require__(238); + exports.round = __webpack_require__(239); + exports.sign = __webpack_require__(240); + exports.sqrt = __webpack_require__(241); + exports.square = __webpack_require__(242); + exports.subtract = __webpack_require__(243); + exports.unaryMinus = __webpack_require__(244); + exports.unaryPlus = __webpack_require__(245); + exports.xgcd = __webpack_require__(246); + + // functions - bitwise + exports.bitAnd = __webpack_require__(247); + exports.bitNot = __webpack_require__(248); + exports.bitOr = __webpack_require__(249); + exports.bitXor = __webpack_require__(250); + exports.leftShift = __webpack_require__(251); + exports.rightArithShift = __webpack_require__(252); + exports.rightLogShift = __webpack_require__(253); + + // functions - complex + exports.arg = __webpack_require__(254); + exports.conj = __webpack_require__(255); + exports.re = __webpack_require__(256); + exports.im = __webpack_require__(257); + + // functions - construction + exports.bignumber = __webpack_require__(258); + exports['boolean'] = __webpack_require__(259); + exports.complex = __webpack_require__(260); + exports.index = __webpack_require__(261); + exports.matrix = __webpack_require__(262); + exports.number = __webpack_require__(263); + exports.string = __webpack_require__(264); + exports.unit = __webpack_require__(265); + + // functions - expression + exports['eval'] = __webpack_require__(266); + exports.help = __webpack_require__(267); + + // functions - logical + exports['and'] = __webpack_require__(268); + exports['not'] = __webpack_require__(269); + exports['or'] = __webpack_require__(270); + exports['xor'] = __webpack_require__(271); + + // functions - matrix + exports['concat'] = __webpack_require__(272); + exports.cross = __webpack_require__(273); + exports.det = __webpack_require__(274); + exports.diag = __webpack_require__(275); + exports.dot = __webpack_require__(276); + exports.eye = __webpack_require__(277); + exports.flatten = __webpack_require__(278); + exports.inv = __webpack_require__(279); + exports.ones = __webpack_require__(280); + exports.range = __webpack_require__(281); + exports.resize = __webpack_require__(282); + exports.size = __webpack_require__(283); + exports.squeeze = __webpack_require__(284); + exports.subset = __webpack_require__(285); + exports.trace = __webpack_require__(286); + exports.transpose = __webpack_require__(287); + exports.zeros = __webpack_require__(288); + + // functions - probability + exports.combinations = __webpack_require__(289); + //exports.distribution = require('./function/probability/distribution'); + exports.factorial = __webpack_require__(290); + exports.gamma = __webpack_require__(291); + exports.permutations = __webpack_require__(292); + exports.pickRandom = __webpack_require__(293); + exports.random = __webpack_require__(294); + exports.randomInt = __webpack_require__(295); + + // functions - relational + exports.compare = __webpack_require__(296); + exports.deepEqual = __webpack_require__(297); + exports['equal'] = __webpack_require__(298); + exports.larger = __webpack_require__(299); + exports.largerEq = __webpack_require__(300); + exports.smaller = __webpack_require__(301); + exports.smallerEq = __webpack_require__(302); + exports.unequal = __webpack_require__(303); + + // functions - statistics + exports.max = __webpack_require__(304); + exports.mean = __webpack_require__(305); + exports.median = __webpack_require__(306); + exports.min = __webpack_require__(307); + exports.prod = __webpack_require__(308); + exports.std = __webpack_require__(309); + exports.sum = __webpack_require__(310); + exports['var'] = __webpack_require__(311); + + // functions - trigonometry + exports.acos = __webpack_require__(312); + exports.acosh = __webpack_require__(313); + exports.acot = __webpack_require__(314); + exports.acoth = __webpack_require__(315); + exports.acsc = __webpack_require__(316); + exports.acsch = __webpack_require__(317); + exports.asec = __webpack_require__(318); + exports.asech = __webpack_require__(319); + exports.asin = __webpack_require__(320); + exports.asinh = __webpack_require__(321); + exports.atan = __webpack_require__(322); + exports.atanh = __webpack_require__(323); + exports.atan2 = __webpack_require__(324); + exports.cos = __webpack_require__(325); + exports.cosh = __webpack_require__(326); + exports.cot = __webpack_require__(327); + exports.coth = __webpack_require__(328); + exports.csc = __webpack_require__(329); + exports.csch = __webpack_require__(330); + exports.sec = __webpack_require__(331); + exports.sech = __webpack_require__(332); + exports.sin = __webpack_require__(333); + exports.sinh = __webpack_require__(334); + exports.tan = __webpack_require__(335); + exports.tanh = __webpack_require__(336); + + // functions - units + exports.to = __webpack_require__(337); + + // functions - utils + exports.clone = __webpack_require__(338); + exports.map = __webpack_require__(339); + exports.filter = __webpack_require__(340); + exports.forEach = __webpack_require__(341); + exports.format = __webpack_require__(342); + // exports.print = require('./function/utils/print'); // TODO: add documentation for print as soon as the parser supports objects. + exports['import'] = __webpack_require__(343); + exports.sort = __webpack_require__(344); + exports['typeof'] = __webpack_require__(345); /***/ }, /* 17 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var _parse = __webpack_require__(16); - - /** - * @constructor Parser - * Parser contains methods to evaluate or parse expressions, and has a number - * of convenience methods to get, set, and remove variables from memory. Parser - * keeps a scope containing variables in memory, which is used for all - * evaluations. - * - * Methods: - * var result = parser.eval(expr); // evaluate an expression - * var value = parser.get(name); // retrieve a variable from the parser - * parser.set(name, value); // set a variable in the parser - * parser.remove(name); // clear a variable from the - * // parsers scope - * parser.clear(); // clear the parsers scope - * - * Example usage: - * var parser = new Parser(math); - * // Note: there is a convenience method which can be used instead: - * // var parser = new math.parser(); - * - * // evaluate expressions - * parser.eval('sqrt(3^2 + 4^2)'); // 5 - * parser.eval('sqrt(-4)'); // 2i - * parser.eval('2 inch in cm'); // 5.08 cm - * parser.eval('cos(45 deg)'); // 0.7071067811865476 - * - * // define variables and functions - * parser.eval('x = 7 / 2'); // 3.5 - * parser.eval('x + 3'); // 6.5 - * parser.eval('function f(x, y) = x^y'); // f(x, y) - * parser.eval('f(2, 3)'); // 8 - * - * // get and set variables and functions - * var x = parser.get('x'); // 7 - * var f = parser.get('f'); // function - * var g = f(3, 2); // 9 - * parser.set('h', 500); - * var i = parser.eval('h / 2'); // 250 - * parser.set('hello', function (name) { - * return 'hello, ' + name + '!'; - * }); - * parser.eval('hello("user")'); // "hello, user!" - * - * // clear defined functions and variables - * parser.clear(); - * - * - * @param {Object} math Link to the math.js namespace - */ - function Parser(math) { - if (!(this instanceof Parser)) { - throw new SyntaxError( - 'Constructor must be called with the new operator'); - } - - if (!(math instanceof Object)) { - throw new TypeError('Object expected as parameter math'); - } - - this.math = math; - this.scope = {}; - } - - /** - * Parse an expression and return the parsed function node. - * The node tree can be compiled via `code = node.compile(math)`, - * and the compiled code can be executed as `code.eval([scope])` - * @param {String} expr - * @return {Node} node - * @throws {Error} - */ - Parser.prototype.parse = function (expr) { - throw new Error('Parser.parse is deprecated. Use math.parse instead.'); - }; - - /** - * Parse and compile an expression, return the compiled javascript code. - * The node can be evaluated via code.eval([scope]) - * @param {String} expr - * @return {{eval: function}} code - * @throws {Error} - */ - Parser.prototype.compile = function (expr) { - throw new Error('Parser.compile is deprecated. Use math.compile instead.'); - }; - - /** - * Parse and evaluate the given expression - * @param {String} expr A string containing an expression, for example "2+3" - * @return {*} result The result, or undefined when the expression was empty - * @throws {Error} - */ - Parser.prototype.eval = function (expr) { - // TODO: validate arguments - return _parse(expr) - .compile(this.math) - .eval(this.scope); - }; - - /** - * Get a variable (a function or variable) by name from the parsers scope. - * Returns undefined when not found - * @param {String} name - * @return {* | undefined} value - */ - Parser.prototype.get = function (name) { - // TODO: validate arguments - return this.scope[name]; - }; - - /** - * Set a symbol (a function or variable) by name from the parsers scope. - * @param {String} name - * @param {* | undefined} value - */ - Parser.prototype.set = function (name, value) { - // TODO: validate arguments - return this.scope[name] = value; - }; - - /** - * Remove a variable from the parsers scope - * @param {String} name - */ - Parser.prototype.remove = function (name) { - // TODO: validate arguments - delete this.scope[name]; - }; - - /** - * Clear the scope with variables and functions - */ - Parser.prototype.clear = function () { - for (var name in this.scope) { - if (this.scope.hasOwnProperty(name)) { - delete this.scope[name]; - } - } - }; - - module.exports = Parser; + 'use strict'; + + var util = __webpack_require__(171); + var DimensionError = __webpack_require__(174); + + var array = util.array; + var object = util.object; + var string = util.string; + var number = util.number; + + var isArray = Array.isArray; + var isNumber = util.number.isNumber; + var isInteger = util.number.isInteger; + + var validateIndex = array.validateIndex; + + function factory (type, config, load) { + + var equal = load(__webpack_require__(115)); + + var Index = type.Index; + var BigNumber = type.BigNumber; + var Matrix = type.Matrix; + + /** + * Sparse Matrix implementation. This type implements a Compressed Column Storage format + * for sparse matrices. + */ + function SparseMatrix(data) { + if (!(this instanceof SparseMatrix)) + throw new SyntaxError('Constructor must be called with the new operator'); + + if (data instanceof Matrix) { + // create from matrix + _createFromMatrix(this, data); + } + else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) { + // initialize fields + this._values = data.values; + this._index = data.index; + this._ptr = data.ptr; + this._size = data.size; + } + else if (isArray(data)) { + // create from array + _createFromArray(this, data); + } + else if (data) { + // unsupported type + throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')'); + } + else { + // nothing provided + this._values = []; + this._index = []; + this._ptr = [0]; + this._size = [0]; + } + } + + var _createFromMatrix = function (matrix, source) { + // check matrix type + if (source.type === 'SparseMatrix') { + // clone arrays + matrix._values = source._values ? object.clone(source._values) : undefined; + matrix._index = object.clone(source._index); + matrix._ptr = object.clone(source._ptr); + matrix._size = object.clone(source._size); + } + else { + // build from matrix data + _createFromArray(matrix, source.valueOf()); + } + }; + + var _createFromArray = function (matrix, data) { + // initialize fields + matrix._values = []; + matrix._index = []; + matrix._ptr = []; + // discover rows & columns, do not use math.size() to avoid looping array twice + var rows = data.length; + var columns = 0; + + // check we have rows (empty array) + if (rows > 0) { + // column index + var j = 0; + do { + // store pointer to values index + matrix._ptr.push(matrix._values.length); + // loop rows + for (var i = 0; i < rows; i++) { + // current row + var row = data[i]; + // check row is an array + if (isArray(row)) { + // update columns if needed (only on first column) + if (j ===0 && columns < row.length) + columns = row.length; + // check row has column + if (j < row.length) { + // value + var v = row[j]; + // check value != 0 + if (!equal(v, 0)) { + // store value + matrix._values.push(v); + // index + matrix._index.push(i); + } + } + } + else { + // update columns if needed (only on first column) + if (j === 0 && columns < 1) + columns = 1; + // check value != 0 (row is a scalar) + if (!equal(row, 0)) { + // store value + matrix._values.push(row); + // index + matrix._index.push(i); + } + } + } + // increment index + j++; + } + while (j < columns); + } + // store number of values in ptr + matrix._ptr.push(matrix._values.length); + // size + matrix._size = [rows, columns]; + }; + + SparseMatrix.prototype = new Matrix(); + + SparseMatrix.prototype.type = 'SparseMatrix'; + + /** + * Get the storage format used by the matrix. + * + * Usage: + * var format = matrix.storage() // retrieve storage format + * + * @return {string} The storage format. + */ + SparseMatrix.prototype.storage = function () { + return 'sparse'; + }; + + /** + * Get a subset of the matrix, or replace a subset of the matrix. + * + * Usage: + * var subset = matrix.subset(index) // retrieve subset + * var value = matrix.subset(index, replacement) // replace subset + * + * @param {Index} index + * @param {Array | Maytrix | *} [replacement] + * @param {*} [defaultValue=0] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be filled with zeros. + */ + SparseMatrix.prototype.subset = function (index, replacement, defaultValue) { + // check it is a pattern matrix + if (!this._values) + throw new Error('Cannot invoke subset on a Pattern only matrix'); + + // check arguments + switch (arguments.length) { + case 1: + return _getsubset(this, index); + + // intentional fall through + case 2: + case 3: + return _setsubset(this, index, replacement, defaultValue); + + default: + throw new SyntaxError('Wrong number of arguments'); + } + }; + + var _getsubset = function (matrix, index) { + // check index + if (!(index instanceof Index)) { + throw new TypeError('Invalid index'); + } + + var isScalar = index.isScalar(); + if (isScalar) { + // return a scalar + return matrix.get(index.min()); + } + // validate dimensions + var size = index.size(); + if (size.length != matrix._size.length) { + throw new DimensionError(size.length, matrix._size.length); + } + + // validate if any of the ranges in the index is out of range + var min = index.min(); + var max = index.max(); + for (var i = 0, ii = matrix._size.length; i < ii; i++) { + validateIndex(min[i], matrix._size[i]); + validateIndex(max[i], matrix._size[i]); + } + + // map callback + var callback = function (v) { + // return value + return v; + }; + // get sub-matrix + return _map(matrix, min[0], max[0], min[1], max[1], callback, false); + }; + + var _setsubset = function (matrix, index, submatrix, defaultValue) { + // check index + if (!(index instanceof Index)) { + throw new TypeError('Invalid index'); + } + + // get index size and check whether the index contains a single value + var iSize = index.size(), + isScalar = index.isScalar(); + + // calculate the size of the submatrix, and convert it into an Array if needed + var sSize; + if (submatrix instanceof Matrix) { + // submatrix size + sSize = submatrix.size(); + // use array representation + submatrix = submatrix.toArray(); + } + else { + // get submatrix size (array, scalar) + sSize = array.size(submatrix); + } + + // check index is a scalar + if (isScalar) { + // verify submatrix is a scalar + if (sSize.length !== 0) { + throw new TypeError('Scalar expected'); + } + // set value + matrix.set(index.min(), submatrix, defaultValue); + } + else { + // validate dimensions, index size must be one or two dimensions + if (iSize.length !== 1 && iSize.length !== 2) { + throw new DimensionError(iSize.length, matrix._size.length, '<'); + } + + // check submatrix and index have the same dimensions + if (sSize.length < iSize.length) { + // calculate number of missing outer dimensions + var i = 0; + var outer = 0; + while (iSize[i] === 1 && sSize[i] === 1) { + i++; + } + while (iSize[i] === 1) { + outer++; + i++; + } + // unsqueeze both outer and inner dimensions + submatrix = array.unsqueeze(submatrix, iSize.length, outer, sSize); + } + + // check whether the size of the submatrix matches the index size + if (!object.deepEqual(iSize, sSize)) { + throw new DimensionError(iSize, sSize, '>'); + } + + // offsets + var x0 = index.min()[0]; + var y0 = index.min()[1]; + + // submatrix rows and columns + var m = sSize[0]; + var n = sSize[1]; + + // loop submatrix + for (var x = 0; x < m; x++) { + // loop columns + for (var y = 0; y < n; y++) { + // value at i, j + var v = submatrix[x][y]; + // invoke set (zero value will remove entry from matrix) + matrix.set([x + x0, y + y0], v, defaultValue); + } + } + } + return matrix; + }; + + /** + * Get a single element from the matrix. + * @param {Number[]} index Zero-based index + * @return {*} value + */ + SparseMatrix.prototype.get = function (index) { + if (!isArray(index)) + throw new TypeError('Array expected'); + if (index.length != this._size.length) + throw new DimensionError(index.length, this._size.length); + + // check it is a pattern matrix + if (!this._values) + throw new Error('Cannot invoke get on a Pattern only matrix'); + + // row and column + var i = index[0]; + var j = index[1]; + + // check i, j are valid + validateIndex(i, this._size[0]); + validateIndex(j, this._size[1]); + + // find value index + var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); + // check k is prior to next column k and it is in the correct row + if (k < this._ptr[j + 1] && this._index[k] === i) + return object.clone(this._values[k]); + + return 0; + }; + + /** + * Replace a single element in the matrix. + * @param {Number[]} index Zero-based index + * @param {*} value + * @param {*} [defaultValue] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be set to zero. + * @return {SparseMatrix} self + */ + SparseMatrix.prototype.set = function (index, v, defaultValue) { + if (!isArray(index)) + throw new TypeError('Array expected'); + if (index.length != this._size.length) + throw new DimensionError(index.length, this._size.length); + + // check it is a pattern matrix + if (!this._values) + throw new Error('Cannot invoke set on a Pattern only matrix'); + + // row and column + var i = index[0]; + var j = index[1]; + + // rows & columns + var rows = this._size[0]; + var columns = this._size[1]; + + // check we need to resize matrix + if (i > rows - 1 || j > columns - 1) { + // resize matrix + _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue); + // update rows & columns + rows = this._size[0]; + columns = this._size[1]; + } + + // check i, j are valid + validateIndex(i, rows); + validateIndex(j, columns); + + // find value index + var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index); + // check k is prior to next column k and it is in the correct row + if (k < this._ptr[j + 1] && this._index[k] === i) { + // check value != 0 + if (!equal(v, 0)) { + // update value + this._values[k] = v; + } + else { + // remove value from matrix + _remove(k, j, this._values, this._index, this._ptr); + } + } + else { + // insert value @ (i, j) + _insert(k, i, j, v, this._values, this._index, this._ptr); + } + + return this; + }; + + var _getValueIndex = function(i, top, bottom, index) { + // check row is on the bottom side + if (bottom - top === 0 || i > index[bottom - 1]) + return bottom; + // loop until we find row index + while (top < bottom) { + // point in the middle (fast integer division) + var p = ~~((top + bottom) / 2); + // row @ p + var r = index[p]; + // check we have to look on the top side, bottom side or we found the row + if (i < r) + bottom = p; + else if (i > r) + top = p + 1; + else + return p; + } + return top; + }; + + var _remove = function (k, j, values, index, ptr) { + // remove value @ k + values.splice(k, 1); + index.splice(k, 1); + // update pointers + for (var x = j + 1; x < ptr.length; x++) + ptr[x]--; + }; + + var _insert = function (k, i, j, v, values, index, ptr) { + // insert value + values.splice(k, 0, v); + // update row for k + index.splice(k, 0, i); + // update column pointers + for (var x = j + 1; x < ptr.length; x++) + ptr[x]++; + }; + + /** + * Resize the matrix to the given size. Returns a copy of the matrix when + * `copy=true`, otherwise return the matrix itself (resize in place). + * + * @param {Number[]} size The new size the matrix should have. + * @param {*} [defaultValue=0] Default value, filled in on new entries. + * If not provided, the matrix elements will + * be filled with zeros. + * @param {boolean} [copy] Return a resized copy of the matrix + * + * @return {Matrix} The resized matrix + */ + SparseMatrix.prototype.resize = function (size, defaultValue, copy) { + // validate arguments + if (!isArray(size)) + throw new TypeError('Array expected'); + if (size.length !== 2) + throw new Error('Only two dimensions matrix are supported'); + + // check sizes + size.forEach(function (value) { + if (!number.isNumber(value) || !number.isInteger(value) || value < 0) { + throw new TypeError('Invalid size, must contain positive integers ' + + '(size: ' + string.format(size) + ')'); + } + }); + + // matrix to resize + var m = copy ? this.clone() : this; + // resize matrix + return _resize(m, size[0], size[1], defaultValue); + }; + + var _resize = function (matrix, rows, columns, defaultValue) { + // value to insert at the time of growing matrix + var value = defaultValue || 0; + // should we insert the value? + var ins = !equal(value, 0); + + // old columns and rows + var r = matrix._size[0]; + var c = matrix._size[1]; + + var i, j, k; + + // check we need to increase columns + if (columns > c) { + // loop new columns + for (j = c; j < columns; j++) { + // update matrix._ptr for current column + matrix._ptr[j] = matrix._values.length; + // check we need to insert matrix._values + if (ins) { + // loop rows + for (i = 0; i < r; i++) { + // add new matrix._values + matrix._values.push(value); + // update matrix._index + matrix._index.push(i); + } + } + } + // store number of matrix._values in matrix._ptr + matrix._ptr[columns] = matrix._values.length; + } + else if (columns < c) { + // truncate matrix._ptr + matrix._ptr.splice(columns + 1, c - columns); + // truncate matrix._values and matrix._index + matrix._values.splice(matrix._ptr[columns], matrix._values.length); + matrix._index.splice(matrix._ptr[columns], matrix._index.length); + } + // update columns + c = columns; + + // check we need to increase rows + if (rows > r) { + // check we have to insert values + if (ins) { + // inserts + var n = 0; + // loop columns + for (j = 0; j < c; j++) { + // update matrix._ptr for current column + matrix._ptr[j] = matrix._ptr[j] + n; + // where to insert matrix._values + k = matrix._ptr[j + 1] + n; + // pointer + var p = 0; + // loop new rows, initialize pointer + for (i = r; i < rows; i++, p++) { + // add value + matrix._values.splice(k + p, 0, value); + // update matrix._index + matrix._index.splice(k + p, 0, i); + // increment inserts + n++; + } + } + // store number of matrix._values in matrix._ptr + matrix._ptr[c] = matrix._values.length; + } + } + else if (rows < r) { + // deletes + var d = 0; + // loop columns + for (j = 0; j < c; j++) { + // update matrix._ptr for current column + matrix._ptr[j] = matrix._ptr[j] - d; + // where matrix._values start for next column + var k0 = matrix._ptr[j]; + var k1 = matrix._ptr[j + 1] - d; + // loop matrix._index + for (k = k0; k < k1; k++) { + // row + i = matrix._index[k]; + // check we need to delete value and matrix._index + if (i > rows - 1) { + // remove value + matrix._values.splice(k, 1); + // remove item from matrix._index + matrix._index.splice(k, 1); + // increase deletes + d++; + } + } + } + // update matrix._ptr for current column + matrix._ptr[j] = matrix._values.length; + } + // update matrix._size + matrix._size[0] = rows; + matrix._size[1] = columns; + // return matrix + return matrix; + }; + + /** + * Create a clone of the matrix + * @return {SparseMatrix} clone + */ + SparseMatrix.prototype.clone = function () { + var m = new SparseMatrix({ + values: this._values ? object.clone(this._values) : undefined, + index: object.clone(this._index), + ptr: object.clone(this._ptr), + size: object.clone(this._size) + }); + return m; + }; + + /** + * Retrieve the size of the matrix. + * @returns {Number[]} size + */ + SparseMatrix.prototype.size = function() { + return object.clone(this._size); + }; + + /** + * Create a new matrix with the results of the callback function executed on + * each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + * @param {boolean} [skipZeros] Invoke callback function for non-zero values only. + * + * @return {SparseMatrix} matrix + */ + SparseMatrix.prototype.map = function (callback, skipZeros) { + // check it is a pattern matrix + if (!this._values) + throw new Error('Cannot invoke map on a Pattern only matrix'); + // matrix instance + var me = this; + // rows and columns + var rows = this._size[0]; + var columns = this._size[1]; + // invoke callback + var invoke = function (v, i, j) { + // invoke callback + return callback(v, [i, j], me); + }; + // invoke _map + return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros); + }; + + /** + * Create a new matrix with the results of the callback function executed on the interval + * [minRow..maxRow, minColumn..maxColumn]. + */ + var _map = function (matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) { + // result arrays + var values = []; + var index = []; + var ptr = []; + // invoke callback + var invoke = function (v, x, y) { + // invoke callback + v = callback(v, x, y); + // check value != 0 + if (!equal(v, 0)) { + // store value + values.push(v); + // index + index.push(x); + } + }; + // loop columns + for (var j = minColumn; j <= maxColumn; j++) { + // store pointer to values index + ptr.push(values.length); + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = matrix._ptr[j]; + var k1 = matrix._ptr[j + 1]; + // row pointer + var p = minRow; + // loop k within [k0, k1[ + for (var k = k0; k < k1; k++) { + // row index + var i = matrix._index[k]; + // check i is in range + if (i >= minRow && i <= maxRow) { + // zero values + if (!skipZeros) { + for (var x = p; x < i; x++) + invoke(0, x - minRow, j - minColumn); + } + // value @ k + invoke(matrix._values[k], i - minRow, j - minColumn); + } + // update pointer + p = i + 1; + } + // zero values + if (!skipZeros) { + for (var y = p; y <= maxRow; y++) + invoke(0, y - minRow, j - minColumn); + } + } + // store number of values in ptr + ptr.push(values.length); + // return ccs + return new SparseMatrix({ + values: values, + index: index, + ptr: ptr, + size: [maxRow - minRow + 1, maxColumn - minColumn + 1] + }); + }; + + /** + * Execute a callback function on each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + * @param {boolean} [skipZeros] Invoke callback function for non-zero values only. + */ + SparseMatrix.prototype.forEach = function (callback, skipZeros) { + // check it is a pattern matrix + if (!this._values) + throw new Error('Cannot invoke forEach on a Pattern only matrix'); + // matrix instance + var me = this; + // rows and columns + var rows = this._size[0]; + var columns = this._size[1]; + // loop columns + for (var j = 0; j < columns; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = this._ptr[j]; + var k1 = this._ptr[j + 1]; + // column pointer + var p = 0; + // loop k within [k0, k1[ + for (var k = k0; k < k1; k++) { + // row index + var i = this._index[k]; + // check we need to process zeros + if (!skipZeros) { + // zero values + for (var x = p; x < i; x++) + callback(0, [x, j], me); + } + // value @ k + callback(this._values[k], [i, j], me); + // update pointer + p = i + 1; + } + // check we need to process zeros + if (!skipZeros) { + // zero values + for (var y = p; y < rows; y++) + callback(0, [y, j], me); + } + } + }; + + /** + * Create an Array with a copy of the data of the SparseMatrix + * @returns {Array} array + */ + SparseMatrix.prototype.toArray = function () { + return _toArray(this._values, this._index, this._ptr, this._size, true); + }; + + /** + * Get the primitive value of the SparseMatrix: a two dimensions array + * @returns {Array} array + */ + SparseMatrix.prototype.valueOf = function () { + return _toArray(this._values, this._index, this._ptr, this._size, false); + }; + + var _toArray = function (values, index, ptr, size, copy) { + // rows and columns + var rows = size[0]; + var columns = size[1]; + // result + var a = new Array(rows); + // vars + var i, j; + // initialize array + for (i = 0; i < rows; i++) { + a[i] = new Array(columns); + for (j = 0; j < columns; j++) + a[i][j] = 0; + } + + // loop columns + for (j = 0; j < columns; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = ptr[j]; + var k1 = ptr[j + 1]; + // loop k within [k0, k1[ + for (var k = k0; k < k1; k++) { + // row index + i = index[k]; + // set value (use one for pattern matrix) + a[i][j] = values ? (copy ? object.clone(values[k]) : values[k]) : 1; + } + } + return a; + }; + + /** + * Get a string representation of the matrix, with optional formatting options. + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @returns {String} str + */ + SparseMatrix.prototype.format = function (options) { + // rows and columns + var rows = this._size[0]; + var columns = this._size[1]; + // rows & columns + var str = 'Sparse Matrix [' + string.format(rows, options) + ' x ' + string.format(columns, options) + '] density: ' + string.format(this._index.length / (rows * columns), options) + '\n'; + // loop columns + for (var j = 0; j < columns; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = this._ptr[j]; + var k1 = this._ptr[j + 1]; + // loop k within [k0, k1[ + for (var k = k0; k < k1; k++) { + // row index + var i = this._index[k]; + // append value + str += '\n (' + string.format(i, options) + ', ' + string.format(j, options) + ') ==> ' + (this._values ? string.format(this._values[k], options) : 'X'); + } + } + return str; + }; + + /** + * Get a string representation of the matrix + * @returns {String} str + */ + SparseMatrix.prototype.toString = function () { + return string.format(this.toArray()); + }; + + /** + * Get a JSON representation of the matrix + * @returns {Object} + */ + SparseMatrix.prototype.toJSON = function () { + return { + mathjs: 'SparseMatrix', + values: this._values, + index: this._index, + ptr: this._ptr, + size: this._size + }; + }; + + /** + * Get the kth Matrix diagonal. + * + * @param {Number | BigNumber} [k=0] The kth diagonal where the vector will retrieved. + * + * @returns {Matrix} The matrix vector with the diagonal values. + */ + SparseMatrix.prototype.diagonal = function(k) { + // validate k if any + if (k) { + // convert BigNumber to a number + if (k instanceof BigNumber) + k = k.toNumber(); + // is must be an integer + if (!isNumber(k) || !isInteger(k)) { + throw new TypeError ('The parameter k must be an integer number'); + } + } + else { + // default value + k = 0; + } + + var kSuper = k > 0 ? k : 0; + var kSub = k < 0 ? -k : 0; + + // rows & columns + var rows = this._size[0]; + var columns = this._size[1]; + + // number diagonal values + var n = Math.min(rows - kSub, columns - kSuper); + + // diagonal arrays + var values = []; + var index = []; + var ptr = []; + // initial ptr value + ptr[0] = 0; + // loop columns + for (var j = kSuper; j < columns && values.length < n; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = this._ptr[j]; + var k1 = this._ptr[j + 1]; + // loop x within [k0, k1[ + for (var x = k0; x < k1; x++) { + // row index + var i = this._index[x]; + // check row + if (i === j - kSuper + kSub) { + // value on this column + values.push(object.clone(this._values[x])); + // store row + index[values.length - 1] = i - kSub; + // exit loop + break; + } + } + } + // close ptr + ptr.push(values.length); + // return matrix + return new SparseMatrix({ + values: values, + index: index, + ptr: ptr, + size: [n, 1] + }); + }; + + /** + * Generate a matrix from a JSON object + * @param {Object} json An object structured like + * `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`, + * where mathjs is optional + * @returns {SparseMatrix} + */ + SparseMatrix.fromJSON = function (json) { + return new SparseMatrix(json); + }; + + /** + * Create a diagonal matrix. + * + * @param {Array} size The matrix size. + * @param {Number | Array | Matrix } value The values for the diagonal. + * @param {Number | BigNumber} [k=0] The kth diagonal where the vector will be filled in. + * + * @returns {SparseMatrix} + */ + SparseMatrix.diagonal = function (size, value, k) { + if (!isArray(size)) + throw new TypeError('Array expected, size parameter'); + if (size.length !== 2) + throw new Error('Only two dimensions matrix are supported'); + + // map size & validate + size = size.map(function (s) { + // check it is a big number + if (s instanceof BigNumber) { + // convert it + s = s.toNumber(); + } + // validate arguments + if (!isNumber(s) || !isInteger(s) || s < 1) { + throw new Error('Size values must be positive integers'); + } + return s; + }); + + // validate k if any + if (k) { + // convert BigNumber to a number + if (k instanceof BigNumber) + k = k.toNumber(); + // is must be an integer + if (!isNumber(k) || !isInteger(k)) { + throw new TypeError ('The parameter k must be an integer number'); + } + } + else { + // default value + k = 0; + } + + var kSuper = k > 0 ? k : 0; + var kSub = k < 0 ? -k : 0; + + // rows and columns + var rows = size[0]; + var columns = size[1]; + + // number of non-zero items + var n = Math.min(rows - kSub, columns - kSuper); + + // value extraction function + var _value; + + // check value + if (isArray(value)) { + // validate array + if (value.length !== n) { + // number of values in array must be n + throw new Error('Invalid value array length'); + } + // define function + _value = function (i) { + // return value @ i + return value[i]; + }; + } + else if (value instanceof Matrix) { + // matrix size + var ms = value.size(); + // validate matrix + if (ms.length !== 1 || ms[0] !== n) { + // number of values in array must be n + throw new Error('Invalid matrix length'); + } + // define function + _value = function (i) { + // return value @ i + return value.get([i]); + }; + } + else { + // define function + _value = function () { + // return value + return value; + }; + } + + // create arrays + var values = []; + var index = []; + var ptr = []; + + // loop items + for (var j = 0; j < columns; j++) { + // number of rows with value + ptr.push(values.length); + // diagonal index + var i = j - kSuper; + // check we need to set diagonal value + if (i >= 0 && i < n) { + // get value @ i + var v = _value(i); + // check for zero + if (!equal(v, 0)) { + // column + index.push(i + kSub); + // add value + values.push(v); + } + } + } + // last value should be number of values + ptr.push(values.length); + // create SparseMatrix + return new SparseMatrix({ + values: values, + index: index, + ptr: ptr, + size: [rows, columns] + }); + }; + + /** + * Swap rows i and j in Matrix. + * + * @param {Number} i Matrix row index 1 + * @param {Number} j Matrix row index 2 + * + * @return {Matrix} The matrix reference + */ + SparseMatrix.prototype.swapRows = function (i, j) { + // check index + if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) { + throw new Error('Row index must be positive integers'); + } + // check dimensions + if (this._size.length !== 2) { + throw new Error('Only two dimensional matrix is supported'); + } + // validate index + validateIndex(i, this._size[0]); + validateIndex(j, this._size[0]); + + // swap rows + SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr); + // return current instance + return this; + }; + + /** + * Loop rows with data in column j. + * + * @param (Number} j Column + * @param {Array} values Matrix values + * @param {Array} index Matrix row indeces + * @param {Array} ptr Matrix column pointers + * @param {function} callback Callback function invoked for every row in column j + */ + SparseMatrix._forEachRow = function (j, values, index, ptr, callback) { + // indeces for column j + var k0 = ptr[j]; + var k1 = ptr[j + 1]; + // loop + for (var k = k0; k < k1; k++) { + // invoke callback + callback(index[k], values[k]); + } + }; + + /** + * Swap rows x and y in Sparse Matrix data structures. + * + * @param {Number} x Matrix row index 1 + * @param {Number} y Matrix row index 2 + * @param {Number} columns Number of columns in matrix + * @param {Array} values Matrix values + * @param {Array} index Matrix row indeces + * @param {Array} ptr Matrix column pointers + */ + SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) { + // loop columns + for (var j = 0; j < columns; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = ptr[j]; + var k1 = ptr[j + 1]; + // find value index @ x + var kx = _getValueIndex(x, k0, k1, index); + // find value index @ x + var ky = _getValueIndex(y, k0, k1, index); + // check both rows exist in matrix + if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) { + // swap values (check for pattern matrix) + if (values) { + var v = values[kx]; + values[kx] = values[ky]; + values[ky] = v; + } + // next column + continue; + } + // check x row exist & no y row + if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) { + // value @ x (check for pattern matrix) + var vx = values ? values[kx] : undefined; + // insert value @ y + index.splice(ky, 0, y); + if (values) + values.splice(ky, 0, vx); + // remove value @ x (adjust array index if needed) + index.splice(ky <= kx ? kx + 1 : kx, 1); + if (values) + values.splice(ky <= kx ? kx + 1 : kx, 1); + // next column + continue; + } + // check y row exist & no x row + if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) { + // value @ y (check for pattern matrix) + var vy = values ? values[ky] : undefined; + // insert value @ x + index.splice(kx, 0, x); + if (values) + values.splice(kx, 0, vy); + // remove value @ y (adjust array index if needed) + index.splice(kx <= ky ? ky + 1 : ky, 1); + if (values) + values.splice(kx <= ky ? ky + 1 : ky, 1); + } + } + }; + + // register this type in the base class Matrix + Matrix._storage.sparse = SparseMatrix; + + return SparseMatrix; + } + + exports.name = 'SparseMatrix'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 18 */ /***/ function(module, exports, __webpack_require__) { - // constants - exports.e = __webpack_require__(185); - exports.E = __webpack_require__(185); - exports['false'] = __webpack_require__(186); - exports.i = __webpack_require__(187); - exports['Infinity'] = __webpack_require__(188); - exports.LN2 = __webpack_require__(189); - exports.LN10 = __webpack_require__(190); - exports.LOG2E = __webpack_require__(191); - exports.LOG10E = __webpack_require__(192); - exports.NaN = __webpack_require__(193); - exports['null'] = __webpack_require__(194); - exports.pi = __webpack_require__(195); - exports.PI = __webpack_require__(195); - exports.phi = __webpack_require__(196); - exports.SQRT1_2 = __webpack_require__(197); - exports.SQRT2 = __webpack_require__(198); - exports.tau = __webpack_require__(199); - exports['true'] = __webpack_require__(200); - exports.version = __webpack_require__(201); - - // functions - arithmetic - exports.abs = __webpack_require__(206); - exports.add = __webpack_require__(207); - exports.ceil = __webpack_require__(208); - exports.cube = __webpack_require__(209); - exports.divide = __webpack_require__(210); - exports.dotDivide = __webpack_require__(211); - exports.dotMultiply = __webpack_require__(212); - exports.dotPow = __webpack_require__(213); - exports.exp = __webpack_require__(214); - exports.fix = __webpack_require__(215); - exports.floor = __webpack_require__(216); - exports.gcd = __webpack_require__(217); - exports.lcm = __webpack_require__(218); - exports.log = __webpack_require__(219); - exports.log10 = __webpack_require__(220); - exports.mod = __webpack_require__(221); - exports.multiply = __webpack_require__(222); - exports.norm = __webpack_require__(223); - exports.nthRoot = __webpack_require__(224); - exports.pow = __webpack_require__(225); - exports.round = __webpack_require__(226); - exports.sign = __webpack_require__(227); - exports.sqrt = __webpack_require__(228); - exports.square = __webpack_require__(229); - exports.subtract = __webpack_require__(230); - exports.unaryMinus = __webpack_require__(231); - exports.unaryPlus = __webpack_require__(232); - exports.xgcd = __webpack_require__(233); - - // functions - bitwise - exports.bitAnd = __webpack_require__(234); - exports.bitNot = __webpack_require__(235); - exports.bitOr = __webpack_require__(236); - exports.bitXor = __webpack_require__(237); - exports.leftShift = __webpack_require__(238); - exports.rightArithShift = __webpack_require__(239); - exports.rightLogShift = __webpack_require__(240); - - // functions - complex - exports.arg = __webpack_require__(241); - exports.conj = __webpack_require__(242); - exports.re = __webpack_require__(243); - exports.im = __webpack_require__(244); - - // functions - construction - exports.bignumber = __webpack_require__(245); - exports['boolean'] = __webpack_require__(246); - exports.complex = __webpack_require__(247); - exports.index = __webpack_require__(248); - exports.matrix = __webpack_require__(249); - exports.number = __webpack_require__(250); - exports.string = __webpack_require__(251); - exports.unit = __webpack_require__(252); - - // functions - expression - exports['eval'] = __webpack_require__(253); - exports.help = __webpack_require__(254); - - // functions - logical - exports['and'] = __webpack_require__(255); - exports['not'] = __webpack_require__(256); - exports['or'] = __webpack_require__(257); - exports['xor'] = __webpack_require__(258); - - // functions - matrix - exports['concat'] = __webpack_require__(259); - exports.cross = __webpack_require__(260); - exports.det = __webpack_require__(261); - exports.diag = __webpack_require__(262); - exports.dot = __webpack_require__(263); - exports.eye = __webpack_require__(264); - exports.flatten = __webpack_require__(265); - exports.inv = __webpack_require__(266); - exports.ones = __webpack_require__(267); - exports.range = __webpack_require__(268); - exports.resize = __webpack_require__(269); - exports.size = __webpack_require__(270); - exports.squeeze = __webpack_require__(271); - exports.subset = __webpack_require__(272); - exports.trace = __webpack_require__(273); - exports.transpose = __webpack_require__(274); - exports.zeros = __webpack_require__(275); - - // functions - probability - exports.combinations = __webpack_require__(276); - //exports.distribution = require('./function/probability/distribution'); - exports.factorial = __webpack_require__(277); - exports.gamma = __webpack_require__(278); - exports.permutations = __webpack_require__(279); - exports.pickRandom = __webpack_require__(280); - exports.random = __webpack_require__(281); - exports.randomInt = __webpack_require__(282); - - // functions - relational - exports.compare = __webpack_require__(283); - exports.deepEqual = __webpack_require__(284); - exports['equal'] = __webpack_require__(285); - exports.larger = __webpack_require__(286); - exports.largerEq = __webpack_require__(287); - exports.smaller = __webpack_require__(288); - exports.smallerEq = __webpack_require__(289); - exports.unequal = __webpack_require__(290); - - // functions - statistics - exports.max = __webpack_require__(291); - exports.mean = __webpack_require__(292); - exports.median = __webpack_require__(293); - exports.min = __webpack_require__(294); - exports.prod = __webpack_require__(295); - exports.std = __webpack_require__(296); - exports.sum = __webpack_require__(297); - exports['var'] = __webpack_require__(298); - - // functions - trigonometry - exports.acos = __webpack_require__(299); - exports.acosh = __webpack_require__(300); - exports.acot = __webpack_require__(301); - exports.acoth = __webpack_require__(302); - exports.acsc = __webpack_require__(303); - exports.acsch = __webpack_require__(304); - exports.asec = __webpack_require__(305); - exports.asech = __webpack_require__(306); - exports.asin = __webpack_require__(307); - exports.asinh = __webpack_require__(308); - exports.atan = __webpack_require__(309); - exports.atanh = __webpack_require__(310); - exports.atan2 = __webpack_require__(311); - exports.cos = __webpack_require__(312); - exports.cosh = __webpack_require__(313); - exports.cot = __webpack_require__(314); - exports.coth = __webpack_require__(315); - exports.csc = __webpack_require__(316); - exports.csch = __webpack_require__(317); - exports.sec = __webpack_require__(318); - exports.sech = __webpack_require__(319); - exports.sin = __webpack_require__(320); - exports.sinh = __webpack_require__(321); - exports.tan = __webpack_require__(322); - exports.tanh = __webpack_require__(323); - - // functions - units - exports.to = __webpack_require__(324); - - // functions - utils - exports.clone = __webpack_require__(325); - exports.map = __webpack_require__(326); - exports.filter = __webpack_require__(327); - exports.forEach = __webpack_require__(328); - exports.format = __webpack_require__(329); - // exports.print = require('./function/utils/print'); // TODO: add documentation for print as soon as the parser supports objects. - exports['import'] = __webpack_require__(330); - exports.sort = __webpack_require__(331); - exports['typeof'] = __webpack_require__(332); + 'use strict'; + + var util = __webpack_require__(171); + var DimensionError = __webpack_require__(174); + + var string = util.string; + var array = util.array; + var object = util.object; + + var isArray = Array.isArray; + var isNumber = util.number.isNumber; + var isInteger = util.number.isInteger; + + var validateIndex = array.validateIndex; + + function factory (type, config, load) { + + var Index = type.Index; + var BigNumber = type.BigNumber; + var Matrix = type.Matrix; + + function DenseMatrix(data) { + if (!(this instanceof DenseMatrix)) + throw new SyntaxError('Constructor must be called with the new operator'); + + if (data instanceof Matrix) { + // check data is a DenseMatrix + if (data.type === 'DenseMatrix') { + // clone data & size + this._data = object.clone(data._data); + this._size = object.clone(data._size); + } + else { + // build data from existing matrix + this._data = data.toArray(); + this._size = data.size(); + } + } + else if (data && isArray(data.data) && isArray(data.size)) { + // initialize fields from JSON representation + this._data = data.data; + this._size = data.size; + } + else if (isArray(data)) { + // replace nested Matrices with Arrays + this._data = preprocess(data); + // verify the size of the array, TODO: compute size while processing array + this._size = array.size(this._data); + } + else if (data) { + // unsupported type + throw new TypeError('Unsupported type of data (' + util.types.type(data) + ')'); + } + else { + // nothing provided + this._data = []; + this._size = [0]; + } + } + + DenseMatrix.prototype = new Matrix(); + + DenseMatrix.prototype.type = 'DenseMatrix'; + + /** + * Get the storage format used by the matrix. + * + * Usage: + * var format = matrix.storage() // retrieve storage format + * + * @return {string} The storage format. + */ + DenseMatrix.prototype.storage = function () { + return 'dense'; + }; + + /** + * Get a subset of the matrix, or replace a subset of the matrix. + * + * Usage: + * var subset = matrix.subset(index) // retrieve subset + * var value = matrix.subset(index, replacement) // replace subset + * + * @param {Index} index + * @param {Array | DenseMatrix | *} [replacement] + * @param {*} [defaultValue=0] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be filled with zeros. + */ + DenseMatrix.prototype.subset = function (index, replacement, defaultValue) { + switch (arguments.length) { + case 1: + return _get(this, index); + + // intentional fall through + case 2: + case 3: + return _set(this, index, replacement, defaultValue); + + default: + throw new SyntaxError('Wrong number of arguments'); + } + }; + + /** + * Get a single element from the matrix. + * @param {Number[]} index Zero-based index + * @return {*} value + */ + DenseMatrix.prototype.get = function (index) { + if (!isArray(index)) + throw new TypeError('Array expected'); + if (index.length != this._size.length) + throw new DimensionError(index.length, this._size.length); + + // check index + for (var x = 0; x < index.length; x++) + validateIndex(index[x], this._size[x]); + + var data = this._data; + for (var i = 0, ii = index.length; i < ii; i++) { + var index_i = index[i]; + validateIndex(index_i, data.length); + data = data[index_i]; + } + + return object.clone(data); + }; + + /** + * Replace a single element in the matrix. + * @param {Number[]} index Zero-based index + * @param {*} value + * @param {*} [defaultValue] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * new matrix elements will be left undefined. + * @return {DenseMatrix} self + */ + DenseMatrix.prototype.set = function (index, value, defaultValue) { + if (!isArray(index)) + throw new TypeError('Array expected'); + if (index.length < this._size.length) + throw new DimensionError(index.length, this._size.length, '<'); + + var i, ii, index_i; + + // enlarge matrix when needed + var size = index.map(function (i) { + return i + 1; + }); + _fit(this, size, defaultValue); + + // traverse over the dimensions + var data = this._data; + for (i = 0, ii = index.length - 1; i < ii; i++) { + index_i = index[i]; + validateIndex(index_i, data.length); + data = data[index_i]; + } + + // set new value + index_i = index[index.length - 1]; + validateIndex(index_i, data.length); + data[index_i] = value; + + return this; + }; + + /** + * Get a submatrix of this matrix + * @param {DenseMatrix} matrix + * @param {Index} index Zero-based index + * @private + */ + function _get (matrix, index) { + if (!(index instanceof Index)) { + throw new TypeError('Invalid index'); + } + + var isScalar = index.isScalar(); + if (isScalar) { + // return a scalar + return matrix.get(index.min()); + } + else { + // validate dimensions + var size = index.size(); + if (size.length != matrix._size.length) { + throw new DimensionError(size.length, matrix._size.length); + } + + // validate if any of the ranges in the index is out of range + var min = index.min(); + var max = index.max(); + for (var i = 0, ii = matrix._size.length; i < ii; i++) { + validateIndex(min[i], matrix._size[i]); + validateIndex(max[i], matrix._size[i]); + } + + // retrieve submatrix + // TODO: more efficient when creating an empty matrix and setting _data and _size manually + return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0)); + } + } + + /** + * Recursively get a submatrix of a multi dimensional matrix. + * Index is not checked for correct number or length of dimensions. + * @param {Array} data + * @param {Index} index + * @param {number} dims Total number of dimensions + * @param {number} dim Current dimension + * @return {Array} submatrix + * @private + */ + function _getSubmatrix (data, index, dims, dim) { + var last = (dim == dims - 1); + var range = index.range(dim); + + if (last) { + return range.map(function (i) { + return data[i]; + }); + } + else { + return range.map(function (i) { + var child = data[i]; + return _getSubmatrix(child, index, dims, dim + 1); + }); + } + } + + /** + * Replace a submatrix in this matrix + * Indexes are zero-based. + * @param {DenseMatrix} matrix + * @param {Index} index + * @param {DenseMatrix | Array | *} submatrix + * @param {*} defaultValue Default value, filled in on new entries when + * the matrix is resized. + * @return {DenseMatrix} matrix + * @private + */ + function _set (matrix, index, submatrix, defaultValue) { + if (!(index instanceof Index)) { + throw new TypeError('Invalid index'); + } + + // get index size and check whether the index contains a single value + var iSize = index.size(), + isScalar = index.isScalar(); + + // calculate the size of the submatrix, and convert it into an Array if needed + var sSize; + if (submatrix instanceof Matrix) { + sSize = submatrix.size(); + submatrix = submatrix.valueOf(); + } + else { + sSize = array.size(submatrix); + } + + if (isScalar) { + // set a scalar + + // check whether submatrix is a scalar + if (sSize.length !== 0) { + throw new TypeError('Scalar expected'); + } + + matrix.set(index.min(), submatrix, defaultValue); + } + else { + // set a submatrix + + // validate dimensions + if (iSize.length < matrix._size.length) { + throw new DimensionError(iSize.length, matrix._size.length, '<'); + } + + if (sSize.length < iSize.length) { + // calculate number of missing outer dimensions + var i = 0; + var outer = 0; + while (iSize[i] === 1 && sSize[i] === 1) { + i++; + } + while (iSize[i] === 1) { + outer++; + i++; + } + + // unsqueeze both outer and inner dimensions + submatrix = array.unsqueeze(submatrix, iSize.length, outer, sSize); + } + + // check whether the size of the submatrix matches the index size + if (!object.deepEqual(iSize, sSize)) { + throw new DimensionError(iSize, sSize, '>'); + } + + // enlarge matrix when needed + var size = index.max().map(function (i) { + return i + 1; + }); + _fit(matrix, size, defaultValue); + + // insert the sub matrix + var dims = iSize.length, + dim = 0; + _setSubmatrix (matrix._data, index, submatrix, dims, dim); + } + + return matrix; + } + + /** + * Replace a submatrix of a multi dimensional matrix. + * @param {Array} data + * @param {Index} index + * @param {Array} submatrix + * @param {number} dims Total number of dimensions + * @param {number} dim + * @private + */ + function _setSubmatrix (data, index, submatrix, dims, dim) { + var last = (dim == dims - 1), + range = index.range(dim); + + if (last) { + range.forEach(function (dataIndex, subIndex) { + validateIndex(dataIndex); + data[dataIndex] = submatrix[subIndex]; + }); + } + else { + range.forEach(function (dataIndex, subIndex) { + validateIndex(dataIndex); + _setSubmatrix(data[dataIndex], index, submatrix[subIndex], dims, dim + 1); + }); + } + } + + /** + * Resize the matrix to the given size. Returns a copy of the matrix when + * `copy=true`, otherwise return the matrix itself (resize in place). + * + * @param {Number[]} size The new size the matrix should have. + * @param {*} [defaultValue=0] Default value, filled in on new entries. + * If not provided, the matrix elements will + * be filled with zeros. + * @param {boolean} [copy] Return a resized copy of the matrix + * + * @return {Matrix} The resized matrix + */ + DenseMatrix.prototype.resize = function (size, defaultValue, copy) { + // validate arguments + if (!isArray(size)) + throw new TypeError('Array expected'); + + // matrix to resize + var m = copy ? this.clone() : this; + // resize matrix + return _resize(m, size, defaultValue); + }; + + var _resize = function (matrix, size, defaultValue) { + // check size + if (size.length === 0) { + // first value in matrix + var v = matrix._data; + // go deep + while (isArray(v)) { + v = v[0]; + } + return object.clone(v); + } + // resize matrix + matrix._size = object.clone(size); + matrix._data = array.resize(matrix._data, matrix._size, defaultValue); + // return matrix + return matrix; + }; + + /** + * Enlarge the matrix when it is smaller than given size. + * If the matrix is larger or equal sized, nothing is done. + * @param {DenseMatrix} matrix The matrix to be resized + * @param {Number[]} size + * @param {*} defaultValue Default value, filled in on new entries. + * @private + */ + function _fit(matrix, size, defaultValue) { + var newSize = object.clone(matrix._size), + changed = false; + + // add dimensions when needed + while (newSize.length < size.length) { + newSize.push(0); + changed = true; + } + + // enlarge size when needed + for (var i = 0, ii = size.length; i < ii; i++) { + if (size[i] > newSize[i]) { + newSize[i] = size[i]; + changed = true; + } + } + + if (changed) { + // resize only when size is changed + _resize(matrix, newSize, defaultValue); + } + } + + /** + * Create a clone of the matrix + * @return {DenseMatrix} clone + */ + DenseMatrix.prototype.clone = function () { + var m = new DenseMatrix({ + data: object.clone(this._data), + size: object.clone(this._size) + }); + return m; + }; + + /** + * Retrieve the size of the matrix. + * @returns {Number[]} size + */ + DenseMatrix.prototype.size = function() { + return this._size; + }; + + /** + * Create a new matrix with the results of the callback function executed on + * each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + * + * @return {DenseMatrix} matrix + */ + DenseMatrix.prototype.map = function (callback) { + // matrix instance + var me = this; + var recurse = function (value, index) { + if (isArray(value)) { + return value.map(function (child, i) { + return recurse(child, index.concat(i)); + }); + } + else { + return callback(value, index, me); + } + }; + // return dense format + return new DenseMatrix({ + data: recurse(this._data, []), + size: object.clone(this._size) + }); + }; + + /** + * Execute a callback function on each entry of the matrix. + * @param {function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix being traversed. + */ + DenseMatrix.prototype.forEach = function (callback) { + // matrix instance + var me = this; + var recurse = function (value, index) { + if (isArray(value)) { + value.forEach(function (child, i) { + recurse(child, index.concat(i)); + }); + } + else { + callback(value, index, me); + } + }; + recurse(this._data, []); + }; + + /** + * Create an Array with a copy of the data of the DenseMatrix + * @returns {Array} array + */ + DenseMatrix.prototype.toArray = function () { + return object.clone(this._data); + }; + + /** + * Get the primitive value of the DenseMatrix: a multidimensional array + * @returns {Array} array + */ + DenseMatrix.prototype.valueOf = function () { + return this._data; + }; + + /** + * Get a string representation of the matrix, with optional formatting options. + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @returns {String} str + */ + DenseMatrix.prototype.format = function (options) { + return string.format(this._data, options); + }; + + /** + * Get a string representation of the matrix + * @returns {String} str + */ + DenseMatrix.prototype.toString = function () { + return string.format(this._data); + }; + + /** + * Get a JSON representation of the matrix + * @returns {Object} + */ + DenseMatrix.prototype.toJSON = function () { + return { + mathjs: 'DenseMatrix', + data: this._data, + size: this._size + }; + }; + + /** + * Get the kth Matrix diagonal. + * + * @param {Number | BigNumber} [k=0] The kth diagonal where the vector will retrieved. + * + * @returns {Array} The array vector with the diagonal values. + */ + DenseMatrix.prototype.diagonal = function(k) { + // validate k if any + if (k) { + // convert BigNumber to a number + if (k instanceof BigNumber) + k = k.toNumber(); + // is must be an integer + if (!isNumber(k) || !isInteger(k)) { + throw new TypeError ('The parameter k must be an integer number'); + } + } + else { + // default value + k = 0; + } + + var kSuper = k > 0 ? k : 0; + var kSub = k < 0 ? -k : 0; + + // rows & columns + var rows = this._size[0]; + var columns = this._size[1]; + + // number diagonal values + var n = Math.min(rows - kSub, columns - kSuper); + + // x is a matrix get diagonal from matrix + var data = []; + + // loop rows + for (var i = 0; i < n; i++) { + data[i] = object.clone(this._data[i + kSub][i + kSuper]); + } + + // create DenseMatrix + return new DenseMatrix({ + data: data, + size: [n] + }); + }; + + /** + * Create a diagonal matrix. + * + * @param {Array} size The matrix size. + * @param {Number, Array} value The values for the diagonal. + * @param {Number | BigNumber} [k=0] The kth diagonal where the vector will be filled in. + * @param {Number} [defaultValue] The default value for non-diagonal + * + * @returns {DenseMatrix} + */ + DenseMatrix.diagonal = function (size, value, k, defaultValue) { + if (!isArray(size)) + throw new TypeError('Array expected, size parameter'); + if (size.length !== 2) + throw new Error('Only two dimensions matrix are supported'); + + // map size & validate + size = size.map(function (s) { + // check it is a big number + if (s instanceof BigNumber) { + // convert it + s = s.toNumber(); + } + // validate arguments + if (!isNumber(s) || !isInteger(s) || s < 1) { + throw new Error('Size values must be positive integers'); + } + return s; + }); + + // validate k if any + if (k) { + // convert BigNumber to a number + if (k instanceof BigNumber) + k = k.toNumber(); + // is must be an integer + if (!isNumber(k) || !isInteger(k)) { + throw new TypeError ('The parameter k must be an integer number'); + } + } + else { + // default value + k = 0; + } + + var kSuper = k > 0 ? k : 0; + var kSub = k < 0 ? -k : 0; + + // rows and columns + var rows = size[0]; + var columns = size[1]; + + // number of non-zero items + var n = Math.min(rows - kSub, columns - kSuper); + + // value extraction function + var _value; + + // check value + if (isArray(value)) { + // validate array + if (value.length !== n) { + // number of values in array must be n + throw new Error('Invalid value array length'); + } + // define function + _value = function (i) { + // return value @ i + return value[i]; + }; + } + else if (value instanceof Matrix) { + // matrix size + var ms = value.size(); + // validate matrix + if (ms.length !== 1 || ms[0] !== n) { + // number of values in array must be n + throw new Error('Invalid matrix length'); + } + // define function + _value = function (i) { + // return value @ i + return value.get([i]); + }; + } + else { + // define function + _value = function () { + // return value + return value; + }; + } + + // discover default value if needed + if (!defaultValue) { + // check first value in array + defaultValue = (_value(0) instanceof type.BigNumber) ? new type.BigNumber(0) : 0; + } + + // empty array + var data = []; + + // check we need to resize array + if (size.length > 0) { + // resize array + data = array.resize(data, size, defaultValue); + // fill diagonal + for (var d = 0; d < n; d++) { + data[d + kSub][d + kSuper] = _value(d); + } + } + + // create DenseMatrix + return new DenseMatrix({ + data: data, + size: [rows, columns] + }); + }; + + /** + * Generate a matrix from a JSON object + * @param {Object} json An object structured like + * `{"mathjs": "DenseMatrix", data: [], size: []}`, + * where mathjs is optional + * @returns {DenseMatrix} + */ + DenseMatrix.fromJSON = function (json) { + return new DenseMatrix(json); + }; + + /** + * Swap rows i and j in Matrix. + * + * @param {Number} i Matrix row index 1 + * @param {Number} j Matrix row index 2 + * + * @return {Matrix} The matrix reference + */ + DenseMatrix.prototype.swapRows = function (i, j) { + // check index + if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) { + throw new Error('Row index must be positive integers'); + } + // check dimensions + if (this._size.length !== 2) { + throw new Error('Only two dimensional matrix is supported'); + } + // validate index + validateIndex(i, this._size[0]); + validateIndex(j, this._size[0]); + + // swap rows + DenseMatrix._swapRows(i, j, this._data); + // return current instance + return this; + }; + + /** + * Swap rows i and j in Dense Matrix data structure. + * + * @param {Number} i Matrix row index 1 + * @param {Number} j Matrix row index 2 + */ + DenseMatrix._swapRows = function (i, j, data) { + // swap values i <-> j + var vi = data[i]; + data[i] = data[j]; + data[j] = vi; + }; + + /** + * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and + * Matrices. Replaces all nested Matrices with Arrays + * @param {Array} data + * @return {Array} data + */ + function preprocess(data) { + for (var i = 0, ii = data.length; i < ii; i++) { + var elem = data[i]; + if (isArray(elem)) { + data[i] = preprocess(elem); + } + else if (elem instanceof Matrix) { + data[i] = preprocess(elem.valueOf()); + } + } + + return data; + } + // register this type in the base class Matrix + Matrix._storage.dense = DenseMatrix; + Matrix._storage['default'] = DenseMatrix; + + // exports + return DenseMatrix; + } + + exports.name = 'DenseMatrix'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 19 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var Complex = __webpack_require__(4); - var Help = __webpack_require__(9); - var Index = __webpack_require__(6); - var Matrix = __webpack_require__(7); - var Range = __webpack_require__(5); - var ResultSet = __webpack_require__(10); - var Unit = __webpack_require__(8); - - /** - * Instantiate mathjs data types from their JSON representation - * @param {string} key - * @param {*} value - * @returns {*} Returns the revived object - */ - function reviver(key, value) { - var type = value && value.mathjs; - - switch (type) { - case 'BigNumber': return BigNumber.fromJSON(value); - case 'Complex': return Complex.fromJSON(value); - case 'Help': return Help.fromJSON(value); - case 'Index': return Index.fromJSON(value); - case 'Matrix': return Matrix.fromJSON(value); - case 'Range': return Range.fromJSON(value); - case 'ResultSet': return ResultSet.fromJSON(value); - case 'Unit': return Unit.fromJSON(value); - } - - return value; - } - - module.exports = reviver; + 'use strict'; + + function factory (type, config, load, typed) { + + var add = load(__webpack_require__(32)); + var equal = load(__webpack_require__(115)); + + /** + * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array + * of the vector elements and an ordered list of non-zero elements. + * + * @param {Integer} length The initial dense vector length. + */ + function Spa(length) { + if (!(this instanceof Spa)) + throw new SyntaxError('Constructor must be called with the new operator'); + + // allocate vector, TODO use typed arrays + this._values = new Array(length); + this._heap = new type.FibonacciHeap(); + } + + /** + * Set the value for index i. + * + * @param {Number} i The index + * @param {Number | BigNumber | Complex} The value at index i + */ + Spa.prototype.set = function (i, v) { + // check we have a value @ i + if (!this._values[i]) { + // insert in heap + var node = this._heap.insert(i, v); + // set the value @ i + this._values[i] = node; + } + else { + // update the value @ i + this._values[i].value = v; + } + }; + + Spa.prototype.get = function (i) { + var node = this._values[i]; + if (node) + return node.value; + return 0; + }; + + Spa.prototype.accumulate = function (i, v) { + // node @ i + var node = this._values[i]; + if (!node) { + // insert in heap + node = this._heap.insert(i, v); + // initialize value + this._values[i] = node; + } + else { + // accumulate value + node.value = add(node.value, v); + } + }; + + Spa.prototype.forEach = function (from, to, callback) { + // references + var heap = this._heap; + var values = this._values; + // nodes + var nodes = []; + // node with minimum key, save it + var node = heap.extractMinimum(); + if (node) + nodes.push(node); + // extract nodes from heap (ordered) + while (node && node.key <= to) { + // check it is in range + if (node.key >= from) { + // check value is not zero + if (!equal(node.value, 0)) { + // invoke callback + callback(node.key, node.value, this); + } + } + // extract next node, save it + node = heap.extractMinimum(); + if (node) + nodes.push(node); + } + // reinsert all nodes in heap + for (var i = 0; i < nodes.length; i++) { + // current node + var n = nodes[i]; + // insert node in heap + node = heap.insert(n.key, n.value); + // update values + values[node.key] = node; + } + }; + + Spa.prototype.swap = function (i, j) { + // node @ i and j + var nodei = this._values[i]; + var nodej = this._values[j]; + // check we need to insert indeces + if (!nodei && nodej) { + // insert in heap + nodei = this._heap.insert(i, nodej.value); + // remove from heap + this._heap.remove(nodej); + // set values + this._values[i] = nodei; + this._values[j] = undefined; + } + else if (nodei && !nodej) { + // insert in heap + nodej = this._heap.insert(j, nodei.value); + // remove from heap + this._heap.remove(nodei); + // set values + this._values[j] = nodej; + this._values[i] = undefined; + } + else if (nodei && nodej) { + // swap values + var v = nodei.value; + nodei.value = nodej.value; + nodej.value = v; + } + }; + + return Spa; + } + + exports.name = 'Spa'; + exports.path = 'type'; + exports.factory = factory; /***/ }, /* 20 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var errorTransform = __webpack_require__(203).transform; - var isNumber = __webpack_require__(3).isNumber; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.range - * Adds a property transform containing the transform function. - * - * This transform changed the last `dim` parameter of function concat - * from one-based to zero based - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - // copy arguments into an array - var args = argsToArray(arguments); - - // change last argument from one-based to zero-based - var lastIndex = args.length - 1; - var last = args[lastIndex]; - if (isNumber(last)) { - args[lastIndex] = last - 1; - } - else if (last instanceof BigNumber) { - args[lastIndex] = last.minus(1); - } - - try { - return math.concat.apply(math, args); - } - catch (err) { - throw errorTransform(err); - } - }; - - math.concat.transform = transform; - - return transform; - }; + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Instantiate mathjs data types from their JSON representation + * @param {string} key + * @param {*} value + * @returns {*} Returns the revived object + */ + return function reviver(key, value) { + var constructor = type[value && value.mathjs]; + if (constructor && typeof constructor.fromJSON === 'function') { + return constructor.fromJSON(value); + } + + return value; + } + } + + exports.name = 'reviver'; + exports.path = 'json'; + exports.factory = factory; /***/ }, /* 21 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var SymbolNode = __webpack_require__(183); - var isBoolean = __webpack_require__(204).isBoolean; - var argsToArray = __webpack_require__(167).argsToArray; - var ArgumentsError = __webpack_require__(169); - - /** - * Attach a transform function to math.filter - * Adds a property transform containing the transform function. - * - * This transform adds support for equations as test function for math.filter, - * so you can do something like 'filter([3, -2, 5], x > 0)'. - * @param {Object} math - */ - module.exports = function (math) { - var _filter = math.filter; - - var transform = function (args, math, scope) { - if (args.length !== 2) { - throw new ArgumentsError('filter', arguments.length, 2); - } - - var x = args[0].compile(math).eval(scope); - var test; - if (args[1] instanceof SymbolNode) { - // a function pointer, like filter([3, -2, 5], myTestFunction); - test = args[1].compile(math).eval(scope); - } - else { - // an equation like filter([3, -2, 5], x > 0) - - // find an undefined symbol - var _scope = scope || {}; - var symbol = args[1] - .filter(function (node) { - return (node instanceof SymbolNode) && - !(node.name in math) && - !(node.name in _scope); - })[0]; - - // create a test function for this equation - var sub = Object.create(_scope); - var eq = args[1].compile(math); - if (symbol) { - var name = symbol.name; - test = function (x) { - sub[name] = x; - return eq.eval(sub); - } - } - else { - throw new Error('No undefined variable found in filter equation'); - } - } - - return _filter(x, test); - }; - - transform.rawArgs = true; - math.filter.transform = transform; - - return transform; - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var errorTransform = __webpack_require__(208).transform; + var isNumber = __webpack_require__(175).isNumber; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.range + * Adds a property transform containing the transform function. + * + * This transform changed the last `dim` parameter of function concat + * from one-based to zero based + * @param {Object} math + */ + module.exports = function (math) { + var transform = function () { + // copy arguments into an array + var args = argsToArray(arguments); + + // change last argument from one-based to zero-based + var lastIndex = args.length - 1; + var last = args[lastIndex]; + if (isNumber(last)) { + args[lastIndex] = last - 1; + } + else if (last instanceof BigNumber) { + args[lastIndex] = last.minus(1); + } + + try { + return math.concat.apply(math, args); + } + catch (err) { + throw errorTransform(err); + } + }; + + math.concat.transform = transform; + + return transform; + }; /***/ }, /* 22 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Matrix = __webpack_require__(7); - - /** - * Attach a transform function to math.forEach - * Adds a property transform containing the transform function. - * - * This transform creates a one-based index instead of a zero-based index - * @param {Object} math - */ - module.exports = function (math) { - var transform = function (x, callback) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('forEach', arguments.length, 2); - } - - if (Array.isArray(x)) { - _forEachArray(x, callback, x); - } else if (x instanceof Matrix) { - _forEachArray(x.valueOf(), callback, x); - } else { - throw new math.error.UnsupportedTypeError('forEach', math['typeof'](x)); - } - }; - - function _forEachArray (array, callback, arrayOrig) { - var recurse = function (value, index) { - if (Array.isArray(value)) { - value.forEach(function (child, i) { - // we create a copy of the index array and append the new index value - recurse(child, index.concat(i + 1)); // one based index, hence i+1 - }); - } - else { - callback(value, index, arrayOrig); - } - }; - recurse(array, []); - } - - math.forEach.transform = transform; - - return transform; - }; + 'use strict'; + + var SymbolNode = __webpack_require__(188); + var isBoolean = __webpack_require__(209).isBoolean; + var argsToArray = __webpack_require__(172).argsToArray; + var ArgumentsError = __webpack_require__(177); + + /** + * Attach a transform function to math.filter + * Adds a property transform containing the transform function. + * + * This transform adds support for equations as test function for math.filter, + * so you can do something like 'filter([3, -2, 5], x > 0)'. + * @param {Object} math + */ + module.exports = function (math) { + var _filter = math.filter; + + var transform = function (args, math, scope) { + if (args.length !== 2) { + throw new ArgumentsError('filter', arguments.length, 2); + } + + var x = args[0].compile(math).eval(scope); + var test; + if (args[1] instanceof SymbolNode) { + // a function pointer, like filter([3, -2, 5], myTestFunction); + test = args[1].compile(math).eval(scope); + } + else { + // an equation like filter([3, -2, 5], x > 0) + + // find an undefined symbol + var _scope = scope || {}; + var symbol = args[1] + .filter(function (node) { + return (node instanceof SymbolNode) && + !(node.name in math) && + !(node.name in _scope); + })[0]; + + // create a test function for this equation + var sub = Object.create(_scope); + var eq = args[1].compile(math); + if (symbol) { + var name = symbol.name; + test = function (x) { + sub[name] = x; + return eq.eval(sub); + } + } + else { + throw new Error('No undefined variable found in filter equation'); + } + } + + return _filter(x, test); + }; + + transform.rawArgs = true; + math.filter.transform = transform; + + return transform; + }; /***/ }, /* 23 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var Range = __webpack_require__(5); - var Index = __webpack_require__(6); - var Matrix = __webpack_require__(7); - var isNumber = __webpack_require__(3).isNumber; - var isArray = Array.isArray; - - /** - * Attach a transform function to math.index - * Adds a property transform containing the transform function. - * - * This transform creates a one-based index instead of a zero-based index - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - var args = []; - for (var i = 0, ii = arguments.length; i < ii; i++) { - var arg = arguments[i]; - - // change from one-based to zero based, and convert BigNumber to number - if (arg instanceof Range) { - arg.start--; - arg.end -= (arg.step > 0 ? 0 : 2); - } - else if (isNumber(arg)) { - arg--; - } - else if (arg instanceof BigNumber) { - arg = arg.toNumber() - 1; - } - else { - throw new TypeError('Ranges must be a Number or Range'); - } - - args[i] = arg; - } - - var res = new Index(); - Index.apply(res, args); - return res; - }; - - math.index.transform = transform; - - return transform; - }; + 'use strict'; + + /** + * Attach a transform function to math.forEach + * Adds a property transform containing the transform function. + * + * This transform creates a one-based index instead of a zero-based index + * @param {Object} math + */ + module.exports = function (math) { + + var Matrix = math.type.Matrix; + + var transform = function (x, callback) { + if (arguments.length != 2) { + throw new math.error.ArgumentsError('forEach', arguments.length, 2); + } + + if (Array.isArray(x)) { + _forEachArray(x, callback, x); + } else if (x instanceof Matrix) { + _forEachArray(x.valueOf(), callback, x); + } else { + throw new math.error.UnsupportedTypeError('forEach', math['typeof'](x)); + } + }; + + function _forEachArray (array, callback, arrayOrig) { + var recurse = function (value, index) { + if (Array.isArray(value)) { + value.forEach(function (child, i) { + // we create a copy of the index array and append the new index value + recurse(child, index.concat(i + 1)); // one based index, hence i+1 + }); + } + else { + callback(value, index, arrayOrig); + } + }; + recurse(array, []); + } + + math.forEach.transform = transform; + + return transform; + }; /***/ }, /* 24 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Matrix = __webpack_require__(7); - var BigNumber = __webpack_require__(12); - var Range = __webpack_require__(5); - var Index = __webpack_require__(6); - var isNumber = __webpack_require__(3).isNumber; - var isArray = Array.isArray; - - /** - * Attach a transform function to math.map - * Adds a property transform containing the transform function. - * - * This transform creates a one-based index instead of a zero-based index - * @param {Object} math - */ - module.exports = function (math) { - var transform = function (x, callback) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('map', arguments.length, 2); - } - - if (Array.isArray(x)) { - return _mapArray(x, callback, x); - } else if (x instanceof Matrix) { - return new Matrix(_mapArray(x.valueOf(), callback, x)) - } else { - throw new math.error.UnsupportedTypeError('map', math['typeof'](x)); - } - }; - - function _mapArray (arrayIn, callback, arrayOrig) { - var recurse = function (value, index) { - if (Array.isArray(value)) { - return value.map(function (child, i) { - // we create a copy of the index array and append the new index value - return recurse(child, index.concat(i + 1)); // one based index, hence i + 1 - }); - } - else { - return callback(value, index, arrayOrig); - } - }; - - return recurse(arrayIn, []); - } - - math.map.transform = transform; - - return transform; - }; + 'use strict'; + + /** + * Attach a transform function to math.map + * Adds a property transform containing the transform function. + * + * This transform creates a one-based index instead of a zero-based index + * @param {Object} math + */ + module.exports = function (math) { + + var Matrix = math.type.Matrix; + + var transform = function (x, callback) { + if (arguments.length != 2) { + throw new math.error.ArgumentsError('map', arguments.length, 2); + } + + if (Array.isArray(x)) { + return _mapArray(x, callback, x); + } else if (x instanceof Matrix) { + return math.matrix(_mapArray(x.valueOf(), callback, x)); + } else { + throw new math.error.UnsupportedTypeError('map', math['typeof'](x)); + } + }; + + function _mapArray (arrayIn, callback, arrayOrig) { + var recurse = function (value, index) { + if (Array.isArray(value)) { + return value.map(function (child, i) { + // we create a copy of the index array and append the new index value + return recurse(child, index.concat(i + 1)); // one based index, hence i + 1 + }); + } + else { + return callback(value, index, arrayOrig); + } + }; + + return recurse(arrayIn, []); + } + + math.map.transform = transform; + + return transform; + }; /***/ }, /* 25 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var errorTransform = __webpack_require__(203).transform; - var isNumber = __webpack_require__(3).isNumber; - var isCollection = __webpack_require__(14).isCollection; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.max - * Adds a property transform containing the transform function. - * - * This transform changed the last `dim` parameter of function max - * from one-based to zero based - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - var args = argsToArray(arguments); - - // change last argument dim from one-based to zero-based - if (args.length == 2 && isCollection(args[0])) { - var dim = args[1]; - if (isNumber(dim)) { - args[1] = dim - 1; - } - else if (dim instanceof BigNumber) { - args[1] = dim.minus(1); - } - } - - try { - return math.max.apply(math, args); - } - catch (err) { - throw errorTransform(err); - } - }; - - math.max.transform = transform; - - return transform; - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var errorTransform = __webpack_require__(208).transform; + var isNumber = __webpack_require__(175).isNumber; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.max + * Adds a property transform containing the transform function. + * + * This transform changed the last `dim` parameter of function max + * from one-based to zero based + * @param {Object} math + */ + module.exports = function (math) { + + var isCollection = math.collection.isCollection; + + var transform = function () { + var args = argsToArray(arguments); + + // change last argument dim from one-based to zero-based + if (args.length == 2 && isCollection(args[0])) { + var dim = args[1]; + if (isNumber(dim)) { + args[1] = dim - 1; + } + else if (dim instanceof BigNumber) { + args[1] = dim.minus(1); + } + } + + try { + return math.max.apply(math, args); + } + catch (err) { + throw errorTransform(err); + } + }; + + math.max.transform = transform; + + return transform; + }; /***/ }, /* 26 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var errorTransform = __webpack_require__(203).transform; - var isNumber = __webpack_require__(3).isNumber; - var isCollection = __webpack_require__(14).isCollection; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.mean - * Adds a property transform containing the transform function. - * - * This transform changed the last `dim` parameter of function mean - * from one-based to zero based - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - var args = argsToArray(arguments); - - // change last argument dim from one-based to zero-based - if (args.length == 2 && isCollection(args[0])) { - var dim = args[1]; - if (isNumber(dim)) { - args[1] = dim - 1; - } - else if (dim instanceof BigNumber) { - args[1] = dim.minus(1); - } - } - - try { - return math.mean.apply(math, args); - } - catch (err) { - throw errorTransform(err); - } - }; - - math.mean.transform = transform; - - return transform; - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var errorTransform = __webpack_require__(208).transform; + var isNumber = __webpack_require__(175).isNumber; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.mean + * Adds a property transform containing the transform function. + * + * This transform changed the last `dim` parameter of function mean + * from one-based to zero based + * @param {Object} math + */ + module.exports = function (math) { + + var isCollection = math.collection.isCollection; + + var transform = function () { + var args = argsToArray(arguments); + + // change last argument dim from one-based to zero-based + if (args.length == 2 && isCollection(args[0])) { + var dim = args[1]; + if (isNumber(dim)) { + args[1] = dim - 1; + } + else if (dim instanceof BigNumber) { + args[1] = dim.minus(1); + } + } + + try { + return math.mean.apply(math, args); + } + catch (err) { + throw errorTransform(err); + } + }; + + math.mean.transform = transform; + + return transform; + }; /***/ }, /* 27 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var errorTransform = __webpack_require__(203).transform; - var isNumber = __webpack_require__(3).isNumber; - var isCollection = __webpack_require__(14).isCollection; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.min - * Adds a property transform containing the transform function. - * - * This transform changed the last `dim` parameter of function min - * from one-based to zero based - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - var args = argsToArray(arguments); - - // change last argument dim from one-based to zero-based - if (args.length == 2 && isCollection(args[0])) { - var dim = args[1]; - if (isNumber(dim)) { - args[1] = dim - 1; - } - else if (dim instanceof BigNumber) { - args[1] = dim.minus(1); - } - } - - try { - return math.min.apply(math, args); - } - catch (err) { - throw errorTransform(err); - } - }; - - math.min.transform = transform; - - return transform; - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var errorTransform = __webpack_require__(208).transform; + var isNumber = __webpack_require__(175).isNumber; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.min + * Adds a property transform containing the transform function. + * + * This transform changed the last `dim` parameter of function min + * from one-based to zero based + * @param {Object} math + */ + module.exports = function (math) { + + var isCollection = math.collection.isCollection; + + var transform = function () { + var args = argsToArray(arguments); + + // change last argument dim from one-based to zero-based + if (args.length == 2 && isCollection(args[0])) { + var dim = args[1]; + if (isNumber(dim)) { + args[1] = dim - 1; + } + else if (dim instanceof BigNumber) { + args[1] = dim.minus(1); + } + } + + try { + return math.min.apply(math, args); + } + catch (err) { + throw errorTransform(err); + } + }; + + math.min.transform = transform; + + return transform; + }; /***/ }, /* 28 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var isBoolean = __webpack_require__(204).isBoolean; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.range - * Adds a property transform containing the transform function. - * - * This transform creates a range which includes the end value - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - var args = argsToArray(arguments); - - var lastIndex = args.length - 1; - var last = args[lastIndex]; - if (!isBoolean(last)) { - args.push(true); // append a parameter includeEnd=true - } - - return math.range.apply(math, args); - }; - - math.range.transform = transform; - - return transform; - }; + 'use strict'; + + var isBoolean = __webpack_require__(209).isBoolean; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.range + * Adds a property transform containing the transform function. + * + * This transform creates a range which includes the end value + * @param {Object} math + */ + module.exports = function (math) { + var transform = function () { + var args = argsToArray(arguments); + + var lastIndex = args.length - 1; + var last = args[lastIndex]; + if (!isBoolean(last)) { + args.push(true); // append a parameter includeEnd=true + } + + return math.range.apply(math, args); + }; + + math.range.transform = transform; + + return transform; + }; /***/ }, /* 29 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var errorTransform = __webpack_require__(203).transform; - var isBoolean = __webpack_require__(204).isBoolean; - var argsToArray = __webpack_require__(167).argsToArray; - - /** - * Attach a transform function to math.subset - * Adds a property transform containing the transform function. - * - * This transform creates a range which includes the end value - * @param {Object} math - */ - module.exports = function (math) { - var transform = function () { - try { - return math.subset.apply(math, argsToArray(arguments)); - } - catch (err) { - throw errorTransform(err); - } - }; - - math.subset.transform = transform; - - return transform; - }; + 'use strict'; + + var errorTransform = __webpack_require__(208).transform; + var isBoolean = __webpack_require__(209).isBoolean; + var argsToArray = __webpack_require__(172).argsToArray; + + /** + * Attach a transform function to math.subset + * Adds a property transform containing the transform function. + * + * This transform creates a range which includes the end value + * @param {Object} math + */ + module.exports = function (math) { + var transform = function () { + try { + return math.subset.apply(math, argsToArray(arguments)); + } + catch (err) { + throw errorTransform(err); + } + }; + + math.subset.transform = transform; + + return transform; + }; /***/ }, /* 30 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var string = __webpack_require__(205); - - /** - * @constructor Chain - * Wrap any value in a chain, allowing to perform chained operations on - * the value. - * - * All methods available in the math.js library can be called upon the chain, - * and then will be evaluated with the value itself as first argument. - * The chain can be closed by executing chain.done(), which will return - * the final value. - * - * The Chain has a number of special functions: - * - done() Finalize the chained operation and return the - * chain's value. - * - valueOf() The same as done() - * - toString() Returns a string representation of the chain's value. - * - * @param {*} [value] - */ - function Chain (value) { - if (!(this instanceof Chain)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (value instanceof Chain) { - this.value = value.value; - } - else { - this.value = value; - } - } - - /** - * Close the chain. Returns the final value. - * Does the same as method valueOf() - * @returns {*} value - */ - Chain.prototype.done = function () { - return this.value; - }; - - /** - * Close the chain. Returns the final value. - * Does the same as method done() - * @returns {*} value - */ - Chain.prototype.valueOf = function () { - return this.value; - }; - - /** - * Get a string representation of the value in the chain - * @returns {String} - */ - Chain.prototype.toString = function () { - return string.format(this.value); - }; - - /** - * Create a proxy method for the chain - * @param {String} name - * @param {*} value The value or function to be proxied - */ - function createProxy(name, value) { - var slice = Array.prototype.slice; - if (typeof value === 'function') { - // a function - Chain.prototype[name] = function () { - var args = [this.value].concat(slice.call(arguments, 0)); - return new Chain(value.apply(this, args)); - } - } - else { - // a constant - Chain.prototype[name] = new Chain(value); - } - } - - Chain.createProxy = createProxy; - - /** - * initialise the Chain prototype with all functions and constants in math - */ - for (var prop in math) { - if (math.hasOwnProperty(prop)) { - createProxy(prop, math[prop]); - } - } - - return Chain; - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var Range = __webpack_require__(4); + var Index = __webpack_require__(5); + var isNumber = __webpack_require__(175).isNumber; + + /** + * Attach a transform function to math.index + * Adds a property transform containing the transform function. + * + * This transform creates a one-based index instead of a zero-based index + * @param {Object} math + */ + module.exports = function (math) { + var transform = function () { + var args = []; + for (var i = 0, ii = arguments.length; i < ii; i++) { + var arg = arguments[i]; + + // change from one-based to zero based, and convert BigNumber to number + if (arg instanceof Range) { + arg.start--; + arg.end -= (arg.step > 0 ? 0 : 2); + } + else if (isNumber(arg)) { + arg--; + } + else if (arg instanceof BigNumber) { + arg = arg.toNumber() - 1; + } + else { + throw new TypeError('Ranges must be a Number or Range'); + } + + args[i] = arg; + } + + var res = new Index(); + Index.apply(res, args); + return res; + }; + + math.index.transform = transform; + + return transform; + }; /***/ }, /* 31 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - _parse = __webpack_require__(16), - - collection = __webpack_require__(14), - - isString = util.string.isString, - isCollection = collection.isCollection; - - /** - * Parse and compile an expression. - * Returns a an object with a function `eval([scope])` to evaluate the - * compiled expression. - * - * Syntax: - * - * math.compile(expr) // returns one node - * math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes - * - * Examples: - * - * var code = math.compile('sqrt(3^2 + 4^2)'); - * code.eval(); // 5 - * - * var scope = {a: 3, b: 4} - * var code = math.compile('a * b'); // 12 - * code.eval(scope); // 12 - * scope.a = 5; - * code.eval(scope); // 20 - * - * var nodes = math.compile(['a = 3', 'b = 4', 'a * b']); - * nodes[2].eval(); // 12 - * - * See also: - * - * parse, eval - * - * @param {String | String[] | Matrix} expr - * The expression to be compiled - * @return {{eval: Function} | Array.<{eval: Function}>} code - * An object with the compiled expression - * @throws {Error} - */ - math.compile = function compile (expr) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('compile', arguments.length, 1); - } - - if (isString(expr)) { - // evaluate a single expression - return _parse(expr).compile(math); - } - else if (isCollection(expr)) { - // evaluate an array or matrix with expressions - return collection.deepMap(expr, function (elem) { - return _parse(elem).compile(math); - }); - } - else { - // oops - throw new TypeError('String, array, or matrix expected'); - } - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the absolute value of a number. For matrices, the function is + * evaluated element wise. + * + * Syntax: + * + * math.abs(x) + * + * Examples: + * + * math.abs(3.5); // returns Number 3.5 + * math.abs(-4.2); // returns Number 4.2 + * + * math.abs([3, -5, -1, 0, 2]); // returns Array [3, 5, 1, 0, 2] + * + * See also: + * + * sign + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * A number or matrix for which to get the absolute value + * @return {Number | BigNumber | Complex | Array | Matrix} + * Absolute value of `x` + */ + var abs = typed('abs', { + 'number': Math.abs, + + 'Complex': function (x) { + var re = Math.abs(x.re); + var im = Math.abs(x.im); + if (re < 1000 && im < 1000) { + return Math.sqrt(re * re + im * im); + } + else { + // prevent overflow for large numbers + if (re >= im) { + var i = im / re; + return re * Math.sqrt(1 + i * i); + } + else { + var j = re / im; + return im * Math.sqrt(1 + j * j); + } + } + }, + + 'BigNumber': function (x) { + return x.abs(); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since abs(0) = 0 + return collection.deepMap(x, abs, true); + } + }); + + return abs; + } + + exports.name = 'abs'; + exports.factory = factory; /***/ }, /* 32 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - _parse = __webpack_require__(16), - - collection = __webpack_require__(14), - - isString = util.string.isString, - isCollection = collection.isCollection; - - /** - * Evaluate an expression. - * - * Syntax: - * - * math.eval(expr) - * math.eval(expr, scope) - * math.eval([expr1, expr2, expr3, ...]) - * math.eval([expr1, expr2, expr3, ...], scope) - * - * Example: - * - * math.eval('(2+3)/4'); // 1.25 - * math.eval('sqrt(3^2 + 4^2)'); // 5 - * math.eval('sqrt(-4)'); // 2i - * math.eval(['a=3', 'b=4', 'a*b']);, // [3, 4, 12] - * - * var scope = {a:3, b:4}; - * math.eval('a * b', scope); // 12 - * - * See also: - * - * parse, compile - * - * @param {String | String[] | Matrix} expr The expression to be evaluated - * @param {Object} [scope] Scope to read/write variables - * @return {*} The result of the expression - * @throws {Error} - */ - math.eval = function _eval (expr, scope) { - if (arguments.length != 1 && arguments.length != 2) { - throw new math.error.ArgumentsError('eval', arguments.length, 1, 2); - } - - // instantiate a scope - scope = scope || {}; - - if (isString(expr)) { - // evaluate a single expression - return _parse(expr) - .compile(math) - .eval(scope); - } - else if (isCollection(expr)) { - // evaluate an array or matrix with expressions - return collection.deepMap(expr, function (elem) { - return _parse(elem) - .compile(math).eval(scope); - }); - } - else { - // oops - throw new TypeError('String, array, or matrix expected'); - } - }; - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var DimensionError = __webpack_require__(174); + + function factory (type, config, load, typed) { + + var collection = load(__webpack_require__(2)); + var matrix = load(__webpack_require__(75)); + var equal = load(__webpack_require__(115)); + var sparseScatter = load(__webpack_require__(210)); + var addScalar = load(__webpack_require__(211)); + + var DenseMatrix = type.DenseMatrix, + SparseMatrix = type.SparseMatrix; + + /** + * Add two values, `x + y`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.add(x, y) + * + * Examples: + * + * math.add(2, 3); // returns Number 5 + * + * var a = math.complex(2, 3); + * var b = math.complex(-4, 1); + * math.add(a, b); // returns Complex -2 + 4i + * + * math.add([1, 2, 3], 4); // returns Array [5, 6, 7] + * + * var c = math.unit('5 cm'); + * var d = math.unit('2.1 mm'); + * math.add(c, d); // returns Unit 52.1 mm + * + * See also: + * + * subtract + * + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null} x First value to add + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null} y Second value to add + * @return {Number | BigNumber | Complex | Unit | String | Array | Matrix} Sum of `x` and `y` + */ + var add = typed('add', { + + 'any, any': addScalar, + + 'Matrix, Matrix': function (x, y) { + // matrix sizes + var xsize = x.size(); + var ysize = y.size(); + + // check dimensions + if (xsize.length !== ysize.length) + throw new DimensionError(xsize.length, ysize.length); + + // result + var c; + + // process matrix storage + switch (x.storage()) { + case 'sparse': + switch (y.storage()) { + case 'sparse': + // sparse + sparse + c = _addSparseMatrixSparseMatrix(x, y, xsize, ysize); + break; + default: + c = _addSparseMatrixMatrix(x, y.valueOf(), xsize, ysize); + break; + } + break; + default: + switch (y.storage()) { + case 'sparse': + // sparse + sparse + c = _addMatrixSparseMatrix(x.valueOf(), y, xsize, ysize); + break; + default: + c = _addMatrixMatrix(x.valueOf(), y.valueOf(), x.storage()); + break; + } + break; + } + return c; + }, + + 'Array, Array': function (x, y) { + // use matrix implementation + return add(matrix(x), matrix(y)).valueOf(); + }, + + 'Array, Matrix': function (x, y) { + // use matrix implementation + return add(matrix(x), y); + }, + + 'Matrix, Array': function (x, y) { + // use matrix implementation + return add(x, matrix(y)); + }, + + 'Matrix, any': function (x, y) { + // result + var c; + // check storage format + switch (x.storage()) { + case 'sparse': + c = _addSparseMatrixScalar(x, y, x.size()); + break; + default: + c = collection.deepMap2(x, y, add); + break; + } + return c; + }, + + 'any, Matrix': function (x, y) { + // result + var c; + // check storage format + switch (y.storage()) { + case 'sparse': + c = _addSparseMatrixScalar(y, x, y.size()); + break; + default: + c = collection.deepMap2(x, y, add); + break; + } + return c; + }, + + 'Array, any': function (x, y) { + return collection.deepMap2(x, y, add); + }, + + 'any, Array': function (x, y) { + return collection.deepMap2(x, y, add); + } + }); + + /** + * C = A + B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Scalar} b Scalar value + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _addSparseMatrixScalar = function (a, b, asize) { + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a arrays + var avalues = a._values; + var aindex = a._index; + var aptr = a._ptr; + // check b is zero + if (!equal(b, 0)) { + // c arrays + var cvalues = []; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // loop columns + for (var j = 0; j < n; j++) { + // ptr for column j + cptr[j] = cindex.length; + // loop values for column j + for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) { + // sum values + var v = addScalar(avalues[k], b); + // compare with zero + if (!equal(v, 0)) { + // push to c + cindex.push(aindex[k]); + cvalues.push(v); + } + } + } + // update ptr + cptr[n] = cindex.length; + // return matrix + return c; + } + // return clone + return a.clone(); + }; + + /** + * C = A + B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b SparseMatrix (MxN) + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _addSparseMatrixSparseMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a arrays + var avalues = a._values; + // b arrays + var bvalues = b._values; + // flag indicating both matrices (a & b) contain data + var values = avalues && bvalues; + // c arrays + var cvalues = values ? [] : undefined; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // column vector (store matrix values) + var x = values ? new Array(m) : undefined; + // column vector to signal row values in column j + var w = new Array(m); + // loop columns + for (var j = 0; j < n; j++) { + // init ptr for j + cptr[j] = cindex.length; + // process column j of a and write it to x + sparseScatter(a, j, 1, w, x, j + 1, c); + // process column j of b and write it to x + sparseScatter(b, j, 1, w, x, j + 1, c); + // check matrix contains values (pattern matrix) + if (values) { + // loop column values in C + for (var p0 = cptr[j], p1 = cindex.length, p = p0; p < p1; p++) { + // copy x[i] to c[i, j] + cvalues.push(x[cindex[p]]); + } + } + } + // finish cptr + cptr[n] = cindex.length; + // return matrix + return c; + }; + + /** + * C = A + B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b DenseMatrix (MxN) + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _addSparseMatrixMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // b array + var data = b; + // c arrays + var cvalues = []; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // column vector (store matrix values) + var x = new Array(m); + // column vector to signal row values in column j + var w = new Array(m); + // loop columns + for (var j = 0; j < n; j++) { + // init ptr for j + cptr[j] = cindex.length; + // copy matrix b column to x + for (var i = 0; i < m; i++) { + // value + var v = data[i][j]; + // check for zero + if (!equal(v, 0)) { + x[i] = v; + w[i] = j + 1; + cindex.push(i); + } + } + // process column j of a and write it to x + sparseScatter(a, j, 1, w, x, j + 1, c); + // loop column values in C + for (var p0 = cptr[j], p1 = cindex.length, p = p0; p < p1; p++) { + // copy x[i] to c[i, j] + cvalues.push(x[cindex[p]]); + } + } + // finish cptr + cptr[n] = cindex.length; + // return matrix + return c; + }; + + /** + * C = A + B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b SparseMatrix (MxN) + * + * @return {Matrix} DenseMatrix (MxN) + */ + var _addMatrixSparseMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a array + var data = a; + // b arrays + var bvalues = b._values; + var bindex = b._index; + var bptr = b._ptr; + // c arrays + var cdata = clone(data); + // c matrix + var c = new DenseMatrix({ + data: cdata, + size: [m, n] + }); + // loop columns + for (var j = 0; j < n; j++) { + // loop values for column j + for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) { + // row + var i = bindex[k]; + // aggregate value + cdata[i][j] = addScalar(cdata[i][j], bvalues[k]); + } + } + // return matrix + return c; + }; + + /** + * C = A + B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b DenseMatrix (MxN) + * + * @return {Matrix} DenseMatrix (MxN) + */ + var _addMatrixMatrix = function (a, b, format) { + // TODO: find a better implementation + return matrix(collection.deepMap2(a, b, add), format); + }; + + return add; + } + + exports.name = 'add'; + exports.factory = factory; /***/ }, /* 33 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Help = __webpack_require__(9); - - /** - * Retrieve help on a function or data type. - * Help files are retrieved from the documentation in math.expression.docs. - * - * Syntax: - * - * math.help(search) - * - * Examples: - * - * console.log(math.help('sin').toString()); - * console.log(math.help(math.add).toString()); - * console.log(math.help(math.add).toJSON()); - * - * @param {function | string | Object} search A function or function name - * for which to get help - * @return {Help} A help object - */ - math.help = function help(search) { - if (arguments.length != 1) { - throw new SyntaxError('Wrong number of arguments in function help ' + - '(' + arguments.length + ' provided, 1 expected)'); - } - - var text = null; - if ((search instanceof String) || (typeof(search) === 'string')) { - text = search; - } - else { - var prop; - for (prop in math) { - // search in functions and constants - if (math.hasOwnProperty(prop) && (search === math[prop])) { - text = prop; - break; - } - } - - /* TODO: implement help for data types - if (!text) { - // search data type - for (prop in math.type) { - if (math.type.hasOwnProperty(prop)) { - if (search === math.type[prop]) { - text = prop; - break; - } - } - } - } - */ - } - - var doc = math.expression.docs[text]; - if (!text) { - throw new Error('Cannot find "' + search + '" in math.js'); - } else if (!doc) { - throw new Error('No documentation found on "' + text + '"'); - } - return new Help(doc); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Round a value towards plus infinity + * If `x` is complex, both real and imaginary part are rounded towards plus infinity. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.ceil(x) + * + * Examples: + * + * math.ceil(3.2); // returns Number 4 + * math.ceil(3.8); // returns Number 4 + * math.ceil(-4.2); // returns Number -4 + * math.ceil(-4.7); // returns Number -4 + * + * var c = math.complex(3.2, -2.7); + * math.ceil(c); // returns Complex 4 - 2i + * + * math.ceil([3.2, 3.8, -4.7]); // returns Array [4, 4, -4] + * + * See also: + * + * floor, fix, round + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded + * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value + */ + var ceil = typed('ceil', { + 'number': Math.ceil, + + 'Complex': function (x) { + return new x.constructor( + Math.ceil(x.re), + Math.ceil(x.im) + ); + }, + + 'BigNumber': function (x) { + return x.ceil(); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since ceil(0) = 0 + return collection.deepMap(x, ceil, true); + } + }); + + return ceil; + } + + exports.name = 'ceil'; + exports.factory = factory; /***/ }, /* 34 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var _parse = __webpack_require__(16); - - /** - * Parse an expression. Returns a node tree, which can be evaluated by - * invoking node.eval(); - * - * Syntax: - * - * parse(expr) - * parse(expr, options) - * parse([expr1, expr2, expr3, ...]) - * parse([expr1, expr2, expr3, ...], options) - * - * Example: - * - * var node = parse('sqrt(3^2 + 4^2)'); - * node.compile(math).eval(); // 5 - * - * var scope = {a:3, b:4} - * var node = parse('a * b'); // 12 - * var code = node.compile(math); - * code.eval(scope); // 12 - * scope.a = 5; - * code.eval(scope); // 20 - * - * var nodes = math.parse(['a = 3', 'b = 4', 'a * b']); - * nodes[2].compile(math).eval(); // 12 - * - * @param {String | String[] | Matrix} expr Expression to be parsed - * @param {{nodes: Object}} [options] Available options: - * - `nodes` a set of custom nodes - * @return {Node | Node[]} node - * @throws {Error} - */ - math.parse = function parse (expr, options) { - return _parse.apply(_parse, arguments); - } - - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var collection = load(__webpack_require__(2)); + var complexMultiply = load(__webpack_require__(212)).signatures['Complex,Complex']; + + /** + * Compute the cube of a value, `x * x * x`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.cube(x) + * + * Examples: + * + * math.cube(2); // returns Number 8 + * math.pow(2, 3); // returns Number 8 + * math.cube(4); // returns Number 64 + * 4 * 4 * 4; // returns Number 64 + * + * math.cube([1, 2, 3, 4]); // returns Array [1, 8, 27, 64] + * + * See also: + * + * multiply, square, pow + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number for which to calculate the cube + * @return {Number | BigNumber | Complex | Array | Matrix} Cube of x + */ + var cube = typed('cube', { + 'number': function (x) { + return x * x * x; + }, + + 'Complex': function (x) { + return complexMultiply(complexMultiply(x, x), x); + }, + + 'BigNumber': function (x) { + return x.times(x).times(x); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since cube(0) = 0 + return collection.deepMap(x, cube, true); + } + }); + + return cube; + } + + exports.name = 'cube'; + exports.factory = factory; /***/ }, /* 35 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - - /** - * Calculate the absolute value of a number. For matrices, the function is - * evaluated element wise. - * - * Syntax: - * - * math.abs(x) - * - * Examples: - * - * math.abs(3.5); // returns Number 3.5 - * math.abs(-4.2); // returns Number 4.2 - * - * math.abs([3, -5, -1, 0, 2]); // returns Array [3, 5, 1, 0, 2] - * - * See also: - * - * sign - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * A number or matrix for which to get the absolute value - * @return {Number | BigNumber | Complex | Array | Matrix} - * Absolute value of `x` - */ - var abs = typed('abs', { - 'number': Math.abs, - - 'Complex': function (x) { - // do not compute sqrt(re * re + im * im) since it will overflow with big numbers! - var re = Math.abs(x.re); - var im = Math.abs(x.im); - if (re >= im) { - var x = im / re; - return re * Math.sqrt(1 + x * x); - } - var y = re / im; - return im * Math.sqrt(1 + y * y); - }, - - 'BigNumber': function (x) { - return x.abs(); - }, - - 'Array | Matrix': function (coll) { - return collection.deepMap(coll, abs); - } - }); - - return abs; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var divideScalar = load(__webpack_require__(213)); + var multiply = load(__webpack_require__(47)); + var inv = load(__webpack_require__(96)); + + /** + * Divide two values, `x / y`. + * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`. + * + * Syntax: + * + * math.divide(x, y) + * + * Examples: + * + * math.divide(2, 3); // returns Number 0.6666666666666666 + * + * var a = math.complex(5, 14); + * var b = math.complex(4, 1); + * math.divide(a, b); // returns Complex 2 + 3i + * + * var c = [[7, -6], [13, -4]]; + * var d = [[1, 2], [4, 3]]; + * math.divide(c, d); // returns Array [[-9, 4], [-11, 6]] + * + * var e = math.unit('18 km'); + * math.divide(e, 4.5); // returns Unit 4 km + * + * See also: + * + * multiply + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Numerator + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} y Denominator + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Quotient, `x / y` + */ + return typed('divide', { + 'any, any': divideScalar, + + 'Array | Matrix, Array | Matrix': function (x, y) { + // TODO: implement matrix right division using pseudo inverse + // http://www.mathworks.nl/help/matlab/ref/mrdivide.html + // http://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html + // http://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour + return multiply(x, inv(y)); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, divideScalar); + }, + + 'any, Array | Matrix': function (x, y) { + return multiply(x, inv(y)); + } + }); + } + + exports.name = 'divide'; + exports.factory = factory; /***/ }, /* 36 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - // export a factory function - module.exports = function (config) { - var typed = __webpack_require__(163); - var Complex = __webpack_require__(4); - var collection = __webpack_require__(14); - - /** - * Add two values, `x + y`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.add(x, y) - * - * Examples: - * - * math.add(2, 3); // returns Number 5 - * - * var a = math.complex(2, 3); - * var b = math.complex(-4, 1); - * math.add(a, b); // returns Complex -2 + 4i - * - * math.add([1, 2, 3], 4); // returns Array [5, 6, 7] - * - * var c = math.unit('5 cm'); - * var d = math.unit('2.1 mm'); - * math.add(c, d); // returns Unit 52.1 mm - * - * See also: - * - * subtract - * - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null} x First value to add - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null} y Second value to add - * @return {Number | BigNumber | Complex | Unit | String | Array | Matrix} Sum of `x` and `y` - */ - var add = typed('add', { - 'number, number': function (x, y) { - return x + y; - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.plus(y); - }, - - 'Complex, Complex': function (x, y) { - return new Complex( - x.re + y.re, - x.im + y.im - ); - }, - - 'Unit, Unit': function (x, y) { - if (x.value == null) throw new Error('Parameter x contains a unit with undefined value'); - if (y.value == null) throw new Error('Parameter y contains a unit with undefined value'); - if (!x.equalBase(y)) throw new Error('Units do not match'); - - var res = x.clone(); - res.value += y.value; - res.fixPrefix = false; - return res; - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, add); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, add); - }, - - 'string, string': function (x, y) { - return x + y; - } - }); - - return add; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var divideScalar = load(__webpack_require__(213)); + + /** + * Divide two matrices element wise. The function accepts both matrices and + * scalar values. + * + * Syntax: + * + * math.dotDivide(x, y) + * + * Examples: + * + * math.dotDivide(2, 4); // returns 0.5 + * + * a = [[9, 5], [6, 1]]; + * b = [[3, 2], [5, 2]]; + * + * math.dotDivide(a, b); // returns [[3, 2.5], [1.2, 0.5]] + * math.divide(a, b); // returns [[1.75, 0.75], [-1.75, 2.25]] + * + * See also: + * + * divide, multiply, dotMultiply + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Numerator + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Denominator + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Quotient, `x ./ y` + */ + return typed('dotDivide', { + 'any, any': function (x, y) { + return collection.deepMap2(x, y, divideScalar); + } + }); + } + + exports.name = 'dotDivide'; + exports.factory = factory; /***/ }, /* 37 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection =collection.isCollection, - isComplex = Complex.isComplex; - - /** - * Round a value towards plus infinity - * If `x` is complex, both real and imaginary part are rounded towards plus infinity. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.ceil(x) - * - * Examples: - * - * math.ceil(3.2); // returns Number 4 - * math.ceil(3.8); // returns Number 4 - * math.ceil(-4.2); // returns Number -4 - * math.ceil(-4.7); // returns Number -4 - * - * var c = math.complex(3.2, -2.7); - * math.ceil(c); // returns Complex 4 - 2i - * - * math.ceil([3.2, 3.8, -4.7]); // returns Array [4, 4, -4] - * - * See also: - * - * floor, fix, round - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded - * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value - */ - math.ceil = function ceil(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('ceil', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.ceil(x); - } - - if (isComplex(x)) { - return new Complex ( - Math.ceil(x.re), - Math.ceil(x.im) - ); - } - - if (x instanceof BigNumber) { - return x.ceil(); - } - - if (isCollection(x)) { - return collection.deepMap(x, ceil); - } - - if (isBoolean(x) || x === null) { - return Math.ceil(x); - } - - throw new math.error.UnsupportedTypeError('ceil', math['typeof'](x)); - }; - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var multiply = load(__webpack_require__(47)); + + /** + * Multiply two matrices element wise. The function accepts both matrices and + * scalar values. + * + * Syntax: + * + * math.dotMultiply(x, y) + * + * Examples: + * + * math.dotMultiply(2, 4); // returns 8 + * + * a = [[9, 5], [6, 1]]; + * b = [[3, 2], [5, 2]]; + * + * math.dotMultiply(a, b); // returns [[27, 10], [30, 2]] + * math.multiply(a, b); // returns [[52, 28], [23, 14]] + * + * See also: + * + * multiply, divide, dotDivide + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Left hand value + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Right hand value + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Multiplication of `x` and `y` + */ + return typed('dotMultiply', { + 'any, any': function (x, y) { + return collection.deepMap2(x, y, multiply); + } + }); + } + + exports.name = 'dotMultiply'; + exports.factory = factory; /***/ }, /* 38 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Compute the cube of a value, `x * x * x`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.cube(x) - * - * Examples: - * - * math.cube(2); // returns Number 8 - * math.pow(2, 3); // returns Number 8 - * math.cube(4); // returns Number 64 - * 4 * 4 * 4; // returns Number 64 - * - * math.cube([1, 2, 3, 4]); // returns Array [1, 8, 27, 64] - * - * See also: - * - * multiply, square, pow - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number for which to calculate the cube - * @return {Number | BigNumber | Complex | Array | Matrix} Cube of x - */ - math.cube = function cube(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('cube', arguments.length, 1); - } - - if (isNumber(x)) { - return x * x * x; - } - - if (isComplex(x)) { - return math.multiply(math.multiply(x, x), x); - } - - if (x instanceof BigNumber) { - return x.times(x).times(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, cube); - } - - if (isBoolean(x) || x === null) { - return cube(+x); - } - - throw new math.error.UnsupportedTypeError('cube', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var pow = load(__webpack_require__(50)); + + /** + * Calculates the power of x to y element wise. + * + * Syntax: + * + * math.dotPow(x, y) + * + * Examples: + * + * math.dotPow(2, 3); // returns Number 8 + * + * var a = [[1, 2], [4, 3]]; + * math.dotPow(a, 2); // returns Array [[1, 4], [16, 9]] + * math.pow(a, 2); // returns Array [[9, 8], [16, 17]] + * + * See also: + * + * pow, sqrt, multiply + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x The base + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y The exponent + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} The value of `x` to the power `y` + */ + return typed('dotMultiply', { + 'any, any': function (x, y) { + return collection.deepMap2(x, y, pow); + } + }); + } + + exports.name = 'dotPow'; + exports.factory = factory; /***/ }, /* 39 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function(config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - - var divideScalar = __webpack_require__(333)(config); - var multiply = __webpack_require__(51)(config); - var inv = __webpack_require__(95)(config); - - /** - * Divide two values, `x / y`. - * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`. - * - * Syntax: - * - * math.divide(x, y) - * - * Examples: - * - * math.divide(2, 3); // returns Number 0.6666666666666666 - * - * var a = math.complex(5, 14); - * var b = math.complex(4, 1); - * math.divide(a, b); // returns Complex 2 + 3i - * - * var c = [[7, -6], [13, -4]]; - * var d = [[1, 2], [4, 3]]; - * math.divide(c, d); // returns Array [[-9, 4], [-11, 6]] - * - * var e = math.unit('18 km'); - * math.divide(e, 4.5); // returns Unit 4 km - * - * See also: - * - * multiply - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Numerator - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} y Denominator - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Quotient, `x / y` - */ - return typed('divide', { - 'any, any': divideScalar, - - 'Array | Matrix, Array | Matrix': function (x, y) { - // TODO: implement matrix right division using pseudo inverse - // http://www.mathworks.nl/help/matlab/ref/mrdivide.html - // http://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html - // http://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour - return multiply(x, inv(y)); - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, divideScalar); - }, - - 'any, Array | Matrix': function (x, y) { - return multiply(x, inv(y)); - } - }); - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the exponent of a value. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.exp(x) + * + * Examples: + * + * math.exp(2); // returns Number 7.3890560989306495 + * math.pow(math.e, 2); // returns Number 7.3890560989306495 + * math.log(math.exp(2)); // returns Number 2 + * + * math.exp([1, 2, 3]); + * // returns Array [ + * // 2.718281828459045, + * // 7.3890560989306495, + * // 20.085536923187668 + * // ] + * + * See also: + * + * log, pow + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x A number or matrix to exponentiate + * @return {Number | BigNumber | Complex | Array | Matrix} Exponent of `x` + */ + var exp = typed('exp', { + 'number': Math.exp, + + 'Complex': function (x) { + var r = Math.exp(x.re); + return new type.Complex( + r * Math.cos(x.im), + r * Math.sin(x.im) + ); + }, + + 'BigNumber': function (x) { + return x.exp(); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, exp); + } + }); + + return exp; + } + + exports.name = 'exp'; + exports.factory = factory; /***/ }, /* 40 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var collection = __webpack_require__(14); - - /** - * Divide two matrices element wise. The function accepts both matrices and - * scalar values. - * - * Syntax: - * - * math.dotDivide(x, y) - * - * Examples: - * - * math.dotDivide(2, 4); // returns 0.5 - * - * a = [[9, 5], [6, 1]]; - * b = [[3, 2], [5, 2]]; - * - * math.dotDivide(a, b); // returns [[3, 2.5], [1.2, 0.5]] - * math.divide(a, b); // returns [[1.75, 0.75], [-1.75, 2.25]] - * - * See also: - * - * divide, multiply, dotMultiply - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Numerator - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Denominator - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Quotient, `x ./ y` - */ - math.dotDivide = function dotDivide(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('dotDivide', arguments.length, 2); - } - - return collection.deepMap2(x, y, math.divide); - }; - - // TODO: deprecated since version 0.23.0, clean up some day - math.edivide = function () { - throw new Error('Function edivide is renamed to dotDivide'); - } - }; - + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Round a value towards zero. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.fix(x) + * + * Examples: + * + * math.fix(3.2); // returns Number 3 + * math.fix(3.8); // returns Number 3 + * math.fix(-4.2); // returns Number -4 + * math.fix(-4.7); // returns Number -4 + * + * var c = math.complex(3.2, -2.7); + * math.fix(c); // returns Complex 3 - 2i + * + * math.fix([3.2, 3.8, -4.7]); // returns Array [3, 3, -4] + * + * See also: + * + * ceil, floor, round + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded + * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value + */ + var fix = typed('fix', { + 'number': function (x) { + return (x > 0) ? Math.floor(x) : Math.ceil(x); + }, + + 'Complex': function (x) { + return new x.constructor( + (x.re > 0) ? Math.floor(x.re) : Math.ceil(x.re), + (x.im > 0) ? Math.floor(x.im) : Math.ceil(x.im) + ); + }, + + 'BigNumber': function (x) { + return x.isNegative() ? x.ceil() : x.floor(); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since fix(0) = 0 + return collection.deepMap(x, fix, true); + } + }); + + return fix; + } + + exports.name = 'fix'; + exports.factory = factory; /***/ }, /* 41 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - collection = __webpack_require__(14); - - /** - * Multiply two matrices element wise. The function accepts both matrices and - * scalar values. - * - * Syntax: - * - * math.dotMultiply(x, y) - * - * Examples: - * - * math.dotMultiply(2, 4); // returns 8 - * - * a = [[9, 5], [6, 1]]; - * b = [[3, 2], [5, 2]]; - * - * math.dotMultiply(a, b); // returns [[27, 10], [30, 2]] - * math.multiply(a, b); // returns [[52, 28], [23, 14]] - * - * See also: - * - * multiply, divide, dotDivide - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Left hand value - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Right hand value - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Multiplication of `x` and `y` - */ - math.dotMultiply = function dotMultiply(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('dotMultiply', arguments.length, 2); - } - - return collection.deepMap2(x, y, math.multiply); - }; - - // TODO: deprecated since version 0.23.0, clean up some day - math.emultiply = function () { - throw new Error('Function emultiply is renamed to dotMultiply'); - } - }; - + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Round a value towards minus infinity. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.floor(x) + * + * Examples: + * + * math.floor(3.2); // returns Number 3 + * math.floor(3.8); // returns Number 3 + * math.floor(-4.2); // returns Number -5 + * math.floor(-4.7); // returns Number -5 + * + * var c = math.complex(3.2, -2.7); + * math.floor(c); // returns Complex 3 - 3i + * + * math.floor([3.2, 3.8, -4.7]); // returns Array [3, 3, -5] + * + * See also: + * + * ceil, fix, round + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded + * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value + */ + var floor = typed('floor', { + 'number': Math.floor, + + 'Complex': function (x) { + return new x.constructor( + Math.floor(x.re), + Math.floor(x.im) + ); + }, + + 'BigNumber': function (x) { + return x.floor(); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since floor(0) = 0 + return collection.deepMap(x, floor, true); + } + }); + + return floor; + } + + exports.name = 'floor'; + exports.factory = factory; /***/ }, /* 42 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - collection = __webpack_require__(14); - - /** - * Calculates the power of x to y element wise. - * - * Syntax: - * - * math.dotPow(x, y) - * - * Examples: - * - * math.dotPow(2, 3); // returns Number 8 - * - * var a = [[1, 2], [4, 3]]; - * math.dotPow(a, 2); // returns Array [[1, 4], [16, 9]] - * math.pow(a, 2); // returns Array [[9, 8], [16, 17]] - * - * See also: - * - * pow, sqrt, multiply - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x The base - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y The exponent - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} The value of `x` to the power `y` - */ - math.dotPow = function dotPow(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('dotPow', arguments.length, 2); - } - - return collection.deepMap2(x, y, math.pow); - }; - - // TODO: deprecated since version 0.23.0, clean up some day - math.epow = function () { - throw new Error('Function epow is renamed to dotPow'); - } - }; - + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the greatest common divisor for two or more values or arrays. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.gcd(a, b) + * math.gcd(a, b, c, ...) + * + * Examples: + * + * math.gcd(8, 12); // returns 4 + * math.gcd(-4, 6); // returns 2 + * math.gcd(25, 15, -10); // returns 5 + * + * math.gcd([8, -4], [12, 6]); // returns [4, 2] + * + * See also: + * + * lcm, xgcd + * + * @param {... Number | BigNumber | Boolean | Array | Matrix | null} args Two or more integer numbers + * @return {Number | BigNumber | Array | Matrix} The greatest common divisor + */ + var gcd = typed('gcd', { + 'number, number': _gcd, + + 'BigNumber, BigNumber': _gcdBigNumber, + + 'Array | Matrix, Array | Matrix | number | BigNumber': function (a, b) { + return collection.deepMap2(a, b, gcd); + }, + + 'number | BigNumber, Array | Matrix': function (a, b) { + return collection.deepMap2(a, b, gcd); + }, + + // TODO: need a smarter notation here + 'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function (a, b, args) { + var res = gcd(a, b); + for (var i = 0; i < args.length; i++) { + res = gcd(res, args[i]); + } + return res; + } + }); + + return gcd; + + /** + * Calculate gcd for BigNumbers + * @param {BigNumber} a + * @param {BigNumber} b + * @returns {BigNumber} Returns greatest common denominator of a and b + * @private + */ + function _gcdBigNumber(a, b) { + if (!a.isInt() || !b.isInt()) { + throw new Error('Parameters in function gcd must be integer numbers'); + } + + // http://en.wikipedia.org/wiki/Euclidean_algorithm + var zero = new type.BigNumber(0); + while (!b.isZero()) { + var r = a.mod(b); + a = b; + b = r; + } + return a.lt(zero) ? a.neg() : a; + } + } + + /** + * Calculate gcd for numbers + * @param {number} a + * @param {number} b + * @returns {number} Returns the greatest common denominator of a and b + * @private + */ + function _gcd(a, b) { + if (!isInteger(a) || !isInteger(b)) { + throw new Error('Parameters in function gcd must be integer numbers'); + } + + // http://en.wikipedia.org/wiki/Euclidean_algorithm + var r; + while (b != 0) { + r = a % b; + a = b; + b = r; + } + return (a < 0) ? -a : a; + } + + exports.name = 'gcd'; + exports.factory = factory; /***/ }, /* 43 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var Complex = __webpack_require__(4); - var collection = __webpack_require__(14); - - /** - * Calculate the exponent of a value. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.exp(x) - * - * Examples: - * - * math.exp(2); // returns Number 7.3890560989306495 - * math.pow(math.e, 2); // returns Number 7.3890560989306495 - * math.log(math.exp(2)); // returns Number 2 - * - * math.exp([1, 2, 3]); - * // returns Array [ - * // 2.718281828459045, - * // 7.3890560989306495, - * // 20.085536923187668 - * // ] - * - * See also: - * - * log, pow - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x A number or matrix to exponentiate - * @return {Number | BigNumber | Complex | Array | Matrix} Exponent of `x` - */ - var exp = typed('exp', { - 'number': Math.exp, - - 'Complex': function (x) { - var r = Math.exp(x.re); - return new Complex( - r * Math.cos(x.im), - r * Math.sin(x.im) - ); - }, - - 'BigNumber': function (x) { - return x.exp(); - }, - - 'Array | Matrix': function (x) { - return collection.deepMap(x, exp); - } - }); - - return exp; - }; - + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the least common multiple for two or more values or arrays. + * + * lcm is defined as: + * + * lcm(a, b) = abs(a * b) / gcd(a, b) + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.lcm(a, b) + * math.lcm(a, b, c, ...) + * + * Examples: + * + * math.lcm(4, 6); // returns 12 + * math.lcm(6, 21); // returns 42 + * math.lcm(6, 21, 5); // returns 210 + * + * math.lcm([4, 6], [6, 21]); // returns [12, 42] + * + * See also: + * + * gcd, xgcd + * + * @param {... Number | BigNumber | Boolean | Array | Matrix | null} args Two or more integer numbers + * @return {Number | BigNumber | Array | Matrix} The least common multiple + */ + var lcm = typed('lcm', { + 'number, number': _lcm, + + 'BigNumber, BigNumber': _lcmBigNumber, + + 'Array | Matrix, Array | Matrix | number | BigNumber': function (a, b) { + return collection.deepMap2(a, b, lcm); + }, + + 'number | BigNumber, Array | Matrix': function (a, b) { + return collection.deepMap2(a, b, lcm); + }, + + // TODO: need a smarter notation here + 'Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber': function (a, b, args) { + var res = lcm(a, b); + for (var i = 0; i < args.length; i++) { + res = lcm(res, args[i]); + } + return res; + } + }); + + return lcm; + + /** + * Calculate lcm for two BigNumbers + * @param {BigNumber} a + * @param {BigNumber} b + * @returns {BigNumber} Returns the least common multiple of a and b + * @private + */ + function _lcmBigNumber(a, b) { + if (!a.isInt() || !b.isInt()) { + throw new Error('Parameters in function lcm must be integer numbers'); + } + + if (a.isZero() || b.isZero()) { + return new type.BigNumber(0); + } + + // http://en.wikipedia.org/wiki/Euclidean_algorithm + // evaluate lcm here inline to reduce overhead + var prod = a.times(b); + while (!b.isZero()) { + var t = b; + b = a.mod(t); + a = t; + } + return prod.div(a).abs(); + } + } + + /** + * Calculate lcm for two numbers + * @param {number} a + * @param {number} b + * @returns {number} Returns the least common multiple of a and b + * @private + */ + function _lcm (a, b) { + if (!isInteger(a) || !isInteger(b)) { + throw new Error('Parameters in function lcm must be integer numbers'); + } + + if (a == 0 || b == 0) { + return 0; + } + + // http://en.wikipedia.org/wiki/Euclidean_algorithm + // evaluate lcm here inline to reduce overhead + var t; + var prod = a * b; + while (b != 0) { + t = b; + b = a % t; + a = t; + } + return Math.abs(prod / a); + } + + exports.name = 'lcm'; + exports.factory = factory; /***/ }, /* 44 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Round a value towards zero. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.fix(x) - * - * Examples: - * - * math.fix(3.2); // returns Number 3 - * math.fix(3.8); // returns Number 3 - * math.fix(-4.2); // returns Number -4 - * math.fix(-4.7); // returns Number -4 - * - * var c = math.complex(3.2, -2.7); - * math.fix(c); // returns Complex 3 - 2i - * - * math.fix([3.2, 3.8, -4.7]); // returns Array [3, 3, -4] - * - * See also: - * - * ceil, floor, round - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded - * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value - */ - math.fix = function fix(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('fix', arguments.length, 1); - } - - if (isNumber(x)) { - return (x > 0) ? Math.floor(x) : Math.ceil(x); - } - - if (isComplex(x)) { - return new Complex( - (x.re > 0) ? Math.floor(x.re) : Math.ceil(x.re), - (x.im > 0) ? Math.floor(x.im) : Math.ceil(x.im) - ); - } - - if (x instanceof BigNumber) { - return x.isNegative() ? x.ceil() : x.floor(); - } - - if (isCollection(x)) { - return collection.deepMap(x, fix); - } - - if (isBoolean(x) || x === null) { - return fix(+x); - } - - throw new math.error.UnsupportedTypeError('fix', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var divideScalar = load(__webpack_require__(213)); + + /** + * Calculate the logarithm of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.log(x) + * math.log(x, base) + * + * Examples: + * + * math.log(3.5); // returns 1.252762968495368 + * math.exp(math.log(2.4)); // returns 2.4 + * + * math.pow(10, 4); // returns 10000 + * math.log(10000, 10); // returns 4 + * math.log(10000) / math.log(10); // returns 4 + * + * math.log(1024, 2); // returns 10 + * math.pow(2, 10); // returns 1024 + * + * See also: + * + * exp, log10 + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * Value for which to calculate the logarithm. + * @param {Number | BigNumber | Boolean | Complex | null} [base=e] + * Optional base for the logarithm. If not provided, the natural + * logarithm of `x` is calculated. + * @return {Number | BigNumber | Complex | Array | Matrix} + * Returns the logarithm of `x` + */ + var log = typed('log', { + 'number': _logNumber, + + 'Complex': function (x) { + return new type.Complex ( + Math.log(Math.sqrt(x.re * x.re + x.im * x.im)), + Math.atan2(x.im, x.re) + ); + }, + + 'BigNumber': function (x) { + return x.ln(); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, log); + }, + + 'any, any': function (x, base) { + // calculate logarithm for a specified base, log(x, base) + return divideScalar(log(x), log(base)); + } + }); + + /** + * Calculate the natural logarithm of a number + * @param {number} x + * @returns {number | Complex} + * @private + */ + function _logNumber(x) { + if (x >= 0) { + return Math.log(x); + } + else { + // negative value -> complex value computation + return log(new type.Complex(x, 0)); + } + } + + return log; + } + + exports.name = 'log'; + exports.factory = factory; /***/ }, /* 45 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Round a value towards minus infinity. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.floor(x) - * - * Examples: - * - * math.floor(3.2); // returns Number 3 - * math.floor(3.8); // returns Number 3 - * math.floor(-4.2); // returns Number -5 - * math.floor(-4.7); // returns Number -5 - * - * var c = math.complex(3.2, -2.7); - * math.floor(c); // returns Complex 3 - 3i - * - * math.floor([3.2, 3.8, -4.7]); // returns Array [3, 3, -5] - * - * See also: - * - * ceil, fix, round - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded - * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value - */ - math.floor = function floor(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('floor', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.floor(x); - } - - if (isComplex(x)) { - return new Complex ( - Math.floor(x.re), - Math.floor(x.im) - ); - } - - if (x instanceof BigNumber) { - return x.floor(); - } - - if (isCollection(x)) { - return collection.deepMap(x, floor); - } - - if (isBoolean(x) || x === null) { - return floor(+x); - } - - throw new math.error.UnsupportedTypeError('floor', math['typeof'](x)); - }; - }; + 'use strict'; + + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the 10-base of a value. This is the same as calculating `log(x, 10)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.log10(x) + * + * Examples: + * + * math.log10(0.00001); // returns -5 + * math.log10(10000); // returns 4 + * math.log(10000) / math.log(10); // returns 4 + * math.pow(10, 4); // returns 10000 + * + * See also: + * + * exp, log + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * Value for which to calculate the logarithm. + * @return {Number | BigNumber | Complex | Array | Matrix} + * Returns the 10-base logarithm of `x` + */ + var log10 = typed('log10', { + 'number': function (x) { + if (x >= 0) { + return Math.log(x) / Math.LN10; + } + else { + // negative value -> complex value computation + return log10(new type.Complex(x, 0)); + } + }, + + 'Complex': _log10Complex, + + 'BigNumber': function (x) { + if (x.isNegative()) { + // downgrade to number, return Complex valued result + return _log10Complex(new type.Complex(x.toNumber(), 0)); + } + else { + return x.log(); + } + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, log10); + } + }); + + return log10; + + /** + * Calculate log10 for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _log10Complex(x) { + return new type.Complex ( + Math.log(Math.sqrt(x.re * x.re + x.im * x.im)) / Math.LN10, + Math.atan2(x.im, x.re) / Math.LN10 + ); + } + } + + exports.name = 'log10'; + exports.factory = factory; + /***/ }, /* 46 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isCollection = collection.isCollection; - - /** - * Calculate the greatest common divisor for two or more values or arrays. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.gcd(a, b) - * math.gcd(a, b, c, ...) - * - * Examples: - * - * math.gcd(8, 12); // returns 4 - * math.gcd(-4, 6); // returns 2 - * math.gcd(25, 15, -10); // returns 5 - * - * math.gcd([8, -4], [12, 6]); // returns [4, 2] - * - * See also: - * - * lcm, xgcd - * - * @param {... Number | BigNumber | Boolean | Array | Matrix | null} args Two or more integer numbers - * @return {Number | BigNumber | Array | Matrix} The greatest common divisor - */ - math.gcd = function gcd(args) { - var a = arguments[0], - b = arguments[1], - r; // remainder - - if (arguments.length == 2) { - // two arguments - if (isNumber(a) && isNumber(b)) { - if (!isInteger(a) || !isInteger(b)) { - throw new Error('Parameters in function gcd must be integer numbers'); - } - - // http://en.wikipedia.org/wiki/Euclidean_algorithm - while (b != 0) { - r = a % b; - a = b; - b = r; - } - return (a < 0) ? -a : a; - } - - // evaluate gcd element wise - if (isCollection(a) || isCollection(b)) { - return collection.deepMap2(a, b, gcd); - } - - if (a instanceof BigNumber) { - // try to convert to big number - if (isNumber(b)) { - b = BigNumber.convert(b); - } - else if (isBoolean(b) || b === null) { - b = new BigNumber(b ? 1 : 0); - } - - if (b instanceof BigNumber) { - return _bigGcd(a, b); - } - - // downgrade to Number - return gcd(a.toNumber(), b); - } - if (b instanceof BigNumber) { - // try to convert to big number - if (isNumber(a)) { - a = BigNumber.convert(a); - } - else if (isBoolean(a) || a === null) { - a = new BigNumber(a ? 1 : 0); - } - - if (a instanceof BigNumber) { - return _bigGcd(a, b); - } - - // downgrade to Number - return gcd(a.toNumber(), b); - } - - if (isBoolean(a) || a === null) { - return gcd(+a, b); - } - if (isBoolean(b) || b === null) { - return gcd(a, +b); - } - - throw new math.error.UnsupportedTypeError('gcd', math['typeof'](a), math['typeof'](b)); - } - - if (arguments.length > 2) { - // multiple arguments. Evaluate them iteratively - for (var i = 1; i < arguments.length; i++) { - a = gcd(a, arguments[i]); - } - return a; - } - - // zero or one argument - throw new SyntaxError('Function gcd expects two or more arguments'); - }; - - /** - * Calculate gcd for BigNumbers - * @param {BigNumber} a - * @param {BigNumber} b - * @returns {BigNumber} greatest common denominator of a and b - * @private - */ - function _bigGcd(a, b) { - if (!a.isInt() || !b.isInt()) { - throw new Error('Parameters in function gcd must be integer numbers'); - } - - // http://en.wikipedia.org/wiki/Euclidean_algorithm - var zero = new BigNumber(0); - while (!b.isZero()) { - var r = a.mod(b); - a = b; - b = r; - } - return a.lt(zero) ? a.neg() : a; - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculates the modulus, the remainder of an integer division. + * + * For matrices, the function is evaluated element wise. + * + * The modulus is defined as: + * + * x - y * floor(x / y) + * + * See http://en.wikipedia.org/wiki/Modulo_operation. + * + * Syntax: + * + * math.mod(x, y) + * + * Examples: + * + * math.mod(8, 3); // returns 2 + * math.mod(11, 2); // returns 1 + * + * function isOdd(x) { + * return math.mod(x, 2) != 0; + * } + * + * isOdd(2); // returns false + * isOdd(3); // returns true + * + * See also: + * + * divide + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Dividend + * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Divisor + * @return {Number | BigNumber | Array | Matrix} Returns the remainder of `x` divided by `y`. + */ + var mod = typed('mod', { + 'number, number': _mod, + + 'BigNumber, BigNumber': function (x, y) { + return y.isZero() ? x : x.mod(y); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, mod); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, mod); + } + }); + + return mod; + + /** + * Calculate the modulus of two numbers + * @param {Number} x + * @param {Number} y + * @returns {number} res + * @private + */ + function _mod(x, y) { + if (y > 0) { + // We don't use JavaScript's % operator here as this doesn't work + // correctly for x < 0 and x == 0 + // see http://en.wikipedia.org/wiki/Modulo_operation + return x - y * Math.floor(x / y); + } + else if (y === 0) { + return x; + } + else { // y < 0 + // TODO: implement mod for a negative divisor + throw new Error('Cannot calculate mod for a negative divisor'); + } + } + } + + exports.name = 'mod'; + exports.factory = factory; /***/ }, /* 47 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isCollection = collection.isCollection; - - /** - * Calculate the least common multiple for two or more values or arrays. - * - * lcm is defined as: - * - * lcm(a, b) = abs(a * b) / gcd(a, b) - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.lcm(a, b) - * math.lcm(a, b, c, ...) - * - * Examples: - * - * math.lcm(4, 6); // returns 12 - * math.lcm(6, 21); // returns 42 - * math.lcm(6, 21, 5); // returns 210 - * - * math.lcm([4, 6], [6, 21]); // returns [12, 42] - * - * See also: - * - * gcd, xgcd - * - * @param {... Number | BigNumber | Boolean | Array | Matrix | null} args Two or more integer numbers - * @return {Number | BigNumber | Array | Matrix} The least common multiple - */ - math.lcm = function lcm(args) { - var a = arguments[0], - b = arguments[1], - t; - - if (arguments.length == 2) { - // two arguments - if (isNumber(a) && isNumber(b)) { - if (!isInteger(a) || !isInteger(b)) { - throw new Error('Parameters in function lcm must be integer numbers'); - } - - if (a == 0 || b == 0) { - return 0; - } - - // http://en.wikipedia.org/wiki/Euclidean_algorithm - // evaluate lcm here inline to reduce overhead - var prod = a * b; - while (b != 0) { - t = b; - b = a % t; - a = t; - } - return Math.abs(prod / a); - } - - // evaluate lcm element wise - if (isCollection(a) || isCollection(b)) { - return collection.deepMap2(a, b, lcm); - } - - if (a instanceof BigNumber) { - // try to convert to big number - if (isNumber(b)) { - b = BigNumber.convert(b); - } - else if (isBoolean(b) || b === null) { - b = new BigNumber(b ? 1 : 0); - } - - if (b instanceof BigNumber) { - return _bigLcm(a, b); - } - - // downgrade to Number - return lcm(a.toNumber(), b); - } - if (b instanceof BigNumber) { - // try to convert to big number - if (isNumber(a)) { - a = BigNumber.convert(a); - } - else if (isBoolean(a) || a === null) { - a = new BigNumber(a ? 1 : 0); - } - - if (a instanceof BigNumber) { - return _bigLcm(a, b); - } - - // downgrade to Number - return lcm(a.toNumber(), b); - } - - if (isBoolean(a) || a === null) { - return lcm(+a, b); - } - if (isBoolean(b) || b === null) { - return lcm(a, +b); - } - - throw new math.error.UnsupportedTypeError('lcm', math['typeof'](a), math['typeof'](b)); - } - - if (arguments.length > 2) { - // multiple arguments. Evaluate them iteratively - for (var i = 1; i < arguments.length; i++) { - a = lcm(a, arguments[i]); - } - return a; - } - - // zero or one argument - throw new SyntaxError('Function lcm expects two or more arguments'); - }; - - /** - * Calculate lcm for BigNumbers - * @param {BigNumber} a - * @param {BigNumber} b - * @returns {BigNumber} the least common multiple of a and b - * @private - */ - function _bigLcm(a, b) { - if (!a.isInt() || !b.isInt()) { - throw new Error('Parameters in function lcm must be integer numbers'); - } - - if (a.isZero() || b.isZero()) { - return new BigNumber(0); - } - - // http://en.wikipedia.org/wiki/Euclidean_algorithm - // evaluate lcm here inline to reduce overhead - var prod = a.times(b); - while (!b.isZero()) { - var t = b; - b = a.mod(t); - a = t; - } - return prod.div(a).abs(); - } - }; + 'use strict'; + + var util = __webpack_require__(171); + + var array = util.array; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var add = load(__webpack_require__(32)); + var multiplyScalar = load(__webpack_require__(212)); + var equal = load(__webpack_require__(115)); + var sparseScatter = load(__webpack_require__(210)); + + var collection = load(__webpack_require__(2)); + + var DenseMatrix = type.DenseMatrix; + var SparseMatrix = type.SparseMatrix; + var Spa = type.Spa; + + /** + * Multiply two values, `x * y`. The result is squeezed. + * For matrices, the matrix product is calculated. + * + * Syntax: + * + * math.multiply(x, y) + * + * Examples: + * + * math.multiply(4, 5.2); // returns Number 20.8 + * + * var a = math.complex(2, 3); + * var b = math.complex(4, 1); + * math.multiply(a, b); // returns Complex 5 + 14i + * + * var c = [[1, 2], [4, 3]]; + * var d = [[1, 2, 3], [3, -4, 7]]; + * math.multiply(c, d); // returns Array [[7, -6, 17], [13, -4, 33]] + * + * var e = math.unit('2.1 km'); + * math.multiply(3, e); // returns Unit 6.3 km + * + * See also: + * + * divide + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to multiply + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to multiply + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Multiplication of `x` and `y` + */ + var multiply = typed('multiply', { + + 'any, any': multiplyScalar, + + 'Array, Array': function (x, y) { + // check dimensions + _validateMatrixDimensions(array.size(x), array.size(y)); + + // use dense matrix implementation + var m = multiply(matrix(x), matrix(y)); + // return array or scalar + return m instanceof type.Matrix ? m.valueOf() : m; + }, + + 'Matrix, Matrix': function (x, y) { + // dimensions + var xsize = x.size(); + var ysize = y.size(); + + // check dimensions + _validateMatrixDimensions(xsize, ysize); + + // process dimensions + if (xsize.length === 1) { + // process y dimensions + if (ysize.length === 1) { + // Vector * Vector + return _multiplyVectorVector(x, y, xsize[0]); + } + // Vector * Matrix + return _multiplyVectorMatrix(x, y); + } + // process y dimensions + if (ysize.length === 1) { + // Matrix * Vector + return _multiplyMatrixVector(x, y); + } + // Matrix * Matrix + return _multiplyMatrixMatrix(x, y); + }, + + 'Matrix, Array': function (x, y) { + // use Matrix * Matrix implementation + return multiply(x, matrix(y)); + }, + + 'Array, Matrix': function (x, y) { + // use Matrix * Matrix implementation + return multiply(matrix(x, y.storage()), y); + }, + + 'Array, any': function (x, y) { + return collection.deepMap2(x, y, multiply); + }, + + 'Matrix, any': function (x, y) { + // use matrix map, skip zeros since 0 * X = 0 + return x.map(function (v) { + return multiply(v, y); + }, true); + }, + + 'any, Array | Matrix': function (x, y) { + // use matrix map, skip zeros since 0 * X = 0 + return y.map(function (v) { + return multiply(v, x); + }, true); + } + }); + + var _validateMatrixDimensions = function (size1, size2) { + // check left operand dimensions + switch (size1.length) { + case 1: + // check size2 + switch (size2.length) { + case 1: + // Vector x Vector + if (size1[0] !== size2[0]) { + // throw error + throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length'); + } + break; + case 2: + // Vector x Matrix + if (size1[0] !== size2[0]) { + // throw error + throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')'); + } + break; + default: + throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)'); + } + break; + case 2: + // check size2 + switch (size2.length) { + case 1: + // Matrix x Vector + if (size1[1] !== size2[0]) { + // throw error + throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')'); + } + break; + case 2: + // Matrix x Matrix + if (size1[1] !== size2[0]) { + // throw error + throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')'); + } + break; + default: + throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)'); + } + break; + default: + throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)'); + } + }; + + /** + * C = A * B + * + * @param {Matrix} a Dense Vector (N) + * @param {Matrix} b Dense Vector (N) + * + * @return {Number} Scalar value + */ + var _multiplyVectorVector = function (a, b, n) { + // check empty vector + if (n === 0) + throw new Error('Cannot multiply two empty vectors'); + + // a dense + var adata = a._data; + // b dense + var bdata = b._data; + + // result + var c = 0; + // loop data + for (var i = 0; i < n; i++) { + // multiply and accumulate + c = add(c, multiply(adata[i], bdata[i])); + } + return c; + }; + + /** + * C = A * B + * + * @param {Matrix} a Dense Vector (M) + * @param {Matrix} b Matrix (MxN) + * + * @return {Matrix} Dense Vector (N) + */ + var _multiplyVectorMatrix = function (a, b) { + // process storage + switch (b.storage()) { + case 'dense': + return _multiplyVectorDenseMatrix(a, b); + } + throw new Error('Not implemented'); + }; + + /** + * C = A * B + * + * @param {Matrix} a Dense Vector (M) + * @param {Matrix} b Dense Matrix (MxN) + * + * @return {Matrix} Dense Vector (N) + */ + var _multiplyVectorDenseMatrix = function (a, b) { + // a dense + var adata = a._data; + var asize = a._size; + // b dense + var bdata = b._data; + var bsize = b._size; + // rows & columns + var alength = asize[0]; + var bcolumns = bsize[1]; + + // result + var c = new Array(bcolumns); + + // loop matrix columns + for (var j = 0; j < bcolumns; j++) { + // sum + var sum = 0; + // loop vector + for (var i = 0; i < alength; i++) { + // multiply & accumulate + sum = add(sum, multiply(adata[i], bdata[i][j])); + } + c[j] = sum; + } + + // check we need to squeeze the result into a scalar + if (bcolumns === 1) + return c[0]; + + // return matrix + return new DenseMatrix({ + data: c, + size: [bcolumns] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a Matrix (MxN) + * @param {Matrix} b Dense Vector (N) + * + * @return {Matrix} Dense Vector (M) + */ + var _multiplyMatrixVector = function (a, b) { + // process storage + switch (a.storage()) { + case 'dense': + return _multiplyDenseMatrixVector(a, b); + case 'sparse': + return _multiplySparseMatrixVector(a, b); + } + }; + + /** + * C = A * B + * + * @param {Matrix} a Matrix (MxN) + * @param {Matrix} b Matrix (NxC) + * + * @return {Matrix} Matrix (MxC) + */ + var _multiplyMatrixMatrix = function (a, b) { + // process storage + switch (a.storage()) { + case 'dense': + // process storage + switch (b.storage()) { + case 'dense': + return _multiplyDenseMatrixDenseMatrix(a, b); + case 'sparse': + return _multiplyDenseMatrixSparseMatrix(a, b); + } + break; + case 'sparse': + // process storage + switch (b.storage()) { + case 'dense': + return _multiplySparseMatrixDenseMatrix(a, b); + case 'sparse': + return _multiplySparseMatrixSparseMatrix(a, b); + } + break; + } + }; + + /** + * C = A * B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b Dense Vector (N) + * + * @return {Matrix} Dense Vector (M) + */ + var _multiplyDenseMatrixVector = function (a, b) { + // a dense + var adata = a._data; + var asize = a._size; + // b dense + var bdata = b._data; + // rows & columns + var arows = asize[0]; + var acolumns = asize[1]; + + // result + var c = new Array(arows); + + // loop matrix a rows + for (var i = 0; i < arows; i++) { + // current row + var row = adata[i]; + // sum + var sum = 0; + // loop matrix a columns + for (var j = 0; j < acolumns; j++) { + // multiply & accumulate + sum = add(sum, multiply(row[j], bdata[j])); + } + c[i] = sum; + } + // check we need to squeeze the result into a scalar + if (arows === 1) + return c[0]; + + // return matrix + return new DenseMatrix({ + data: c, + size: [arows] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b DenseMatrix (NxC) + * + * @return {Matrix} DenseMatrix (MxC) + */ + var _multiplyDenseMatrixDenseMatrix = function (a, b) { + // a dense + var adata = a._data; + var asize = a._size; + // b dense + var bdata = b._data; + var bsize = b._size; + // rows & columns + var arows = asize[0]; + var acolumns = asize[1]; + var bcolumns = bsize[1]; + + // result + var c = new Array(arows); + + // loop matrix a rows + for (var i = 0; i < arows; i++) { + // current row + var row = adata[i]; + // initialize row array + c[i] = new Array(bcolumns); + // loop matrix b columns + for (var j = 0; j < bcolumns; j++) { + // sum + var sum = 0; + // loop matrix a columns + for (var x = 0; x < acolumns; x++) { + // multiply & accumulate + sum = add(sum, multiply(row[x], bdata[x][j])); + } + c[i][j] = sum; + } + } + // check we need to squeeze the result into a scalar + if (arows === 1 && bcolumns === 1) + return c[0][0]; + + // return matrix + return new DenseMatrix({ + data: c, + size: [arows, bcolumns] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b SparseMatrix (NxC) + * + * @return {Matrix} DenseMatrix (MxC) + */ + var _multiplyDenseMatrixSparseMatrix = function (a, b) { + // a dense + var adata = a._data; + var asize = a._size; + // b sparse + var bvalues = b._values; + var bindex = b._index; + var bptr = b._ptr; + var bsize = b._size; + // rows & columns + var arows = asize[0]; + var bcolumns = bsize[1]; + + // result + var c = new Array(arows); + + // loop a rows + for (var i = 0; i < arows; i++) { + // initialize row + c[i] = new Array(bcolumns); + // current row + var row = adata[i]; + // loop b columns + for (var j = 0; j < bcolumns; j++) { + // sum + var sum = 0; + // values & index in column j + for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) { + // row + var x = bindex[k]; + // multiply & accumulate + sum = add(sum, multiply(row[x], bvalues[k])); + } + c[i][j] = sum; + } + } + + // check we need to squeeze the result into a scalar + if (arows === 1 && bcolumns === 1) + return c[0][0]; + + // return matrix + return new DenseMatrix({ + data: c, + size: [arows, bcolumns] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b Dense Vector (N) + * + * @return {Matrix} SparseMatrix (M, 1) + */ + var _multiplySparseMatrixVector = function (a, b) { + // a sparse + var avalues = a._values; + var aindex = a._index; + var aptr = a._ptr; + // b dense + var bdata = b._data; + // rows & columns + var arows = a._size[0]; + var brows = b._size[0]; + // result + var cvalues = []; + var cindex = []; + var cptr = []; + + // create sparse accumulator + var spa = new Spa(arows); + + // update ptr + cptr.push(0); + // rows in b + for (var ib = 0; ib < brows; ib++) { + // b[ib] + var vbi = bdata[ib]; + // check b[ib] != 0, avoid loops + if (!equal(vbi, 0)) { + // A values & index in ib column + for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) { + // a row + var ia = aindex[ka]; + // accumulate + spa.accumulate(ia, multiply(vbi, avalues[ka])); + } + } + } + // process spa + spa.forEach(0, arows - 1, function (x, v) { + cindex.push(x); + cvalues.push(v); + }); + // update ptr + cptr.push(cvalues.length); + + // check we need to squeeze the result into a scalar + if (arows === 1) + return cvalues.length === 1 ? cvalues[0] : 0; + + // return sparse matrix + return new SparseMatrix({ + values : cvalues, + index: cindex, + ptr: cptr, + size: [arows, 1] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b DenseMatrix (NxC) + * + * @return {Matrix} SparseMatrix (MxC) + */ + var _multiplySparseMatrixDenseMatrix = function (a, b) { + // a sparse + var avalues = a._values; + var aindex = a._index; + var aptr = a._ptr; + // b dense + var bdata = b._data; + // rows & columns + var arows = a._size[0]; + var brows = b._size[0]; + var bcolumns = b._size[1]; + // result + var cvalues = []; + var cindex = []; + var cptr = []; + + // process column + var processColumn = function (j, v) { + cindex.push(j); + cvalues.push(v); + }; + + // loop b columns + for (var jb = 0; jb < bcolumns; jb++) { + // update ptr + cptr.push(cvalues.length); + // create sparse accumulator + var spa = new Spa(arows); + // rows in jb + for (var ib = 0; ib < brows; ib++) { + // b[ib, jb] + var vbij = bdata[ib][jb]; + // check b[ib, jb] != 0, avoid loops + if (!equal(vbij, 0)) { + // A values & index in ib column + for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) { + // a row + var ia = aindex[ka]; + // accumulate + spa.accumulate(ia, multiply(vbij, avalues[ka])); + } + } + } + // process sparse accumulator + spa.forEach(0, arows - 1, processColumn); + } + // update ptr + cptr.push(cvalues.length); + + // check we need to squeeze the result into a scalar + if (arows === 1 && bcolumns === 1) + return cvalues.length === 1 ? cvalues[0] : 0; + + // return sparse matrix + return new SparseMatrix({ + values : cvalues, + index: cindex, + ptr: cptr, + size: [arows, bcolumns] + }); + }; + + /** + * C = A * B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b SparseMatrix (NxC) + * + * @return {Matrix} SparseMatrix (MxC) + */ + var _multiplySparseMatrixSparseMatrix = function (a, b) { + // a sparse + var avalues = a._values; + // b sparse + var bvalues = b._values; + var bindex = b._index; + var bptr = b._ptr; + // rows & columns + var arows = a._size[0]; + var bcolumns = b._size[1]; + // flag indicating both matrices (a & b) contain data + var values = avalues && bvalues; + // result + var cvalues = values ? [] : undefined; + var cindex = []; + var cptr = []; + // c matrix + var c = new SparseMatrix({ + values : cvalues, + index: cindex, + ptr: cptr, + size: [arows, bcolumns] + }); + // workspace + var x = values ? new Array(arows) : undefined; + // vector with marks indicating a value x[i] exists in a given column + var w = new Array(arows); + + // loop b columns + for (var jb = 0; jb < bcolumns; jb++) { + // update ptr + cptr.push(cindex.length); + // B values & index in j + for (var kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) { + // b row + var ib = bindex[kb]; + // multiply both matrices and store results in x + sparseScatter(a, ib, bvalues ? bvalues[kb] : 1, w, x, jb + 1, c); + } + // check we need to process matrix values (pattern matrix) + if (values) { + // copy values from x to column jb of c + for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) + cvalues[p] = x[cindex[p]]; + } + } + // update ptr + cptr.push(cindex.length); + + // check we need to squeeze the result into a scalar + if (arows === 1 && bcolumns === 1 && values) + return cvalues.length === 1 ? cvalues[0] : 0; + + // return sparse matrix + return c; + }; + + return multiply; + } + + exports.name = 'multiply'; + exports.factory = factory; /***/ }, /* 48 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - var Complex = __webpack_require__(4); - - var divideScalar = __webpack_require__(333)(config); - - /** - * Calculate the logarithm of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.log(x) - * math.log(x, base) - * - * Examples: - * - * math.log(3.5); // returns 1.252762968495368 - * math.exp(math.log(2.4)); // returns 2.4 - * - * math.pow(10, 4); // returns 10000 - * math.log(10000, 10); // returns 4 - * math.log(10000) / math.log(10); // returns 4 - * - * math.log(1024, 2); // returns 10 - * math.pow(2, 10); // returns 1024 - * - * See also: - * - * exp, log10 - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * Value for which to calculate the logarithm. - * @param {Number | BigNumber | Boolean | Complex | null} [base=e] - * Optional base for the logarithm. If not provided, the natural - * logarithm of `x` is calculated. - * @return {Number | BigNumber | Complex | Array | Matrix} - * Returns the logarithm of `x` - */ - var log = typed('log', { - 'number': _logNumber, - - 'Complex': function (x) { - return new Complex ( - Math.log(Math.sqrt(x.re * x.re + x.im * x.im)), - Math.atan2(x.im, x.re) - ); - }, - - 'BigNumber': function (x) { - return x.ln(); - }, - - 'Array | Matrix': function (x) { - return collection.deepMap(x, log); - }, - - 'any, any': function (x, base) { - // calculate logarithm for a specified base, log(x, base) - return divideScalar(log(x), log(base)); - } - }); - - /** - * Calculate the natural logarithm of a number - * @param {number} x - * @returns {number | Complex} - * @private - */ - function _logNumber(x) { - if (x >= 0) { - return Math.log(x); - } - else { - // negative value -> complex value computation - return log(new Complex(x, 0)); - } - } - - return log; - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var abs = load(__webpack_require__(31)); + var add = load(__webpack_require__(32)); + var pow = load(__webpack_require__(50)); + var sqrt = load(__webpack_require__(53)); + var multiply = load(__webpack_require__(47)); + var equal = load(__webpack_require__(115)); + var larger = load(__webpack_require__(116)); + var smaller = load(__webpack_require__(118)); + var matrix = load(__webpack_require__(75)); + var trace = load(__webpack_require__(103)); + var transpose = load(__webpack_require__(104)); + + var complexAbs = abs.signatures['Complex']; + + /** + * Calculate the norm of a number, vector or matrix. + * + * The second parameter p is optional. If not provided, it defaults to 2. + * + * Syntax: + * + * math.norm(x) + * math.norm(x, p) + * + * Examples: + * + * math.abs(-3.5); // returns 3.5 + * math.norm(-3.5); // returns 3.5 + * + * math.norm(math.complex(3, -4)); // returns 5 + * + * math.norm([1, 2, -3], Infinity); // returns 3 + * math.norm([1, 2, -3], -Infinity); // returns 1 + * + * math.norm([3, 4], 2); // returns 5 + * + * math.norm([[1, 2], [3, 4]], 1) // returns 6 + * math.norm([[1, 2], [3, 4]], 'inf'); // returns 7 + * math.norm([[1, 2], [3, 4]], 'fro'); // returns 5.477225575051661 + * + * See also: + * + * abs + * + * @param {Number | BigNumber | Complex | Boolean | Array | Matrix | null} x + * Value for which to calculate the norm + * @param {Number | BigNumber | String} [p=2] + * Vector space. + * Supported numbers include Infinity and -Infinity. + * Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm) + * @return {Number | BigNumber} the p-norm + */ + var norm = typed('norm', { + 'number': Math.abs, + + 'Complex': complexAbs, + + 'BigNumber': function (x) { + // norm(x) = abs(x) + return x.abs(); + }, + + 'boolean | null' : function (x) { + // norm(x) = abs(x) + return Math.abs(x); + }, + + 'Array': function (x) { + return _norm(matrix(x), 2); + }, + + 'Matrix': function (x) { + return _norm(x, 2); + }, + + 'number | Complex | BigNumber | boolean | null, number | BigNumber | string': function (x) { + // ignore second parameter, TODO: remove the option of second parameter for these types + return norm(x); + }, + + 'Array, number | BigNumber | string': function (x, p) { + return _norm(matrix(x), p); + }, + + 'Matrix, number | BigNumber | string': function (x, p) { + return _norm(x, p); + } + }); + + /** + * Calculate the norm for an array + * @param {Array} x + * @param {number | string} p + * @returns {number} Returns the norm + * @private + */ + function _norm (x, p) { + // size + var sizeX = x.size(); + + // check if it is a vector + if (sizeX.length == 1) { + // check p + if (p === Number.POSITIVE_INFINITY || p === 'inf') { + // norm(x, Infinity) = max(abs(x)) + var pinf = 0; + // skip zeros since abs(0) == 0 + x.forEach( + function (value) { + var v = abs(value); + if (larger(v, pinf)) + pinf = v; + }, + true); + return pinf; + } + if (p === Number.NEGATIVE_INFINITY || p === '-inf') { + // norm(x, -Infinity) = min(abs(x)) + var ninf; + // skip zeros since abs(0) == 0 + x.forEach( + function (value) { + var v = abs(value); + if (!ninf || smaller(v, ninf)) + ninf = v; + }, + true); + return ninf || 0; + } + if (p === 'fro') { + return _norm(x, 2); + } + if (typeof p === 'number' && !isNaN(p)) { + // check p != 0 + if (!equal(p, 0)) { + // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p + var n = 0; + // skip zeros since abs(0) == 0 + x.forEach( + function (value) { + n = add(pow(abs(value), p), n); + }, + true); + return pow(n, 1 / p); + } + return Number.POSITIVE_INFINITY; + } + // invalid parameter value + throw new Error('Unsupported parameter value'); + } + // MxN matrix + if (sizeX.length == 2) { + // check p + if (p === 1) { + // norm(x) = the largest column sum + var c = []; + // result + var maxc = 0; + // skip zeros since abs(0) == 0 + x.forEach( + function (value, index) { + var j = index[1]; + var cj = add(c[j] || 0, abs(value)); + if (larger(cj, maxc)) + maxc = cj; + c[j] = cj; + }, + true); + return maxc; + } + if (p === Number.POSITIVE_INFINITY || p === 'inf') { + // norm(x) = the largest row sum + var r = []; + // result + var maxr = 0; + // skip zeros since abs(0) == 0 + x.forEach( + function (value, index) { + var i = index[0]; + var ri = add(r[i] || 0, abs(value)); + if (larger(ri, maxr)) + maxr = ri; + r[i] = ri; + }, + true); + return maxr; + } + if (p === 'fro') { + // norm(x) = sqrt(sum(diag(x'x))) + return sqrt(trace(multiply(transpose(x), x))); + } + if (p === 2) { + // not implemented + throw new Error('Unsupported parameter value, missing implementation of matrix singular value decomposition'); + } + // invalid parameter value + throw new Error('Unsupported parameter value'); + } + } + + return norm; + } + + exports.name = 'norm'; + exports.factory = factory; /***/ }, /* 49 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Calculate the 10-base of a value. This is the same as calculating `log(x, 10)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.log10(x) - * - * Examples: - * - * math.log10(0.00001); // returns -5 - * math.log10(10000); // returns 4 - * math.log(10000) / math.log(10); // returns 4 - * math.pow(10, 4); // returns 10000 - * - * See also: - * - * exp, log - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * Value for which to calculate the logarithm. - * @return {Number | BigNumber | Complex | Array | Matrix} - * Returns the 10-base logarithm of `x` - */ - math.log10 = function log10(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('log10', arguments.length, 1); - } - - if (isNumber(x)) { - if (x >= 0) { - return Math.log(x) / Math.LN10; - } - else { - // negative value -> complex value computation - return log10(new Complex(x, 0)); - } - } - - if (x instanceof BigNumber) { - if (x.isNegative()) { - // negative value -> downgrade to number to do complex value computation - return log10(x.toNumber()); - } - else { - return x.log(); - } - } - - if (isComplex(x)) { - return new Complex ( - Math.log(Math.sqrt(x.re * x.re + x.im * x.im)) / Math.LN10, - Math.atan2(x.im, x.re) / Math.LN10 - ); - } - - if (isCollection(x)) { - return collection.deepMap(x, log10); - } - - if (isBoolean(x) || x === null) { - return log10(+x); - } - - throw new math.error.UnsupportedTypeError('log10', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the nth root of a value. + * The principal nth root of a positive real number A, is the positive real + * solution of the equation + * + * x^root = A + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.nthRoot(a) + * math.nthRoot(a, root) + * + * Examples: + * + * math.nthRoot(9, 2); // returns 3, as 3^2 == 9 + * math.sqrt(9); // returns 3, as 3^2 == 9 + * math.nthRoot(64, 3); // returns 4, as 4^3 == 64 + * + * See also: + * + * sqrt, pow + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} a + * Value for which to calculate the nth root + * @param {Number | BigNumber | Boolean | null} [root=2] The root. + * @return {Number | Complex | Array | Matrix} Returns the nth root of `a` + */ + var nthRoot = typed('nthRoot', { + 'number': function (x) { + return _nthRoot(x, 2); + }, + 'number, number': _nthRoot, + + 'BigNumber': function (x) { + return _bigNthRoot(x, new type.BigNumber(2)); + }, + 'BigNumber, BigNumber': _bigNthRoot, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, nthRoot); + }, + + 'Array | Matrix, any': function (x, root) { + return collection.deepMap2(x, root, nthRoot); + }, + + 'any, Array | Matrix': function (x, root) { + return collection.deepMap2(x, root, nthRoot); + } + }); + + return nthRoot; + + /** + * Calculate the nth root of a for BigNumbers, solve x^root == a + * http://rosettacode.org/wiki/Nth_root#JavaScript + * @param {BigNumber} a + * @param {BigNumber} root + * @private + */ + function _bigNthRoot(a, root) { + var zero = new type.BigNumber(0); + var one = new type.BigNumber(1); + var inv = root.isNegative(); + if (inv) root = root.negated(); + + if (root.isZero()) throw new Error('Root must be non-zero'); + if (a.isNegative() && !root.abs().mod(2).equals(1)) throw new Error('Root must be odd when a is negative.'); + + // edge cases zero and infinity + if (a.isZero()) return zero; + if (!a.isFinite()) + { + return inv ? zero : a; + } + + var x = one; // Initial guess + var i = 0; + var iMax = 100; + do { + var xPrev = x; + var delta = a.div(x.pow(root.minus(1))).minus(x).div(root); + x = x.plus(delta); + i++; + } + while (!x.equals(xPrev) && i < iMax); + + return inv ? one.div(x) : x; + } + } + + /** + * Calculate the nth root of a, solve x^root == a + * http://rosettacode.org/wiki/Nth_root#JavaScript + * @param {number} a + * @param {number} root + * @private + */ + function _nthRoot(a, root) { + var inv = root < 0; + if (inv) root = -root; + + if (root === 0) throw new Error('Root must be non-zero'); + if (a < 0 && (Math.abs(root) % 2 != 1)) throw new Error('Root must be odd when a is negative.'); + + // edge cases zero and infinity + if (a == 0) return 0; + if (!Number.isFinite(a)) { + return inv ? 0 : a; + } + + var epsilon = 1e-16; + var x = 1; // Initial guess + var i = 0; + var iMax = 100; + do { + var delta = (a / Math.pow(x, root - 1) - x) / root; + x = x + delta; + i++; + } + while (Math.abs(delta) > epsilon && i < iMax); + + return inv ? 1 / x : x; + } + + exports.name = 'nthRoot'; + exports.factory = factory; /***/ }, /* 50 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection = collection.isCollection; - - /** - * Calculates the modulus, the remainder of an integer division. - * - * For matrices, the function is evaluated element wise. - * - * The modulus is defined as: - * - * x - y * floor(x / y) - * - * See http://en.wikipedia.org/wiki/Modulo_operation. - * - * Syntax: - * - * math.mod(x, y) - * - * Examples: - * - * math.mod(8, 3); // returns 2 - * math.mod(11, 2); // returns 1 - * - * function isOdd(x) { - * return math.mod(x, 2) != 0; - * } - * - * isOdd(2); // returns false - * isOdd(3); // returns true - * - * See also: - * - * divide - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Dividend - * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Divisor - * @return {Number | BigNumber | Array | Matrix} Returns the remainder of `x` divided by `y`. - */ - math.mod = function mod(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('mod', arguments.length, 2); - } - - // see http://functions.wolfram.com/IntegerFunctions/Mod/ - - if (isNumber(x)) { - if (isNumber(y)) { - // number % number - return _mod(x, y); - } - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - else if (isBoolean(y) || y === null) { - y = new BigNumber(y ? 1 : 0); - } - - if (y instanceof BigNumber) { - return y.isZero() ? x : x.mod(y); - } - - // downgrade x to Number - return mod(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - else if (isBoolean(x) || x === null) { - x = new BigNumber(x ? 1 : 0); - } - - if (x instanceof BigNumber) { - return y.isZero() ? x : x.mod(y); - } - - // downgrade y to Number - return mod(x, y.toNumber()); - } - - // TODO: implement mod for complex values - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, mod); - } - - if (isBoolean(x) || x === null) { - return mod(+x, y); - } - if (isBoolean(y) || y === null) { - return mod(x, +y); - } - - throw new math.error.UnsupportedTypeError('mod', math['typeof'](x), math['typeof'](y)); - }; - - /** - * Calculate the modulus of two numbers - * @param {Number} x - * @param {Number} y - * @returns {number} res - * @private - */ - function _mod(x, y) { - if (y > 0) { - // We don't use JavaScript's % operator here as this doesn't work - // correctly for x < 0 and x == 0 - // see http://en.wikipedia.org/wiki/Modulo_operation - return x - y * Math.floor(x / y); - } - else if (y == 0) { - return x; - } - else { // y < 0 - // TODO: implement mod for a negative divisor - throw new Error('Cannot calculate mod for a negative divisor'); - } - } - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var exp = load(__webpack_require__(39)); + var eye = load(__webpack_require__(94)); + var log = load(__webpack_require__(44)); + var multiply = load(__webpack_require__(47)); + var matrix = load(__webpack_require__(75)); + + /** + * Calculates the power of x to y, `x ^ y`. + * Matrix exponentiation is supported for square matrices `x`, and positive + * integer exponents `y`. + * + * Syntax: + * + * math.pow(x, y) + * + * Examples: + * + * math.pow(2, 3); // returns Number 8 + * + * var a = math.complex(2, 3); + * math.pow(a, 2) // returns Complex -5 + 12i + * + * var b = [[1, 2], [4, 3]]; + * math.pow(b, 2); // returns Array [[9, 8], [16, 17]] + * + * See also: + * + * multiply, sqrt + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x The base + * @param {Number | BigNumber | Boolean | Complex | null} y The exponent + * @return {Number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y` + */ + var pow = typed('pow', { + 'number, number': function (x, y) { + if (isInteger(y) || x >= 0) { + return Math.pow(x, y); + } + else { + return _powComplex(new type.Complex(x, 0), new type.Complex(y, 0)); + } + }, + + 'BigNumber, BigNumber': function (x, y) { + if (isInteger(y) || x >= 0) { + return x.pow(y); + } + else { + return _powComplex(new type.Complex(x.toNumber(), 0), new type.Complex(y.toNumber(), 0)); + } + }, + + 'Complex, Complex': _powComplex, + + 'Array, number': _powArray, + + 'Array, BigNumber': function (x, y) { + return _powArray(x, y.toNumber()); + }, + + 'Matrix, number': _powMatrix, + + 'Matrix, BigNumber': function (x, y) { + return _powMatrix(x, y.toNumber()); + } + }); + + /** + * Calculates the power of x to y, x^y, for two complex numbers. + * @param {Complex} x + * @param {Complex} y + * @return {Complex} res + * @private + */ + function _powComplex (x, y) { + // complex computation + // x^y = exp(log(x)*y) = exp((abs(x)+i*arg(x))*y) + // TODO: we can optimize this as we know x and y are Complex + // expComplex = exp.signatures['Complex,Complex'] + // multiplyComplex = multiply.signatures['Complex,Complex'] + // logComplex = log.signatures['Complex,Complex'] + // return expComplex(multiplyComplex(logComplex(x), y)); + return exp(multiply(log(x), y)); + } + + /** + * Calculate the power of a 2d array + * @param {Array} x must be a 2 dimensional, square matrix + * @param {number} y a positive, integer value + * @returns {Array} + * @private + */ + function _powArray(x, y) { + if (!isInteger(y) || y < 0) { + throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')'); + } + // verify that A is a 2 dimensional square matrix + var s = size(x); + if (s.length != 2) { + throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)'); + } + if (s[0] != s[1]) { + throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')'); + } + + var res = eye(s[0]).valueOf(); + var px = x; + while (y >= 1) { + if ((y & 1) == 1) { + res = multiply(px, res); + } + y >>= 1; + px = multiply(px, px); + } + return res; + } + + /** + * Calculate the power of a 2d matrix + * @param {Matrix} x must be a 2 dimensional, square matrix + * @param {number} y a positive, integer value + * @returns {Matrix} + * @private + */ + function _powMatrix (x, y) { + return matrix(_powArray(x.valueOf(), y)); + } + + return pow; + } + + exports.name = 'pow'; + exports.factory = factory; /***/ }, /* 51 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var size = __webpack_require__(167).size; - - var Complex = __webpack_require__(4); - var Matrix = __webpack_require__(7); - var collection = __webpack_require__(14); - - var add = __webpack_require__(36)(config); - - /** - * Multiply two values, `x * y`. The result is squeezed. - * For matrices, the matrix product is calculated. - * - * Syntax: - * - * math.multiply(x, y) - * - * Examples: - * - * math.multiply(4, 5.2); // returns Number 20.8 - * - * var a = math.complex(2, 3); - * var b = math.complex(4, 1); - * math.multiply(a, b); // returns Complex 5 + 14i - * - * var c = [[1, 2], [4, 3]]; - * var d = [[1, 2, 3], [3, -4, 7]]; - * math.multiply(c, d); // returns Array [[7, -6, 17], [13, -4, 33]] - * - * var e = math.unit('2.1 km'); - * math.multiply(3, e); // returns Unit 6.3 km - * - * See also: - * - * divide - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to multiply - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to multiply - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Multiplication of `x` and `y` - */ - var multiply = typed('multiply', { - 'number, number': function (x, y) { - return x * y; - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.times(y); - }, - - 'Complex, Complex': function (x, y) { - return new Complex( - x.re * y.re - x.im * y.im, - x.re * y.im + x.im * y.re - ); - }, - - 'number, Unit': function (x, y) { - var res = y.clone(); - res.value = (res.value === null) ? res._normalize(x) : (res.value * x); - return res; - }, - - 'Unit, number': function (x, y) { - var res = x.clone(); - res.value = (res.value === null) ? res._normalize(y) : (res.value * y); - return res; - }, - - 'Array, Array': function (x, y) { - return _multiply(x, y); - }, - - 'Matrix, Matrix': function (x, y) { - var res = multiply(x.valueOf(), y.valueOf()); - return Array.isArray(res) ? new Matrix(res) : res; - }, - - 'Matrix, Array': function (x, y) { - var res = multiply(x.valueOf(), y); - return Array.isArray(res) ? new Matrix(res) : res; - }, - - 'Array, Matrix': function (x, y) { - var res = multiply(x, y.valueOf()); - return Array.isArray(res) ? new Matrix(res) : res; - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, multiply); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, multiply); - } - }); - - /** - * Multiply two arrays. Checks dimensions - * @param {Array} x - * @param {Array} y - * @returns {Array | *} Returns an Array or a scalar - * @private - */ - function _multiply(x, y) { - var sizeX = size(x); - var sizeY = size(y); - - if (sizeX.length == 1) { - if (sizeY.length == 1) { - // vector * vector - if (sizeX[0] != sizeY[0]) { - throw new RangeError('Dimension mismatch in multiplication. ' + - 'Length of A must match length of B ' + - '(A is ' + sizeX[0] + - ', B is ' + sizeY[0] + ', ' + - sizeX[0] + ' != ' + sizeY[0] + ')'); - } - - return _multiplyVectorVector(x, y); - } - else if (sizeY.length == 2) { - // vector * matrix - if (sizeX[0] != sizeY[0]) { - throw new RangeError('Dimension mismatch in multiplication. ' + - 'Length of A must match rows of B ' + - '(A is ' + sizeX[0] + - ', B is ' + sizeY[0] + 'x' + sizeY[1] + ', ' + - sizeX[0] + ' != ' + sizeY[0] + ')'); - } - - return _multiplyVectorMatrix(x, y); - } - else { - throw new Error('Can only multiply a 1 or 2 dimensional matrix ' + - '(B has ' + sizeY.length + ' dimensions)'); - } - } - else if (sizeX.length == 2) { - if (sizeY.length == 1) { - // matrix * vector - if (sizeX[1] != sizeY[0]) { - throw new RangeError('Dimension mismatch in multiplication. ' + - 'Columns of A must match length of B ' + - '(A is ' + sizeX[0] + 'x' + sizeX[0] + - ', B is ' + sizeY[0] + ', ' + - sizeX[1] + ' != ' + sizeY[0] + ')'); - } - - return _multiplyMatrixVector(x, y); - } - else if (sizeY.length == 2) { - // matrix * matrix - if (sizeX[1] != sizeY[0]) { - throw new RangeError('Dimension mismatch in multiplication. ' + - 'Columns of A must match rows of B ' + - '(A is ' + sizeX[0] + 'x' + sizeX[1] + - ', B is ' + sizeY[0] + 'x' + sizeY[1] + ', ' + - sizeX[1] + ' != ' + sizeY[0] + ')'); - } - - return _multiplyMatrixMatrix(x, y); - } - else { - throw new Error('Can only multiply a 1 or 2 dimensional matrix ' + - '(B has ' + sizeY.length + ' dimensions)'); - } - } - else { - throw new Error('Can only multiply a 1 or 2 dimensional matrix ' + - '(A has ' + sizeX.length + ' dimensions)'); - } - } - - /** - * Multiply two 2-dimensional matrices. - * The size of the matrices is not validated. - * @param {Array} x A 2d matrix - * @param {Array} y A 2d matrix - * @return {Array | Number} result - * @private - */ - function _multiplyMatrixMatrix(x, y) { - // TODO: performance of matrix multiplication can be improved - var res = [], - rows = x.length, - cols = y[0].length, - num = x[0].length; - - for (var r = 0; r < rows; r++) { - res[r] = []; - for (var c = 0; c < cols; c++) { - var result = null; - for (var n = 0; n < num; n++) { - var p = multiply(x[r][n], y[n][c]); - result = (result === null) ? p : add(result, p); - } - res[r][c] = result; - } - } - - var isScalar = rows === 1 && cols === 1; - return isScalar ? res[0][0] : res; - } - - /** - * Multiply a vector with a 2-dimensional matrix - * The size of the matrices is not validated. - * @param {Array} x A vector - * @param {Array} y A 2d matrix - * @return {Array | Number} result - * @private - */ - function _multiplyVectorMatrix(x, y) { - // TODO: performance of matrix multiplication can be improved - var res = [], - rows = y.length, - cols = y[0].length; - - for (var c = 0; c < cols; c++) { - var result = null; - for (var r = 0; r < rows; r++) { - var p = multiply(x[r], y[r][c]); - result = (r === 0) ? p : add(result, p); - } - res[c] = result; - } - - return res.length === 1 ? res[0] : res; - } - - /** - * Multiply a 2-dimensional matrix with a vector - * The size of the matrices is not validated. - * @param {Array} x A 2d matrix - * @param {Array} y A vector - * @return {Array | Number} result - * @private - */ - function _multiplyMatrixVector(x, y) { - // TODO: performance of matrix multiplication can be improved - var res = [], - rows = x.length, - cols = x[0].length; - - for (var r = 0; r < rows; r++) { - var result = null; - for (var c = 0; c < cols; c++) { - var p = multiply(x[r][c], y[c]); - result = (c === 0) ? p : add(result, p); - } - res[r] = result; - } - - return res.length === 1 ? res[0] : res; - } - - /** - * Multiply two vectors, calculate the dot product - * The size of the matrices is not validated. - * @param {Array} x A vector - * @param {Array} y A vector - * @return {Number} dotProduct - * @private - */ - function _multiplyVectorVector(x, y) { - // TODO: performance of matrix multiplication can be improved - var len = x.length; - - if (!len) { - throw new Error('Cannot multiply two empty vectors'); - } - - var dot = 0; - for (var i = 0; i < len; i++) { - dot = add(dot, multiply(x[i], y[i])); - } - return dot; - } - - return multiply; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var toFixed = __webpack_require__(175).toFixed; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Round a value towards the nearest integer. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.round(x) + * math.round(x, n) + * + * Examples: + * + * math.round(3.2); // returns Number 3 + * math.round(3.8); // returns Number 4 + * math.round(-4.2); // returns Number -4 + * math.round(-4.7); // returns Number -5 + * math.round(math.pi, 3); // returns Number 3.142 + * math.round(123.45678, 2); // returns Number 123.46 + * + * var c = math.complex(3.2, -2.7); + * math.round(c); // returns Complex 3 - 3i + * + * math.round([3.2, 3.8, -4.7]); // returns Array [3, 4, -5] + * + * See also: + * + * ceil, fix, floor + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded + * @param {Number | BigNumber | Boolean | Array | null} [n=0] Number of decimals + * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value + */ + var round = typed('round', { + 'number': Math.round, + + 'number, number': function (x, n) { + if (!isInteger(n)) {throw new TypeError('Number of decimals in function round must be an integer');} + if (n < 0 || n > 15) {throw new Error('Number of decimals in function round must be in te range of 0-15');} + + return _round(x, n); + }, + + 'Complex': function (x) { + return new type.Complex ( + Math.round(x.re), + Math.round(x.im) + ); + }, + + 'Complex, number': function (x, n) { + return new type.Complex ( + _round(x.re, n), + _round(x.im, n) + ); + }, + + 'Complex, BigNumber': function (x, n) { + var _n = n.toNumber(); + return new type.Complex ( + _round(x.re, _n), + _round(x.im, _n) + ); + }, + + 'BigNumber': function (x) { + return x.toDecimalPlaces(0); + }, + + 'BigNumber, BigNumber': function (x, n) { + if (!n.isInteger()) {throw new TypeError('Number of decimals in function round must be an integer');} + + return x.toDecimalPlaces(n.toNumber()); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since round(0) = 0 + return collection.deepMap(x, round, true); + }, + + 'Array | Matrix, number | BigNumber': function (x, n) { + return collection.deepMap2(x, n, round); + }, + + 'number | Complex | BigNumber, Array | Matrix': function (x, n) { + return collection.deepMap2(x, n, round); + } + }); + + return round; + } + + /** + * round a number to the given number of decimals, or to zero if decimals is + * not provided + * @param {Number} value + * @param {Number} decimals number of decimals, between 0 and 15 (0 by default) + * @return {Number} roundedValue + * @private + */ + function _round (value, decimals) { + return parseFloat(toFixed(value, decimals)); + } + + exports.name = 'round'; + exports.factory = factory; /***/ }, /* 52 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - array = __webpack_require__(167), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isArray = Array.isArray; - - /** - * Calculate the norm of a number, vector or matrix. - * - * The second parameter p is optional. If not provided, it defaults to 2. - * - * Syntax: - * - * math.norm(x) - * math.norm(x, p) - * - * Examples: - * - * math.abs(-3.5); // returns 3.5 - * math.norm(-3.5); // returns 3.5 - * - * math.norm(math.complex(3, -4)); // returns 5 - * - * math.norm([1, 2, -3], Infinity); // returns 3 - * math.norm([1, 2, -3], -Infinity); // returns 1 - * - * math.norm([3, 4], 2); // returns 5 - * - * math.norm([[1, 2], [3, 4]], 1) // returns 6 - * math.norm([[1, 2], [3, 4]], 'inf'); // returns 7 - * math.norm([[1, 2], [3, 4]], 'fro'); // returns 5.477225575051661 - * - * See also: - * - * abs - * - * @param {Number | BigNumber | Complex | Boolean | Array | Matrix | null} x - * Value for which to calculate the norm - * @param {Number | String} [p=2] - * Vector space. - * Supported numbers include Infinity and -Infinity. - * Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm) - * @return {Number} the p-norm - */ - math.norm = function norm(x, p) { - if (arguments.length < 1 || arguments.length > 2) { - throw new math.error.ArgumentsError('abs', arguments.length, 1, 2); - } - - if (isNumber(x)) { - // norm(x) = abs(x) - return Math.abs(x); - } - - if (isComplex(x)) { - // do not compute sqrt(re * re + im * im) since it will overflow with big numbers! - var re = Math.abs(x.re); - var im = Math.abs(x.im); - if (re >= im) { - var x = im / re; - return re * Math.sqrt(1 + x * x); - } - var y = re / im; - return im * Math.sqrt(1 + y * y); - } - - if (x instanceof BigNumber) { - // norm(x) = abs(x) - return x.abs(); - } - - if (isBoolean(x) || x === null) { - // norm(x) = abs(x) - return Math.abs(x); - } - - if (isArray(x)) { - // size - var sizeX = array.size(x); - // missing p - if (p == null) - p = 2; - // check it is a Vector - if (sizeX.length == 1) { - // check p - if (p === Number.POSITIVE_INFINITY || p === 'inf') { - // norm(x, Infinity) = max(abs(x)) - var n; - math.forEach(x, function (value) { - var v = math.abs(value); - if (!n || math.larger(v, n)) - n = v; - }); - return n; - } - if (p === Number.NEGATIVE_INFINITY || p === '-inf') { - // norm(x, -Infinity) = min(abs(x)) - var n; - math.forEach(x, function (value) { - var v = math.abs(value); - if (!n || math.smaller(v, n)) - n = v; - }); - return n; - } - if (p === 'fro') - return norm(x); - if (isNumber(p) && !isNaN(p)) { - // check p != 0 - if (!math.equal(p, 0)) { - // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p - var n = 0; - math.forEach(x, function (value) { - n = math.add(math.pow(math.abs(value), p), n); - }); - return math.pow(n, 1 / p); - } - return Number.POSITIVE_INFINITY; - } - // invalid parameter value - throw new Error('Unsupported parameter value'); - } - else if (sizeX.length == 2) { - // check p - if (p == 1) { - // norm(x) = the largest column sum - var c = []; - // loop rows - for (var i = 0; i < x.length; i++) { - var r = x[i]; - // loop columns - for (var j = 0; j < r.length; j++) { - c[j] = math.add(c[j] || 0, math.abs(r[j])); - } - } - return math.max(c); - } - if (p == Number.POSITIVE_INFINITY || p === 'inf') { - // norm(x) = the largest row sum - var n = 0; - // loop rows - for (var i = 0; i < x.length; i++) { - var rs = 0; - var r = x[i]; - // loop columns - for (var j = 0; j < r.length; j++) { - rs = math.add(rs, math.abs(r[j])); - } - if (math.larger(rs, n)) - n = rs; - } - return n; - } - if (p === 'fro') { - // norm(x) = sqrt(sum(diag(x'x))) - var d = math.diag(math.multiply(math.transpose(x), x)); - var s = 0; - math.forEach(d, function (value) { - s = math.add(value, s); - }); - return math.sqrt(s); - } - if (p == 2) { - // not implemented - throw new Error('Unsupported parameter value, missing implementation of matrix singular value decomposition'); - } - // invalid parameter value - throw new Error('Unsupported parameter value'); - } - } - - if (x instanceof Matrix) { - return norm(x.valueOf(), p); - } - - throw new math.error.UnsupportedTypeError('norm', x); - }; - }; + 'use strict'; + + var number = __webpack_require__(175); + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Compute the sign of a value. The sign of a value x is: + * + * - 1 when x > 1 + * - -1 when x < 0 + * - 0 when x == 0 + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.sign(x) + * + * Examples: + * + * math.sign(3.5); // returns 1 + * math.sign(-4.2); // returns -1 + * math.sign(0); // returns 0 + * + * math.sign([3, 5, -2, 0, 2]); // returns [1, 1, -1, 0, 1] + * + * See also: + * + * abs + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * The number for which to determine the sign + * @return {Number | BigNumber | Complex | Array | Matrix}e + * The sign of `x` + */ + var sign = typed('sign', { + 'number': number.sign, + + 'Complex': function (x) { + var abs = Math.sqrt(x.re * x.re + x.im * x.im); + return new x.constructor(x.re / abs, x.im / abs); + }, + + 'BigNumber': function (x) { + return new x.constructor(x.cmp(0)); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since sign(0) = 0 + return collection.deepMap(x, sign, true); + } + }); + + return sign; + } + + exports.name = 'sign'; + exports.factory = factory; + /***/ }, /* 53 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164); - - var BigNumber = math.type.BigNumber; - var collection = __webpack_require__(14); - - var isNumber = util.number.isNumber; - var isBoolean = util['boolean'].isBoolean; - var isCollection = collection.isCollection; - - /** - * Calculate the nth root of a value. - * The principal nth root of a positive real number A, is the positive real - * solution of the equation - * - * x^root = A - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.nthRoot(a, root) - * - * Examples: - * - * math.nthRoot(9, 2); // returns 3, as 3^2 == 9 - * math.sqrt(9); // returns 3, as 3^2 == 9 - * math.nthRoot(64, 3); // returns 4, as 4^3 == 64 - * - * See also: - * - * sqrt, pow - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} a - * Value for which to calculate the nth root - * @param {Number | BigNumber | Boolean | null} [root=2] The root. - * @return {Number | Complex | Array | Matrix} Returns the nth root of `a` - */ - math.nthRoot = function nthRoot (a, root) { - if (arguments.length != 1 && arguments.length != 2) { - throw new math.error.ArgumentsError('nthRoot', arguments.length, 1, 2); - } - - switch(arguments.length) { - case 1: - if (isNumber(a)) { - return _nthRoot(a); - } - else if (a instanceof BigNumber) { - return _nthRootBig(a); - } - else if (isCollection(a)) { - return collection.deepMap(x, nthRoot); - } - - if (isBoolean(a) || a === null) { - return nthRoot(+a); - } - - break; - - case 2: - if (isNumber(a)) { - if (isNumber(root)) { - return _nthRoot(a, root); - } - else if (root instanceof BigNumber) { - // try to convert to bignumber - a = BigNumber.convert(a); - - if (a instanceof BigNumber) { - return _nthRootBig(a, root); - } - else { - // downgrade to number - return _nthRoot(a, root.toNumber()); - } - } - } - else if (a instanceof BigNumber) { - // try to convert to bignumber - if (isNumber(root)) { - root = BigNumber.convert(root); - } - - if (root instanceof BigNumber) { - return _nthRootBig(a, root); - } - else { - // downgrade to number - return _nthRoot(a.toNumber(), root); - } - } - else if (isCollection(a) && !isCollection(root)) { - return collection.deepMap2(a, root, nthRoot); - } - - if (isBoolean(a) || a === null) { - return nthRoot(+a, root); - } - if (isBoolean(root) || root === null) { - return nthRoot(a, +root); - } - - break; - - default: - throw new math.error.ArgumentsError('nthRoot', arguments.length, 1, 2); - } - - if (isBoolean(x) || x === null) { - return arguments.length == 2 ? nthRoot(+x, n) : nthRoot(+x); - } - - - throw new math.error.UnsupportedTypeError('nthRoot', math['typeof'](a), math['typeof'](root)); - }; - - /** - * Calculate the nth root of a, solve x^root == a - * http://rosettacode.org/wiki/Nth_root#JavaScript - * @param {number} a - * @param {number} [root=2] - * @private - */ - function _nthRoot(a, root) { - var _root = (root != undefined) ? root : 2; - var inv = _root < 0; - if (inv) _root = -_root; - - if (_root == 0) throw new Error('Root must be non-zero'); - if (a < 0 && (Math.abs(_root) % 2 != 1)) throw new Error('Root must be odd when a is negative.'); - - // edge cases zero and infinity - if (a == 0) return 0; - if (!Number.isFinite(a)) { - return inv ? 0 : a; - } - - var epsilon = 1e-16; - var x = 1; // Initial guess - var i = 0; - var iMax = 100; - do { - var delta = (a / Math.pow(x, _root - 1) - x) / _root; - x = x + delta; - i++; - } - while (Math.abs(delta) > epsilon && i < iMax); - - return inv ? 1 / x : x; - } - - /** - * Calculate the nth root of a for BigNumbers, solve x^root == a - * http://rosettacode.org/wiki/Nth_root#JavaScript - * @param {BigNumber} a - * @param {BigNumber} [root=2] - * @private - */ - function _nthRootBig(a, root) { - var _root = (root != undefined) ? root : new BigNumber(2); - var zero = new BigNumber(0); - var one = new BigNumber(1); - var inv = _root.isNegative(); - if (inv) _root = _root.negated(); - - if (_root.isZero()) throw new Error('Root must be non-zero'); - if (a.isNegative() && !_root.abs().mod(2).equals(1)) throw new Error('Root must be odd when a is negative.'); - - // edge cases zero and infinity - if (a.isZero()) return zero; - if (!a.isFinite()) - { - return inv ? zero : a; - } - - var x = one; // Initial guess - var i = 0; - var iMax = 100; - do { - var xPrev = x; - var delta = a.div(x.pow(_root.minus(1))).minus(x).div(_root); - x = x.plus(delta); - i++; - } - while (!x.equals(xPrev) && i < iMax); - - return inv ? one.div(x) : x; - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the square root of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.sqrt(x) + * + * Examples: + * + * math.sqrt(25); // returns 5 + * math.square(5); // returns 25 + * math.sqrt(-4); // returns Complex -2i + * + * See also: + * + * square, multiply + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * Value for which to calculate the square root. + * @return {Number | BigNumber | Complex | Array | Matrix} + * Returns the square root of `x` + */ + var sqrt = typed('sqrt', { + 'number': _sqrtNumber, + + 'Complex': _sqrtComplex, + + 'BigNumber': function (x) { + if (x.isNegative()) { + // negative value -> downgrade to number to do complex value computation + return _sqrtNumber(x.toNumber()); + } + else { + return x.sqrt(); + } + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since sqrt(0) = 0 + return collection.deepMap(x, sqrt, true); + } + }); + + /** + * Calculate sqrt for a number + * @param {Number} x + * @returns {Number | Complex} Returns the square root of x + * @private + */ + function _sqrtNumber(x) { + if (x >= 0) { + return Math.sqrt(x); + } + else { + return _sqrtComplex(new type.Complex(x, 0)); + } + } + + /** + * Calculate sqrt for a complex number + * @param {Complex} x + * @returns {Complex} Returns the square root of x + * @private + */ + function _sqrtComplex(x) { + var r = Math.sqrt(x.re * x.re + x.im * x.im); + + var re, im; + + if (x.re >= 0) { + re = 0.5 * Math.sqrt(2.0 * (r + x.re)); + } + else { + re = Math.abs(x.im) / Math.sqrt(2 * (r - x.re)); + } + + if (x.re <= 0) { + im = 0.5 * Math.sqrt(2.0 * (r - x.re)); + } + else { + im = Math.abs(x.im) / Math.sqrt(2 * (r + x.re)); + } + + if (x.im >= 0) { + return new type.Complex(re, im); + } + else { + return new type.Complex(re, -im); + } + } + + return sqrt; + } + + exports.name = 'sqrt'; + exports.factory = factory; /***/ }, /* 54 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var Matrix = __webpack_require__(7); - var Complex = __webpack_require__(4); - var isInteger = __webpack_require__(3).isInteger; - var size = __webpack_require__(167).size; - - var exp = __webpack_require__(43)(config); - var eye = __webpack_require__(93)(config); - var log = __webpack_require__(48)(config); - var multiply = __webpack_require__(51)(config); - - /** - * Calculates the power of x to y, `x ^ y`. - * Matrix exponentiation is supported for square matrices `x`, and positive - * integer exponents `y`. - * - * Syntax: - * - * math.pow(x, y) - * - * Examples: - * - * math.pow(2, 3); // returns Number 8 - * - * var a = math.complex(2, 3); - * math.pow(a, 2) // returns Complex -5 + 12i - * - * var b = [[1, 2], [4, 3]]; - * math.pow(b, 2); // returns Array [[9, 8], [16, 17]] - * - * See also: - * - * multiply, sqrt - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x The base - * @param {Number | BigNumber | Boolean | Complex | null} y The exponent - * @return {Number | BigNumber | Complex | Array | Matrix} The value of `x` to the power `y` - */ - var pow = typed('pow', { - 'number, number': function (x, y) { - if (isInteger(y) || x >= 0) { - return Math.pow(x, y); - } - else { - return _powComplex(new Complex(x, 0), new Complex(y, 0)); - } - }, - - 'BigNumber, BigNumber': function (x, y) { - if (isInteger(y) || x >= 0) { - return x.pow(y); - } - else { - return _powComplex(new Complex(x.toNumber(), 0), new Complex(y.toNumber(), 0)); - } - }, - - 'Complex, Complex': _powComplex, - - 'Array, number': _powArray, - - 'Array, BigNumber': function (x, y) { - return _powArray(x, y.toNumber()); - }, - - 'Matrix, number': _powMatrix, - - 'Matrix, BigNumber': function (x, y) { - return _powMatrix(x, y.toNumber()); - } - }); - - /** - * Calculates the power of x to y, x^y, for two complex numbers. - * @param {Complex} x - * @param {Complex} y - * @return {Complex} res - * @private - */ - function _powComplex (x, y) { - // complex computation - // x^y = exp(log(x)*y) = exp((abs(x)+i*arg(x))*y) - // TODO: we can optimize this as we know x and y are Complex - // expComplex = exp.signatures['Complex,Complex'] - // multiplyComplex = multiply.signatures['Complex,Complex'] - // logComplex = log.signatures['Complex,Complex'] - // return expComplex(multiplyComplex(logComplex(x), y)); - return exp(multiply(log(x), y)); - } - - /** - * Calculate the power of a 2d array - * @param {Array} x must be a 2 dimensional, square matrix - * @param {number} y a positive, integer value - * @returns {Array} - * @private - */ - function _powArray(x, y) { - if (!isInteger(y) || y < 0) { - throw new TypeError('For A^b, b must be a positive integer (value is ' + y + ')'); - } - // verify that A is a 2 dimensional square matrix - var s = size(x); - if (s.length != 2) { - throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)'); - } - if (s[0] != s[1]) { - throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')'); - } - - var res = eye(s[0]).valueOf(); - var px = x; - while (y >= 1) { - if ((y & 1) == 1) { - res = multiply(px, res); - } - y >>= 1; - px = multiply(px, px); - } - return res; - } - - /** - * Calculate the power of a 2d matrix - * @param {Matrix} x must be a 2 dimensional, square matrix - * @param {number} y a positive, integer value - * @returns {Matrix} - * @private - */ - function _powMatrix (x, y) { - return new Matrix(_powArray(x.valueOf(), y)); - } - - return pow; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Compute the square of a value, `x * x`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.square(x) + * + * Examples: + * + * math.square(2); // returns Number 4 + * math.square(3); // returns Number 9 + * math.pow(3, 2); // returns Number 9 + * math.multiply(3, 3); // returns Number 9 + * + * math.square([1, 2, 3, 4]); // returns Array [1, 4, 9, 16] + * + * See also: + * + * multiply, cube, sqrt, pow + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x + * Number for which to calculate the square + * @return {Number | BigNumber | Complex | Array | Matrix} + * Squared value + */ + var square = typed('square', { + 'number': function (x) { + return x * x; + }, + + 'Complex': function (x) { + return new x.constructor( + x.re * x.re - x.im * x.im, + x.re * x.im + x.im * x.re + ); + }, + + 'BigNumber': function (x) { + return x.times(x); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since square(0) = 0 + return collection.deepMap(x, square, true); + } + }); + + return square; + } + + exports.name = 'square'; + exports.factory = factory; /***/ }, /* 55 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isInteger = util.number.isInteger, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Round a value towards the nearest integer. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.round(x) - * math.round(x, n) - * - * Examples: - * - * math.round(3.2); // returns Number 3 - * math.round(3.8); // returns Number 4 - * math.round(-4.2); // returns Number -4 - * math.round(-4.7); // returns Number -5 - * math.round(math.pi, 3); // returns Number 3.142 - * math.round(123.45678, 2); // returns Number 123.46 - * - * var c = math.complex(3.2, -2.7); - * math.round(c); // returns Complex 3 - 3i - * - * math.round([3.2, 3.8, -4.7]); // returns Array [3, 4, -5] - * - * See also: - * - * ceil, fix, floor - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Number to be rounded - * @param {Number | BigNumber | Boolean | Array | null} [n=0] Number of decimals - * @return {Number | BigNumber | Complex | Array | Matrix} Rounded value - */ - math.round = function round(x, n) { - if (arguments.length != 1 && arguments.length != 2) { - throw new math.error.ArgumentsError('round', arguments.length, 1, 2); - } - - if (n == undefined) { - // round (x) - if (isNumber(x)) { - return Math.round(x); - } - - if (isComplex(x)) { - return new Complex ( - Math.round(x.re), - Math.round(x.im) - ); - } - - if (x instanceof BigNumber) { - return x.toDecimalPlaces(0); - } - - if (isCollection(x)) { - return collection.deepMap(x, round); - } - - if (isBoolean(x) || x === null) { - return Math.round(x); - } - - throw new math.error.UnsupportedTypeError('round', math['typeof'](x)); - } - else { - // round (x, n) - if (!isNumber(n) || !isInteger(n)) { - if (n instanceof BigNumber) { - n = parseFloat(n.valueOf()); - } - else if (isBoolean(n) || x === null) { - return round(x, +n); - } - else { - throw new TypeError('Number of decimals in function round must be an integer'); - } - } - if (n < 0 || n > 15) { - throw new Error ('Number of decimals in function round must be in te range of 0-15'); - } - - if (isNumber(x)) { - return roundNumber(x, n); - } - - if (isComplex(x)) { - return new Complex ( - roundNumber(x.re, n), - roundNumber(x.im, n) - ); - } - - if (x instanceof BigNumber) { - return x.toDecimalPlaces(n); - } - - if (isCollection(x) || isCollection(n)) { - return collection.deepMap2(x, n, round); - } - - if (isBoolean(x) || x === null) { - return round(+x, n); - } - - throw new math.error.UnsupportedTypeError('round', math['typeof'](x), math['typeof'](n)); - } - }; - - /** - * round a number to the given number of decimals, or to zero if decimals is - * not provided - * @param {Number} value - * @param {Number} decimals number of decimals, between 0 and 15 (0 by default) - * @return {Number} roundedValue - */ - function roundNumber (value, decimals) { - var p = Math.pow(10, decimals); - return Math.round(value * p) / p; - } - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var DimensionError = __webpack_require__(174); + + function factory (type, config, load, typed) { + + var unaryMinus = load(__webpack_require__(56)); + var matrix = load(__webpack_require__(75)); + var equal = load(__webpack_require__(115)); + var sparseScatter = load(__webpack_require__(210)); + + var collection = load(__webpack_require__(2)); + + var DenseMatrix = type.DenseMatrix, + SparseMatrix = type.SparseMatrix; + + /** + * Subtract two values, `x - y`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.subtract(x, y) + * + * Examples: + * + * math.subtract(5.3, 2); // returns Number 3.3 + * + * var a = math.complex(2, 3); + * var b = math.complex(4, 1); + * math.subtract(a, b); // returns Complex -2 + 2i + * + * math.subtract([5, 7, 4], 4); // returns Array [1, 3, 0] + * + * var c = math.unit('2.1 km'); + * var d = math.unit('500m'); + * math.subtract(c, d); // returns Unit 1.6 km + * + * See also: + * + * add + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x + * Initial value + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y + * Value to subtract from `x` + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} + * Subtraction of `x` and `y` + */ + var subtract = typed('subtract', { + + 'number, number': function (x, y) { + return x - y; + }, + + 'Complex, Complex': function (x, y) { + return new type.Complex ( + x.re - y.re, + x.im - y.im + ); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.minus(y); + }, + + 'Unit, Unit': function (x, y) { + if (x.value == null) { + throw new Error('Parameter x contains a unit with undefined value'); + } + + if (y.value == null) { + throw new Error('Parameter y contains a unit with undefined value'); + } + + if (!x.equalBase(y)) { + throw new Error('Units do not match'); + } + + var res = x.clone(); + res.value -= y.value; + res.fixPrefix = false; + + return res; + }, + + 'Matrix, Matrix': function (x, y) { + // matrix sizes + var xsize = x.size(); + var ysize = y.size(); + + // check dimensions + if (xsize.length !== ysize.length) + throw new DimensionError(xsize.length, ysize.length); + + // result + var c; + + // process matrix storage + switch (x.storage()) { + case 'sparse': + switch (y.storage()) { + case 'sparse': + // sparse - sparse + c = _subtractSparseMatrixSparseMatrix(x, y, xsize, ysize); + break; + default: + c = _subtractSparseMatrixMatrix(x, y.valueOf(), xsize, ysize); + break; + } + break; + default: + switch (y.storage()) { + case 'sparse': + // sparse - sparse + c = _subtractMatrixSparseMatrix(x.valueOf(), y, xsize, ysize); + break; + default: + c = _subtractMatrixMatrix(x.valueOf(), y.valueOf(), x.storage()); + break; + } + break; + } + return c; + }, + + 'Array, Array': function (x, y) { + // use matrix implementation + return subtract(matrix(x), matrix(y)).valueOf(); + }, + + 'Array, Matrix': function (x, y) { + // use matrix implementation + return subtract(matrix(x), y); + }, + + 'Matrix, Array': function (x, y) { + // use matrix implementation + return subtract(x, matrix(y)); + }, + + 'Matrix, any': function (x, y) { + // result + var c; + // check storage format + switch (x.storage()) { + case 'sparse': + c = _subtractSparseMatrixScalar(x, y, x.size()); + break; + default: + c = collection.deepMap2(x, y, subtract); + break; + } + return c; + }, + + 'any, Matrix': function (x, y) { + // result + var c; + // check storage format + switch (y.storage()) { + case 'sparse': + c = _subtractScalarSparseMatrix(x, y, y.size()); + break; + default: + c = collection.deepMap2(x, y, subtract); + break; + } + return c; + }, + + 'Array, any': function (x, y) { + return collection.deepMap2(x, y, subtract); + }, + + 'any, Array': function (x, y) { + return collection.deepMap2(x, y, subtract); + } + }); + + /** + * C = A - B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Scalar} b Scalar value + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _subtractSparseMatrixScalar = function (a, b, asize) { + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a arrays + var avalues = a._values; + var aindex = a._index; + var aptr = a._ptr; + // check b is zero + if (!equal(b, 0)) { + // c arrays + var cvalues = []; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // loop columns + for (var j = 0; j < n; j++) { + // ptr for column j + cptr[j] = cindex.length; + // loop values for column j + for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) { + // subtract values + var v = subtract(avalues[k], b); + // compare with zero + if (!equal(v, 0)) { + // push to c + cindex.push(aindex[k]); + cvalues.push(v); + } + } + } + // update ptr + cptr[n] = cindex.length; + // return matrix + return c; + } + // return clone + return a.clone(); + }; + + /** + * C = A - B + * + * @param {Scalar} a Scalar value + * @param {Matrix} b SparseMatrix (MxN) + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _subtractScalarSparseMatrix = function (a, b, asize) { + // rows and columns + var m = asize[0]; + var n = asize[1]; + // b arrays + var bvalues = b._values; + var bindex = b._index; + var bptr = b._ptr; + // check a is zero + if (!equal(a, 0)) { + // c arrays + var cvalues = []; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // loop columns + for (var j = 0; j < n; j++) { + // ptr for column j + cptr[j] = cindex.length; + // loop values for column j + for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) { + // subtract values + var v = subtract(a, bvalues[k]); + // compare with zero + if (!equal(v, 0)) { + // push to c + cindex.push(bindex[k]); + cvalues.push(v); + } + } + } + // update ptr + cptr[n] = cindex.length; + // return matrix + return c; + } + // return clone + return b.clone(); + }; + + /** + * C = A - B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b SparseMatrix (MxN) + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _subtractSparseMatrixSparseMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a arrays + var avalues = a._values; + // b arrays + var bvalues = b._values; + // flag indicating both matrices (a & b) contain data + var values = avalues && bvalues; + // c arrays + var cvalues = values ? [] : undefined; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // column vector (store matrix values) + var x = values ? new Array(m) : undefined; + // column vector to signal row values in column j + var w = new Array(m); + // loop columns + for (var j = 0; j < n; j++) { + // init ptr for j + cptr[j] = cindex.length; + // process column j of a and write it to x + sparseScatter(a, j, 1, w, x, j + 1, c); + // process column j of b and write it to x (multiply value by negative one) + sparseScatter(b, j, -1, w, x, j + 1, c); + // check matrix contains values (pattern matrix) + if (values) { + // loop column values in C + for (var p0 = cptr[j], p1 = cindex.length, p = p0; p < p1; p++) { + // copy x[i] to c[i, j] + cvalues.push(x[cindex[p]]); + } + } + } + // finish cptr + cptr[n] = cindex.length; + // return matrix + return c; + }; + + /** + * C = A - B + * + * @param {Matrix} a SparseMatrix (MxN) + * @param {Matrix} b DenseMatrix (MxN) + * + * @return {Matrix} SparseMatrix (MxN) + */ + var _subtractSparseMatrixMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // b array + var data = b; + // c arrays + var cvalues = []; + var cindex = []; + var cptr = new Array(n); + // c matrix + var c = new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [m, n] + }); + // column vector (store matrix values) + var x = new Array(m); + // column vector to signal row values in column j + var w = new Array(m); + // loop columns + for (var j = 0; j < n; j++) { + // init ptr for j + cptr[j] = cindex.length; + // copy matrix b column to x + for (var i = 0; i < m; i++) { + // -value + var v = unaryMinus(data[i][j]); + // check for zero + if (!equal(v, 0)) { + x[i] = v; + w[i] = j + 1; + cindex.push(i); + } + } + // process column j of a and write it to x + sparseScatter(a, j, 1, w, x, j + 1, c); + // loop column values in C + for (var p0 = cptr[j], p1 = cindex.length, p = p0; p < p1; p++) { + // copy x[i] to c[i, j] + cvalues.push(x[cindex[p]]); + } + } + // finish cptr + cptr[n] = cindex.length; + // return matrix + return c; + }; + + /** + * C = A - B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b SparseMatrix (MxN) + * + * @return {Matrix} DenseMatrix (MxN) + */ + var _subtractMatrixSparseMatrix = function (a, b, asize, bsize) { + // check dimensions + if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) + throw new RangeError('Dimension mismatch in add. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')'); + // rows and columns + var m = asize[0]; + var n = asize[1]; + // a array + var data = a; + // b arrays + var bvalues = b._values; + var bindex = b._index; + var bptr = b._ptr; + // c arrays + var cdata = clone(data); + // c matrix + var c = new DenseMatrix({ + data: cdata, + size: [m, n] + }); + // loop columns + for (var j = 0; j < n; j++) { + // loop values for column j + for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) { + // row + var i = bindex[k]; + // subtract value + cdata[i][j] = subtract(cdata[i][j], bvalues[k]); + } + } + // return matrix + return c; + }; + + /** + * C = A - B + * + * @param {Matrix} a DenseMatrix (MxN) + * @param {Matrix} b DenseMatrix (MxN) + * + * @return {Matrix} DenseMatrix (MxN) + */ + var _subtractMatrixMatrix = function (a, b, format) { + // TODO: find a better implementation + return matrix(collection.deepMap2(a, b, subtract), format); + }; + + return subtract; + } + + exports.name = 'subtract'; + exports.factory = factory; /***/ }, /* 56 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - number = util.number, - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Compute the sign of a value. The sign of a value x is: - * - * - 1 when x > 1 - * - -1 when x < 0 - * - 0 when x == 0 - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.sign(x) - * - * Examples: - * - * math.sign(3.5); // returns 1 - * math.sign(-4.2); // returns -1 - * math.sign(0); // returns 0 - * - * math.sign([3, 5, -2, 0, 2]); // returns [1, 1, -1, 0, 1] - * - * See also: - * - * abs - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * The number for which to determine the sign - * @return {Number | BigNumber | Complex | Array | Matrix}e - * The sign of `x` - */ - math.sign = function sign(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('sign', arguments.length, 1); - } - - if (isNumber(x)) { - return number.sign(x); - } - - if (isComplex(x)) { - var abs = Math.sqrt(x.re * x.re + x.im * x.im); - return new Complex(x.re / abs, x.im / abs); - } - - if (x instanceof BigNumber) { - return new BigNumber(x.cmp(0)); - } - - if (isCollection(x)) { - return collection.deepMap(x, sign); - } - - if (isBoolean(x) || x === null) { - return number.sign(x); - } - - throw new math.error.UnsupportedTypeError('sign', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Inverse the sign of a value, apply a unary minus operation. + * + * For matrices, the function is evaluated element wise. Boolean values and + * strings will be converted to a number. For complex numbers, both real and + * complex value are inverted. + * + * Syntax: + * + * math.unaryMinus(x) + * + * Examples: + * + * math.unaryMinus(3.5); // returns -3.5 + * math.unaryMinus(-4.2); // returns 4.2 + * + * See also: + * + * add, subtract, unaryPlus + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Number to be inverted. + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Returns the value with inverted sign. + */ + var unaryMinus = typed('unaryMinus', { + 'number': function (x) { + return -x; + }, + + 'Complex': function (x) { + return new x.constructor(-x.re, -x.im); + }, + + 'BigNumber': function (x) { + return x.neg(); + }, + + 'Unit': function (x) { + var res = x.clone(); + res.value = -x.value; + return res; + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since unaryMinus(0) = 0 + return collection.deepMap(x, unaryMinus, true); + } + + // TODO: add support for string + }); + + return unaryMinus; + } + + exports.name = 'unaryMinus'; + exports.factory = factory; /***/ }, /* 57 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - var Complex = __webpack_require__(4); - - /** - * Calculate the square root of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.sqrt(x) - * - * Examples: - * - * math.sqrt(25); // returns 5 - * math.square(5); // returns 25 - * math.sqrt(-4); // returns Complex -2i - * - * See also: - * - * square, multiply - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * Value for which to calculate the square root. - * @return {Number | BigNumber | Complex | Array | Matrix} - * Returns the square root of `x` - */ - var sqrt = typed('sqrt', { - 'number': _sqrtNumber, - - 'Complex': _sqrtComplex, - - 'BigNumber': function (x) { - if (x.isNegative()) { - // negative value -> downgrade to number to do complex value computation - return _sqrtNumber(x.toNumber()); - } - else { - return x.sqrt(); - } - }, - - 'Array | Matrix': function (coll) { - return collection.deepMap(coll, sqrt); - } - }); - - /** - * Calculate sqrt for a number - * @param {Number} x - * @returns {Number | Complex} Returns the square root of x - * @private - */ - function _sqrtNumber(x) { - if (x >= 0) { - return Math.sqrt(x); - } - else { - return _sqrtComplex(new Complex(x, 0)); - } - } - - /** - * Calculate sqrt for a complex number - * @param {Complex} x - * @returns {Complex} Returns the square root of x - * @private - */ - function _sqrtComplex(x) { - var r = Math.sqrt(x.re * x.re + x.im * x.im); - - var re, im; - - if (x.re >= 0) { - re = 0.5 * Math.sqrt(2.0 * (r + x.re)); - } - else { - re = Math.abs(x.im) / Math.sqrt(2 * (r - x.re)); - } - - if (x.re <= 0) { - im = 0.5 * Math.sqrt(2.0 * (r - x.re)); - } - else { - im = Math.abs(x.im) / Math.sqrt(2 * (r + x.re)); - } - - if (x.im >= 0) { - return new Complex(re, im); - } - else { - return new Complex(re, -im); - } - } - - return sqrt; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Unary plus operation. + * Boolean values and strings will be converted to a number, numeric values will be returned as is. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.unaryPlus(x) + * + * Examples: + * + * math.unaryPlus(3.5); // returns 3.5 + * math.unaryPlus(1); // returns 1 + * + * See also: + * + * unaryMinus, add, subtract + * + * @param {Number | BigNumber | Boolean | String | Complex | Unit | Array | Matrix | null} x + * Input value + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} + * Returns the input value when numeric, converts to a number when input is non-numeric. + */ + var unaryPlus = typed('unaryPlus', { + 'number': function (x) { + return x; + }, + + 'Complex': function (x) { + return x.clone(); + }, + + 'BigNumber': function (x) { + return x; + }, + + 'Unit': function (x) { + return x.clone(); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since unaryPlus(0) = 0 + return collection.deepMap(x, unaryPlus, true); + }, + + 'boolean | string | null': function (x) { + // convert to a number or bignumber + return (config.number == 'bignumber') ? new type.BigNumber(+x): +x; + } + }); + + return unaryPlus; + } + + exports.name = 'unaryPlus'; + exports.factory = factory; /***/ }, /* 58 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Compute the square of a value, `x * x`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.square(x) - * - * Examples: - * - * math.square(2); // returns Number 4 - * math.square(3); // returns Number 9 - * math.pow(3, 2); // returns Number 9 - * math.multiply(3, 3); // returns Number 9 - * - * math.square([1, 2, 3, 4]); // returns Array [1, 4, 9, 16] - * - * See also: - * - * multiply, cube, sqrt, pow - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x - * Number for which to calculate the square - * @return {Number | BigNumber | Complex | Array | Matrix} - * Squared value - */ - math.square = function square(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('square', arguments.length, 1); - } - - if (isNumber(x)) { - return x * x; - } - - if (isComplex(x)) { - return math.multiply(x, x); - } - - if (x instanceof BigNumber) { - return x.times(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, square); - } - - if (isBoolean(x) || x === null) { - return x * x; - } - - throw new math.error.UnsupportedTypeError('square', math['typeof'](x)); - }; - }; - + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var matrix = load(__webpack_require__(75)); + + /** + * Calculate the extended greatest common divisor for two values. + * See http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm. + * + * Syntax: + * + * math.xgcd(a, b) + * + * Examples: + * + * math.xgcd(8, 12); // returns [4, -1, 1] + * math.gcd(8, 12); // returns 4 + * math.xgcd(36163, 21199); // returns [1247, -7, 12] + * + * See also: + * + * gcd, lcm + * + * @param {Number | BigNumber | Boolean} a An integer number + * @param {Number | BigNumber | Boolean} b An integer number + * @return {Array} Returns an array containing 3 integers `[div, m, n]` + * where `div = gcd(a, b)` and `a*m + b*n = div` + */ + return typed('xgcd', { + 'number, number': _xgcd, + 'BigNumber, BigNumber': _xgcdBigNumber + }); + + /** + * Calculate xgcd for two numbers + * @param {Number} a + * @param {Number} b + * @return {Number} result + * @private + */ + function _xgcd (a, b) { + // source: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm + var t, // used to swap two variables + q, // quotient + r, // remainder + x = 0, lastx = 1, + y = 1, lasty = 0; + + if (!isInteger(a) || !isInteger(b)) { + throw new Error('Parameters in function xgcd must be integer numbers'); + } + + while (b) { + q = Math.floor(a / b); + r = a % b; + + t = x; + x = lastx - q * x; + lastx = t; + + t = y; + y = lasty - q * y; + lasty = t; + + a = b; + b = r; + } + + var res; + if (a < 0) { + res = [-a, -lastx, -lasty]; + } + else { + res = [a, a ? lastx : 0, lasty]; + } + return (config.matrix === 'array') ? res : matrix(res); + } + + /** + * Calculate xgcd for two BigNumbers + * @param {BigNumber} a + * @param {BigNumber} b + * @return {BigNumber[]} result + * @private + */ + function _xgcdBigNumber(a, b) { + // source: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm + var t, // used to swap two variables + q, // quotient + r, // remainder + zero = new type.BigNumber(0), + x = new type.BigNumber(0), lastx = new type.BigNumber(1), + y = new type.BigNumber(1), lasty = new type.BigNumber(0); + + if (!a.isInt() || !b.isInt()) { + throw new Error('Parameters in function xgcd must be integer numbers'); + } + + while (!b.isZero()) { + q = a.div(b).floor(); + r = a.mod(b); + + t = x; + x = lastx.minus(q.times(x)); + lastx = t; + + t = y; + y = lasty.minus(q.times(y)); + lasty = t; + + a = b; + b = r; + } + + var res; + if (a.lt(zero)) { + res = [a.neg(), lastx.neg(), lasty.neg()]; + } + else { + res = [a, !a.isZero() ? lastx : 0, lasty]; + } + return (config.matrix === 'array') ? res : matrix(res); + } + } + + exports.name = 'xgcd'; + exports.factory = factory; /***/ }, /* 59 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var Complex = __webpack_require__(4); - var collection = __webpack_require__(14); - - /** - * Subtract two values, `x - y`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.subtract(x, y) - * - * Examples: - * - * math.subtract(5.3, 2); // returns Number 3.3 - * - * var a = math.complex(2, 3); - * var b = math.complex(4, 1); - * math.subtract(a, b); // returns Complex -2 + 2i - * - * math.subtract([5, 7, 4], 4); // returns Array [1, 3, 0] - * - * var c = math.unit('2.1 km'); - * var d = math.unit('500m'); - * math.subtract(c, d); // returns Unit 1.6 km - * - * See also: - * - * add - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x - * Initial value - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y - * Value to subtract from `x` - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} - * Subtraction of `x` and `y` - */ - var subtract = typed('subtract', { - 'number, number': function (x, y) { - return x - y; - }, - - 'Complex, Complex': function (x, y) { - return new Complex ( - x.re - y.re, - x.im - y.im - ); - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.minus(y); - }, - - 'Unit, Unit': function (x, y) { - if (x.value == null) { - throw new Error('Parameter x contains a unit with undefined value'); - } - - if (y.value == null) { - throw new Error('Parameter y contains a unit with undefined value'); - } - - if (!x.equalBase(y)) { - throw new Error('Units do not match'); - } - - var res = x.clone(); - res.value -= y.value; - res.fixPrefix = false; - - return res; - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, subtract); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, subtract); - } - }); - - return subtract; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigBitAnd = __webpack_require__(214).and; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise AND two values, `x & y`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.bitAnd(x, y) + * + * Examples: + * + * math.bitAnd(53, 131); // returns Number 1 + * + * math.bitAnd([1, 12, 31], 42); // returns Array [0, 8, 10] + * + * See also: + * + * bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to and + * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to and + * @return {Number | BigNumber | Array | Matrix} AND of `x` and `y` + */ + var bitAnd = typed('bitAnd', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function bitAnd'); + } + + return x & y; + }, + + 'BigNumber, BigNumber': bigBitAnd, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, bitAnd); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, bitAnd); + } + }); + + return bitAnd; + } + + exports.name = 'bitAnd'; + exports.factory = factory; /***/ }, /* 60 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var Complex = __webpack_require__(4); - var collection = __webpack_require__(14); - - /** - * Inverse the sign of a value, apply a unary minus operation. - * - * For matrices, the function is evaluated element wise. Boolean values and - * strings will be converted to a number. For complex numbers, both real and - * complex value are inverted. - * - * Syntax: - * - * math.unaryMinus(x) - * - * Examples: - * - * math.unaryMinus(3.5); // returns -3.5 - * math.unaryMinus(-4.2); // returns 4.2 - * - * See also: - * - * add, subtract, unaryPlus - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Number to be inverted. - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} Returns the value with inverted sign. - */ - var unaryMinus = typed('unaryMinus', { - 'number': function (x) { - return -x; - }, - - 'Complex': function (x) { - return new Complex( - -x.re, - -x.im - ); - }, - - 'BigNumber': function (x) { - return x.neg(); - }, - - 'Unit': function (x) { - var res = x.clone(); - res.value = -x.value; - return res; - }, - - 'Array | Matrix': function (x) { - return collection.deepMap(x, unaryMinus); - } - }); - - return unaryMinus; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigBitNot = __webpack_require__(214).not; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise NOT value, `~x`. + * For matrices, the function is evaluated element wise. + * For units, the function is evaluated on the best prefix base. + * + * Syntax: + * + * math.bitNot(x) + * + * Examples: + * + * math.bitNot(1); // returns Number -2 + * + * math.bitNot([2, -3, 4]); // returns Array [-3, 2, 5] + * + * See also: + * + * bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to not + * @return {Number | BigNumber | Array | Matrix} NOT of `x` + */ + var bitNot = typed('bitNot', { + 'number': function (x) { + if (!isInteger(x)) { + throw new Error('Integer expected in function bitNot'); + } + + return ~x; + }, + + 'BigNumber': bigBitNot, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, bitNot); + } + }); + + return bitNot; + } + + exports.name = 'bitNot'; + exports.factory = factory; /***/ }, /* 61 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Unary plus operation. - * Boolean values and strings will be converted to a number, numeric values will be returned as is. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.unaryPlus(x) - * - * Examples: - * - * math.unaryPlus(3.5); // returns 3.5 - * math.unaryPlus(1); // returns 1 - * - * See also: - * - * unaryMinus, add, subtract - * - * @param {Number | BigNumber | Boolean | String | Complex | Unit | Array | Matrix | null} x - * Input value - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} - * Returns the input value when numeric, converts to a number when input is non-numeric. - */ - math.unaryPlus = function unaryPlus(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('unaryPlus', arguments.length, 1); - } - - if (isNumber(x)) { - return x; - } - - if (isComplex(x)) { - return x.clone(); - } - - if (x instanceof BigNumber) { - return x; - } - - if (isUnit(x)) { - return x.clone(); - } - - if (isCollection(x)) { - return collection.deepMap(x, unaryPlus); - } - - if (isBoolean(x) || isString(x) || x === null) { - // convert to a number or bignumber - return (config.number == 'bignumber') ? new BigNumber(+x): +x; - } - - throw new math.error.UnsupportedTypeError('unaryPlus', math['typeof'](x)); - }; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigBitOr = __webpack_require__(214).or; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise OR two values, `x | y`. + * For matrices, the function is evaluated element wise. + * For units, the function is evaluated on the lowest print base. + * + * Syntax: + * + * math.bitOr(x, y) + * + * Examples: + * + * math.bitOr(1, 2); // returns Number 3 + * + * math.bitOr([1, 2, 3], 4); // returns Array [5, 6, 7] + * + * See also: + * + * bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to or + * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to or + * @return {Number | BigNumber | Array | Matrix} OR of `x` and `y` + */ + var bitOr = typed('bitOr', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function bitOr'); + } + + return x | y; + }, + + 'BigNumber, BigNumber': bigBitOr, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, bitOr); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, bitOr); + } + }); + + return bitOr; + } + + exports.name = 'bitOr'; + exports.factory = factory; /***/ }, /* 62 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - BigNumber = math.type.BigNumber, - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger; - - /** - * Calculate the extended greatest common divisor for two values. - * See http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm. - * - * Syntax: - * - * math.xgcd(a, b) - * - * Examples: - * - * math.xgcd(8, 12); // returns [4, -1, 1] - * math.gcd(8, 12); // returns 4 - * math.xgcd(36163, 21199); // returns [1247, -7, 12] - * - * See also: - * - * gcd, lcm - * - * @param {Number | BigNumber | Boolean} a An integer number - * @param {Number | BigNumber | Boolean} b An integer number - * @return {Array} Returns an array containing 3 integers `[div, m, n]` - * where `div = gcd(a, b)` and `a*m + b*n = div` - */ - math.xgcd = function xgcd(a, b) { - if (arguments.length == 2) { - // two arguments - if (isNumber(a) && isNumber(b)) { - if (!isInteger(a) || !isInteger(b)) { - throw new Error('Parameters in function xgcd must be integer numbers'); - } - - return _xgcd(a, b); - } - - if (a instanceof BigNumber) { - // try to convert to big number - if (isNumber(b)) { - b = BigNumber.convert(b); - } - else if (isBoolean(b) || b === null) { - b = new BigNumber(b ? 1 : 0); - } - - if (b instanceof BigNumber) { - return _bigXgcd(a, b); - } - - // downgrade to Number - return xgcd(a.toNumber(), b); - } - if (b instanceof BigNumber) { - // try to convert to big number - if (isNumber(a)) { - a = BigNumber.convert(a); - } - else if (isBoolean(a) || a === null) { - a = new BigNumber(a ? 1 : 0); - } - - if (a instanceof BigNumber) { - return _bigXgcd(a, b); - } - - // downgrade to Number - return xgcd(a.toNumber(), b); - } - - if (isBoolean(a) || a === null) { - return xgcd(+a, b); - } - if (isBoolean(b) || b === null) { - return xgcd(a, +b); - } - - throw new math.error.UnsupportedTypeError('xgcd', math['typeof'](a), math['typeof'](b)); - } - - // zero or one argument - throw new SyntaxError('Function xgcd expects two arguments'); - }; - - /** - * Calculate xgcd for two numbers - * @param {Number} a - * @param {Number} b - * @return {Number} result - * @private - */ - function _xgcd(a, b) { - // source: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm - var t, // used to swap two variables - q, // quotient - r, // remainder - x = 0, lastx = 1, - y = 1, lasty = 0; - - while (b) { - q = Math.floor(a / b); - r = a % b; - - t = x; - x = lastx - q * x; - lastx = t; - - t = y; - y = lasty - q * y; - lasty = t; - - a = b; - b = r; - } - - var res; - if (a < 0) { - res = [-a, -lastx, -lasty]; - } - else { - res = [a, a ? lastx : 0, lasty]; - } - return (config.matrix === 'array') ? res : new Matrix(res); - } - - /** - * Calculate xgcd for two BigNumbers - * @param {BigNumber} a - * @param {BigNumber} b - * @return {BigNumber[]} result - * @private - */ - function _bigXgcd(a, b) { - // source: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm - var t, // used to swap two variables - q, // quotient - r, // remainder - zero = new BigNumber(0), - x = new BigNumber(0), lastx = new BigNumber(1), - y = new BigNumber(1), lasty = new BigNumber(0); - - while (!b.isZero()) { - q = a.div(b).floor(); - r = a.mod(b); - - t = x; - x = lastx.minus(q.times(x)); - lastx = t; - - t = y; - y = lasty.minus(q.times(y)); - lasty = t; - - a = b; - b = r; - } - - var res; - if (a.lt(zero)) { - res = [a.neg(), lastx.neg(), lasty.neg()]; - } - else { - res = [a, !a.isZero() ? lastx : 0, lasty]; - } - return (config.matrix === 'array') ? res : new Matrix(res); - } - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigBitXor = __webpack_require__(214).xor; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise XOR two values, `x ^ y`. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.bitXor(x, y) + * + * Examples: + * + * math.bitXor(1, 2); // returns Number 3 + * + * math.bitXor([2, 3, 4], 4); // returns Array [6, 7, 0] + * + * See also: + * + * bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to xor + * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to xor + * @return {Number | BigNumber | Array | Matrix} XOR of `x` and `y` + */ + var bitXor = typed('bitXor', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function bitXor'); + } + + return x ^ y; + }, + + 'BigNumber, BigNumber': bigBitXor, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, bitXor); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, bitXor); + } + }); + + return bitXor; + } + + exports.name = 'bitXor'; + exports.factory = factory; /***/ }, /* 63 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var isInteger = __webpack_require__(3).isInteger; - var bigBitAnd = __webpack_require__(166).and; - var collection = __webpack_require__(14); - - /** - * Bitwise AND two values, `x & y`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.bitAnd(x, y) - * - * Examples: - * - * math.bitAnd(53, 131); // returns Number 1 - * - * math.bitAnd([1, 12, 31], 42); // returns Array [0, 8, 10] - * - * See also: - * - * bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to and - * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to and - * @return {Number | BigNumber | Array | Matrix} AND of `x` and `y` - */ - var bitAnd = typed('bitAnd', { - 'number, number': function (x, y) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function bitAnd must be integer numbers'); - } - - return x & y; - }, - - 'BigNumber, BigNumber': bigBitAnd, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, bitAnd); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, bitAnd); - } - }); - - return bitAnd; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigLeftShift = __webpack_require__(214).leftShift; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise left logical shift of a value x by y number of bits, `x << y`. + * For matrices, the function is evaluated element wise. + * For units, the function is evaluated on the best prefix base. + * + * Syntax: + * + * math.leftShift(x, y) + * + * Examples: + * + * math.leftShift(1, 2); // returns Number 4 + * + * math.leftShift([1, 2, 3], 4); // returns Array [16, 32, 64] + * + * See also: + * + * bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to be shifted + * @param {Number | BigNumber | Boolean | null} y Amount of shifts + * @return {Number | BigNumber | Array | Matrix} `x` shifted left `y` times + */ + var leftShift = typed('leftShift', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function leftShift'); + } + + return x << y; + }, + + 'BigNumber, BigNumber': bigLeftShift, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, leftShift); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, leftShift); + } + }); + + return leftShift; + } + + exports.name = 'leftShift'; + exports.factory = factory; /***/ }, /* 64 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection, - - bigBitNot = util.bignumber.not; - - /** - * Bitwise NOT value, `~x`. - * For matrices, the function is evaluated element wise. - * For units, the function is evaluated on the best prefix base. - * - * Syntax: - * - * math.bitNot(x) - * - * Examples: - * - * math.bitNot(1); // returns Number -2 - * - * math.bitNot([2, -3, 4]); // returns Array [-3, 2, 5] - * - * See also: - * - * bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to not - * @return {Number | BigNumber | Array | Matrix} NOT of `x` - */ - math.bitNot = function bitNot(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('bitNot', arguments.length, 1); - } - - if (isNumber(x)) { - if (!isInteger(x)) { - throw new Error('Parameter in function bitNot must be integer numbers'); - } - - return ~x; - } - - if (x instanceof BigNumber) { - return bigBitNot(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, bitNot); - } - - if (isBoolean(x) || x === null) { - return bitNot(+x); - } - - throw new math.error.UnsupportedTypeError('bitNot', math['typeof'](x)); - }; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + var bigRightArithShift = __webpack_require__(214).rightArithShift; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`. + * For matrices, the function is evaluated element wise. + * For units, the function is evaluated on the best prefix base. + * + * Syntax: + * + * math.rightArithShift(x, y) + * + * Examples: + * + * math.rightArithShift(4, 2); // returns Number 1 + * + * math.rightArithShift([16, -32, 64], 4); // returns Array [1, -2, 3] + * + * See also: + * + * bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift + * + * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to be shifted + * @param {Number | BigNumber | Boolean | null} y Amount of shifts + * @return {Number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times + */ + var rightArithShift = typed('rightArithShift', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function rightArithShift'); + } + + return x >> y; + }, + + 'BigNumber, BigNumber': bigRightArithShift, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, rightArithShift); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, rightArithShift); + } + }); + + return rightArithShift; + } + + exports.name = 'rightArithShift'; + exports.factory = factory; /***/ }, /* 65 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection, - - bigBitOr = util.bignumber.or; - - /** - * Bitwise OR two values, `x | y`. - * For matrices, the function is evaluated element wise. - * For units, the function is evaluated on the lowest print base. - * - * Syntax: - * - * math.bitOr(x, y) - * - * Examples: - * - * math.bitOr(1, 2); // returns Number 3 - * - * math.bitOr([1, 2, 3], 4); // returns Array [5, 6, 7] - * - * See also: - * - * bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to or - * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to or - * @return {Number | BigNumber | Array | Matrix} OR of `x` and `y` - */ - math.bitOr = function bitOr(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('bitOr', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function bitOr must be integer numbers'); - } - - return x | y; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, bitOr); - } - - if (isBoolean(x) || x === null) { - return bitOr(+x, y); - } - if (isBoolean(y) || y === null) { - return bitOr(x, +y); - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - - if (y instanceof BigNumber) { - return bigBitOr(x, y); - } - - // downgrade to Number - return bitOr(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - - if (x instanceof BigNumber) { - return bigBitOr(x, y); - } - - // downgrade to Number - return bitOr(x, y.toNumber()); - } - - throw new math.error.UnsupportedTypeError('bitOr', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Bitwise right logical shift of value x by y number of bits, `x >>> y`. + * For matrices, the function is evaluated element wise. + * For units, the function is evaluated on the best prefix base. + * + * Syntax: + * + * math.rightLogShift(x, y) + * + * Examples: + * + * math.rightLogShift(4, 2); // returns Number 1 + * + * math.rightLogShift([16, -32, 64], 4); // returns Array [1, 2, 3] + * + * See also: + * + * bitAnd, bitNot, bitOr, bitXor, leftShift, rightArithShift + * + * @param {Number | Boolean | Array | Matrix | null} x Value to be shifted + * @param {Number | Boolean | null} y Amount of shifts + * @return {Number | Array | Matrix} `x` zero-filled shifted right `y` times + */ + + var rightLogShift = typed('rightLogShift', { + 'number, number': function (x, y) { + if (!isInteger(x) || !isInteger(y)) { + throw new Error('Integers expected in function rightLogShift'); + } + + return x >>> y; + }, + + // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, rightLogShift); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, rightLogShift); + } + }); + + return rightLogShift; + } + + exports.name = 'rightLogShift'; + exports.factory = factory; /***/ }, /* 66 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection, - - bigBitXor = util.bignumber.xor; - - /** - * Bitwise XOR two values, `x ^ y`. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.bitXor(x, y) - * - * Examples: - * - * math.bitXor(1, 2); // returns Number 3 - * - * math.bitXor([2, 3, 4], 4); // returns Array [6, 7, 0] - * - * See also: - * - * bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x First value to xor - * @param {Number | BigNumber | Boolean | Array | Matrix | null} y Second value to xor - * @return {Number | BigNumber | Array | Matrix} XOR of `x` and `y` - */ - math.bitXor = function bitXor(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('bitXor', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function bitXor must be integer numbers'); - } - - return x ^ y; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, bitXor); - } - - if (isBoolean(x) || x === null) { - return bitXor(+x, y); - } - if (isBoolean(y) || y === null) { - return bitXor(x, +y); - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - - if (y instanceof BigNumber) { - return bigBitXor(x, y); - } - - // downgrade to Number - return bitXor(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - - if (x instanceof BigNumber) { - return bigBitXor(x, y); - } - - // downgrade to Number - return bitXor(x, y.toNumber()); - } - - throw new math.error.UnsupportedTypeError('bitXor', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Compute the argument of a complex value. + * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.arg(x) + * + * Examples: + * + * var a = math.complex(2, 2); + * math.arg(a) / math.pi; // returns Number 0.25 + * + * var b = math.complex('2 + 3i'); + * math.arg(b); // returns Number 0.982793723247329 + * math.atan2(3, 2); // returns Number 0.982793723247329 + * + * See also: + * + * re, im, conj, abs + * + * @param {Number | Complex | Array | Matrix | Boolean | null} x + * A complex number or array with complex numbers + * @return {Number | Array | Matrix} The argument of x + */ + var arg = typed('arg', { + 'number': function (x) { + return Math.atan2(0, x); + }, + + // FIXME: must arg(Complex return a complex or a number? + 'Complex': function (x) { + return Math.atan2(x.im, x.re); + }, + + // TODO: implement BigNumber support for function arg + + 'Array | Matrix': function (x) { + return collection.deepMap(x, arg); + } + }); + + return arg; + } + + exports.name = 'arg'; + exports.factory = factory; /***/ }, /* 67 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection, - - bigLeftShift = util.bignumber.leftShift; - - /** - * Bitwise left logical shift of a value x by y number of bits, `x << y`. - * For matrices, the function is evaluated element wise. - * For units, the function is evaluated on the best prefix base. - * - * Syntax: - * - * math.leftShift(x, y) - * - * Examples: - * - * math.leftShift(1, 2); // returns Number 4 - * - * math.leftShift([1, 2, 3], 4); // returns Array [16, 32, 64] - * - * See also: - * - * bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to be shifted - * @param {Number | BigNumber | Boolean | null} y Amount of shifts - * @return {Number | BigNumber | Array | Matrix} `x` shifted left `y` times - */ - math.leftShift = function leftShift(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('leftShift', arguments.length, 2); - } - - if (isNumber(x)) { - if (isNumber(y)) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function leftShift must be integer numbers'); - } - - return x << y; - } - - if (y instanceof BigNumber) { - return bigLeftShift(BigNumber.convert(x), y); - } - } - if (isNumber(y)) { - if (isFinite(y) && !isInteger(y)) { - throw new Error('Parameters in function leftShift must be integer numbers'); - } - - if (x instanceof BigNumber) { - if (x.isFinite() && !x.isInteger()) { - throw new Error('Parameters in function leftShift must be integer numbers'); - } - - if (x.isNaN() || isNaN(y) || y < 0) { - return new BigNumber(NaN); - } - - if (y == 0 || x.isZero()) { - return x; - } - if (y == Infinity && !x.isFinite()) { - return new BigNumber(NaN); - } - - // Math.pow(2, y) is fully precise for y < 55, and fast - if (y < 55) { - return x.times(Math.pow(2, y) + ''); - } - - y = BigNumber.convert(y); - return bigLeftShift(x, y); - } - } - - if (isCollection(x) && isNumber(y)) { - return collection.deepMap2(x, y, leftShift); - } - - if (isBoolean(x) || x === null) { - return leftShift(+x, y); - } - if (isBoolean(y) || y === null) { - return leftShift(x, +y); - } - - if (x instanceof BigNumber) { - if (y instanceof BigNumber) { - return bigLeftShift(x, y); - } - - // downgrade to Number - return leftShift(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // x is probably incompatible with BigNumber - return leftShift(x, y.toNumber()); - } - - throw new math.error.UnsupportedTypeError('leftShift', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Compute the complex conjugate of a complex value. + * If `x = a+bi`, the complex conjugate of `x` is `a - bi`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.conj(x) + * + * Examples: + * + * math.conj(math.complex('2 + 3i')); // returns Complex 2 - 3i + * math.conj(math.complex('2 - 3i')); // returns Complex 2 + 3i + * math.conj(math.complex('-5.2i')); // returns Complex 5.2i + * + * See also: + * + * re, im, arg, abs + * + * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x + * A complex number or array with complex numbers + * @return {Number | BigNumber | Complex | Array | Matrix} + * The complex conjugate of x + */ + var conj = typed('conj', { + 'number': function (x) { + return x; + }, + + 'BigNumber': function (x) { + return x; + }, + + 'Complex': function (x) { + return new x.constructor(x.re, -x.im); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, conj); + } + }); + + return conj; + } + + exports.name = 'conj'; + exports.factory = factory; /***/ }, /* 68 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection, - - bigRightShift = util.bignumber.rightShift; - - /** - * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`. - * For matrices, the function is evaluated element wise. - * For units, the function is evaluated on the best prefix base. - * - * Syntax: - * - * math.rightArithShift(x, y) - * - * Examples: - * - * math.rightArithShift(4, 2); // returns Number 1 - * - * math.rightArithShift([16, -32, 64], 4); // returns Array [1, -2, 3] - * - * See also: - * - * bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift - * - * @param {Number | BigNumber | Boolean | Array | Matrix | null} x Value to be shifted - * @param {Number | BigNumber | Boolean | null} y Amount of shifts - * @return {Number | BigNumber | Array | Matrix} `x` sign-filled shifted right `y` times - */ - math.rightArithShift = function rightArithShift(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('rightArithShift', arguments.length, 2); - } - - if (isNumber(x)) { - if (isNumber(y)) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function rightArithShift must be integer numbers'); - } - - return x >> y; - } - - if (y instanceof BigNumber) { - return bigRightShift(BigNumber.convert(x), y); - } - } - if (isNumber(y)) { - if (isFinite(y) && !isInteger(y)) { - throw new Error('Parameters in function rightArithShift must be integer numbers'); - } - - if (x instanceof BigNumber) { - if (x.isFinite() && !x.isInteger()) { - throw new Error('Parameters in function rightArithShift must be integer numbers'); - } - - if (x.isNaN() || isNaN(y) || y < 0) { - return new BigNumber(NaN); - } - if (y == Infinity) { - if (x.isNegative()) { - return new BigNumber(-1); - } - if (!x.isFinite()) { - return new BigNumber(NaN); - } - return new BigNumber(0); - } - - // Math.pow(2, y) is fully precise for y < 55, and fast - if (y < 55) { - return x.div(Math.pow(2, y) + '').floor(); - } - - y = BigNumber.convert(y); - return bigRightShift(x, y); - } - } - - if (isCollection(x) && isNumber(y)) { - return collection.deepMap2(x, y, rightArithShift); - } - - if (isBoolean(x) || x === null) { - return rightArithShift(+x, y); - } - if (isBoolean(y) || y === null) { - return rightArithShift(x, +y); - } - - if (x instanceof BigNumber) { - if (y instanceof BigNumber) { - return bigRightShift(x, y); - } - - // downgrade to Number - return rightArithShift(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // x is probably incompatible with BigNumber - return rightArithShift(x, y.toNumber()); - } - - throw new math.error.UnsupportedTypeError('rightArithShift', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Get the real part of a complex number. + * For a complex number `a + bi`, the function returns `a`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.re(x) + * + * Examples: + * + * var a = math.complex(2, 3); + * math.re(a); // returns Number 2 + * math.im(a); // returns Number 3 + * + * math.re(math.complex('-5.2i')); // returns Number 0 + * math.re(math.complex(2.4)); // returns Number 2.4 + * + * See also: + * + * im, conj, abs, arg + * + * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x + * A complex number or array with complex numbers + * @return {Number | BigNumber | Array | Matrix} The real part of x + */ + var re = typed('re', { + 'number': function (x) { + return x; + }, + + 'BigNumber': function (x) { + return x; + }, + + 'Complex': function (x) { + return x.re; + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, re); + } + }); + + return re; + } + + exports.name = 're'; + exports.factory = factory; /***/ }, /* 69 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isNumber = util.number.isNumber, - isCollection = collection.isCollection; - - /** - * Bitwise right logical shift of value x by y number of bits, `x >>> y`. - * For matrices, the function is evaluated element wise. - * For units, the function is evaluated on the best prefix base. - * - * Syntax: - * - * math.rightLogShift(x, y) - * - * Examples: - * - * math.rightLogShift(4, 2); // returns Number 1 - * - * math.rightLogShift([16, -32, 64], 4); // returns Array [1, 2, 3] - * - * See also: - * - * bitAnd, bitNot, bitOr, bitXor, leftShift, rightArithShift - * - * @param {Number | Boolean | Array | Matrix | null} x Value to be shifted - * @param {Number | Boolean | null} y Amount of shifts - * @return {Number | Array | Matrix} `x` zero-filled shifted right `y` times - */ - math.rightLogShift = function rightLogShift(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('rightLogShift', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - if (!isInteger(x) || !isInteger(y)) { - throw new Error('Parameters in function rightLogShift must be integer numbers'); - } - - return x >>> y; - } - - if (isCollection(x) && isNumber(y)) { - return collection.deepMap2(x, y, rightLogShift); - } - - if (isBoolean(x) || x === null) { - return rightLogShift(+x, y); - } - if (isBoolean(y) || y === null) { - return rightLogShift(x, +y); - } - - throw new math.error.UnsupportedTypeError('rightLogShift', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Get the imaginary part of a complex number. + * For a complex number `a + bi`, the function returns `b`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.im(x) + * + * Examples: + * + * var a = math.complex(2, 3); + * math.re(a); // returns Number 2 + * math.im(a); // returns Number 3 + * + * math.re(math.complex('-5.2i')); // returns Number -5.2 + * math.re(math.complex(2.4)); // returns Number 0 + * + * See also: + * + * re, conj, abs, arg + * + * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x + * A complex number or array with complex numbers + * @return {Number | BigNumber | Array | Matrix} The imaginary part of x + */ + var im = typed('im', { + 'number': function (x) { + return 0; + }, + + 'BigNumber': function (x) { + return new x.constructor(0); + }, + + 'Complex': function (x) { + return x.im; + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, im); + } + }); + + return im; + } + + exports.name = 'im'; + exports.factory = factory; /***/ }, /* 70 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection = collection.isCollection, - isComplex = Complex.isComplex; - - /** - * Compute the argument of a complex value. - * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.arg(x) - * - * Examples: - * - * var a = math.complex(2, 2); - * math.arg(a) / math.pi; // returns Number 0.25 - * - * var b = math.complex('2 + 3i'); - * math.arg(b); // returns Number 0.982793723247329 - * math.atan2(3, 2); // returns Number 0.982793723247329 - * - * See also: - * - * re, im, conj, abs - * - * @param {Number | Complex | Array | Matrix | Boolean | null} x - * A complex number or array with complex numbers - * @return {Number | Array | Matrix} The argument of x - */ - math.arg = function arg(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('arg', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.atan2(0, x); - } - - if (isComplex(x)) { - return Math.atan2(x.im, x.re); - } - - if (isCollection(x)) { - return collection.deepMap(x, arg); - } - - if (isBoolean(x) || x === null) { - return arg(+x); - } - - if (x instanceof BigNumber) { - // downgrade to Number - // TODO: implement BigNumber support - return arg(x.toNumber()); - } - - throw new math.error.UnsupportedTypeError('arg', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a BigNumber, which can store numbers with arbitrary precision. + * When a matrix is provided, all elements will be converted to BigNumber. + * + * Syntax: + * + * math.bignumber(x) + * + * Examples: + * + * 0.1 + 0.2; // returns Number 0.30000000000000004 + * math.bignumber(0.1) + math.bignumber(0.2); // returns BigNumber 0.3 + * + * + * 7.2e500; // returns Number Infinity + * math.bignumber('7.2e500'); // returns BigNumber 7.2e500 + * + * See also: + * + * boolean, complex, index, matrix, string, unit + * + * @param {Number | String | Array | Matrix | Boolean | null} [value] Value for the big number, + * 0 by default. + * @returns {BigNumber} The created bignumber + */ + var bignumber = typed('bignumber', { + '': function () { + return new type.BigNumber(0); + }, + + 'number': function (x) { + // convert to string to prevent errors in case of >15 digits + return new type.BigNumber(x + ''); + }, + + 'string': function (x) { + return new type.BigNumber(x); + }, + + 'BigNumber': function (x) { + // we assume a BigNumber is immutable + return x; + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, bignumber); + } + }); + + return bignumber; + } + + exports.name = 'bignumber'; + exports.factory = factory; /***/ }, /* 71 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - object = util.object, - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection =collection.isCollection, - isComplex = Complex.isComplex; - - /** - * Compute the complex conjugate of a complex value. - * If `x = a+bi`, the complex conjugate of `x` is `a - bi`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.conj(x) - * - * Examples: - * - * math.conj(math.complex('2 + 3i')); // returns Complex 2 - 3i - * math.conj(math.complex('2 - 3i')); // returns Complex 2 + 3i - * math.conj(math.complex('-5.2i')); // returns Complex 5.2i - * - * See also: - * - * re, im, arg, abs - * - * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x - * A complex number or array with complex numbers - * @return {Number | BigNumber | Complex | Array | Matrix} - * The complex conjugate of x - */ - math.conj = function conj(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('conj', arguments.length, 1); - } - - if (isNumber(x)) { - return x; - } - - if (x instanceof BigNumber) { - return new BigNumber(x); - } - - if (isComplex(x)) { - return new Complex(x.re, -x.im); - } - - if (isCollection(x)) { - return collection.deepMap(x, conj); - } - - if (isBoolean(x) || x === null) { - return +x; - } - - // return a clone of the value for non-complex values - return object.clone(x); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a boolean or convert a string or number to a boolean. + * In case of a number, `true` is returned for non-zero numbers, and `false` in + * case of zero. + * Strings can be `'true'` or `'false'`, or can contain a number. + * When value is a matrix, all elements will be converted to boolean. + * + * Syntax: + * + * math.boolean(x) + * + * Examples: + * + * math.boolean(0); // returns false + * math.boolean(1); // returns true + * math.boolean(-3); // returns true + * math.boolean('true'); // returns true + * math.boolean('false'); // returns false + * math.boolean([1, 0, 1, 1]); // returns [true, false, true, true] + * + * See also: + * + * bignumber, complex, index, matrix, string, unit + * + * @param {String | Number | Boolean | Array | Matrix | null} value A value of any type + * @return {Boolean | Array | Matrix} The boolean value + */ + var bool = typed('bool', { + '': function () { + return false; + }, + + 'boolean': function (x) { + return x; + }, + + 'number': function (x) { + return !!x; + }, + + 'BigNumber': function (x) { + return !x.isZero(); + }, + + 'string': function (x) { + // try case insensitive + var lcase = x.toLowerCase(); + if (lcase === 'true') { + return true; + } + else if (lcase === 'false') { + return false; + } + + // test whether value is a valid number + var num = Number(x); + if (x != '' && !isNaN(num)) { + return !!num; + } + + throw new Error('Cannot convert "' + x + '" to a boolean'); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, bool); + } + }); + + return bool; + } + + exports.name = 'boolean'; + exports.factory = factory; /***/ }, /* 72 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - object = util.object, - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection = collection.isCollection, - isComplex = Complex.isComplex; - - /** - * Get the real part of a complex number. - * For a complex number `a + bi`, the function returns `a`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.re(x) - * - * Examples: - * - * var a = math.complex(2, 3); - * math.re(a); // returns Number 2 - * math.im(a); // returns Number 3 - * - * math.re(math.complex('-5.2i')); // returns Number 0 - * math.re(math.complex(2.4)); // returns Number 2.4 - * - * See also: - * - * im, conj, abs, arg - * - * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x - * A complex number or array with complex numbers - * @return {Number | BigNumber | Array | Matrix} The real part of x - */ - math.re = function re(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('re', arguments.length, 1); - } - - if (isNumber(x)) { - return x; - } - - if (x instanceof BigNumber) { - return new BigNumber(x); - } - - if (isComplex(x)) { - return x.re; - } - - if (isCollection(x)) { - return collection.deepMap(x, re); - } - - if (isBoolean(x) || x === null) { - return +x; - } - - // return a clone of the value itself for all non-complex values - return object.clone(x); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Wrap any value in a chain, allowing to perform chained operations on + * the value. + * + * All methods available in the math.js library can be called upon the chain, + * and then will be evaluated with the value itself as first argument. + * The chain can be closed by executing `chain.done()`, which returns + * the final value. + * + * The chain has a number of special functions: + * + * - `done()` Finalize the chain and return the chain's value. + * - `valueOf()` The same as `done()` + * - `toString()` Executes `math.format()` onto the chain's value, returning + * a string representation of the value. + * + * Syntax: + * + * math.chain(value) + * + * Examples: + * + * math.chain(3) + * .add(4) + * .subtract(2) + * .done(); // 5 + * + * math.chain( [[1, 2], [3, 4]] ) + * .subset(math.index(0, 0), 8) + * .multiply(3) + * .done(); // [[24, 6], [9, 12]] + * + * @param {*} [value] A value of any type on which to start a chained operation. + * @return {math.type.Chain} The created chain + */ + return typed('chain', { + '': function() { + return new type.Chain(); + }, + + 'any': function(value) { + return new type.Chain(value); + } + }); + } + + exports.name = 'chain'; + exports.factory = factory; /***/ }, /* 73 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isCollection =collection.isCollection, - isComplex = Complex.isComplex; - - /** - * Get the imaginary part of a complex number. - * For a complex number `a + bi`, the function returns `b`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.im(x) - * - * Examples: - * - * var a = math.complex(2, 3); - * math.re(a); // returns Number 2 - * math.im(a); // returns Number 3 - * - * math.re(math.complex('-5.2i')); // returns Number -5.2 - * math.re(math.complex(2.4)); // returns Number 0 - * - * See also: - * - * re, conj, abs, arg - * - * @param {Number | BigNumber | Complex | Array | Matrix | Boolean | null} x - * A complex number or array with complex numbers - * @return {Number | BigNumber | Array | Matrix} The imaginary part of x - */ - math.im = function im(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('im', arguments.length, 1); - } - - if (isNumber(x)) { - return 0; - } - - if (x instanceof BigNumber) { - return new BigNumber(0); - } - - if (isComplex(x)) { - return x.im; - } - - if (isCollection(x)) { - return collection.deepMap(x, im); - } - - if (isBoolean(x) || x === null) { - return 0; - } - - // return 0 for all non-complex values - return 0; - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a complex value or convert a value to a complex value. + * + * Syntax: + * + * math.complex() // creates a complex value with zero + * // as real and imaginary part. + * math.complex(re : number, im : string) // creates a complex value with provided + * // values for real and imaginary part. + * math.complex(re : number) // creates a complex value with provided + * // real value and zero imaginary part. + * math.complex(complex : Complex) // clones the provided complex value. + * math.complex(arg : string) // parses a string into a complex value. + * math.complex(array : Array) // converts the elements of the array + * // or matrix element wise into a + * // complex value. + * math.complex({re: number, im: number}) // creates a complex value with provided + * // values for real an imaginary part. + * math.complex({r: number, phi: number}) // creates a complex value with provided + * // polar coordinates + * + * Examples: + * + * var a = math.complex(3, -4); // a = Complex 3 - 4i + * a.re = 5; // a = Complex 5 - 4i + * var i = a.im; // Number -4; + * var b = math.complex('2 + 6i'); // Complex 2 + 6i + * var c = math.complex(); // Complex 0 + 0i + * var d = math.add(a, b); // Complex 5 + 2i + * + * See also: + * + * bignumber, boolean, index, matrix, number, string, unit + * + * @param {* | Array | Matrix} [args] + * Arguments specifying the real and imaginary part of the complex number + * @return {Complex | Array | Matrix} Returns a complex value + */ + var complex = typed('complex', { + '': function () { + return new type.Complex(0, 0); + }, + + 'number': function (x) { + return new type.Complex(x, 0); + }, + + 'number, number': function (re, im) { + return new type.Complex(re, im); + }, + + // TODO: this signature should be redundant + 'BigNumber, BigNumber': function (re, im) { + return new type.Complex(re.toNumber(), im.toNumber()); + }, + + 'Complex': function (x) { + return x.clone(); + }, + + 'string': function (x) { + var c = type.Complex.parse(x); + if (c) { + return c; + } + + throw new SyntaxError('String "' + x + '" is no valid complex number'); + }, + + 'Object': function (x) { + if('re' in x && 'im' in x) { + return new type.Complex(x.re, x.im); + } + + if ('r' in x && 'phi' in x) { + return type.Complex.fromPolar(x.r, x.phi); + } + + throw new Error('Expected object with either properties re and im, or properties r and phi.'); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, complex); + } + }); + + return complex; + } + + exports.name = 'complex'; + exports.factory = factory; /***/ }, /* 74 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - // take the BigNumber instance the provided math.js instance - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isNumber = util.number.isNumber, - isString = util.string.isString, - isBoolean = util['boolean'].isBoolean; - - /** - * Create a BigNumber, which can store numbers with arbitrary precision. - * When a matrix is provided, all elements will be converted to BigNumber. - * - * Syntax: - * - * math.bignumber(x) - * - * Examples: - * - * 0.1 + 0.2; // returns Number 0.30000000000000004 - * math.bignumber(0.1) + math.bignumber(0.2); // returns BigNumber 0.3 - * - * - * 7.2e500; // returns Number Infinity - * math.bignumber('7.2e500'); // returns BigNumber 7.2e500 - * - * See also: - * - * boolean, complex, index, matrix, string, unit - * - * @param {Number | String | Array | Matrix | Boolean | null} [value] Value for the big number, - * 0 by default. - * @returns {BigNumber} The created bignumber - */ - math.bignumber = function bignumber(value) { - if (arguments.length > 1) { - throw new math.error.ArgumentsError('bignumber', arguments.length, 0, 1); - } - - if (isNumber(value)) { - // convert to string to prevent errors in case of >15 digits - return new BigNumber(value + ''); - } - - if (isString(value)) { - return new BigNumber(value); - } - - if (value instanceof BigNumber) { - return value; - } - - if (isBoolean(value) || value === null) { - return new BigNumber(+value); - } - - if (isCollection(value)) { - return collection.deepMap(value, bignumber); - } - - if (arguments.length == 0) { - return new BigNumber(0); - } - - throw new math.error.UnsupportedTypeError('bignumber', math['typeof'](value)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Create an index. An Index can store ranges having start, step, and end + * for multiple dimensions. + * Matrix.get, Matrix.set, and math.subset accept an Index as input. + * + * Syntax: + * + * math.index(range1, range2, ...) + * + * Where: + * + * Each range can be any of: + * + * - An array [start, end] + * - An array [start, end, step] + * - A number + * - An instance of `Range` + * + * The parameters start, end, and step must be integer numbers. Start and end + * are zero based. The start of a range is included, the end is excluded. + * + * Examples: + * + * var math = math.js + * + * var b = [1, 2, 3, 4, 5]; + * math.subset(b, math.index([1, 3])); // returns [2, 3] + * + * var a = math.matrix([[1, 2], [3, 4]]); + * a.subset(math.index(0, 1)); // returns 2 + * a.subset(math.index(1, null)); // returns [3, 4] + * + * See also: + * + * bignumber, boolean, complex, matrix, number, string, unit + * + * @param {...*} ranges Zero or more ranges or numbers. + * @return {Index} Returns the created index + */ + return typed('index', { + '...number | BigNumber | Range | Array': function (args) { + var ranges = args.map(function (arg) { + if (arg instanceof type.BigNumber) { + return arg.toNumber(); // convert BigNumber to Number + } + else if (Array.isArray(arg)) { + return arg.map(function (elem) { + // convert BigNumber to Number + return (elem instanceof type.BigNumber) ? elem.toNumber() : elem; + }); + } + else { + return arg; + } + }); + + var res = new type.Index(); + type.Index.apply(res, ranges); + return res; + } + }); + } + + exports.name = 'index'; + exports.factory = factory; /***/ }, /* 75 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isNumber = util.number.isNumber, - isString = util.string.isString; - - /** - * Create a boolean or convert a string or number to a boolean. - * In case of a number, `true` is returned for non-zero numbers, and `false` in - * case of zero. - * Strings can be `'true'` or `'false'`, or can contain a number. - * When value is a matrix, all elements will be converted to boolean. - * - * Syntax: - * - * math.boolean(x) - * - * Examples: - * - * math.boolean(0); // returns false - * math.boolean(1); // returns true - * math.boolean(-3); // returns true - * math.boolean('true'); // returns true - * math.boolean('false'); // returns false - * math.boolean([1, 0, 1, 1]); // returns [true, false, true, true] - * - * See also: - * - * bignumber, complex, index, matrix, string, unit - * - * @param {String | Number | Boolean | Array | Matrix | null} value A value of any type - * @return {Boolean | Array | Matrix} The boolean value - */ - math['boolean'] = function bool (value) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('boolean', arguments.length, 0, 1); - } - - if (value === 'true' || value === true) { - return true; - } - - if (value === 'false' || value === false || value === null) { - return false; - } - - if (value instanceof Boolean) { - return value == true; - } - - if (isNumber(value)) { - return (value !== 0); - } - - if (value instanceof BigNumber) { - return !value.isZero(); - } - - if (isString(value)) { - // try case insensitive - var lcase = value.toLowerCase(); - if (lcase === 'true') { - return true; - } - else if (lcase === 'false') { - return false; - } - - // test whether value is a valid number - var num = Number(value); - if (value != '' && !isNaN(num)) { - return (num !== 0); - } - } - - if (isCollection(value)) { - return collection.deepMap(value, bool); - } - - throw new SyntaxError(value.toString() + ' is no valid boolean'); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Create a Matrix. The function creates a new `math.type.Matrix` object from + * an `Array`. A Matrix has utility functions to manipulate the data in the + * matrix, like getting the size and getting or setting values in the matrix. + * Supported storage formats are 'dense' and 'sparse'. + * + * Syntax: + * + * math.matrix() // creates an empty matrix using default storage format (dense). + * math.matrix(data) // creates a matrix with initial data using default storage format (dense). + * math.matrix('dense') // creates an empty matrix using the given storage format. + * math.matrix(data, 'dense') // creates a matrix with initial data using the given storage format. + * math.matrix(data, 'sparse') // creates a sparse matrix with initial data. + * + * Examples: + * + * var m = math.matrix([[1, 2], [3, 4]]); + * m.size(); // Array [2, 2] + * m.resize([3, 2], 5); + * m.valueOf(); // Array [[1, 2], [3, 4], [5, 5]] + * m.get([1, 0]) // number 3 + * + * See also: + * + * bignumber, boolean, complex, index, number, string, unit, sparse + * + * @param {Array | Matrix} [data] A multi dimensional array + * @param {string} [format] The Matrix storage format + * + * @return {Matrix} The created matrix + */ + return typed('matrix', { + '': function () { + return _create([]); + }, + + 'string': function (format) { + return _create([], format); + }, + + 'Array': function (data) { + return _create(data); + }, + + 'Matrix': function (data) { + return _create(data, data.storage()); + }, + + 'Array | Matrix, string': _create + }); + + /** + * Create a new Matrix with given storage format + * @param {Array} data + * @param {string} [format] + * @returns {Matrix} Returns a new Matrix + * @private + */ + function _create(data, format) { + // get storage format constructor + var M = type.Matrix.storage(format || 'default'); + + // create instance + return new M(data); + } + } + + exports.name = 'matrix'; + exports.factory = factory; /***/ }, /* 76 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isNumber = util.number.isNumber, - isString = util.string.isString, - isComplex = Complex.isComplex; - - /** - * Create a complex value or convert a value to a complex value. - * - * Syntax: - * - * math.complex() // creates a complex value with zero - * // as real and imaginary part. - * math.complex(re : number, im : string) // creates a complex value with provided - * // values for real and imaginary part. - * math.complex(re : number) // creates a complex value with provided - * // real value and zero imaginary part. - * math.complex(complex : Complex) // clones the provided complex value. - * math.complex(arg : string) // parses a string into a complex value. - * math.complex(array : Array) // converts the elements of the array - * // or matrix element wise into a - * // complex value. - * math.complex({re: number, im: number}) // creates a complex value with provided - * // values for real an imaginary part. - * math.complex({r: number, phi: number}) // creates a complex value with provided - * // polar coordinates - * - * Examples: - * - * var a = math.complex(3, -4); // a = Complex 3 - 4i - * a.re = 5; // a = Complex 5 - 4i - * var i = a.im; // Number -4; - * var b = math.complex('2 + 6i'); // Complex 2 + 6i - * var c = math.complex(); // Complex 0 + 0i - * var d = math.add(a, b); // Complex 5 + 2i - * - * See also: - * - * bignumber, boolean, index, matrix, number, string, unit - * - * @param {* | Array | Matrix} [args] - * Arguments specifying the real and imaginary part of the complex number - * @return {Complex | Array | Matrix} Returns a complex value - */ - math.complex = function complex(args) { - switch (arguments.length) { - case 0: - // no parameters. Set re and im zero - return new Complex(0, 0); - - case 1: - // parse string into a complex number - var arg = arguments[0]; - - if (isNumber(arg)) { - return new Complex(arg, 0); - } - - if (arg instanceof BigNumber) { - // convert to Number - return new Complex(arg.toNumber(), 0); - } - - if (isComplex(arg)) { - // create a clone - return arg.clone(); - } - - if (isString(arg)) { - var c = Complex.parse(arg); - if (c) { - return c; - } - else { - throw new SyntaxError('String "' + arg + '" is no valid complex number'); - } - } - - if (isCollection(arg)) { - return collection.deepMap(arg, complex); - } - - if (typeof arg === 'object') { - if('re' in arg && 'im' in arg) { - return new Complex(arg.re, arg.im); - } else if ('r' in arg && 'phi' in arg) { - return Complex.fromPolar(arg.r, arg.phi); - } - } - - throw new TypeError('Two numbers, single string or an fitting object expected in function complex'); - - case 2: - // re and im provided - var re = arguments[0], - im = arguments[1]; - - // convert re to number - if (re instanceof BigNumber) { - re = re.toNumber(); - } - - // convert im to number - if (im instanceof BigNumber) { - im = im.toNumber(); - } - - if (isNumber(re) && isNumber(im)) { - return new Complex(re, im); - } - else { - throw new TypeError('Two numbers or a single string expected in function complex'); - } - - default: - throw new math.error.ArgumentsError('complex', arguments.length, 0, 2); - } - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a number or convert a string, boolean, or unit to a number. + * When value is a matrix, all elements will be converted to number. + * + * Syntax: + * + * math.number(value) + * math.number(unit, valuelessUnit) + * + * Examples: + * + * math.number(2); // returns number 2 + * math.number('7.2'); // returns number 7.2 + * math.number(true); // returns number 1 + * math.number([true, false, true, true]); // returns [1, 0, 1, 1] + * math.number(math.unit('52cm'), 'm'); // returns 0.52 + * + * See also: + * + * bignumber, boolean, complex, index, matrix, string, unit + * + * @param {String | Number | Boolean | Array | Matrix | Unit | null} [value] Value to be converted + * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number + * @return {Number | Array | Matrix} The created number + */ + var number = typed('number', { + '': function () { + return 0; + }, + + 'number': function (x) { + return x; + }, + + 'string': function (x) { + var num = Number(x); + if (isNaN(num)) { + throw new SyntaxError('String "' + x + '" is no valid number'); + } + return num; + }, + + 'BigNumber': function (x) { + return x.toNumber(); + }, + + 'Unit': function (x) { + throw new Error('Second argument with valueless unit expected'); + }, + + 'Unit, string | Unit': function (unit, valuelessUnit) { + return unit.toNumber(valuelessUnit); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, number); + } + }); + + return number; + } + + exports.name = 'number'; + exports.factory = factory; /***/ }, /* 77 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Index = __webpack_require__(6); - - /** - * Create an index. An Index can store ranges having start, step, and end - * for multiple dimensions. - * Matrix.get, Matrix.set, and math.subset accept an Index as input. - * - * Syntax: - * - * math.index(range1, range2, ...) - * - * Where: - * - * Each range can be any of: - * - * - An array [start, end] - * - An array [start, end, step] - * - A number - * - An instance of `Range` - * - * The parameters start, end, and step must be integer numbers. Start and end - * are zero based. The start of a range is included, the end is excluded. - * - * Examples: - * - * var math = math.js - * - * var b = [1, 2, 3, 4, 5]; - * math.subset(b, math.index([1, 3])); // returns [2, 3] - * - * var a = math.matrix([[1, 2], [3, 4]]); - * a.subset(math.index(0, 1)); // returns 2 - * a.subset(math.index(1, null)); // returns [3, 4] - * - * See also: - * - * bignumber, boolean, complex, matrix, number, string, unit - * - * @param {...*} ranges Zero or more ranges or numbers. - * @return {Index} Returns the created index - */ - math.index = function(ranges) { - // downgrade BigNumber to Number - var args = Array.prototype.slice.apply(arguments).map(function (arg) { - if (arg instanceof BigNumber) { - return arg.toNumber(); - } - else if (Array.isArray(arg)) { - return arg.map(function (elem) { - return (elem instanceof BigNumber) ? elem.toNumber() : elem; - }); - } - else { - return arg; - } - }); - - var res = new Index(); - Index.apply(res, args); - return res; - }; - }; + 'use strict'; + + function factory (type, config, load, typed, math) { + var Parser = load(__webpack_require__(14)); + + /** + * Create a parser. The function creates a new `math.expression.Parser` object. + * + * Syntax: + * + * math.parser() + * + * Examples: + * + * var parser = new math.parser(); + * + * // evaluate expressions + * var a = parser.eval('sqrt(3^2 + 4^2)'); // 5 + * var b = parser.eval('sqrt(-4)'); // 2i + * var c = parser.eval('2 inch in cm'); // 5.08 cm + * var d = parser.eval('cos(45 deg)'); // 0.7071067811865476 + * + * // define variables and functions + * parser.eval('x = 7 / 2'); // 3.5 + * parser.eval('x + 3'); // 6.5 + * parser.eval('function f(x, y) = x^y'); // f(x, y) + * parser.eval('f(2, 3)'); // 8 + * + * // get and set variables and functions + * var x = parser.get('x'); // 7 + * var f = parser.get('f'); // function + * var g = f(3, 2); // 9 + * parser.set('h', 500); + * var i = parser.eval('h / 2'); // 250 + * parser.set('hello', function (name) { + * return 'hello, ' + name + '!'; + * }); + * parser.eval('hello("user")'); // "hello, user!" + * + * // clear defined functions and variables + * parser.clear(); + * + * See also: + * + * eval, compile, parse + * + * @return {Parser} Parser + */ + return typed('parser', { + '': function () { + return new Parser(math); + } + }); + } + + exports.name = 'parser'; + exports.factory = factory; + exports.math = true; // requires the math namespace as 5th argument /***/ }, /* 78 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - Matrix = __webpack_require__(7); - - /** - * Create a Matrix. The function creates a new `math.type.Matrix` object from - * an `Array`. A Matrix has utility functions to manipulate the data in the - * matrix, like getting the size and getting or setting values in the matrix. - * - * Syntax: - * - * math.matrix() // creates an empty matrix - * math.matrix(data) // creates a matrix with initial data. - * - * Examples: - * - * var m = math.matrix([[1, 2], [3, 4]]); - * m.size(); // Array [2, 2] - * m.resize([3, 2], 5); - * m.valueOf(); // Array [[1, 2], [3, 4], [5, 5]] - * m.get([1, 0]) // number 3 - * - * See also: - * - * bignumber, boolean, complex, index, number, string, unit - * - * @param {Array | Matrix} [data] A multi dimensional array - * @return {Matrix} The created matrix - */ - math.matrix = function matrix(data) { - if (arguments.length > 1) { - throw new math.error.ArgumentsError('matrix', arguments.length, 0, 1); - } - - return new Matrix(data); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var SparseMatrix = type.SparseMatrix; + + /** + * Create a Sparse Matrix. The function creates a new `math.type.Matrix` object from + * an `Array`. A Matrix has utility functions to manipulate the data in the + * matrix, like getting the size and getting or setting values in the matrix. + * + * Syntax: + * + * math.sparse() // creates an empty sparse matrix. + * math.sparse(data) // creates a sparse matrix with initial data. + * + * Examples: + * + * var m = math.sparse([[1, 2], [3, 4]]); + * m.size(); // Array [2, 2] + * m.resize([3, 2], 5); + * m.valueOf(); // Array [[1, 2], [3, 4], [5, 5]] + * m.get([1, 0]) // number 3 + * + * See also: + * + * bignumber, boolean, complex, index, number, string, unit, matrix + * + * @param {Array | Matrix} [data] A two dimensional array + * + * @return {Matrix} The created matrix + */ + return typed('sparse', { + '': function () { + return new SparseMatrix([]); + }, + + 'Array | Matrix': function (data) { + return new SparseMatrix(data); + } + }); + } + + exports.name = 'sparse'; + exports.factory = factory; /***/ }, /* 79 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164); - - var BigNumber = math.type.BigNumber; - var Unit = math.type.Unit; - var collection = __webpack_require__(14); - - var isCollection = collection.isCollection; - var isNumber = util.number.isNumber; - var isBoolean = util['boolean'].isBoolean; - var isString = util.string.isString; - - /** - * Create a number or convert a string, boolean, or unit to a number. - * When value is a matrix, all elements will be converted to number. - * - * Syntax: - * - * math.number(value) - * math.number(unit, valuelessUnit) - * - * Examples: - * - * math.number(2); // returns number 2 - * math.number('7.2'); // returns number 7.2 - * math.number(true); // returns number 1 - * math.number([true, false, true, true]); // returns [1, 0, 1, 1] - * math.number(math.unit('52cm'), 'm'); // returns 0.52 - * - * See also: - * - * bignumber, boolean, complex, index, matrix, string, unit - * - * @param {String | Number | Boolean | Array | Matrix | Unit | null} [value] Value to be converted - * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number - * @return {Number | Array | Matrix} The created number - */ - math.number = function number (value, valuelessUnit) { - switch (arguments.length) { - case 0: - return 0; - - case 1: - if (isCollection(value)) { - return collection.deepMap(value, number); - } - - if (value instanceof BigNumber) { - return value.toNumber(); - } - - if (isString(value)) { - var num = Number(value); - if (isNaN(num)) { - num = Number(value.valueOf()); - } - if (isNaN(num)) { - throw new SyntaxError(value.toString() + ' is no valid number'); - } - return num; - } - - if (isBoolean(value) || value === null) { - return +value; - } - - if (isNumber(value)) { - return value; - } - - if (value instanceof Unit) { - throw new Error('Second argument with valueless unit expected'); - } - - throw new math.error.UnsupportedTypeError('number', math['typeof'](value)); - - case 2: - if (value instanceof Unit && isString(valuelessUnit) || valuelessUnit instanceof Unit) { - return value.toNumber(valuelessUnit); - } - - throw new math.error.UnsupportedTypeError('number', math['typeof'](value), math['typeof'](valuelessUnit)); - - - default: - throw new math.error.ArgumentsError('number', arguments.length, 0, 1); - } - }; - }; + 'use strict'; + + var number = __webpack_require__(175); + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a string or convert any object into a string. + * Elements of Arrays and Matrices are processed element wise. + * + * Syntax: + * + * math.string(value) + * + * Examples: + * + * math.string(4.2); // returns string '4.2' + * math.string(math.complex(3, 2); // returns string '3 + 2i' + * + * var u = math.unit(5, 'km'); + * math.string(u.to('m')); // returns string '5000 m' + * + * math.string([true, false]); // returns ['true', 'false'] + * + * See also: + * + * bignumber, boolean, complex, index, matrix, number, unit + * + * @param {* | Array | Matrix | null} [value] A value to convert to a string + * @return {String | Array | Matrix} The created string + */ + var string = typed('string', { + '': function () { + return ''; + }, + + 'number': number.format, + + 'null': function (x) { + return 'null'; + }, + + 'boolean': function (x) { + return x + ''; + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, string); + }, + + 'any': function (x) { + return String(x); + } + }); + + return string; + } + + exports.name = 'string'; + exports.factory = factory; /***/ }, /* 80 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Parser = __webpack_require__(17); - - /** - * Create a parser. The function creates a new `math.expression.Parser` object. - * - * Syntax: - * - * math.parser() - * - * Examples: - * - * var parser = new math.parser(); - * - * // evaluate expressions - * var a = parser.eval('sqrt(3^2 + 4^2)'); // 5 - * var b = parser.eval('sqrt(-4)'); // 2i - * var c = parser.eval('2 inch in cm'); // 5.08 cm - * var d = parser.eval('cos(45 deg)'); // 0.7071067811865476 - * - * // define variables and functions - * parser.eval('x = 7 / 2'); // 3.5 - * parser.eval('x + 3'); // 6.5 - * parser.eval('function f(x, y) = x^y'); // f(x, y) - * parser.eval('f(2, 3)'); // 8 - * - * // get and set variables and functions - * var x = parser.get('x'); // 7 - * var f = parser.get('f'); // function - * var g = f(3, 2); // 9 - * parser.set('h', 500); - * var i = parser.eval('h / 2'); // 250 - * parser.set('hello', function (name) { - * return 'hello, ' + name + '!'; - * }); - * parser.eval('hello("user")'); // "hello, user!" - * - * // clear defined functions and variables - * parser.clear(); - * - * See also: - * - * eval, compile, parse - * - * @return {Parser} Parser - */ - math.parser = function parser() { - return new Parser(math); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Create a unit. Depending on the passed arguments, the function + * will create and return a new math.type.Unit object. + * When a matrix is provided, all elements will be converted to units. + * + * Syntax: + * + * math.unit(unit : string) + * math.unit(value : number, unit : string) + * + * Examples: + * + * var a = math.unit(5, 'cm'); // returns Unit 50 mm + * var b = math.unit('23 kg'); // returns Unit 23 kg + * a.to('m'); // returns Unit 0.05 m + * + * See also: + * + * bignumber, boolean, complex, index, matrix, number, string + * + * @param {* | Array | Matrix} args A number and unit. + * @return {Unit | Array | Matrix} The created unit + */ + + var unit = typed('unit', { + 'Unit': function (x) { + return x.clone(); + }, + + 'string': function (x) { + if (type.Unit.isValuelessUnit(x)) { + return new type.Unit(null, x); // a pure unit + } + + var u = type.Unit.parse(x); // a unit with value, like '5cm' + if (u) { + return u; + } + + throw new SyntaxError('String "' + x + '" is no valid unit'); + }, + + 'number, string': function (value, unit) { + return new type.Unit(value, unit); + }, + + 'BigNumber, string': function (value, unit) { + return new type.Unit(value.toNumber(), unit); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, unit); + } + }); + + return unit; + } + + exports.name = 'unit'; + exports.factory = factory; /***/ }, /* 81 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - /** - * Wrap any value in a chain, allowing to perform chained operations on - * the value. - * - * All methods available in the math.js library can be called upon the chain, - * and then will be evaluated with the value itself as first argument. - * The chain can be closed by executing `chain.done()`, which returns - * the final value. - * - * The chain has a number of special functions: - * - * - `done()` Finalize the chain and return the chain's value. - * - `valueOf()` The same as `done()` - * - `toString()` Executes `math.format()` onto the chain's value, returning - * a string representation of the value. - * - * Syntax: - * - * math.chain(value) - * - * Examples: - * - * math.chain(3) - * .add(4) - * .subtract(2) - * .done(); // 5 - * - * math.chain( [[1, 2], [3, 4]] ) - * .subset(math.index(0, 0), 8) - * .multiply(3) - * .done(); // [[24, 6], [9, 12]] - * - * @param {*} [value] A value of any type on which to start a chained operation. - * @return {math.chaining.Chain} The created chain - */ - math.chain = function(value) { - // TODO: check number of arguments - return new math.chaining.Chain(value); - }; - - // TODO: deprecate math.select in v2.0 - math.select = function(value) { - // give a warning once. - if (console && typeof console.log === 'function') { - console.log('WARNING: Function "select" is renamed to "chain". It will be deprecated in v2.0.') - } - - // replace warning function with chain function - math.select = math.chain; - math.chaining.Chain.prototype['select'] = math.select; - - return math.chain(value); - } - }; + 'use strict'; + + function factory (type, config, load, typed, math) { + var collection = load(__webpack_require__(2)); + var parse = load(__webpack_require__(13)); + + /** + * Parse and compile an expression. + * Returns a an object with a function `eval([scope])` to evaluate the + * compiled expression. + * + * Syntax: + * + * math.compile(expr) // returns one node + * math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes + * + * Examples: + * + * var code = math.compile('sqrt(3^2 + 4^2)'); + * code.eval(); // 5 + * + * var scope = {a: 3, b: 4} + * var code = math.compile('a * b'); // 12 + * code.eval(scope); // 12 + * scope.a = 5; + * code.eval(scope); // 20 + * + * var nodes = math.compile(['a = 3', 'b = 4', 'a * b']); + * nodes[2].eval(); // 12 + * + * See also: + * + * parse, eval + * + * @param {String | String[] | Array | Matrix} expr + * The expression to be compiled + * @return {{eval: Function} | Array.<{eval: Function}>} code + * An object with the compiled expression + * @throws {Error} + */ + return typed('compile', { + 'string': function (expr) { + return parse(expr).compile(math); + }, + + 'Array | Matrix': function (expr) { + return collection.deepMap(expr, function (entry) { + return parse(entry).compile(math); + }); + } + }); + } + + exports.math = true; // request access to the math namespace as 5th argument of the factory function + exports.name = 'compile'; + exports.factory = factory; /***/ }, /* 82 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - collection = __webpack_require__(14), - - number = util.number, - isNumber = util.number.isNumber, - isCollection = collection.isCollection; - - /** - * Create a string or convert any object into a string. - * Elements of Arrays and Matrices are processed element wise. - * - * Syntax: - * - * math.string(value) - * - * Examples: - * - * math.string(4.2); // returns string '4.2' - * math.string(math.complex(3, 2); // returns string '3 + 2i' - * - * var u = math.unit(5, 'km'); - * math.string(u.to('m')); // returns string '5000 m' - * - * math.string([true, false]); // returns ['true', 'false'] - * - * See also: - * - * bignumber, boolean, complex, index, matrix, number, unit - * - * @param {* | Array | Matrix | null} [value] A value to convert to a string - * @return {String | Array | Matrix} The created string - */ - math.string = function string (value) { - switch (arguments.length) { - case 0: - return ''; - - case 1: - if (isNumber(value)) { - return number.format(value); - } - - if (isCollection(value)) { - return collection.deepMap(value, string); - } - - if (value === null) { - return 'null'; - } - - return value.toString(); - - default: - throw new math.error.ArgumentsError('string', arguments.length, 0, 1); - } - }; - }; - + 'use strict'; + + function factory (type, config, load, typed, math) { + var collection = load(__webpack_require__(2)); + var parse = load(__webpack_require__(13)); + + /** + * Evaluate an expression. + * + * Syntax: + * + * math.eval(expr) + * math.eval(expr, scope) + * math.eval([expr1, expr2, expr3, ...]) + * math.eval([expr1, expr2, expr3, ...], scope) + * + * Example: + * + * math.eval('(2+3)/4'); // 1.25 + * math.eval('sqrt(3^2 + 4^2)'); // 5 + * math.eval('sqrt(-4)'); // 2i + * math.eval(['a=3', 'b=4', 'a*b']);, // [3, 4, 12] + * + * var scope = {a:3, b:4}; + * math.eval('a * b', scope); // 12 + * + * See also: + * + * parse, compile + * + * @param {String | String[] | Matrix} expr The expression to be evaluated + * @param {Object} [scope] Scope to read/write variables + * @return {*} The result of the expression + * @throws {Error} + */ + return typed('compile', { + 'string': function (expr) { + var scope = {}; + return parse(expr).compile(math).eval(scope); + }, + + 'string, Object': function (expr, scope) { + return parse(expr).compile(math).eval(scope); + }, + + 'Array | Matrix': function (expr) { + var scope = {}; + return collection.deepMap(expr, function (entry) { + return parse(entry).compile(math).eval(scope); + }); + }, + + 'Array | Matrix, Object': function (expr, scope) { + return collection.deepMap(expr, function (entry) { + return parse(entry).compile(math).eval(scope); + }); + } + }); + } + + exports.math = true; // request access to the math namespace as 5th argument of the factory function + exports.name = 'eval'; + exports.factory = factory; /***/ }, /* 83 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isString = util.string.isString; - - /** - * Create a unit. Depending on the passed arguments, the function - * will create and return a new math.type.Unit object. - * When a matrix is provided, all elements will be converted to units. - * - * Syntax: - * - * math.unit(unit : string) - * math.unit(value : number, unit : string) - * - * Examples: - * - * var a = math.unit(5, 'cm'); // returns Unit 50 mm - * var b = math.unit('23 kg'); // returns Unit 23 kg - * a.to('m'); // returns Unit 0.05 m - * - * See also: - * - * bignumber, boolean, complex, index, matrix, number, string - * - * @param {* | Array | Matrix} args A number and unit. - * @return {Unit | Array | Matrix} The created unit - */ - math.unit = function unit(args) { - switch(arguments.length) { - case 1: - // parse a string - var arg = arguments[0]; - - if (arg instanceof Unit) { - // create a clone of the unit - return arg.clone(); - } - - if (isString(arg)) { - if (Unit.isValuelessUnit(arg)) { - return new Unit(null, arg); // a pure unit - } - - var u = Unit.parse(arg); // a unit with value, like '5cm' - if (u) { - return u; - } - - throw new SyntaxError('String "' + arg + '" is no valid unit'); - } - - if (isCollection(args)) { - return collection.deepMap(args, unit); - } - - throw new TypeError('A string or a number and string expected in function unit'); - - case 2: - // a number and a unit - - if (arguments[0] instanceof BigNumber) { - // convert value to number - return new Unit(arguments[0].toNumber(), arguments[1]); - } - else { - return new Unit(arguments[0], arguments[1]); - } - - default: - throw new math.error.ArgumentsError('unit', arguments.length, 1, 2); - } - }; - }; + 'use strict'; + + var docs = __webpack_require__(16); + + function factory (type, config, load, typed, math) { + /** + * Retrieve help on a function or data type. + * Help files are retrieved from the documentation in math.expression.docs. + * + * Syntax: + * + * math.help(search) + * + * Examples: + * + * console.log(math.help('sin').toString()); + * console.log(math.help(math.add).toString()); + * console.log(math.help(math.add).toJSON()); + * + * @param {function | string | Object} search A function or function name + * for which to get help + * @return {Help} A help object + */ + return typed('help', { + 'any': function (search) { + var prop; + var name = search; + + if (typeof search !== 'string') { + for (prop in math) { + // search in functions and constants + if (math.hasOwnProperty(prop) && (search === math[prop])) { + name = prop; + break; + } + } + + /* TODO: implement help for data types + if (!text) { + // search data type + for (prop in math.type) { + if (math.type.hasOwnProperty(prop)) { + if (search === math.type[prop]) { + text = prop; + break; + } + } + } + } + */ + } + + var doc = docs[name]; + if (!doc) { + throw new Error('No documentation found on "' + name + '"'); + } + return new type.Help(doc); + } + }); + } + + exports.math = true; // request access to the math namespace as 5th argument of the factory function + exports.name = 'help'; + exports.factory = factory; /***/ }, /* 84 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.and(x, y) - * - * Examples: - * - * math.and(2, 4); // returns true - * - * a = [2, 0, 0]; - * b = [3, 7, 0]; - * c = 0; - * - * math.and(a, b); // returns [true, false, false] - * math.and(a, c); // returns [false, false, false] - * - * See also: - * - * not, or, xor - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check - * @return {Boolean | Array | Matrix} - * Returns true when both inputs are defined with a nonzero/nonempty value. - */ - math.and = function and(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('and', arguments.length, 2); - } - - if ((isNumber(x) || isBoolean(x) || x === null) && - (isNumber(y) || isBoolean(y) || y === null)) { - return !!(x && y); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return false; - } - - return and(true, y); - } - if (isComplex(y)) { - if (y.re == 0 && y.im == 0) { - return false; - } - - return and(x, true); - } - - if (x instanceof BigNumber) { - if (x.isZero() || x.isNaN()) { - return false; - } - - return and(true, y); - } - if (y instanceof BigNumber) { - if (y.isZero() || y.isNaN()) { - return false; - } - - return and(x, true); - } - - if (isUnit(x)) { - if (x.value === null || x.value == 0) { - return false; - } - - return and(true, y); - } - if (isUnit(y)) { - if (y.value === null || y.value == 0) { - return false; - } - - return and(x, true); - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, and); - } - - throw new math.error.UnsupportedTypeError('and', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var parse = load(__webpack_require__(13)); + + /** + * Parse an expression. Returns a node tree, which can be evaluated by + * invoking node.eval(); + * + * Syntax: + * + * parse(expr) + * parse(expr, options) + * parse([expr1, expr2, expr3, ...]) + * parse([expr1, expr2, expr3, ...], options) + * + * Example: + * + * var node = parse('sqrt(3^2 + 4^2)'); + * node.compile(math).eval(); // 5 + * + * var scope = {a:3, b:4} + * var node = parse('a * b'); // 12 + * var code = node.compile(math); + * code.eval(scope); // 12 + * scope.a = 5; + * code.eval(scope); // 20 + * + * var nodes = math.parse(['a = 3', 'b = 4', 'a * b']); + * nodes[2].compile(math).eval(); // 12 + * + * @param {String | String[] | Matrix} expr Expression to be parsed + * @param {{nodes: Object}} [options] Available options: + * - `nodes` a set of custom nodes + * @return {Node | Node[]} node + * @throws {Error} + */ + return typed('parse', { + 'string | Array | Matrix': parse, + 'string | Array | Matrix, Object': parse + }); + } + + exports.name = 'parse'; + exports.factory = factory; /***/ }, /* 85 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Logical `not`. Flips boolean value of a given parameter. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.not(x) - * - * Examples: - * - * math.not(2); // returns false - * math.not(0); // returns true - * math.not(true); // returns false - * - * a = [2, -7, 0]; - * math.not(a); // returns [false, false, true] - * - * See also: - * - * and, or, xor - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check - * @return {Boolean | Array | Matrix} - * Returns true when input is a zero or empty value. - */ - math.not = function not(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('not', arguments.length, 1); - } - - if (isNumber(x) || isBoolean(x) || x === null) { - return !x; - } - - if (isComplex(x)) { - return x.re == 0 && x.im == 0; - } - - if (x instanceof BigNumber) { - return x.isZero() || x.isNaN(); - } - - if (isUnit(x)) { - return x.value === null || x.value == 0; - } - - if (isCollection(x)) { - return collection.deepMap(x, not); - } - - throw new math.error.UnsupportedTypeError('not', math['typeof'](x)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.and(x, y) + * + * Examples: + * + * math.and(2, 4); // returns true + * + * a = [2, 0, 0]; + * b = [3, 7, 0]; + * c = 0; + * + * math.and(a, b); // returns [true, false, false] + * math.and(a, c); // returns [false, false, false] + * + * See also: + * + * not, or, xor + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check + * @return {Boolean | Array | Matrix} + * Returns true when both inputs are defined with a nonzero/nonempty value. + */ + var and = typed('and', { + 'number, number': function (x, y) { + return !!(x && y); + }, + + 'Complex, Complex': function (x, y) { + return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0); + }, + + 'BigNumber, BigNumber': function (x, y) { + return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN(); + }, + + 'Unit, Unit': function (x, y) { + return (x.value !== 0 && x.value !== null) && (y.value !== 0 && y.value !== null); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, and); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, and); + } + }); + + return and; + } + + exports.name = 'and'; + exports.factory = factory; /***/ }, /* 86 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.or(x, y) - * - * Examples: - * - * math.or(2, 4); // returns true - * - * a = [2, 5, 0]; - * b = [0, 22, 0]; - * c = 0; - * - * math.or(a, b); // returns [true, true, false] - * math.or(b, c); // returns [false, true, false] - * - * See also: - * - * and, not, xor - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check - * @return {Boolean | Array | Matrix} - * Returns true when one of the inputs is defined with a nonzero/nonempty value. - */ - math.or = function or(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('or', arguments.length, 2); - } - - if ((isNumber(x) || isBoolean(x) || x === null) && - (isNumber(y) || isBoolean(y) || y === null)) { - return !!(x || y); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return or(false, y); - } - return true; - } - if (isComplex(y)) { - if (y.re == 0 && y.im == 0) { - return or(x, false); - } - return true; - } - - if (x instanceof BigNumber) { - if (x.isZero() || x.isNaN()) { - return or(false, y); - } - return true; - } - if (y instanceof BigNumber) { - if (y.isZero() || y.isNaN()) { - return or(x, false); - } - return true; - } - - if (isUnit(x)) { - if (x.value === null || x.value == 0) { - return or(false, y); - } - return true; - } - if (isUnit(y)) { - if (y.value === null || y.value == 0) { - return or(x, false); - } - return true; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, or); - } - - throw new math.error.UnsupportedTypeError('or', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Logical `not`. Flips boolean value of a given parameter. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.not(x) + * + * Examples: + * + * math.not(2); // returns false + * math.not(0); // returns true + * math.not(true); // returns false + * + * a = [2, -7, 0]; + * math.not(a); // returns [false, false, true] + * + * See also: + * + * and, or, xor + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check + * @return {Boolean | Array | Matrix} + * Returns true when input is a zero or empty value. + */ + var not = typed('not', { + 'number': function (x) { + return !x; + }, + + 'Complex': function (x) { + return x.re === 0 && x.im === 0; + }, + + 'BigNumber': function (x) { + return x.isZero() || x.isNaN(); + }, + + 'Unit': function (x) { + return x.value === null || x.value == 0; + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, not); + } + }); + + return not; + } + + exports.name = 'not'; + exports.factory = factory; /***/ }, /* 87 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.xor(x, y) - * - * Examples: - * - * math.xor(2, 4); // returns false - * - * a = [2, 0, 0]; - * b = [2, 7, 0]; - * c = 0; - * - * math.xor(a, b); // returns [false, true, false] - * math.xor(a, c); // returns [true, false, false] - * - * See also: - * - * and, not, or - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check - * @return {Boolean | Array | Matrix} - * Returns true when one and only one input is defined with a nonzero/nonempty value. - */ - math.xor = function xor(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('xor', arguments.length, 2); - } - - if ((isNumber(x) || isBoolean(x) || x === null) && - (isNumber(y) || isBoolean(y) || y === null)) { - return !!(!!x ^ !!y); - } - - if (isComplex(x)) { - return xor(!(x.re == 0 && x.im == 0), y); - } - if (isComplex(y)) { - return xor(x, !(y.re == 0 && y.im == 0)); - } - - if (x instanceof BigNumber) { - return xor(!(x.isZero() || x.isNaN()), y); - } - if (y instanceof BigNumber) { - return xor(x, !(y.isZero() || y.isNaN())); - } - - if (isUnit(x)) { - return xor(!(x.value === null || x.value == 0), y); - } - if (isUnit(y)) { - return xor(x, !(y.value === null || y.value == 0)); - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, xor); - } - - throw new math.error.UnsupportedTypeError('xor', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.or(x, y) + * + * Examples: + * + * math.or(2, 4); // returns true + * + * a = [2, 5, 0]; + * b = [0, 22, 0]; + * c = 0; + * + * math.or(a, b); // returns [true, true, false] + * math.or(b, c); // returns [false, true, false] + * + * See also: + * + * and, not, xor + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check + * @return {Boolean | Array | Matrix} + * Returns true when one of the inputs is defined with a nonzero/nonempty value. + */ + var or = typed('or', { + 'number, number': function (x, y) { + return !!(x || y); + }, + + 'Complex, Complex': function (x, y) { + return (x.re !== 0 || x.im !== 0) || (y.re !== 0 || y.im !== 0); + }, + + 'BigNumber, BigNumber': function (x, y) { + return (!x.isZero() && !x.isNaN()) || (!y.isZero() && !y.isNaN()); + }, + + 'Unit, Unit': function (x, y) { + return (x.value !== 0 && x.value !== null) || (y.value !== 0 && y.value !== null); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, or); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, or); + } + }); + + return or; + } + + exports.name = 'or'; + exports.factory = factory; /***/ }, /* 88 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164); - - var BigNumber = __webpack_require__(12); - var Matrix = __webpack_require__(7); - var collection = __webpack_require__(14); - - var object = util.object; - var array = util.array; - var isNumber = util.number.isNumber; - var isInteger = util.number.isInteger; - var isCollection = collection.isCollection; - - /** - * Concatenate two or more matrices. - * - * Syntax: - * - * math.concat(A, B, C, ...) - * math.concat(A, B, C, ..., dim) - * - * Where: - * - * - `dim: number` is a zero-based dimension over which to concatenate the matrices. - * By default the last dimension of the matrices. - * - * Examples: - * - * var A = [[1, 2], [5, 6]]; - * var B = [[3, 4], [7, 8]]; - * - * math.concat(A, B); // returns [[1, 2, 3, 4], [5, 6, 7, 8]] - * math.concat(A, B, 0); // returns [[1, 2], [5, 6], [3, 4], [7, 8]] - * - * See also: - * - * size, squeeze, subset, transpose - * - * @param {... Array | Matrix} args Two or more matrices - * @return {Array | Matrix} Concatenated matrix - */ - math.concat = function concat (args) { - var i, - len = arguments.length, - dim = -1, // zero-based dimension - prevDim, - asMatrix = false, - matrices = []; // contains multi dimensional arrays - - for (i = 0; i < len; i++) { - var arg = arguments[i]; - - // test whether we need to return a Matrix (if not we return an Array) - if (arg instanceof Matrix) { - asMatrix = true; - } - - if ((i == len - 1) && (isNumber(arg) || arg instanceof BigNumber)) { - // last argument contains the dimension on which to concatenate - prevDim = dim; - dim = arg.valueOf(); // change bignumber to number - - if (!isInteger(dim)) { - throw new TypeError('Integer number expected for dimension'); - } - - if (dim < 0) { - // TODO: would be more clear when throwing a DimensionError here - throw new math.error.IndexError(dim); - } - if (i > 0 && dim > prevDim) { - // TODO: would be more clear when throwing a DimensionError here - throw new math.error.IndexError(dim, prevDim + 1); - } - } - else if (isCollection(arg)) { - // this is a matrix or array - var matrix = object.clone(arg).valueOf(); - var size = array.size(arg.valueOf()); - matrices[i] = matrix; - prevDim = dim; - dim = size.length - 1; - - // verify whether each of the matrices has the same number of dimensions - if (i > 0 && dim != prevDim) { - throw new math.error.DimensionError(prevDim + 1, dim + 1); - } - } - else { - throw new math.error.UnsupportedTypeError('concat', math['typeof'](arg)); - } - } - - if (matrices.length == 0) { - throw new SyntaxError('At least one matrix expected'); - } - - var res = matrices.shift(); - while (matrices.length) { - res = _concat(res, matrices.shift(), dim, 0); - } - - return asMatrix ? new Matrix(res) : res; - }; - - /** - * Recursively concatenate two matrices. - * The contents of the matrices is not cloned. - * @param {Array} a Multi dimensional array - * @param {Array} b Multi dimensional array - * @param {Number} concatDim The dimension on which to concatenate (zero-based) - * @param {Number} dim The current dim (zero-based) - * @return {Array} c The concatenated matrix - * @private - */ - function _concat(a, b, concatDim, dim) { - if (dim < concatDim) { - // recurse into next dimension - if (a.length != b.length) { - throw new math.error.DimensionError(a.length, b.length); - } - - var c = []; - for (var i = 0; i < a.length; i++) { - c[i] = _concat(a[i], b[i], concatDim, dim + 1); - } - return c; - } - else { - // concatenate this dimension - return a.concat(b); - } - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.xor(x, y) + * + * Examples: + * + * math.xor(2, 4); // returns false + * + * a = [2, 0, 0]; + * b = [2, 7, 0]; + * c = 0; + * + * math.xor(a, b); // returns [false, true, false] + * math.xor(a, c); // returns [true, false, false] + * + * See also: + * + * and, not, or + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First value to check + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second value to check + * @return {Boolean | Array | Matrix} + * Returns true when one and only one input is defined with a nonzero/nonempty value. + */ + var xor = typed('xor', { + 'number, number': function (x, y) { + return !!(!!x ^ !!y); + }, + + 'Complex, Complex': function (x, y) { + return !!((x.re !== 0 || x.im !== 0) ^ (y.re !== 0 || y.im !== 0)); + }, + + 'BigNumber, BigNumber': function (x, y) { + return !!((!x.isZero() && !x.isNaN()) ^ (!y.isZero() && !y.isNaN())); + }, + + 'Unit, Unit': function (x, y) { + return !!((x.value !== 0 && x.value !== null) ^ (y.value !== 0 && y.value !== null)); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, xor); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, xor); + } + }); + + return xor; + } + + exports.name = 'xor'; + exports.factory = factory; /***/ }, /* 89 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function(math) { - var array = __webpack_require__(167); - var Matrix = __webpack_require__(7); - - /** - * Calculate the cross product for two vectors in three dimensional space. - * The cross product of `A = [a1, a2, a3]` and `B =[b1, b2, b3]` is defined - * as: - * - * cross(A, B) = [ - * a2 * b3 - a3 * b2, - * a3 * b1 - a1 * b3, - * a1 * b2 - a2 * b1 - * ] - * - * Syntax: - * - * math.cross(x, y) - * - * Examples: - * - * math.cross([1, 1, 0], [0, 1, 1]); // Returns [1, -1, 1] - * math.cross([3, -3, 1], [4, 9, 2]); // Returns [-15, -2, 39] - * math.cross([2, 3, 4], [5, 6, 7]); // Returns [-3, 6, -3] - * - * See also: - * - * dot, multiply - * - * @param {Array | Matrix} x First vector - * @param {Array | Matrix} y Second vector - * @return {Array | Matrix} Returns the cross product of `x` and `y` - */ - math.cross = function cross(x, y) { - if (x instanceof Matrix) { - if (y instanceof Matrix) { - return new Matrix(_cross(x.toArray(), y.toArray())); - } - else if (Array.isArray(y)) { - return new Matrix(_cross(x.toArray(), y)); - } - } - else if (Array.isArray(x)) { - if (y instanceof Matrix) { - return new Matrix(_cross(x, y.toArray())); - } - else if (Array.isArray(y)) { - return _cross(x, y); - } - } - - throw new math.error.UnsupportedTypeError('cross', math['typeof'](x), math['typeof'](y)); - }; - - /** - * Calculate the cross product for two arrays - * @param {Array} x First vector - * @param {Array} y Second vector - * @returns {Array} Returns the cross product of x and y - * @private - */ - function _cross(x, y) { - var xSize= array.size(x); - var ySize = array.size(y); - - if (xSize.length != 1 || ySize.length != 1 || xSize[0] != 3 || ySize[0] != 3) { - throw new RangeError('Vectors with length 3 expected ' + - '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])'); - } - - return [ - math.subtract(math.multiply(x[1], y[2]), math.multiply(x[2], y[1])), - math.subtract(math.multiply(x[2], y[0]), math.multiply(x[0], y[2])), - math.subtract(math.multiply(x[0], y[1]), math.multiply(x[1], y[0])) - ]; - } - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var isInteger = __webpack_require__(175).isInteger; + var array = __webpack_require__(172); + var IndexError = __webpack_require__(173); + var DimensionError = __webpack_require__(174); + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + + /** + * Concatenate two or more matrices. + * + * Syntax: + * + * math.concat(A, B, C, ...) + * math.concat(A, B, C, ..., dim) + * + * Where: + * + * - `dim: number` is a zero-based dimension over which to concatenate the matrices. + * By default the last dimension of the matrices. + * + * Examples: + * + * var A = [[1, 2], [5, 6]]; + * var B = [[3, 4], [7, 8]]; + * + * math.concat(A, B); // returns [[1, 2, 3, 4], [5, 6, 7, 8]] + * math.concat(A, B, 0); // returns [[1, 2], [5, 6], [3, 4], [7, 8]] + * + * See also: + * + * size, squeeze, subset, transpose + * + * @param {... Array | Matrix} args Two or more matrices + * @return {Array | Matrix} Concatenated matrix + */ + return typed('concat', { + // TODO: change signature to '...Array | Matrix, dim?' when supported + '...Array | Matrix | number | BigNumber': function (args) { + var i; + var len = args.length; + var dim = -1; // zero-based dimension + var prevDim; + var asMatrix = false; + var matrices = []; // contains multi dimensional arrays + + for (i = 0; i < len; i++) { + var arg = args[i]; + + // test whether we need to return a Matrix (if not we return an Array) + if (arg instanceof type.Matrix) { + asMatrix = true; + } + + if (typeof arg === 'number' || arg instanceof type.BigNumber) { + if (i !== len - 1) { + throw new Error('Dimension must be specified as last argument'); + } + + // last argument contains the dimension on which to concatenate + prevDim = dim; + dim = arg.valueOf(); // change BigNumber to number + + if (!isInteger(dim)) { + throw new TypeError('Integer number expected for dimension'); + } + + if (dim < 0) { + // TODO: would be more clear when throwing a DimensionError here + throw new IndexError(dim); + } + if (i > 0 && dim > prevDim) { + // TODO: would be more clear when throwing a DimensionError here + throw new IndexError(dim, prevDim + 1); + } + } + else { + // this is a matrix or array + var m = clone(arg).valueOf(); + var size = array.size(m); + matrices[i] = m; + prevDim = dim; + dim = size.length - 1; + + // verify whether each of the matrices has the same number of dimensions + if (i > 0 && dim != prevDim) { + throw new DimensionError(prevDim + 1, dim + 1); + } + } + } + + if (matrices.length == 0) { + throw new SyntaxError('At least one matrix expected'); + } + + var res = matrices.shift(); + while (matrices.length) { + res = _concat(res, matrices.shift(), dim, 0); + } + + return asMatrix ? matrix(res) : res; + } + }); + } + + /** + * Recursively concatenate two matrices. + * The contents of the matrices is not cloned. + * @param {Array} a Multi dimensional array + * @param {Array} b Multi dimensional array + * @param {Number} concatDim The dimension on which to concatenate (zero-based) + * @param {Number} dim The current dim (zero-based) + * @return {Array} c The concatenated matrix + * @private + */ + function _concat(a, b, concatDim, dim) { + if (dim < concatDim) { + // recurse into next dimension + if (a.length != b.length) { + throw new DimensionError(a.length, b.length); + } + + var c = []; + for (var i = 0; i < a.length; i++) { + c[i] = _concat(a[i], b[i], concatDim, dim + 1); + } + return c; + } + else { + // concatenate this dimension + return a.concat(b); + } + } + + exports.name = 'concat'; + exports.factory = factory; /***/ }, /* 90 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - - var Matrix = __webpack_require__(7); - - var add = __webpack_require__(36)(config); - var subtract = __webpack_require__(59)(config); - var multiply = __webpack_require__(51)(config); - var unaryMinus = __webpack_require__(60)(config); - - var util = __webpack_require__(164); - var object = util.object; - var string = util.string; - - /** - * Calculate the determinant of a matrix. - * - * Syntax: - * - * math.det(x) - * - * Examples: - * - * math.det([[1, 2], [3, 4]]); // returns -2 - * - * var A = [ - * [-2, 2, 3], - * [-1, 1, 3], - * [2, 0, -1] - * ] - * math.det(A); // returns 6 - * - * See also: - * - * inv - * - * @param {Array | Matrix} x A matrix - * @return {Number} The determinant of `x` - */ - return typed('det', { - 'any': function (x) { - return object.clone(x); - }, - - 'Array | Matrix': function det (x) { - var size; - if (x instanceof Matrix) { - size = x.size(); - } - else if (x instanceof Array) { - x = new Matrix(x); - size = x.size(); - } - else { - // a scalar - size = []; - } - - switch (size.length) { - case 0: - // scalar - return object.clone(x); - - case 1: - // vector - if (size[0] == 1) { - return object.clone(x.valueOf()[0]); - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + string.format(size) + ')'); - } - - case 2: - // two dimensional array - var rows = size[0]; - var cols = size[1]; - if (rows == cols) { - return _det(x.clone().valueOf(), rows, cols); - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + string.format(size) + ')'); - } - - default: - // multi dimensional array - throw new RangeError('Matrix must be two dimensional ' + - '(size: ' + string.format(size) + ')'); - } - } - }); - - /** - * Calculate the determinant of a matrix - * @param {Array[]} matrix A square, two dimensional matrix - * @param {Number} rows Number of rows of the matrix (zero-based) - * @param {Number} cols Number of columns of the matrix (zero-based) - * @returns {Number} det - * @private - */ - function _det (matrix, rows, cols) { - if (rows == 1) { - // this is a 1 x 1 matrix - return object.clone(matrix[0][0]); - } - else if (rows == 2) { - // this is a 2 x 2 matrix - // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12 - return subtract( - multiply(matrix[0][0], matrix[1][1]), - multiply(matrix[1][0], matrix[0][1]) - ); - } - else { - // this is an n x n matrix - var compute_mu = function (matrix) { - var i, j; - - // Compute the matrix with zero lower triangle, same upper triangle, - // and diagonals given by the negated sum of the below diagonal - // elements. - var mu = new Array(matrix.length); - var sum = 0; - for (i = 1; i < matrix.length; i++) { - sum = add(sum, matrix[i][i]); - } - - for (i = 0; i < matrix.length; i++) { - mu[i] = new Array(matrix.length); - mu[i][i] = unaryMinus(sum); - - for (j = 0; j < i; j++) { - mu[i][j] = 0; // TODO: make bignumber 0 in case of bignumber computation - } - - for (j = i + 1; j < matrix.length; j++) { - mu[i][j] = matrix[i][j]; - } - - if (i+1 < matrix.length) { - sum = subtract(sum, matrix[i + 1][i + 1]); - } - } - - return mu; - }; - - var fa = matrix; - for (var i = 0; i < rows - 1; i++) { - fa = multiply(compute_mu(fa), matrix); - } - - if (rows % 2 == 0) { - return unaryMinus(fa[0][0]); - } else { - return fa[0][0]; - } - } - } - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + var subtract = load(__webpack_require__(55)); + var multiply = load(__webpack_require__(47)); + + /** + * Calculate the cross product for two vectors in three dimensional space. + * The cross product of `A = [a1, a2, a3]` and `B =[b1, b2, b3]` is defined + * as: + * + * cross(A, B) = [ + * a2 * b3 - a3 * b2, + * a3 * b1 - a1 * b3, + * a1 * b2 - a2 * b1 + * ] + * + * Syntax: + * + * math.cross(x, y) + * + * Examples: + * + * math.cross([1, 1, 0], [0, 1, 1]); // Returns [1, -1, 1] + * math.cross([3, -3, 1], [4, 9, 2]); // Returns [-15, -2, 39] + * math.cross([2, 3, 4], [5, 6, 7]); // Returns [-3, 6, -3] + * + * See also: + * + * dot, multiply + * + * @param {Array | Matrix} x First vector + * @param {Array | Matrix} y Second vector + * @return {Array | Matrix} Returns the cross product of `x` and `y` + */ + return typed('cross', { + 'Matrix, Matrix': function (x, y) { + return matrix(_cross(x.toArray(), y.toArray())); + }, + + 'Matrix, Array': function (x, y) { + return matrix(_cross(x.toArray(), y)); + }, + + 'Array, Matrix': function (x, y) { + return matrix(_cross(x, y.toArray())); + }, + + 'Array, Array': _cross + }); + + /** + * Calculate the cross product for two arrays + * @param {Array} x First vector + * @param {Array} y Second vector + * @returns {Array} Returns the cross product of x and y + * @private + */ + function _cross(x, y) { + var xSize= size(x); + var ySize = size(y); + + if (xSize.length != 1 || ySize.length != 1 || xSize[0] != 3 || ySize[0] != 3) { + throw new RangeError('Vectors with length 3 expected ' + + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])'); + } + + return [ + subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), + subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), + subtract(multiply(x[0], y[1]), multiply(x[1], y[0])) + ]; + } + } + + exports.name = 'cross'; + exports.factory = factory; /***/ }, /* 91 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - - object = util.object, - isArray = util.array.isArray, - isNumber = util.number.isNumber, - isInteger = util.number.isInteger; - - /** - * Create a diagonal matrix or retrieve the diagonal of a matrix - * - * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned. - * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector. - * When k is positive, the values are placed on the super diagonal. - * When k is negative, the values are placed on the sub diagonal. - * - * Syntax: - * - * math.diag(X) - * math.diag(X, k) - * - * Examples: - * - * // create a diagonal matrix - * math.diag([1, 2, 3]); // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]] - * math.diag([1, 2, 3], 1); // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]] - * math.diag([1, 2, 3], -1); // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]] - * - * // retrieve the diagonal from a matrix - * var a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]; - * math.diag(a); // returns [1, 5, 9] - * - * See also: - * - * ones, zeros, eye - * - * @param {Matrix | Array} x A two dimensional matrix or a vector - * @param {Number | BigNumber} [k=0] The diagonal where the vector will be filled - * in or retrieved. - * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix. - */ - math.diag = function diag (x, k) { - var data, vector, i, iMax; - - if (arguments.length != 1 && arguments.length != 2) { - throw new math.error.ArgumentsError('diag', arguments.length, 1, 2); - } - - if (k) { - // convert BigNumber to a number - if (k instanceof BigNumber) k = k.toNumber(); - - if (!isNumber(k) || !isInteger(k)) { - throw new TypeError ('Second parameter in function diag must be an integer'); - } - } - else { - k = 0; - } - var kSuper = k > 0 ? k : 0; - var kSub = k < 0 ? -k : 0; - - // check type of input - var asArray; - if (x instanceof Matrix) { - asArray = false; - } - else if (isArray(x)) { - // convert to matrix - x = new Matrix(x); - asArray = true; - } - else { - throw new TypeError ('First parameter in function diag must be a Matrix or Array'); - } - - var s = x.size(); - switch (s.length) { - case 1: - // x is a vector. create diagonal matrix - vector = x.valueOf(); - var matrix = new Matrix(); - var defaultValue = (vector[0] instanceof BigNumber) ? new BigNumber(0) : 0; - matrix.resize([vector.length + kSub, vector.length + kSuper], defaultValue); - data = matrix.valueOf(); - iMax = vector.length; - for (i = 0; i < iMax; i++) { - data[i + kSub][i + kSuper] = object.clone(vector[i]); - } - return asArray ? matrix.valueOf() : matrix; - - case 2: - // x is a matrix get diagonal from matrix - vector = []; - data = x.valueOf(); - iMax = Math.min(s[0] - kSub, s[1] - kSuper); - for (i = 0; i < iMax; i++) { - vector[i] = object.clone(data[i + kSub][i + kSuper]); - } - return asArray ? vector : new Matrix(vector); - - default: - throw new RangeError('Matrix for function diag must be 2 dimensional'); - } - }; - }; + 'use strict'; + + var util = __webpack_require__(171); + var object = util.object; + var string = util.string; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var matrix = load(__webpack_require__(75)); + var add = load(__webpack_require__(32)); + var subtract = load(__webpack_require__(55)); + var multiply = load(__webpack_require__(47)); + var unaryMinus = load(__webpack_require__(56)); + + /** + * Calculate the determinant of a matrix. + * + * Syntax: + * + * math.det(x) + * + * Examples: + * + * math.det([[1, 2], [3, 4]]); // returns -2 + * + * var A = [ + * [-2, 2, 3], + * [-1, 1, 3], + * [2, 0, -1] + * ] + * math.det(A); // returns 6 + * + * See also: + * + * inv + * + * @param {Array | Matrix} x A matrix + * @return {Number} The determinant of `x` + */ + return typed('det', { + 'any': function (x) { + return object.clone(x); + }, + + 'Array | Matrix': function det (x) { + var size; + if (x instanceof type.Matrix) { + size = x.size(); + } + else if (x instanceof Array) { + x = matrix(x); + size = x.size(); + } + else { + // a scalar + size = []; + } + + switch (size.length) { + case 0: + // scalar + return object.clone(x); + + case 1: + // vector + if (size[0] == 1) { + return object.clone(x.valueOf()[0]); + } + else { + throw new RangeError('Matrix must be square ' + + '(size: ' + string.format(size) + ')'); + } + + case 2: + // two dimensional array + var rows = size[0]; + var cols = size[1]; + if (rows == cols) { + return _det(x.clone().valueOf(), rows, cols); + } + else { + throw new RangeError('Matrix must be square ' + + '(size: ' + string.format(size) + ')'); + } + + default: + // multi dimensional array + throw new RangeError('Matrix must be two dimensional ' + + '(size: ' + string.format(size) + ')'); + } + } + }); + + /** + * Calculate the determinant of a matrix + * @param {Array[]} matrix A square, two dimensional matrix + * @param {Number} rows Number of rows of the matrix (zero-based) + * @param {Number} cols Number of columns of the matrix (zero-based) + * @returns {Number} det + * @private + */ + function _det (matrix, rows, cols) { + if (rows == 1) { + // this is a 1 x 1 matrix + return object.clone(matrix[0][0]); + } + else if (rows == 2) { + // this is a 2 x 2 matrix + // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12 + return subtract( + multiply(matrix[0][0], matrix[1][1]), + multiply(matrix[1][0], matrix[0][1]) + ); + } + else { + // this is an n x n matrix + var compute_mu = function (matrix) { + var i, j; + + // Compute the matrix with zero lower triangle, same upper triangle, + // and diagonals given by the negated sum of the below diagonal + // elements. + var mu = new Array(matrix.length); + var sum = 0; + for (i = 1; i < matrix.length; i++) { + sum = add(sum, matrix[i][i]); + } + + for (i = 0; i < matrix.length; i++) { + mu[i] = new Array(matrix.length); + mu[i][i] = unaryMinus(sum); + + for (j = 0; j < i; j++) { + mu[i][j] = 0; // TODO: make bignumber 0 in case of bignumber computation + } + + for (j = i + 1; j < matrix.length; j++) { + mu[i][j] = matrix[i][j]; + } + + if (i+1 < matrix.length) { + sum = subtract(sum, matrix[i + 1][i + 1]); + } + } + + return mu; + }; + + var fa = matrix; + for (var i = 0; i < rows - 1; i++) { + fa = multiply(compute_mu(fa), matrix); + } + + if (rows % 2 == 0) { + return unaryMinus(fa[0][0]); + } else { + return fa[0][0]; + } + } + } + } + + exports.name = 'det'; + exports.factory = factory; + /***/ }, /* 92 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function(math) { - var array = __webpack_require__(167); - var Matrix = __webpack_require__(7); - - /** - * Calculate the dot product of two vectors. The dot product of - * `A = [a1, a2, a3, ..., an]` and `B = [b1, b2, b3, ..., bn]` is defined as: - * - * dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn - * - * Syntax: - * - * math.dot(x, y) - * - * Examples: - * - * math.dot([2, 4, 1], [2, 2, 3]); // returns Number 15 - * math.multiply([2, 4, 1], [2, 2, 3]); // returns Number 15 - * - * See also: - * - * multiply, cross - * - * @param {Array | Matrix} x First vector - * @param {Array | Matrix} y Second vector - * @return {Number} Returns the dot product of `x` and `y` - */ - math.dot = function dot(x, y) { - if (x instanceof Matrix) { - if (y instanceof Matrix) { - return _dot(x.toArray(), y.toArray()); - } - else if (Array.isArray(y)) { - return _dot(x.toArray(), y); - } - } - else if (Array.isArray(x)) { - if (y instanceof Matrix) { - return _dot(x, y.toArray()); - } - else if (Array.isArray(y)) { - return _dot(x, y); - } - } - - throw new math.error.UnsupportedTypeError('dot', math['typeof'](x), math['typeof'](y)); - }; - - /** - * Calculate the dot product for two arrays - * @param {Array} x First vector - * @param {Array} y Second vector - * @returns {Number} Returns the dot product of x and y - * @private - */ - // TODO: double code with math.multiply - function _dot(x, y) { - var xSize= array.size(x); - var ySize = array.size(y); - var len = xSize[0]; - - if (xSize.length !== 1 || ySize.length !== 1) throw new RangeError('Vector expected'); // TODO: better error message - if (xSize[0] != ySize[0]) throw new RangeError('Vectors must have equal length (' + xSize[0] + ' != ' + ySize[0] + ')'); - if (len == 0) throw new RangeError('Cannot calculate the dot product of empty vectors'); - - var prod = 0; - for (var i = 0; i < len; i++) { - prod = math.add(prod, math.multiply(x[i], y[i])); - } - - return prod; - } - }; + 'use strict'; + + var array = __webpack_require__(172); + var clone = __webpack_require__(166).clone; + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + + /** + * Create a diagonal matrix or retrieve the diagonal of a matrix + * + * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned. + * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector. + * When k is positive, the values are placed on the super diagonal. + * When k is negative, the values are placed on the sub diagonal. + * + * Syntax: + * + * math.diag(X) + * math.diag(X, format) + * math.diag(X, k) + * math.diag(X, k, format) + * + * Examples: + * + * // create a diagonal matrix + * math.diag([1, 2, 3]); // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]] + * math.diag([1, 2, 3], 1); // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]] + * math.diag([1, 2, 3], -1); // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]] + * + * // retrieve the diagonal from a matrix + * var a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]; + * math.diag(a); // returns [1, 5, 9] + * + * See also: + * + * ones, zeros, eye + * + * @param {Matrix | Array} x A two dimensional matrix or a vector + * @param {Number | BigNumber} [k=0] The diagonal where the vector will be filled + * in or retrieved. + * @param {string} [format='dense'] The matrix storage format. + * + * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix. + */ + return typed('diag', { + // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments + + 'Array': function (x) { + return _diag(x, 0, array.size(x), null); + }, + + 'Array, number': function (x, k) { + return _diag(x, k, array.size(x), null); + }, + + 'Array, BigNumber': function (x, k) { + return _diag(x, k.toNumber(), array.size(x), null); + }, + + 'Array, string': function (x, format) { + return _diag(x, 0, array.size(x), format); + }, + + 'Array, number, string': function (x, k, format) { + return _diag(x, k, array.size(x), format); + }, + + 'Array, BigNumber, string': function (x, k, format) { + return _diag(x, k.toNumber(), array.size(x), format); + }, + + 'Matrix': function (x) { + return _diag(x, 0, x.size(), x.storage()); + }, + + 'Matrix, number': function (x, k) { + return _diag(x, k, x.size(), x.storage()); + }, + + 'Matrix, BigNumber': function (x, k) { + return _diag(x, k.toNumber(), x.size(), x.storage()); + }, + + 'Matrix, string': function (x, format) { + return _diag(x, 0, x.size(), format); + }, + + 'Matrix, number, string': function (x, k, format) { + return _diag(x, k, x.size(), format); + }, + + 'Matrix, BigNumber, string': function (x, k, format) { + return _diag(x, k.toNumber(), x.size(), format); + } + }); + + /** + * Creeate diagonal matrix from a vector or vice versa + * @param {Array | Matrix} x + * @param {number} k + * @param {string} format Storage format for matrix. If null, + * an Array is returned + * @returns {Array | Matrix} + * @private + */ + function _diag (x, k, size, format) { + if (!isInteger(k)) { + throw new TypeError ('Second parameter in function diag must be an integer'); + } + + var kSuper = k > 0 ? k : 0; + var kSub = k < 0 ? -k : 0; + + // check dimensions + switch (size.length) { + case 1: + return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper); + case 2: + return _getDiagonal(x, k, format, size, kSub, kSuper); + } + throw new RangeError('Matrix for function diag must be 2 dimensional'); + } + + function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) { + // matrix size + var ms = [l + kSub, l + kSuper]; + // get matrix constructor + var F = type.Matrix.storage(format || 'dense'); + // create diagonal matrix + var m = F.diagonal(ms, x, k); + // check we need to return a matrix + return format !== null ? m : m.valueOf(); + } + + function _getDiagonal(x, k, format, s, kSub, kSuper) { + // check x is a Matrix + if (x instanceof type.Matrix) { + // get diagonal matrix + var dm = x.diagonal(k); + // check we need to return a matrix + if (format !== null) { + // check we need to change matrix format + if (format !== dm.storage()) + return matrix(dm, format); + return dm; + } + return dm.valueOf(); + } + // vector size + var n = Math.min(s[0] - kSub, s[1] - kSuper); + // diagonal values + var vector = new Array(n); + // loop diagonal + for (var i = 0; i < n; i++) { + vector[i] = clone(x[i + kSub][i + kSuper]); + } + // check we need to return a matrix + return format !== null ? matrix(vector) : vector; + } + } + + exports.name = 'diag'; + exports.factory = factory; /***/ }, /* 93 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - - var BigNumber = __webpack_require__(336); - var Matrix = __webpack_require__(7); - var isInteger = __webpack_require__(3).isInteger; - - /** - * Create a 2-dimensional identity matrix with size m x n or n x n. - * The matrix has ones on the diagonal and zeros elsewhere. - * - * Syntax: - * - * math.eye(n) - * math.eye(m, n) - * math.eye([m, n]) - * - * Examples: - * - * math.eye(3); // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]] - * math.eye(3, 2); // returns [[1, 0], [0, 1], [0, 0]] - * - * var A = [[1, 2, 3], [4, 5, 6]]; - * math.eye(math.size(b)); // returns [[1, 0, 0], [0, 1, 0]] - * - * See also: - * - * diag, ones, zeros, size, range - * - * @param {...Number | Matrix | Array} size The size for the matrix - * @return {Matrix | Array | Number} A matrix with ones on the diagonal. - */ - return typed('eye', { - '': function () { - return (config.matrix === 'matrix') ? new Matrix([]) : []; - }, - - 'number | BigNumber': function (rows) { - var matrix = _eye(rows, rows); - return (config.matrix === 'matrix') ? matrix : matrix.valueOf(); - }, - - 'number | BigNumber, number | BigNumber': function (rows, cols) { - var matrix = _eye(rows, cols); - return (config.matrix === 'matrix') ? matrix : matrix.valueOf(); - }, - - 'Array': function (size) { - return _eyeVector(size).valueOf(); - }, - - 'Matrix': function (size) { - return _eyeVector(size.valueOf()); - } - }); - - function _eyeVector (size) { - switch (size.length) { - case 0: return (config.matrix === 'matrix') ? new Matrix([]) : []; - case 1: return _eye(size[0], size[0]); - case 2: return _eye(size[0], size[1]); - default: throw new Error('Vector containing two values expected'); - } - } - - /** - * Create an identity matrix - * @param {number | BigNumber} rows - * @param {number | BigNumber} cols - * @returns {Matrix} - * @private - */ - function _eye (rows, cols) { - // BigNumber constructor with the right precision - var Big = rows instanceof BigNumber ? rows.constructor : - cols instanceof BigNumber ? cols.constructor : null; - - if (rows instanceof BigNumber) rows = rows.toNumber(); - if (cols instanceof BigNumber) cols = cols.toNumber(); - - if (!isInteger(rows) || rows < 1) { - throw new Error('Parameters in function eye must be positive integers'); - } - if (!isInteger(cols) || cols < 1) { - throw new Error('Parameters in function eye must be positive integers'); - } - - // create the matrix - var matrix = new Matrix(); - var one = Big ? new BigNumber(1) : 1; - var defaultValue = Big ? new Big(0) : 0; - matrix.resize([rows, cols], defaultValue); - - // fill in ones on the diagonal - var minimum = Math.min(rows, cols); - var data = matrix.valueOf(); - for (var d = 0; d < minimum; d++) { - data[d][d] = one; - } - - return matrix; - } - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var add = load(__webpack_require__(32)); + var multiply = load(__webpack_require__(47)); + + /** + * Calculate the dot product of two vectors. The dot product of + * `A = [a1, a2, a3, ..., an]` and `B = [b1, b2, b3, ..., bn]` is defined as: + * + * dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn + * + * Syntax: + * + * math.dot(x, y) + * + * Examples: + * + * math.dot([2, 4, 1], [2, 2, 3]); // returns Number 15 + * math.multiply([2, 4, 1], [2, 2, 3]); // returns Number 15 + * + * See also: + * + * multiply, cross + * + * @param {Array | Matrix} x First vector + * @param {Array | Matrix} y Second vector + * @return {Number} Returns the dot product of `x` and `y` + */ + return typed('dot', { + 'Matrix, Matrix': function (x, y) { + return _dot(x.toArray(), y.toArray()); + }, + + 'Matrix, Array': function (x, y) { + return _dot(x.toArray(), y); + }, + + 'Array, Matrix': function (x, y) { + return _dot(x, y.toArray()); + }, + + 'Array, Array': _dot + }); + + /** + * Calculate the dot product for two arrays + * @param {Array} x First vector + * @param {Array} y Second vector + * @returns {Number} Returns the dot product of x and y + * @private + */ + // TODO: double code with math.multiply + function _dot(x, y) { + var xSize= size(x); + var ySize = size(y); + var len = xSize[0]; + + if (xSize.length !== 1 || ySize.length !== 1) throw new RangeError('Vector expected'); // TODO: better error message + if (xSize[0] != ySize[0]) throw new RangeError('Vectors must have equal length (' + xSize[0] + ' != ' + ySize[0] + ')'); + if (len == 0) throw new RangeError('Cannot calculate the dot product of empty vectors'); + + var prod = 0; + for (var i = 0; i < len; i++) { + prod = add(prod, multiply(x[i], y[i])); + } + + return prod; + } + } + + exports.name = 'dot'; + exports.factory = factory; /***/ }, /* 94 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164); - - var Matrix = __webpack_require__(7); - - var object = util.object; - var array = util.array; - var isArray = Array.isArray; - - /** - * Flatten a multi dimensional matrix into a single dimensional matrix. - * - * Syntax: - * - * math.flatten(x) - * - * Examples: - * - * math.flatten([[1,2], [3,4]]); // returns [1, 2, 3, 4] - * - * See also: - * - * concat, resize, size, squeeze - * - * @param {Matrix | Array} x Matrix to be flattened - * @return {Matrix | Array} Returns the flattened matrix - */ - math.flatten = function flatten (x) { - if (arguments.length !== 1) { - throw new math.error.ArgumentsError('flatten', arguments.length, 1); - } - - if (x instanceof Matrix) { - var clone = object.clone(x.toArray()); - var flat = array.flatten(clone); - return new Matrix(flat); - } - - if (isArray(x)) { - return array.flatten(object.clone(x)); - } - - throw new math.error.UnsupportedTypeError('flatten', math['typeof'](x)); - }; - }; + 'use strict'; + + var array = __webpack_require__(172); + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + + /** + * Create a 2-dimensional identity matrix with size m x n or n x n. + * The matrix has ones on the diagonal and zeros elsewhere. + * + * Syntax: + * + * math.eye(n) + * math.eye(n, format) + * math.eye(m, n) + * math.eye(m, n, format) + * math.eye([m, n]) + * math.eye([m, n], format) + * + * Examples: + * + * math.eye(3); // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]] + * math.eye(3, 2); // returns [[1, 0], [0, 1], [0, 0]] + * + * var A = [[1, 2, 3], [4, 5, 6]]; + * math.eye(math.size(b)); // returns [[1, 0, 0], [0, 1, 0]] + * + * See also: + * + * diag, ones, zeros, size, range + * + * @param {...Number | Matrix | Array} size The size for the matrix + * @param {string} [format] The Matrix storage format + * + * @return {Matrix | Array | Number} A matrix with ones on the diagonal. + */ + return typed('eye', { + '': function () { + return (config.matrix === 'matrix') ? matrix([]) : []; + }, + + 'string': function (format) { + return matrix(format); + }, + + 'number | BigNumber': function (rows) { + return _eye(rows, rows, config.matrix === 'matrix' ? 'default' : undefined); + }, + + 'number | BigNumber, string': function (rows, format) { + return _eye(rows, rows, format); + }, + + 'number | BigNumber, number | BigNumber': function (rows, cols) { + return _eye(rows, cols, config.matrix === 'matrix' ? 'default' : undefined); + }, + + 'number | BigNumber, number | BigNumber, string': function (rows, cols, format) { + return _eye(rows, cols, format); + }, + + 'Array': function (size) { + return _eyeVector(size); + }, + + 'Array, string': function (size, format) { + return _eyeVector(size, format); + }, + + 'Matrix': function (size) { + return _eyeVector(size.valueOf(), size.storage()); + }, + + 'Matrix, string': function (size, format) { + return _eyeVector(size.valueOf(), format); + } + }); + + function _eyeVector (size, format) { + switch (size.length) { + case 0: return format ? matrix(format) : []; + case 1: return _eye(size[0], size[0], format); + case 2: return _eye(size[0], size[1], format); + default: throw new Error('Vector containing two values expected'); + } + } + + /** + * Create an identity matrix + * @param {number | BigNumber} rows + * @param {number | BigNumber} cols + * @param {string} [format] + * @returns {Matrix} + * @private + */ + function _eye (rows, cols, format) { + // BigNumber constructor with the right precision + var Big = rows instanceof type.BigNumber ? rows.constructor : + cols instanceof type.BigNumber ? cols.constructor : null; + + if (rows instanceof type.BigNumber) rows = rows.toNumber(); + if (cols instanceof type.BigNumber) cols = cols.toNumber(); + + if (!isInteger(rows) || rows < 1) { + throw new Error('Parameters in function eye must be positive integers'); + } + if (!isInteger(cols) || cols < 1) { + throw new Error('Parameters in function eye must be positive integers'); + } + + var one = Big ? new type.BigNumber(1) : 1; + var defaultValue = Big ? new Big(0) : 0; + var size = [rows, cols]; + + // check we need to return a matrix + if (format) { + // get matrix storage constructor + var F = type.Matrix.storage(format); + // create diagonal matrix (use optimized implementation for storage format) + return F.diagonal(size, one, 0, defaultValue); + } + + // create and resize array + var res = array.resize([], size, defaultValue); + // fill in ones on the diagonal + var minimum = rows < cols ? rows : cols; + // fill diagonal + for (var d = 0; d < minimum; d++) { + res[d][d] = one; + } + return res; + } + } + + exports.name = 'eye'; + exports.factory = factory; /***/ }, /* 95 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var util = __webpack_require__(164); - - var Matrix = __webpack_require__(7); - - var divideScalar = __webpack_require__(333)(config); - var add = __webpack_require__(36)(config); - var multiply = __webpack_require__(51)(config); - var unaryMinus = __webpack_require__(60)(config); - var det = __webpack_require__(90)(config); - var eye = __webpack_require__(93)(config); - - /** - * Calculate the inverse of a square matrix. - * - * Syntax: - * - * math.inv(x) - * - * Examples: - * - * math.inv([[1, 2], [3, 4]]); // returns [[-2, 1], [1.5, -0.5]] - * math.inv(4); // returns 0.25 - * 1 / 4; // returns 0.25 - * - * See also: - * - * det, transpose - * - * @param {Number | Complex | Array | Matrix} x Matrix to be inversed - * @return {Number | Complex | Array | Matrix} The inverse of `x`. - */ - var inv = typed('inv', { - 'Array | Matrix': function (x) { - var size = x instanceof Matrix ? x.size() : util.array.size(x); - switch (size.length) { - case 1: - // vector - if (size[0] == 1) { - if (x instanceof Matrix) { - return new Matrix([ - divideScalar(1, x.valueOf()[0]) - ]); - } - else { - return [ - divideScalar(1, x[0]) - ]; - } - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + util.string.format(size) + ')'); - } - - case 2: - // two dimensional array - var rows = size[0]; - var cols = size[1]; - if (rows == cols) { - if (x instanceof Matrix) { - return new Matrix( - _inv(x.valueOf(), rows, cols) - ); - } - else { - // return an Array - return _inv(x, rows, cols); - } - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + util.string.format(size) + ')'); - } - - default: - // multi dimensional array - throw new RangeError('Matrix must be two dimensional ' + - '(size: ' + util.string.format(size) + ')'); - } - }, - - 'any': function (x) { - // scalar - return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers - } - }); - - /** - * Calculate the inverse of a square matrix - * @param {Array[]} matrix A square matrix - * @param {Number} rows Number of rows - * @param {Number} cols Number of columns, must equal rows - * @return {Array[]} inv Inverse matrix - * @private - */ - function _inv (matrix, rows, cols){ - var r, s, f, value, temp; - - if (rows == 1) { - // this is a 1 x 1 matrix - value = matrix[0][0]; - if (value == 0) { - throw Error('Cannot calculate inverse, determinant is zero'); - } - return [[ - divideScalar(1, value) - ]]; - } - else if (rows == 2) { - // this is a 2 x 2 matrix - var d = det(matrix); - if (d == 0) { - throw Error('Cannot calculate inverse, determinant is zero'); - } - return [ - [ - divideScalar(matrix[1][1], d), - divideScalar(unaryMinus(matrix[0][1]), d) - ], - [ - divideScalar(unaryMinus(matrix[1][0]), d), - divideScalar(matrix[0][0], d) - ] - ]; - } - else { - // this is a matrix of 3 x 3 or larger - // calculate inverse using gauss-jordan elimination - // http://en.wikipedia.org/wiki/Gaussian_elimination - // http://mathworld.wolfram.com/MatrixInverse.html - // http://math.uww.edu/~mcfarlat/inverse.htm - - // make a copy of the matrix (only the arrays, not of the elements) - var A = matrix.concat(); - for (r = 0; r < rows; r++) { - A[r] = A[r].concat(); - } - - // create an identity matrix which in the end will contain the - // matrix inverse - var B = eye(rows).valueOf(); - - // loop over all columns, and perform row reductions - for (var c = 0; c < cols; c++) { - // element Acc should be non zero. if not, swap content - // with one of the lower rows - r = c; - while (r < rows && A[r][c] == 0) { - r++; - } - if (r == rows || A[r][c] == 0) { - // TODO: in case of zero det, just return a matrix wih Infinity values? (like octave) - throw Error('Cannot calculate inverse, determinant is zero'); - } - if (r != c) { - temp = A[c]; A[c] = A[r]; A[r] = temp; - temp = B[c]; B[c] = B[r]; B[r] = temp; - } - - // eliminate non-zero values on the other rows at column c - var Ac = A[c], - Bc = B[c]; - for (r = 0; r < rows; r++) { - var Ar = A[r], - Br = B[r]; - if(r != c) { - // eliminate value at column c and row r - if (Ar[c] != 0) { - f = divideScalar(unaryMinus(Ar[c]), Ac[c]); - - // add (f * row c) to row r to eliminate the value - // at column c - for (s = c; s < cols; s++) { - Ar[s] = add(Ar[s], multiply(f, Ac[s])); - } - for (s = 0; s < cols; s++) { - Br[s] = add(Br[s], multiply(f, Bc[s])); - } - } - } - else { - // normalize value at Acc to 1, - // divide each value on row r with the value at Acc - f = Ac[c]; - for (s = c; s < cols; s++) { - Ar[s] = divideScalar(Ar[s], f); - } - for (s = 0; s < cols; s++) { - Br[s] = divideScalar(Br[s], f); - } - } - } - } - return B; - } - } - - return inv; - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var _flatten = __webpack_require__(172).flatten; + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + + /** + * Flatten a multi dimensional matrix into a single dimensional matrix. + * + * Syntax: + * + * math.flatten(x) + * + * Examples: + * + * math.flatten([[1,2], [3,4]]); // returns [1, 2, 3, 4] + * + * See also: + * + * concat, resize, size, squeeze + * + * @param {Matrix | Array} x Matrix to be flattened + * @return {Matrix | Array} Returns the flattened matrix + */ + return typed('flatten', { + 'Array': function (x) { + return _flatten(clone(x)); + }, + + 'Matrix': function (x) { + var flat = _flatten(clone(x.toArray())); + // TODO: return the same matrix type as x + return matrix(flat); + } + }); + } + + exports.name = 'flatten'; + exports.factory = factory; /***/ }, /* 96 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - array = util.array, - - isArray = Array.isArray; - - /** - * Create a matrix filled with ones. The created matrix can have one or - * multiple dimensions. - * - * Syntax: - * - * math.ones(m) - * math.ones(m, n) - * math.ones([m, n]) - * math.ones([m, n, p, ...]) - * - * Examples: - * - * math.ones(3); // returns [1, 1, 1] - * math.ones(3, 2); // returns [[1, 1], [1, 1], [1, 1]] - * - * var A = [[1, 2, 3], [4, 5, 6]]; - * math.zeros(math.size(A)); // returns [[1, 1, 1], [1, 1, 1]] - * - * See also: - * - * zeros, eye, size, range - * - * @param {...Number | Array} size The size of each dimension of the matrix - * @return {Array | Matrix | Number} A matrix filled with ones - */ - math.ones = function ones (size) { - var args = collection.argsToArray(arguments); - var asMatrix = (size instanceof Matrix) ? true : - (isArray(size) ? false : (config.matrix === 'matrix')); - - if (args.length == 0) { - // output an empty matrix - return asMatrix ? new Matrix() : []; - } - else { - // output an array or matrix - - // convert arguments from bignumber to numbers if needed - var asBigNumber = false; - args = args.map(function (value) { - if (value instanceof BigNumber) { - asBigNumber = true; - return value.toNumber(); - } else { - return value; - } - }); - - // resize the matrix - var res = []; - var defaultValue = asBigNumber ? new BigNumber(1) : 1; - res = array.resize(res, args, defaultValue); - - return asMatrix ? new Matrix(res) : res; - } - }; - }; + 'use strict'; + + var util = __webpack_require__(171); + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var matrix = load(__webpack_require__(75)); + var divideScalar = load(__webpack_require__(213)); + var add = load(__webpack_require__(32)); + var multiply = load(__webpack_require__(47)); + var unaryMinus = load(__webpack_require__(56)); + var det = load(__webpack_require__(91)); + var eye = load(__webpack_require__(94)); + + /** + * Calculate the inverse of a square matrix. + * + * Syntax: + * + * math.inv(x) + * + * Examples: + * + * math.inv([[1, 2], [3, 4]]); // returns [[-2, 1], [1.5, -0.5]] + * math.inv(4); // returns 0.25 + * 1 / 4; // returns 0.25 + * + * See also: + * + * det, transpose + * + * @param {Number | Complex | Array | Matrix} x Matrix to be inversed + * @return {Number | Complex | Array | Matrix} The inverse of `x`. + */ + var inv = typed('inv', { + 'Array | Matrix': function (x) { + var size = x instanceof type.Matrix ? x.size() : util.array.size(x); + switch (size.length) { + case 1: + // vector + if (size[0] == 1) { + if (x instanceof type.Matrix) { + return matrix([ + divideScalar(1, x.valueOf()[0]) + ]); + } + else { + return [ + divideScalar(1, x[0]) + ]; + } + } + else { + throw new RangeError('Matrix must be square ' + + '(size: ' + util.string.format(size) + ')'); + } + + case 2: + // two dimensional array + var rows = size[0]; + var cols = size[1]; + if (rows == cols) { + if (x instanceof type.Matrix) { + return matrix( + _inv(x.valueOf(), rows, cols), + x.storage() + ); + } + else { + // return an Array + return _inv(x, rows, cols); + } + } + else { + throw new RangeError('Matrix must be square ' + + '(size: ' + util.string.format(size) + ')'); + } + + default: + // multi dimensional array + throw new RangeError('Matrix must be two dimensional ' + + '(size: ' + util.string.format(size) + ')'); + } + }, + + 'any': function (x) { + // scalar + return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers + } + }); + + /** + * Calculate the inverse of a square matrix + * @param {Array[]} mat A square matrix + * @param {Number} rows Number of rows + * @param {Number} cols Number of columns, must equal rows + * @return {Array[]} inv Inverse matrix + * @private + */ + function _inv (mat, rows, cols){ + var r, s, f, value, temp; + + if (rows == 1) { + // this is a 1 x 1 matrix + value = mat[0][0]; + if (value == 0) { + throw Error('Cannot calculate inverse, determinant is zero'); + } + return [[ + divideScalar(1, value) + ]]; + } + else if (rows == 2) { + // this is a 2 x 2 matrix + var d = det(mat); + if (d == 0) { + throw Error('Cannot calculate inverse, determinant is zero'); + } + return [ + [ + divideScalar(mat[1][1], d), + divideScalar(unaryMinus(mat[0][1]), d) + ], + [ + divideScalar(unaryMinus(mat[1][0]), d), + divideScalar(mat[0][0], d) + ] + ]; + } + else { + // this is a matrix of 3 x 3 or larger + // calculate inverse using gauss-jordan elimination + // http://en.wikipedia.org/wiki/Gaussian_elimination + // http://mathworld.wolfram.com/MatrixInverse.html + // http://math.uww.edu/~mcfarlat/inverse.htm + + // make a copy of the matrix (only the arrays, not of the elements) + var A = mat.concat(); + for (r = 0; r < rows; r++) { + A[r] = A[r].concat(); + } + + // create an identity matrix which in the end will contain the + // matrix inverse + var B = eye(rows).valueOf(); + + // loop over all columns, and perform row reductions + for (var c = 0; c < cols; c++) { + // element Acc should be non zero. if not, swap content + // with one of the lower rows + r = c; + while (r < rows && A[r][c] == 0) { + r++; + } + if (r == rows || A[r][c] == 0) { + // TODO: in case of zero det, just return a matrix wih Infinity values? (like octave) + throw Error('Cannot calculate inverse, determinant is zero'); + } + if (r != c) { + temp = A[c]; A[c] = A[r]; A[r] = temp; + temp = B[c]; B[c] = B[r]; B[r] = temp; + } + + // eliminate non-zero values on the other rows at column c + var Ac = A[c], + Bc = B[c]; + for (r = 0; r < rows; r++) { + var Ar = A[r], + Br = B[r]; + if(r != c) { + // eliminate value at column c and row r + if (Ar[c] != 0) { + f = divideScalar(unaryMinus(Ar[c]), Ac[c]); + + // add (f * row c) to row r to eliminate the value + // at column c + for (s = c; s < cols; s++) { + Ar[s] = add(Ar[s], multiply(f, Ac[s])); + } + for (s = 0; s < cols; s++) { + Br[s] = add(Br[s], multiply(f, Bc[s])); + } + } + } + else { + // normalize value at Acc to 1, + // divide each value on row r with the value at Acc + f = Ac[c]; + for (s = c; s < cols; s++) { + Ar[s] = divideScalar(Ar[s], f); + } + for (s = 0; s < cols; s++) { + Br[s] = divideScalar(Br[s], f); + } + } + } + } + return B; + } + } + + return inv; + } + + exports.name = 'inv'; + exports.factory = factory; /***/ }, /* 97 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isNumber = util.number.isNumber; - - /** - * Create an array from a range. - * By default, the range end is excluded. This can be customized by providing - * an extra parameter `includeEnd`. - * - * Syntax: - * - * math.range(str [, includeEnd]) // Create a range from a string, - * // where the string contains the - * // start, optional step, and end, - * // separated by a colon. - * math.range(start, end [, includeEnd]) // Create a range with start and - * // end and a step size of 1. - * math.range(start, end, step [, includeEnd]) // Create a range with start, step, - * // and end. - * - * Where: - * - * - `str: String` - * A string 'start:end' or 'start:step:end' - * - `start: {Number | BigNumber}` - * Start of the range - * - `end: Number | BigNumber` - * End of the range, excluded by default, included when parameter includeEnd=true - * - `step: Number | BigNumber` - * Step size. Default value is 1. - * - `includeEnd: boolean` - * Option to specify whether to include the end or not. False by default. - * - * Examples: - * - * math.range(2, 6); // [2, 3, 4, 5] - * math.range(2, -3, -1); // [2, 1, 0, -1, -2] - * math.range('2:1:6'); // [2, 3, 4, 5] - * math.range(2, 6, true); // [2, 3, 4, 5, 6] - * - * See also: - * - * ones, zeros, size, subset - * - * @param {*} args Parameters describing the ranges `start`, `end`, and optional `step`. - * @return {Array | Matrix} range - */ - math.range = function range(args) { - var params = Array.prototype.slice.call(arguments), - start, - end, - step, - includeEnd = false; - - // read the includeEnd parameter - if (isBoolean(params[params.length - 1])) { - includeEnd = params.pop() ? true : false; - } - - switch (params.length) { - case 1: - // range(str) - // parse string into a range - if (isString(params[0])) { - var r = _parse(params[0]); - if (!r){ - throw new SyntaxError('String "' + params[0] + '" is no valid range'); - } - - start = r.start; - end = r.end; - step = r.step; - } - else { - throw new TypeError('Two or three numbers or a single string expected in function range'); - } - break; - - case 2: - // range(str, end) - // range(start, end) - start = params[0]; - end = params[1]; - step = 1; - break; - - case 3: - // range(start, end, step) - start = params[0]; - end = params[1]; - step = params[2]; - break; - - case 4: - throw new TypeError('Parameter includeEnd must be a boolean'); - - default: - throw new math.error.ArgumentsError('range', arguments.length, 2, 4); - } - - // verify type of parameters - if (!isNumber(start) && !(start instanceof BigNumber)) { - throw new TypeError('Parameter start must be a number'); - } - if (!isNumber(end) && !(end instanceof BigNumber)) { - throw new TypeError('Parameter end must be a number'); - } - if (!isNumber(step) && !(step instanceof BigNumber)) { - throw new TypeError('Parameter step must be a number'); - } - - // go big - if (start instanceof BigNumber || end instanceof BigNumber || step instanceof BigNumber) { - // create a range with big numbers - var asBigNumber = true; - - // convert start, end, step to BigNumber - if (!(start instanceof BigNumber)) start = BigNumber.convert(start); - if (!(end instanceof BigNumber)) end = BigNumber.convert(end); - if (!(step instanceof BigNumber)) step = BigNumber.convert(step); - - if (!(start instanceof BigNumber) || !(end instanceof BigNumber) || !(step instanceof BigNumber)) { - // not all values can be converted to big number :( - // fall back to numbers - asBigNumber = false; - if (start instanceof BigNumber) start = start.toNumber(); - if (end instanceof BigNumber) end = end.toNumber(); - if (step instanceof BigNumber) step = step.toNumber(); - } - } - - // generate the range - var fn = asBigNumber ? - (includeEnd ? _bigRangeInc : _bigRange) : - (includeEnd ? _rangeInc : _range); - var array = fn(start, end, step); - - // return as array or matrix - return (config.matrix === 'array') ? array : new Matrix(array); - }; - - /** - * Create a range with numbers. End is excluded - * @param {Number} start - * @param {Number} end - * @param {Number} step - * @returns {Array} range - * @private - */ - function _range (start, end, step) { - var array = [], - x = start; - if (step > 0) { - while (x < end) { - array.push(x); - x += step; - } - } - else if (step < 0) { - while (x > end) { - array.push(x); - x += step; - } - } - - return array; - } - - /** - * Create a range with numbers. End is included - * @param {Number} start - * @param {Number} end - * @param {Number} step - * @returns {Array} range - * @private - */ - function _rangeInc (start, end, step) { - var array = [], - x = start; - if (step > 0) { - while (x <= end) { - array.push(x); - x += step; - } - } - else if (step < 0) { - while (x >= end) { - array.push(x); - x += step; - } - } - - return array; - } - - /** - * Create a range with big numbers. End is excluded - * @param {BigNumber} start - * @param {BigNumber} end - * @param {BigNumber} step - * @returns {Array} range - * @private - */ - function _bigRange (start, end, step) { - var array = [], - x = start, - zero = new BigNumber(0); - if (step.gt(zero)) { - while (x.lt(end)) { - array.push(x); - x = x.plus(step); - } - } - else if (step.lt(zero)) { - while (x.gt(end)) { - array.push(x); - x = x.plus(step); - } - } - - return array; - } - - /** - * Create a range with big numbers. End is included - * @param {BigNumber} start - * @param {BigNumber} end - * @param {BigNumber} step - * @returns {Array} range - * @private - */ - function _bigRangeInc (start, end, step) { - var array = [], - x = start, - zero = new BigNumber(0); - if (step.gt(zero)) { - while (x.lte(end)) { - array.push(x); - x = x.plus(step); - } - } - else if (step.lt(zero)) { - while (x.gte(end)) { - array.push(x); - x = x.plus(step); - } - } - - return array; - } - - /** - * Parse a string into a range, - * The string contains the start, optional step, and end, separated by a colon. - * If the string does not contain a valid range, null is returned. - * For example str='0:2:11'. - * @param {String} str - * @return {Object | null} range Object containing properties start, end, step - * @private - */ - function _parse (str) { - var args = str.split(':'), - nums = null; - - if (config.number === 'bignumber') { - // bignumber - try { - nums = args.map(function (arg) { - return new BigNumber(arg); - }); - } - catch (err) { - return null; - } - } - else { - // number - nums = args.map(function (arg) { - // use Number and not parseFloat as Number returns NaN on invalid garbage in the string - return Number(arg); - }); - - var invalid = nums.some(function (num) { - return isNaN(num); - }); - if(invalid) { - return null; - } - } - - switch (nums.length) { - case 2: - return { - start: nums[0], - end: nums[1], - step: 1 - }; - - case 3: - return { - start: nums[0], - end: nums[2], - step: nums[1] - }; - - default: - return null; - } - } - - }; + 'use strict'; + + module.exports = function (math, config) { + var util = __webpack_require__(171), + + BigNumber = math.type.BigNumber, + Matrix = math.type.Matrix, + collection = math.collection, + + array = util.array, + isNumber = util.number.isNumber, + isInteger = util.number.isInteger, + isString = util.string.isString, + isArray = Array.isArray; + + /** + * Create a matrix filled with ones. The created matrix can have one or + * multiple dimensions. + * + * Syntax: + * + * math.ones(m) + * math.ones(m, format) + * math.ones(m, n) + * math.ones(m, n, format) + * math.ones([m, n]) + * math.ones([m, n], format) + * math.ones([m, n, p, ...]) + * math.ones([m, n, p, ...], format) + * + * Examples: + * + * math.ones(3); // returns [1, 1, 1] + * math.ones(3, 2); // returns [[1, 1], [1, 1], [1, 1]] + * math.ones(3, 2, 'dense'); // returns Dense Matrix [[1, 1], [1, 1], [1, 1]] + * + * var A = [[1, 2, 3], [4, 5, 6]]; + * math.zeros(math.size(A)); // returns [[1, 1, 1], [1, 1, 1]] + * + * See also: + * + * zeros, eye, size, range + * + * @param {...Number | Array} size The size of each dimension of the matrix + * @param {string} [format] The Matrix storage format + * + * @return {Array | Matrix | Number} A matrix filled with ones + */ + math.ones = function ones (size, format) { + // process arguments + var args = collection.argsToArray(arguments); + // matrix storage format + var f; + // check format was provided + if (args.length > 0 && isString(args[args.length - 1])) { + // set format + f = args[args.length - 1]; + // re-process arguments, ignore last one + args = collection.argsToArray(args.slice(0, args.length - 1)); + } + else if (size instanceof Matrix) { + // use matrix format + f = size.storage(); + } + else if (!isArray(size) && config.matrix === 'matrix') { + // use default matrix format + f = 'default'; + } + + // convert arguments from bignumber to numbers if needed + var asBigNumber = false; + // map arguments & validate + args = args.map(function (value) { + // check it is a big number + if (value instanceof BigNumber) { + // set flag + asBigNumber = true; + // convert it + value = value.toNumber(); + } + // validate arguments + if (!isNumber(value) || !isInteger(value) || value < 0) { + throw new Error('Parameters in function eye must be positive integers'); + } + return value; + }); + + // default value + var defaultValue = asBigNumber ? new BigNumber(1) : 1; + + // check we need to return a matrix + if (f) { + // create empty matrix + var m = math.matrix(f); + // check we need to resize matrix + if (args.length > 0) { + // resize it to correct size + return m.resize(args, defaultValue); + } + return m; + } + // empty array + var res = []; + // check we need to resize array + if (args.length > 0) { + // resize array + return array.resize(res, args, defaultValue); + } + return res; + }; + }; /***/ }, /* 98 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - - array = util.array, - clone = util.object.clone, - string = util.string, - isString = util.string.isString, - isNumber = util.number.isNumber, - isInteger = util.number.isInteger, - isArray = array.isArray; - - /** - * Resize a matrix - * - * Syntax: - * - * math.resize(x, size) - * math.resize(x, size, defaultValue) - * - * Examples: - * - * math.resize([1, 2, 3, 4, 5], [3]); // returns Array [1, 2, 3] - * math.resize([1, 2, 3], [5], 0); // returns Array [1, 2, 3, 0, 0] - * math.resize(2, [2, 3], 0); // returns Matrix [[2, 0, 0], [0, 0, 0]] - * math.resize("hello", [8], "!"); // returns String 'hello!!!' - * - * See also: - * - * size, squeeze, subset - * - * @param {* | Array | Matrix} x Matrix to be resized - * @param {Array | Matrix} size One dimensional array with numbers - * @param {Number | String} [defaultValue=0] Zero by default, except in - * case of a string, in that case - * defaultValue = ' ' - * @return {* | Array | Matrix} A resized clone of matrix `x` - */ - math.resize = function resize (x, size, defaultValue) { - if (arguments.length != 2 && arguments.length != 3) { - throw new math.error.ArgumentsError('resize', arguments.length, 2, 3); - } - - var asMatrix = (x instanceof Matrix) ? true : isArray(x) ? false : (config.matrix !== 'array'); - - if (x instanceof Matrix) { - x = x.valueOf(); // get Array - } - if (size instanceof Matrix) { - size = size.valueOf(); // get Array - } - - if (size.length && size[0] instanceof BigNumber) { - // convert bignumbers to numbers - size = size.map(function (value) { - return (value instanceof BigNumber) ? value.toNumber() : value; - }); - } - - if (isString(x)) { - return _resizeString(x, size, defaultValue); - } - else { - if (size.length == 0) { - // output a scalar - while (isArray(x)) { - x = x[0]; - } - - return clone(x); - } - else { - // output an array/matrix - if (!isArray(x)) { - x = [x]; - } - x = clone(x); - - var res = array.resize(x, size, defaultValue); - return asMatrix ? new Matrix(res) : res; - } - } - }; - - /** - * Resize a string - * @param {String} str - * @param {Number[]} size - * @param {string} [defaultChar=' '] - * @private - */ - function _resizeString(str, size, defaultChar) { - if (defaultChar !== undefined) { - if (!isString(defaultChar) || defaultChar.length !== 1) { - throw new TypeError('Single character expected as defaultValue'); - } - } - else { - defaultChar = ' '; - } - - if (size.length !== 1) { - throw new math.error.DimensionError(size.length, 1); - } - var len = size[0]; - if (!isNumber(len) || !isInteger(len)) { - throw new TypeError('Invalid size, must contain positive integers ' + - '(size: ' + string.format(size) + ')'); - } - - if (str.length > len) { - return str.substring(0, len); - } - else if (str.length < len) { - var res = str; - for (var i = 0, ii = len - str.length; i < ii; i++) { - res += defaultChar; - } - return res; - } - else { - return str; - } - } - }; + 'use strict'; + + module.exports = function (math, config) { + var util = __webpack_require__(171), + + BigNumber = math.type.BigNumber, + Matrix = math.type.Matrix, + collection = math.collection, + + isBoolean = util['boolean'].isBoolean, + isString = util.string.isString, + isNumber = util.number.isNumber; + + /** + * Create an array from a range. + * By default, the range end is excluded. This can be customized by providing + * an extra parameter `includeEnd`. + * + * Syntax: + * + * math.range(str [, includeEnd]) // Create a range from a string, + * // where the string contains the + * // start, optional step, and end, + * // separated by a colon. + * math.range(start, end [, includeEnd]) // Create a range with start and + * // end and a step size of 1. + * math.range(start, end, step [, includeEnd]) // Create a range with start, step, + * // and end. + * + * Where: + * + * - `str: String` + * A string 'start:end' or 'start:step:end' + * - `start: {Number | BigNumber}` + * Start of the range + * - `end: Number | BigNumber` + * End of the range, excluded by default, included when parameter includeEnd=true + * - `step: Number | BigNumber` + * Step size. Default value is 1. + * - `includeEnd: boolean` + * Option to specify whether to include the end or not. False by default. + * + * Examples: + * + * math.range(2, 6); // [2, 3, 4, 5] + * math.range(2, -3, -1); // [2, 1, 0, -1, -2] + * math.range('2:1:6'); // [2, 3, 4, 5] + * math.range(2, 6, true); // [2, 3, 4, 5, 6] + * + * See also: + * + * ones, zeros, size, subset + * + * @param {*} args Parameters describing the ranges `start`, `end`, and optional `step`. + * @return {Array | Matrix} range + */ + math.range = function range(args) { + var params = Array.prototype.slice.call(arguments), + start, + end, + step, + includeEnd = false; + + // read the includeEnd parameter + if (isBoolean(params[params.length - 1])) { + includeEnd = params.pop() ? true : false; + } + + switch (params.length) { + case 1: + // range(str) + // parse string into a range + if (isString(params[0])) { + var r = _parse(params[0]); + if (!r){ + throw new SyntaxError('String "' + params[0] + '" is no valid range'); + } + + start = r.start; + end = r.end; + step = r.step; + } + else { + throw new TypeError('Two or three numbers or a single string expected in function range'); + } + break; + + case 2: + // range(str, end) + // range(start, end) + start = params[0]; + end = params[1]; + step = 1; + break; + + case 3: + // range(start, end, step) + start = params[0]; + end = params[1]; + step = params[2]; + break; + + case 4: + throw new TypeError('Parameter includeEnd must be a boolean'); + + default: + throw new math.error.ArgumentsError('range', arguments.length, 2, 4); + } + + // verify type of parameters + if (!isNumber(start) && !(start instanceof BigNumber)) { + throw new TypeError('Parameter start must be a number'); + } + if (!isNumber(end) && !(end instanceof BigNumber)) { + throw new TypeError('Parameter end must be a number'); + } + if (!isNumber(step) && !(step instanceof BigNumber)) { + throw new TypeError('Parameter step must be a number'); + } + + // go big + if (start instanceof BigNumber || end instanceof BigNumber || step instanceof BigNumber) { + // create a range with big numbers + var asBigNumber = true; + + // convert start, end, step to BigNumber + if (!(start instanceof BigNumber)) start = BigNumber.convert(start); + if (!(end instanceof BigNumber)) end = BigNumber.convert(end); + if (!(step instanceof BigNumber)) step = BigNumber.convert(step); + + if (!(start instanceof BigNumber) || !(end instanceof BigNumber) || !(step instanceof BigNumber)) { + // not all values can be converted to big number :( + // fall back to numbers + asBigNumber = false; + if (start instanceof BigNumber) start = start.toNumber(); + if (end instanceof BigNumber) end = end.toNumber(); + if (step instanceof BigNumber) step = step.toNumber(); + } + } + + // generate the range + var fn = asBigNumber ? + (includeEnd ? _bigRangeInc : _bigRange) : + (includeEnd ? _rangeInc : _range); + var array = fn(start, end, step); + + // return as array or matrix + return (config.matrix === 'array') ? array : math.matrix(array); + }; + + /** + * Create a range with numbers. End is excluded + * @param {Number} start + * @param {Number} end + * @param {Number} step + * @returns {Array} range + * @private + */ + function _range (start, end, step) { + var array = [], + x = start; + if (step > 0) { + while (x < end) { + array.push(x); + x += step; + } + } + else if (step < 0) { + while (x > end) { + array.push(x); + x += step; + } + } + + return array; + } + + /** + * Create a range with numbers. End is included + * @param {Number} start + * @param {Number} end + * @param {Number} step + * @returns {Array} range + * @private + */ + function _rangeInc (start, end, step) { + var array = [], + x = start; + if (step > 0) { + while (x <= end) { + array.push(x); + x += step; + } + } + else if (step < 0) { + while (x >= end) { + array.push(x); + x += step; + } + } + + return array; + } + + /** + * Create a range with big numbers. End is excluded + * @param {BigNumber} start + * @param {BigNumber} end + * @param {BigNumber} step + * @returns {Array} range + * @private + */ + function _bigRange (start, end, step) { + var array = [], + x = start, + zero = new BigNumber(0); + if (step.gt(zero)) { + while (x.lt(end)) { + array.push(x); + x = x.plus(step); + } + } + else if (step.lt(zero)) { + while (x.gt(end)) { + array.push(x); + x = x.plus(step); + } + } + + return array; + } + + /** + * Create a range with big numbers. End is included + * @param {BigNumber} start + * @param {BigNumber} end + * @param {BigNumber} step + * @returns {Array} range + * @private + */ + function _bigRangeInc (start, end, step) { + var array = [], + x = start, + zero = new BigNumber(0); + if (step.gt(zero)) { + while (x.lte(end)) { + array.push(x); + x = x.plus(step); + } + } + else if (step.lt(zero)) { + while (x.gte(end)) { + array.push(x); + x = x.plus(step); + } + } + + return array; + } + + /** + * Parse a string into a range, + * The string contains the start, optional step, and end, separated by a colon. + * If the string does not contain a valid range, null is returned. + * For example str='0:2:11'. + * @param {String} str + * @return {Object | null} range Object containing properties start, end, step + * @private + */ + function _parse (str) { + var args = str.split(':'), + nums = null; + + if (config.number === 'bignumber') { + // bignumber + try { + nums = args.map(function (arg) { + return new BigNumber(arg); + }); + } + catch (err) { + return null; + } + } + else { + // number + nums = args.map(function (arg) { + // use Number and not parseFloat as Number returns NaN on invalid garbage in the string + return Number(arg); + }); + + var invalid = nums.some(function (num) { + return isNaN(num); + }); + if(invalid) { + return null; + } + } + + switch (nums.length) { + case 2: + return { + start: nums[0], + end: nums[1], + step: 1 + }; + + case 3: + return { + start: nums[0], + end: nums[2], + step: nums[1] + }; + + default: + return null; + } + } + + }; /***/ }, /* 99 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - Matrix = __webpack_require__(7), - - array = util.array, - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit; - - /** - * Calculate the size of a matrix or scalar. - * - * Syntax: - * - * math.size(x) - * - * Examples: - * - * math.size(2.3); // returns [] - * math.size('hello world'); // returns [11] - * - * var A = [[1, 2, 3], [4, 5, 6]]; - * math.size(A); // returns [2, 3] - * math.size(math.range(1,6)); // returns [5] - * - * See also: - * - * resize, squeeze, subset - * - * @param {Boolean | Number | Complex | Unit | String | Array | Matrix} x A matrix - * @return {Array | Matrix} A vector with size of `x`. - */ - math.size = function size (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('size', arguments.length, 1); - } - - var asArray = (config.matrix === 'array'); - - if (isNumber(x) || isComplex(x) || isUnit(x) || isBoolean(x) || - x == null || x instanceof BigNumber) { - return asArray ? [] : new Matrix([]); - } - - if (isString(x)) { - return asArray ? [x.length] : new Matrix([x.length]); - } - - if (Array.isArray(x)) { - return array.size(x); - } - - if (x instanceof Matrix) { - return new Matrix(x.size()); - } - - throw new math.error.UnsupportedTypeError('size', math['typeof'](x)); - }; - }; + 'use strict'; + + module.exports = function (math, config) { + var util = __webpack_require__(171), + + BigNumber = math.type.BigNumber, + Matrix = math.type.Matrix, + + array = util.array, + clone = util.object.clone, + string = util.string, + isString = util.string.isString, + isNumber = util.number.isNumber, + isInteger = util.number.isInteger, + isArray = array.isArray; + + /** + * Resize a matrix + * + * Syntax: + * + * math.resize(x, size) + * math.resize(x, size, defaultValue) + * + * Examples: + * + * math.resize([1, 2, 3, 4, 5], [3]); // returns Array [1, 2, 3] + * math.resize([1, 2, 3], [5], 0); // returns Array [1, 2, 3, 0, 0] + * math.resize(2, [2, 3], 0); // returns Matrix [[2, 0, 0], [0, 0, 0]] + * math.resize("hello", [8], "!"); // returns String 'hello!!!' + * + * See also: + * + * size, squeeze, subset + * + * @param {Array | Matrix | *} x Matrix to be resized + * @param {Array | Matrix} size One dimensional array with numbers + * @param {Number | String} [defaultValue=0] Zero by default, except in + * case of a string, in that case + * defaultValue = ' ' + * @return {* | Array | Matrix} A resized clone of matrix `x` + */ + math.resize = function resize (x, size, defaultValue) { + if (arguments.length != 2 && arguments.length != 3) { + throw new math.error.ArgumentsError('resize', arguments.length, 2, 3); + } + + if (size instanceof Matrix) { + size = size.valueOf(); // get Array + } + + if (size.length && size[0] instanceof BigNumber) { + // convert bignumbers to numbers + size = size.map(function (value) { + return (value instanceof BigNumber) ? value.toNumber() : value; + }); + } + + // check x is a Matrix + if (x instanceof Matrix) { + // use optimized matrix implementation, return copy + return x.resize(size, defaultValue, true); + } + + if (isString(x)) { + // resize string + return _resizeString(x, size, defaultValue); + } + + // check result should be a matrix + var asMatrix = isArray(x) ? false : (config.matrix !== 'array'); + + if (size.length == 0) { + // output a scalar + while (isArray(x)) { + x = x[0]; + } + + return clone(x); + } + else { + // output an array/matrix + if (!isArray(x)) { + x = [x]; + } + x = clone(x); + + var res = array.resize(x, size, defaultValue); + return asMatrix ? math.matrix(res) : res; + } + }; + + /** + * Resize a string + * @param {String} str + * @param {Number[]} size + * @param {string} [defaultChar=' '] + * @private + */ + function _resizeString(str, size, defaultChar) { + if (defaultChar !== undefined) { + if (!isString(defaultChar) || defaultChar.length !== 1) { + throw new TypeError('Single character expected as defaultValue'); + } + } + else { + defaultChar = ' '; + } + + if (size.length !== 1) { + throw new math.error.DimensionError(size.length, 1); + } + var len = size[0]; + if (!isNumber(len) || !isInteger(len)) { + throw new TypeError('Invalid size, must contain positive integers ' + + '(size: ' + string.format(size) + ')'); + } + + if (str.length > len) { + return str.substring(0, len); + } + else if (str.length < len) { + var res = str; + for (var i = 0, ii = len - str.length; i < ii; i++) { + res += defaultChar; + } + return res; + } + else { + return str; + } + } + }; /***/ }, /* 100 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - - object = util.object, - array = util.array, - isArray = Array.isArray; - - /** - * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix. - * - * Syntax: - * - * math.squeeze(x) - * - * Examples: - * - * math.squeeze([3]); // returns 3 - * math.squeeze([[3]]); // returns 3 - * - * var A = math.zeros(3, 1); // returns [[0], [0], [0]] (size 3x1) - * math.squeeze(A); // returns [0, 0, 0] (size 3) - * - * var B = math.zeros(1, 3); // returns [[0, 0, 0]] (size 1x3) - * math.squeeze(B); // returns [0, 0, 0] (size 3) - * - * // only inner and outer dimensions are removed - * var C = math.zeros(2, 1, 3); // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3) - * math.squeeze(C); // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3) - * - * See also: - * - * subset - * - * @param {Matrix | Array} x Matrix to be squeezed - * @return {Matrix | Array} Squeezed matrix - */ - math.squeeze = function squeeze (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('squeeze', arguments.length, 1); - } - - if (isArray(x)) { - return array.squeeze(object.clone(x)); - } - else if (x instanceof Matrix) { - var res = array.squeeze(x.toArray()); - return isArray(res) ? new Matrix(res) : res; - } - else { - // scalar - return object.clone(x); - } - }; - }; + 'use strict'; + + var array = __webpack_require__(172); + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + + /** + * Calculate the size of a matrix or scalar. + * + * Syntax: + * + * math.size(x) + * + * Examples: + * + * math.size(2.3); // returns [] + * math.size('hello world'); // returns [11] + * + * var A = [[1, 2, 3], [4, 5, 6]]; + * math.size(A); // returns [2, 3] + * math.size(math.range(1,6)); // returns [5] + * + * See also: + * + * resize, squeeze, subset + * + * @param {Boolean | Number | Complex | Unit | String | Array | Matrix} x A matrix + * @return {Array | Matrix} A vector with size of `x`. + */ + return typed('size', { + 'Matrix': function (x) { + // TODO: return the same matrix type as the input + return matrix(x.size()); + }, + + 'Array': array.size, + + 'string': function (x) { + return (config.matrix === 'array') ? [x.length] : matrix([x.length]); + }, + + 'number | Complex | BigNumber | Unit | boolean | null': function (x) { + // scalar + return (config.matrix === 'array') ? [] : matrix([]); + } + }); + } + + exports.name = 'size'; + exports.factory = factory; /***/ }, /* 101 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - Index = __webpack_require__(6), - - array = util.array, - isString = util.string.isString, - isArray = Array.isArray; - - /** - * Get or set a subset of a matrix or string. - * - * Syntax: - * math.subset(value, index) // retrieve a subset - * math.subset(value, index, replacement [, defaultValue]) // replace a subset - * - * Examples: - * - * // get a subset - * var d = [[1, 2], [3, 4]]; - * math.subset(d, math.index(1, 0)); // returns 3 - * math.subset(d, math.index([0, 2], 1)); // returns [[2], [4]] - * - * // replace a subset - * var e = []; - * var f = math.subset(e, math.index(0, [0, 2]), [5, 6]); // f = [[5, 6]] - * var g = math.subset(f, math.index(1, 1), 7, 0); // g = [[5, 6], [0, 7]] - * - * See also: - * - * size, resize, squeeze, index - * - * @param {Array | Matrix | String} matrix An array, matrix, or string - * @param {Index} index An index containing ranges for each - * dimension - * @param {*} [replacement] An array, matrix, or scalar. - * If provided, the subset is replaced with replacement. - * If not provided, the subset is returned - * @param {*} [defaultValue=undefined] Default value, filled in on new entries when - * the matrix is resized. If not provided, - * new matrix elements will be left undefined. - * @return {Array | Matrix | String} Either the retrieved subset or the updated matrix. - */ - math.subset = function subset (matrix, index, replacement, defaultValue) { - switch (arguments.length) { - case 2: // get subset - return _getSubset(arguments[0], arguments[1]); - - // intentional fall through - case 3: // set subset - case 4: // set subset with default value - return _setSubset(arguments[0], arguments[1], arguments[2], arguments[3]); - - default: // wrong number of arguments - throw new math.error.ArgumentsError('subset', arguments.length, 2, 4); - } - }; - - /** - * Retrieve a subset of an value such as an Array, Matrix, or String - * @param {Array | Matrix | String} value Object from which to get a subset - * @param {Index} index An index containing ranges for each - * dimension - * @returns {Array | Matrix | *} subset - * @private - */ - function _getSubset(value, index) { - var m, subset; - - if (isArray(value)) { - m = new Matrix(value); - subset = m.subset(index); // returns a Matrix - return subset && subset.valueOf(); // return an Array (like the input) - } - else if (value instanceof Matrix) { - return value.subset(index); - } - else if (isString(value)) { - return _getSubstring(value, index); - } - else { - throw new math.error.UnsupportedTypeError('subset', math['typeof'](value)); - } - } - - /** - * Retrieve a subset of a string - * @param {String} str String from which to get a substring - * @param {Index} index An index containing ranges for each dimension - * @returns {string} substring - * @private - */ - function _getSubstring(str, index) { - if (!(index instanceof Index)) { - // TODO: better error message - throw new TypeError('Index expected'); - } - if (index.size().length != 1) { - throw new math.error.DimensionError(index.size().length, 1); - } - - // validate whether the range is out of range - var strLen = str.length; - array.validateIndex(index.min()[0], strLen); - array.validateIndex(index.max()[0], strLen); - - var range = index.range(0); - - var substr = ''; - range.forEach(function (v) { - substr += str.charAt(v); - }); - - return substr; - } - - /** - * Replace a subset in an value such as an Array, Matrix, or String - * @param {Array | Matrix | String} value Object to be replaced - * @param {Index} index An index containing ranges for each - * dimension - * @param {Array | Matrix | *} replacement - * @param {*} [defaultValue=0] Default value, filled in on new entries when - * the matrix is resized. If not provided, - * new matrix elements will be filled with zeros. - * @returns {*} result - * @private - */ - function _setSubset(value, index, replacement, defaultValue) { - var m; - - if (isArray(value)) { - m = new Matrix(math.clone(value)); - m.subset(index, replacement, defaultValue); - return m.valueOf(); - } - else if (value instanceof Matrix) { - return value.clone().subset(index, replacement, defaultValue); - } - else if (isString(value)) { - return _setSubstring(value, index, replacement, defaultValue); - } - else { - throw new math.error.UnsupportedTypeError('subset', math['typeof'](value)); - } - } - - /** - * Replace a substring in a string - * @param {String} str String to be replaced - * @param {Index} index An index containing ranges for each dimension - * @param {String} replacement Replacement string - * @param {String} [defaultValue] Default value to be uses when resizing - * the string. is ' ' by default - * @returns {string} result - * @private - */ - function _setSubstring(str, index, replacement, defaultValue) { - if (!(index instanceof Index)) { - // TODO: better error message - throw new TypeError('Index expected'); - } - if (index.size().length != 1) { - throw new math.error.DimensionError(index.size().length, 1); - } - if (defaultValue !== undefined) { - if (!isString(defaultValue) || defaultValue.length !== 1) { - throw new TypeError('Single character expected as defaultValue'); - } - } - else { - defaultValue = ' '; - } - - var range = index.range(0); - var len = range.size()[0]; - - if (len != replacement.length) { - throw new math.error.DimensionError(range.size()[0], replacement.length); - } - - // validate whether the range is out of range - var strLen = str.length; - array.validateIndex(index.min()[0]); - array.validateIndex(index.max()[0]); - - // copy the string into an array with characters - var chars = []; - for (var i = 0; i < strLen; i++) { - chars[i] = str.charAt(i); - } - - range.forEach(function (v, i) { - chars[v] = replacement.charAt(i); - }); - - // initialize undefined characters with a space - if (chars.length > strLen) { - for (i = strLen - 1, len = chars.length; i < len; i++) { - if (!chars[i]) { - chars[i] = defaultValue; - } - } - } - - return chars.join(''); - } - }; + 'use strict'; + + var object = __webpack_require__(166); + var array = __webpack_require__(172); + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + + /** + * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix. + * + * Syntax: + * + * math.squeeze(x) + * + * Examples: + * + * math.squeeze([3]); // returns 3 + * math.squeeze([[3]]); // returns 3 + * + * var A = math.zeros(3, 1); // returns [[0], [0], [0]] (size 3x1) + * math.squeeze(A); // returns [0, 0, 0] (size 3) + * + * var B = math.zeros(1, 3); // returns [[0, 0, 0]] (size 1x3) + * math.squeeze(B); // returns [0, 0, 0] (size 3) + * + * // only inner and outer dimensions are removed + * var C = math.zeros(2, 1, 3); // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3) + * math.squeeze(C); // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3) + * + * See also: + * + * subset + * + * @param {Matrix | Array} x Matrix to be squeezed + * @return {Matrix | Array} Squeezed matrix + */ + return typed('squeeze', { + 'Array': function (x) { + return array.squeeze(object.clone(x)); + }, + + 'Matrix': function (x) { + var res = array.squeeze(x.toArray()); + // FIXME: return the same type of matrix as the input + return Array.isArray(res) ? matrix(res) : res; + }, + + 'any': function (x) { + // scalar + return object.clone(x); + } + }); + } + + exports.name = 'squeeze'; + exports.factory = factory; /***/ }, /* 102 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - - object = util.object, - string = util.string; - - /** - * Calculate the trace of a matrix: the sum of the elements on the main - * diagonal of a square matrix. - * - * Syntax: - * - * math.trace(x) - * - * Examples: - * - * math.trace([[1, 2], [3, 4]]); // returns 5 - * - * var A = [ - * [1, 2, 3], - * [-1, 2, 3], - * [2, 0, 3] - * ] - * math.trace(A); // returns 6 - * - * See also: - * - * diag - * - * @param {Array | Matrix} x A matrix - * @return {Number} The trace of `x` - */ - math.trace = function trace (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('trace', arguments.length, 1); - } - - var size; - if (x instanceof Matrix) { - size = x.size(); - } - else if (x instanceof Array) { - x = new Matrix(x); - size = x.size(); - } - else { - // a scalar - size = []; - } - - switch (size.length) { - case 0: - // scalar - return object.clone(x); - - case 1: - // vector - if (size[0] == 1) { - return object.clone(x.valueOf()[0]); - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + string.format(size) + ')'); - } - - case 2: - // two dimensional array - var rows = size[0]; - var cols = size[1]; - if (rows == cols) { - return _trace(x.clone().valueOf()); - } - else { - throw new RangeError('Matrix must be square ' + - '(size: ' + string.format(size) + ')'); - } - - default: - // multi dimensional array - throw new RangeError('Matrix must be two dimensional ' + - '(size: ' + string.format(size) + ')'); - } - }; - - /** - * Calculate the trace of a matrix - * @param {Array[]} matrix A square, two dimensional matrix - * @returns {Number} trace - * @private - */ - function _trace (matrix) { - var sum = 0; - for (var i = 0; i < matrix.length; i++) { - sum = math.add(sum, matrix[i][i]); - } - return sum; - } - }; + 'use strict'; + + module.exports = function (math, config) { + + var util = __webpack_require__(171), + + Matrix = math.type.Matrix, + Index = __webpack_require__(5), + + array = util.array, + isString = util.string.isString, + isArray = Array.isArray; + + /** + * Get or set a subset of a matrix or string. + * + * Syntax: + * math.subset(value, index) // retrieve a subset + * math.subset(value, index, replacement [, defaultValue]) // replace a subset + * + * Examples: + * + * // get a subset + * var d = [[1, 2], [3, 4]]; + * math.subset(d, math.index(1, 0)); // returns 3 + * math.subset(d, math.index([0, 2], 1)); // returns [[2], [4]] + * + * // replace a subset + * var e = []; + * var f = math.subset(e, math.index(0, [0, 2]), [5, 6]); // f = [[5, 6]] + * var g = math.subset(f, math.index(1, 1), 7, 0); // g = [[5, 6], [0, 7]] + * + * See also: + * + * size, resize, squeeze, index + * + * @param {Array | Matrix | String} matrix An array, matrix, or string + * @param {Index} index An index containing ranges for each + * dimension + * @param {*} [replacement] An array, matrix, or scalar. + * If provided, the subset is replaced with replacement. + * If not provided, the subset is returned + * @param {*} [defaultValue=undefined] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * math.matrix elements will be left undefined. + * @return {Array | Matrix | String} Either the retrieved subset or the updated matrix. + */ + math.subset = function subset (matrix, index, replacement, defaultValue) { + switch (arguments.length) { + case 2: // get subset + return _getSubset(arguments[0], arguments[1]); + + // intentional fall through + case 3: // set subset + case 4: // set subset with default value + return _setSubset(arguments[0], arguments[1], arguments[2], arguments[3]); + + default: // wrong number of arguments + throw new math.error.ArgumentsError('subset', arguments.length, 2, 4); + } + }; + + /** + * Retrieve a subset of an value such as an Array, Matrix, or String + * @param {Array | Matrix | String} value Object from which to get a subset + * @param {Index} index An index containing ranges for each + * dimension + * @returns {Array | Matrix | *} subset + * @private + */ + function _getSubset(value, index) { + var m, subset; + + if (isArray(value)) { + m = math.matrix(value); + subset = m.subset(index); // returns a Matrix + return subset && subset.valueOf(); // return an Array (like the input) + } + else if (value instanceof Matrix) { + return value.subset(index); + } + else if (isString(value)) { + return _getSubstring(value, index); + } + else { + throw new math.error.UnsupportedTypeError('subset', math['typeof'](value)); + } + } + + /** + * Retrieve a subset of a string + * @param {String} str String from which to get a substring + * @param {Index} index An index containing ranges for each dimension + * @returns {string} substring + * @private + */ + function _getSubstring(str, index) { + if (!(index instanceof Index)) { + // TODO: better error message + throw new TypeError('Index expected'); + } + if (index.size().length != 1) { + throw new math.error.DimensionError(index.size().length, 1); + } + + // validate whether the range is out of range + var strLen = str.length; + array.validateIndex(index.min()[0], strLen); + array.validateIndex(index.max()[0], strLen); + + var range = index.range(0); + + var substr = ''; + range.forEach(function (v) { + substr += str.charAt(v); + }); + + return substr; + } + + /** + * Replace a subset in an value such as an Array, Matrix, or String + * @param {Array | Matrix | String} value Object to be replaced + * @param {Index} index An index containing ranges for each + * dimension + * @param {Array | Matrix | *} replacement + * @param {*} [defaultValue=0] Default value, filled in on new entries when + * the matrix is resized. If not provided, + * math.matrix elements will be filled with zeros. + * @returns {*} result + * @private + */ + function _setSubset(value, index, replacement, defaultValue) { + var m; + + if (isArray(value)) { + m = math.matrix(math.clone(value)); + m.subset(index, replacement, defaultValue); + return m.valueOf(); + } + else if (value instanceof Matrix) { + return value.clone().subset(index, replacement, defaultValue); + } + else if (isString(value)) { + return _setSubstring(value, index, replacement, defaultValue); + } + else { + throw new math.error.UnsupportedTypeError('subset', math['typeof'](value)); + } + } + + /** + * Replace a substring in a string + * @param {String} str String to be replaced + * @param {Index} index An index containing ranges for each dimension + * @param {String} replacement Replacement string + * @param {String} [defaultValue] Default value to be uses when resizing + * the string. is ' ' by default + * @returns {string} result + * @private + */ + function _setSubstring(str, index, replacement, defaultValue) { + if (!(index instanceof Index)) { + // TODO: better error message + throw new TypeError('Index expected'); + } + if (index.size().length != 1) { + throw new math.error.DimensionError(index.size().length, 1); + } + if (defaultValue !== undefined) { + if (!isString(defaultValue) || defaultValue.length !== 1) { + throw new TypeError('Single character expected as defaultValue'); + } + } + else { + defaultValue = ' '; + } + + var range = index.range(0); + var len = range.size()[0]; + + if (len != replacement.length) { + throw new math.error.DimensionError(range.size()[0], replacement.length); + } + + // validate whether the range is out of range + var strLen = str.length; + array.validateIndex(index.min()[0]); + array.validateIndex(index.max()[0]); + + // copy the string into an array with characters + var chars = []; + for (var i = 0; i < strLen; i++) { + chars[i] = str.charAt(i); + } + + range.forEach(function (v, i) { + chars[v] = replacement.charAt(i); + }); + + // initialize undefined characters with a space + if (chars.length > strLen) { + for (i = strLen - 1, len = chars.length; i < len; i++) { + if (!chars[i]) { + chars[i] = defaultValue; + } + } + } + + return chars.join(''); + } + }; /***/ }, /* 103 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Matrix = __webpack_require__(7), - - object = util.object, - string = util.string; - - /** - * Transpose a matrix. All values of the matrix are reflected over its - * main diagonal. Only two dimensional matrices are supported. - * - * Syntax: - * - * math.transpose(x) - * - * Examples: - * - * var A = [[1, 2, 3], [4, 5, 6]]; - * math.transpose(A); // returns [[1, 4], [2, 5], [3, 6]] - * - * See also: - * - * diag, inv, subset, squeeze - * - * @param {Array | Matrix} x Matrix to be transposed - * @return {Array | Matrix} The transposed matrix - */ - math.transpose = function transpose (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('transpose', arguments.length, 1); - } - - var size = math.size(x).valueOf(); - switch (size.length) { - case 0: - // scalar - return object.clone(x); - - case 1: - // vector - return object.clone(x); - - case 2: - // two dimensional array - var rows = size[1], - cols = size[0], - asMatrix = (x instanceof Matrix), - data = x.valueOf(), - transposed = [], - transposedRow, - clone = object.clone; - - if (rows === 0) { - // whoops - throw new RangeError('Cannot transpose a 2D matrix with no rows' + - '(size: ' + string.format(size) + ')'); - } - - for (var r = 0; r < rows; r++) { - transposedRow = transposed[r] = []; - for (var c = 0; c < cols; c++) { - transposedRow[c] = clone(data[c][r]); - } - } - - return asMatrix ? new Matrix(transposed) : transposed; - - default: - // multi dimensional array - throw new RangeError('Matrix must be two dimensional ' + - '(size: ' + string.format(size) + ')'); - } - }; - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var format = __webpack_require__(176).format; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var add = load(__webpack_require__(32)); + + /** + * Calculate the trace of a matrix: the sum of the elements on the main + * diagonal of a square matrix. + * + * Syntax: + * + * math.trace(x) + * + * Examples: + * + * math.trace([[1, 2], [3, 4]]); // returns 5 + * + * var A = [ + * [1, 2, 3], + * [-1, 2, 3], + * [2, 0, 3] + * ] + * math.trace(A); // returns 6 + * + * See also: + * + * diag + * + * @param {Array | Matrix} x A matrix + * + * @return {Number} The trace of `x` + */ + var trace = typed('trace', { + + 'Array': function (x) { + // use dense matrix implementation + return trace(matrix(x)); + }, + + 'Matrix': function (x) { + // result + var c; + // process storage format + switch (x.storage()) { + case 'dense': + c = _denseTrace(x); + break; + case 'sparse': + c = _sparseTrace(x); + break; + } + return c; + }, + + 'any': clone + }); + + var _denseTrace = function (m) { + // matrix size & data + var size = m._size; + var data = m._data; + + // process dimensions + switch (size.length) { + case 1: + // vector + if (size[0] == 1) { + // return data[0] + return clone(data[0]); + } + throw new RangeError('Matrix must be square (size: ' + format(size) + ')'); + case 2: + // two dimensional + var rows = size[0]; + var cols = size[1]; + if (rows === cols) { + // calulate sum + var sum = 0; + // loop diagonal + for (var i = 0; i < rows; i++) + sum = add(sum, data[i][i]); + // return trace + return sum; + } + throw new RangeError('Matrix must be square (size: ' + format(size) + ')'); + default: + // multi dimensional + throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')'); + } + }; + + var _sparseTrace = function (m) { + // matrix arrays + var values = m._values; + var index = m._index; + var ptr = m._ptr; + var size = m._size; + // check dimensions + var rows = size[0]; + var columns = size[1]; + // matrix must be square + if (rows === columns) { + // calulate sum + var sum = 0; + // check we have data (avoid looping columns) + if (values.length > 0) { + // loop columns + for (var j = 0; j < columns; j++) { + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = ptr[j]; + var k1 = ptr[j + 1]; + // loop k within [k0, k1[ + for (var k = k0; k < k1; k++) { + // row index + var i = index[k]; + // check row + if (i === j) { + // accumulate value + sum = add(sum, values[k]); + // exit loop + break; + } + if (i > j) { + // exit loop, no value on the diagonal for column j + break; + } + } + } + } + // return trace + return sum; + } + throw new RangeError('Matrix must be square (size: ' + format(size) + ')'); + }; + + return trace; + } + + exports.name = 'trace'; + exports.factory = factory; /***/ }, /* 104 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - array = util.array, - isArray = Array.isArray; - - /** - * Create a matrix filled with zeros. The created matrix can have one or - * multiple dimensions. - * - * Syntax: - * - * math.zeros(m) - * math.zeros(m, n) - * math.zeros([m, n]) - * math.zeros([m, n, p, ...]) - * - * Examples: - * - * math.zeros(3); // returns [0, 0, 0] - * math.zeros(3, 2); // returns [[0, 0], [0, 0], [0, 0]] - * - * var A = [[1, 2, 3], [4, 5, 6]]; - * math.zeros(math.size(A)); // returns [[0, 0, 0], [0, 0, 0]] - * - * See also: - * - * ones, eye, size, range - * - * @param {...Number | Array} size The size of each dimension of the matrix - * @return {Array | Matrix | Number} A matrix filled with zeros - */ - math.zeros = function zeros (size) { - var args = collection.argsToArray(arguments); - var asMatrix = (size instanceof Matrix) ? true : - (isArray(size) ? false : (config.matrix === 'matrix')); - - if (args.length == 0) { - // output an empty matrix - return asMatrix ? new Matrix() : []; - } - else { - // output an array or matrix - - // convert arguments from bignumber to numbers if needed - var asBigNumber = false; - args = args.map(function (value) { - if (value instanceof BigNumber) { - asBigNumber = true; - return value.toNumber(); - } else { - return value; - } - }); - - // resize the matrix - var res = []; - var defaultValue = asBigNumber ? new BigNumber(0) : 0; - res = array.resize(res, args, defaultValue); - - return asMatrix ? new Matrix(res) : res; - } - }; - }; + 'use strict'; + + var clone = __webpack_require__(166).clone; + var format = __webpack_require__(176).format; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + + var DenseMatrix = type.DenseMatrix, + SparseMatrix = type.SparseMatrix; + + /** + * Transpose a matrix. All values of the matrix are reflected over its + * main diagonal. Only two dimensional matrices are supported. + * + * Syntax: + * + * math.transpose(x) + * + * Examples: + * + * var A = [[1, 2, 3], [4, 5, 6]]; + * math.transpose(A); // returns [[1, 4], [2, 5], [3, 6]] + * + * See also: + * + * diag, inv, subset, squeeze + * + * @param {Array | Matrix} x Matrix to be transposed + * @return {Array | Matrix} The transposed matrix + */ + var transpose = typed('transpose', { + + 'Array': function (x) { + // use dense matrix implementation + return transpose(matrix(x)).valueOf(); + }, + + 'Matrix': function (x) { + // matrix size + var size = x.size(); + + // result + var c; + + // process dimensions + switch (size.length) { + case 1: + // vector + c = x.clone(); + break; + + case 2: + // rows and columns + var rows = size[0]; + var columns = size[1]; + + // check columns + if (columns === 0) { + // throw exception + throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')'); + } + + // process storage format + switch (x.storage()) { + case 'dense': + c = _denseTranspose(x, rows, columns); + break; + case 'sparse': + c = _sparseTranspose(x, rows, columns); + break; + } + break; + + default: + // multi dimensional + throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(this._size) + ')'); + } + return c; + }, + + // scalars + 'any': function (x) { + return clone(x); + } + }); + + var _denseTranspose = function (m, rows, columns) { + // matrix array + var data = m._data; + // transposed matrix data + var transposed = []; + var transposedRow; + // loop columns + for (var j = 0; j < columns; j++) { + // initialize row + transposedRow = transposed[j] = []; + // loop rows + for (var i = 0; i < rows; i++) { + // set data + transposedRow[i] = clone(data[i][j]); + } + } + // return matrix + return new DenseMatrix({ + data: transposed, + size: [columns, rows] + }); + }; + + var _sparseTranspose = function (m, rows, columns) { + // matrix arrays + var values = m._values; + var index = m._index; + var ptr = m._ptr; + // result matrices + var cvalues = []; + var cindex = []; + var cptr = []; + // row counts + var w = new Array(rows); + for (var x = 0; x < rows; x++) + w[x] = 0; + // vars + var p, l, j; + // loop values in matrix + for (p = 0, l = index.length; p < l; p++) { + // number of values in row + w[index[p]]++; + } + // cumulative sum + var sum = 0; + // initialize cptr with the cummulative sum of row counts + for (var i = 0; i < rows; i++) { + // update cptr + cptr.push(sum); + // update sum + sum += w[i]; + // update w + w[i] = cptr[i]; + } + // update cptr + cptr.push(sum); + // loop columns + for (j = 0; j < columns; j++) { + // values & index in column + for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) { + // C values & index + var q = w[index[k]]++; + // C[j, i] = A[i, j] + cindex[q] = j; + cvalues[q] = clone(values[k]); + } + } + // return matrix + return new SparseMatrix({ + values: cvalues, + index: cindex, + ptr: cptr, + size: [columns, rows] + }); + }; + + return transpose; + } + + exports.name = 'transpose'; + exports.factory = factory; /***/ }, /* 105 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isInteger = util.number.isInteger, - isCollection = collection.isCollection; - - /** - * Compute the factorial of a value - * - * Factorial only supports an integer value as argument. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.factorial(n) - * - * Examples: - * - * math.factorial(5); // returns 120 - * math.factorial(3); // returns 6 - * - * See also: - * - * combinations, gamma, permutations - * - * @param {Number | BigNumber | Array | Matrix | Boolean | null} n An integer number - * @return {Number | BigNumber | Array | Matrix} The factorial of `n` - */ - math.factorial = function factorial (n) { - var value, res, preciseFacs; - - if (arguments.length != 1) { - throw new math.error.ArgumentsError('factorial', arguments.length, 1); - } - - if (isNumber(n)) { - return n !== Number.POSITIVE_INFINITY - ? math.gamma(n + 1) - : Math.sqrt(2*Math.PI); - } - - if (n instanceof BigNumber) { - if (!(isNonNegativeInteger(n))) { - return n.isNegative() || n.isFinite() - ? math.gamma(n.plus(1)) - : util.bignumber.tau(config.precision).sqrt(); - } - - n = n.toNumber(); // should definitely be below Number.MAX_VALUE - if (n < smallBigFacs.length) { - return BigNumber.convert(smallBigFacs[n]).toSD(config.precision); - } - - // be wary of round-off errors - var precision = config.precision + (Math.log(n) | 0); - var Big = BigNumber.constructor({precision: precision}); - - // adjust n do align with the precision specific tables - n -= smallBigFacs.length; - if (preciseFacs = bigBigFacs[precision]) { - if (preciseFacs[n]) { - return new BigNumber(preciseFacs[n].toPrecision(config.precision)); - } - res = preciseFacs[preciseFacs.length-1]; - } else { - preciseFacs = bigBigFacs[precision] = []; - res = new Big(smallBigFacs[smallBigFacs.length-1]) - .toSD(precision); - } - - var one = new Big(1); - value = new Big(preciseFacs.length + smallBigFacs.length); - for (var i = preciseFacs.length; i < n; ++i) { - preciseFacs[i] = res = res.times(value); - value = value.plus(one); - } - - preciseFacs[n] = res.times(value); - return new BigNumber(preciseFacs[n].toPrecision(config.precision)); - } - - if (isBoolean(n) || n === null) { - return 1; // factorial(1) = 1, factorial(0) = 1 - } - - if (isCollection(n)) { - return collection.deepMap(n, factorial); - } - - throw new math.error.UnsupportedTypeError('factorial', math['typeof'](n)); - }; - - /** - * Test whether BigNumber n is a non-negative integer - * @param {BigNumber} n - * @returns {boolean} isNonNegativeInteger - */ - var isNonNegativeInteger = function(n) { - return n.isInteger() && (!n.isNegative() || n.isZero()); - }; - - // 21! >= values for each precision - var bigBigFacs = []; - - // 0-20! values - var smallBigFacs = [ - 1, - 1, - 2, - 6, - 24, - 120, - 720, - 5040, - 40320, - 362880, - 3628800, - 39916800, - 479001600, - 6227020800, - 87178291200, - 1307674368000, - 20922789888000, - 355687428096000, - 6402373705728000, - 121645100408832000, - 2432902008176640000 - ] - }; + 'use strict'; + + module.exports = function (math, config) { + var util = __webpack_require__(171), + + BigNumber = math.type.BigNumber, + Matrix = math.type.Matrix, + collection = math.collection, + + array = util.array, + isNumber = util.number.isNumber, + isInteger = util.number.isInteger, + isString = util.string.isString, + isArray = Array.isArray; + + /** + * Create a matrix filled with zeros. The created matrix can have one or + * multiple dimensions. + * + * Syntax: + * + * math.zeros(m) + * math.zeros(m, format) + * math.zeros(m, n) + * math.zeros(m, n, format) + * math.zeros([m, n]) + * math.zeros([m, n], format) + * + * Examples: + * + * math.zeros(3); // returns [0, 0, 0] + * math.zeros(3, 2); // returns [[0, 0], [0, 0], [0, 0]] + * math.zeros(3, 'dense'); // returns [0, 0, 0] + * + * var A = [[1, 2, 3], [4, 5, 6]]; + * math.zeros(math.size(A)); // returns [[0, 0, 0], [0, 0, 0]] + * + * See also: + * + * ones, eye, size, range + * + * @param {...Number | Array} size The size of each dimension of the matrix + * @param {string} [format] The Matrix storage format + * + * @return {Array | Matrix} A matrix filled with zeros + */ + math.zeros = function zeros (size) { + // process arguments + var args = collection.argsToArray(arguments); + // matrix storage format + var f; + // check format was provided + if (args.length > 0 && isString(args[args.length - 1])) { + // set format + f = args[args.length - 1]; + // re-process arguments, ignore last one + args = collection.argsToArray(args.slice(0, args.length - 1)); + } + else if (size instanceof Matrix) { + // use matrix format + f = size.storage(); + } + else if (!isArray(size) && config.matrix === 'matrix') { + // use default matrix format + f = 'default'; + } + + // convert arguments from bignumber to numbers if needed + var asBigNumber = false; + // map arguments & validate + args = args.map(function (value) { + // check it is a big number + if (value instanceof BigNumber) { + // set flag + asBigNumber = true; + // convert it + value = value.toNumber(); + } + // validate arguments + if (!isNumber(value) || !isInteger(value) || value < 0) { + throw new Error('Parameters in function eye must be positive integers'); + } + return value; + }); + + // default value + var defaultValue = asBigNumber ? new BigNumber(0) : 0; + + // check we need to return a matrix + if (f) { + // create empty matrix + var m = math.matrix(f); + // check we need to resize matrix + if (args.length > 0) { + // resize it to correct size + return m.resize(args, defaultValue); + } + return m; + } + // empty array + var res = []; + // check we need to resize array + if (args.length > 0) { + // resize array + return array.resize(res, args, defaultValue); + } + return res; + }; + }; /***/ }, /* 106 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isNumber = util.number.isNumber, - isInteger = util.number.isInteger, - isCollection = collection.isCollection; - - /** - * Compute the gamma function of a value using Lanczos approximation for - * small values, and an extended Stirling approximation for large values. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.gamma(n) - * - * Examples: - * - * math.gamma(5); // returns 24 - * math.gamma(-0.5); // returns -3.5449077018110335 - * math.gamma(math.i); // returns -0.15494982830180973 - 0.49801566811835596i - * - * See also: - * - * combinations, factorial, permutations - * - * @param {Number | Array | Matrix | Boolean | null} n An integer number - * @return {Number | Array | Matrix} The gamma of `n` - */ - math.gamma = function gamma (n) { - var t, x; - var g = 4.7421875; - - if (arguments.length != 1) { - throw new math.error.ArgumentsError('gamma', arguments.length, 1); - } - - if (isNumber(n)) { - if (isInteger(n)) { - if (n <= 0) { - return isFinite(n) - ? Infinity - : NaN; - } - - if (n > 171) { - return Infinity; // Will overflow - } - - var value = n - 2; - var res = n - 1; - while (value > 1) { - res *= value; - value--; - } - - if (res == 0) { - res = 1; // 0! is per definition 1 - } - - return res; - } - - if (n < 0.5) { - return Math.PI / (Math.sin(Math.PI*n) * gamma(1-n)); - } - - if (n >= 171.35) { - return Infinity; // will overflow - } - - if (n > 85.0) { // Extended Stirling Approx - var twoN = n*n; - var threeN = twoN*n; - var fourN = threeN*n; - var fiveN = fourN*n; - return Math.sqrt(2*Math.PI/n) * Math.pow((n/Math.E), n) * - (1 + 1/(12*n) + 1/(288*twoN) - 139/(51840*threeN) - - 571/(2488320*fourN) + 163879/(209018880*fiveN) + - 5246819/(75246796800*fiveN*n)); - } - - --n; - x = p[0]; - for (var i = 1; i < p.length; ++i) { - x += p[i] / (n+i); - } - - t = n + g + 0.5; - return Math.sqrt(2*Math.PI) * Math.pow(t, n+0.5) * Math.exp(-t) * x; - } - - if (isComplex(n)) { - if (n.im == 0) { - return gamma(n.re); - } - - n = new Complex(n.re - 1, n.im); - x = new Complex(p[0], 0); - for (var i = 1; i < p.length; ++i) { - var real = n.re + i; // x += p[i]/(n+i) - var den = real*real + n.im*n.im; - if (den != 0) { - x.re += p[i] * real / den; - x.im += -(p[i] * n.im) / den; - } else { - x.re = p[i] < 0 - ? -Infinity - : Infinity; - } - } - - t = new Complex(n.re + g + 0.5, n.im); - var twoPiSqrt = Math.sqrt(2*Math.PI); - - n.re += 0.5; - var result = math.pow(t, n); - if (result.im == 0) { // sqrt(2*PI)*result - result.re *= twoPiSqrt; - } else if (result.re == 0) { - result.im *= twoPiSqrt; - } else { - result.re *= twoPiSqrt; - result.im *= twoPiSqrt; - } - - var r = Math.exp(-t.re); // exp(-t) - t.re = r * Math.cos(-t.im); - t.im = r * Math.sin(-t.im); - - return math.multiply(math.multiply(result, t), x); - } - - if (n instanceof BigNumber) { - if (n.isInteger()) { - return n.isNegative() || n.isZero() - ? new BigNumber(Infinity) - : math.factorial(n.minus(1)); - } - - if (!n.isFinite()) { - return new BigNumber(n.isNegative() - ? NaN - : Infinity); - } - } - - if (isBoolean(n) || n === null) { - return n - ? 1 - : Infinity; - } - - if (isCollection(n)) { - return collection.deepMap(n, gamma); - } - - throw new math.error.UnsupportedTypeError('gamma', math['typeof'](n)); - }; - - var p = [ - 0.99999999999999709182, - 57.156235665862923517, - -59.597960355475491248, - 14.136097974741747174, - -0.49191381609762019978, - 0.33994649984811888699e-4, - 0.46523628927048575665e-4, - -0.98374475304879564677e-4, - 0.15808870322491248884e-3, - -0.21026444172410488319e-3, - 0.21743961811521264320e-3, - -0.16431810653676389022e-3, - 0.84418223983852743293e-4, - -0.26190838401581408670e-4, - 0.36899182659531622704e-5 - ]; - - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + /** + * Compute the number of ways of picking `k` unordered outcomes from `n` + * possibilities. + * + * Combinations only takes integer arguments. + * The following condition must be enforced: k <= n. + * + * Syntax: + * + * math.combinations(n, k) + * + * Examples: + * + * math.combinations(7, 5); // returns 21 + * + * See also: + * + * permutations, factorial + * + * @param {Number | BigNumber} n Total number of objects in the set + * @param {Number | BigNumber} k Number of objects in the subset + * @return {Number | BigNumber} Number of possible combinations. + */ + return typed('combinations', { + 'number, number': function (n, k) { + var max, result, i; + + if (!isInteger(n) || n < 0) { + throw new TypeError('Positive integer value expected in function combinations'); + } + if (k > n) { + throw new TypeError('k must be less than or equal to n'); + } + + max = Math.max(k, n - k); + result = 1; + for (i = 1; i <= n - max; i++) { + result = result * (max + i) / i; + } + + return result; + }, + + 'BigNumber, BigNumber': function (n, k) { + var max, result, i, ii; + var one = new type.BigNumber(1); + + if (!isPositiveInteger(n) || !isPositiveInteger(k)) { + throw new TypeError('Positive integer value expected in function combinations'); + } + if (k.gt(n)) { + throw new TypeError('k must be less than n in function combinations'); + } + + max = n.minus(k); + if (k.lt(max)) max = k; + result = one; + for (i = one, ii = n.minus(max); i.lte(ii); i = i.plus(1)) { + result = result.times(max.plus(i)).dividedBy(i); + } + + return result; + } + + // TODO: implement support for collection in combinations + }); + } + + /** + * Test whether BigNumber n is a positive integer + * @param {BigNumber} n + * @returns {boolean} isPositiveInteger + */ + function isPositiveInteger(n) { + return n.isInteger() && n.gte(0); + } + + exports.name = 'combinations'; + exports.factory = factory; /***/ }, /* 107 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var distribution = __webpack_require__(334)(math); - - /** - * Return a random number larger or equal to `min` and smaller than `max` - * using a uniform distribution. - * - * Syntax: - * - * math.random() // generate a random number between 0 and 1 - * math.random(max) // generate a random number between 0 and max - * math.random(min, max) // generate a random number between min and max - * math.random(size) // generate a matrix with random numbers between 0 and 1 - * math.random(size, max) // generate a matrix with random numbers between 0 and max - * math.random(size, min, max) // generate a matrix with random numbers between min and max - * - * Examples: - * - * math.random(); // returns a random number between 0 and 1 - * math.random(100); // returns a random number between 0 and 100 - * math.random(30, 40); // returns a random number between 30 and 40 - * math.random([2, 3]); // returns a 2x3 matrix with random numbers between 0 and 1 - * - * See also: - * - * randomInt, pickRandom - * - * @param {Array | Matrix} [size] If provided, an array or matrix with given - * size and filled with random values is returned - * @param {Number} [min] Minimum boundary for the random value, included - * @param {Number} [max] Maximum boundary for the random value, excluded - * @return {Number | Array | Matrix} A random number - */ - math.random = distribution('uniform').random; - }; + 'use strict'; + + var bignumber = __webpack_require__(214); + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var gamma = load(__webpack_require__(108)); + + /** + * Compute the factorial of a value + * + * Factorial only supports an integer value as argument. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.factorial(n) + * + * Examples: + * + * math.factorial(5); // returns 120 + * math.factorial(3); // returns 6 + * + * See also: + * + * combinations, gamma, permutations + * + * @param {Number | BigNumber | Array | Matrix | Boolean | null} n An integer number + * @return {Number | BigNumber | Array | Matrix} The factorial of `n` + */ + var factorial = typed('factorial', { + 'number': function (n) { + if (n === Number.POSITIVE_INFINITY) { + return Math.sqrt(2 * Math.PI); + } + + return gamma(n + 1); + }, + + 'BigNumber': function (n) { + if (!n.isFinite() && !n.isNegative()) { + return bignumber.tau(config.precision).sqrt(); + } + + return gamma(n.plus(1)); + }, + + 'Array | Matrix': function (n) { + return collection.deepMap(n, factorial); + } + }); + + return factorial; + } + + exports.name = 'factorial'; + exports.factory = factory; /***/ }, /* 108 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var distribution = __webpack_require__(334)(math); - - /** - * Return a random integer number larger or equal to `min` and smaller than `max` - * using a uniform distribution. - * - * Syntax: - * - * math.randomInt() // generate a random integer between 0 and 1 - * math.randomInt(max) // generate a random integer between 0 and max - * math.randomInt(min, max) // generate a random integer between min and max - * math.randomInt(size) // generate a matrix with random integer between 0 and 1 - * math.randomInt(size, max) // generate a matrix with random integer between 0 and max - * math.randomInt(size, min, max) // generate a matrix with random integer between min and max - * - * Examples: - * - * math.randomInt(); // returns a random integer between 0 and 1 - * math.randomInt(100); // returns a random integer between 0 and 100 - * math.randomInt(30, 40); // returns a random integer between 30 and 40 - * math.randomInt([2, 3]); // returns a 2x3 matrix with random integers between 0 and 1 - * - * See also: - * - * random, pickRandom - * - * @param {Array | Matrix} [size] If provided, an array or matrix with given - * size and filled with random values is returned - * @param {Number} [min] Minimum boundary for the random value, included - * @param {Number} [max] Maximum boundary for the random value, excluded - * @return {Number | Array | Matrix} A random integer value - */ - math.randomInt = distribution('uniform').randomInt; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var multiply = load(__webpack_require__(47)); + var pow = load(__webpack_require__(50)); + + /** + * Compute the gamma function of a value using Lanczos approximation for + * small values, and an extended Stirling approximation for large values. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.gamma(n) + * + * Examples: + * + * math.gamma(5); // returns 24 + * math.gamma(-0.5); // returns -3.5449077018110335 + * math.gamma(math.i); // returns -0.15494982830180973 - 0.49801566811835596i + * + * See also: + * + * combinations, factorial, permutations + * + * @param {Number | Array | Matrix | Boolean | null} n A real or complex number + * @return {Number | Array | Matrix} The gamma of `n` + */ + var gamma = typed('gamma', { + 'number': function (n) { + var t, x; + + if (isInteger(n)) { + if (n <= 0) { + return isFinite(n) ? Infinity : NaN; + } + + if (n > 171) { + return Infinity; // Will overflow + } + + var value = n - 2; + var res = n - 1; + while (value > 1) { + res *= value; + value--; + } + + if (res == 0) { + res = 1; // 0! is per definition 1 + } + + return res; + } + + if (n < 0.5) { + return Math.PI / (Math.sin(Math.PI * n) * gamma(1-n)); + } + + if (n >= 171.35) { + return Infinity; // will overflow + } + + if (n > 85.0) { // Extended Stirling Approx + var twoN = n*n; + var threeN = twoN*n; + var fourN = threeN*n; + var fiveN = fourN*n; + return Math.sqrt(2*Math.PI/n) * Math.pow((n/Math.E), n) * + (1 + 1/(12*n) + 1/(288*twoN) - 139/(51840*threeN) - + 571/(2488320*fourN) + 163879/(209018880*fiveN) + + 5246819/(75246796800*fiveN*n)); + } + + --n; + x = p[0]; + for (var i = 1; i < p.length; ++i) { + x += p[i] / (n+i); + } + + t = n + g + 0.5; + return Math.sqrt(2*Math.PI) * Math.pow(t, n+0.5) * Math.exp(-t) * x; + }, + + 'Complex': function (n) { + var t, x; + + if (n.im == 0) { + return gamma(n.re); + } + + n = new type.Complex(n.re - 1, n.im); + x = new type.Complex(p[0], 0); + for (var i = 1; i < p.length; ++i) { + var real = n.re + i; // x += p[i]/(n+i) + var den = real*real + n.im*n.im; + if (den != 0) { + x.re += p[i] * real / den; + x.im += -(p[i] * n.im) / den; + } else { + x.re = p[i] < 0 + ? -Infinity + : Infinity; + } + } + + t = new type.Complex(n.re + g + 0.5, n.im); + var twoPiSqrt = Math.sqrt(2*Math.PI); + + n.re += 0.5; + var result = pow(t, n); + if (result.im == 0) { // sqrt(2*PI)*result + result.re *= twoPiSqrt; + } else if (result.re == 0) { + result.im *= twoPiSqrt; + } else { + result.re *= twoPiSqrt; + result.im *= twoPiSqrt; + } + + var r = Math.exp(-t.re); // exp(-t) + t.re = r * Math.cos(-t.im); + t.im = r * Math.sin(-t.im); + + return multiply(multiply(result, t), x); + }, + + 'BigNumber': function (n) { + if (n.isInteger()) { + return (n.isNegative() || n.isZero()) + ? new type.BigNumber(Infinity) + : bigFactorial(n.minus(1)); + } + + if (!n.isFinite()) { + return new type.BigNumber(n.isNegative() ? NaN : Infinity); + } + + throw new Error('Integer BigNumber expected'); + }, + + 'Array | Matrix': function (n) { + return collection.deepMap(n, gamma); + } + }); + + /** + * Calculate factorial for a BigNumber + * @param {BigNumber} n + * @returns {BigNumber} Returns the factorial of n + */ + function bigFactorial(n) { + var value, res, preciseFacs; + + var num = n.toNumber(); // should definitely be below Number.MAX_VALUE + if (num < smallBigFacs.length) { + return new type.BigNumber(smallBigFacs[num]).toSD(config.precision); + } + + // be wary of round-off errors + var precision = config.precision + (Math.log(num) | 0); + var Big = type.BigNumber.constructor({precision: precision}); + + // adjust n do align with the precision specific tables + num -= smallBigFacs.length; + if (preciseFacs = bigBigFacs[precision]) { + if (preciseFacs[num]) { + return new type.BigNumber(preciseFacs[num].toPrecision(config.precision)); + } + res = preciseFacs[preciseFacs.length-1]; + } else { + preciseFacs = bigBigFacs[precision] = []; + res = new Big(smallBigFacs[smallBigFacs.length-1]) + .toSD(precision); + } + + var one = new Big(1); + value = new Big(preciseFacs.length + smallBigFacs.length); + for (var i = preciseFacs.length; i < num; ++i) { + preciseFacs[i] = res = res.times(value); + value = value.plus(one); + } + + preciseFacs[num] = res.times(value); + return new type.BigNumber(preciseFacs[num].toPrecision(config.precision)); + } + + return gamma; + } + + // TODO: comment on the variables g and p + + var g = 4.7421875; + + var p = [ + 0.99999999999999709182, + 57.156235665862923517, + -59.597960355475491248, + 14.136097974741747174, + -0.49191381609762019978, + 0.33994649984811888699e-4, + 0.46523628927048575665e-4, + -0.98374475304879564677e-4, + 0.15808870322491248884e-3, + -0.21026444172410488319e-3, + 0.21743961811521264320e-3, + -0.16431810653676389022e-3, + 0.84418223983852743293e-4, + -0.26190838401581408670e-4, + 0.36899182659531622704e-5 + ]; + + // 21! >= values for each precision + var bigBigFacs = []; + + // 0-20! values + var smallBigFacs = [ + 1, + 1, + 2, + 6, + 24, + 120, + 720, + 5040, + 40320, + 362880, + 3628800, + 39916800, + 479001600, + 6227020800, + 87178291200, + 1307674368000, + 20922789888000, + 355687428096000, + 6402373705728000, + 121645100408832000, + 2432902008176640000 + ]; + + exports.name = 'gamma'; + exports.factory = factory; /***/ }, /* 109 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var distribution = __webpack_require__(334)(math); - - /** - * Random pick a value from a one dimensional array. - * Array element is picked using a random function with uniform distribution. - * - * Syntax: - * - * math.pickRandom(array) - * - * Examples: - * - * math.pickRandom([3, 6, 12, 2]); // returns one of the values in the array - * - * See also: - * - * random, randomInt - * - * @param {Array} array A one dimensional array - * @return {Number} One of the elements of the provided input array - */ - math.pickRandom = distribution('uniform').pickRandom; - }; + 'use strict'; + + var isInteger = __webpack_require__(175).isInteger; + + function factory (type, config, load, typed) { + var factorial = load(__webpack_require__(107)); + + /** + * Compute the number of ways of obtaining an ordered subset of `k` elements + * from a set of `n` elements. + * + * Permutations only takes integer arguments. + * The following condition must be enforced: k <= n. + * + * Syntax: + * + * math.permutations(n) + * math.permutations(n, k) + * + * Examples: + * + * math.permutations(5); // 120 + * math.permutations(5, 3); // 60 + * + * See also: + * + * combinations, factorial + * + * @param {Number | BigNumber} n The number of objects in total + * @param {Number | BigNumber} [k] The number of objects in the subset + * @return {Number | BigNumber} The number of permutations + */ + return typed('permutations', { + 'number | BigNumber': factorial, + + 'number, number': function (n, k) { + var result, i; + + if (!isInteger(n) || n < 0) { + throw new TypeError('Positive integer value expected in function permutations'); + } + if (!isInteger(k) || k < 0) { + throw new TypeError('Positive integer value expected in function permutations'); + } + if (k > n) { + throw new TypeError('second argument k must be less than or equal to first argument n'); + } + + // Permute n objects, k at a time + result = 1; + for (i = n - k + 1; i <= n; i++) { + result = result * i; + } + + return result; + }, + + 'BigNumber, BigNumber': function (n, k) { + var result, i; + + if (!isPositiveInteger(n) || !isPositiveInteger(k)) { + throw new TypeError('Positive integer value expected in function permutations'); + } + if (k.gt(n)) { + throw new TypeError('second argument k must be less than or equal to first argument n'); + } + + result = new type.BigNumber(1); + for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) { + result = result.times(i); + } + + return result; + } + + // TODO: implement support for collection in permutations + }); + } + + /** + * Test whether BigNumber n is a positive integer + * @param {BigNumber} n + * @returns {boolean} isPositiveInteger + */ + function isPositiveInteger(n) { + return n.isInteger() && n.gte(0); + } + + exports.name = 'permutations'; + exports.factory = factory; /***/ }, /* 110 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - - isNumber = util.number.isNumber, - isInteger = util.number.isInteger; - - /** - * Compute the number of ways of obtaining an ordered subset of `k` elements - * from a set of `n` elements. - * - * Permutations only takes integer arguments. - * The following condition must be enforced: k <= n. - * - * Syntax: - * - * math.permutations(n) - * math.permutations(n, k) - * - * Examples: - * - * math.permutations(5); // 120 - * math.permutations(5, 3); // 60 - * - * See also: - * - * combinations, factorial - * - * @param {Number | BigNumber} n The number of objects in total - * @param {Number | BigNumber} k The number of objects in the subset - * @return {Number | BigNumber} The number of permutations - */ - math.permutations = function permutations (n, k) { - var result, i; - - var arity = arguments.length; - if (arity > 2) { - throw new math.error.ArgumentsError('permutations', arguments.length, 2); - } - - if (isNumber(n)) { - if (!isInteger(n) || n < 0) { - throw new TypeError('Positive integer value expected in function permutations'); - } - - // Permute n objects - if (arity == 1) { - return math.factorial(n); - } - - // Permute n objects, k at a time - if (arity == 2) { - if (isNumber(k)) { - if (!isInteger(k) || k < 0) { - throw new TypeError('Positive integer value expected in function permutations'); - } - if (k > n) { - throw new TypeError('second argument k must be less than or equal to first argument n'); - } - - result = 1; - for (i = n - k + 1; i <= n; i++) { - result = result * i; - } - return result; - } - } - } - - if (n instanceof BigNumber) { - if (k === undefined && isPositiveInteger(n)) { - return math.factorial(n); - } - - // make sure k is a BigNumber as well - // not all numbers can be converted to BigNumber - k = BigNumber.convert(k); - - if (!(k instanceof BigNumber) || !isPositiveInteger(n) || !isPositiveInteger(k)) { - throw new TypeError('Positive integer value expected in function permutations'); - } - if (k.gt(n)) { - throw new TypeError('second argument k must be less than or equal to first argument n'); - } - - result = new BigNumber(1); - for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) { - result = result.times(i); - } - return result; - } - - throw new math.error.UnsupportedTypeError('permutations', math['typeof'](n)); - }; - - /** - * Test whether BigNumber n is a positive integer - * @param {BigNumber} n - * @returns {boolean} isPositiveInteger - */ - var isPositiveInteger = function(n) { - return n.isInteger() && n.gte(0); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var distribution = load(__webpack_require__(215)); + + /** + * Random pick a value from a one dimensional array. + * Array element is picked using a random function with uniform distribution. + * + * Syntax: + * + * math.pickRandom(array) + * + * Examples: + * + * math.pickRandom([3, 6, 12, 2]); // returns one of the values in the array + * + * See also: + * + * random, randomInt + * + * @param {Array} array A one dimensional array + * @return {Number} One of the elements of the provided input array + */ + // TODO: rework pickRandom to a typed-function + return distribution('uniform').pickRandom; + } + + exports.name = 'pickRandom'; + exports.factory = factory; /***/ }, /* 111 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isInteger = util.number.isInteger; - - /** - * Compute the number of ways of picking `k` unordered outcomes from `n` - * possibilities. - * - * Combinations only takes integer arguments. - * The following condition must be enforced: k <= n. - * - * Syntax: - * - * math.combinations(n, k) - * - * Examples: - * - * math.combinations(7, 5); // returns 21 - * - * See also: - * - * permutations, factorial - * - * @param {Number | BigNumber} n Total number of objects in the set - * @param {Number | BigNumber} k Number of objects in the subset - * @return {Number | BigNumber} Number of possible combinations. - */ - math.combinations = function combinations (n, k) { - var max, result, i,ii; - - var arity = arguments.length; - if (arity != 2) { - throw new math.error.ArgumentsError('combinations', arguments.length, 2); - } - - if (isNumber(n)) { - if (!isInteger(n) || n < 0) { - throw new TypeError('Positive integer value enpected in function combinations'); - } - if (k > n) { - throw new TypeError('k must be less than or equal to n'); - } - - max = Math.max(k, n - k); - result = 1; - for (i = 1; i <= n - max; i++) { - result = result * (max + i) / i; - } - return result; - } - - if (n instanceof BigNumber) { - // make sure k is a BigNumber as well - // not all numbers can be converted to BigNumber - k = BigNumber.convert(k); - - if (!(k instanceof BigNumber) || !isPositiveInteger(n) || !isPositiveInteger(k)) { - throw new TypeError('Positive integer value expected in function combinations'); - } - if (k.gt(n)) { - throw new TypeError('k must be less than n in function combinations'); - } - - max = n.minus(k); - if (k.lt(max)) max = k; - result = new BigNumber(1); - for (i = new BigNumber(1), ii = n.minus(max); i.lte(ii); i = i.plus(1)) { - result = result.times(max.plus(i)).dividedBy(i); - } - return result; - } - - throw new math.error.UnsupportedTypeError('combinations', math['typeof'](n)); - }; - - /** - * Test whether BigNumber n is a positive integer - * @param {BigNumber} n - * @returns {boolean} isPositiveInteger - */ - var isPositiveInteger = function(n) { - return n.isInteger() && n.gte(0); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var distribution = load(__webpack_require__(215)); + + /** + * Return a random number larger or equal to `min` and smaller than `max` + * using a uniform distribution. + * + * Syntax: + * + * math.random() // generate a random number between 0 and 1 + * math.random(max) // generate a random number between 0 and max + * math.random(min, max) // generate a random number between min and max + * math.random(size) // generate a matrix with random numbers between 0 and 1 + * math.random(size, max) // generate a matrix with random numbers between 0 and max + * math.random(size, min, max) // generate a matrix with random numbers between min and max + * + * Examples: + * + * math.random(); // returns a random number between 0 and 1 + * math.random(100); // returns a random number between 0 and 100 + * math.random(30, 40); // returns a random number between 30 and 40 + * math.random([2, 3]); // returns a 2x3 matrix with random numbers between 0 and 1 + * + * See also: + * + * randomInt, pickRandom + * + * @param {Array | Matrix} [size] If provided, an array or matrix with given + * size and filled with random values is returned + * @param {Number} [min] Minimum boundary for the random value, included + * @param {Number} [max] Maximum boundary for the random value, excluded + * @return {Number | Array | Matrix} A random number + */ + // TODO: rework random to a typed-function + return distribution('uniform').random; + } + + exports.name = 'random'; + exports.factory = factory; /***/ }, /* 112 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - nearlyEqual = util.number.nearlyEqual, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y. - * - * x and y are considered equal when the relative difference between x and y - * is smaller than the configured epsilon. The function cannot be used to - * compare values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.compare(x, y) - * - * Examples: - * - * math.compare(6, 1); // returns 1 - * math.compare(2, 3); // returns -1 - * math.compare(7, 7); // returns 0 - * - * var a = math.unit('5 cm'); - * var b = math.unit('40 mm'); - * math.compare(a, b); // returns 1 - * - * math.compare(2, [1, 2, 3]); // returns [1, 0, -1] - * - * See also: - * - * equal, unequal, smaller, smallerEq, larger, largerEq - * - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare - * @return {Number | BigNumber | Array | Matrix} Returns the result of the comparison: 1, 0 or -1. - */ - math.compare = function compare(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('compare', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - return nearlyEqual(x, y, config.epsilon) ? 0 : (x > y ? 1 : -1); - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - else if (isBoolean(y) || y === null) { - y = new BigNumber(y ? 1 : 0); - } - - if (y instanceof BigNumber) { - return new BigNumber(x.cmp(y)); - } - - // downgrade to Number - return compare(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - else if (isBoolean(x) || x === null) { - x = new BigNumber(x ? 1 : 0); - } - - if (x instanceof BigNumber) { - return new BigNumber(x.cmp(y)); - } - - // downgrade to Number - return compare(x, y.toNumber()); - } - - if ((isUnit(x)) && (isUnit(y))) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return (x.value > y.value) ? 1 : ((x.value < y.value) ? -1 : 0); - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, compare); - } - - // Note: test strings after testing collections, - // else we can't compare a string with a matrix - if (isString(x) || isString(y)) { - return (x > y) ? 1 : ((x < y) ? -1 : 0); - } - - if (isBoolean(x) || x === null) { - return compare(+x, y); - } - if (isBoolean(y) || y === null) { - return compare(x, +y); - } - - if (isComplex(x) || isComplex(y)) { - throw new TypeError('No ordering relation is defined for complex numbers'); - } - - throw new math.error.UnsupportedTypeError('compare', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var distribution = load(__webpack_require__(215)); + + /** + * Return a random integer number larger or equal to `min` and smaller than `max` + * using a uniform distribution. + * + * Syntax: + * + * math.randomInt() // generate a random integer between 0 and 1 + * math.randomInt(max) // generate a random integer between 0 and max + * math.randomInt(min, max) // generate a random integer between min and max + * math.randomInt(size) // generate a matrix with random integer between 0 and 1 + * math.randomInt(size, max) // generate a matrix with random integer between 0 and max + * math.randomInt(size, min, max) // generate a matrix with random integer between min and max + * + * Examples: + * + * math.randomInt(); // returns a random integer between 0 and 1 + * math.randomInt(100); // returns a random integer between 0 and 100 + * math.randomInt(30, 40); // returns a random integer between 30 and 40 + * math.randomInt([2, 3]); // returns a 2x3 matrix with random integers between 0 and 1 + * + * See also: + * + * random, pickRandom + * + * @param {Array | Matrix} [size] If provided, an array or matrix with given + * size and filled with random values is returned + * @param {Number} [min] Minimum boundary for the random value, included + * @param {Number} [max] Maximum boundary for the random value, excluded + * @return {Number | Array | Matrix} A random integer value + */ + // TODO: rework randomInt to a typed-function + return distribution('uniform').randomInt; + } + + exports.name = 'randomInt'; + exports.factory = factory; /***/ }, /* 113 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isArray = Array.isArray; - - /** - * Test element wise whether two matrices are equal. - * The function accepts both matrices and scalar values. - * - * Syntax: - * - * math.deepEqual(x, y) - * - * Examples: - * - * math.deepEqual(2, 4); // returns false - * - * a = [2, 5, 1]; - * b = [2, 7, 1]; - * - * math.deepEqual(a, b); // returns false - * math.equal(a, b); // returns [true, false, true] - * - * See also: - * - * equal, unequal - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First matrix to compare - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second matrix to compare - * @return {Number | BigNumber | Complex | Unit | Array | Matrix} - * Returns true when the input matrices have the same size and each of their elements is equal. - */ - math.deepEqual = function deepEqual(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('deepEqual', arguments.length, 2); - } - - if (isCollection(x) || isCollection(y)) { - return _deepEqual(x.valueOf(), y.valueOf()); - } - - return math.equal(x, y); - }; - - /** - * Test whether two arrays have the same size and all elements are equal - * @param {Array | *} x - * @param {Array | *} y - * @return {boolean} Returns true if both arrays are deep equal - */ - function _deepEqual(x, y) { - if (isArray(x)) { - if (isArray(y)) { - var len = x.length; - if (len !== y.length) return false; - - for (var i = 0; i < len; i++) { - if (!_deepEqual(x[i], y[i])) return false; - } - - return true; - } - else { - return false; - } - } - else { - if (isArray(y)) { - return false; - } - else { - return math.equal(x, y); - } - } - } - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y. + * + * x and y are considered equal when the relative difference between x and y + * is smaller than the configured epsilon. The function cannot be used to + * compare values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.compare(x, y) + * + * Examples: + * + * math.compare(6, 1); // returns 1 + * math.compare(2, 3); // returns -1 + * math.compare(7, 7); // returns 0 + * + * var a = math.unit('5 cm'); + * var b = math.unit('40 mm'); + * math.compare(a, b); // returns 1 + * + * math.compare(2, [1, 2, 3]); // returns [1, 0, -1] + * + * See also: + * + * equal, unequal, smaller, smallerEq, larger, largerEq + * + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare + * @return {Number | BigNumber | Array | Matrix} Returns the result of the comparison: 1, 0 or -1. + */ + var compare = typed('compare', { + 'boolean, boolean': function (x, y) { + return x === y ? 0 : (x > y ? 1 : -1); + }, + + 'number, number': function (x, y) { + return (x === y || nearlyEqual(x, y, config.epsilon)) ? 0 : (x > y ? 1 : -1); + }, + + 'BigNumber, BigNumber': function (x, y) { + return new x.constructor(x.cmp(y)); + }, + + 'Complex, Complex': function (x, y) { + throw new TypeError('No ordering relation is defined for complex numbers'); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return (x.value === y.value || nearlyEqual(x.value, y.value, config.epsilon)) ? 0 : (x.value > y.value ? 1 : -1); + }, + + 'string, string': function (x, y) { + return x === y ? 0 : (x > y ? 1 : -1); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, compare); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, compare); + } + }); + + return compare; + } + + exports.name = 'compare'; + exports.factory = factory; /***/ }, /* 114 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var nearlyEqual = __webpack_require__(3).nearlyEqual; - var collection = __webpack_require__(14); - - /** - * Test whether two values are equal. - * - * The function tests whether the relative difference between x and y is - * smaller than the configured epsilon. The function cannot be used to - * compare values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im. - * - * Values `null` and `undefined` are compared strictly, thus `null` is only - * equal to `null` and nothing else, and `undefined` is only equal to - * `undefined` and nothing else. - * - * Syntax: - * - * math.equal(x, y) - * - * Examples: - * - * math.equal(2 + 2, 3); // returns false - * math.equal(2 + 2, 4); // returns true - * - * var a = math.unit('50 cm'); - * var b = math.unit('5 m'); - * math.equal(a, b); // returns true - * - * var c = [2, 5, 1]; - * var d = [2, 7, 1]; - * - * math.equal(c, d); // returns [true, false, true] - * math.deepEqual(c, d); // returns false - * - * math.equal(0, null); // returns false - * - * See also: - * - * unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual - * - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} x First value to compare - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the compared values are equal, else returns false - */ - var equal = typed('equal', { - 'any, any': function (x, y) { - // strict equality for null and undefined? - if (x === null) { return y === null; } - if (y === null) { return x === null; } - if (x === undefined) { return y === undefined; } - if (y === undefined) { return x === undefined; } - - return _equal(x, y); - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, _equal); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, _equal); - } - }); - - var _equal = typed('_equal', { - 'boolean, boolean': function (x, y) { - return x === y; - }, - - 'number, number': function (x, y) { - return x === y || nearlyEqual(x, y, config.epsilon); - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.eq(y); - }, - - 'Complex, Complex': function (x, y) { - return (x.re === y.re || nearlyEqual(x.re, y.re, config.epsilon)) && - (x.im === y.im || nearlyEqual(x.im, y.im, config.epsilon)); - }, - - 'Unit, Unit': function (x, y) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value === y.value || nearlyEqual(x.value, y.value, config.epsilon); - }, - - 'string, string': function (x, y) { - return x === y; - } - }); - - return equal; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var equal = load(__webpack_require__(115)); + + /** + * Test element wise whether two matrices are equal. + * The function accepts both matrices and scalar values. + * + * Syntax: + * + * math.deepEqual(x, y) + * + * Examples: + * + * math.deepEqual(2, 4); // returns false + * + * a = [2, 5, 1]; + * b = [2, 7, 1]; + * + * math.deepEqual(a, b); // returns false + * math.equal(a, b); // returns [true, false, true] + * + * See also: + * + * equal, unequal + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x First matrix to compare + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} y Second matrix to compare + * @return {Number | BigNumber | Complex | Unit | Array | Matrix} + * Returns true when the input matrices have the same size and each of their elements is equal. + */ + return typed('deepEqual', { + 'any, any': function (x, y) { + return _deepEqual(x.valueOf(), y.valueOf()); + } + }); + + /** + * Test whether two arrays have the same size and all elements are equal + * @param {Array | *} x + * @param {Array | *} y + * @return {boolean} Returns true if both arrays are deep equal + */ + function _deepEqual(x, y) { + if (Array.isArray(x)) { + if (Array.isArray(y)) { + var len = x.length; + if (len !== y.length) { + return false; + } + + for (var i = 0; i < len; i++) { + if (!_deepEqual(x[i], y[i])) { + return false; + } + } + + return true; + } + else { + return false; + } + } + else { + if (Array.isArray(y)) { + return false; + } + else { + return equal(x, y); + } + } + } + } + + exports.name = 'deepEqual'; + exports.factory = factory; /***/ }, /* 115 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var nearlyEqual = __webpack_require__(3).nearlyEqual; - var collection = __webpack_require__(14); - - /** - * Test whether value x is larger than y. - * - * The function returns true when x is larger than y and the relative - * difference between x and y is larger than the configured epsilon. The - * function cannot be used to compare values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.larger(x, y) - * - * Examples: - * - * math.larger(2, 3); // returns false - * math.larger(5, 2 + 2); // returns true - * - * var a = math.unit('5 cm'); - * var b = math.unit('2 inch'); - * math.larger(a, b); // returns false - * - * See also: - * - * equal, unequal, smaller, smallerEq, largerEq, compare - * - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the x is larger than y, else returns false - */ - var larger = typed('larger', { - 'boolean, boolean': function (x, y) { - return x > y; - }, - - 'number, number': function (x, y) { - return x > y && !nearlyEqual(x, y, config.epsilon); - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.gt(y); - }, - - 'Complex, Complex': function (x, y) { - throw new TypeError('No ordering relation is defined for complex numbers'); - }, - - 'Unit, Unit': function (x, y) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value > y.value && !nearlyEqual(x.value, y.value, config.epsilon); - }, - - 'string, string': function (x, y) { - return x > y; - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, larger); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, larger); - } - }); - - return larger; - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + /** + * Test whether two values are equal. + * + * The function tests whether the relative difference between x and y is + * smaller than the configured epsilon. The function cannot be used to + * compare values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im. + * + * Values `null` and `undefined` are compared strictly, thus `null` is only + * equal to `null` and nothing else, and `undefined` is only equal to + * `undefined` and nothing else. + * + * Syntax: + * + * math.equal(x, y) + * + * Examples: + * + * math.equal(2 + 2, 3); // returns false + * math.equal(2 + 2, 4); // returns true + * + * var a = math.unit('50 cm'); + * var b = math.unit('5 m'); + * math.equal(a, b); // returns true + * + * var c = [2, 5, 1]; + * var d = [2, 7, 1]; + * + * math.equal(c, d); // returns [true, false, true] + * math.deepEqual(c, d); // returns false + * + * math.equal(0, null); // returns false + * + * See also: + * + * unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual + * + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} x First value to compare + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the compared values are equal, else returns false + */ + var equal = typed('equal', { + 'any, any': function (x, y) { + // strict equality for null and undefined? + if (x === null) { return y === null; } + if (y === null) { return x === null; } + if (x === undefined) { return y === undefined; } + if (y === undefined) { return x === undefined; } + + return _equal(x, y); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, _equal); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, _equal); + } + }); + + var _equal = typed('_equal', { + 'boolean, boolean': function (x, y) { + return x === y; + }, + + 'number, number': function (x, y) { + return x === y || nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.eq(y); + }, + + 'Complex, Complex': function (x, y) { + return (x.re === y.re || nearlyEqual(x.re, y.re, config.epsilon)) && + (x.im === y.im || nearlyEqual(x.im, y.im, config.epsilon)); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return x.value === y.value || nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x === y; + } + }); + + return equal; + } + + exports.name = 'equal'; + exports.factory = factory; /***/ }, /* 116 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - nearlyEqual = util.number.nearlyEqual, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Test whether value x is larger or equal to y. - * - * The function returns true when x is larger than y or the relative - * difference between x and y is smaller than the configured epsilon. The - * function cannot be used to compare values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.largerEq(x, y) - * - * Examples: - * - * math.larger(2, 1 + 1); // returns false - * math.largerEq(2, 1 + 1); // returns true - * - * See also: - * - * equal, unequal, smaller, smallerEq, larger, compare - * - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false - */ - math.largerEq = function largerEq(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('largerEq', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - return x > y || nearlyEqual(x, y, config.epsilon); - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - else if (isBoolean(y) || y === null) { - y = new BigNumber(y ? 1 : 0); - } - - if (y instanceof BigNumber) { - return x.gte(y); - } - - // downgrade to Number - return largerEq(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - else if (isBoolean(x) || x === null) { - x = new BigNumber(x ? 1 : 0); - } - - if (x instanceof BigNumber) { - return x.gte(y) - } - - // downgrade to Number - return largerEq(x, y.toNumber()); - } - - if ((isUnit(x)) && (isUnit(y))) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value >= y.value; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, largerEq); - } - - // Note: test strings after testing collections, - // else we can't compare a string with a matrix - if (isString(x) || isString(y)) { - return x >= y; - } - - if (isBoolean(x) || x === null) { - return largerEq(+x, y); - } - if (isBoolean(y) || y === null) { - return largerEq(x, +y); - } - - if (isComplex(x) || isComplex(y)) { - throw new TypeError('No ordering relation is defined for complex numbers'); - } - - throw new math.error.UnsupportedTypeError('largerEq', math['typeof'](x), math['typeof'](y)); - }; - - // TODO: deprecated since version 0.23.0, cleanup some day - math.largereq = function () { - throw new Error('Function largereq is renamed to largerEq'); - } - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Test whether value x is larger than y. + * + * The function returns true when x is larger than y and the relative + * difference between x and y is larger than the configured epsilon. The + * function cannot be used to compare values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.larger(x, y) + * + * Examples: + * + * math.larger(2, 3); // returns false + * math.larger(5, 2 + 2); // returns true + * + * var a = math.unit('5 cm'); + * var b = math.unit('2 inch'); + * math.larger(a, b); // returns false + * + * See also: + * + * equal, unequal, smaller, smallerEq, largerEq, compare + * + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the x is larger than y, else returns false + */ + var larger = typed('larger', { + 'boolean, boolean': function (x, y) { + return x > y; + }, + + 'number, number': function (x, y) { + return x > y && !nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.gt(y); + }, + + 'Complex, Complex': function (x, y) { + throw new TypeError('No ordering relation is defined for complex numbers'); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return x.value > y.value && !nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x > y; + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, larger); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, larger); + } + }); + + return larger; + } + + exports.name = 'larger'; + exports.factory = factory; /***/ }, /* 117 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var nearlyEqual = __webpack_require__(3).nearlyEqual; - var collection = __webpack_require__(14); - - /** - * Test whether value x is smaller than y. - * - * The function returns true when x is smaller than y and the relative - * difference between x and y is larger than the configured epsilon. The - * function cannot be used to compare values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.smaller(x, y) - * - * Examples: - * - * math.smaller(2, 3); // returns true - * math.smaller(5, 2 * 2); // returns false - * - * var a = math.unit('5 cm'); - * var b = math.unit('2 inch'); - * math.smaller(a, b); // returns true - * - * See also: - * - * equal, unequal, smallerEq, larger, largerEq, compare - * - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false - */ - var smaller = typed('smaller', { - 'boolean, boolean': function (x, y) { - return x < y; - }, - - 'number, number': function (x, y) { - return x < y && !nearlyEqual(x, y, config.epsilon); - }, - - 'BigNumber, BigNumber': function (x, y) { - return x.lt(y); - }, - - 'Complex, Complex': function (x, y) { - throw new TypeError('No ordering relation is defined for complex numbers'); - }, - - 'Unit, Unit': function (x, y) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value < y.value && !nearlyEqual(x.value, y.value, config.epsilon); - }, - - 'string, string': function (x, y) { - return x < y; - }, - - 'Array | Matrix, any': function (x, y) { - return collection.deepMap2(x, y, smaller); - }, - - 'any, Array | Matrix': function (x, y) { - return collection.deepMap2(x, y, smaller); - } - }); - - return smaller; - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Test whether value x is larger or equal to y. + * + * The function returns true when x is larger than y or the relative + * difference between x and y is smaller than the configured epsilon. The + * function cannot be used to compare values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.largerEq(x, y) + * + * Examples: + * + * math.larger(2, 1 + 1); // returns false + * math.largerEq(2, 1 + 1); // returns true + * + * See also: + * + * equal, unequal, smaller, smallerEq, larger, compare + * + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false + */ + var largerEq = typed('largerEq', { + 'boolean, boolean': function (x, y) { + return x >= y; + }, + + 'number, number': function (x, y) { + return x >= y || nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.gte(y); + }, + + 'Complex, Complex': function (x, y) { + throw new TypeError('No ordering relation is defined for complex numbers'); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return x.value >= y.value || nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x >= y; + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, largerEq); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, largerEq); + } + }); + + return largerEq; + } + + exports.name = 'largerEq'; + exports.factory = factory; /***/ }, /* 118 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - nearlyEqual = util.number.nearlyEqual, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Test whether value x is smaller or equal to y. - * - * The function returns true when x is smaller than y or the relative - * difference between x and y is smaller than the configured epsilon. The - * function cannot be used to compare values smaller than approximately 2.22e-16. - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.smallerEq(x, y) - * - * Examples: - * - * math.smaller(1 + 2, 3); // returns false - * math.smallerEq(1 + 2, 3); // returns true - * - * See also: - * - * equal, unequal, smaller, larger, largerEq, compare - * - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare - * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false - */ - math.smallerEq = function smallerEq(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('smallerEq', arguments.length, 2); - } - - if (isNumber(x) && isNumber(y)) { - return x < y || nearlyEqual(x, y, config.epsilon); - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - else if (isBoolean(y) || y === null) { - y = new BigNumber(y ? 1 : 0); - } - - if (y instanceof BigNumber) { - return x.lte(y); - } - - // downgrade to Number - return smallerEq(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - else if (isBoolean(x) || x === null) { - x = new BigNumber(x ? 1 : 0); - } - - if (x instanceof BigNumber) { - return x.lte(y) - } - - // downgrade to Number - return smallerEq(x, y.toNumber()); - } - - if ((isUnit(x)) && (isUnit(y))) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value <= y.value; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, smallerEq); - } - - // Note: test strings after testing collections, - // else we can't compare a string with a matrix - if (isString(x) || isString(y)) { - return x <= y; - } - - if (isBoolean(x) || x === null) { - return smallerEq(+x, y); - } - if (isBoolean(y) || y === null) { - return smallerEq(x, +y); - } - - if (isComplex(x) || isComplex(y)) { - throw new TypeError('No ordering relation is defined for complex numbers'); - } - - throw new math.error.UnsupportedTypeError('smallerEq', math['typeof'](x), math['typeof'](y)); - }; - - // TODO: deprecated since version 0.23.0, cleanup some day - math.smallereq = function () { - throw new Error('Function smallereq is renamed to smallerEq'); - } - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Test whether value x is smaller than y. + * + * The function returns true when x is smaller than y and the relative + * difference between x and y is larger than the configured epsilon. The + * function cannot be used to compare values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.smaller(x, y) + * + * Examples: + * + * math.smaller(2, 3); // returns true + * math.smaller(5, 2 * 2); // returns false + * + * var a = math.unit('5 cm'); + * var b = math.unit('2 inch'); + * math.smaller(a, b); // returns true + * + * See also: + * + * equal, unequal, smallerEq, larger, largerEq, compare + * + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false + */ + var smaller = typed('smaller', { + 'boolean, boolean': function (x, y) { + return x < y; + }, + + 'number, number': function (x, y) { + return x < y && !nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.lt(y); + }, + + 'Complex, Complex': function (x, y) { + throw new TypeError('No ordering relation is defined for complex numbers'); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return x.value < y.value && !nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x < y; + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, smaller); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, smaller); + } + }); + + return smaller; + } + + exports.name = 'smaller'; + exports.factory = factory; /***/ }, /* 119 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - nearlyEqual = util.number.nearlyEqual, - isBoolean = util['boolean'].isBoolean, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Test whether two values are unequal. - * - * The function tests whether the relative difference between x and y is - * larger than the configured epsilon. The function cannot be used to compare - * values smaller than approximately 2.22e-16. - * - * For matrices, the function is evaluated element wise. - * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im. - * - * Values `null` and `undefined` are compared strictly, thus `null` is unequal - * with everything except `null`, and `undefined` is unequal with everying - * except. `undefined`. - * - * Syntax: - * - * math.unequal(x, y) - * - * Examples: - * - * math.unequal(2 + 2, 3); // returns true - * math.unequal(2 + 2, 4); // returns false - * - * var a = math.unit('50 cm'); - * var b = math.unit('5 m'); - * math.unequal(a, b); // returns false - * - * var c = [2, 5, 1]; - * var d = [2, 7, 1]; - * - * math.unequal(c, d); // returns [false, true, false] - * math.deepEqual(c, d); // returns false - * - * math.unequal(0, null); // returns true - * See also: - * - * equal, deepEqual, smaller, smallerEq, larger, largerEq, compare - * - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} x First value to compare - * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} y Second value to compare - * @return {Boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false - */ - math.unequal = function unequal(x, y) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('unequal', arguments.length, 2); - } - - if (isNumber(x)) { - if (isNumber(y)) { - return !nearlyEqual(x, y, config.epsilon); - } - else if (isComplex(y)) { - return !nearlyEqual(x, y.re, config.epsilon) || !nearlyEqual(y.im, 0, config.epsilon); - } - } - - if (isComplex(x)) { - if (isNumber(y)) { - return !nearlyEqual(x.re, y, config.epsilon) || !nearlyEqual(x.im, 0, config.epsilon); - } - else if (isComplex(y)) { - return !nearlyEqual(x.re, y.re, config.epsilon) || !nearlyEqual(x.im, y.im, config.epsilon); - } - } - - if (x instanceof BigNumber) { - // try to convert to big number - if (isNumber(y)) { - y = BigNumber.convert(y); - } - else if (isBoolean(y)) { - y = new BigNumber(y ? 1 : 0); - } - - if (y instanceof BigNumber) { - return !x.eq(y); - } - - // downgrade to Number - return unequal(x.toNumber(), y); - } - if (y instanceof BigNumber) { - // try to convert to big number - if (isNumber(x)) { - x = BigNumber.convert(x); - } - else if (isBoolean(x)) { - x = new BigNumber(x ? 1 : 0); - } - - if (x instanceof BigNumber) { - return !x.eq(y) - } - - // downgrade to Number - return unequal(x, y.toNumber()); - } - - if ((isUnit(x)) && (isUnit(y))) { - if (!x.equalBase(y)) { - throw new Error('Cannot compare units with different base'); - } - return x.value != y.value; - } - - if (isCollection(x) || isCollection(y)) { - return collection.deepMap2(x, y, unequal); - } - - // Note: test strings after testing collections, - // else we can accidentally compare a stringified array with a string - if (isString(x) || isString(y)) { - return x != y; - } - - if (isBoolean(x)) { - return unequal(+x, y); - } - if (isBoolean(y)) { - return unequal(x, +y); - } - - if (x === null) { - return y !== null; - } - if (y === null) { - return x !== null; - } - - if (x === undefined) { - return y !== undefined; - } - if (y === undefined) { - return x !== undefined; - } - - throw new math.error.UnsupportedTypeError('unequal', math['typeof'](x), math['typeof'](y)); - }; - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Test whether value x is smaller or equal to y. + * + * The function returns true when x is smaller than y or the relative + * difference between x and y is smaller than the configured epsilon. The + * function cannot be used to compare values smaller than approximately 2.22e-16. + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.smallerEq(x, y) + * + * Examples: + * + * math.smaller(1 + 2, 3); // returns false + * math.smallerEq(1 + 2, 3); // returns true + * + * See also: + * + * equal, unequal, smaller, larger, largerEq, compare + * + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} x First value to compare + * @param {Number | BigNumber | Boolean | Unit | String | Array | Matrix | null} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false + */ + var smallerEq = typed('smallerEq', { + 'boolean, boolean': function (x, y) { + return x <= y; + }, + + 'number, number': function (x, y) { + return x <= y || nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.lte(y); + }, + + 'Complex, Complex': function (x, y) { + throw new TypeError('No ordering relation is defined for complex numbers'); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return x.value <= y.value || nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x <= y; + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, smallerEq); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, smallerEq); + } + }); + + return smallerEq; + } + + exports.name = 'smallerEq'; + exports.factory = factory; /***/ }, /* 120 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - var smaller = __webpack_require__(117)(config); - - /** - * Compute the maximum value of a matrix or a list of values. - * In case of a multi dimensional array, the maximum of the flattened array - * will be calculated. When `dim` is provided, the maximum over the selected - * dimension will be calculated. Parameter `dim` is zero-based. - * - * Syntax: - * - * math.min(a, b, c, ...) - * math.min(A) - * math.min(A, dim) - * - * Examples: - * - * math.min(2, 1, 4, 3); // returns 1 - * math.min([2, 1, 4, 3]); // returns 1 - * - * // maximum over a specified dimension (zero-based) - * math.min([[2, 5], [4, 3], [1, 7]], 0); // returns [1, 3] - * math.min([[2, 5], [4, 3], [1, 7]], 1); // returns [2, 3, 1] - * - * math.max(2.7, 7.1, -4.5, 2.0, 4.1); // returns 7.1 - * math.min(2.7, 7.1, -4.5, 2.0, 4.1); // returns -4.5 - * - * See also: - * - * mean, median, max, prod, std, sum, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The minimum value - */ - return typed('min', { - 'Array | Matrix': function (array) { - // min([a, b, c, d, ...]) - return _min(array); - }, - - 'Array | Matrix, number | BigNumber': function (array, dim) { - // min([a, b, c, d, ...], dim) - return collection.reduce(array, dim.valueOf(), _smallest); - }, - - '...': function () { - // min(a, b, c, d, ...) - return _min(arguments); - } - }); - - /** - * Return the smallest of two values - * @param {*} x - * @param {*} y - * @returns {*} Returns x when x is smallest, or y when y is smallest - * @private - */ - function _smallest(x, y) { - return smaller(x, y) ? x : y; - } - - /** - * Recursively calculate the minimum value in an n-dimensional array - * @param {Array} array - * @return {Number} min - * @private - */ - function _min(array) { - var min = undefined; - - collection.deepForEach(array, function (value) { - if (min === undefined || smaller(value, min)) { - min = value; - } - }); - - if (min === undefined) { - throw new Error('Cannot calculate min of an empty array'); - } - - return min; - } - }; + 'use strict'; + + var nearlyEqual = __webpack_require__(175).nearlyEqual; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Test whether two values are unequal. + * + * The function tests whether the relative difference between x and y is + * larger than the configured epsilon. The function cannot be used to compare + * values smaller than approximately 2.22e-16. + * + * For matrices, the function is evaluated element wise. + * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im. + * + * Values `null` and `undefined` are compared strictly, thus `null` is unequal + * with everything except `null`, and `undefined` is unequal with everying + * except. `undefined`. + * + * Syntax: + * + * math.unequal(x, y) + * + * Examples: + * + * math.unequal(2 + 2, 3); // returns true + * math.unequal(2 + 2, 4); // returns false + * + * var a = math.unit('50 cm'); + * var b = math.unit('5 m'); + * math.unequal(a, b); // returns false + * + * var c = [2, 5, 1]; + * var d = [2, 7, 1]; + * + * math.unequal(c, d); // returns [false, true, false] + * math.deepEqual(c, d); // returns false + * + * math.unequal(0, null); // returns true + * See also: + * + * equal, deepEqual, smaller, smallerEq, larger, largerEq, compare + * + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} x First value to compare + * @param {Number | BigNumber | Boolean | Complex | Unit | String | Array | Matrix | null | undefined} y Second value to compare + * @return {Boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false + */ + var unequal = typed('unequal', { + 'any, any': function (x, y) { + // strict equality for null and undefined? + if (x === null) { return y !== null; } + if (y === null) { return x !== null; } + if (x === undefined) { return y !== undefined; } + if (y === undefined) { return x !== undefined; } + + return _unequal(x, y); + }, + + 'Array | Matrix, any': function (x, y) { + return collection.deepMap2(x, y, _unequal); + }, + + 'any, Array | Matrix': function (x, y) { + return collection.deepMap2(x, y, _unequal); + } + }); + + var _unequal = typed('_unequal', { + 'boolean, boolean': function (x, y) { + return x !== y; + }, + + 'number, number': function (x, y) { + return !nearlyEqual(x, y, config.epsilon); + }, + + 'BigNumber, BigNumber': function (x, y) { + return !x.eq(y); + }, + + 'Complex, Complex': function (x, y) { + return !nearlyEqual(x.re, y.re, config.epsilon) || + !nearlyEqual(x.im, y.im, config.epsilon); + }, + + 'Unit, Unit': function (x, y) { + if (!x.equalBase(y)) { + throw new Error('Cannot compare units with different base'); + } + return !nearlyEqual(x.value, y.value, config.epsilon); + }, + + 'string, string': function (x, y) { + return x !== y; + } + }); + + return unequal; + } + + exports.name = 'unequal'; + exports.factory = factory; /***/ }, /* 121 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - isCollection = collection.isCollection; - - /** - * Compute the maximum value of a matrix or a list with values. - * In case of a multi dimensional array, the maximum of the flattened array - * will be calculated. When `dim` is provided, the maximum over the selected - * dimension will be calculated. Parameter `dim` is zero-based. - * - * Syntax: - * - * math.max(a, b, c, ...) - * math.max(A) - * math.max(A, dim) - * - * Examples: - * - * math.max(2, 1, 4, 3); // returns 4 - * math.max([2, 1, 4, 3]); // returns 4 - * - * // maximum over a specified dimension (zero-based) - * math.max([[2, 5], [4, 3], [1, 7]], 0); // returns [4, 7] - * math.max([[2, 5], [4, 3]], [1, 7], 1); // returns [5, 4, 7] - * - * math.max(2.7, 7.1, -4.5, 2.0, 4.1); // returns 7.1 - * math.min(2.7, 7.1, -4.5, 2.0, 4.1); // returns -4.5 - * - * See also: - * - * mean, median, min, prod, std, sum, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The maximum value - */ - math.max = function max(args) { - if (arguments.length == 0) { - throw new SyntaxError('Function max requires one or more parameters (0 provided)'); - } - - if (isCollection(args)) { - if (arguments.length == 1) { - // max([a, b, c, d, ...]) - return _max(args); - } - else if (arguments.length == 2) { - // max([a, b, c, d, ...], dim) - return collection.reduce(arguments[0], arguments[1], _getLarger); - } - else { - throw new SyntaxError('Wrong number of parameters'); - } - } - else { - // max(a, b, c, d, ...) - return _max(arguments); - } - }; - - function _getLarger(x, y){ - return math.larger(x, y) ? x : y; - } - - /** - * Recursively calculate the maximum value in an n-dimensional array - * @param {Array} array - * @return {Number} max - * @private - */ - function _max(array) { - var max = undefined; - - collection.deepForEach(array, function (value) { - if (max === undefined || math.larger(value, max)) { - max = value; - } - }); - - if (max === undefined) { - throw new Error('Cannot calculate max of an empty array'); - } - - return max; - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var larger = load(__webpack_require__(116)); + + /** + * Compute the maximum value of a matrix or a list with values. + * In case of a multi dimensional array, the maximum of the flattened array + * will be calculated. When `dim` is provided, the maximum over the selected + * dimension will be calculated. Parameter `dim` is zero-based. + * + * Syntax: + * + * math.max(a, b, c, ...) + * math.max(A) + * math.max(A, dim) + * + * Examples: + * + * math.max(2, 1, 4, 3); // returns 4 + * math.max([2, 1, 4, 3]); // returns 4 + * + * // maximum over a specified dimension (zero-based) + * math.max([[2, 5], [4, 3], [1, 7]], 0); // returns [4, 7] + * math.max([[2, 5], [4, 3]], [1, 7], 1); // returns [5, 4, 7] + * + * math.max(2.7, 7.1, -4.5, 2.0, 4.1); // returns 7.1 + * math.min(2.7, 7.1, -4.5, 2.0, 4.1); // returns -4.5 + * + * See also: + * + * mean, median, min, prod, std, sum, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The maximum value + */ + return typed('max', { + // max([a, b, c, d, ...]) + 'Array | Matrix': _max, + + // max([a, b, c, d, ...], dim) + 'Array | Matrix, number | BigNumber': function (array, dim) { + return collection.reduce(array, dim.valueOf(), _largest); + }, + + // max(a, b, c, d, ...) + '...': function () { + return _max(arguments); + } + }); + + /** + * Return the largest of two values + * @param {*} x + * @param {*} y + * @returns {*} Returns x when x is largest, or y when y is largest + * @private + */ + function _largest(x, y){ + return larger(x, y) ? x : y; + } + + /** + * Recursively calculate the maximum value in an n-dimensional array + * @param {Array} array + * @return {Number} max + * @private + */ + function _max(array) { + var max = undefined; + + collection.deepForEach(array, function (value) { + if (max === undefined || larger(value, max)) { + max = value; + } + }); + + if (max === undefined) { + throw new Error('Cannot calculate max of an empty array'); + } + + return max; + } + } + + exports.name = 'max'; + exports.factory = factory; /***/ }, /* 122 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - - size = __webpack_require__(167).size, - isArray = Array.isArray; - - /** - * Compute the mean value of matrix or a list with values. - * In case of a multi dimensional array, the mean of the flattened array - * will be calculated. When `dim` is provided, the maximum over the selected - * dimension will be calculated. Parameter `dim` is zero-based. - * - * Syntax: - * - * mean.mean(a, b, c, ...) - * mean.mean(A) - * mean.mean(A, dim) - * - * Examples: - * - * math.mean(2, 1, 4, 3); // returns 2.5 - * math.mean([1, 2.7, 3.2, 4]); // returns 2.725 - * - * math.mean([[2, 5], [6, 3], [1, 7]], 0); // returns [3, 5] - * math.mean([[2, 5], [6, 3], [1, 7]], 1); // returns [3.5, 4.5, 4] - * - * See also: - * - * median, min, max, sum, prod, std, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The mean of all values - */ - math.mean = function mean(args) { - if (arguments.length == 0) { - throw new SyntaxError('Function mean requires one or more parameters (0 provided)'); - } - - if (isCollection(args)) { - if (arguments.length == 1) { - // mean([a, b, c, d, ...]) - return _mean(args); - } - else if (arguments.length == 2) { - // mean([a, b, c, d, ...], dim) - return _nmean(arguments[0], arguments[1]); - } - else { - throw new SyntaxError('Wrong number of parameters'); - } - } - else { - // mean(a, b, c, d, ...) - return _mean(arguments); - } - }; - - /** - * Calculate the mean value in an n-dimensional array, returning a - * n-1 dimensional array - * @param {Array} array - * @param {Number} dim - * @return {Number} mean - * @private - */ - function _nmean(array, dim){ - var sum = collection.reduce(array, dim, math.add); - var s = isArray(array) ? size(array) : array.size(); - return math.divide(sum, s[dim]); - } - - /** - * Recursively calculate the mean value in an n-dimensional array - * @param {Array} array - * @return {Number} mean - * @private - */ - function _mean(array) { - var sum = 0; - var num = 0; - - collection.deepForEach(array, function (value) { - sum = math.add(sum, value); - num++; - }); - - if (num === 0) { - throw new Error('Cannot calculate mean of an empty array'); - } - - return math.divide(sum, num); - } - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var add = load(__webpack_require__(32)); + var divide = load(__webpack_require__(35)); + + /** + * Compute the mean value of matrix or a list with values. + * In case of a multi dimensional array, the mean of the flattened array + * will be calculated. When `dim` is provided, the maximum over the selected + * dimension will be calculated. Parameter `dim` is zero-based. + * + * Syntax: + * + * math.mean(a, b, c, ...) + * math.mean(A) + * math.mean(A, dim) + * + * Examples: + * + * math.mean(2, 1, 4, 3); // returns 2.5 + * math.mean([1, 2.7, 3.2, 4]); // returns 2.725 + * + * math.mean([[2, 5], [6, 3], [1, 7]], 0); // returns [3, 5] + * math.mean([[2, 5], [6, 3], [1, 7]], 1); // returns [3.5, 4.5, 4] + * + * See also: + * + * median, min, max, sum, prod, std, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The mean of all values + */ + return typed('mean', { + // mean([a, b, c, d, ...]) + 'Array | Matrix': _mean, + + // mean([a, b, c, d, ...], dim) + 'Array | Matrix, number | BigNumber': _nmean, + + // mean(a, b, c, d, ...) + '...': function () { + return _mean(arguments); + } + }); + + /** + * Calculate the mean value in an n-dimensional array, returning a + * n-1 dimensional array + * @param {Array} array + * @param {Number} dim + * @return {Number} mean + * @private + */ + function _nmean(array, dim){ + var sum = collection.reduce(array, dim, add); + var s = Array.isArray(array) ? size(array) : array.size(); + return divide(sum, s[dim]); + } + + /** + * Recursively calculate the mean value in an n-dimensional array + * @param {Array} array + * @return {Number} mean + * @private + */ + function _mean(array) { + var sum = 0; + var num = 0; + + collection.deepForEach(array, function (value) { + sum = add(sum, value); + num++; + }); + + if (num === 0) { + throw new Error('Cannot calculate mean of an empty array'); + } + + return divide(sum, num); + } + } + + exports.name = 'mean'; + exports.factory = factory; /***/ }, /* 123 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isNumber = __webpack_require__(3).isNumber, - isCollection = collection.isCollection, - - flatten = __webpack_require__(167).flatten; - - /** - * Compute the median of a matrix or a list with values. The values are - * sorted and the middle value is returned. In case of an even number of - * values, the average of the two middle values is returned. - * Supported types of values are: Number, BigNumber, Unit - * - * In case of a (multi dimensional) array or matrix, the median of all - * elements will be calculated. - * - * Syntax: - * - * mean.median(a, b, c, ...) - * mean.median(A) - * - * Examples: - * - * math.median(5, 2, 7); // returns 5 - * math.median([3, -1, 5, 7]); // returns 4 - * - * See also: - * - * mean, min, max, sum, prod, std, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The median - */ - math.median = function median(args) { - if (arguments.length == 0) { - throw new SyntaxError('Function median requires one or more parameters (0 provided)'); - } - - if (isCollection(args)) { - if (arguments.length == 1) { - // median([a, b, c, d, ...]) - return _median(args.valueOf()); - } - else if (arguments.length == 2) { - // median([a, b, c, d, ...], dim) - // TODO: implement median(A, dim) - throw new Error('median(A, dim) is not yet supported'); - //return collection.reduce(arguments[0], arguments[1], ...); - } - else { - throw new SyntaxError('Wrong number of parameters'); - } - } - else { - // median(a, b, c, d, ...) - return _median(Array.prototype.slice.call(arguments)); - } - }; - - /** - * Recursively calculate the median of an n-dimensional array - * @param {Array} array - * @return {Number} median - * @private - */ - function _median(array) { - var flat = flatten(array); - - flat.sort(math.compare); - - var num = flat.length; - - if (num == 0) { - throw new Error('Cannot calculate median of an empty array'); - } - - if (num % 2 == 0) { - // even: return the average of the two middle values - var left = flat[num / 2 - 1]; - var right = flat[num / 2]; - - if (!isNumber(left) && !(left instanceof BigNumber) && !(left instanceof Unit)) { - throw new math.error.UnsupportedTypeError('median', math['typeof'](left)); - } - if (!isNumber(right) && !(right instanceof BigNumber) && !(right instanceof Unit)) { - throw new math.error.UnsupportedTypeError('median', math['typeof'](right)); - } - - return math.divide(math.add(left, right), 2); - } - else { - // odd: return the middle value - var middle = flat[(num - 1) / 2]; - - if (!isNumber(middle) && !(middle instanceof BigNumber) && !(middle instanceof Unit)) { - throw new math.error.UnsupportedTypeError('median', math['typeof'](middle)); - } - - return middle; - } - } - }; + 'use strict'; + + var flatten = __webpack_require__(172).flatten; + + function factory (type, config, load, typed) { + var add = load(__webpack_require__(32)); + var divide = load(__webpack_require__(35)); + var compare = load(__webpack_require__(113)); + + /** + * Compute the median of a matrix or a list with values. The values are + * sorted and the middle value is returned. In case of an even number of + * values, the average of the two middle values is returned. + * Supported types of values are: Number, BigNumber, Unit + * + * In case of a (multi dimensional) array or matrix, the median of all + * elements will be calculated. + * + * Syntax: + * + * math.median(a, b, c, ...) + * math.median(A) + * + * Examples: + * + * math.median(5, 2, 7); // returns 5 + * math.median([3, -1, 5, 7]); // returns 4 + * + * See also: + * + * mean, min, max, sum, prod, std, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The median + */ + var median = typed('median', { + // median([a, b, c, d, ...]) + 'Array | Matrix': _median, + + // median([a, b, c, d, ...], dim) + 'Array | Matrix, number | BigNumber': function (array, dim) { + // TODO: implement median(A, dim) + throw new Error('median(A, dim) is not yet supported'); + //return collection.reduce(arguments[0], arguments[1], ...); + }, + + // median(a, b, c, d, ...) + '...': function () { + return _median(Array.prototype.slice.call(arguments)); + } + }); + + /** + * Recursively calculate the median of an n-dimensional array + * @param {Array | Matrix} array + * @return {Number} median + * @private + */ + function _median(array) { + var flat = flatten(array.valueOf()); + + flat.sort(compare); + + var num = flat.length; + + if (num == 0) { + throw new Error('Cannot calculate median of an empty array'); + } + + if (num % 2 == 0) { + // even: return the average of the two middle values + return middle2(flat[num / 2 - 1], flat[num / 2]); + } + else { + // odd: return the middle value + return middle(flat[(num - 1) / 2]); + } + } + + // helper function to type check the middle value of the array + var middle = typed('number | BigNumber | Unit', function (value) { + return value; + }); + + // helper function to type check the two middle value of the array + var middle2 = typed('number | BigNumber | Unit, number | BigNumber | Unit', function (left, right) { + return divide(add(left, right), 2); + }); + + return median; + } + + exports.name = 'median'; + exports.factory = factory; /***/ }, /* 124 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7), - collection = __webpack_require__(14), - - isCollection = collection.isCollection; - - /** - * Compute the product of a matrix or a list with values. - * In case of a (multi dimensional) array or matrix, the sum of all - * elements will be calculated. - * - * Syntax: - * - * math.prod(a, b, c, ...) - * math.prod(A) - * - * Examples: - * - * math.multiply(2, 3); // returns 6 - * math.prod(2, 3); // returns 6 - * math.prod(2, 3, 4); // returns 24 - * math.prod([2, 3, 4]); // returns 24 - * math.prod([[2, 5], [4, 3]]); // returns 120 - * - * See also: - * - * mean, median, min, max, sum, std, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The product of all values - */ - math.prod = function prod(args) { - if (arguments.length == 0) { - throw new SyntaxError('Function prod requires one or more parameters (0 provided)'); - } - - if (isCollection(args)) { - if (arguments.length == 1) { - // prod([a, b, c, d, ...]) - return _prod(args); - } - else if (arguments.length == 2) { - // prod([a, b, c, d, ...], dim) - // TODO: implement prod(A, dim) - throw new Error('prod(A, dim) is not yet supported'); - //return collection.reduce(arguments[0], arguments[1], math.prod); - } - else { - throw new SyntaxError('Wrong number of parameters'); - } - } - else { - // prod(a, b, c, d, ...) - return _prod(arguments); - } - }; - - /** - * Recursively calculate the product of an n-dimensional array - * @param {Array} array - * @return {Number} prod - * @private - */ - function _prod(array) { - var prod = undefined; - - collection.deepForEach(array, function (value) { - prod = (prod === undefined) ? value : math.multiply(prod, value); - }); - - if (prod === undefined) { - throw new Error('Cannot calculate prod of an empty array'); - } - - return prod; - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var smaller = load(__webpack_require__(118)); + + /** + * Compute the maximum value of a matrix or a list of values. + * In case of a multi dimensional array, the maximum of the flattened array + * will be calculated. When `dim` is provided, the maximum over the selected + * dimension will be calculated. Parameter `dim` is zero-based. + * + * Syntax: + * + * math.min(a, b, c, ...) + * math.min(A) + * math.min(A, dim) + * + * Examples: + * + * math.min(2, 1, 4, 3); // returns 1 + * math.min([2, 1, 4, 3]); // returns 1 + * + * // maximum over a specified dimension (zero-based) + * math.min([[2, 5], [4, 3], [1, 7]], 0); // returns [1, 3] + * math.min([[2, 5], [4, 3], [1, 7]], 1); // returns [2, 3, 1] + * + * math.max(2.7, 7.1, -4.5, 2.0, 4.1); // returns 7.1 + * math.min(2.7, 7.1, -4.5, 2.0, 4.1); // returns -4.5 + * + * See also: + * + * mean, median, max, prod, std, sum, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The minimum value + */ + return typed('min', { + // min([a, b, c, d, ...]) + 'Array | Matrix': _min, + + // min([a, b, c, d, ...], dim) + 'Array | Matrix, number | BigNumber': function (array, dim) { + return collection.reduce(array, dim.valueOf(), _smallest); + }, + + // min(a, b, c, d, ...) + '...': function () { + return _min(arguments); + } + }); + + /** + * Return the smallest of two values + * @param {*} x + * @param {*} y + * @returns {*} Returns x when x is smallest, or y when y is smallest + * @private + */ + function _smallest(x, y) { + return smaller(x, y) ? x : y; + } + + /** + * Recursively calculate the minimum value in an n-dimensional array + * @param {Array} array + * @return {Number} min + * @private + */ + function _min(array) { + var min = undefined; + + collection.deepForEach(array, function (value) { + if (min === undefined || smaller(value, min)) { + min = value; + } + }); + + if (min === undefined) { + throw new Error('Cannot calculate min of an empty array'); + } + + return min; + } + } + + exports.name = 'min'; + exports.factory = factory; /***/ }, /* 125 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - - - /** - * Compute the standard deviation of a matrix or a list with values. - * The standard deviations is defined as the square root of the variance: - * `std(A) = sqrt(var(A))`. - * In case of a (multi dimensional) array or matrix, the standard deviation - * over all elements will be calculated. - * - * Optionally, the type of normalization can be specified as second - * parameter. The parameter `normalization` can be one of the following values: - * - * - 'unbiased' (default) The sum of squared errors is divided by (n - 1) - * - 'uncorrected' The sum of squared errors is divided by n - * - 'biased' The sum of squared errors is divided by (n + 1) - * - * Syntax: - * - * math.std(a, b, c, ...) - * math.std(A) - * math.std(A, normalization) - * - * Examples: - * - * math.std(2, 4, 6); // returns 2 - * math.std([2, 4, 6, 8]); // returns 2.581988897471611 - * math.std([2, 4, 6, 8], 'uncorrected'); // returns 2.23606797749979 - * math.std([2, 4, 6, 8], 'biased'); // returns 2 - * - * math.std([[1, 2, 3], [4, 5, 6]]); // returns 1.8708286933869707 - * - * See also: - * - * mean, median, max, min, prod, sum, var - * - * @param {Array | Matrix} array - * A single matrix or or multiple scalar values - * @param {String} [normalization='unbiased'] - * Determines how to normalize the variance. - * Choose 'unbiased' (default), 'uncorrected', or 'biased'. - * @return {*} The standard deviation - */ - math.std = function std(array, normalization) { - if (arguments.length == 0) { - throw new SyntaxError('Function std requires one or more parameters (0 provided)'); - } - - var variance = math['var'].apply(null, arguments); - return math.sqrt(variance); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var multiply = load(__webpack_require__(47)); + + /** + * Compute the product of a matrix or a list with values. + * In case of a (multi dimensional) array or matrix, the sum of all + * elements will be calculated. + * + * Syntax: + * + * math.prod(a, b, c, ...) + * math.prod(A) + * + * Examples: + * + * math.multiply(2, 3); // returns 6 + * math.prod(2, 3); // returns 6 + * math.prod(2, 3, 4); // returns 24 + * math.prod([2, 3, 4]); // returns 24 + * math.prod([[2, 5], [4, 3]]); // returns 120 + * + * See also: + * + * mean, median, min, max, sum, std, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The product of all values + */ + return typed('prod', { + // prod([a, b, c, d, ...]) + 'Array | Matrix': _prod, + + // prod([a, b, c, d, ...], dim) + 'Array | Matrix, number | BigNumber': function (array, dim) { + // TODO: implement prod(A, dim) + throw new Error('prod(A, dim) is not yet supported'); + //return collection.reduce(arguments[0], arguments[1], math.prod); + }, + + // prod(a, b, c, d, ...) + '...': function () { + return _prod(arguments); + } + }); + + /** + * Recursively calculate the product of an n-dimensional array + * @param {Array} array + * @return {Number} prod + * @private + */ + function _prod(array) { + var prod = undefined; + + collection.deepForEach(array, function (value) { + prod = (prod === undefined) ? value : multiply(prod, value); + }); + + if (prod === undefined) { + throw new Error('Cannot calculate prod of an empty array'); + } + + return prod; + } + } + + exports.name = 'prod'; + exports.factory = factory; /***/ }, /* 126 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var collection = __webpack_require__(14); - var add = __webpack_require__(36)(config); - - /** - * Compute the sum of a matrix or a list with values. - * In case of a (multi dimensional) array or matrix, the sum of all - * elements will be calculated. - * - * Syntax: - * - * math.sum(a, b, c, ...) - * math.sum(A) - * - * Examples: - * - * math.sum(2, 1, 4, 3); // returns 10 - * math.sum([2, 1, 4, 3]); // returns 10 - * math.sum([[2, 5], [4, 3], [1, 7]]); // returns 22 - * - * See also: - * - * mean, median, min, max, prod, std, var - * - * @param {... *} args A single matrix or or multiple scalar values - * @return {*} The sum of all values - */ - return typed('sum', { - 'Array | Matrix': function (args) { - // sum([a, b, c, d, ...]) - return _sum(args); - }, - - 'Array | Matrix, number | BigNumber': function () { - // sum([a, b, c, d, ...], dim) - // TODO: implement sum(A, dim) - throw new Error('sum(A, dim) is not yet supported'); - }, - - '...': function () { - // sum(a, b, c, d, ...) - return _sum(arguments); - } - }); - - /** - * Recursively calculate the sum of an n-dimensional array - * @param {Array} array - * @return {Number} sum - * @private - */ - function _sum(array) { - var sum = undefined; - - collection.deepForEach(array, function (value) { - sum = (sum === undefined) ? value : add(sum, value); - }); - - if (sum === undefined) { - throw new Error('Cannot calculate sum of an empty array'); - } - return sum; - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var sqrt = load(__webpack_require__(53)); + var variance = load(__webpack_require__(128)); + + /** + * Compute the standard deviation of a matrix or a list with values. + * The standard deviations is defined as the square root of the variance: + * `std(A) = sqrt(var(A))`. + * In case of a (multi dimensional) array or matrix, the standard deviation + * over all elements will be calculated. + * + * Optionally, the type of normalization can be specified as second + * parameter. The parameter `normalization` can be one of the following values: + * + * - 'unbiased' (default) The sum of squared errors is divided by (n - 1) + * - 'uncorrected' The sum of squared errors is divided by n + * - 'biased' The sum of squared errors is divided by (n + 1) + * + * Syntax: + * + * math.std(a, b, c, ...) + * math.std(A) + * math.std(A, normalization) + * + * Examples: + * + * math.std(2, 4, 6); // returns 2 + * math.std([2, 4, 6, 8]); // returns 2.581988897471611 + * math.std([2, 4, 6, 8], 'uncorrected'); // returns 2.23606797749979 + * math.std([2, 4, 6, 8], 'biased'); // returns 2 + * + * math.std([[1, 2, 3], [4, 5, 6]]); // returns 1.8708286933869707 + * + * See also: + * + * mean, median, max, min, prod, sum, var + * + * @param {Array | Matrix} array + * A single matrix or or multiple scalar values + * @param {String} [normalization='unbiased'] + * Determines how to normalize the variance. + * Choose 'unbiased' (default), 'uncorrected', or 'biased'. + * @return {*} The standard deviation + */ + return typed('std', { + // std([a, b, c, d, ...]) + 'Array | Matrix': _std, + + // std([a, b, c, d, ...], normalization) + 'Array | Matrix, string': _std, + + // std(a, b, c, d, ...) + '...': function () { + return _std(Array.prototype.slice.call(arguments)); + } + }); + + function _std(array, normalization) { + if (array.length == 0) { + throw new SyntaxError('Function std requires one or more parameters (0 provided)'); + } + + return sqrt(variance.apply(null, arguments)); + } + } + + exports.name = 'std'; + exports.factory = factory; /***/ }, /* 127 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7), - BigNumber = math.type.BigNumber, - collection = __webpack_require__(14), - - isCollection = collection.isCollection, - isString = __webpack_require__(205).isString, - - DEFAULT_NORMALIZATION = 'unbiased'; - - /** - * Compute the variance of a matrix or a list with values. - * In case of a (multi dimensional) array or matrix, the variance over all - * elements will be calculated. - * - * Optionally, the type of normalization can be specified as second - * parameter. The parameter `normalization` can be one of the following values: - * - * - 'unbiased' (default) The sum of squared errors is divided by (n - 1) - * - 'uncorrected' The sum of squared errors is divided by n - * - 'biased' The sum of squared errors is divided by (n + 1) - - * Note that older browser may not like the variable name `var`. In that - * case, the function can be called as `math['var'](...)` instead of - * `math.var(...)`. - * - * Syntax: - * - * math.var(a, b, c, ...) - * math.var(A) - * math.var(A, normalization) - * - * Examples: - * - * math.var(2, 4, 6); // returns 4 - * math.var([2, 4, 6, 8]); // returns 6.666666666666667 - * math.var([2, 4, 6, 8], 'uncorrected'); // returns 5 - * math.var([2, 4, 6, 8], 'biased'); // returns 4 - * - * math.var([[1, 2, 3], [4, 5, 6]]); // returns 3.5 - * - * See also: - * - * mean, median, max, min, prod, std, sum - * - * @param {Array | Matrix} array - * A single matrix or or multiple scalar values - * @param {String} [normalization='unbiased'] - * Determines how to normalize the variance. - * Choose 'unbiased' (default), 'uncorrected', or 'biased'. - * @return {*} The variance - */ - math['var'] = function variance(array, normalization) { - if (arguments.length == 0) { - throw new SyntaxError('Function var requires one or more parameters (0 provided)'); - } - - if (isCollection(array)) { - if (arguments.length == 1) { - // var([a, b, c, d, ...]) - return _var(array, DEFAULT_NORMALIZATION); - } - else if (arguments.length == 2) { - // var([a, b, c, d, ...], normalization) - - if (!isString(normalization)) { - throw new Error('String expected for parameter normalization'); - } - - return _var(array, normalization); - } - /* TODO: implement var(A [, normalization], dim) - else if (arguments.length == 3) { - // var([a, b, c, d, ...], dim) - // var([a, b, c, d, ...], normalization, dim) - //return collection.reduce(arguments[0], arguments[1], ...); - } - */ - else { - throw new SyntaxError('Wrong number of parameters'); - } - } - else { - // var(a, b, c, d, ...) - return _var(arguments, DEFAULT_NORMALIZATION); - } - }; - - /** - * Recursively calculate the variance of an n-dimensional array - * @param {Array} array - * @param {String} normalization - * Determines how to normalize the variance: - * - 'unbiased' The sum of squared errors is divided by (n - 1) - * - 'uncorrected' The sum of squared errors is divided by n - * - 'biased' The sum of squared errors is divided by (n + 1) - * @return {Number | BigNumber} variance - * @private - */ - function _var(array, normalization) { - var sum = 0; - var num = 0; - - // calculate the mean and number of elements - collection.deepForEach(array, function (value) { - sum = math.add(sum, value); - num++; - }); - if (num === 0) throw new Error('Cannot calculate var of an empty array'); - - var mean = math.divide(sum, num); - - // calculate the variance - sum = 0; - collection.deepForEach(array, function (value) { - var diff = math.subtract(value, mean); - sum = math.add(sum, math.multiply(diff, diff)); - }); - - switch (normalization) { - case 'uncorrected': - return math.divide(sum, num); - - case 'biased': - return math.divide(sum, num + 1); - - case 'unbiased': - var zero = (sum instanceof BigNumber) ? new BigNumber(0) : 0; - return (num == 1) ? zero : math.divide(sum, num - 1); - - default: - throw new Error('Unknown normalization "' + normalization + '". ' + - 'Choose "unbiased" (default), "uncorrected", or "biased".'); - } - } - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var add = load(__webpack_require__(32)); + + /** + * Compute the sum of a matrix or a list with values. + * In case of a (multi dimensional) array or matrix, the sum of all + * elements will be calculated. + * + * Syntax: + * + * math.sum(a, b, c, ...) + * math.sum(A) + * + * Examples: + * + * math.sum(2, 1, 4, 3); // returns 10 + * math.sum([2, 1, 4, 3]); // returns 10 + * math.sum([[2, 5], [4, 3], [1, 7]]); // returns 22 + * + * See also: + * + * mean, median, min, max, prod, std, var + * + * @param {... *} args A single matrix or or multiple scalar values + * @return {*} The sum of all values + */ + return typed('sum', { + 'Array | Matrix': function (args) { + // sum([a, b, c, d, ...]) + return _sum(args); + }, + + 'Array | Matrix, number | BigNumber': function () { + // sum([a, b, c, d, ...], dim) + // TODO: implement sum(A, dim) + throw new Error('sum(A, dim) is not yet supported'); + }, + + '...': function () { + // sum(a, b, c, d, ...) + return _sum(arguments); + } + }); + + /** + * Recursively calculate the sum of an n-dimensional array + * @param {Array} array + * @return {Number} sum + * @private + */ + function _sum(array) { + var sum = undefined; + + collection.deepForEach(array, function (value) { + sum = (sum === undefined) ? value : add(sum, value); + }); + + if (sum === undefined) { + throw new Error('Cannot calculate sum of an empty array'); + } + return sum; + } + } + + exports.name = 'sum'; + exports.factory = factory; /***/ }, /* 128 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcCos = util.bignumber.arccos_arcsec; - - /** - * Calculate the inverse cosine of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acos(x) - * - * Examples: - * - * math.acos(0.5); // returns Number 1.0471975511965979 - * math.acos(math.cos(1.5)); // returns Number 1.5 - * - * math.acos(2); // returns Complex 0 + 1.3169578969248166 i - * - * See also: - * - * cos, atan, asin - * - * @param {Number | BigNumber Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} The arc cosine of x - */ - math.acos = function acos(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acos', arguments.length, 1); - } - - if (isNumber(x)) { - if (x >= -1 && x <= 1) { - return Math.acos(x); - } - else { - return acos(new Complex(x, 0)); - } - } - - if (isComplex(x)) { - // acos(z) = 0.5*pi + i*log(iz + sqrt(1-z^2)) - var temp1 = new Complex( - x.im * x.im - x.re * x.re + 1.0, - -2.0 * x.re * x.im - ); - var temp2 = math.sqrt(temp1); - var temp3 = new Complex( - temp2.re - x.im, - temp2.im + x.re - ); - var temp4 = math.log(temp3); - - // 0.5*pi = 1.5707963267948966192313216916398 - return new Complex( - 1.57079632679489661923 - temp4.im, - temp4.re - ); - } - - if (isCollection(x)) { - return collection.deepMap(x, acos); - } - - if (isBoolean(x) || x === null) { - return Math.acos(x); - } - - if (x instanceof BigNumber) { - return bigArcCos(x, BigNumber, false); - } - - throw new math.error.UnsupportedTypeError('acos', math['typeof'](x)); - }; - }; + 'use strict'; + + var DEFAULT_NORMALIZATION = 'unbiased'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var add = load(__webpack_require__(32)); + var subtract = load(__webpack_require__(55)); + var multiply = load(__webpack_require__(47)); + var divide = load(__webpack_require__(35)); + + /** + * Compute the variance of a matrix or a list with values. + * In case of a (multi dimensional) array or matrix, the variance over all + * elements will be calculated. + * + * Optionally, the type of normalization can be specified as second + * parameter. The parameter `normalization` can be one of the following values: + * + * - 'unbiased' (default) The sum of squared errors is divided by (n - 1) + * - 'uncorrected' The sum of squared errors is divided by n + * - 'biased' The sum of squared errors is divided by (n + 1) + + * Note that older browser may not like the variable name `var`. In that + * case, the function can be called as `math['var'](...)` instead of + * `math.var(...)`. + * + * Syntax: + * + * math.var(a, b, c, ...) + * math.var(A) + * math.var(A, normalization) + * + * Examples: + * + * math.var(2, 4, 6); // returns 4 + * math.var([2, 4, 6, 8]); // returns 6.666666666666667 + * math.var([2, 4, 6, 8], 'uncorrected'); // returns 5 + * math.var([2, 4, 6, 8], 'biased'); // returns 4 + * + * math.var([[1, 2, 3], [4, 5, 6]]); // returns 3.5 + * + * See also: + * + * mean, median, max, min, prod, std, sum + * + * @param {Array | Matrix} array + * A single matrix or or multiple scalar values + * @param {String} [normalization='unbiased'] + * Determines how to normalize the variance. + * Choose 'unbiased' (default), 'uncorrected', or 'biased'. + * @return {*} The variance + */ + return typed('variance', { + // var([a, b, c, d, ...]) + 'Array | Matrix': function (array) { + return _var(array, DEFAULT_NORMALIZATION); + }, + + // var([a, b, c, d, ...], normalization) + 'Array | Matrix, string': _var, + + // var(a, b, c, d, ...) + '...': function () { + return _var(arguments, DEFAULT_NORMALIZATION); + } + }); + + /** + * Recursively calculate the variance of an n-dimensional array + * @param {Array} array + * @param {String} normalization + * Determines how to normalize the variance: + * - 'unbiased' The sum of squared errors is divided by (n - 1) + * - 'uncorrected' The sum of squared errors is divided by n + * - 'biased' The sum of squared errors is divided by (n + 1) + * @return {Number | BigNumber} variance + * @private + */ + function _var(array, normalization) { + var sum = 0; + var num = 0; + + if (array.length == 0) { + throw new SyntaxError('Function var requires one or more parameters (0 provided)'); + } + + // calculate the mean and number of elements + collection.deepForEach(array, function (value) { + sum = add(sum, value); + num++; + }); + if (num === 0) throw new Error('Cannot calculate var of an empty array'); + + var mean = divide(sum, num); + + // calculate the variance + sum = 0; + collection.deepForEach(array, function (value) { + var diff = subtract(value, mean); + sum = add(sum, multiply(diff, diff)); + }); + + switch (normalization) { + case 'uncorrected': + return divide(sum, num); + + case 'biased': + return divide(sum, num + 1); + + case 'unbiased': + var zero = (sum instanceof type.BigNumber) ? new type.BigNumber(0) : 0; + return (num == 1) ? zero : divide(sum, num - 1); + + default: + throw new Error('Unknown normalization "' + normalization + '". ' + + 'Choose "unbiased" (default), "uncorrected", or "biased".'); + } + } + } + + exports.name = 'var'; + exports.factory = factory; /***/ }, /* 129 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAcosh = util.bignumber.acosh_asinh_asech_acsch; - - /** - * Calculate the hyperbolic arccos of a value, - * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acosh(x) - * - * Examples: - * - * math.acosh(1.5); // returns 0.9624236501192069 - * - * See also: - * - * cosh, asinh, atanh - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arccosine of x - */ - math.acosh = function acosh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acosh', arguments.length, 1); - } - - if (isNumber(x)) { - if (x >= 1) { - return Math.log(Math.sqrt(x*x - 1) + x); - } - if (x <= -1) { - return new Complex(Math.log(Math.sqrt(x*x - 1) - x), Math.PI); - } - return acosh(new Complex(x, 0)); - } - - if (isComplex(x)) { - // acosh(z) = (-acos(z).im, acos(z).re) for acos(z).im <= 0 - // ( acos(z).im, -acos(z).re) otherwise - var temp; - var acos = math.acos(x); - if (acos.im <= 0) { - temp = acos.re; - acos.re = -acos.im; - acos.im = temp; - } else { - temp = acos.im; - acos.im = -acos.re; - acos.re = temp; - } - - return acos; - } - - if (isCollection(x)) { - return collection.deepMap(x, acosh); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0 : new Complex(0, 1.5707963267948966); - } - - if (x instanceof BigNumber) { - return bigAcosh(x, BigNumber, false, false); - } - - throw new math.error.UnsupportedTypeError('acosh', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigArcCos = __webpack_require__(214).arccos_arcsec; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexSqrt = load(__webpack_require__(53)).signatures['Complex']; + var complexLog = load(__webpack_require__(44)).signatures['Complex']; + + /** + * Calculate the inverse cosine of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acos(x) + * + * Examples: + * + * math.acos(0.5); // returns Number 1.0471975511965979 + * math.acos(math.cos(1.5)); // returns Number 1.5 + * + * math.acos(2); // returns Complex 0 + 1.3169578969248166 i + * + * See also: + * + * cos, atan, asin + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} The arc cosine of x + */ + var acos = typed('acos', { + 'number': function (x) { + if (x >= -1 && x <= 1) { + return Math.acos(x); + } + else { + return _complexAcos(new type.Complex(x, 0)); + } + }, + + 'Complex': _complexAcos, + + 'BigNumber': function (x) { + return bigArcCos(x, type.BigNumber, false); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acos); + } + }); + + /** + * Calculate acos for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAcos(x) { + // acos(z) = 0.5*pi + i*log(iz + sqrt(1-z^2)) + var temp1 = new type.Complex( + x.im * x.im - x.re * x.re + 1.0, + -2.0 * x.re * x.im + ); + var temp2 = complexSqrt(temp1); + var temp3 = new type.Complex( + temp2.re - x.im, + temp2.im + x.re + ); + var temp4 = complexLog(temp3); + + // 0.5*pi = 1.5707963267948966192313216916398 + return new type.Complex( + 1.57079632679489661923 - temp4.im, + temp4.re + ); + } + + return acos; + } + + exports.name = 'acos'; + exports.factory = factory; /***/ }, /* 130 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcCot = util.bignumber.arctan_arccot; - - /** - * Calculate the inverse cotangent of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acot(x) - * - * Examples: - * - * math.acot(0.5); // returns Number 0.4636476090008061 - * math.acot(math.cot(1.5)); // returns Number 1.5 - * - * math.acot(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i - * - * See also: - * - * cot, atan - * - * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} The arc cotangent of x - */ - math.acot = function acot(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acot', arguments.length, 1); - } - - if (isNumber(x)) { - return (x) ? Math.atan(1 / x) : halfPi; - } - - if (isComplex(x)) { - if (x.im == 0) { - return new Complex(x.re ? Math.atan(1 / x.re) : halfPi, 0); - } - - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re = x.re / den, - x.im = -x.im / den) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0); - - return math.atan(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, acot); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0.7853981633974483 : halfPi; - } - - if (x instanceof BigNumber) { - return bigArcCot(x, BigNumber, true); - } - - throw new math.error.UnsupportedTypeError('acot', math['typeof'](x)); - }; - - var halfPi = 1.5707963267948966; - }; + 'use strict'; + + var bigAcosh = __webpack_require__(214).acosh_asinh_asech_acsch; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexAcos = load(__webpack_require__(129)).signatures['Complex']; + + /** + * Calculate the hyperbolic arccos of a value, + * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acosh(x) + * + * Examples: + * + * math.acosh(1.5); // returns 0.9624236501192069 + * + * See also: + * + * cosh, asinh, atanh + * + * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arccosine of x + */ + var acosh = typed('acosh', { + 'number': function (x) { + if (x >= 1) { + return Math.log(Math.sqrt(x*x - 1) + x); + } + if (x <= -1) { + return new type.Complex(Math.log(Math.sqrt(x*x - 1) - x), Math.PI); + } + return _complexAcosh(new type.Complex(x, 0)); + }, + + 'Complex': _complexAcosh, + + 'BigNumber': function (x) { + return bigAcosh(x, type.BigNumber, false, false); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acosh); + } + }); + + /** + * Calculate acosh for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAcosh(x) { + // acosh(z) = (-acos(z).im, acos(z).re) for acos(z).im <= 0 + // ( acos(z).im, -acos(z).re) otherwise + var temp; + var res = complexAcos(x); + if (res.im <= 0) { + temp = res.re; + res.re = -res.im; + res.im = temp; + } else { + temp = res.im; + res.im = -res.re; + res.re = temp; + } + + return res; + } + + return acosh; + } + + exports.name = 'acosh'; + exports.factory = factory; /***/ }, /* 131 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAcoth = util.bignumber.atanh_acoth; - - /** - * Calculate the hyperbolic arccotangent of a value, - * defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acoth(x) - * - * Examples: - * - * math.acoth(0.5); // returns 0.8047189562170503 - * - * See also: - * - * acsch, asech - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arccotangent of x - */ - math.acoth = function acoth(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acoth', arguments.length, 1); - } - - if (isNumber(x)) { - if (x >= 1 || x <= -1) { - return isFinite(x) ? (Math.log((x+1)/x) + Math.log(x/(x-1))) / 2 : 0; - } - return (x) ? acoth(new Complex(x, 0)) : new Complex(0, halfPi); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return new Complex(0, halfPi); - } - - // acoth(z) = -i*atanh(1/z) - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re / den, - -x.im / den - ) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0 - ); - - return math.atanh(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, acoth); - } - - if (isBoolean(x) || x === null) { - return (x) ? Infinity : new Complex(0, halfPi); - } - - if (x instanceof BigNumber) { - return bigAcoth(x, BigNumber, true); - } - - throw new math.error.UnsupportedTypeError('acoth', math['typeof'](x)); - }; - - var halfPi = 1.5707963267948966; - }; + 'use strict'; + + var bigArcCot = __webpack_require__(214).arctan_arccot; + + var HALF_PI = 1.5707963267948966; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexAtan = load(__webpack_require__(139)).signatures['Complex']; + + /** + * Calculate the inverse cotangent of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acot(x) + * + * Examples: + * + * math.acot(0.5); // returns Number 0.4636476090008061 + * math.acot(math.cot(1.5)); // returns Number 1.5 + * + * math.acot(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i + * + * See also: + * + * cot, atan + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} The arc cotangent of x + */ + var acot = typed('acot', { + 'number': function (x) { + return (x) ? Math.atan(1 / x) : HALF_PI; + }, + + 'Complex': function (x) { + if (x.im == 0) { + return new type.Complex(x.re ? Math.atan(1 / x.re) : HALF_PI, 0); + } + + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re = x.re / den, + x.im = -x.im / den) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0); + + return complexAtan(x); + }, + + 'BigNumber': function (x) { + return bigArcCot(x, type.BigNumber, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acot); + } + }); + + return acot; + } + + exports.name = 'acot'; + exports.factory = factory; /***/ }, /* 132 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcCsc = util.bignumber.arcsin_arccsc; - - /** - * Calculate the inverse cosecant of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acsc(x) - * - * Examples: - * - * math.acsc(0.5); // returns Number 0.5235987755982989 - * math.acsc(math.csc(1.5)); // returns Number ~1.5 - * - * math.acsc(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i - * - * See also: - * - * csc, asin, asec - * - * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} The arc cosecant of x - */ - math.acsc = function acsc(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acsc', arguments.length, 1); - } - - if (isNumber(x)) { - if (x <= -1 || x >= 1) { - return Math.asin(1 / x); - } - return acsc(new Complex(x, 0)); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return new Complex(halfPi, Infinity); - } - - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re = x.re / den, - x.im = -x.im / den) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0); - - return math.asin(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, acsc); - } - - if (isBoolean(x) || x === null) { - return (x) ? halfPi : new Complex(halfPi, Infinity); - } - - if (x instanceof BigNumber) { - return bigArcCsc(x, BigNumber, true); - } - - throw new math.error.UnsupportedTypeError('acsc', math['typeof'](x)); - }; - - var halfPi = 1.5707963267948966; - }; + 'use strict'; + + var bigAcoth = __webpack_require__(214).atanh_acoth; + + var HALF_PI = 1.5707963267948966; + + function factory (type, config, load, typed) { + var atanh = load(__webpack_require__(141)).signatures['Complex']; + var collection = load(__webpack_require__(2)); + + /** + * Calculate the hyperbolic arccotangent of a value, + * defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acoth(x) + * + * Examples: + * + * math.acoth(0.5); // returns 0.8047189562170503 + * + * See also: + * + * acsch, asech + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arccotangent of x + */ + var acoth = typed('acoth', { + 'number': function (x) { + if (x >= 1 || x <= -1) { + return isFinite(x) ? (Math.log((x+1)/x) + Math.log(x/(x-1))) / 2 : 0; + } + return x !== 0 ? _complexAcoth(new type.Complex(x, 0)) : new type.Complex(0, HALF_PI); + }, + + 'Complex': _complexAcoth, + + 'BigNumber': function (x) { + return bigAcoth(x, type.BigNumber, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acoth); + } + }); + + /** + * Calculate the hyperbolic arccotangent of a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAcoth (x) { + if (x.re == 0 && x.im == 0) { + return new type.Complex(0, HALF_PI); + } + + // acoth(z) = -i*atanh(1/z) + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re / den, + -x.im / den + ) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0 + ); + + return atanh(x); + } + + return acoth; + } + + exports.name = 'acoth'; + exports.factory = factory; /***/ }, /* 133 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAcsch = util.bignumber.acosh_asinh_asech_acsch; - - /** - * Calculate the hyperbolic arccosecant of a value, - * defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.acsch(x) - * - * Examples: - * - * math.acsch(0.5); // returns 1.4436354751788103 - * - * See also: - * - * asech, acoth - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arccosecant of x - */ - math.acsch = function acsch(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('acsch', arguments.length, 1); - } - - if (isNumber(x)) { - x = 1 / x; - return Math.log(x + Math.sqrt(x*x + 1)); - } - - if (isComplex(x)) { - if (x.im == 0) { - x = (x.re != 0) - ? Math.log(x.re + Math.sqrt(x.re*x.re + 1)) - : Infinity; - return new Complex(x, 0); - } - - // acsch(z) = -i*asinh(1/z) - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re / den, - -x.im / den - ) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0 - ); - - return math.asinh(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, acsch); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0.881373587019543 : Infinity; - } - - if (x instanceof BigNumber) { - return bigAcsch(x, BigNumber, true, true); - } - - throw new math.error.UnsupportedTypeError('acsch', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigArcCsc = __webpack_require__(214).arcsin_arccsc; + + var HALF_PI = 1.5707963267948966; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexAsin = load(__webpack_require__(137)).signatures['Complex']; + + /** + * Calculate the inverse cosecant of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acsc(x) + * + * Examples: + * + * math.acsc(0.5); // returns Number 0.5235987755982989 + * math.acsc(math.csc(1.5)); // returns Number ~1.5 + * + * math.acsc(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i + * + * See also: + * + * csc, asin, asec + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} The arc cosecant of x + */ + var acsc = typed('acsc', { + 'number': function (x) { + if (x <= -1 || x >= 1) { + return Math.asin(1 / x); + } + return _complexAcsc(new type.Complex(x, 0)); + }, + + 'Complex': _complexAcsc, + + 'BigNumber': function (x) { + return bigArcCsc(x, type.BigNumber, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acsc); + } + }); + + /** + * Calculate acsc for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAcsc (x) { + if (x.re == 0 && x.im == 0) { + return new type.Complex(HALF_PI, Infinity); + } + + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re = x.re / den, + x.im = -x.im / den) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0); + + return complexAsin(x); + } + + return acsc; + } + + exports.name = 'acsc'; + exports.factory = factory; /***/ }, /* 134 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcSec = util.bignumber.arccos_arcsec; - - /** - * Calculate the inverse secant of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.asec(x) - * - * Examples: - * - * math.asec(0.5); // returns 1.0471975511965979 - * math.asec(math.sec(1.5)); // returns 1.5 - * - * math.asec(2); // returns 0 + 1.3169578969248166 i - * - * See also: - * - * acos, acot, acsc - * - * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} The arc secant of x - */ - math.asec = function asec(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('asec', arguments.length, 1); - } - - if (isNumber(x)) { - if (x <= -1 || x >= 1) { - return Math.acos(1 / x); - } - return asec(new Complex(x, 0)); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return new Complex(0, Infinity); - } - - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re = x.re / den, - x.im = -x.im / den) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0); - - return math.acos(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, asec); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0 : new Complex(0, Infinity); - } - - if (x instanceof BigNumber) { - return bigArcSec(x, BigNumber, true); - } - - throw new math.error.UnsupportedTypeError('asec', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigAcsch = __webpack_require__(214).acosh_asinh_asech_acsch; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var asinh = load(__webpack_require__(138)).signatures['Complex']; + + /** + * Calculate the hyperbolic arccosecant of a value, + * defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.acsch(x) + * + * Examples: + * + * math.acsch(0.5); // returns 1.4436354751788103 + * + * See also: + * + * asech, acoth + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arccosecant of x + */ + var acsch = typed('acsch', { + 'number': function (x) { + x = 1 / x; + return Math.log(x + Math.sqrt(x*x + 1)); + }, + + 'Complex': function (x) { + if (x.im == 0) { + x = (x.re != 0) + ? Math.log(x.re + Math.sqrt(x.re*x.re + 1)) + : Infinity; + return new type.Complex(x, 0); + } + + // acsch(z) = -i*asinh(1/z) + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re / den, + -x.im / den + ) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0 + ); + + return asinh(x); + }, + + 'BigNumber': function (x) { + return bigAcsch(x, type.BigNumber, true, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, acsch); + } + }); + + return acsch; + } + + exports.name = 'acsch'; + exports.factory = factory; /***/ }, /* 135 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAsech = util.bignumber.acosh_asinh_asech_acsch; - - /** - * Calculate the hyperbolic arccos of a value, - * defined as `asech(x) = ln(sqrt(1/x^2 - 1) + 1/x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.asech(x) - * - * Examples: - * - * math.asech(0.5); // returns 1.3169578969248166 - * - * See also: - * - * acsch, acoth - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arcsecant of x - */ - math.asech = function asech(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('asech', arguments.length, 1); - } - - if (isNumber(x)) { - if (x <= 1 && x >= -1) { - x = 1 / x; - - var ret = Math.sqrt(x*x - 1); - if (x > 0) { - return Math.log(ret + x); - } - - return new Complex(Math.log(ret - x), Math.PI); - } - - return asech(new Complex(x, 0)); - } - - if (isComplex(x)) { - if (x.re == 0 && x.im == 0) { - return new Complex(Infinity, 0); - } - - // acsch(z) = -i*asinh(1/z) - var den = x.re*x.re + x.im*x.im; - x = (den != 0) - ? new Complex( - x.re / den, - -x.im / den - ) - : new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? -(x.im / 0) : 0 - ); - - return math.acosh(x); - } - - if (isCollection(x)) { - return collection.deepMap(x, asech); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0 : Infinity; - } - - if (x instanceof BigNumber) { - return bigAsech(x, BigNumber, false, true); - } - - throw new math.error.UnsupportedTypeError('asech', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigArcSec = __webpack_require__(214).arccos_arcsec; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexAcos = load(__webpack_require__(129)).signatures['Complex']; + + /** + * Calculate the inverse secant of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.asec(x) + * + * Examples: + * + * math.asec(0.5); // returns 1.0471975511965979 + * math.asec(math.sec(1.5)); // returns 1.5 + * + * math.asec(2); // returns 0 + 1.3169578969248166 i + * + * See also: + * + * acos, acot, acsc + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} The arc secant of x + */ + var asec = typed('asec', { + 'number': function (x) { + if (x <= -1 || x >= 1) { + return Math.acos(1 / x); + } + return _complexAsec(new type.Complex(x, 0)); + }, + + 'Complex': _complexAsec, + + 'BigNumber': function (x) { + return bigArcSec(x, type.BigNumber, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, asec); + } + }); + + /** + * Calculate asec for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAsec (x) { + if (x.re == 0 && x.im == 0) { + return new type.Complex(0, Infinity); + } + + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re = x.re / den, + x.im = -x.im / den) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0); + + return complexAcos(x); + } + + return asec; + } + + exports.name = 'asec'; + exports.factory = factory; /***/ }, /* 136 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcSin = util.bignumber.arcsin_arccsc; - - /** - * Calculate the inverse sine of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.asin(x) - * - * Examples: - * - * math.asin(0.5); // returns Number 0.5235987755982989 - * math.asin(math.sin(1.5)); // returns Number ~1.5 - * - * math.asin(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i - * - * See also: - * - * sin, atan, acos - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} The arc sine of x - */ - math.asin = function asin(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('asin', arguments.length, 1); - } - - if (isNumber(x)) { - if (x >= -1 && x <= 1) { - return Math.asin(x); - } - else { - return asin(new Complex(x, 0)); - } - } - - if (isComplex(x)) { - // asin(z) = -i*log(iz + sqrt(1-z^2)) - var re = x.re; - var im = x.im; - var temp1 = new Complex( - im * im - re * re + 1.0, - -2.0 * re * im - ); - var temp2 = math.sqrt(temp1); - var temp3 = new Complex( - temp2.re - im, - temp2.im + re - ); - var temp4 = math.log(temp3); - - return new Complex(temp4.im, -temp4.re); - } - - if (isCollection(x)) { - return collection.deepMap(x, asin); - } - - if (isBoolean(x) || x === null) { - return Math.asin(x); - } - - if (x instanceof BigNumber) { - return bigArcSin(x, BigNumber, false); - } - - throw new math.error.UnsupportedTypeError('asin', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigAsech = __webpack_require__(214).acosh_asinh_asech_acsch; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var acosh = load(__webpack_require__(130)).signatures['Complex']; + + /** + * Calculate the hyperbolic arcsecant of a value, + * defined as `asech(x) = ln(sqrt(1/x^2 - 1) + 1/x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.asech(x) + * + * Examples: + * + * math.asech(0.5); // returns 1.3169578969248166 + * + * See also: + * + * acsch, acoth + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arcsecant of x + */ + var asech = typed('asech', { + 'number': function (x) { + if (x <= 1 && x >= -1) { + x = 1 / x; + + var ret = Math.sqrt(x*x - 1); + if (x > 0) { + return Math.log(ret + x); + } + + return new type.Complex(Math.log(ret - x), Math.PI); + } + + return _complexAsech(new type.Complex(x, 0)); + }, + + 'Complex': _complexAsech, + + 'BigNumber': function (x) { + return bigAsech(x, type.BigNumber, false, true); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, asech); + } + }); + + /** + * Calculate the hyperbolic arcsecant of a number + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAsech (x) { + if (x.re == 0 && x.im == 0) { + return new type.Complex(Infinity, 0); + } + + // acsch(z) = -i*asinh(1/z) + var den = x.re*x.re + x.im*x.im; + x = (den != 0) + ? new type.Complex( + x.re / den, + -x.im / den + ) + : new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? -(x.im / 0) : 0 + ); + + return acosh(x); + } + + return asech; + } + + exports.name = 'asech'; + exports.factory = factory; /***/ }, /* 137 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAsinh = util.bignumber.acosh_asinh_asech_acsch; - - /** - * Calculate the hyperbolic arcsine of a value, - * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.asinh(x) - * - * Examples: - * - * math.asinh(0.5); // returns 0.48121182505960347 - * - * See also: - * - * acosh, atanh - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arcsine of x - */ - math.asinh = function asinh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('asinh', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.log(Math.sqrt(x*x + 1) + x); - } - - if (isComplex(x)) { - // asinh(z) = (-asin((z.im, -z.re)).im, asin((z.im, -z.re)).re) - var temp = x.im; - x.im = -x.re; - x.re = temp; - - var asin = math.asin(x); - - // restore original values - x.re = -x.im; - x.im = temp; - - temp = asin.re; - asin.re = -asin.im; - asin.im = temp; - - return asin; - } - - if (isCollection(x)) { - return collection.deepMap(x, asinh); - } - - if (isBoolean(x) || x === null) { - return (x) ? 0.881373587019543 : 0; - } - - if (x instanceof BigNumber) { - return bigAsinh(x, BigNumber, true, false); - } - - throw new math.error.UnsupportedTypeError('asinh', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigArcSin = __webpack_require__(214).arcsin_arccsc; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexSqrt = load(__webpack_require__(53)).signatures['Complex']; + var complexLog = load(__webpack_require__(44)).signatures['Complex']; + + /** + * Calculate the inverse sine of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.asin(x) + * + * Examples: + * + * math.asin(0.5); // returns Number 0.5235987755982989 + * math.asin(math.sin(1.5)); // returns Number ~1.5 + * + * math.asin(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i + * + * See also: + * + * sin, atan, acos + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} The arc sine of x + */ + var asin = typed('asin', { + 'number': function (x) { + if (x >= -1 && x <= 1) { + return Math.asin(x); + } + else { + return _complexAsin(new type.Complex(x, 0)); + } + }, + + 'Complex': _complexAsin, + + 'BigNumber': function (x) { + return bigArcSin(x, type.BigNumber, false); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since asin(0) = 0 + return collection.deepMap(x, asin, true); + } + }); + + /** + * Calculate asin for a complex value + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAsin(x) { + // asin(z) = -i*log(iz + sqrt(1-z^2)) + var re = x.re; + var im = x.im; + var temp1 = new type.Complex( + im * im - re * re + 1.0, + -2.0 * re * im + ); + var temp2 = complexSqrt(temp1); + var temp3 = new type.Complex( + temp2.re - im, + temp2.im + re + ); + var temp4 = complexLog(temp3); + + return new type.Complex(temp4.im, -temp4.re); + } + + return asin; + } + + exports.name = 'asin'; + exports.factory = factory; /***/ }, /* 138 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection, - - bigArcTan = util.bignumber.arctan_arccot; - - /** - * Calculate the inverse tangent of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.atan(x) - * - * Examples: - * - * math.atan(0.5); // returns Number 0.4636476090008061 - * math.atan(math.tan(1.5)); // returns Number 1.5 - * - * math.atan(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i - * - * See also: - * - * tan, asin, acos - * - * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} The arc tangent of x - */ - math.atan = function atan(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('atan', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.atan(x); - } - - if (isComplex(x)) { - if (x.re == 0) { - if (x.im == 1) { - return new Complex(0, Infinity); - } - if (x.im == -1) { - return new Complex(0, -Infinity); - } - } - - // atan(z) = 1/2 * i * (ln(1-iz) - ln(1+iz)) - var re = x.re; - var im = x.im; - var den = re * re + (1.0 - im) * (1.0 - im); - - var temp1 = new Complex( - (1.0 - im * im - re * re) / den, - (-2.0 * re) / den - ); - var temp2 = math.log(temp1); - - return new Complex( - -0.5 * temp2.im, - 0.5 * temp2.re - ); - } - - if (isCollection(x)) { - return collection.deepMap(x, atan); - } - - if (isBoolean(x) || x === null) { - return Math.atan(x); - } - - if (x instanceof BigNumber) { - return bigArcTan(x, BigNumber, false); - } - - throw new math.error.UnsupportedTypeError('atan', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigAsinh = __webpack_require__(214).acosh_asinh_asech_acsch; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexAsin = load(__webpack_require__(137)).signatures['Complex']; + + /** + * Calculate the hyperbolic arcsine of a value, + * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.asinh(x) + * + * Examples: + * + * math.asinh(0.5); // returns 0.48121182505960347 + * + * See also: + * + * acosh, atanh + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arcsine of x + */ + var asinh = typed('asinh', { + 'number': function (x) { + return Math.log(Math.sqrt(x*x + 1) + x); + }, + + 'Complex': function (x) { + // asinh(z) = (-asin((z.im, -z.re)).im, asin((z.im, -z.re)).re) + var temp = x.im; + x.im = -x.re; + x.re = temp; + + var res = complexAsin(x); + + // restore original values + x.re = -x.im; + x.im = temp; + + temp = res.re; + res.re = -res.im; + res.im = temp; + + return res; + }, + + 'BigNumber': function (x) { + return bigAsinh(x, type.BigNumber, true, false); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since asinh(0) = 0 + return collection.deepMap(x, asinh, true); + } + }); + + return asinh; + } + + exports.name = 'asinh'; + exports.factory = factory; /***/ }, /* 139 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isCollection = collection.isCollection; - - /** - * Calculate the inverse tangent function with two arguments, y/x. - * By providing two arguments, the right quadrant of the computed angle can be - * determined. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.atan2(y, x) - * - * Examples: - * - * math.atan2(2, 2) / math.pi; // returns number 0.25 - * - * var angle = math.unit(60, 'deg'); // returns Unit 60 deg - * var x = math.cos(angle); - * var y = math.sin(angle); - * - * math.atan(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i - * - * See also: - * - * tan, atan, sin, cos - * - * @param {Number | Boolean | Complex | Array | Matrix | null} y Second dimension - * @param {Number | Boolean | Complex | Array | Matrix | null} x First dimension - * @return {Number | Complex | Array | Matrix} Four-quadrant inverse tangent - */ - math.atan2 = function atan2(y, x) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('atan2', arguments.length, 2); - } - - if (isNumber(y)) { - if (isNumber(x)) { - return Math.atan2(y, x); - } - } - - // TODO: support for complex computation of atan2 - - if (isCollection(y) || isCollection(x)) { - return collection.deepMap2(y, x, atan2); - } - - if (isBoolean(y) || y === null) { - return atan2(+y, x); - } - if (isBoolean(x) || x === null) { - return atan2(y, +x); - } - - // TODO: implement bignumber support - if (y instanceof BigNumber) { - return atan2(y.toNumber(), x); - } - if (x instanceof BigNumber) { - return atan2(y, x.toNumber()); - } - - throw new math.error.UnsupportedTypeError('atan2', math['typeof'](y), math['typeof'](x)); - }; - }; + 'use strict'; + + var bigArcTan = __webpack_require__(214).arctan_arccot; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var complexLog = load(__webpack_require__(44)).signatures['Complex']; + + /** + * Calculate the inverse tangent of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.atan(x) + * + * Examples: + * + * math.atan(0.5); // returns Number 0.4636476090008061 + * math.atan(math.tan(1.5)); // returns Number 1.5 + * + * math.atan(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i + * + * See also: + * + * tan, asin, acos + * + * @param {Number | BigNumber | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} The arc tangent of x + */ + var atan = typed('atan', { + 'number': function (x) { + return Math.atan(x); + }, + + 'Complex': function (x) { + if (x.re == 0) { + if (x.im == 1) { + return new type.Complex(0, Infinity); + } + if (x.im == -1) { + return new type.Complex(0, -Infinity); + } + } + + // atan(z) = 1/2 * i * (ln(1-iz) - ln(1+iz)) + var re = x.re; + var im = x.im; + var den = re * re + (1.0 - im) * (1.0 - im); + + var temp1 = new type.Complex( + (1.0 - im * im - re * re) / den, + (-2.0 * re) / den + ); + var temp2 = complexLog(temp1); + + return new type.Complex( + -0.5 * temp2.im, + 0.5 * temp2.re + ); + }, + + 'BigNumber': function (x) { + return bigArcTan(x, type.BigNumber, false); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since atan(0) = 0 + return collection.deepMap(x, atan, true); + } + }); + + return atan; + } + + exports.name = 'atan'; + exports.factory = factory; /***/ }, /* 140 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigAtanh = util.bignumber.atanh_acoth; - - /** - * Calculate the hyperbolic arctangent of a value, - * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.atanh(x) - * - * Examples: - * - * math.atanh(0.5); // returns 0.5493061443340549 - * - * See also: - * - * acosh, asinh - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Hyperbolic arctangent of x - */ - math.atanh = function atanh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('atanh', arguments.length, 1); - } - - if (isNumber(x)) { - if (x <= 1 && x >= -1) { - return Math.log((1 + x)/(1 - x)) / 2; - } - return atanh(new Complex(x, 0)); - } - - if (isComplex(x)) { - // x.im should equal -pi / 2 in this case - var noIM = x.re > 1 && x.im == 0; - - var oneMinus = 1 - x.re; - var onePlus = 1 + x.re; - var den = oneMinus*oneMinus + x.im*x.im; - x = (den != 0) - ? new Complex( - (onePlus*oneMinus - x.im*x.im) / den, - (x.im*oneMinus + onePlus*x.im) / den - ) - : new Complex( - (x.re != -1) ? (x.re / 0) : 0, - (x.im != 0) ? (x.im / 0) : 0 - ); - - var temp = x.re; - x.re = Math.log(Math.sqrt(x.re*x.re + x.im*x.im)) / 2; - x.im = Math.atan2(x.im, temp) / 2; - - if (noIM) { - x.im = -x.im; - } - return x; - } - - if (isCollection(x)) { - return collection.deepMap(x, atanh); - } - - if (isBoolean(x) || x === null) { - return (x) ? Infinity : 0; - } - - if (x instanceof BigNumber) { - return bigAtanh(x, BigNumber, false); - } - - throw new math.error.UnsupportedTypeError('atanh', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigAtan2 = __webpack_require__(214).arctan2; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the inverse tangent function with two arguments, y/x. + * By providing two arguments, the right quadrant of the computed angle can be + * determined. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.atan2(y, x) + * + * Examples: + * + * math.atan2(2, 2) / math.pi; // returns number 0.25 + * + * var angle = math.unit(60, 'deg'); // returns Unit 60 deg + * var x = math.cos(angle); + * var y = math.sin(angle); + * + * math.atan(2); // returns Complex 1.5707963267948966 -1.3169578969248166 i + * + * See also: + * + * tan, atan, sin, cos + * + * @param {Number | Boolean | Array | Matrix | null} y Second dimension + * @param {Number | Boolean | Array | Matrix | null} x First dimension + * @return {Number | Array | Matrix} Four-quadrant inverse tangent + */ + var atan2 = typed('atan2', { + 'number, number': Math.atan2, + + // TODO: implement atan2 for complex numbers + + 'BigNumber, BigNumber': function (y, x) { + return bigAtan2(y, x, type.BigNumber); + }, + + 'Array | Matrix, any': function (y, x) { + return collection.deepMap2(y, x, atan2); + }, + + 'any, Array | Matrix': function (y, x) { + return collection.deepMap2(y, x, atan2); + } + }); + + return atan2; + } + + exports.name = 'atan2'; + exports.factory = factory; /***/ }, /* 141 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigCos = util.bignumber.cos_sin_sec_csc; - - /** - * Calculate the cosine of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.cos(x) - * - * Examples: - * - * math.cos(2); // returns Number -0.4161468365471422 - * math.cos(math.pi / 4); // returns Number 0.7071067811865475 - * math.cos(math.unit(180, 'deg')); // returns Number -1 - * math.cos(math.unit(60, 'deg')); // returns Number 0.5 - * - * var angle = 0.2; - * math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2); // returns Number ~1 - * - * See also: - * - * cos, tan - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} Cosine of x - */ - math.cos = function cos(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('cos', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.cos(x); - } - - if (isComplex(x)) { - // cos(z) = (exp(iz) + exp(-iz)) / 2 - return new Complex( - Math.cos(x.re) * math.cosh(-x.im), - Math.sin(x.re) * math.sinh(-x.im) - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function cos is no angle'); - } - return Math.cos(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, cos); - } - - if (isBoolean(x) || x === null) { - return Math.cos(x); - } - - if (x instanceof BigNumber) { - return bigCos(x, BigNumber, 0, false); - } - - throw new math.error.UnsupportedTypeError('cos', math['typeof'](x)); - }; - }; + 'use strict'; + + var bigAtanh = __webpack_require__(214).atanh_acoth; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Calculate the hyperbolic arctangent of a value, + * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.atanh(x) + * + * Examples: + * + * math.atanh(0.5); // returns 0.5493061443340549 + * + * See also: + * + * acosh, asinh + * + * @param {Number | Boolean | Complex | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Hyperbolic arctangent of x + */ + var atanh = typed('atanh', { + 'number': function (x) { + if (x <= 1 && x >= -1) { + return Math.log((1 + x)/(1 - x)) / 2; + } + return _complexAtanh(new type.Complex(x, 0)); + }, + + 'Complex': _complexAtanh, + + 'BigNumber': function (x) { + return bigAtanh(x, type.BigNumber, false); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since atanh(0) = 0 + return collection.deepMap(x, atanh, true); + } + }); + + /** + * Calculate the hyperbolic arctangent of a complex number + * @param {Complex} x + * @returns {Complex} + * @private + */ + function _complexAtanh (x) { + // x.im should equal -pi / 2 in this case + var noIM = x.re > 1 && x.im == 0; + + var oneMinus = 1 - x.re; + var onePlus = 1 + x.re; + var den = oneMinus*oneMinus + x.im*x.im; + x = (den != 0) + ? new type.Complex( + (onePlus*oneMinus - x.im*x.im) / den, + (x.im*oneMinus + onePlus*x.im) / den + ) + : new type.Complex( + (x.re != -1) ? (x.re / 0) : 0, + (x.im != 0) ? (x.im / 0) : 0 + ); + + var temp = x.re; + x.re = Math.log(Math.sqrt(x.re*x.re + x.im*x.im)) / 2; + x.im = Math.atan2(x.im, temp) / 2; + + if (noIM) { + x.im = -x.im; + } + return x; + } + + return atanh; + } + + exports.name = 'atanh'; + exports.factory = factory; /***/ }, @@ -17676,21 +19325,83 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigCos = __webpack_require__(214).cos_sin_sec_csc; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var cosh = load(__webpack_require__(143)).signatures['number']; + var sinh = load(__webpack_require__(151)).signatures['number']; - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + /** + * Calculate the cosine of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.cos(x) + * + * Examples: + * + * math.cos(2); // returns Number -0.4161468365471422 + * math.cos(math.pi / 4); // returns Number 0.7071067811865475 + * math.cos(math.unit(180, 'deg')); // returns Number -1 + * math.cos(math.unit(60, 'deg')); // returns Number 0.5 + * + * var angle = 0.2; + * math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2); // returns Number ~1 + * + * See also: + * + * cos, tan + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} Cosine of x + */ + var cos = typed('cos', { + 'number': Math.cos, - bigCosh = util.bignumber.cosh_sinh_csch_sech; + 'Complex': function (x) { + // cos(z) = (exp(iz) + exp(-iz)) / 2 + return new type.Complex( + Math.cos(x.re) * cosh(-x.im), + Math.sin(x.re) * sinh(-x.im) + ); + }, + + 'BigNumber': function (x) { + return bigCos(x, type.BigNumber, 0, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function cos is no angle'); + } + return Math.cos(x.value); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, cos); + } + }); + + return cos; + } + + exports.name = 'cos'; + exports.factory = factory; + + +/***/ }, +/* 143 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigCosh = __webpack_require__(214).cosh_sinh_csch_sech; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic cosine of a value, @@ -17713,129 +19424,46 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | BigNumber | Complex | Array | Matrix} Hyperbolic cosine of x */ - math.cosh = function cosh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('cosh', arguments.length, 1); - } + var cosh = typed('cosh', { + 'number': _cosh, - if (isNumber(x)) { - return (Math.exp(x) + Math.exp(-x)) / 2; - } - - if (isComplex(x)) { + 'Complex': function (x) { var ep = Math.exp(x.re); var en = Math.exp(-x.re); - return new Complex(Math.cos(x.im) * (ep + en) / 2, Math.sin(x.im) * (ep - en) / 2); - } + return new type.Complex(Math.cos(x.im) * (ep + en) / 2, Math.sin(x.im) * (ep - en) / 2); + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigCosh(x, type.BigNumber, false, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function cosh is no angle'); } - return cosh(x.value); - } + return _cosh(x.value); + }, - if (isCollection(x)) { + 'Array | Matrix': function (x) { return collection.deepMap(x, cosh); } + }); - if (isBoolean(x) || x === null) { - return cosh(x ? 1 : 0); - } + return cosh; + } - if (x instanceof BigNumber) { - return bigCosh(x, BigNumber, false, false); - } + /** + * Calculate the hyperbolic cosine of a number + * @param {number} x + * @returns {number} + * @private + */ + function _cosh(x) { + return (Math.exp(x) + Math.exp(-x)) / 2; + } - throw new math.error.UnsupportedTypeError('cosh', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 143 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigCot = util.bignumber.tan_cot; - - /** - * Calculate the cotangent of a value. `cot(x)` is defined as `1 / tan(x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.cot(x) - * - * Examples: - * - * math.cot(2); // returns Number -0.45765755436028577 - * 1 / math.tan(2); // returns Number -0.45765755436028577 - * - * See also: - * - * tan, sec, csc - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Cotangent of x - */ - math.cot = function cot(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('cot', arguments.length, 1); - } - - if (isNumber(x)) { - return 1 / Math.tan(x); - } - - if (isComplex(x)) { - var den = Math.exp(-4.0 * x.im) - - 2.0 * Math.exp(-2.0 * x.im) * Math.cos(2.0 * x.re) + 1.0; - - return new Complex( - 2.0 * Math.exp(-2.0 * x.im) * Math.sin(2.0 * x.re) / den, - (Math.exp(-4.0 * x.im) - 1.0) / den - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function cot is no angle'); - } - return 1 / Math.tan(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, cot); - } - - if (isBoolean(x) || x === null) { - return cot(+x); - } - - if (x instanceof BigNumber) { - return bigCot(x, BigNumber, true); - } - - throw new math.error.UnsupportedTypeError('cot', math['typeof'](x)); - }; - }; + exports.name = 'cosh'; + exports.factory = factory; /***/ }, @@ -17844,21 +19472,81 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigCot = __webpack_require__(214).tan_cot; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + /** + * Calculate the cotangent of a value. `cot(x)` is defined as `1 / tan(x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.cot(x) + * + * Examples: + * + * math.cot(2); // returns Number -0.45765755436028577 + * 1 / math.tan(2); // returns Number -0.45765755436028577 + * + * See also: + * + * tan, sec, csc + * + * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Cotangent of x + */ + var cot = typed('cot', { + 'number': function (x) { + return 1 / Math.tan(x); + }, - bigCoth = util.bignumber.tanh_coth; + 'Complex': function (x) { + var den = + Math.exp(-4 * x.im) - + 2 * Math.exp(-2 * x.im) * Math.cos(2 * x.re) + 1; + + return new type.Complex( + 2 * Math.exp(-2 * x.im) * Math.sin(2 * x.re) / den, + (Math.exp(-4 * x.im) - 1) / den + ); + }, + + 'BigNumber': function (x) { + return bigCot(x, type.BigNumber, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function cot is no angle'); + } + return 1 / Math.tan(x.value); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, cot); + } + }); + + return cot; + } + + exports.name = 'cot'; + exports.factory = factory; + + +/***/ }, +/* 145 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigCoth = __webpack_require__(214).tanh_coth; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic cotangent of a value, @@ -17883,136 +19571,52 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | Complex | Array | Matrix} Hyperbolic cotangent of x */ - math.coth = function coth(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('coth', arguments.length, 1); - } + var coth = typed('coth', { + 'number': _coth, - if (isNumber(x)) { - var e = Math.exp(2 * x); - return (e + 1) / (e - 1); - } - - if (isComplex(x)) { + 'Complex': function (x) { var r = Math.exp(2 * x.re); var re = r * Math.cos(2 * x.im); var im = r * Math.sin(2 * x.im); var den = (re - 1) * (re - 1) + im * im; - return new Complex( - ((re + 1) * (re - 1) + im * im) / den, - -2 * im / den + return new type.Complex( + ((re + 1) * (re - 1) + im * im) / den, + -2 * im / den ); - } + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigCoth(x, type.BigNumber, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function coth is no angle'); } - return coth(x.value); - } + return _coth(x.value); + }, - if (isCollection(x)) { + 'Array | Matrix': function (x) { return collection.deepMap(x, coth); } + }); - if (isBoolean(x) || x === null) { - return coth(x ? 1 : 0); - } + return coth; + } - if (x instanceof BigNumber) { - return bigCoth(x, BigNumber, true); - } + /** + * Calculate the hyperbolic cosine of a number + * @param {number} x + * @returns {number} + * @private + */ + function _coth(x) { + var e = Math.exp(2 * x); + return (e + 1) / (e - 1); + } - throw new math.error.UnsupportedTypeError('coth', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 145 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigCsc = util.bignumber.cos_sin_sec_csc; - - /** - * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.csc(x) - * - * Examples: - * - * math.csc(2); // returns Number 1.099750170294617 - * 1 / math.sin(2); // returns Number 1.099750170294617 - * - * See also: - * - * sin, sec, cot - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Cosecant of x - */ - math.csc = function csc(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('csc', arguments.length, 1); - } - - if (isNumber(x)) { - return 1 / Math.sin(x); - } - - if (isComplex(x)) { - // csc(z) = 1/sin(z) = (2i) / (exp(iz) - exp(-iz)) - var den = 0.25 * (Math.exp(-2.0 * x.im) + Math.exp(2.0 * x.im)) - - 0.5 * Math.cos(2.0 * x.re); - - return new Complex ( - 0.5 * Math.sin(x.re) * (Math.exp(-x.im) + Math.exp(x.im)) / den, - 0.5 * Math.cos(x.re) * (Math.exp(-x.im) - Math.exp(x.im)) / den - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function csc is no angle'); - } - return 1 / Math.sin(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, csc); - } - - if (isBoolean(x) || x === null) { - return csc(+x); - } - - if (x instanceof BigNumber) { - return bigCsc(x, BigNumber, 1, true); - } - - throw new math.error.UnsupportedTypeError('csc', math['typeof'](x)); - }; - }; + exports.name = 'coth'; + exports.factory = factory; /***/ }, @@ -18021,22 +19625,83 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigCsc = __webpack_require__(214).cos_sin_sec_csc; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - number = util.number, - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); - bigCsch = util.bignumber.cosh_sinh_csch_sech; + /** + * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.csc(x) + * + * Examples: + * + * math.csc(2); // returns Number 1.099750170294617 + * 1 / math.sin(2); // returns Number 1.099750170294617 + * + * See also: + * + * sin, sec, cot + * + * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Cosecant of x + */ + var csc = typed('csc', { + 'number': function (x) { + return 1 / Math.sin(x); + }, + + 'Complex': function (x) { + // csc(z) = 1/sin(z) = (2i) / (exp(iz) - exp(-iz)) + var den = + 0.25 * (Math.exp(-2 * x.im) + Math.exp(2 * x.im)) - + 0.5 * Math.cos(2 * x.re); + + return new type.Complex ( + 0.5 * Math.sin(x.re) * (Math.exp(-x.im) + Math.exp(x.im)) / den, + 0.5 * Math.cos(x.re) * (Math.exp(-x.im) - Math.exp(x.im)) / den + ); + }, + + 'BigNumber': function (x) { + return bigCsc(x, type.BigNumber, 1, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function csc is no angle'); + } + return 1 / Math.sin(x.value); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, csc); + } + }); + + return csc; + } + + exports.name = 'csc'; + exports.factory = factory; + + +/***/ }, +/* 147 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigCsch = __webpack_require__(214).cosh_sinh_csch_sech; + var sign = __webpack_require__(175).sign; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic cosecant of a value, @@ -18061,136 +19726,55 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | Complex | Array | Matrix} Hyperbolic cosecant of x */ - math.csch = function csch(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('csch', arguments.length, 1); - } + var csch = typed('csch', { + 'number': _csch, - if (isNumber(x)) { - // x == 0 - if (x == 0) return Number.POSITIVE_INFINITY; - // consider values close to zero (+/-) - return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * number.sign(x); - } - - if (isComplex(x)) { + 'Complex': function (x) { var ep = Math.exp(x.re); var en = Math.exp(-x.re); var re = Math.cos(x.im) * (ep - en); var im = Math.sin(x.im) * (ep + en); var den = re * re + im * im; - return new Complex(2 * re / den, -2 * im /den); - } + return new type.Complex(2 * re / den, -2 * im /den); + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigCsch(x, type.BigNumber, true, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function csch is no angle'); } - return csch(x.value); - } + return _csch(x.value); + }, - if (isCollection(x)) { + 'Array | Matrix': function (x) { return collection.deepMap(x, csch); } + }); - if (isBoolean(x) || x === null) { - return csch(x ? 1 : 0); - } + return csch; + } - if (x instanceof BigNumber) { - return bigCsch(x, BigNumber, true, true); - } + /** + * Calculate the hyperbolic cosecant of a number + * @param {number} x + * @returns {number} + * @private + */ + function _csch(x) { + // consider values close to zero (+/-) + if (x == 0) { + return Number.POSITIVE_INFINITY; + } + else { + return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x); + } + } - throw new math.error.UnsupportedTypeError('csch', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 147 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigSec = util.bignumber.cos_sin_sec_csc; - - /** - * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.sec(x) - * - * Examples: - * - * math.sec(2); // returns Number -2.4029979617223822 - * 1 / math.cos(2); // returns Number -2.4029979617223822 - * - * See also: - * - * cos, csc, cot - * - * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | Complex | Array | Matrix} Secant of x - */ - math.sec = function sec(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('sec', arguments.length, 1); - } - - if (isNumber(x)) { - return 1 / Math.cos(x); - } - - if (isComplex(x)) { - // sec(z) = 1/cos(z) = 2 / (exp(iz) + exp(-iz)) - var den = 0.25 * (Math.exp(-2.0 * x.im) + Math.exp(2.0 * x.im)) + - 0.5 * Math.cos(2.0 * x.re); - - return new Complex( - 0.5 * Math.cos(x.re) * (Math.exp(-x.im) + Math.exp( x.im)) / den, - 0.5 * Math.sin(x.re) * (Math.exp( x.im) - Math.exp(-x.im)) / den - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function sec is no angle'); - } - return 1 / Math.cos(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, sec); - } - - if (isBoolean(x) || x === null) { - return sec(+x); - } - - if (x instanceof BigNumber) { - return bigSec(x, BigNumber, 0, true); - } - - throw new math.error.UnsupportedTypeError('sec', math['typeof'](x)); - }; - }; + exports.name = 'csch'; + exports.factory = factory; /***/ }, @@ -18199,21 +19783,82 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigSec = __webpack_require__(214).cos_sin_sec_csc; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + /** + * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.sec(x) + * + * Examples: + * + * math.sec(2); // returns Number -2.4029979617223822 + * 1 / math.cos(2); // returns Number -2.4029979617223822 + * + * See also: + * + * cos, csc, cot + * + * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | Complex | Array | Matrix} Secant of x + */ + var sec = typed('sec', { + 'number': function (x) { + return 1 / Math.cos(x); + }, - bigSech = util.bignumber.cosh_sinh_csch_sech; + 'Complex': function (x) { + // sec(z) = 1/cos(z) = 2 / (exp(iz) + exp(-iz)) + var den = + 0.25 * (Math.exp(-2 * x.im) + Math.exp(2 * x.im)) + + 0.5 * Math.cos(2 * x.re); + + return new type.Complex( + 0.5 * Math.cos(x.re) * (Math.exp(-x.im) + Math.exp( x.im)) / den, + 0.5 * Math.sin(x.re) * (Math.exp( x.im) - Math.exp(-x.im)) / den + ); + }, + + 'BigNumber': function (x) { + return bigSec(x, type.BigNumber, 0, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function sec is no angle'); + } + return 1 / Math.cos(x.value); + }, + + 'Array | Matrix': function (x) { + return collection.deepMap(x, sec); + } + }); + + return sec; + } + + exports.name = 'sec'; + exports.factory = factory; + + +/***/ }, +/* 149 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigSech = __webpack_require__(214).cosh_sinh_csch_sech; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic secant of a value, @@ -18238,134 +19883,49 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | Complex | Array | Matrix} Hyperbolic secant of x */ - math.sech = function sech(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('sech', arguments.length, 1); - } + var sech = typed('sech', { + 'number': _sech, - if (isNumber(x)) { - return 2 / (Math.exp(x) + Math.exp(-x)); - } - - if (isComplex(x)) { + 'Complex': function (x) { var ep = Math.exp(x.re); var en = Math.exp(-x.re); var re = Math.cos(x.im) * (ep + en); var im = Math.sin(x.im) * (ep - en); var den = re * re + im * im; - return new Complex(2 * re / den, -2 * im / den); - } + return new type.Complex(2 * re / den, -2 * im / den); + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigSech(x, type.BigNumber, false, true); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function sech is no angle'); } - return sech(x.value); - } + return _sech(x.value); + }, - if (isCollection(x)) { + 'Array | Matrix': function (x) { return collection.deepMap(x, sech); } + }); - if (isBoolean(x) || x === null) { - return sech(x ? 1 : 0); - } + return sech; + } - if (x instanceof BigNumber) { - return bigSech(x, BigNumber, false, true); - } + /** + * Calculate the hyperbolic secant of a number + * @param {number} x + * @returns {number} + * @private + */ + function _sech(x) { + return 2 / (Math.exp(x) + Math.exp(-x)); + } - throw new math.error.UnsupportedTypeError('sech', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 149 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigSin = util.bignumber.cos_sin_sec_csc; - - /** - * Calculate the sine of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.sin(x) - * - * Examples: - * - * math.sin(2); // returns Number 0.9092974268256813 - * math.sin(math.pi / 4); // returns Number 0.7071067811865475 - * math.sin(math.unit(90, 'deg')); // returns Number 1 - * math.sin(math.unit(30, 'deg')); // returns Number 0.5 - * - * var angle = 0.2; - * math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2); // returns Number ~1 - * - * See also: - * - * cos, tan - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} Sine of x - */ - math.sin = function sin(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('sin', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.sin(x); - } - - if (isComplex(x)) { - return new Complex( - Math.sin(x.re) * math.cosh(-x.im), - Math.cos(x.re) * math.sinh(x.im) - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function sin is no angle'); - } - return Math.sin(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, sin); - } - - if (isBoolean(x) || x === null) { - return Math.sin(x); - } - - if (x instanceof BigNumber) { - return bigSin(x, BigNumber, 1, false); - } - - throw new math.error.UnsupportedTypeError('sin', math['typeof'](x)); - }; - }; + exports.name = 'sech'; + exports.factory = factory; /***/ }, @@ -18374,21 +19934,83 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigSin = __webpack_require__(214).cos_sin_sec_csc; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), + function factory (type, config, load, typed) { + var cosh = load(__webpack_require__(143)).signatures['number']; + var sinh = load(__webpack_require__(151)).signatures['number']; + var collection = load(__webpack_require__(2)); - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + /** + * Calculate the sine of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.sin(x) + * + * Examples: + * + * math.sin(2); // returns Number 0.9092974268256813 + * math.sin(math.pi / 4); // returns Number 0.7071067811865475 + * math.sin(math.unit(90, 'deg')); // returns Number 1 + * math.sin(math.unit(30, 'deg')); // returns Number 0.5 + * + * var angle = 0.2; + * math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2); // returns Number ~1 + * + * See also: + * + * cos, tan + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} Sine of x + */ + var sin = typed('sin', { + 'number': Math.sin, - bigSinh = util.bignumber.cosh_sinh_csch_sech; + 'Complex': function (x) { + return new type.Complex( + Math.sin(x.re) * cosh(-x.im), + Math.cos(x.re) * sinh(x.im) + ); + }, + + 'BigNumber': function (x) { + return bigSin(x, type.BigNumber, 1, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function sin is no angle'); + } + return Math.sin(x.value); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since sin(0) = 0 + return collection.deepMap(x, sin, true); + } + }); + + return sin; + } + + exports.name = 'sin'; + exports.factory = factory; + + +/***/ }, +/* 151 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigSinh = __webpack_require__(214).cosh_sinh_csch_sech; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic sine of a value, @@ -18411,138 +20033,53 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | BigNumber | Complex | Array | Matrix} Hyperbolic sine of x */ - math.sinh = function sinh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('sinh', arguments.length, 1); - } + var sinh = typed('sinh', { + 'number': _sinh, - if (isNumber(x)) { - if (Math.abs(x) < 1) { - return x + (x * x * x) / 6 + (x * x * x * x * x) / 120; - } else { - return (Math.exp(x) - Math.exp(-x)) / 2; - } - } - - if (isComplex(x)) { + 'Complex': function (x) { var cim = Math.cos(x.im); var sim = Math.sin(x.im); var ep = Math.exp(x.re); var en = Math.exp(-x.re); - return new Complex(cim * (ep - en) / 2, sim * (ep + en) / 2); - } + return new type.Complex(cim * (ep - en) / 2, sim * (ep + en) / 2); + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigSinh(x, type.BigNumber, true, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function sinh is no angle'); } - return sinh(x.value); - } + return _sinh(x.value); + }, - if (isCollection(x)) { - return collection.deepMap(x, sinh); + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since sinh(0) = 0 + return collection.deepMap(x, sinh, true); } + }); - if (isBoolean(x) || x === null) { - return sinh(x ? 1 : 0); - } + return sinh; + } - if (x instanceof BigNumber) { - return bigSinh(x, BigNumber, true, false); - } + /** + * Calculate the hyperbolic sine of a number + * @param {number} x + * @returns {number} + * @private + */ + function _sinh (x) { + if (Math.abs(x) < 1) { + return x + (x * x * x) / 6 + (x * x * x * x * x) / 120; + } else { + return (Math.exp(x) - Math.exp(-x)) / 2; + } + } - throw new math.error.UnsupportedTypeError('sinh', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 151 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math, config) { - var util = __webpack_require__(164), - - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, - - bigTan = util.bignumber.tan_cot; - - /** - * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.tan(x) - * - * Examples: - * - * math.tan(0.5); // returns Number 0.5463024898437905 - * math.sin(0.5) / math.cos(0.5); // returns Number 0.5463024898437905 - * math.tan(math.pi / 4); // returns Number 1 - * math.tan(math.unit(45, 'deg')); // returns Number 1 - * - * See also: - * - * atan, sin, cos - * - * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input - * @return {Number | BigNumber | Complex | Array | Matrix} Tangent of x - */ - math.tan = function tan(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('tan', arguments.length, 1); - } - - if (isNumber(x)) { - return Math.tan(x); - } - - if (isComplex(x)) { - var den = Math.exp(-4.0 * x.im) + - 2.0 * Math.exp(-2.0 * x.im) * Math.cos(2.0 * x.re) + - 1.0; - - return new Complex( - 2.0 * Math.exp(-2.0 * x.im) * Math.sin(2.0 * x.re) / den, - (1.0 - Math.exp(-4.0 * x.im)) / den - ); - } - - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { - throw new TypeError ('Unit in function tan is no angle'); - } - return Math.tan(x.value); - } - - if (isCollection(x)) { - return collection.deepMap(x, tan); - } - - if (isBoolean(x) || x === null) { - return Math.tan(x); - } - - if (x instanceof BigNumber) { - return bigTan(x, BigNumber, false); - } - - throw new math.error.UnsupportedTypeError('tan', math['typeof'](x)); - }; - }; + exports.name = 'sinh'; + exports.factory = factory; /***/ }, @@ -18551,21 +20088,83 @@ return /******/ (function(modules) { // webpackBootstrap 'use strict'; - module.exports = function (math) { - var util = __webpack_require__(164), + var bigTan = __webpack_require__(214).tan_cot; - BigNumber = math.type.BigNumber, - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - collection = __webpack_require__(14), + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); - isNumber = util.number.isNumber, - isBoolean = util['boolean'].isBoolean, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit, - isCollection = collection.isCollection, + /** + * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.tan(x) + * + * Examples: + * + * math.tan(0.5); // returns Number 0.5463024898437905 + * math.sin(0.5) / math.cos(0.5); // returns Number 0.5463024898437905 + * math.tan(math.pi / 4); // returns Number 1 + * math.tan(math.unit(45, 'deg')); // returns Number 1 + * + * See also: + * + * atan, sin, cos + * + * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input + * @return {Number | BigNumber | Complex | Array | Matrix} Tangent of x + */ + var tan = typed('tan', { + 'number': Math.tan, - bigTanh = util.bignumber.tanh_coth; + 'Complex': function (x) { + var den = + Math.exp(-4 * x.im) + + 2 * Math.exp(-2 * x.im) * Math.cos(2 * x.re) + + 1; + + return new type.Complex( + 2 * Math.exp(-2 * x.im) * Math.sin(2 * x.re) / den, + (1 - Math.exp(-4 * x.im)) / den + ); + }, + + 'BigNumber': function (x) { + return bigTan(x, type.BigNumber, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { + throw new TypeError ('Unit in function tan is no angle'); + } + return Math.tan(x.value); + }, + + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since tan(0) = 0 + return collection.deepMap(x, tan, true); + } + }); + + return tan; + } + + exports.name = 'tan'; + exports.factory = factory; + + +/***/ }, +/* 153 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var bigTanh = __webpack_require__(214).tanh_coth; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); /** * Calculate the hyperbolic tangent of a value, @@ -18591,9008 +20190,10406 @@ return /******/ (function(modules) { // webpackBootstrap * @param {Number | BigNumber | Boolean | Complex | Unit | Array | Matrix | null} x Function input * @return {Number | BigNumber | Complex | Array | Matrix} Hyperbolic tangent of x */ - math.tanh = function tanh(x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('tanh', arguments.length, 1); - } + var tanh = typed('tanh', { + 'number': _tanh, - if (isNumber(x)) { - var e = Math.exp(2 * x); - return (e - 1) / (e + 1); - } - - if (isComplex(x)) { + 'Complex': function (x) { var r = Math.exp(2 * x.re); var re = r * Math.cos(2 * x.im); var im = r * Math.sin(2 * x.im); var den = (re + 1) * (re + 1) + im * im; - return new Complex( - ((re - 1) * (re + 1) + im * im) / den, - im * 2 / den + return new type.Complex( + ((re - 1) * (re + 1) + im * im) / den, + im * 2 / den ); - } + }, - if (isUnit(x)) { - if (!x.hasBase(Unit.BASE_UNITS.ANGLE)) { + 'BigNumber': function (x) { + return bigTanh(x, type.BigNumber, false); + }, + + 'Unit': function (x) { + if (!x.hasBase(type.Unit.BASE_UNITS.ANGLE)) { throw new TypeError ('Unit in function tanh is no angle'); } - return tanh(x.value); - } + return _tanh(x.value); + }, - if (isCollection(x)) { - return collection.deepMap(x, tanh); + 'Array | Matrix': function (x) { + // deep map collection, skip zeros since tanh(0) = 0 + return collection.deepMap(x, tanh, true); } + }); - if (isBoolean(x) || x === null) { - return tanh(x ? 1 : 0); - } + return tanh; + } - if (x instanceof BigNumber) { - return bigTanh(x, BigNumber, false); - } + /** + * Calculate the hyperbolic tangent of a number + * @param {number} x + * @returns {number} + * @private + */ + function _tanh (x) { + var e = Math.exp(2 * x); + return (e - 1) / (e + 1); + } - throw new math.error.UnsupportedTypeError('tanh', math['typeof'](x)); - }; - }; - - -/***/ }, -/* 153 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Unit = __webpack_require__(8), - collection = __webpack_require__(14), - - isString = util.string.isString, - isUnit = Unit.isUnit, - isCollection = collection.isCollection; - - /** - * Change the unit of a value. - * - * For matrices, the function is evaluated element wise. - * - * Syntax: - * - * math.to(x, unit) - * - * Examples: - * - * math.to(math.unit('2 inch'), 'cm'); // returns Unit 5.08 cm - * math.to(math.unit('2 inch'), math.unit(null, 'cm')); // returns Unit 5.08 cm - * math.to(math.unit(16, 'bytes'), 'bits'); // returns Unit 128 bits - * - * See also: - * - * unit - * - * @param {Unit | Array | Matrix} x The unit to be converted. - * @param {Unit | Array | Matrix} unit New unit. Can be a string like "cm" - * or a unit without value. - * @return {Unit | Array | Matrix} value with changed, fixed unit. - */ - math.to = function to(x, unit) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('to', arguments.length, 2); - } - - if (isUnit(x)) { - if (isUnit(unit) || isString(unit)) { - return x.to(unit); - } - } - - // TODO: add support for string, in that case, convert to unit - - if (isCollection(x) || isCollection(unit)) { - return collection.deepMap2(x, unit, to); - } - - throw new math.error.UnsupportedTypeError('to', math['typeof'](x), math['typeof'](unit)); - }; - }; + exports.name = 'tanh'; + exports.factory = factory; /***/ }, /* 154 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - object = util.object; - - /** - * Clone an object. - * - * Syntax: - * - * math.clone(x) - * - * Examples: - * - * math.clone(3.5); // returns number 3.5 - * math.clone(math.complex('2 - 4i'); // returns Complex 2 - 4i - * math.clone(math.unit(45, 'deg')); // returns Unit 45 deg - * math.clone([[1, 2], [3, 4]]); // returns Array [[1, 2], [3, 4]] - * math.clone("hello world"); // returns string "hello world" - * - * @param {*} x Object to be cloned - * @return {*} A clone of object x - */ - math.clone = function clone (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('clone', arguments.length, 1); - } - - return object.clone(x); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + + /** + * Change the unit of a value. + * + * For matrices, the function is evaluated element wise. + * + * Syntax: + * + * math.to(x, unit) + * + * Examples: + * + * math.to(math.unit('2 inch'), 'cm'); // returns Unit 5.08 cm + * math.to(math.unit('2 inch'), math.unit(null, 'cm')); // returns Unit 5.08 cm + * math.to(math.unit(16, 'bytes'), 'bits'); // returns Unit 128 bits + * + * See also: + * + * unit + * + * @param {Unit | Array | Matrix} x The unit to be converted. + * @param {Unit | Array | Matrix} unit New unit. Can be a string like "cm" + * or a unit without value. + * @return {Unit | Array | Matrix} value with changed, fixed unit. + */ + var to = typed('to', { + 'Unit, Unit | string': function (x, unit) { + return x.to(unit); + }, + + 'Array | Matrix, any': function (x, unit) { + return collection.deepMap2(x, unit, to); + }, + + 'any, Array | Matrix': function (x, unit) { + return collection.deepMap2(x, unit, to); + } + }); + + return to; + } + + exports.name = 'to'; + exports.factory = factory; /***/ }, /* 155 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; + 'use strict'; + + var object= __webpack_require__(166); + + function factory (type, config, load, typed) { + /** + * Clone an object. + * + * Syntax: + * + * math.clone(x) + * + * Examples: + * + * math.clone(3.5); // returns number 3.5 + * math.clone(math.complex('2 - 4i'); // returns Complex 2 - 4i + * math.clone(math.unit(45, 'deg')); // returns Unit 45 deg + * math.clone([[1, 2], [3, 4]]); // returns Array [[1, 2], [3, 4]] + * math.clone("hello world"); // returns string "hello world" + * + * @param {*} x Object to be cloned + * @return {*} A clone of object x + */ + return typed('clone', { + 'any': object.clone + }); + } + + exports.name = 'clone'; + exports.factory = factory; - module.exports = function (math) { - var Matrix = __webpack_require__(7); - - /** - * Sort the items in a matrix. - * - * Syntax: - * - * math.filter(x, test) - * - * Examples: - * - * function isPositive (x) { - * return x > 0; - * } - * math.filter([6, -2, -1, 4, 3], isPositive); // returns [6, 4, 3] - * - * math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/); // returns ["23", "100", "55"] - * - * See also: - * - * forEach, map, sort - * - * @param {Matrix | Array} x A one dimensional matrix or array to filter - * @param {Function | RegExp} test - * A function or regular expression to test items. - * When `test` is a function, it must return a boolean. - * All entries for which `test` returns true are returned. - * @return {Matrix | Array} Returns the filtered matrix. - */ - math.filter = function (x, test) { - if (arguments.length !== 2) { - throw new math.error.ArgumentsError('filter', arguments.length, 2); - } - - if (x instanceof Matrix) { - var size = x.size(); - if (size.length > 1) { - throw new Error('Only one dimensional matrices supported'); - } - return new Matrix(_filter(x.toArray(), test)); - } - else if (Array.isArray(x)) { - return _filter(x, test); - } - else { - throw new math.error.UnsupportedTypeError('filter', math['typeof'](x), math['typeof'](compare)); - } - }; - - /** - * - * @param {Array} x - * @param {function | RegExp} test - * @return {Array} Returns the filtered array - * @private - */ - function _filter(x, test) { - if (typeof test === 'function') { - return x.filter(function (entry) { - return test(entry); - }); - } - else if (test instanceof RegExp) { - return x.filter(function (entry) { - return test.test(entry); - }); - } - else { - throw new TypeError('Function or RegExp expected'); - } - } - }; /***/ }, /* 156 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - string = util.string; - - /** - * Format a value of any type into a string. - * - * Syntax: - * - * math.format(value) - * math.format(value, options) - * math.format(value, precision) - * math.format(value, fn) - * - * Where: - * - * - `value: *` - * The value to be formatted - * - `options: Object` - * An object with formatting options. Available options: - * - `notation: String` - * Number notation. Choose from: - * - 'fixed' - * Always use regular number notation. - * For example '123.40' and '14000000' - * - 'exponential' - * Always use exponential notation. - * For example '1.234e+2' and '1.4e+7' - * - 'auto' (default) - * Regular number notation for numbers having an absolute value between - * `lower` and `upper` bounds, and uses exponential notation elsewhere. - * Lower bound is included, upper bound is excluded. - * For example '123.4' and '1.4e7'. - * - `precision: Number` - * A number between 0 and 16 to round the digits of the number. In case - * of notations 'exponential' and 'auto', `precision` defines the total - * number of significant digits returned and is undefined by default. - * In case of notation 'fixed', `precision` defines the number of - * significant digits after the decimal point, and is 0 by default. - * - `exponential: Object` - * An object containing two parameters, {Number} lower and {Number} upper, - * used by notation 'auto' to determine when to return exponential - * notation. Default values are `lower=1e-3` and `upper=1e5`. Only - * applicable for notation `auto`. - * - `fn: Function` - * A custom formatting function. Can be used to override the built-in notations. - * Function `fn` is called with `value` as parameter and must return a string. - * Is useful for example to format all values inside a matrix in a particular way. - * - * Examples: - * - * math.format(6.4); // returns '6.4' - * math.format(1240000); // returns '1.24e6' - * math.format(1/3); // returns '0.3333333333333333' - * math.format(1/3, 3); // returns '0.333' - * math.format(21385, 2); // returns '21000' - * math.format(12.071, {notation: 'fixed'}); // returns '12' - * math.format(2.3, {notation: 'fixed', precision: 2}); // returns '2.30' - * math.format(52.8, {notation: 'exponential'}); // returns '5.28e+1' - * - * See also: - * - * print - * - * @param {*} value Value to be stringified - * @param {Object | Function | Number} [options] Formatting options - * @return {String} The formatted value - */ - math.format = function format (value, options) { - var num = arguments.length; - if (num !== 1 && num !== 2) { - throw new math.error.ArgumentsError('format', num, 1, 2); - } - - return string.format(value, options); - }; - }; + 'use strict'; + + var object = __webpack_require__(166); + + function factory (type, config, load, typed, math) { + /** + * Set configuration options for math.js, and get current options + * @param {Object} [options] Available options: + * {String} matrix + * A string 'matrix' (default) or 'array'. + * {String} number + * A string 'number' (default) or 'bignumber' + * {Number} precision + * The number of significant digits for BigNumbers. + * Not applicable for Numbers. + * @return {Object} Returns the current configuration + */ + return function _config(options) { + if (options) { + // merge options + object.deepExtend(config, options); + + if (options.precision && type.BigNumber) { + type.BigNumber.config({ + precision: options.precision + }); + } + + // reload the constants (they depend on option number and precision) + // this must be done after math.type.BigNumber.config is applied + // TODO: this is an ugly solution, refreshing the constants like this + __webpack_require__(169)(math, config); + } + + // return a clone of the settings + return object.clone(config); + }; + } + + exports.name = 'config'; + exports.math = true; // request the math namespace as fifth argument + exports.factory = factory; /***/ }, /* 157 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - Complex = __webpack_require__(4), - Unit = __webpack_require__(8), - - isNumber = util.number.isNumber, - isString = util.string.isString, - isComplex = Complex.isComplex, - isUnit = Unit.isUnit; - - /** - * Import functions from an object or a module - * - * Syntax: - * - * math.import(object) - * math.import(object, options) - * - * Where: - * - * - `object: Object` - * An object with functions to be imported. - * - `options: Object` An object with import options. Available options: - * - `override: boolean` - * If true, existing functions will be overwritten. False by default. - * - `wrap: boolean` - * If true, the functions will be wrapped in a wrapper function - * which converts data types like Matrix to primitive data types like Array. - * The wrapper is needed when extending math.js with libraries which do not - * support these data types. False by default. - * - * Examples: - * - * // define new functions and variables - * math.import({ - * myvalue: 42, - * hello: function (name) { - * return 'hello, ' + name + '!'; - * } - * }); - * - * // use the imported function and variable - * math.myvalue * 2; // 84 - * math.hello('user'); // 'hello, user!' - * - * // import the npm module numbers - * // (must be installed first with `npm install numbers`) - * math.import('numbers', {wrap: true}); - * - * math.fibonacci(7); // returns 13 - * - * @param {String | Object} object Object with functions to be imported. - * @param {Object} [options] Import options. - */ - // TODO: return status information - math['import'] = function math_import(object, options) { - var num = arguments.length; - if (num != 1 && num != 2) { - throw new math.error.ArgumentsError('import', num, 1, 2); - } - - var name; - var opts = { - override: options && options.override || false, - wrap: options && options.wrap || false - }; - - if (isString(object)) { - // a string with a filename - - // istanbul ignore else (we cannot unit test the else case in a node.js environment) - if (true) { - // load the file using require - var _module = __webpack_require__(202)(object); - math_import(_module, options); - } - else { - throw new Error('Cannot load module: require not available.'); - } - } - else if (typeof object === 'object') { - // a map with functions - for (name in object) { - if (object.hasOwnProperty(name)) { - var value = object[name]; - if (isSupportedType(value)) { - _import(name, value, opts); - } - else { - math_import(value, options); - } - } - } - } - else { - throw new TypeError('Object or module name expected'); - } - }; - - /** - * Add a property to the math namespace and create a chain proxy for it. - * @param {String} name - * @param {*} value - * @param {Object} options See import for a description of the options - * @private - */ - function _import(name, value, options) { - if (options.override || math[name] === undefined) { - // add to math namespace - if (options.wrap && typeof value === 'function') { - // create a wrapper around the function - math[name] = function () { - var args = []; - for (var i = 0, len = arguments.length; i < len; i++) { - var arg = arguments[i]; - args[i] = arg && arg.valueOf(); - } - return value.apply(math, args); - }; - if (value && value.transform) { - math[name].transform = value.transform; - } - } - else { - // just create a link to the function or value - math[name] = value; - } - - // register the transform function if any - if (value && value.transform) { - math.expression.transform[name] = value.transform; - } - - // create a proxy for the chain - math.chaining.Chain.createProxy(name, value); - } - } - - /** - * Check whether given object is a supported type - * @param object - * @return {Boolean} - * @private - */ - function isSupportedType(object) { - return (typeof object == 'function') || - isNumber(object) || isString(object) || - isComplex(object) || isUnit(object); - // TODO: add boolean? - } - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + + /** + * Sort the items in a matrix. + * + * Syntax: + * + * math.filter(x, test) + * + * Examples: + * + * function isPositive (x) { + * return x > 0; + * } + * math.filter([6, -2, -1, 4, 3], isPositive); // returns [6, 4, 3] + * + * math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/); // returns ["23", "100", "55"] + * + * See also: + * + * forEach, map, sort + * + * @param {Matrix | Array} x A one dimensional matrix or array to filter + * @param {function | RegExp} test + * A function or regular expression to test items. + * When `test` is a function, it must return a boolean. + * All entries for which `test` returns true are returned. + * @return {Matrix | Array} Returns the filtered matrix. + */ + return typed('filter', { + 'Array, function': _filterCallback, + + 'Array, RegExp': _filterRegExp, + + 'Matrix, function': function (x, test) { + return matrix(_filterCallback(x.toArray(), test)); + }, + + 'Matrix, RegExp': function (x, test) { + return matrix(_filterRegExp(x.toArray(), test)); + } + }); + } + + /** + * Filter values in a callback given a callback function + * @param {Array} x + * @param {function} callback + * @return {Array} Returns the filtered array + * @private + */ + function _filterCallback (x, callback) { + if (size(x).length !== 1) { + throw new Error('Only one dimensional matrices supported'); + } + + return x.filter(function (entry) { + return callback(entry); + }); + } + + /** + * Filter values in a callback given a regular expression + * @param {Array} x + * @param {function} regexp + * @return {Array} Returns the filtered array + * @private + */ + function _filterRegExp (x, regexp) { + if (size(x).length !== 1) { + throw new Error('Only one dimensional matrices supported'); + } + + return x.filter(function (entry) { + return regexp.test(entry); + }); + } + + exports.name = 'filter'; + exports.factory = factory; /***/ }, /* 158 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var Matrix = __webpack_require__(7); - - - /** - * Create a new matrix or array with the results of the callback function executed on - * each entry of the matrix/array. - * - * Syntax: - * - * math.map(x, callback) - * - * Examples: - * - * math.map([1, 2, 3], function(value) { - * return value * value; - * }); // returns [1, 4, 9] - * - * See also: - * - * filter, forEach, sort - * - * @param {Matrix | Array} x The matrix to iterate on. - * @param {Function} callback The callback method is invoked with three - * parameters: the value of the element, the index - * of the element, and the matrix being traversed. - * @return {Matrix | array} Transformed map of x - */ - math.map = function (x, callback) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('map', arguments.length, 2); - } - - if (Array.isArray(x)) { - return _mapArray(x, callback); - } else if (x instanceof Matrix) { - return x.map(callback); - } else { - throw new math.error.UnsupportedTypeError('map', math['typeof'](x)); - } - }; - - function _mapArray (arrayIn, callback) { - var recurse = function (value, index) { - if (Array.isArray(value)) { - return value.map(function (child, i) { - // we create a copy of the index array and append the new index value - return recurse(child, index.concat(i)); - }); - } - else { - return callback(value, index, arrayIn); - } - }; - - return recurse(arrayIn, []); - } - }; + 'use strict'; + + var string = __webpack_require__(176); + + function factory (type, config, load, typed) { + /** + * Format a value of any type into a string. + * + * Syntax: + * + * math.format(value) + * math.format(value, options) + * math.format(value, precision) + * math.format(value, fn) + * + * Where: + * + * - `value: *` + * The value to be formatted + * - `options: Object` + * An object with formatting options. Available options: + * - `notation: String` + * Number notation. Choose from: + * - 'fixed' + * Always use regular number notation. + * For example '123.40' and '14000000' + * - 'exponential' + * Always use exponential notation. + * For example '1.234e+2' and '1.4e+7' + * - 'auto' (default) + * Regular number notation for numbers having an absolute value between + * `lower` and `upper` bounds, and uses exponential notation elsewhere. + * Lower bound is included, upper bound is excluded. + * For example '123.4' and '1.4e7'. + * - `precision: Number` + * A number between 0 and 16 to round the digits of the number. In case + * of notations 'exponential' and 'auto', `precision` defines the total + * number of significant digits returned and is undefined by default. + * In case of notation 'fixed', `precision` defines the number of + * significant digits after the decimal point, and is 0 by default. + * - `exponential: Object` + * An object containing two parameters, {Number} lower and {Number} upper, + * used by notation 'auto' to determine when to return exponential + * notation. Default values are `lower=1e-3` and `upper=1e5`. Only + * applicable for notation `auto`. + * - `fn: Function` + * A custom formatting function. Can be used to override the built-in notations. + * Function `fn` is called with `value` as parameter and must return a string. + * Is useful for example to format all values inside a matrix in a particular way. + * + * Examples: + * + * math.format(6.4); // returns '6.4' + * math.format(1240000); // returns '1.24e6' + * math.format(1/3); // returns '0.3333333333333333' + * math.format(1/3, 3); // returns '0.333' + * math.format(21385, 2); // returns '21000' + * math.format(12.071, {notation: 'fixed'}); // returns '12' + * math.format(2.3, {notation: 'fixed', precision: 2}); // returns '2.30' + * math.format(52.8, {notation: 'exponential'}); // returns '5.28e+1' + * + * See also: + * + * print + * + * @param {*} value Value to be stringified + * @param {Object | Function | Number} [options] Formatting options + * @return {String} The formatted value + */ + return typed('format', { + 'any': string.format, + 'any, Object | function | number': string.format + }); + } + + exports.name = 'format'; + exports.factory = factory; /***/ }, /* 159 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var util = __webpack_require__(164), - - isString = util.string.isString; - - /** - * Interpolate values into a string template. - * - * Syntax: - * - * math.print(template, values) - * math.print(template, values, precision) - * - * Example usage: - * - * // the following outputs: 'Lucy is 5 years old' - * math.print('Lucy is $age years old', {age: 5}); - * - * // the following outputs: 'The value of pi is 3.141592654' - * math.print('The value of pi is $pi', {pi: math.pi}, 10); - * - * // the following outputs: 'hello Mary! The date is 2013-03-23' - * math.print('Hello $user.name! The date is $date', { - * user: { - * name: 'Mary', - * }, - * date: new Date(2013, 2, 23).toISOString().substring(0, 10) - * }); - * - * See also: - * - * format - * - * @param {String} template A string containing variable placeholders. - * @param {Object} values An object containing variables which will - * be filled in in the template. - * @param {Number} [precision] Number of digits to format numbers. - * If not provided, the value will not be rounded. - * @return {String} Interpolated string - */ - math.print = function print (template, values, precision) { - var num = arguments.length; - if (num != 2 && num != 3) { - throw new math.error.ArgumentsError('print', num, 2, 3); - } - - if (!isString(template)) { - throw new TypeError('String expected as first parameter in function format'); - } - if (!(values instanceof Object)) { - throw new TypeError('Object expected as second parameter in function format'); - } - - // format values into a string - return template.replace(/\$([\w\.]+)/g, function (original, key) { - var keys = key.split('.'); - var value = values[keys.shift()]; - while (keys.length && value !== undefined) { - var k = keys.shift(); - value = k ? value[k] : value + '.'; - } - - if (value !== undefined) { - if (!isString(value)) { - return math.format(value, precision); - } - else { - return value; - } - } - - return original; - } - ); - }; - }; + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Create a new matrix or array with the results of the callback function executed on + * each entry of the matrix/array. + * + * Syntax: + * + * math.map(x, callback) + * + * Examples: + * + * math.map([1, 2, 3], function(value) { + * return value * value; + * }); // returns [1, 4, 9] + * + * See also: + * + * filter, forEach, sort + * + * @param {Matrix | Array} x The matrix to iterate on. + * @param {Function} callback The callback method is invoked with three + * parameters: the value of the element, the index + * of the element, and the matrix being traversed. + * @return {Matrix | array} Transformed map of x + */ + return typed('map', { + 'Array, function': _map, + + 'Matrix, function': function (x, callback) { + return x.map(callback); + } + }); + } + + /** + * Map for a multi dimensional array + * @param {Array} array + * @param {function} callback + * @return {Array} + * @private + */ + function _map (array, callback) { + var recurse = function (value, index) { + if (Array.isArray(value)) { + return value.map(function (child, i) { + // we create a copy of the index array and append the new index value + return recurse(child, index.concat(i)); + }); + } + else { + return callback(value, index, array); + } + }; + + return recurse(array, []); + } + + exports.name = 'map'; + exports.factory = factory; /***/ }, /* 160 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; + 'use strict'; + + var isString = __webpack_require__(176).isString; + var format = __webpack_require__(176).format; + + function factory (type, config, load, typed) { + /** + * Interpolate values into a string template. + * + * Syntax: + * + * math.print(template, values) + * math.print(template, values, precision) + * + * Example usage: + * + * // the following outputs: 'Lucy is 5 years old' + * math.print('Lucy is $age years old', {age: 5}); + * + * // the following outputs: 'The value of pi is 3.141592654' + * math.print('The value of pi is $pi', {pi: math.pi}, 10); + * + * // the following outputs: 'hello Mary! The date is 2013-03-23' + * math.print('Hello $user.name! The date is $date', { + * user: { + * name: 'Mary', + * }, + * date: new Date(2013, 2, 23).toISOString().substring(0, 10) + * }); + * + * See also: + * + * format + * + * @param {String} template A string containing variable placeholders. + * @param {Object} values An object containing variables which will + * be filled in in the template. + * @param {Number} [precision] Number of digits to format numbers. + * If not provided, the value will not be rounded. + * @return {String} Interpolated string + */ + return typed ('print', { + 'string, Object': _print, + 'string, Object, number': _print + }); + } + + /** + * Interpolate values into a string template. + * @param {string} template + * @param {Object} values + * @param {number} [precision] + * @returns {string} Interpolated string + * @private + */ + function _print(template, values, precision) { + return template.replace(/\$([\w\.]+)/g, function (original, key) { + var keys = key.split('.'); + var value = values[keys.shift()]; + while (keys.length && value !== undefined) { + var k = keys.shift(); + value = k ? value[k] : value + '.'; + } + + if (value !== undefined) { + if (!isString(value)) { + return format(value, precision); + } + else { + return value; + } + } + + return original; + } + ); + } + + exports.name = 'print'; + exports.factory = factory; - module.exports = function (math) { - var Matrix = __webpack_require__(7); - - /** - * Sort the items in a matrix. - * - * Syntax: - * - * math.sort(x) - * math.sort(x, compare) - * - * Examples: - * - * math.sort([5, 10, 1]); // returns [1, 5, 10] - * math.sort(['C', 'B', 'A', 'D']); // returns ['A', 'B', 'C', 'D'] - * - * function sortByLength (a, b) { - * return a.length - b.length; - * } - * math.sort(['Langdon', 'Tom', 'Sara'], sortByLength); // returns ['Tom', 'Sara', 'Langdon'] - * - * See also: - * - * filter, forEach, map - * - * @param {Matrix | Array} x A one dimensional matrix or array to sort - * @param {Function | 'asc' | 'desc'} [compare='asc'] - * An optional comparator function. The function is called as - * `compare(a, b)`, and must return 1 when a > b, -1 when a < b, - * and 0 when a == b. - * @return {Matrix | Array} Returns the sorted matrix. - */ - math.sort = function (x, compare) { - var _compare = null; - - if (arguments.length === 1) { - _compare = math.compare; - } - else if (arguments.length === 2) { - if (typeof compare === 'function') { - _compare = compare; - } - else if (compare === 'asc') { - _compare = math.compare; - } - else if (compare === 'desc') { - _compare = function (a, b) { - return -math.compare(a, b); - } - } - else { - throw new math.error.UnsupportedTypeError('sort', math['typeof'](x), math['typeof'](compare)); - } - } - else { - throw new math.error.ArgumentsError('sort', arguments.length, 1, 2); - } - - if (x instanceof Matrix) { - var size = x.size(); - if (size.length > 1) { - throw new Error('Only one dimensional matrices supported'); - } - return new Matrix(x.toArray().sort(_compare)); - } - else if (Array.isArray(x)) { - return x.sort(_compare); - } - else { - throw new math.error.UnsupportedTypeError('sort', math['typeof'](x), math['typeof'](compare)); - } - }; - }; /***/ }, /* 161 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (math) { - var types = __webpack_require__(335), - - Complex = __webpack_require__(4), - Matrix = __webpack_require__(7), - Unit = __webpack_require__(8), - Index = __webpack_require__(6), - Range = __webpack_require__(5), - Help = __webpack_require__(9); - - /** - * Determine the type of a variable. - * - * Function `typeof` recognizes the following types of objects: - * - * Object | Returns | Example - * ---------------------- | ------------- | ------------------------------------------ - * Array | `'array'` | `math.typeof ([1, 2, 3])` - * boolean | `'boolean'` | `math.typeof (true)` - * Date | `'date'` | `math.typeof (new Date())` - * null | `'null'` | `math.typeof(null)` - * number | `'number'` | `math.typeof(3.5)` - * Object | `'object'` | `math.typeof ({a: 2, b: 3})` - * RegExp | `'regexp'` | `math.typeof (/a regexp/)` - * string | `'string'` | `math.typeof ('hello world')` - * undefined | `'undefined'` | `math.typeof(undefined)` - * math.chaining.Chain | `'chain'` | `math.typeof (math.chain(2))` - * math.type.BigNumber | `'bignumber'` | `math.typeof (math.bignumber('2.3e500'))` - * math.type.Complex | `'complex'` | `math.typeof (math.complex(2, 3))` - * math.type.Help | `'help'` | `math.typeof (math.help('sqrt'))` - * math.type.Index | `'index'` | `math.typeof (math.index(1, 3))` - * math.type.Matrix | `'matrix'` | `math.typeof (math.matrix([[1,2], [3, 4]]))` - * math.type.Range | `'range'` | `math.typeof (math.range(0, 10))` - * math.type.Unit | `'unit'` | `math.typeof (math.unit('45 deg'))` - * - * Syntax: - * - * math.typeof(x) - * - * Examples: - * - * math.typeof(3.5); // returns 'number' - * math.typeof(math.complex('2 - 4i')); // returns 'complex' - * math.typeof(math.unit('45 deg')); // returns 'unit' - * math.typeof('hello world'); // returns 'string' - * - * @param {*} x The variable for which to test the type. - * @return {String} Lower case type, for example 'number', 'string', 'array'. - */ - math['typeof'] = function _typeof (x) { - if (arguments.length != 1) { - throw new math.error.ArgumentsError('typeof', arguments.length, 1); - } - - // JavaScript types - var type = types.type(x); - - // math.js types - if (type === 'object') { - if (x instanceof Complex) return 'complex'; - if (x instanceof Matrix) return 'matrix'; - if (x instanceof Unit) return 'unit'; - if (x instanceof Index) return 'index'; - if (x instanceof Range) return 'range'; - if (x instanceof Help) return 'help'; - - // the following types are different instances per math.js instance - if (x instanceof math.type.BigNumber) return 'bignumber'; - if (x instanceof math.chaining.Chain) return 'chain'; - } - - return type; - }; - }; + 'use strict'; + + var size = __webpack_require__(172).size; + + function factory (type, config, load, typed) { + var matrix = load(__webpack_require__(75)); + var asc = load(__webpack_require__(113)); + var desc = function (a, b) { + return -asc(a, b); + }; + + /** + * Sort the items in a matrix. + * + * Syntax: + * + * math.sort(x) + * math.sort(x, compare) + * + * Examples: + * + * math.sort([5, 10, 1]); // returns [1, 5, 10] + * math.sort(['C', 'B', 'A', 'D']); // returns ['A', 'B', 'C', 'D'] + * + * function sortByLength (a, b) { + * return a.length - b.length; + * } + * math.sort(['Langdon', 'Tom', 'Sara'], sortByLength); // returns ['Tom', 'Sara', 'Langdon'] + * + * See also: + * + * filter, forEach, map + * + * @param {Matrix | Array} x A one dimensional matrix or array to sort + * @param {Function | 'asc' | 'desc'} [compare='asc'] + * An optional _comparator function. The function is called as + * `compare(a, b)`, and must return 1 when a > b, -1 when a < b, + * and 0 when a == b. + * @return {Matrix | Array} Returns the sorted matrix. + */ + return typed('sort', { + 'Array': function (x) { + _arrayIsVector(x); + return x.sort(asc); + }, + + 'Matrix': function (x) { + _matrixIsVector(x); + return matrix(x.toArray().sort(asc), x.storage()); + }, + + 'Array, function': function (x, _comparator) { + _arrayIsVector(x); + return x.sort(_comparator); + }, + + 'Matrix, function': function (x, _comparator) { + _matrixIsVector(x); + return matrix(x.toArray().sort(_comparator), x.storage()); + }, + + 'Array, string': function (x, order) { + _arrayIsVector(x); + return x.sort(_comparator(order)); + }, + + 'Matrix, string': function (x, order) { + _matrixIsVector(x); + return matrix(x.toArray().sort(_comparator(order)), x.storage()); + } + }); + + /** + * Get the comparator for given order ('asc' or 'desc') + * @param {'asc' | 'desc'} order + * @return {function} Returns a _comparator function + */ + function _comparator (order) { + if (order === 'asc') { + return asc; + } + else if (order === 'desc') { + return desc; + } + else { + throw new Error('String "asc" or "desc" expected'); + } + } + + /** + * Validate whether an array is one dimensional + * Throws an error when this is not the case + * @param {Array} array + * @private + */ + function _arrayIsVector (array) { + if (size(array).length !== 1) { + throw new Error('One dimensional array expected'); + } + } + + /** + * Validate whether a matrix is one dimensional + * Throws an error when this is not the case + * @param {Matrix} matrix + * @private + */ + function _matrixIsVector (matrix) { + if (matrix.size().length !== 1) { + throw new Error('One dimensional matrix expected'); + } + } + } + + exports.name = 'sort'; + exports.factory = factory; /***/ }, /* 162 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; + 'use strict'; + + var types = __webpack_require__(216); + + function factory (type, config, load, typed) { + /** + * Determine the type of a variable. + * + * Function `typeof` recognizes the following types of objects: + * + * Object | Returns | Example + * ---------------------- | ------------- | ------------------------------------------ + * Array | `'array'` | `math.typeof ([1, 2, 3])` + * boolean | `'boolean'` | `math.typeof (true)` + * Date | `'date'` | `math.typeof (new Date())` + * null | `'null'` | `math.typeof(null)` + * number | `'number'` | `math.typeof(3.5)` + * Object | `'object'` | `math.typeof ({a: 2, b: 3})` + * RegExp | `'regexp'` | `math.typeof (/a regexp/)` + * string | `'string'` | `math.typeof ('hello world')` + * undefined | `'undefined'` | `math.typeof(undefined)` + * math.type.BigNumber | `'bignumber'` | `math.typeof (math.bignumber('2.3e500'))` + * math.type.Chain | `'chain'` | `math.typeof (math.chain(2))` + * math.type.Complex | `'complex'` | `math.typeof (math.complex(2, 3))` + * math.type.Help | `'help'` | `math.typeof (math.help('sqrt'))` + * math.type.Index | `'index'` | `math.typeof (math.index(1, 3))` + * math.type.Matrix | `'matrix'` | `math.typeof (math.matrix([[1,2], [3, 4]]))` + * math.type.Range | `'range'` | `math.typeof (math.range(0, 10))` + * math.type.Unit | `'unit'` | `math.typeof (math.unit('45 deg'))` + * + * Syntax: + * + * math.typeof(x) + * + * Examples: + * + * math.typeof(3.5); // returns 'number' + * math.typeof(math.complex('2 - 4i')); // returns 'complex' + * math.typeof(math.unit('45 deg')); // returns 'unit' + * math.typeof('hello world'); // returns 'string' + * + * @param {*} x The variable for which to test the type. + * @return {String} Lower case type, for example 'number', 'string', 'array'. + */ + return typed('_typeof', { + 'any': function (x) { + // JavaScript types + var t = types.type(x); + + // math.js types + if (t === 'object') { + if (x instanceof type.Complex) return 'complex'; + if (x instanceof type.Matrix) return 'matrix'; + if (x instanceof type.Unit) return 'unit'; + if (x instanceof type.Index) return 'index'; + if (x instanceof type.Range) return 'range'; + if (x instanceof type.Help) return 'help'; + + // the following types are different instances per math.js instance + if (x instanceof type.BigNumber) return 'bignumber'; + if (x instanceof type.Chain) return 'chain'; + } + + return t; + } + }); + } + + exports.name = 'typeof'; + exports.factory = factory; - module.exports = function (math) { - var Matrix = __webpack_require__(7); - - /** - * Iterate over all elements of a matrix/array, and executes the given callback function. - * - * Syntax: - * - * math.forEach(x, callback) - * - * Examples: - * - * math.forEach([1, 2, 3], function(value) { - * console.log(value); - * }); - * // outputs 1, 2, 3 - * - * See also: - * - * filter, map, sort - * - * @param {Matrix | Array} x The matrix to iterate on. - * @param {Function} callback The callback function is invoked with three - * parameters: the value of the element, the index - * of the element, and the Matrix/array being traversed. - */ - math.forEach = function (x, callback) { - if (arguments.length != 2) { - throw new math.error.ArgumentsError('forEach', arguments.length, 2); - } - - if (Array.isArray(x)) { - return _forEachArray(x, callback); - } else if (x instanceof Matrix) { - return x.forEach(callback); - } else { - throw new math.error.UnsupportedTypeError('forEach', math['typeof'](x)); - } - }; - - function _forEachArray (array, callback) { - var recurse = function (value, index) { - if (Array.isArray(value)) { - value.forEach(function (child, i) { - // we create a copy of the index array and append the new index value - recurse(child, index.concat(i)); - }); - } - else { - callback(value, index, array); - } - }; - recurse(array, []); - } - }; /***/ }, /* 163 */ /***/ function(module, exports, __webpack_require__) { - var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/** - * typed-function - * - * Type checking for JavaScript functions - * - * https://github.com/josdejong/typed-function - */ - (function (factory) { - if (true) { - // AMD. Register as an anonymous module. - !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); - } else if (typeof exports === 'object') { - // OldNode. Does not work with strict CommonJS, but - // only CommonJS-like environments that support module.exports, - // like OldNode. - module.exports = factory(); - } else { - // Browser globals (root is window) - window.typed = factory(); - } - }(function () { - 'use strict'; - - /** - * Get a type test function for a specific data type - * @param {string} type A data type like 'number' or 'string' - * @returns {function(obj: *) : boolean} Returns a type testing function. - * Throws an error for an unknown type. - */ - function getTypeTest(type) { - var test = typed.types[type]; - if (!test) { - var matches = Object.keys(typed.types) - .filter(function (t) { - return t.toLowerCase() == type.toLowerCase(); - }) - .map(function (t) { - return '"' + t + '"'; - }); - - throw new Error('Unknown type "' + type + '"' + - (matches.length ? ('. Did you mean ' + matches.join(', or ') + '?') : '')); - } - return test; - } - - /** - * Create an ArgumentsError. Creates messages like: - * - * Unexpected type of argument (expected: ..., actual: ..., index: ...) - * Too few arguments (expected: ..., index: ...) - * Too many arguments (expected: ..., actual: ...) - * - * @param {String} fn Function name - * @param {Object} args The actual arguments - * @param {Number} index Current argument index - * @param {string} [expected] An optional, comma separated string with - * expected types on given index - * @extends Error - */ - function createError(fn, args, index, expected) { - var actual = args[index]; - var actualType = getTypeOf(actual); - var _expected = expected ? expected.split(',') : null; - var anyType = _expected && contains(_expected, 'any'); - var message; - var data = { - fn: fn, - index: index, - actual: actual, - expected: _expected - }; - - //console.log('createError', fn, args, index, expected) // TODO: cleanup - - // TODO: add function name to the message - if (_expected) { - if (args.length > index && !anyType) { - // unexpected type - message = 'Unexpected type of argument' + - ' (expected: ' + _expected.join(' or ') + ', actual: ' + actualType + ', index: ' + index + ')'; - } - else { - // too few arguments - message = 'Too few arguments' + - ' (expected: ' + _expected.join(' or ') + ', index: ' + index + ')'; - } - } - else { - // too many arguments - message = 'Too many arguments' + - ' (expected: ' + index + ', actual: ' + args.length + ')' - } - - var err = new TypeError(message); - err.data = data; - return err; - } - - /** - * Collection with function references (local shortcuts to functions) - * @constructor - * @param {string} [name='refs'] Optional name for the refs, used to generate - * JavaScript code - */ - function Refs(name) { - this.name = name || 'refs'; - this.categories = {}; - } - - /** - * Add a function reference. - * @param {function} fn - * @param {string} [category='fn'] A function category, like 'fn' or 'signature' - * @returns {string} Returns the function name, for example 'fn0' or 'signature2' - */ - Refs.prototype.add = function (fn, category) { - var cat = category || 'fn'; - if (!this.categories[cat]) this.categories[cat] = []; - - var index = this.categories[cat].indexOf(fn); - if (index == -1) { - index = this.categories[cat].length; - this.categories[cat].push(fn); - } - - return cat + index; - }; - - /** - * Create code lines for all function references - * @returns {string} Returns the code containing all function references - */ - Refs.prototype.toCode = function () { - var code = []; - var path = this.name + '.categories'; - var categories = this.categories; - - Object.keys(categories).forEach(function (cat) { - categories[cat].forEach(function (ref, index) { - code.push('var ' + cat + index + ' = ' + path + '[\'' + cat + '\'][' + index + '];'); - }); - }); - - return code.join('\n'); - }; - - /** - * A function parameter - * @param {string | string[] | Param} types A parameter type like 'string', - * 'number | boolean' - * @param {boolean} [varArgs=false] Variable arguments if true - * @constructor - */ - function Param(types, varArgs) { - // parse the types, can be a string with types separated by pipe characters | - if (typeof types === 'string') { - // parse variable arguments operator (ellipses '...number') - var _types = types.trim(); - var _varArgs = _types.substr(0, 3) === '...'; - if (_varArgs) { - _types = _types.substr(3); - } - if (_types === '') { - this.types = ['any']; - } - else { - this.types = _types.split('|').map(function (type) { - return type.trim(); - }); - } - } - else if (Array.isArray(types)) { - this.types = types; - } - else if (types instanceof Param) { - return types.clone(); - } - else { - throw new Error('String or Array expected'); - } - - // can hold a type to which to convert when handling this parameter - this.conversions = []; - // TODO: better implement support for conversions, be able to add conversions via constructor (support a new type Object?) - - // variable arguments - this.varArgs = _varArgs || varArgs || false; - - // check for any type arguments - this.anyType = this.types.some(function (type) { - return type == 'any'; - }); - } - - /** - * Order Params - * any type ('any') will be ordered last, and object as second last (as other - * types may be an object as well, like Array). - * - * @param {Param} a - * @param {Param} b - * @returns {number} Returns 1 if a > b, -1 if a < b, and else 0. - */ - Param.compare = function (a, b) { - if (a.anyType) return 1; - if (b.anyType) return -1; - - if (contains(a.types, 'Object')) return 1; - if (contains(b.types, 'Object')) return -1; - - if (a.hasConversions()) { - if (b.hasConversions()) { - var ac = a.conversions.filter(function (conversion) { - return conversion !== undefined; - })[0]; - var bc = b.conversions.filter(function (conversion) { - return conversion !== undefined; - })[0]; - return typed.conversions.indexOf(ac) - typed.conversions.indexOf(bc); - } - else { - return 1; - } - } - else { - if (b.hasConversions()) { - return -1; - } - } - - return 0; - }; - - /** - * Test whether this parameters types overlap an other parameters types. - * @param {Param} other - * @return {boolean} Returns true when there are conflicting types - */ - Param.prototype.overlapping = function (other) { - return this.types.some(function (type) { - return contains(other.types, type); - }); - }; - - /** - * Create a clone of this param - * @returns {Param} Returns a cloned version of this param - */ - Param.prototype.clone = function () { - var param = new Param(this.types.slice(), this.varArgs); - param.conversions = this.conversions.slice(); - return param; - }; - - /** - * Test whether this parameter contains conversions - * @returns {boolean} Returns true if the parameter contains one or - * multiple conversions. - */ - Param.prototype.hasConversions = function () { - return this.conversions.length > 0; - }; - - /** - * Return a string representation of this params types, like 'string' or - * 'number | boolean' or '...number' - * @param {boolean} [toConversion] If true, the returned types string - * contains the types where the parameter - * will convert to. If false (default) - * the "from" types are returned - * @returns {string} - */ - Param.prototype.toString = function (toConversion) { - var types = this.types - .map(function (type, i) { - var conversion = this.conversions[i]; - return toConversion && conversion ? conversion.to : type; - }.bind(this)) - .filter(function (type, i, types) { - return types.indexOf(type) === i; // dedupe array - }); - - return (this.varArgs ? '...' : '') + types.join('|'); - }; - - /** - * A function signature - * @param {string | string[] | Param[]} params - * Array with the type(s) of each parameter, - * or a comma separated string with types - * @param {function} fn The actual function - * @constructor - */ - function Signature(params, fn) { - if (typeof params === 'string') { - this.params = (params !== '') ? params.split(',').map(function (types) { - return new Param(types); - }) : []; - } - else if (Array.isArray(params)) { - this.params = params.map(function (types) { - return new Param(types); - }); - } - else { - throw new Error('string or Array expected'); - } - - // check variable arguments operator '...' - var withVarArgs = this.params.filter(function (param) { - return param.varArgs; - }); - if (withVarArgs.length === 0) { - this.varArgs = false; - } - else if (withVarArgs[0] === this.params[this.params.length - 1]) { - this.varArgs = true; - } - else { - throw new SyntaxError('Unexpected variable arguments operator "..."'); - } - - this.fn = fn; - } - - /** - * Create a clone of this signature - * @returns {Signature} Returns a cloned version of this signature - */ - Signature.prototype.clone = function () { - return new Signature(this.params.slice(), this.fn); - }; - - /** - * Expand a signature: split params with union types in separate signatures - * For example split a Signature "string | number" into two signatures. - * @return {Signature[]} Returns an array with signatures (at least one) - */ - Signature.prototype.expand = function () { - var signatures = []; - - function recurse(signature, path) { - if (path.length < signature.params.length) { - var param = signature.params[path.length]; - if (param.varArgs) { - // a variable argument. do not split the types in the parameter - var newParam = param.clone(); - - // add conversions to the parameter - // recurse for all conversions - typed.conversions.forEach(function (conversion) { - if (!contains(param.types, conversion.from) && contains(param.types, conversion.to)) { - var i = newParam.types.length; - newParam.types[i] = conversion.from; - newParam.conversions[i] = conversion; - } - }); - - recurse(signature, path.concat(newParam)); - } - else { - // split each type in the parameter - param.types.forEach(function (type) { - recurse(signature, path.concat(new Param(type))); - }); - - // recurse for all conversions - typed.conversions.forEach(function (conversion) { - if (!contains(param.types, conversion.from) && contains(param.types, conversion.to)) { - var newParam = new Param(conversion.from); - newParam.conversions[0] = conversion; - recurse(signature, path.concat(newParam)); - } - }); - } - } - else { - signatures.push(new Signature(path, signature.fn)); - } - } - recurse(this, []); - - return signatures; - }; - - /** - * Compare two signatures. - * - * When two params are equal and contain conversions, they will be sorted - * by lowest index of the first conversions. - * - * @param {Signature} a - * @param {Signature} b - * @returns {number} Returns 1 if a > b, -1 if a < b, and else 0. - */ - Signature.compare = function (a, b) { - if (a.params.length > b.params.length) return 1; - if (a.params.length < b.params.length) return -1; - - // count the number of conversions - var ac = a.params.filter(function (param) { - return param.hasConversions(); - }); - var bc = b.params.filter(function (param) { - return param.hasConversions(); - }); - - if (ac.length > bc.length) return 1; - if (ac.length < bc.length) return -1; - - // compare the conversion index per parameter - for (var i = 0; i < a.params.length; i++) { - var cmp = Param.compare(a.params[i], b.params[i]); - if (cmp !== 0) { - return cmp; - } - } - - return 0; - }; - - /** - * Test whether any of the signatures parameters has conversions - * @return {boolean} Returns true when any of the parameters contains - * conversions. - */ - Signature.prototype.hasConversions = function () { - return this.params.some(function (param) { - return param.hasConversions(); - }); - }; - - /** - * Generate the code to invoke this signature - * @param {Refs} refs - * @param {string} prefix - * @returns {string} Returns code - */ - Signature.prototype.toCode = function (refs, prefix) { - var code = []; - var args = this.params.map(function (param, index) { - var conversion = param.conversions[0]; - if (param.varArgs) { - return 'varArgs'; - } - else if (conversion) { - return refs.add(conversion.convert, 'convert') + '(arg' + index + ')'; - } - else { - return 'arg' + index; - } - }).join(', '); - var ref = this.fn ? refs.add(this.fn, 'signature') : undefined; - if (ref) { - return prefix + 'return ' + ref + '(' + args + '); // signature: ' + this.params.join(', '); - } - - return code.join('\n'); - }; - - /** - * Return a string representation of the signature - * @returns {string} - */ - Signature.prototype.toString = function () { - return this.params.join(', '); - }; - - /** - * A group of signatures with the same parameter on given index - * @param {Param[]} path - * @param {Signature} [signature] - * @param {Node[]} childs - * @constructor - */ - function Node(path, signature, childs) { - this.path = path || []; - this.param = path[path.length - 1] || null; - this.signature = signature || null; - this.childs = childs || []; - } - - /** - * Generate code for this group of signatures - * @param {Refs} refs - * @param {string} prefix - * @param {Node | undefined} [anyType] Sibling of this node with any type parameter - * @returns {string} Returns the code as string - */ - Node.prototype.toCode = function (refs, prefix, anyType) { - // TODO: split this function in multiple functions, it's too large - var code = []; - - if (this.param) { - var index = this.path.length - 1; - var conversion = this.param.conversions[0]; - var comment = '// type: ' + (conversion ? - (conversion.from + ' (convert to ' + conversion.to + ')') : - this.param); - - // non-root node (path is non-empty) - if (this.param.varArgs) { - if (this.param.anyType) { - // variable arguments with any type - code.push(prefix + 'if (arguments.length > ' + index + ') {'); - code.push(prefix + ' var varArgs = [];'); - code.push(prefix + ' for (var i = ' + index + '; i < arguments.length; i++) {'); - code.push(prefix + ' varArgs.push(arguments[i]);'); - code.push(prefix + ' }'); - code.push(this.signature.toCode(refs, prefix + ' ')); - code.push(prefix + '}'); - } - else { - // variable arguments with a fixed type - var getTests = function (types, arg) { - return types - .map(function (type) { - return refs.add(getTypeTest(type), 'test') + '(' + arg + ')'; - }) - .join(' || '); - }.bind(this); - - var allTypes = this.param.types; - var exactTypes = allTypes.filter(function (type, i) { - return this.param.conversions[i] === undefined; - }.bind(this)); - - code.push(prefix + 'if (' + getTests(allTypes, 'arg' + index) + ') { ' + comment); - code.push(prefix + ' var varArgs = [arg' + index + '];'); - code.push(prefix + ' for (var i = ' + (index + 1) + '; i < arguments.length; i++) {'); - code.push(prefix + ' if (' + getTests(exactTypes, 'arguments[i]') + ') {'); - code.push(prefix + ' varArgs.push(arguments[i]);'); - allTypes.forEach(function (type, i) { - var conversion = this.param.conversions[i]; - if (conversion) { - var test = refs.add(getTypeTest(type), 'test'); - var convert = refs.add(conversion.convert, 'convert'); - code.push(prefix + ' }'); - code.push(prefix + ' else if (' + test + '(arguments[i])) {'); - code.push(prefix + ' varArgs.push(' + convert + '(arguments[i]));'); - } - }.bind(this)); - code.push(prefix + ' } else {'); - code.push(prefix + ' throw createError(\'\', arguments, i, \'' + allTypes.join(',') + '\');'); - code.push(prefix + ' }'); - code.push(prefix + ' }'); - code.push(this.signature.toCode(refs, prefix + ' ')); - code.push(prefix + '}'); - } - } - else { - if (this.param.anyType) { - // any type - code.push(prefix + '// type: any'); - code.push(this._innerCode(refs, prefix, anyType)); - } - else { - // regular type - var type = this.param.types[0]; - var test = type !== 'any' ? refs.add(getTypeTest(type), 'test') : null; - - code.push(prefix + 'if (' + test + '(arg' + index + ')) { ' + comment); - code.push(this._innerCode(refs, prefix + ' ', anyType)); - code.push(prefix + '}'); - } - } - } - else { - // root node (path is empty) - code.push(this._innerCode(refs, prefix, anyType)); - } - - return code.join('\n'); - }; - - /** - * Generate inner code for this group of signatures. - * This is a helper function of Node.prototype.toCode - * @param {Refs} refs - * @param {string} prefix - * @param {Node | undefined} [anyType] Sibling of this node with any type parameter - * @returns {string} Returns the inner code as string - * @private - */ - Node.prototype._innerCode = function(refs, prefix, anyType) { - var code = []; - - if (this.signature) { - code.push(prefix + 'if (arguments.length === ' + this.path.length + ') {'); - code.push(this.signature.toCode(refs, prefix + ' ')); - code.push(prefix + '}'); - } - - var nextAnyType = this.childs.filter(function (child) { - return child.param.anyType; - })[0]; - - this.childs.forEach(function (child) { - code.push(child.toCode(refs, prefix, nextAnyType)); - }); - - if (anyType && !this.param.anyType) { - code.push(anyType.toCode(refs, prefix, nextAnyType)); - } - - var exceptions = this._exceptions(refs, prefix); - if (exceptions) { - code.push(exceptions); - } - - return code.join('\n'); - }; - - /** - * Generate code to throw exceptions - * @param {Refs} refs - * @param {string} prefix - * @returns {string} Returns the inner code as string - * @private - */ - Node.prototype._exceptions = function (refs, prefix) { - var index = this.path.length; - - // TODO: add function name to exceptions - if (this.childs.length === 0) { - // TODO: can this condition be simplified? (we have a fall-through here) - return [ - prefix + 'if (arguments.length > ' + index + ') {', - prefix + ' throw createError(\'\', arguments, ' + index + ')', - prefix + '}' - ].join('\n'); - } - else { - var types = this.childs.reduce(function (types, node) { - node.param && node.param.types.forEach(function (type) { - if (types.indexOf(type) === -1) { - types.push(type); - } - }); - - return types; - }, []); - - return prefix + 'throw createError(\'\', arguments, ' + index + ', \'' + types.join(',') + '\');'; - } - }; - - /** - * Split all raw signatures into an array with expanded Signatures - * @param {Object.} rawSignatures - * @return {Signature[]} Returns an array with expanded signatures - */ - function parseSignatures(rawSignatures) { - var map = Object.keys(rawSignatures) - .reduce(function (signatures, types) { - var fn = rawSignatures[types]; - var signature = new Signature(types, fn); - - signature.expand().forEach(function (signature) { - var key = signature.toString(); - if (signatures[key] === undefined) { - signatures[key] = signature; - } - else { - var cmp = Signature.compare(signature, signatures[key]); - if (cmp < 0) { - // override if sorted first - signatures[key] = signature; - } - else if (cmp === 0) { - throw new Error('Signature "' + key + '" is defined twice'); - } - // else: just ignore - } - }); - - return signatures; - }, {}); - - // convert from map to array - var arr = Object.keys(map).map(function (types) { - return map[types]; - }); - - // filter redundant conversions from signatures with varArgs - // TODO: simplify this loop or move it to a separate function - arr.forEach(function (signature) { - if (signature.varArgs) { - var index = signature.params.length - 1; - var param = signature.params[index]; - - var t = 0; - while (t < param.types.length) { - if (param.conversions[t]) { - var type = param.types[t]; - var exists = arr.some(function (other) { - var p = other.params[index]; - - return other !== signature && p && - contains(p.types, type) && // FIXME: mutable variable warning - !p.conversions[index]; - }); - - if (exists) { - param.types.splice(t, 1); - param.conversions.splice(t, 1); - t--; - } - } - t++; - } - } - }); - - return arr; - } - - /** - * create a map with normalized signatures as key and the function as value - * @param {Signature[]} signatures An array with split signatures - * @return {Object.} Returns a map with normalized - * signatures as key, and the function - * as value. - */ - function mapSignatures(signatures) { - return signatures.reduce(function (normalized, signature) { - var params = signature.params.join(','); - if (signature.fn) { - normalized[params] = signature.fn; - } - return normalized; - }, {}); - } - - /** - * Parse signatures recursively in a node tree. - * @param {Signature[]} signatures Array with expanded signatures - * @param {Param[]} path Traversed path of parameter types - * @return {Node} Returns a node tree - */ - function parseTree(signatures, path) { - var index = path.length; - - // filter the signatures with the correct number of params - var signature = signatures.filter(function (signature) { - return signature.params.length === index; - })[0]; // there can be only one signature - - // recurse over the signatures - var childs = signatures - .filter(function (signature) { - return signature.params[index] != undefined; - }) - .sort(function (a, b) { - return Param.compare(a.params[index], b.params[index]); - }) - .reduce(function (entries, signature) { - // group signatures with the same param at current index - var param = signature.params[index]; - var existing = entries.filter(function (entry) { - return entry.param.overlapping(param); - })[0]; - - if (existing) { - if (existing.param.varArgs) { - throw new Error('Conflicting types "' + existing.param + '" and "' + param + '"'); - } - existing.signatures.push(signature); - } - else { - entries.push({ - param: param, - signatures: [signature] - }); - } - - return entries; - }, []) - .map(function (entry) { - return parseTree(entry.signatures, path.concat(entry.param)) - }); - - return new Node(path, signature, childs); - } - - /** - * Generate an array like ['arg0', 'arg1', 'arg2'] - * @param {number} count Number of arguments to generate - * @returns {Array} Returns an array with argument names - */ - function getArgs(count) { - // create an array with all argument names - var args = []; - for (var i = 0; i < count; i++) { - args[i] = 'arg' + i; - } - - return args; - } - - /** - * Compose a function from sub-functions each handling a single type signature. - * Signatures: - * typed(signature: string, fn: function) - * typed(name: string, signature: string, fn: function) - * typed(signatures: Object.) - * typed(name: string, signatures: Object.) - * - * @param {string | null} name - * @param {Object.} signatures - * @return {function} Returns the typed function - * @private - */ - function _typed(name, signatures) { - var refs = new Refs(); - - // parse signatures, expand them - var _signatures = parseSignatures(signatures); - if (_signatures.length == 0) { - throw new Error('No signatures provided'); - } - - // parse signatures into a node tree - var node = parseTree(_signatures, []); - - //var util = require('util'); - //console.log('ROOT'); - //console.log(util.inspect(node, { depth: null })); - - // generate code for the typed function - var code = []; - var _name = name || ''; - var _args = getArgs(maxParams(_signatures)); - code.push('function ' + _name + '(' + _args.join(', ') + ') {'); - code.push(node.toCode(refs, ' ')); - code.push('}'); - - // generate code for the factory function - var factory = [ - '(function (' + refs.name + ') {', - refs.toCode(), - 'return ' + code.join('\n'), - '})' - ].join('\n'); - - // evaluate the JavaScript code and attach function references - var fn = eval(factory)(refs); - - //console.log('FN\n' + fn.toString()); // TODO: cleanup - - // attach the signatures with sub-functions to the constructed function - fn.signatures = mapSignatures(_signatures); - - return fn; - } - - // data type tests - var types = { - 'null': function (x) {return x === null}, - 'undefined':function (x) {return x === undefined}, - 'boolean': function (x) {return typeof x === 'boolean'}, - 'number': function (x) {return typeof x === 'number'}, - 'string': function (x) {return typeof x === 'string'}, - 'function': function (x) {return typeof x === 'function'}, - 'Array': function (x) {return Array.isArray(x)}, - 'Date': function (x) {return x instanceof Date}, - 'RegExp': function (x) {return x instanceof RegExp}, - 'Object': function (x) {return typeof x === 'object'} - }; - - /** - * Calculate the maximum number of parameters in givens signatures - * @param {Signature[]} signatures - * @returns {number} The maximum number of parameters - */ - function maxParams(signatures) { - return signatures.reduce(function (max, signature) { - return Math.max(max, signature.params.length); - }, 0); - } - - /** - * Get the type of a value - * @param {*} x - * @returns {string} Returns a string with the type of value - */ - function getTypeOf(x) { - for (var type in types) { - if (types.hasOwnProperty(type) && type !== 'Object') { - // Array and Date are also Object, so test for Object afterwards - if (types[type](x)) return type; - } - } - if (types['Object'](x)) return type; - return 'unknown'; - } - - /** - * Test whether an array contains some entry - * @param {Array} array - * @param {*} entry - * @return {boolean} Returns true if array contains entry, false if not. - */ - function contains(array, entry) { - return array.indexOf(entry) !== -1; - } - - // configuration - var config = {}; - - // type conversions. Order is important - var conversions = []; - - // temporary object for holding types and conversions, for constructing - // the `typed` function itself - // TODO: find a more elegant solution for this - var typed = { - config: config, - types: types, - conversions: conversions - }; - - /** - * Construct the typed function itself with various signatures - * - * Signatures: - * - * typed(signature: string, fn: function) - * typed(name: string, signature: string, fn: function) - * typed(signatures: Object.) - * typed(name: string, signatures: Object.) - */ - typed = _typed('typed', { - 'Object': function (signatures) { - return _typed(null, signatures); - }, - 'string, Object': _typed, - 'string, function': function (signature, fn) { - var signatures = {}; - signatures[signature] = fn; - return _typed(fn.name || null, signatures); - }, - 'string, string, function': function(name, signature, fn) { - var signatures = {}; - signatures[signature] = fn; - return _typed(name, signatures); - }, - '...function': function (fns) { - var name = ''; - var signatures = {}; - fns.forEach(function (fn, index) { - var err; - - // test whether this is a typed-function - if (!(typeof fn.signatures === 'object')) { - err = new TypeError('Function is no typed-function (index: ' + index + ')'); - err.data = {index: index}; - throw err; - } - - // merge the signatures - for (var signature in fn.signatures) { - if (fn.signatures.hasOwnProperty(signature)) { - if (signatures.hasOwnProperty(signature)) { - err = new Error('Signature "' + signature + '" is defined twice'); - err.data = {signature: signature}; - throw err; - } - else { - signatures[signature] = fn.signatures[signature]; - } - } - } - - // merge function name - if (fn.name != '') { - if (name == '') { - name = fn.name; - } - else if (name != fn.name) { - err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')'); - err.data = { - actual: fn.name, - expected: name - }; - throw err; - } - } - }); - - return _typed(name, signatures); - } - }); - - // attach types and conversions to the final `typed` function - typed.config = config; - typed.types = types; - typed.conversions = conversions; - - return typed; - })); + 'use strict'; + + function factory (type, config, load, typed) { + /** + * Iterate over all elements of a matrix/array, and executes the given callback function. + * + * Syntax: + * + * math.forEach(x, callback) + * + * Examples: + * + * math.forEach([1, 2, 3], function(value) { + * console.log(value); + * }); + * // outputs 1, 2, 3 + * + * See also: + * + * filter, map, sort + * + * @param {Matrix | Array} x The matrix to iterate on. + * @param {Function} callback The callback function is invoked with three + * parameters: the value of the element, the index + * of the element, and the Matrix/array being traversed. + */ + return typed('forEach', { + 'Array, function': _forEach, + + 'Matrix, function': function (x, callback) { + return x.forEach(callback); + } + }); + } + + /** + * forEach for a multi dimensional array + * @param {Array} array + * @param {function} callback + * @private + */ + function _forEach (array, callback) { + var recurse = function (value, index) { + if (Array.isArray(value)) { + value.forEach(function (child, i) { + // we create a copy of the index array and append the new index value + recurse(child, index.concat(i)); + }); + } + else { + callback(value, index, array); + } + }; + recurse(array, []); + } + + exports.name = 'forEach'; + exports.factory = factory; /***/ }, /* 164 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - exports.array = __webpack_require__(167); - exports['boolean'] = __webpack_require__(204); - exports['function'] = __webpack_require__(337); - exports.number = __webpack_require__(3); - exports.bignumber = __webpack_require__(166); - exports.object = __webpack_require__(2); - exports.string = __webpack_require__(205); - exports.types = __webpack_require__(335); + 'use strict'; + + var util = __webpack_require__(171); + + var object = util.object; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var abs = load(__webpack_require__(31)); + var add = load(__webpack_require__(32)); + var divideScalar = load(__webpack_require__(213)); + var multiply = load(__webpack_require__(47)); + var subtract = load(__webpack_require__(55)); + var larger = load(__webpack_require__(116)); + var equal = load(__webpack_require__(115)); + var unaryMinus = load(__webpack_require__(56)); + + var SparseMatrix = type.SparseMatrix; + var DenseMatrix = type.DenseMatrix; + var Spa = type.Spa; + + /** + * Calculate the Matrix LU decomposition with pivoting. Matrix A is decomposed in three matrices (L, U, P) where + * A * P = L * U + * + * @param {Matrix | Array} A two dimensional matrix or array for which to get the LUP decomposition. + * + * @return {Array} The lower triangular matrix, the upper triangular matrix and the permutation matrix. + */ + var lup = typed('lup', { + 'Matrix': function (m) { + // process matrix storage format + switch (m.storage()) { + case 'dense': + return _denseLUP(m); + case 'sparse': + return _sparseLUP(m); + } + }, + 'Array': function (a) { + // create dense matrix from array + var m = matrix(a); + // lup, use matrix implementation + var r = lup(m); + // result + return { + L: r.L.valueOf(), + U: r.U.valueOf(), + P: r.P.valueOf() + }; + } + }); + + var _denseLUP = function (m) { + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // minimum rows and columns + var n = Math.min(rows, columns); + // matrix array, clone original data + var data = object.clone(m._data); + // l matrix arrays + var ldata = []; + var lsize = [rows, n]; + // u matrix arrays + var udata = []; + var usize = [n, columns]; + // p (eye [n, n]) + var p = DenseMatrix.diagonal([rows, rows], 1, 0); + // vars + var i, j, k; + // loop columns + for (j = 0; j < columns; j++) { + // skip first column in upper triangular matrix + if (j > 0) { + // loop rows + for (i = 0; i < rows; i++) { + // min i,j + var min = Math.min(i, j); + // v[i, j] + var s = 0; + // loop up to min + for (k = 0; k < min; k++) { + // s = l[i, k] - data[k, j] + s = add(s, multiply(data[i][k], data[k][j])); + } + data[i][j] = subtract(data[i][j], s); + } + } + // row with larger value in cvector, row >= j + var pi = j; + var pabsv = 0; + var vjj = 0; + // loop rows + for (i = j; i < rows; i++) { + // data @ i, j + var v = data[i][j]; + // absolute value + var absv = abs(v); + // value is greater than pivote value + if (larger(absv, pabsv)) { + // store row + pi = i; + // update max value + pabsv = absv; + // value @ [j, j] + vjj = v; + } + } + // swap rows (j <-> pi) + if (j !== pi) { + // swap values j <-> pi in P + DenseMatrix._swapRows(j, pi, p._data); + // swap j <-> pi in data + DenseMatrix._swapRows(j, pi, data); + } + // check column is in lower triangular matrix + if (j < rows) { + // loop rows (lower triangular matrix) + for (i = j + 1; i < rows; i++) { + // value @ i, j + var vij = data[i][j]; + if (!equal(vij, 0)) { + // update data + data[i][j] = divideScalar(data[i][j], vjj); + } + } + } + } + // loop columns + for (j = 0; j < columns; j++) { + // loop rows + for (i = 0; i < rows; i++) { + // initialize row in arrays + if (j === 0) { + // check row exists in upper triangular matrix + if (i < columns) { + // U + udata[i] = []; + } + // L + ldata[i] = []; + } + // check we are in the upper triangular matrix + if (i < j) { + // check row exists in upper triangular matrix + if (i < columns) { + // U + udata[i][j] = data[i][j]; + } + // check column exists in lower triangular matrix + if (j < rows) { + // L + ldata[i][j] = 0; + } + continue; + } + // diagonal value + if (i === j) { + // check row exists in upper triangular matrix + if (i < columns) { + // U + udata[i][j] = data[i][j]; + } + // check column exists in lower triangular matrix + if (j < rows) { + // L + ldata[i][j] = 1; + } + continue; + } + // check row exists in upper triangular matrix + if (i < columns) { + // U + udata[i][j] = 0; + } + // check column exists in lower triangular matrix + if (j < rows) { + // L + ldata[i][j] = data[i][j]; + } + } + } + // l matrix + var l = new DenseMatrix({ + data: ldata, + size: lsize + }); + // u matrix + var u = new DenseMatrix({ + data: udata, + size: usize + }); + // return matrices + return { + L: l, + U: u, + P: p, + toString: function () { + return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.P.toString(); + } + }; + }; + + var _sparseLUP = function (m) { + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // minimum rows and columns + var n = Math.min(rows, columns); + // matrix arrays (will not be modified, thanks to permutation vector) + var values = m._values; + var index = m._index; + var ptr = m._ptr; + // l matrix arrays + var lvalues = []; + var lindex = []; + var lptr = []; + var lsize = [rows, n]; + // u matrix arrays + var uvalues = []; + var uindex = []; + var uptr = []; + var usize = [n, columns]; + // p matrix arrays + var pvalues = []; + var pindex = []; + var pptr = []; + var psize = [rows, rows]; + // vars + var i, j, k; + // permutation vectors, (current index -> original index) and (original index -> current index) + var pv_co = new Array(rows); + var pv_oc = new Array(rows); + for (i = 0; i < rows; i++) { + pv_co[i] = i; + pv_oc[i] = i; + } + // swap indices in permutation vectors (condition x < y)! + var swapIndeces = function (x, y) { + // find pv indeces getting data from x and y + var kx = pv_oc[x]; + var ky = pv_oc[y]; + // update permutation vector current -> original + pv_co[kx] = y; + pv_co[ky] = x; + // update permutation vector original -> current + pv_oc[x] = ky; + pv_oc[y] = kx; + }; + // loop columns + for (j = 0; j < columns; j++) { + // sparse accumulator + var spa = new Spa(rows); + // check lower triangular matrix has a value @ column j + if (j < rows) { + // update ptr + lptr.push(lvalues.length); + // first value in j column for lower triangular matrix + lvalues.push(1); + lindex.push(j); + } + // update ptr + uptr.push(uvalues.length); + // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1] + var k0 = ptr[j]; + var k1 = ptr[j + 1]; + // copy column j into sparse accumulator + for (k = k0; k < k1; k++) { + // row + i = index[k]; + // copy column values into sparse accumulator (use permutation vector) + spa.set(pv_co[i], values[k]); + } + // skip first column in upper triangular matrix + if (j > 0) { + // loop rows in column j (above diagonal) + spa.forEach(0, j - 1, function (k, vkj) { + // loop rows in column k (L) + SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) { + // check row is below k + if (i > k) { + // update spa value + spa.accumulate(i, unaryMinus(multiply(vik, vkj))); + } + }); + }); + } + // row with larger value in spa, row >= j + var pi = j; + var vjj = spa.get(j); + var pabsv = abs(vjj); + // loop values in spa (order by row, below diagonal) + spa.forEach(j + 1, rows - 1, function (x, v) { + // absolute value + var absv = abs(v); + // value is greater than pivote value + if (larger(absv, pabsv)) { + // store row + pi = x; + // update max value + pabsv = absv; + // value @ [j, j] + vjj = v; + } + }); + // swap rows (j <-> pi) + if (j !== pi) { + // swap values j <-> pi in L + SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr); + // swap values j <-> pi in U + SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr); + // swap values in spa + spa.swap(j, pi); + // update permutation vector (swap values @ j, pi) + swapIndeces(j, pi); + } + // loop values in spa (order by row) + spa.forEach(0, rows - 1, function (x, v) { + // check we are above diagonal + if (x <= j) { + // update upper triangular matrix + uvalues.push(v); + uindex.push(x); + } + else { + // update value + v = divideScalar(v, vjj); + // check value is non zero + if (!equal(v, 0)) { + // update lower triangular matrix + lvalues.push(v); + lindex.push(x); + } + } + }); + } + // update ptrs + lptr.push(lvalues.length); + uptr.push(uvalues.length); + // generate P matrix + for (i = 0; i < rows; i++) { + // ptr + pptr.push(pvalues.length); + // value + pvalues.push(1); + // row + pindex.push(pv_co[i]); + } + // close ptr + pptr.push(pvalues.length); + // return matrices + return { + L: new SparseMatrix({ + values: lvalues, + index: lindex, + ptr: lptr, + size: lsize + }), + U: new SparseMatrix({ + values: uvalues, + index: uindex, + ptr: uptr, + size: usize + }), + P: new SparseMatrix({ + values: pvalues, + index: pindex, + ptr: pptr, + size: psize + }), + toString: function () { + return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.P.toString(); + } + }; + }; + + return lup; + } + + exports.name = 'lup'; + exports.factory = factory; /***/ }, /* 165 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Create a range error with the message: - * 'Dimension mismatch ( != )' - * @param {number | number[]} actual The actual size - * @param {number | number[]} expected The expected size - * @param {string} [relation='!='] Optional relation between actual - * and expected size: '!=', '<', etc. - * @extends RangeError - */ - function DimensionError(actual, expected, relation) { - if (!(this instanceof DimensionError)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.actual = actual; - this.expected = expected; - this.relation = relation; - - this.message = 'Dimension mismatch (' + - (Array.isArray(actual) ? ('[' + actual.join(', ') + ']') : actual) + - ' ' + (this.relation || '!=') + ' ' + - (Array.isArray(expected) ? ('[' + expected.join(', ') + ']') : expected) + - ')'; - - this.stack = (new Error()).stack; - } - - DimensionError.prototype = new RangeError(); - DimensionError.prototype.constructor = RangeError; - DimensionError.prototype.name = 'DimensionError'; - - module.exports = DimensionError; + 'use strict'; + + var isArray = Array.isArray; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var lup = load(__webpack_require__(164)); + var multiply = load(__webpack_require__(47)); + + var backwardSubstitution = load(__webpack_require__(217)); + var forwardSubstitution = load(__webpack_require__(218)); + + /** + * Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector. + * + * Syntax: + * + * var x = math.lusolve(matrix, b) // returns column vector with the solution to the linear system A * x = b + * + * var x = math.lusolve(lup, b) // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A) + * + * Examples: + * + * var m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]; + * + * var x = math.lusolve(m, [-1, -1, -1, -1]); // x = [-1, -0.5, -1/3, -0.25] + * + * var f = math.lup(m); + * var x1 = math.lusolve(f, [-1, -1, -1, -1]); // x1 = [-1, -0.5, -1/3, -0.25] + * var x2 = math.lusolve(f, [1, 2, 1, -1]); // x2 = [1, 1, 1/3, -0.25] + * + * See also: + * + * lup + * + * @param {Matrix | Array | Object} a Invertible Matrix or the Matrix LUP decomposition + * @param {Matrix | Array} b Column Vector + * + * @return {Matrix | Array} Column vector with the solution to the linear system A * x = b + */ + var lusolve = typed('lusolve', { + 'Array, Array | Matrix': function (a, b) { + // convert a to matrix + a = matrix(a); + // matrix lup decomposition + var d = lup(a); + // solve + var x = _lusolve(d.L, d.U, d.P, b); + // convert result to array + return x.valueOf(); + }, + 'Matrix, Array | Matrix': function (a, b) { + // matrix lup decomposition + var d = lup(a); + // solve + return _lusolve(d.L, d.U, d.P, b); + }, + 'Object, Array | Matrix': function (d, b) { + // solve + return _lusolve(d.L, d.U, d.P, b); + } + }); + + var _toMatrix = function (a) { + // check it is a matrix + if (a instanceof type.Matrix) + return a; + // check array + if (isArray(a)) + return matrix(a); + // throw + throw new TypeError('Invalid Matrix LUP decomposition'); + }; + + var _lusolve = function (l, u, p, b) { + // verify L, U, P + l = _toMatrix(l); + u = _toMatrix(u); + p = _toMatrix(p); + // modify column vector applying permutations + b = multiply(p, b); + // use forward substitution to resolve L * y = b + var y = forwardSubstitution(l, b); + // use backward substitution to resolve U * x = y + return backwardSubstitution(u, y); + }; + + return lusolve; + } + + exports.name = 'lusolve'; + exports.factory = factory; /***/ }, /* 166 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var BigNumber = __webpack_require__(12); - var isNumber = __webpack_require__(3).isNumber; - var digits = __webpack_require__(3).digits; - var memoize = __webpack_require__(337).memoize; - - /** - * Test whether value is a BigNumber - * @param {*} value - * @return {Boolean} isBigNumber - */ - // TODO: remove function isBigNumber - exports.isBigNumber = function (value) { - return (value instanceof BigNumber); - }; - - /** - * Try to convert a Number in to a BigNumber. - * If the number has 15 or mor significant digits, the Number cannot be - * converted to BigNumber and will return the original number. - * @param {Number} number - * @param {function} constructor BigNumber constructor - * @return {BigNumber} bignumber - */ - // TODO: remove function toBigNumber - exports.toBigNumber = function(number, constructor) { - // stringify in case of more than 15 digits to circumvent the safety error - // of decimal.js - return new constructor((digits(number) > 15) ? (number + '') : number); - }; - - - /************************************* - * Constants * - *************************************/ - - /** - * Calculate BigNumber e - * @param {Number} precision - * @returns {BigNumber} Returns e - */ - exports.e = memoize(function (precision) { - var Big = BigNumber.constructor({precision: precision}); - - return new Big(1).exp(); - }); - - /** - * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2 - * @param {Number} precision - * @returns {BigNumber} Returns phi - */ - exports.phi = memoize(function (precision) { - var Big = BigNumber.constructor({precision: precision}); - - return new Big(1).plus(new Big(5).sqrt()).div(2); - }); - - /** - * Calculate BigNumber pi. - * - * Uses Machin's formula: pi / 4 = 4 * arctan(1 / 5) - arctan(1 / 239) - * http://milan.milanovic.org/math/english/pi/machin.html - * @param {Number} precision - * @returns {BigNumber} Returns pi - */ - exports.pi = memoize(function (precision) { - // we calculate pi with a few decimal places extra to prevent round off issues - var Big = BigNumber.constructor({precision: precision + 4}); - var pi4th = new Big(4).times(arctan_taylor(new Big(1).div(5))) - .minus(arctan_taylor(new Big(1).div(239))); - - Big.config({precision: precision}); - - // the final pi has the requested number of decimals - return new Big(4).times(pi4th); - }); - - /** - * Calculate BigNumber tau, tau = 2 * pi - * @param {Number} precision - * @returns {BigNumber} Returns tau - */ - exports.tau = memoize(function (precision) { - // we calculate pi at a slightly higher precision than configured to prevent round off errors - // when multiplying by two in the end - - var pi = exports.pi(precision + 2); - - var Big = BigNumber.constructor({precision: precision}); - - return new Big(2).times(pi); - }); - - - /************************************* - * Bitwise functions * - *************************************/ - - /* - * Special Cases: - * N & n = N - * n & 0 = 0 - * n & -1 = n - * n & n = n - * I & I = I - * -I & -I = -I - * I & -I = 0 - * I & n = n - * I & -n = I - * -I & n = 0 - * -I & -n = -I - * - * @param {BigNumber} value - * @param {BigNumber} value - * @return {BigNumber} Result of `x` & `y`, is fully precise - * - */ - exports.and = function(x, y) { - if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { - throw new Error('Parameters in function bitAnd must be integer numbers'); - } - - var BigNumber = x.constructor; - if (x.isNaN() || y.isNaN()) { - return new BigNumber(NaN); - } - - if (x.isZero() || y.eq(-1) || x.eq(y)) { - return x; - } - if (y.isZero() || x.eq(-1)) { - return y; - } - - if (!x.isFinite() || !y.isFinite()) { - if (!x.isFinite() && !y.isFinite()) { - if (x.isNegative() == y.isNegtive()) { - return x; - } - return new BigNumber(0); - } - if (!x.isFinite()) { - if (y.isNegative()) { - return x; - } - if (x.isNegative()) { - return new BigNumber(0); - } - return y; - } - if (!y.isFinite()) { - if (x.isNegative()) { - return y; - } - if (y.isNegative()) { - return new BigNumber(0); - } - return x; - } - } - return bitwise(x, y, function (a, b) { return a & b }); - }; - - /* - * Special Cases: - * n << -n = N - * n << N = N - * N << n = N - * n << 0 = n - * 0 << n = 0 - * I << I = N - * I << n = I - * n << I = I - * - * @param {BigNumber} value - * @param {BigNumber} value - * @return {BigNumber} Result of `x` << `y` - * - */ - exports.leftShift = function (x, y) { - if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { - throw new Error('Parameters in function leftShift must be integer numbers'); - } - - var BigNumber = x.constructor; - if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) { - return new BigNumber(NaN); - } - if (x.isZero() || y.isZero()) { - return x; - } - if (!x.isFinite() && !y.isFinite()) { - return new BigNumber(NaN); - } - - // Math.pow(2, y) is fully precise for y < 55, and fast - if (y.lt(55)) { - return x.times(Math.pow(2, y.toNumber()) + ''); - } - return x.times(new BigNumber(2).pow(y)); - }; - - /* - * @param {BigNumber} value - * @return {BigNumber} Result of ~`x`, fully precise - * - */ - exports.not = function (x) { - if (x.isFinite() && !x.isInteger()) { - throw new Error('Parameter in function bitNot must be integer numbers'); - } - - var BigNumber = x.constructor; - var prevPrec = BigNumber.precision; - BigNumber.config({precision: 1E9}); - - var x = x.plus(BigNumber.ONE); - x.s = -x.s || null; - - BigNumber.config({precision: prevPrec}); - return x; - }; - - /* - * Special Cases: - * N | n = N - * n | 0 = n - * n | -1 = -1 - * n | n = n - * I | I = I - * -I | -I = -I - * I | -n = -1 - * I | -I = -1 - * I | n = I - * -I | n = -I - * -I | -n = -n - * - * @param {BigNumber} value - * @param {BigNumber} value - * @return {BigNumber} Result of `x` | `y`, fully precise - * - */ - exports.or = function (x, y) { - if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { - throw new Error('Parameters in function bitOr must be integer numbers'); - } - - var BigNumber = x.constructor; - if (x.isNaN() || y.isNaN()) { - return new BigNumber(NaN); - } - - var negOne = new BigNumber(-1); - if (x.isZero() || y.eq(negOne) || x.eq(y)) { - return y; - } - if (y.isZero() || x.eq(negOne)) { - return x; - } - - if (!x.isFinite() || !y.isFinite()) { - if ((!x.isFinite() && !x.isNegative() && y.isNegative()) || - (x.isNegative() && !y.isNegative() && !y.isFinite())) { - return negOne; - } - if (x.isNegative() && y.isNegative()) { - return x.isFinite() ? x : y; - } - return x.isFinite() ? y : x; - } - return bitwise(x, y, function (a, b) { return a | b }); - }; - - /* - * Special Cases: - * n >> -n = N - * n >> N = N - * N >> n = N - * I >> I = N - * n >> 0 = n - * I >> n = I - * -I >> n = -I - * -I >> I = -I - * n >> I = I - * -n >> I = -1 - * 0 >> n = 0 - * - * @param {BigNumber} value - * @param {BigNumber} value - * @return {BigNumber} Result of `x` >> `y` - * - */ - exports.rightShift = function (x, y) { - if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { - throw new Error('Parameters in function rightArithShift must be integer numbers'); - } - - var BigNumber = x.constructor; - if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) { - return new BigNumber(NaN); - } - if (x.isZero() || y.isZero()) { - return x; - } - if (!y.isFinite()) { - if (x.isNegative()) { - return new BigNumber(-1); - } - if (!x.isFinite()) { - return new BigNumber(NaN); - } - return new BigNumber(0); - } - - // Math.pow(2, y) is fully precise for y < 55, and fast - if (y.lt(55)) { - return x.div(Math.pow(2, y.toNumber()) + '').floor(); - } - return x.div(new BigNumber(2).pow(y)).floor(); - }; - - /* - * Special Cases: - * N ^ n = N - * n ^ 0 = n - * n ^ n = 0 - * n ^ -1 = ~n - * I ^ n = I - * I ^ -n = -I - * I ^ -I = -1 - * -I ^ n = -I - * -I ^ -n = I - * - * @param {BigNumber} value - * @param {BigNumber} value - * @return {BigNumber} Result of `x` ^ `y`, fully precise - * - */ - exports.xor = function (x, y) { - if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { - throw new Error('Parameters in function bitXor must be integer numbers'); - } - - var BigNumber = x.constructor; - if (x.isNaN() || y.isNaN()) { - return new BigNumber(NaN); - } - if (x.isZero()) { - return y; - } - if (y.isZero()) { - return x; - } - - if (x.eq(y)) { - return new BigNumber(0); - } - - var negOne = new BigNumber(-1); - if (x.eq(negOne)) { - return exports.not(y); - } - if (y.eq(negOne)) { - return exports.not(x); - } - - if (!x.isFinite() || !y.isFinite()) { - if (!x.isFinite() && !y.isFinite()) { - return negOne; - } - return new BigNumber(x.isNegative() == y.isNegative() - ? Infinity - : -Infinity); - } - return bitwise(x, y, function (a, b) { return a ^ b }); - }; - - /* Applies bitwise function to numbers. */ - function bitwise(x, y, func) { - var BigNumber = x.constructor; - - var xBits, yBits; - var xSign = +(x.s < 0); - var ySign = +(y.s < 0); - if (xSign) { - xBits = decCoefficientToBinaryString(exports.not(x)); - for (var i = 0; i < xBits.length; ++i) { - xBits[i] ^= 1; - } - } else { - xBits = decCoefficientToBinaryString(x); - } - if (ySign) { - yBits = decCoefficientToBinaryString(exports.not(y)); - for (var i = 0; i < yBits.length; ++i) { - yBits[i] ^= 1; - } - } else { - yBits = decCoefficientToBinaryString(y); - } - - var minBits, maxBits, minSign; - if (xBits.length <= yBits.length) { - minBits = xBits; - maxBits = yBits; - minSign = xSign; - } else { - minBits = yBits; - maxBits = xBits; - minSign = ySign; - } - - var shortLen = minBits.length; - var longLen = maxBits.length; - var expFuncVal = func(xSign, ySign) ^ 1; - var outVal = new BigNumber(expFuncVal ^ 1); - var twoPower = BigNumber.ONE; - var two = new BigNumber(2); - - var prevPrec = BigNumber.precision; - BigNumber.config({precision: 1E9}); - - while (shortLen > 0) { - if (func(minBits[--shortLen], maxBits[--longLen]) == expFuncVal) { - outVal = outVal.plus(twoPower); - } - twoPower = twoPower.times(two); - } - while (longLen > 0) { - if (func(minSign, maxBits[--longLen]) == expFuncVal) { - outVal = outVal.plus(twoPower); - } - twoPower = twoPower.times(two); - } - - BigNumber.config({precision: prevPrec}); - - if (expFuncVal == 0) { - outVal.s = -outVal.s; - } - return outVal; - } - - /* Extracted from decimal.js, and edited to specialize. */ - function decCoefficientToBinaryString(x) { - // Convert to string - var a = x.c; - var r = a[0] + ''; - - for (var i = 1; i < a.length; ++i) { - var s = a[i] + ''; - for (var z = 7 - s.length; z--; ) { - s = '0' + s; - } - - r += s; - } - - var j; - for (j = r.length - 1; r.charAt(j) == '0'; --j); - - var xe = x.e; - var str = r.slice(0, j + 1 || 1); - var strL = str.length; - if (xe > 0) { - if (++xe > strL) { - // Append zeros. - for (xe -= strL; xe--; str += '0'); - } else if (xe < strL) { - str = str.slice(0, xe) + '.' + str.slice(xe); - } - } - - // Convert from base 10 (decimal) to base 2 - var arr = [0]; - for (var i = 0; i < str.length; ) { - for (var arrL = arr.length; arrL--; arr[arrL] *= 10); - - arr[0] += str.charAt(i++) << 0; // convert to int - for (var j = 0; j < arr.length; ++j) { - if (arr[j] > 1) { - if (arr[j + 1] == null) { - arr[j + 1] = 0; - } - - arr[j + 1] += arr[j] >> 1; - arr[j] &= 1; - } - } - } - - return arr.reverse(); - } - - - /************************************* - * Trigonometric functions * - *************************************/ - - /** - * Calculate the arccosine or arcsecant of x - * - * acos(x) = 2*atan(sqrt(1-x^2)/(1+x)) - * - * asec(x) = acos(1/x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is sec - * @returns {BigNumber} arccosine or arcsecant of x - */ - exports.arccos_arcsec = function (x, Big, reciprocal) { - var precision = Big.precision; - if (reciprocal) { - if (x.abs().lt(Big.ONE)) { - throw new Error('asec() only has non-complex values for |x| >= 1.'); - } - } else if (x.abs().gt(Big.ONE)) { - throw new Error('acos() only has non-complex values for |x| <= 1.'); - } - if (x.eq(-1)) { - return exports.pi(precision); - } - - Big.config({precision: precision + 4}); - - if (reciprocal) { - x = Big.ONE.div(x); - } - - var acos = exports.arctan_arccot(Big.ONE.minus(x.times(x)).sqrt() - .div(x.plus(Big.ONE)), Big).times(2); - - Big.config({precision: precision}); - return acos.toDP(precision - 1); - }; - - /** - * Calculate the arcsine or arccosecant of x - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is csc - * @returns {BigNumber} arcsine or arccosecant of x - */ - exports.arcsin_arccsc = function (x, Big, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - - var precision = Big.precision; - var absX = x.abs(); - if (reciprocal) { - if (absX.lt(Big.ONE)) { - throw new Error('acsc() only has non-complex values for |x| >= 1.'); - } - - Big.config({precision: precision + 2}); - x = Big.ONE.div(x); - Big.config({precision: precision}); - - absX = x.abs(); - } else if (absX.gt(Big.ONE)) { - throw new Error('asin() only has non-complex values for |x| <= 1.'); - } - - // Get x below 0.58 - if (absX.gt(0.8)) { - Big.config({precision: precision + 4}); - - // arcsin(x) = sign(x)*(Pi/2 - arcsin(sqrt(1 - x^2))) - var sign = x.s; - var halfPi = exports.pi(precision + 4).div(2); - x = halfPi.minus(exports.arcsin_arccsc(Big.ONE.minus(x.times(x)).sqrt(), Big)); - x.s = sign; - - x.constructor = Big; - Big.config({precision: precision}); - return x.toDP(precision - 1); - } - var wasReduced = absX.gt(0.58); - if (wasReduced) { - Big.config({precision: precision + 8}); - - // arcsin(x) = 2*arcsin(x / (sqrt(2)*sqrt(sqrt(1 - x^2) + 1))) - x = x.div(new Big(2).sqrt().times(Big.ONE.minus(x.times(x)).sqrt() - .plus(Big.ONE).sqrt())); - - Big.config({precision: precision}); - } - - // Avoid overhead of Newton's Method if feasible - var ret = (precision <= 60 || ((x.dp() <= Math.log(precision)) && x.lt(0.05))) - ? arcsin_taylor(x, precision) - : arcsin_newton(x, Big); - - if (wasReduced) { - return ret.times(2); - } - return ret; - }; - - /** - * Calculate the arctangent or arccotangent of x - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is cot - * @returns {BigNumber} arctangent or arccotangent of x - */ - exports.arctan_arccot = function (x, Big, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - if ((!reciprocal && x.isZero()) || (reciprocal && !x.isFinite())) { - return new Big(0); - } - - var precision = Big.precision; - if ((!reciprocal && !x.isFinite()) || (reciprocal && x.isZero())) { - var halfPi = exports.pi(precision + 2).div(2).toDP(precision - 1); - halfPi.s = x.s; - - return halfPi; - } - - Big.config({precision: precision + 4}); - - if (reciprocal) { - x = Big.ONE.div(x); - } - - var absX = x.abs(); - if (absX.lte(0.875)) { - var ret = arctan_taylor(x); - - ret.constructor = Big; - Big.config({precision: precision}); - return ret.toDP(Big.precision - 1); - } - if (absX.gte(1.143)) { - // arctan(x) = sign(x)*((PI / 2) - arctan(1 / |x|)) - var halfPi = exports.pi(precision + 4).div(2); - var ret = halfPi.minus(arctan_taylor(Big.ONE.div(absX))); - ret.s = x.s; - - ret.constructor = Big; - Big.config({precision: precision}); - return ret.toDP(Big.precision - 1); - } - - // arctan(x) = arcsin(x / [sqrt(1 + x^2)]) - x = x.div(x.times(x).plus(1).sqrt()); - - Big.config({precision: precision}); - return exports.arcsin_arccsc(x, Big); - }; - - /** - * Calculate the hyperbolic arccosine, arcsine, arcsecant, or arccosecant of x - * - * acosh(x) = ln(x + sqrt(x^2 - 1)) - * - * asinh(x) = ln(x + sqrt(x^2 + 1)) - * - * asech(x) = acosh(1 / x) - * - * acsch(x) = asinh(1 / x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} mode sine function if true, cosine function if false - * @param {Boolean} reciprocal is sec or csc - * @returns {BigNumber} hyperbolic arccosine, arcsine, arcsecant, or arccosecant of x - */ - exports.acosh_asinh_asech_acsch = function (x, Big, mode, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - if (reciprocal && x.isZero()) { - return new Big(Infinity); - } - if (!mode) { - if (reciprocal) { - if (x.isNegative() || x.gt(Big.ONE)) { - throw new Error('asech() only has non-complex values for 0 <= x <= 1.'); - } - } else if (x.lt(Big.ONE)) { - throw new Error('acosh() only has non-complex values for x >= 1.'); - } - } - - var precision = Big.precision; - Big.config({precision: precision + 4}); - - var y = new Big(x); - y.constructor = Big; - - if (reciprocal) { - y = Big.ONE.div(y); - } - - var x2PlusOrMinus = (mode) ? y.times(y).plus(Big.ONE) : y.times(y).minus(Big.ONE); - var ret = y.plus(x2PlusOrMinus.sqrt()).ln(); - - Big.config({precision: precision}); - return new Big(ret.toPrecision(precision)); - }; - - /** - * Calculate the hyperbolic arctangent or arccotangent of x - * - * atanh(x) = ln((1 + x)/(1 - x)) / 2 - * - * acoth(x) = atanh(1 / x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is sec or csc - * @returns {BigNumber} hyperbolic arctangent or arccotangent of x - */ - exports.atanh_acoth = function (x, Big, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - - var absX = x.abs(); - if (absX.eq(Big.ONE)) { - return new Big(x.isNegative() ? -Infinity : Infinity); - } - if (absX.gt(Big.ONE)) { - if (!reciprocal) { - throw new Error('atanh() only has non-complex values for |x| <= 1.'); - } - } else if (reciprocal) { - throw new Error('acoth() has complex values for |x| < 1.'); - } - - if (x.isZero()) { - return new Big(0); - } - - var precision = Big.precision; - Big.config({precision: precision + 4}); - - var y = new Big(x); - y.constructor = Big; - - if (reciprocal) { - y = Big.ONE.div(y); - } - var ret = Big.ONE.plus(y).div(Big.ONE.minus(y)).ln().div(2); - - Big.config({precision: precision}); - return new Big(ret.toPrecision(precision)); - }; - - /** - * Calculate the cosine/sine of x using the multiple angle identity: - * - * cos(4x) = 8[cos(x)^4 - cos(x)^2] + 1 - * - * sin(5x) = 16sin(x)^5 - 20sin(x)^3 + 5sin(x) - * http://www.tc.umn.edu/~ringx004/sidebar.html - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Number} mode cosine function if 0, sine function if 1 - * @param {Boolean} reciprocal is sec or csc - * @returns {BigNumber} cosine, sine, secant, or cosecant of x - */ - exports.cos_sin_sec_csc = function (x, Big, mode, reciprocal) { - if (x.isNaN() || !x.isFinite()) { - return new Big(NaN); - } - var precision = Big.precision; - - // Avoid changing the original value - var y = new Big(x); - - // sin(-x) == -sin(x), cos(-x) == cos(x) - var isNeg = y.isNegative(); - if (isNeg) { - y.s = -y.s; - } - - // Apply ~log(precision) guard bits - var precPlusGuardDigits = precision + (Math.log(precision) | 0) + 3; - Big.config({precision: precPlusGuardDigits}); - - y = reduceToPeriod(y, precPlusGuardDigits, mode); // Make this destructive - y[0].constructor = Big; - if (y[1]) { - y = y[0]; - if (reciprocal && y.isZero()) { - y = new Big(Infinity); - } - - Big.config({precision: precision}); - return y; - } - - var ret; - y = y[0]; - if (mode) { - ret = cos_sin_taylor(y.div(3125), mode); - Big.config({precision: Math.min(precPlusGuardDigits, precision + 15)}); - - var five = new Big(5); - var sixteen = new Big(16); - var twenty = new Big(20); - for (var i = 0; i < 5; ++i) { - var ret2 = ret.times(ret); - var ret3 = ret2.times(ret); - var ret5 = ret3.times(ret2); - ret = sixteen.times(ret5).minus( - twenty.times(ret3)).plus( - five.times(ret)); - } - - if (isNeg) { - ret.s = -ret.s; - } - } else { - var div_factor, loops; - if (y.abs().lt(Big.ONE)) { - div_factor = 64; - loops = 3; - } else { - div_factor = 256; - loops = 4; - } - - ret = cos_sin_taylor(y.div(div_factor), mode); - Big.config({precision: Math.min(precPlusGuardDigits, precision + 8)}); - - var eight = new Big(8); - for (; loops > 0; --loops) { - var ret2 = ret.times(ret); - var ret4 = ret2.times(ret2); - ret = eight.times(ret4.minus(ret2)).plus(Big.ONE); - } - } - - if (reciprocal) { - ret = (ret.e <= -precision) - ? new Big(Infinity) - : Big.ONE.div(ret); - } - - Big.config({precision: precision}); - return ret.toDP(precision - 1); - }; - - /** - * Calculate the tangent of x - * - * tan(x) = sin(x) / cos(x) - * - * cot(x) = cos(x) / sin(x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is cot - * @returns {BigNumber} tangent or cotangent of x - */ - exports.tan_cot = function (x, Big, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - - var precision = Big.precision; - var pi = exports.pi(precision + 2); - var halfPi = pi.div(2).toDP(precision - 1); - pi = pi.toDP(precision - 1); - - var y = reduceToPeriod(x, precision, 1)[0]; - if (y.abs().eq(pi)) { - return new Big(Infinity); - } - - Big.config({precision: precision + 2}); - var sin = exports.cos_sin_sec_csc(y, Big, 1, false); - var cos = sinToCos(sin); - - sin = sin.toDP(precision); - cos = cos.toDP(precision); - - // Make sure sign for cosine is correct - if (y.eq(x)) { - if (y.gt(halfPi)) { - cos.s = -cos.s; - } - } else if (pi.minus(y.abs()).gt(halfPi)) { - cos.s = -cos.s; - } - - var tan = (reciprocal) ? cos.div(sin) : sin.div(cos); - - Big.config({precision: precision}); - return new Big(tan.toPrecision(precision)); - }; - - /** - * Calculate the hyperbolic sine, cosine, secant, or cosecant of x - * - * cosh(x) = (exp(x) + exp(-x)) / 2 - * = (e^x + 1/e^x) / 2 - * - * sinh(x) = (exp(x) - exp(-x)) / 2 - * = (e^x - 1/e^x) / 2 - * - * sech(x) = 2 / (exp(x) + exp(-x)) - * = 2 / (e^x + 1/e^x) - * - * csch(x) = 2 / (exp(x) - exp(-x)) - * = 2 / (e^x - 1/e^x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} mode sinh function if true, cosh function if false - * @param {Boolean} reciprocal is sech or csch - * @returns {BigNumber} hyperbolic cosine, sine, secant. or cosecant of x - */ - exports.cosh_sinh_csch_sech = function (x, Big, mode, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - if (!x.isFinite()) { - if (reciprocal) { - return new Big(0); - } - return new Big((mode) ? x : Infinity); - } - - var precision = Big.precision; - Big.config({precision: precision + 4}); - - var y = new Big(x); - y.constructor = Big; - - y = y.exp(); - y = (mode) ? y.minus(Big.ONE.div(y)) : y.plus(Big.ONE.div(y)); - y = (reciprocal) ? new Big(2).div(y) : y.div(2); - - Big.config({precision: precision}); - return new Big(y.toPrecision(precision)); - }; - - /** - * Calculate the hyperbolic tangent of x - * - * tanh(x) = (exp(x) + exp(-x)) / (exp(x) - exp(-x)) - * = (exp(2x) - 1) / (exp(2x) + 1) - * = (e^x - 1/e^x) / (e^x + 1/e^x) - * - * coth(x) = (exp(x) - exp(-x)) / (exp(x) + exp(-x)) - * = (exp(2x) + 1) / (exp(2x) - 1) - * = (e^x + 1/e^x) / (e^x - 1/e^x) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @param {Boolean} reciprocal is coth - * @returns {BigNumber} hyperbolic tangent or cotangent of x - */ - exports.tanh_coth = function (x, Big, reciprocal) { - if (x.isNaN()) { - return new Big(NaN); - } - if (!x.isFinite()) { - return new Big(x.s); - } - - var precision = Big.precision; - Big.config({precision: precision + 4}); - - var y = new Big(x); - y.constructor = Big; - - var posExp = y.exp(); - var negExp = Big.ONE.div(posExp); - var ret = posExp.minus(negExp); - ret = (reciprocal) ? posExp.plus(negExp).div(ret) : ret.div(posExp.plus(negExp)); - - Big.config({precision: precision}); - return ret.toDP(precision - 1); - }; - - /** - * Calculate the arc sine of x using Newton's method - * - * f(x) = sin(x) = N => f(x) = sin(x) - N - * f'(x) = cos(x) - * - * Thus we solve each step as follows: - * x_(i+1) = x_i - (sin(x_i) - N)/cos(x_i) - * - * @param {BigNumber} x - * @param {DecimalFactory} Big current BigNumber constructor - * @returns {BigNumber} arc sine of x - */ - function arcsin_newton(x, Big) { - var oldPrecision = Big.precision; - - // Calibration variables, adjusted from MAPM - var tolerance = -(oldPrecision + 4); - var maxp = oldPrecision + 8 - x.e; - var localPrecision = 25 - x.e; - var maxIter = Math.max(Math.log(oldPrecision + 2) * 1.442695 | 0 + 5, 5); - Big.config({precision: localPrecision}); - - var i = 0; - var curr = new Big(Math.asin(x.toNumber()) + ''); - do { - var tmp0 = exports.cos_sin_sec_csc(curr, Big, 1, false); - var tmp1 = sinToCos(tmp0); - if (!tmp0.isZero()) { - tmp0.s = curr.s; - } - - var tmp2 = tmp0.minus(x).div(tmp1); - curr = curr.minus(tmp2); - - localPrecision = Math.min(2*localPrecision, maxp); - Big.config({precision: localPrecision}); - } while ((2*tmp2.e >= tolerance) && !tmp2.isZero() && (++i <= maxIter)) - - if (i == maxIter) { - throw new Error('asin() failed to converge to the requested accuracy.' + - 'Try with a higher precision.'); - } - - Big.config({precision: oldPrecision}); - return curr.toDP(oldPrecision - 1); - } - - /** - * Calculate the arc sine of x - * - * arcsin(x) = x + (1/2)*x^3/3 + (3/8)*x^5/5 + (15/48)*x^7/7 ... - * = x + (1/2)*x^2*x^1/3 + [(1*3)/(2*4)]*x^2*x^3/5 + [(1*3*5)/(2*4*6)]*x^2*x^5/7 ... - * - * @param {BigNumber} x - * @param {Number} precision - * @returns {BigNumber} arc sine of x - */ - function arcsin_taylor(x, precision) { - var Big = x.constructor; - Big.config({precision: precision + Math.log(precision) | 0 + 4}); - - var one = new Big(1); - var y = x; - var yPrev = NaN; - var x2 = x.times(x); - var polyNum = x; - var constNum = new Big(one); - var constDen = new Big(one); - - var bigK = new Big(one); - for (var k = 3; !y.equals(yPrev); k += 2) { - polyNum = polyNum.times(x2); - - constNum = constNum.times(bigK); - constDen = constDen.times(bigK.plus(one)); - - yPrev = y; - bigK = new Big(k); - y = y.plus(polyNum.times(constNum).div(bigK.times(constDen))); - } - - Big.config({precision: precision}); - return y.toDP(precision - 1); - } - - /** - * Calculate the arc tangent of x using a Taylor expansion - * - * arctan(x) = x - x^3/3 + x^5/5 - x^7/7 + x^9/9 - ... - * = x - x^2*x^1/3 + x^2*x^3/5 - x^2*x^5/7 + x^2*x^7/9 - ... - * - * @param {BigNumber} x - * @returns {BigNumber} arc tangent of x - */ - function arctan_taylor(x) { - var y = x; - var yPrev = NaN; - var x2 = x.times(x); - var num = x; - var add = true; - - for (var k = 3; !y.equals(yPrev); k += 2) { - num = num.times(x2); - - yPrev = y; - add = !add; - y = (add) ? y.plus(num.div(k)) : y.minus(num.div(k)); - } - - return y; - } - - /** - * Calculate the cosine or sine of x using Taylor Series. - * - * cos(x) = 1 - x^2/2! + x^4/4! - x^6/6! + x^8/8! - ... - * = 1 - 1*x^2/2! + x^2*x^2/4! - x^2*x^4/6! + x^2*x^6/8! - ... - * - * sin(x) = x - x^3/3! + x^5/5! - x^7/7! + x^9/9! - ... - * = x - x^2*x^1/3! + x^2*x^3/5! - x^2*x^5/7! + x^2*x^7/9! - ... - * - * @param {BigNumber} x reduced argument - * @param {Number} mode sine function if 1, cosine function if 0 - * @returns {BigNumber} sine or cosine of x - */ - function cos_sin_taylor(x, mode) { - var one = x.constructor.ONE; - - var y = x; - var yPrev = NaN; - var x2 = x.times(x); - var num = (mode) ? y : y = one; - var den = one; - var add = true; - - for (var k = mode; !y.equals(yPrev); k += 2) { - num = num.times(x2); - den = den.times(k+1).times(k+2); - - yPrev = y; - add = !add; - y = (add) ? y.plus(num.div(den)) : y.minus(num.div(den)); - } - - return y; - } - - /** - * Reduce x within a period of pi (0, pi] with guard digits. - * - * @param {BigNumber} x - * @param {Number} precision - * @param {Number} mode - * @returns {Array} [Reduced x, is tau multiple?] - */ - function reduceToPeriod(x, precision, mode) { - var pi = exports.pi(precision + 2); - var tau = exports.tau(precision); - if (x.abs().lte(pi.toDP(x.dp()))) { - return [x, false]; - } - - var Big = x.constructor; - // Catch if input is tau multiple using pi's precision - if (x.div(pi.toDP(x.dp())).toNumber() % 2 == 0) { - return [new Big(mode ^ 1), true]; - } - - var y = x.mod(tau); - - // Catch if tau multiple with tau's precision - if (y.toDP(x.dp(), 1).isZero()) { - return [new Big(mode ^ 1), true]; - } - - if (y.gt(pi)) { - if (mode) { - // sin(x + pi) = -sin(x) - y = y.minus(pi); - y.s = -y.s; - } else { - // cos(x) = cos(tau - x) - y = tau.minus(y); - } - } - - y.constructor = Big; - return [y, false]; - } - - /** - * Convert from sine to cosine - * - * |cos(x)| = sqrt(1 - sin(x)^2) - * - * @param {BigNumber} sine of x - * @returns {BigNumber} sine as cosine - */ - function sinToCos(sinVal) { - var Big = sinVal.constructor; - var precision = Big.precision; - Big.config({precision: precision + 2}); - - var ret = Big.ONE.minus(sinVal.times(sinVal)).sqrt(); - - Big.config({precision: precision}); - return ret.toDP(precision - 1); - } - - - /************************************ - * Format functions * - ************************************/ - - /** - * Convert a number to a formatted string representation. - * - * Syntax: - * - * format(value) - * format(value, options) - * format(value, precision) - * format(value, fn) - * - * Where: - * - * {Number} value The value to be formatted - * {Object} options An object with formatting options. Available options: - * {String} notation - * Number notation. Choose from: - * 'fixed' Always use regular number notation. - * For example '123.40' and '14000000' - * 'exponential' Always use exponential notation. - * For example '1.234e+2' and '1.4e+7' - * 'auto' (default) Regular number notation for numbers - * having an absolute value between - * `lower` and `upper` bounds, and uses - * exponential notation elsewhere. - * Lower bound is included, upper bound - * is excluded. - * For example '123.4' and '1.4e7'. - * {Number} precision A number between 0 and 16 to round - * the digits of the number. - * In case of notations 'exponential' and - * 'auto', `precision` defines the total - * number of significant digits returned - * and is undefined by default. - * In case of notation 'fixed', - * `precision` defines the number of - * significant digits after the decimal - * point, and is 0 by default. - * {Object} exponential An object containing two parameters, - * {Number} lower and {Number} upper, - * used by notation 'auto' to determine - * when to return exponential notation. - * Default values are `lower=1e-3` and - * `upper=1e5`. - * Only applicable for notation `auto`. - * {Function} fn A custom formatting function. Can be used to override the - * built-in notations. Function `fn` is called with `value` as - * parameter and must return a string. Is useful for example to - * format all values inside a matrix in a particular way. - * - * Examples: - * - * format(6.4); // '6.4' - * format(1240000); // '1.24e6' - * format(1/3); // '0.3333333333333333' - * format(1/3, 3); // '0.333' - * format(21385, 2); // '21000' - * format(12.071, {notation: 'fixed'}); // '12' - * format(2.3, {notation: 'fixed', precision: 2}); // '2.30' - * format(52.8, {notation: 'exponential'}); // '5.28e+1' - * - * @param {BigNumber} value - * @param {Object | Function | Number} [options] - * @return {String} str The formatted value - */ - exports.format = function(value, options) { - if (typeof options === 'function') { - // handle format(value, fn) - return options(value); - } - - // handle special cases - if (!value.isFinite()) { - return value.isNaN() ? 'NaN' : (value.gt(0) ? 'Infinity' : '-Infinity'); - } - - // default values for options - var notation = 'auto'; - var precision = undefined; - - if (options !== undefined) { - // determine notation from options - if (options.notation) { - notation = options.notation; - } - - // determine precision from options - if (isNumber(options)) { - precision = options; - } - else if (options.precision) { - precision = options.precision; - } - } - - // handle the various notations - switch (notation) { - case 'fixed': - return exports.toFixed(value, precision); - - case 'exponential': - return exports.toExponential(value, precision); - - case 'auto': - // determine lower and upper bound for exponential notation. - // TODO: implement support for upper and lower to be BigNumbers themselves - var lower = 1e-3; - var upper = 1e5; - if (options && options.exponential) { - if (options.exponential.lower !== undefined) { - lower = options.exponential.lower; - } - if (options.exponential.upper !== undefined) { - upper = options.exponential.upper; - } - } - - // adjust the configuration of the BigNumber constructor (yeah, this is quite tricky...) - var oldConfig = { - toExpNeg: value.constructor.toExpNeg, - toExpPos: value.constructor.toExpPos - }; - - value.constructor.config({ - toExpNeg: Math.round(Math.log(lower) / Math.LN10), - toExpPos: Math.round(Math.log(upper) / Math.LN10) - }); - - // handle special case zero - if (value.isZero()) return '0'; - - // determine whether or not to output exponential notation - var str; - var abs = value.abs(); - if (abs.gte(lower) && abs.lt(upper)) { - // normal number notation - str = value.toSignificantDigits(precision).toFixed(); - } - else { - // exponential notation - str = exports.toExponential(value, precision); - } - - // remove trailing zeros after the decimal point - return str.replace(/((\.\d*?)(0+))($|e)/, function () { - var digits = arguments[2]; - var e = arguments[4]; - return (digits !== '.') ? digits + e : e; - }); - - default: - throw new Error('Unknown notation "' + notation + '". ' + - 'Choose "auto", "exponential", or "fixed".'); - } - }; - - /** - * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3' - * @param {BigNumber} value - * @param {Number} [precision] Number of digits in formatted output. - * If not provided, the maximum available digits - * is used. - * @returns {string} str - */ - exports.toExponential = function(value, precision) { - if (precision !== undefined) { - return value.toExponential(precision - 1); // Note the offset of one - } - else { - return value.toExponential(); - } - }; - - /** - * Format a number with fixed notation. - * @param {BigNumber} value - * @param {Number} [precision=0] Optional number of decimals after the - * decimal point. Zero by default. - */ - exports.toFixed = function(value, precision) { - return value.toFixed(precision || 0); - // Note: the (precision || 0) is needed as the toFixed of BigNumber has an - // undefined default precision instead of 0. - }; - - /* Helper functions */ - function BigNumberCopy(x) { - var Big = BigNumber.constructor({precision: x.constructor.precision}); - var y = new Big(x); - y.constructor = Big; // Not sure why I have to do this... - - return y; - } + 'use strict'; + + var BigNumber = __webpack_require__(350); + + /** + * Clone an object + * + * clone(x) + * + * Can clone any primitive type, array, and object. + * If x has a function clone, this function will be invoked to clone the object. + * + * @param {*} x + * @return {*} clone + */ + exports.clone = function clone(x) { + var type = typeof x; + + // immutable primitive types + if (type === 'number' || type === 'string' || type === 'boolean' || + x === null || x === undefined) { + return x; + } + + // use clone function of the object when available + if (typeof x.clone === 'function') { + return x.clone(); + } + + // array + if (Array.isArray(x)) { + return x.map(function (value) { + return clone(value); + }); + } + + if (x instanceof Number) return new Number(x.valueOf()); + if (x instanceof String) return new String(x.valueOf()); + if (x instanceof Boolean) return new Boolean(x.valueOf()); + if (x instanceof Date) return new Date(x.valueOf()); + if (x instanceof BigNumber) return x; // bignumbers are immutable + if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp + + // object + var m = {}; + for (var key in x) { + if (x.hasOwnProperty(key)) { + m[key] = clone(x[key]); + } + } + return m; + }; + + /** + * Extend object a with the properties of object b + * @param {Object} a + * @param {Object} b + * @return {Object} a + */ + exports.extend = function(a, b) { + for (var prop in b) { + if (b.hasOwnProperty(prop)) { + a[prop] = b[prop]; + } + } + return a; + }; + + /** + * Deep extend an object a with the properties of object b + * @param {Object} a + * @param {Object} b + * @returns {Object} + */ + exports.deepExtend = function deepExtend (a, b) { + // TODO: add support for Arrays to deepExtend + if (Array.isArray(b)) { + throw new TypeError('Arrays are not supported by deepExtend'); + } + + for (var prop in b) { + if (b.hasOwnProperty(prop)) { + if (b[prop] && b[prop].constructor === Object) { + if (a[prop] === undefined) { + a[prop] = {}; + } + if (a[prop].constructor === Object) { + deepExtend(a[prop], b[prop]); + } + else { + a[prop] = b[prop]; + } + } else if (Array.isArray(b[prop])) { + throw new TypeError('Arrays are not supported by deepExtend'); + } else { + a[prop] = b[prop]; + } + } + } + return a; + }; + + /** + * Deep test equality of all fields in two pairs of arrays or objects. + * @param {Array | Object} a + * @param {Array | Object} b + * @returns {boolean} + */ + exports.deepEqual = function deepEqual (a, b) { + var prop, i, len; + if (Array.isArray(a)) { + if (!Array.isArray(b)) { + return false; + } + + if (a.length != b.length) { + return false; + } + + for (i = 0, len = a.length; i < len; i++) { + if (!exports.deepEqual(a[i], b[i])) { + return false; + } + } + return true; + } + else if (a instanceof Object) { + if (Array.isArray(b) || !(b instanceof Object)) { + return false; + } + + for (prop in a) { + //noinspection JSUnfilteredForInLoop + if (!exports.deepEqual(a[prop], b[prop])) { + return false; + } + } + for (prop in b) { + //noinspection JSUnfilteredForInLoop + if (!exports.deepEqual(a[prop], b[prop])) { + return false; + } + } + return true; + } + else { + return (typeof a === typeof b) && (a == b); + } + }; + + /** + * Test whether the current JavaScript engine supports Object.defineProperty + * @returns {boolean} returns true if supported + */ + exports.canDefineProperty = function () { + // test needed for broken IE8 implementation + try { + if (Object.defineProperty) { + Object.defineProperty({}, 'x', {}); + return true; + } + } catch (e) {} + + return false; + }; + + /** + * Attach a lazy loading property to a constant. + * The given function `fn` is called once when the property is first requested. + * On older browsers (15 digits + if (digits(x) > 15) { + throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + + '(value: ' + x + '). ' + + 'Use function bignumber(x) to convert to BigNumber.'); + } + return new math.type.BigNumber(x); + } + }, { + from: 'number', + to: 'Complex', + convert: function (x) { + return new math.type.Complex(x, 0); + } + }, { + from: 'number', + to: 'string', + convert: function (x) { + return x + ''; + } + }, { + from: 'BigNumber', + to: 'Complex', + convert: function (x) { + return new math.type.Complex(x.toNumber(), 0); + } + }, { + from: 'boolean', + to: 'number', + convert: function (x) { + return +x; + } + }, { + from: 'boolean', + to: 'BigNumber', + convert: function (x) { + return new math.type.BigNumber(+x); + } + }, { + from: 'boolean', + to: 'string', + convert: function (x) { + return +x; + } + }, { + from: 'null', + to: 'number', + convert: function () { + return 0; + } + }, { + from: 'null', + to: 'string', + convert: function () { + return 'null'; + } + }, { + from: 'null', + to: 'BigNumber', + convert: function () { + return new math.type.BigNumber(0); + } + }, { + from: 'Array', + to: 'Matrix', + convert: function (array) { + return new math.type.Matrix(array); + } + } + ]; + + return typed; + }; - var number = __webpack_require__(3), - string = __webpack_require__(205), - object = __webpack_require__(2), - types = __webpack_require__(335), - - DimensionError = __webpack_require__(165), - IndexError = __webpack_require__(170), - - isArray = Array.isArray; - - /** - * Calculate the size of a multi dimensional array. - * @param {Array} x - * @Return {Number[]} size - * @private - */ - function _size(x) { - var size = []; - - while (isArray(x)) { - size.push(x.length); - x = x[0]; - } - - return size; - } - - /** - * Calculate the size of a multi dimensional array. - * All elements in the array are checked for matching dimensions using the - * method validate - * @param {Array} x - * @Return {Number[]} size - * @throws RangeError - */ - exports.size = function(x) { - // calculate the size - var s = _size(x); - - // verify the size - exports.validate(x, s); - // TODO: don't validate here? only in a Matrix constructor? - - return s; - }; - - /** - * Recursively validate whether each element in a multi dimensional array - * has a size corresponding to the provided size array. - * @param {Array} array Array to be validated - * @param {Number[]} size Array with the size of each dimension - * @param {Number} dim Current dimension - * @throws DimensionError - * @private - */ - function _validate(array, size, dim) { - var i; - var len = array.length; - - if (len != size[dim]) { - throw new DimensionError(len, size[dim]); - } - - if (dim < size.length - 1) { - // recursively validate each child array - var dimNext = dim + 1; - for (i = 0; i < len; i++) { - var child = array[i]; - if (!isArray(child)) { - throw new DimensionError(size.length - 1, size.length, '<'); - } - _validate(array[i], size, dimNext); - } - } - else { - // last dimension. none of the childs may be an array - for (i = 0; i < len; i++) { - if (isArray(array[i])) { - throw new DimensionError(size.length + 1, size.length, '>'); - } - } - } - } - - /** - * Validate whether each element in a multi dimensional array has - * a size corresponding to the provided size array. - * @param {Array} array Array to be validated - * @param {Number[]} size Array with the size of each dimension - * @throws DimensionError - */ - exports.validate = function(array, size) { - var isScalar = (size.length == 0); - if (isScalar) { - // scalar - if (isArray(array)) { - throw new DimensionError(array.length, 0); - } - } - else { - // array - _validate(array, size, 0); - } - }; - - /** - * Test whether index is an integer number with index >= 0 and index < length - * @param {Number} index Zero-based index - * @param {Number} [length] Length of the array - */ - exports.validateIndex = function(index, length) { - if (!number.isNumber(index) || !number.isInteger(index)) { - throw new TypeError('Index must be an integer (value: ' + index + ')'); - } - if (index < 0) { - throw new IndexError(index); - } - if (length !== undefined && index >= length) { - throw new IndexError(index, length); - } - }; - - // a constant used to specify an undefined defaultValue - exports.UNINITIALIZED = {}; - - /** - * Resize a multi dimensional array. The resized array is returned. - * @param {Array} array Array to be resized - * @param {Array.} size Array with the size of each dimension - * @param {*} [defaultValue=0] Value to be filled in in new entries, - * zero by default. To leave new entries undefined, - * specify array.UNINITIALIZED as defaultValue - * @return {Array} array The resized array - */ - exports.resize = function(array, size, defaultValue) { - // TODO: add support for scalars, having size=[] ? - - // check the type of the arguments - if (!isArray(array) || !isArray(size)) { - throw new TypeError('Array expected'); - } - if (size.length === 0) { - throw new Error('Resizing to scalar is not supported'); - } - - // check whether size contains positive integers - size.forEach(function (value) { - if (!number.isNumber(value) || !number.isInteger(value) || value < 0) { - throw new TypeError('Invalid size, must contain positive integers ' + - '(size: ' + string.format(size) + ')'); - } - }); - - // recursively resize the array - var _defaultValue = (defaultValue !== undefined) ? defaultValue : 0; - _resize(array, size, 0, _defaultValue); - - return array; - }; - - /** - * Recursively resize a multi dimensional array - * @param {Array} array Array to be resized - * @param {Number[]} size Array with the size of each dimension - * @param {Number} dim Current dimension - * @param {*} [defaultValue] Value to be filled in in new entries, - * undefined by default. - * @private - */ - function _resize (array, size, dim, defaultValue) { - var i; - var elem; - var oldLen = array.length; - var newLen = size[dim]; - var minLen = Math.min(oldLen, newLen); - - // apply new length - array.length = newLen; - - if (dim < size.length - 1) { - // non-last dimension - var dimNext = dim + 1; - - // resize existing child arrays - for (i = 0; i < minLen; i++) { - // resize child array - elem = array[i]; - if (!isArray(elem)) { - elem = [elem]; // add a dimension - array[i] = elem; - } - _resize(elem, size, dimNext, defaultValue); - } - - // create new child arrays - for (i = minLen; i < newLen; i++) { - // get child array - elem = []; - array[i] = elem; - - // resize new child array - _resize(elem, size, dimNext, defaultValue); - } - } - else { - // last dimension - - // remove dimensions of existing values - for (i = 0; i < minLen; i++) { - while (isArray(array[i])) { - array[i] = array[i][0]; - } - } - - if(defaultValue !== exports.UNINITIALIZED) { - // fill new elements with the default value - for (i = minLen; i < newLen; i++) { - array[i] = object.clone(defaultValue); - } - } - } - } - - /** - * Squeeze a multi dimensional array - * @param {Array} array - * @param {Array} [size] - * @returns {Array} returns the array itself - * @private - */ - exports.squeeze = function(array, size) { - var s = size || exports.size(array); - - // squeeze outer dimensions - while (isArray(array) && array.length === 1) { - array = array[0]; - s.shift(); - } - - // find the first dimension to be squeezed - var dims = s.length; - while (s[dims - 1] === 1) { - dims--; - } - - // squeeze inner dimensions - if (dims < s.length) { - array = _squeeze(array, dims, 0); - s.length = dims; - } - - return array; - }; - - /** - * Recursively squeeze a multi dimensional array - * @param {Array} array - * @param {number} dims Required number of dimensions - * @param {number} dim Current dimension - * @returns {Array | *} Returns the squeezed array - * @private - */ - function _squeeze (array, dims, dim) { - var i, ii; - - if (dim < dims) { - var next = dim + 1; - for (i = 0, ii = array.length; i < ii; i++) { - array[i] = _squeeze(array[i], dims, next); - } - } - else { - while (isArray(array)) { - array = array[0]; - } - } - - return array; - } - - /** - * Unsqueeze a multi dimensional array: add dimensions when missing - * @param {Array} array - * @param {Number} dims Desired number of dimensions of the array - * @param {Number} [outer] Number of outer dimensions to be added - * @param {Array} [size] Current size of array - * @returns {Array} returns the array itself - * @private - */ - exports.unsqueeze = function(array, dims, outer, size) { - var s = size || exports.size(array); - - // unsqueeze outer dimensions - if (outer) { - for (var i = 0; i < outer; i++) { - array = [array]; - s.unshift(1); - } - } - - // unsqueeze inner dimensions - array = _unsqueeze(array, dims, 0); - while (s.length < dims) { - s.push(1); - } - - return array; - }; - - /** - * Recursively unsqueeze a multi dimensional array - * @param {Array} array - * @param {number} dims Required number of dimensions - * @param {number} dim Current dimension - * @returns {Array | *} Returns the squeezed array - * @private - */ - function _unsqueeze (array, dims, dim) { - var i, ii; - - if (isArray(array)) { - var next = dim + 1; - for (i = 0, ii = array.length; i < ii; i++) { - array[i] = _unsqueeze(array[i], dims, next); - } - } - else { - for (var d = dim; d < dims; d++) { - array = [array]; - } - } - - return array; - } - /** - * Flatten a multi dimensional array, put all elements in a one dimensional - * array - * @param {Array} array A multi dimensional array - * @return {Array} The flattened array (1 dimensional) - * @private - */ - exports.flatten = function(array) { - var flat = array, - isArray = Array.isArray; - - while (isArray(flat[0])) { - var next = []; - for (var i = 0, ii = flat.length; i < ii; i++) { - next = next.concat.apply(next, flat[i]); - } - flat = next; - } - - return flat; - }; - - /** - * Convert function arguments to an array. - * @param {Arguments} args - * @returns {Array} array - */ - exports.argsToArray = function(args) { - var array = []; - for (var i = 0, len = args.length; i < len; i++) { - array[i] = args[i]; - } - return array; - }; - - /** - * Test whether an object is an array - * @param {*} value - * @return {Boolean} isArray - */ - exports.isArray = isArray; /***/ }, /* 168 */ /***/ function(module, exports, __webpack_require__) { - module.exports = '2.0.0-SNAPSHOT'; - // Note: This file is automatically generated when building math.js. - // Changes made in this file will be overwritten. + 'use strict'; + + var isFactory = __webpack_require__(166).isFactory; + var traverse = __webpack_require__(166).traverse; + + // TODO: rework the import function to a typed function + + function factory (type, config, load, typed, math) { + /** + * Import functions from an object or a module + * + * Syntax: + * + * math.import(object) + * math.import(object, options) + * + * Where: + * + * - `object: Object` + * An object with functions to be imported. + * - `options: Object` An object with import options. Available options: + * - `override: boolean` + * If true, existing functions will be overwritten. False by default. + * - `wrap: boolean` + * If true, the functions will be wrapped in a wrapper function + * which converts data types like Matrix to primitive data types like Array. + * The wrapper is needed when extending math.js with libraries which do not + * support these data type. False by default. + * + * Examples: + * + * // define new functions and variables + * math.import({ + * myvalue: 42, + * hello: function (name) { + * return 'hello, ' + name + '!'; + * } + * }); + * + * // use the imported function and variable + * math.myvalue * 2; // 84 + * math.hello('user'); // 'hello, user!' + * + * // import the npm module numbers + * // (must be installed first with `npm install numbers`) + * math.import('numbers', {wrap: true}); + * + * math.fibonacci(7); // returns 13 + * + * @param {String | Object} object Object with functions to be imported. + * @param {Object} [options] Import options. + * @return {Object} Returns the imported objects + */ + function math_import(object, options) { + var num = arguments.length; + if (num != 1 && num != 2) { + throw new math.error.ArgumentsError('import', num, 1, 2); + } + + var name; + var opts = { + override: options && options.override || false, + wrap: options && options.wrap || false + }; + + if (typeof object === 'string') { + // a string with a module name + + if (false) { + throw new Error('Cannot load module: require not available.'); + } + + // load the module using require + var _module = __webpack_require__(346)(object); + return math_import(_module, options); + } + else if (isFactory(object)) { + return _importFactory(object); + } + else if (typeof object === 'object') { + // a map with functions + var imported = {}; + + for (name in object) { + if (object.hasOwnProperty(name)) { + var value = object[name]; + if (isSupportedType(value)) { + imported[name] = _import(name, value, opts); + } + else if (isFactory(object)) { + imported[name] = _importFactory(object); + } + else { + imported[name] = math_import(value, options); + } + } + } + + return imported; + } + else { + throw new TypeError('Object or module name expected'); + } + } + + /** + * Add a property to the math namespace and create a chain proxy for it. + * @param {String} name + * @param {*} value + * @param {Object} options See import for a description of the options + * @return {*} Returns the imported value + * @private + */ + function _import(name, value, options) { + // TODO: throw an error when override == false and the name is already defined + if (options.override || math[name] === undefined) { + // add to math namespace + if (options.wrap && typeof value === 'function') { + // create a wrapper around the function + math[name] = function () { + var args = []; + for (var i = 0, len = arguments.length; i < len; i++) { + var arg = arguments[i]; + args[i] = arg && arg.valueOf(); + } + return value.apply(math, args); + }; + if (value && value.transform) { + math[name].transform = value.transform; + } + } + else { + // just create a link to the function or value + math[name] = value; + } + + // register the transform function if any + if (value && value.transform) { + math.expression.transform[name] = value.transform; + } + + // create a proxy for the chain + math.type.Chain.createProxy(name, value); + + return value; + } + } + + /** + * Import an instance of a factory into math.js + * @param {{name: string, factory: function}} factory + * @returns {*} Returns the created and imported instance + * @private + */ + function _importFactory(factory) { + var instance = load(factory); + var namespace = factory.path ? traverse(math, factory.path) : math; + + if (namespace[factory.name]) { + // TODO: add support for merging typed-functions + throw new Error('"' + factory.name + '" already exists'); + } + namespace[factory.name] = instance; + + return instance; + } + + /** + * Check whether given object is a supported type + * @param object + * @return {Boolean} + * @private + */ + function isSupportedType(object) { + return typeof object == 'function' + || typeof object === 'number' + || typeof object === 'string' + || typeof object === 'boolean' + || object === null + || object instanceof type.Unit + || object instanceof type.Complex + } + + return math_import; + } + + exports.math = true; // request access to the math namespace as 5th argument of the factory function + exports.name = 'import'; + exports.factory = factory; /***/ }, /* 169 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Create a syntax error with the message: - * 'Wrong number of arguments in function ( provided, - expected)' - * @param {String} fn Function name - * @param {Number} count Actual argument count - * @param {Number} min Minimum required argument count - * @param {Number} [max] Maximum required argument count - * @extends Error - */ - function ArgumentsError(fn, count, min, max) { - if (!(this instanceof ArgumentsError)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.fn = fn; - this.count = count; - this.min = min; - this.max = max; - - this.message = 'Wrong number of arguments in function ' + fn + - ' (' + count + ' provided, ' + - min + ((max != undefined) ? ('-' + max) : '') + ' expected)'; - - this.stack = (new Error()).stack; - } - - ArgumentsError.prototype = new Error(); - ArgumentsError.prototype.constructor = Error; - ArgumentsError.prototype.name = 'ArgumentsError'; - - module.exports = ArgumentsError; + 'use strict'; + + module.exports = function (math, config) { + var object = __webpack_require__(166); + var bignumber = __webpack_require__(214); + var Complex = __webpack_require__(3); + var BigNumber = math.type.BigNumber; + + math['true'] = true; + math['false'] = false; + math['null'] = null; + math['uninitialized'] = __webpack_require__(172).UNINITIALIZED; + + if (config.number === 'bignumber') { + math['Infinity'] = new BigNumber(Infinity); + math['NaN'] = new BigNumber(NaN); + + object.lazy(math, 'pi', function () {return bignumber.pi(config.precision)}); + object.lazy(math, 'tau', function () {return bignumber.tau(config.precision)}); + object.lazy(math, 'e', function () {return bignumber.e(config.precision)}); + object.lazy(math, 'phi', function () {return bignumber.phi(config.precision)}); // golden ratio, (1+sqrt(5))/2 + + // uppercase constants (for compatibility with built-in Math) + object.lazy(math, 'E', function () {return math.e;}); + object.lazy(math, 'LN2', function () {return new BigNumber(2).ln();}); + object.lazy(math, 'LN10', function () {return new BigNumber(10).ln()}); + object.lazy(math, 'LOG2E', function () {return new BigNumber(1).div(new BigNumber(2).ln());}); + object.lazy(math, 'LOG10E', function () {return new BigNumber(1).div(new BigNumber(10).ln())}); + object.lazy(math, 'PI', function () {return math.pi}); + object.lazy(math, 'SQRT1_2', function () {return new BigNumber('0.5').sqrt()}); + object.lazy(math, 'SQRT2', function () {return new BigNumber(2).sqrt()}); + } + else { + math['Infinity'] = Infinity; + math['NaN'] = NaN; + + math.pi = Math.PI; + math.tau = Math.PI * 2; + math.e = Math.E; + math.phi = 1.61803398874989484820458683436563811772030917980576286213545; // golden ratio, (1+sqrt(5))/2 + + // uppercase constants (for compatibility with built-in Math) + math.E = math.e; + math.LN2 = Math.LN2; + math.LN10 = Math.LN10; + math.LOG2E = Math.LOG2E; + math.LOG10E = Math.LOG10E; + math.PI = math.pi; + math.SQRT1_2 = Math.SQRT1_2; + math.SQRT2 = Math.SQRT2; + } + + // complex i + math.i = new Complex(0, 1); + + // meta information + math.version = __webpack_require__(347); + }; /***/ }, /* 170 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Create a range error with the message: - * 'Index out of range (index < min)' - * 'Index out of range (index < max)' - * - * @param {number} index The actual index - * @param {number} [min=0] Minimum index (included) - * @param {number} [max] Maximum index (excluded) - * @extends RangeError - */ - function IndexError(index, min, max) { - if (!(this instanceof IndexError)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.index = index; - if (arguments.length < 3) { - this.min = 0; - this.max = min; - } - else { - this.min = min; - this.max = max; - } - - if (this.min !== undefined && this.index < this.min) { - this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')'; - } - else if (this.max !== undefined && this.index >= this.max) { - this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')'; - } - else { - this.message = 'Index out of range (' + this.index + ')'; - } - - this.stack = (new Error()).stack; - } - - IndexError.prototype = new RangeError(); - IndexError.prototype.constructor = RangeError; - IndexError.prototype.name = 'IndexError'; - - module.exports = IndexError; + 'use strict'; + + exports.ArgumentsError = __webpack_require__(177); + exports.DimensionError = __webpack_require__(174); + exports.IndexError = __webpack_require__(173); + exports.UnsupportedTypeError = __webpack_require__(348); + + // TODO: implement an InvalidValueError? /***/ }, /* 171 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Create a TypeError with message: - * 'Function does not support a parameter of type '; - * @param {String} fn Function name - * @param {*...} [types] The types of the function arguments - * @extends TypeError - */ - function UnsupportedTypeError(fn, types) { - if (!(this instanceof UnsupportedTypeError)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.fn = fn; - this.types = Array.prototype.splice.call(arguments, 1); - - if (!fn) { - this.message = 'Unsupported type of argument'; - } - else { - if (this.types.length == 0) { - this.message = 'Unsupported type of argument in function ' + fn; - } - else { - this.message = 'Function ' + fn + '(' + this.types.join(', ') + ') not supported'; - } - } - - this.stack = (new Error()).stack; - } - - UnsupportedTypeError.prototype = new TypeError(); - UnsupportedTypeError.prototype.constructor = TypeError; - UnsupportedTypeError.prototype.name = 'UnsupportedTypeError'; - - module.exports = UnsupportedTypeError; + 'use strict'; + + exports.array = __webpack_require__(172); + exports['boolean'] = __webpack_require__(209); + exports['function'] = __webpack_require__(349); + exports.number = __webpack_require__(175); + exports.bignumber = __webpack_require__(214); + exports.object = __webpack_require__(166); + exports.string = __webpack_require__(176); + exports.types = __webpack_require__(216); /***/ }, /* 172 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180), - object = __webpack_require__(2), - string = __webpack_require__(205), - collection = __webpack_require__(14), - util = __webpack_require__(164), - - isArray = Array.isArray, - isNode = Node.isNode; - - /** - * @constructor ArrayNode - * @extends {Node} - * Holds an 1-dimensional array with nodes - * @param {Node[]} [nodes] 1 dimensional array with nodes - */ - function ArrayNode(nodes) { - if (!(this instanceof ArrayNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - this.nodes = nodes || []; - - // validate input - if (!isArray(this.nodes) || !this.nodes.every(isNode)) { - throw new TypeError('Array containing Nodes expected') - } - } - - ArrayNode.prototype = new Node(); - - ArrayNode.prototype.type = 'ArrayNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @private - */ - ArrayNode.prototype._compile = function (defs) { - var asMatrix = (defs.math.config().matrix !== 'array'); - - var nodes = this.nodes.map(function (node) { - return node._compile(defs); - }); - - return (asMatrix ? 'math.matrix([' : '[') + - nodes.join(',') + - (asMatrix ? '])' : ']'); - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - ArrayNode.prototype.forEach = function (callback) { - for (var i = 0; i < this.nodes.length; i++) { - var node = this.nodes[i]; - callback(node, 'nodes[' + i + ']', this); - } - }; - - /** - * Create a new ArrayNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {ArrayNode} Returns a transformed copy of the node - */ - ArrayNode.prototype.map = function (callback) { - var nodes = []; - for (var i = 0; i < this.nodes.length; i++) { - nodes[i] = this._ifNode(callback(this.nodes[i], 'nodes[' + i + ']', this)); - } - return new ArrayNode(nodes); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {ArrayNode} - */ - ArrayNode.prototype.clone = function() { - return new ArrayNode(this.nodes.slice(0)) - }; - - /** - * Get string representation - * @return {String} str - * @override - */ - ArrayNode.prototype.toString = function() { - return string.format(this.nodes); - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - ArrayNode.prototype.toTex = function(type) { - type = type || 'bmatrix'; - var s = '\\begin{' + type + '}'; - - this.nodes.forEach(function(node) { - if (node.nodes) { - s += node.nodes.map(function(childNode) { - return childNode.toTex(); - }).join('&'); - } - else { - s += node.toTex(); - } - - // new line - s += '\\\\'; - }); - s += '\\end{' + type + '}'; - return s; - }; - - module.exports = ArrayNode; - + 'use strict'; + + var number = __webpack_require__(175); + var string = __webpack_require__(176); + var object = __webpack_require__(166); + var types = __webpack_require__(216); + + var DimensionError = __webpack_require__(174); + var IndexError = __webpack_require__(173); + + var isArray = Array.isArray; + + /** + * Calculate the size of a multi dimensional array. + * @param {Array} x + * @Return {Number[]} size + * @private + */ + function _size(x) { + var size = []; + + while (isArray(x)) { + size.push(x.length); + x = x[0]; + } + + return size; + } + + /** + * Calculate the size of a multi dimensional array. + * All elements in the array are checked for matching dimensions using the + * method validate + * @param {Array} x + * @Return {Number[]} size + * @throws RangeError + */ + exports.size = function(x) { + // calculate the size + var s = _size(x); + + // verify the size + exports.validate(x, s); + // TODO: don't validate here? only in a Matrix constructor? + + return s; + }; + + /** + * Recursively validate whether each element in a multi dimensional array + * has a size corresponding to the provided size array. + * @param {Array} array Array to be validated + * @param {Number[]} size Array with the size of each dimension + * @param {Number} dim Current dimension + * @throws DimensionError + * @private + */ + function _validate(array, size, dim) { + var i; + var len = array.length; + + if (len != size[dim]) { + throw new DimensionError(len, size[dim]); + } + + if (dim < size.length - 1) { + // recursively validate each child array + var dimNext = dim + 1; + for (i = 0; i < len; i++) { + var child = array[i]; + if (!isArray(child)) { + throw new DimensionError(size.length - 1, size.length, '<'); + } + _validate(array[i], size, dimNext); + } + } + else { + // last dimension. none of the childs may be an array + for (i = 0; i < len; i++) { + if (isArray(array[i])) { + throw new DimensionError(size.length + 1, size.length, '>'); + } + } + } + } + + /** + * Validate whether each element in a multi dimensional array has + * a size corresponding to the provided size array. + * @param {Array} array Array to be validated + * @param {Number[]} size Array with the size of each dimension + * @throws DimensionError + */ + exports.validate = function(array, size) { + var isScalar = (size.length == 0); + if (isScalar) { + // scalar + if (isArray(array)) { + throw new DimensionError(array.length, 0); + } + } + else { + // array + _validate(array, size, 0); + } + }; + + /** + * Test whether index is an integer number with index >= 0 and index < length + * @param {Number} index Zero-based index + * @param {Number} [length] Length of the array + */ + exports.validateIndex = function(index, length) { + if (!number.isNumber(index) || !number.isInteger(index)) { + throw new TypeError('Index must be an integer (value: ' + index + ')'); + } + if (index < 0) { + throw new IndexError(index); + } + if (length !== undefined && index >= length) { + throw new IndexError(index, length); + } + }; + + // a constant used to specify an undefined defaultValue + exports.UNINITIALIZED = {}; + + /** + * Resize a multi dimensional array. The resized array is returned. + * @param {Array} array Array to be resized + * @param {Array.} size Array with the size of each dimension + * @param {*} [defaultValue=0] Value to be filled in in new entries, + * zero by default. To leave new entries undefined, + * specify array.UNINITIALIZED as defaultValue + * @return {Array} array The resized array + */ + exports.resize = function(array, size, defaultValue) { + // TODO: add support for scalars, having size=[] ? + + // check the type of the arguments + if (!isArray(array) || !isArray(size)) { + throw new TypeError('Array expected'); + } + if (size.length === 0) { + throw new Error('Resizing to scalar is not supported'); + } + + // check whether size contains positive integers + size.forEach(function (value) { + if (!number.isNumber(value) || !number.isInteger(value) || value < 0) { + throw new TypeError('Invalid size, must contain positive integers ' + + '(size: ' + string.format(size) + ')'); + } + }); + + // recursively resize the array + var _defaultValue = (defaultValue !== undefined) ? defaultValue : 0; + _resize(array, size, 0, _defaultValue); + + return array; + }; + + /** + * Recursively resize a multi dimensional array + * @param {Array} array Array to be resized + * @param {Number[]} size Array with the size of each dimension + * @param {Number} dim Current dimension + * @param {*} [defaultValue] Value to be filled in in new entries, + * undefined by default. + * @private + */ + function _resize (array, size, dim, defaultValue) { + var i; + var elem; + var oldLen = array.length; + var newLen = size[dim]; + var minLen = Math.min(oldLen, newLen); + + // apply new length + array.length = newLen; + + if (dim < size.length - 1) { + // non-last dimension + var dimNext = dim + 1; + + // resize existing child arrays + for (i = 0; i < minLen; i++) { + // resize child array + elem = array[i]; + if (!isArray(elem)) { + elem = [elem]; // add a dimension + array[i] = elem; + } + _resize(elem, size, dimNext, defaultValue); + } + + // create new child arrays + for (i = minLen; i < newLen; i++) { + // get child array + elem = []; + array[i] = elem; + + // resize new child array + _resize(elem, size, dimNext, defaultValue); + } + } + else { + // last dimension + + // remove dimensions of existing values + for (i = 0; i < minLen; i++) { + while (isArray(array[i])) { + array[i] = array[i][0]; + } + } + + if(defaultValue !== exports.UNINITIALIZED) { + // fill new elements with the default value + for (i = minLen; i < newLen; i++) { + array[i] = object.clone(defaultValue); + } + } + } + } + + /** + * Squeeze a multi dimensional array + * @param {Array} array + * @param {Array} [size] + * @returns {Array} returns the array itself + */ + exports.squeeze = function(array, size) { + var s = size || exports.size(array); + + // squeeze outer dimensions + while (isArray(array) && array.length === 1) { + array = array[0]; + s.shift(); + } + + // find the first dimension to be squeezed + var dims = s.length; + while (s[dims - 1] === 1) { + dims--; + } + + // squeeze inner dimensions + if (dims < s.length) { + array = _squeeze(array, dims, 0); + s.length = dims; + } + + return array; + }; + + /** + * Recursively squeeze a multi dimensional array + * @param {Array} array + * @param {number} dims Required number of dimensions + * @param {number} dim Current dimension + * @returns {Array | *} Returns the squeezed array + * @private + */ + function _squeeze (array, dims, dim) { + var i, ii; + + if (dim < dims) { + var next = dim + 1; + for (i = 0, ii = array.length; i < ii; i++) { + array[i] = _squeeze(array[i], dims, next); + } + } + else { + while (isArray(array)) { + array = array[0]; + } + } + + return array; + } + + /** + * Unsqueeze a multi dimensional array: add dimensions when missing + * @param {Array} array + * @param {Number} dims Desired number of dimensions of the array + * @param {Number} [outer] Number of outer dimensions to be added + * @param {Array} [size] Current size of array + * @returns {Array} returns the array itself + * @private + */ + exports.unsqueeze = function(array, dims, outer, size) { + var s = size || exports.size(array); + + // unsqueeze outer dimensions + if (outer) { + for (var i = 0; i < outer; i++) { + array = [array]; + s.unshift(1); + } + } + + // unsqueeze inner dimensions + array = _unsqueeze(array, dims, 0); + while (s.length < dims) { + s.push(1); + } + + return array; + }; + + /** + * Recursively unsqueeze a multi dimensional array + * @param {Array} array + * @param {number} dims Required number of dimensions + * @param {number} dim Current dimension + * @returns {Array | *} Returns the squeezed array + * @private + */ + function _unsqueeze (array, dims, dim) { + var i, ii; + + if (isArray(array)) { + var next = dim + 1; + for (i = 0, ii = array.length; i < ii; i++) { + array[i] = _unsqueeze(array[i], dims, next); + } + } + else { + for (var d = dim; d < dims; d++) { + array = [array]; + } + } + + return array; + } + /** + * Flatten a multi dimensional array, put all elements in a one dimensional + * array + * @param {Array} array A multi dimensional array + * @return {Array} The flattened array (1 dimensional) + * @private + */ + exports.flatten = function(array) { + var flat = array, + isArray = Array.isArray; + + while (isArray(flat[0])) { + var next = []; + for (var i = 0, ii = flat.length; i < ii; i++) { + next = next.concat.apply(next, flat[i]); + } + flat = next; + } + + return flat; + }; + + /** + * Convert function arguments to an array. + * @param {Arguments} args + * @returns {Array} array + */ + exports.argsToArray = function(args) { + var array = []; + for (var i = 0, len = args.length; i < len; i++) { + array[i] = args[i]; + } + return array; + }; + + /** + * Test whether an object is an array + * @param {*} value + * @return {Boolean} isArray + */ + exports.isArray = isArray; /***/ }, /* 173 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; + 'use strict'; + + /** + * Create a range error with the message: + * 'Index out of range (index < min)' + * 'Index out of range (index < max)' + * + * @param {number} index The actual index + * @param {number} [min=0] Minimum index (included) + * @param {number} [max] Maximum index (excluded) + * @extends RangeError + */ + function IndexError(index, min, max) { + if (!(this instanceof IndexError)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.index = index; + if (arguments.length < 3) { + this.min = 0; + this.max = min; + } + else { + this.min = min; + this.max = max; + } + + if (this.min !== undefined && this.index < this.min) { + this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')'; + } + else if (this.max !== undefined && this.index >= this.max) { + this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')'; + } + else { + this.message = 'Index out of range (' + this.index + ')'; + } + + this.stack = (new Error()).stack; + } + + IndexError.prototype = new RangeError(); + IndexError.prototype.constructor = RangeError; + IndexError.prototype.name = 'IndexError'; + + module.exports = IndexError; - var Node = __webpack_require__(180), - ArrayNode = __webpack_require__(172), - - keywords = __webpack_require__(338), - - latex = __webpack_require__(339), - isString = __webpack_require__(205).isString; - - /** - * @constructor AssignmentNode - * @extends {Node} - * Define a symbol, like "a = 3.2" - * - * @param {String} name Symbol name - * @param {Node} expr The expression defining the symbol - */ - function AssignmentNode(name, expr) { - if (!(this instanceof AssignmentNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input - if (!isString(name)) throw new TypeError('String expected for parameter "name"'); - if (!(expr instanceof Node)) throw new TypeError('Node expected for parameter "expr"'); - if (name in keywords) throw new Error('Illegal symbol name, "' + name + '" is a reserved keyword'); - - this.name = name; - this.expr = expr; - } - - AssignmentNode.prototype = new Node(); - - AssignmentNode.prototype.type = 'AssignmentNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @private - */ - AssignmentNode.prototype._compile = function (defs) { - return 'scope["' + this.name + '"] = ' + this.expr._compile(defs) + ''; - }; - - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - AssignmentNode.prototype.forEach = function (callback) { - callback(this.expr, 'expr', this); - }; - - /** - * Create a new AssignmentNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {AssignmentNode} Returns a transformed copy of the node - */ - AssignmentNode.prototype.map = function (callback) { - return new AssignmentNode(this.name, this._ifNode(callback(this.expr, 'expr', this))); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {AssignmentNode} - */ - AssignmentNode.prototype.clone = function() { - return new AssignmentNode(this.name, this.expr); - }; - - /** - * Get string representation - * @return {String} - */ - AssignmentNode.prototype.toString = function() { - return this.name + ' = ' + this.expr.toString(); - }; - - /** - * Get LaTeX representation - * @return {String} - */ - AssignmentNode.prototype.toTex = function() { - var brace; - if (this.expr instanceof ArrayNode) { - brace = ['\\mathbf{', '}']; - } - return latex.addBraces(latex.toSymbol(this.name), brace) + '=' + - latex.addBraces(this.expr.toTex()); - }; - - module.exports = AssignmentNode; /***/ }, /* 174 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - var ResultSet = __webpack_require__(10); - var isBoolean = __webpack_require__(204).isBoolean; - - /** - * @constructor BlockNode - * @extends {Node} - * Holds a set with blocks - * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks - * An array with blocks, where a block is constructed as an Object - * with properties block, which is a Node, and visible, which is - * a boolean. The property visible is optional and is true by default - */ - function BlockNode(blocks) { - if (!(this instanceof BlockNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input, copy blocks - if (!Array.isArray(blocks)) throw new Error('Array expected'); - this.blocks = blocks.map(function (block) { - var node = block && block.node; - var visible = block && block.visible !== undefined ? block.visible : true; - - if (!(node instanceof Node)) throw new TypeError('Property "node" must be a Node'); - if (!isBoolean(visible)) throw new TypeError('Property "visible" must be a boolean'); - - return { - node: node, - visible: visible - } - }); - } - - BlockNode.prototype = new Node(); - - BlockNode.prototype.type = 'BlockNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - BlockNode.prototype._compile = function (defs) { - defs.ResultSet = ResultSet; - var blocks = this.blocks.map(function (param) { - var js = param.node._compile(defs); - if (param.visible) { - return 'results.push(' + js + ');'; - } - else { - return js + ';'; - } - }); - - return '(function () {' + - 'var results = [];' + - blocks.join('') + - 'return new ResultSet(results);' + - '})()'; - }; - - /** - * Execute a callback for each of the child blocks of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - BlockNode.prototype.forEach = function (callback) { - for (var i = 0; i < this.blocks.length; i++) { - callback(this.blocks[i].node, 'blocks[' + i + '].node', this); - } - }; - - /** - * Create a new BlockNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {BlockNode} Returns a transformed copy of the node - */ - BlockNode.prototype.map = function (callback) { - var blocks = []; - for (var i = 0; i < this.blocks.length; i++) { - var block = this.blocks[i]; - var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this)); - blocks[i] = { - node: node, - visible: block.visible - }; - } - return new BlockNode(blocks); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {BlockNode} - */ - BlockNode.prototype.clone = function() { - var blocks = this.blocks.map(function(block) { - return { - node: block.node, - visible: block.visible - }; - }); - - return new BlockNode(blocks); - }; - - /** - * Get string representation - * @return {String} str - * @override - */ - BlockNode.prototype.toString = function() { - return this.blocks.map(function (param) { - return param.node.toString() + (param.visible ? '' : ';'); - }).join('\n'); - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - BlockNode.prototype.toTex = function() { - return this.blocks.map(function (param) { - return param.node.toTex() + (param.visible ? '' : ';'); - }).join('\n'); - }; - - module.exports = BlockNode; + 'use strict'; + + /** + * Create a range error with the message: + * 'Dimension mismatch ( != )' + * @param {number | number[]} actual The actual size + * @param {number | number[]} expected The expected size + * @param {string} [relation='!='] Optional relation between actual + * and expected size: '!=', '<', etc. + * @extends RangeError + */ + function DimensionError(actual, expected, relation) { + if (!(this instanceof DimensionError)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.actual = actual; + this.expected = expected; + this.relation = relation; + + this.message = 'Dimension mismatch (' + + (Array.isArray(actual) ? ('[' + actual.join(', ') + ']') : actual) + + ' ' + (this.relation || '!=') + ' ' + + (Array.isArray(expected) ? ('[' + expected.join(', ') + ']') : expected) + + ')'; + + this.stack = (new Error()).stack; + } + + DimensionError.prototype = new RangeError(); + DimensionError.prototype.constructor = RangeError; + DimensionError.prototype.name = 'DimensionError'; + + module.exports = DimensionError; /***/ }, /* 175 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - var latex = __webpack_require__(339); - var BigNumber = __webpack_require__(12); - var Complex = __webpack_require__(4); - var Unit = __webpack_require__(8); - var util = __webpack_require__(164); - var isString = util.string.isString; - var isNumber = util.number.isNumber; - var isBoolean = util['boolean'].isBoolean; - - /** - * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr' - * - * @param {Node} condition Condition, must result in a boolean - * @param {Node} trueExpr Expression evaluated when condition is true - * @param {Node} falseExpr Expression evaluated when condition is true - * - * @constructor ConditionalNode - * @extends {Node} - */ - function ConditionalNode (condition, trueExpr, falseExpr) { - if (!(this instanceof ConditionalNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - if (!(condition instanceof Node)) throw new TypeError('Parameter condition must be a Node'); - if (!(trueExpr instanceof Node)) throw new TypeError('Parameter trueExpr must be a Node'); - if (!(falseExpr instanceof Node)) throw new TypeError('Parameter falseExpr must be a Node'); - - this.condition = condition; - this.trueExpr = trueExpr; - this.falseExpr = falseExpr; - } - - ConditionalNode.prototype = new Node(); - - ConditionalNode.prototype.type = 'ConditionalNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - ConditionalNode.prototype._compile = function(defs) { - /** - * Test whether a condition is met - * @param {*} condition - * @returns {boolean} true if condition is true or non-zero, else false - */ - defs.testCondition = function (condition) { - if (isNumber(condition) || isBoolean(condition) || isString(condition)) { - return condition ? true : false; - } - - if (condition instanceof BigNumber) { - return condition.isZero() ? false : true; - } - - if (condition instanceof Complex) { - return (condition.re || condition.im) ? true : false; - } - - if (condition instanceof Unit) { - return condition.value ? true : false; - } - - if (condition === null || condition === undefined) { - return false; - } - - throw new TypeError('Unsupported type of condition "' + defs.math['typeof'](condition) + '"'); - }; - - return ( - 'testCondition(' + this.condition._compile(defs) + ') ? ' + - '( ' + this.trueExpr._compile(defs) + ') : ' + - '( ' + this.falseExpr._compile(defs) + ')' - ); - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - ConditionalNode.prototype.forEach = function (callback) { - callback(this.condition, 'condition', this); - callback(this.trueExpr, 'trueExpr', this); - callback(this.falseExpr, 'falseExpr', this); - }; - - /** - * Create a new ConditionalNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {ConditionalNode} Returns a transformed copy of the node - */ - ConditionalNode.prototype.map = function (callback) { - return new ConditionalNode( - this._ifNode(callback(this.condition, 'condition', this)), - this._ifNode(callback(this.trueExpr, 'trueExpr', this)), - this._ifNode(callback(this.falseExpr, 'falseExpr', this)) - ); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {ConditionalNode} - */ - ConditionalNode.prototype.clone = function() { - return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr); - }; - - /** - * Get string representation - * @return {String} str - */ - ConditionalNode.prototype.toString = function() { - // TODO: not nice adding parenthesis al the time - return '(' + this.condition.toString() + ') ? (' + - this.trueExpr.toString() + ') : (' + - this.falseExpr.toString() + ')'; - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - ConditionalNode.prototype.toTex = function() { - var s = ( - latex.addBraces(this.trueExpr.toTex()) + - ', &\\quad' + - latex.addBraces('\\text{if}\\;' + this.condition.toTex()) - ) + '\\\\' + ( - latex.addBraces(this.falseExpr.toTex()) + - ', &\\quad' + - latex.addBraces('\\text{otherwise}') - ); - - return latex.addBraces(s, [ - '\\left\\{\\begin{array}{l l}', - '\\end{array}\\right.' - ]); - }; - - module.exports = ConditionalNode; + 'use strict'; + + var NumberFormatter = __webpack_require__(351); + + /** + * Test whether value is a Number + * @param {*} value + * @return {Boolean} isNumber + */ + exports.isNumber = function(value) { + return (value instanceof Number) || (typeof value == 'number'); + }; + + /** + * Check if a number is integer + * @param {Number | Boolean} value + * @return {Boolean} isInteger + */ + exports.isInteger = function(value) { + return (value == Math.round(value)); + // Note: we use ==, not ===, as we can have Booleans as well + }; + + /** + * Calculate the sign of a number + * @param {Number} x + * @returns {*} + */ + exports.sign = function(x) { + if (x > 0) { + return 1; + } + else if (x < 0) { + return -1; + } + else { + return 0; + } + }; + + /** + * Convert a number to a formatted string representation. + * + * Syntax: + * + * format(value) + * format(value, options) + * format(value, precision) + * format(value, fn) + * + * Where: + * + * {Number} value The value to be formatted + * {Object} options An object with formatting options. Available options: + * {String} notation + * Number notation. Choose from: + * 'fixed' Always use regular number notation. + * For example '123.40' and '14000000' + * 'exponential' Always use exponential notation. + * For example '1.234e+2' and '1.4e+7' + * 'auto' (default) Regular number notation for numbers + * having an absolute value between + * `lower` and `upper` bounds, and uses + * exponential notation elsewhere. + * Lower bound is included, upper bound + * is excluded. + * For example '123.4' and '1.4e7'. + * {Number} precision A number between 0 and 16 to round + * the digits of the number. + * In case of notations 'exponential' and + * 'auto', `precision` defines the total + * number of significant digits returned + * and is undefined by default. + * In case of notation 'fixed', + * `precision` defines the number of + * significant digits after the decimal + * point, and is 0 by default. + * {Object} exponential An object containing two parameters, + * {Number} lower and {Number} upper, + * used by notation 'auto' to determine + * when to return exponential notation. + * Default values are `lower=1e-3` and + * `upper=1e5`. + * Only applicable for notation `auto`. + * {Function} fn A custom formatting function. Can be used to override the + * built-in notations. Function `fn` is called with `value` as + * parameter and must return a string. Is useful for example to + * format all values inside a matrix in a particular way. + * + * Examples: + * + * format(6.4); // '6.4' + * format(1240000); // '1.24e6' + * format(1/3); // '0.3333333333333333' + * format(1/3, 3); // '0.333' + * format(21385, 2); // '21000' + * format(12.071, {notation: 'fixed'}); // '12' + * format(2.3, {notation: 'fixed', precision: 2}); // '2.30' + * format(52.8, {notation: 'exponential'}); // '5.28e+1' + * + * @param {Number} value + * @param {Object | Function | Number} [options] + * @return {String} str The formatted value + */ + exports.format = function(value, options) { + if (typeof options === 'function') { + // handle format(value, fn) + return options(value); + } + + // handle special cases + if (value === Infinity) { + return 'Infinity'; + } + else if (value === -Infinity) { + return '-Infinity'; + } + else if (isNaN(value)) { + return 'NaN'; + } + + // default values for options + var notation = 'auto'; + var precision = undefined; + + if (options) { + // determine notation from options + if (options.notation) { + notation = options.notation; + } + + // determine precision from options + if (exports.isNumber(options)) { + precision = options; + } + else if (options.precision) { + precision = options.precision; + } + } + + // handle the various notations + switch (notation) { + case 'fixed': + return exports.toFixed(value, precision); + + case 'exponential': + return exports.toExponential(value, precision); + + case 'auto': + return exports + .toPrecision(value, precision, options && options.exponential) + + // remove trailing zeros after the decimal point + .replace(/((\.\d*?)(0+))($|e)/, function () { + var digits = arguments[2]; + var e = arguments[4]; + return (digits !== '.') ? digits + e : e; + }); + + default: + throw new Error('Unknown notation "' + notation + '". ' + + 'Choose "auto", "exponential", or "fixed".'); + } + }; + + /** + * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3' + * @param {Number} value + * @param {Number} [precision] Number of digits in formatted output. + * If not provided, the maximum available digits + * is used. + * @returns {string} str + */ + exports.toExponential = function(value, precision) { + return new NumberFormatter(value).toExponential(precision); + }; + + /** + * Format a number with fixed notation. + * @param {Number} value + * @param {Number} [precision=0] Optional number of decimals after the + * decimal point. Zero by default. + */ + exports.toFixed = function(value, precision) { + return new NumberFormatter(value).toFixed(precision); + }; + + /** + * Format a number with a certain precision + * @param {Number} value + * @param {Number} [precision=undefined] Optional number of digits. + * @param {{lower: number, upper: number}} [options] By default: + * lower = 1e-3 (excl) + * upper = 1e+5 (incl) + * @return {string} + */ + exports.toPrecision = function(value, precision, options) { + return new NumberFormatter(value).toPrecision(precision, options); + }; + + /** + * Count the number of significant digits of a number. + * + * For example: + * 2.34 returns 3 + * 0.0034 returns 2 + * 120.5e+30 returns 4 + * + * @param {Number} value + * @return {Number} digits Number of significant digits + */ + exports.digits = function(value) { + return value + .toExponential() + .replace(/e.*$/, '') // remove exponential notation + .replace( /^0\.?0*|\./, '') // remove decimal point and leading zeros + .length + }; + + /** + * Minimum number added to one that makes the result different than one + */ + exports.DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16; + + /** + * Compares two floating point numbers. + * @param {Number} x First value to compare + * @param {Number} y Second value to compare + * @param {Number} [epsilon] The maximum relative difference between x and y + * If epsilon is undefined or null, the function will + * test whether x and y are exactly equal. + * @return {boolean} whether the two numbers are equal + */ + exports.nearlyEqual = function(x, y, epsilon) { + // if epsilon is null or undefined, test whether x and y are exactly equal + if (epsilon == null) return x == y; + + // use "==" operator, handles infinities + if (x == y) return true; + + // NaN + if (isNaN(x) || isNaN(y)) return false; + + // at this point x and y should be finite + if(isFinite(x) && isFinite(y)) { + // check numbers are very close, needed when comparing numbers near zero + var diff = Math.abs(x - y); + if (diff < exports.DBL_EPSILON) { + return true; + } + else { + // use relative error + return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon; + } + } + + // Infinite and Number or negative Infinite and positive Infinite cases + return false; + }; /***/ }, /* 176 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - var BigNumber = __webpack_require__(12); - var type = __webpack_require__(335).type; - var isString = __webpack_require__(205).isString; - - /** - * A ConstantNode holds a constant value like a number or string. A ConstantNode - * stores a stringified version of the value and uses this to compile to - * JavaScript. - * - * In case of a stringified number as input, this may be compiled to a BigNumber - * when the math instance is configured for BigNumbers. - * - * Usage: - * - * // stringified values with type - * new ConstantNode('2.3', 'number'); - * new ConstantNode('true', 'boolean'); - * new ConstantNode('hello', 'string'); - * - * // non-stringified values, type will be automatically detected - * new ConstantNode(2.3); - * new ConstantNode('hello'); - * - * @param {String | Number | Boolean | null | undefined} value - * When valueType is provided, value must contain - * an uninterpreted string representing the value. - * When valueType is undefined, value can be a - * number, string, boolean, null, or undefined, and - * the type will be determined automatically. - * @param {String} [valueType] The type of value. Choose from 'number', 'string', - * 'boolean', 'undefined', 'null' - * @constructor ConstantNode - * @extends {Node} - */ - function ConstantNode(value, valueType) { - if (!(this instanceof ConstantNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (valueType) { - if (!isString(valueType)) { - throw new TypeError('String expected for parameter "valueType"'); - } - if (!isString(value)){ - throw new TypeError('String expected for parameter "value"'); - } - - this.value = value; - this.valueType = valueType; - } - else { - // stringify the value and determine the type - this.value = value + ''; - this.valueType = type(value); - } - - if (!SUPPORTED_TYPES[this.valueType]) { - throw new TypeError('Unsupported type of value "' + this.valueType + '"'); - } - } - - var SUPPORTED_TYPES = { - 'number': true, - 'string': true, - 'boolean': true, - 'undefined': true, - 'null': true - }; - - ConstantNode.prototype = new Node(); - - ConstantNode.prototype.type = 'ConstantNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - ConstantNode.prototype._compile = function (defs) { - switch (this.valueType) { - case 'number': - if (defs.math.config().number === 'bignumber') { - return 'math.bignumber("' + this.value + '")'; - } - else { - // remove leading zeros like '003.2' which are not allowed by JavaScript - return this.value.replace(/^(0*)[0-9]/, function (match, zeros) { - return match.substring(zeros.length); - }); - } - - case 'string': - return '"' + this.value + '"'; - - case 'boolean': - return this.value; - - case 'undefined': - return this.value; - - case 'null': - return this.value; - - default: - // TODO: move this error to the constructor? - throw new TypeError('Unsupported type of constant "' + this.valueType + '"'); - } - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - ConstantNode.prototype.forEach = function (callback) { - // nothing to do, we don't have childs - }; - - - /** - * Create a new ConstantNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node) : Node} callback - * @returns {ConstantNode} Returns a clone of the node - */ - ConstantNode.prototype.map = function (callback) { - return this.clone(); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {ConstantNode} - */ - ConstantNode.prototype.clone = function() { - return new ConstantNode(this.value, this.valueType); - }; - - /** - * Get string representation - * @return {String} str - */ - ConstantNode.prototype.toString = function() { - switch (this.valueType) { - case 'string': - return '"' + this.value + '"'; - - default: - return this.value; - } - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - ConstantNode.prototype.toTex = function() { - var value = this.value, - index; - switch (this.valueType) { - case 'string': - return '\\text{' + value + '}'; - - case 'number': - index = value.toLowerCase().indexOf('e'); - if (index !== -1) { - return value.substring(0, index) + ' \\cdot 10^{' + - value.substring(index + 1) + '}'; - } - return value; - - default: - return value; - } - }; - - module.exports = ConstantNode; + 'use strict'; + + var number = __webpack_require__(175); + var bignumber = __webpack_require__(214); + var BigNumber = __webpack_require__(350); + + /** + * Test whether value is a String + * @param {*} value + * @return {Boolean} isString + */ + exports.isString = function(value) { + return (value instanceof String) || (typeof value == 'string'); + }; + + /** + * Check if a text ends with a certain string. + * @param {String} text + * @param {String} search + */ + exports.endsWith = function(text, search) { + var start = text.length - search.length; + var end = text.length; + return (text.substring(start, end) === search); + }; + + /** + * Format a value of any type into a string. + * + * Usage: + * math.format(value) + * math.format(value, precision) + * + * If value is a function, the returned string is 'function' unless the function + * has a property `description`, in that case this properties value is returned. + * + * Example usage: + * math.format(2/7); // '0.2857142857142857' + * math.format(math.pi, 3); // '3.14' + * math.format(new Complex(2, 3)); // '2 + 3i' + * math.format('hello'); // '"hello"' + * + * @param {*} value Value to be stringified + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @return {String} str + */ + exports.format = function(value, options) { + if (number.isNumber(value)) { + return number.format(value, options); + } + + if (value instanceof BigNumber) { + return bignumber.format(value, options); + } + + if (Array.isArray(value)) { + return formatArray(value, options); + } + + if (exports.isString(value)) { + return '"' + value + '"'; + } + + if (typeof value === 'function') { + return value.syntax ? value.syntax + '' : 'function'; + } + + if (value instanceof Object) { + if (typeof value.format === 'function') { + return value.format(options); + } + else { + return value.toString(); + } + } + + return String(value); + }; + + /** + * Recursively format an n-dimensional matrix + * Example output: "[[1, 2], [3, 4]]" + * @param {Array} array + * @param {Object | Number | Function} [options] Formatting options. See + * lib/util/number:format for a + * description of the available + * options. + * @returns {String} str + */ + function formatArray (array, options) { + if (Array.isArray(array)) { + var str = '['; + var len = array.length; + for (var i = 0; i < len; i++) { + if (i != 0) { + str += ', '; + } + str += formatArray(array[i], options); + } + str += ']'; + return str; + } + else { + return exports.format(array, options); + } + } /***/ }, /* 177 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; + 'use strict'; + + /** + * Create a syntax error with the message: + * 'Wrong number of arguments in function ( provided, - expected)' + * @param {String} fn Function name + * @param {Number} count Actual argument count + * @param {Number} min Minimum required argument count + * @param {Number} [max] Maximum required argument count + * @extends Error + */ + function ArgumentsError(fn, count, min, max) { + if (!(this instanceof ArgumentsError)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.fn = fn; + this.count = count; + this.min = min; + this.max = max; + + this.message = 'Wrong number of arguments in function ' + fn + + ' (' + count + ' provided, ' + + min + ((max != undefined) ? ('-' + max) : '') + ' expected)'; + + this.stack = (new Error()).stack; + } + + ArgumentsError.prototype = new Error(); + ArgumentsError.prototype.constructor = Error; + ArgumentsError.prototype.name = 'ArgumentsError'; + + module.exports = ArgumentsError; - var Node = __webpack_require__(180); - var RangeNode = __webpack_require__(182); - var SymbolNode = __webpack_require__(183); - - var BigNumber = __webpack_require__(12); - var Range = __webpack_require__(5); - - var isNode = Node.isNode; - var isArray = Array.isArray; - - /** - * @constructor IndexNode - * @extends Node - * - * get a subset of a matrix - * - * @param {Node} object - * @param {Node[]} ranges - */ - function IndexNode (object, ranges) { - if (!(this instanceof IndexNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input - if (!(object instanceof Node)) throw new TypeError('Node expected for parameter "object"'); - if (!isArray(ranges) || !ranges.every(isNode)) { - throw new TypeError('Array containing Nodes expected for parameter "ranges"'); - } - - this.object = object; - this.ranges = ranges; - } - - IndexNode.prototype = new Node(); - - IndexNode.prototype.type = 'IndexNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - IndexNode.prototype._compile = function (defs) { - return this.compileSubset(defs); - }; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the - * compiled expression - * @param {String} [replacement] If provided, the function returns - * "math.subset(obj, math.index(...), replacement)" - * Else, the function returns - * "math.subset(obj, math.index(...))" - * @return {String} js - * @returns {string} - */ - IndexNode.prototype.compileSubset = function(defs, replacement) { - // check whether any of the ranges expressions uses the context symbol 'end' - function test(node) { - return (node instanceof SymbolNode) && (node.name == 'end'); - } - - var someUseEnd = false; - var rangesUseEnd = this.ranges.map(function (range) { - var useEnd = range.filter(test).length > 0; - someUseEnd = useEnd ? useEnd : someUseEnd; - return useEnd; - }); - - // create a Range from start, step and end - defs.range = function (start, end, step) { - return new Range( - start instanceof BigNumber ? start.toNumber() : start, - end instanceof BigNumber ? end.toNumber() : end, - step instanceof BigNumber ? step.toNumber() : step - ); - }; - - // TODO: implement support for bignumber (currently bignumbers are silently - // reduced to numbers when changing the value to zero-based) - - // TODO: Optimization: when the range values are ConstantNodes, - // we can beforehand resolve the zero-based value - - var ranges = this.ranges.map(function(range, i) { - var useEnd = rangesUseEnd[i]; - if (range instanceof RangeNode) { - if (useEnd) { - // resolve end and create range - return '(function (scope) {' + - ' scope = Object.create(scope); ' + - ' scope["end"] = size[' + i + '];' + - ' return range(' + - ' ' + range.start._compile(defs) + ', ' + - ' ' + range.end._compile(defs) + ', ' + - ' ' + (range.step ? range.step._compile(defs) : '1') + - ' );' + - '})(scope)'; - } - else { - // create range - return 'range(' + - range.start._compile(defs) + ', ' + - range.end._compile(defs) + ', ' + - (range.step ? range.step._compile(defs) : '1') + - ')'; - } - } - else { - if (useEnd) { - // resolve the parameter 'end' - return '(function (scope) {' + - ' scope = Object.create(scope); ' + - ' scope["end"] = size[' + i + '];' + - ' return ' + range._compile(defs) + ';' + - '})(scope)' - } - else { - // just evaluate the expression - return range._compile(defs); - } - } - }); - - // if some parameters use the 'end' parameter, we need to calculate the size - if (someUseEnd) { - return '(function () {' + - ' var obj = ' + this.object._compile(defs) + ';' + - ' var size = math.size(obj).valueOf();' + - ' return math.subset(' + - ' obj, ' + - ' math.index(' + ranges.join(', ') + ')' + - ' ' + (replacement ? (', ' + replacement) : '') + - ' );' + - '})()'; - } - else { - return 'math.subset(' + - this.object._compile(defs) + ',' + - 'math.index(' + ranges.join(', ') + ')' + - (replacement ? (', ' + replacement) : '') + - ')'; - } - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - IndexNode.prototype.forEach = function (callback) { - // object - callback(this.object, 'object', this); - - // ranges - for (var i = 0; i < this.ranges.length; i++) { - callback(this.ranges[i], 'ranges[' + i + ']', this); - } - }; - - /** - * Create a new IndexNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {IndexNode} Returns a transformed copy of the node - */ - IndexNode.prototype.map = function (callback) { - var object = this._ifNode(callback(this.object, 'object', this)); - - var ranges = []; - for (var i = 0; i < this.ranges.length; i++) { - ranges[i] = this._ifNode(callback(this.ranges[i], 'ranges[' + i + ']', this)); - } - - return new IndexNode(object, ranges); - }; - - /** - * Get the name of the object linked to this IndexNode - * @return {string} name - */ - IndexNode.prototype.objectName = function() { - return this.object.name; - }; - - /** - * Create a clone of this node, a shallow copy - * @return {IndexNode} - */ - IndexNode.prototype.clone = function() { - return new IndexNode(this.object, this.ranges.slice(0)); - }; - - /** - * Get string representation - * @return {String} str - */ - IndexNode.prototype.toString = function() { - // format the parameters like "[1, 0:5]" - return this.object.toString() + '[' + this.ranges.join(', ') + ']'; - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - IndexNode.prototype.toTex = function() { - return this.object.toTex() + '[' + this.ranges.join(', ') + ']'; - }; - - module.exports = IndexNode; /***/ }, /* 178 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - var keywords = __webpack_require__(338); - var latex = __webpack_require__(339); - var isString = __webpack_require__(205).isString; - var isArray = Array.isArray; - - /** - * @constructor FunctionAssignmentNode - * @extends {Node} - * Function assignment - * - * @param {String} name Function name - * @param {String[]} params Function parameter names - * @param {Node} expr The function expression - */ - function FunctionAssignmentNode(name, params, expr) { - if (!(this instanceof FunctionAssignmentNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input - if (!isString(name)) throw new TypeError('String expected for parameter "name"'); - if (!isArray(params) || !params.every(isString)) throw new TypeError('Array containing strings expected for parameter "params"'); - if (!(expr instanceof Node)) throw new TypeError('Node expected for parameter "expr"'); - if (name in keywords) throw new Error('Illegal function name, "' + name + '" is a reserved keyword'); - - this.name = name; - this.params = params; - this.expr = expr; - } - - FunctionAssignmentNode.prototype = new Node(); - - FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - FunctionAssignmentNode.prototype._compile = function (defs) { - return 'scope["' + this.name + '"] = ' + - ' (function (scope) {' + - ' scope = Object.create(scope); ' + - ' var fn = function ' + this.name + '(' + this.params.join(',') + ') {' + - ' if (arguments.length != ' + this.params.length + ') {' + - // TODO: use util.error.ArgumentsError here - // TODO: test arguments error - ' throw new SyntaxError("Wrong number of arguments in function ' + this.name + ' (" + arguments.length + " provided, ' + this.params.length + ' expected)");' + - ' }' + - this.params.map(function (variable, index) { - return 'scope["' + variable + '"] = arguments[' + index + '];'; - }).join('') + - ' return ' + this.expr._compile(defs) + '' + - ' };' + - ' fn.syntax = "' + this.name + '(' + this.params.join(', ') + ')";' + - ' return fn;' + - ' })(scope);'; - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - FunctionAssignmentNode.prototype.forEach = function (callback) { - callback(this.expr, 'expr', this); - }; - - /** - * Create a new FunctionAssignmentNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {FunctionAssignmentNode} Returns a transformed copy of the node - */ - FunctionAssignmentNode.prototype.map = function (callback) { - var expr = this._ifNode(callback(this.expr, 'expr', this)); - - return new FunctionAssignmentNode(this.name, this.params.slice(0), expr); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {FunctionAssignmentNode} - */ - FunctionAssignmentNode.prototype.clone = function() { - return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr); - }; - - /** - * get string representation - * @return {String} str - */ - FunctionAssignmentNode.prototype.toString = function() { - return 'function ' + this.name + - '(' + this.params.join(', ') + ') = ' + - this.expr.toString(); - }; - - /** - * get LaTeX representation - * @return {String} str - */ - FunctionAssignmentNode.prototype.toTex = function() { - return this.name + - latex.addBraces(this.params.map(latex.toSymbol).join(', '), true) + '=' + - latex.addBraces(this.expr.toTex()); - }; - - module.exports = FunctionAssignmentNode; + 'use strict'; + + var Node = __webpack_require__(190), + string = __webpack_require__(176), + + isArray = Array.isArray, + isNode = Node.isNode; + + /** + * @constructor ArrayNode + * @extends {Node} + * Holds an 1-dimensional array with nodes + * @param {Node[]} [nodes] 1 dimensional array with nodes + */ + function ArrayNode(nodes) { + if (!(this instanceof ArrayNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.nodes = nodes || []; + + // validate input + if (!isArray(this.nodes) || !this.nodes.every(isNode)) { + throw new TypeError('Array containing Nodes expected'); + } + } + + ArrayNode.prototype = new Node(); + + ArrayNode.prototype.type = 'ArrayNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @private + */ + ArrayNode.prototype._compile = function (defs) { + var asMatrix = (defs.math.config().matrix !== 'array'); + + var nodes = this.nodes.map(function (node) { + return node._compile(defs); + }); + + return (asMatrix ? 'math.matrix([' : '[') + + nodes.join(',') + + (asMatrix ? '])' : ']'); + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + ArrayNode.prototype.forEach = function (callback) { + for (var i = 0; i < this.nodes.length; i++) { + var node = this.nodes[i]; + callback(node, 'nodes[' + i + ']', this); + } + }; + + /** + * Create a new ArrayNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {ArrayNode} Returns a transformed copy of the node + */ + ArrayNode.prototype.map = function (callback) { + var nodes = []; + for (var i = 0; i < this.nodes.length; i++) { + nodes[i] = this._ifNode(callback(this.nodes[i], 'nodes[' + i + ']', this)); + } + return new ArrayNode(nodes); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {ArrayNode} + */ + ArrayNode.prototype.clone = function() { + return new ArrayNode(this.nodes.slice(0)); + }; + + /** + * Get string representation + * @return {String} str + * @override + */ + ArrayNode.prototype.toString = function() { + return string.format(this.nodes); + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @param {String} type + * @return {String} str + */ + ArrayNode.prototype._toTex = function(callbacks) { + this.latexType = this.latexType || 'bmatrix'; + var s = '\\begin{' + this.latexType + '}'; + + this.nodes.forEach(function(node) { + if (node.nodes) { + s += node.nodes.map(function(childNode) { + return childNode.toTex(callbacks); + }).join('&'); + } + else { + s += node.toTex(callbacks); + } + + // new line + s += '\\\\'; + }); + s += '\\end{' + this.latexType + '}'; + return s; + }; + + module.exports = ArrayNode; /***/ }, /* 179 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - var SymbolNode = __webpack_require__(183); - - var latex = __webpack_require__(339); - var isNode = Node.isNode; - var isArray = Array.isArray; - - /** - * @constructor FunctionNode - * @extends {Node} - * invoke a list with arguments on a node - * @param {string} name - * @param {Node[]} args - */ - function FunctionNode (name, args) { - if (!(this instanceof FunctionNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input - if (typeof name !== 'string') throw new TypeError('string expected for parameter "name"'); - if (!isArray(args) || !args.every(isNode)) { - throw new TypeError('Array containing Nodes expected for parameter "args"'); - } - - this.name = name; - this.args = args || []; - } - - FunctionNode.prototype = new Node(); - - FunctionNode.prototype.type = 'FunctionNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - FunctionNode.prototype._compile = function (defs) { - var fn = defs.math[this.name]; - var isRaw = (typeof fn === 'function') && (fn.rawArgs == true); - - // compile the parameters - var args = this.args.map(function (arg) { - return arg._compile(defs); - }); - - if (isRaw) { - // pass unevaluated parameters (nodes) to the function - var paramsName; - do { - paramsName = 'p' + Math.round(Math.random() * 10000); - } - while (paramsName in defs); - defs[paramsName] = this.args; - - return '("' + this.name + '" in scope ? ' + - 'scope["' + this.name + '"](' + args.join(', ') + ') : ' + - 'math["' + this.name + '"]' + '(' + paramsName + ', math, scope))'; - } - else { - // "regular" evaluation - var symbol = new SymbolNode(this.name); - return symbol._compile(defs) + '(' + args.join(', ') + ')'; - } - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - FunctionNode.prototype.forEach = function (callback) { - for (var i = 0; i < this.args.length; i++) { - callback(this.args[i], 'args[' + i + ']', this); - } - }; - - /** - * Create a new FunctionNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {FunctionNode} Returns a transformed copy of the node - */ - FunctionNode.prototype.map = function (callback) { - var args = []; - for (var i = 0; i < this.args.length; i++) { - args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this)); - } - return new FunctionNode(this.name, args); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {FunctionNode} - */ - FunctionNode.prototype.clone = function() { - return new FunctionNode(this.name, this.args.slice(0)); - }; - - /** - * Get string representation - * @return {String} str - */ - FunctionNode.prototype.toString = function() { - // format the parameters like "add(2, 4.2)" - return this.name + '(' + this.args.join(', ') + ')'; - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - FunctionNode.prototype.toTex = function() { - return latex.toArgs(this); - }; - - module.exports = FunctionNode; + 'use strict'; + + var Node = __webpack_require__(190), + ArrayNode = __webpack_require__(178), + + keywords = __webpack_require__(352), + operators = __webpack_require__(353), + + latex = __webpack_require__(354), + isString = __webpack_require__(176).isString; + + /** + * @constructor AssignmentNode + * @extends {Node} + * Define a symbol, like "a = 3.2" + * + * @param {String} name Symbol name + * @param {Node} expr The expression defining the symbol + */ + function AssignmentNode(name, expr) { + if (!(this instanceof AssignmentNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input + if (!isString(name)) throw new TypeError('String expected for parameter "name"'); + if (!(expr instanceof Node)) throw new TypeError('Node expected for parameter "expr"'); + if (name in keywords) throw new Error('Illegal symbol name, "' + name + '" is a reserved keyword'); + + this.name = name; + this.expr = expr; + } + + AssignmentNode.prototype = new Node(); + + AssignmentNode.prototype.type = 'AssignmentNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @private + */ + AssignmentNode.prototype._compile = function (defs) { + return 'scope["' + this.name + '"] = ' + this.expr._compile(defs) + ''; + }; + + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + AssignmentNode.prototype.forEach = function (callback) { + callback(this.expr, 'expr', this); + }; + + /** + * Create a new AssignmentNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {AssignmentNode} Returns a transformed copy of the node + */ + AssignmentNode.prototype.map = function (callback) { + return new AssignmentNode(this.name, this._ifNode(callback(this.expr, 'expr', this))); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {AssignmentNode} + */ + AssignmentNode.prototype.clone = function() { + return new AssignmentNode(this.name, this.expr); + }; + + /** + * Get string representation + * @return {String} + */ + AssignmentNode.prototype.toString = function() { + var precedence = operators.getPrecedence(this); + var exprPrecedence = operators.getPrecedence(this.expr); + var expr = this.expr.toString(); + if ((exprPrecedence !== null) && (exprPrecedence <= precedence)) { + expr = '(' + expr + ')'; + } + return this.name + ' = ' + expr; + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} + */ + AssignmentNode.prototype._toTex = function(callbacks) { + var precedence = operators.getPrecedence(this); + var exprPrecedence = operators.getPrecedence(this.expr); + + var expr = this.expr.toTex(callbacks); + if ((exprPrecedence !== null) && (exprPrecedence <= precedence)) { + expr = '\\left(' + expr + '\\right)'; + } + + return latex.toSymbol(this.name) + ':=' + expr; + }; + + module.exports = AssignmentNode; /***/ }, /* 180 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var keywords = __webpack_require__(338); - - /** - * Node - */ - function Node() { - if (!(this instanceof Node)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - } - - /** - * Evaluate the node - * @return {*} result - */ - // TODO: cleanup deprecated code one day. Deprecated since version 0.19.0 - Node.prototype.eval = function () { - throw new Error('Node.eval is deprecated. ' + - 'Use Node.compile(math).eval([scope]) instead.'); - }; - - Node.prototype.type = 'Node'; - - /** - * Compile the node to javascript code - * @param {Object} math math.js instance - * @return {{eval: function}} expr Returns an object with a function 'eval', - * which can be invoked as expr.eval([scope]), - * where scope is an optional object with - * variables. - */ - Node.prototype.compile = function (math) { - if (!(math instanceof Object)) { - throw new TypeError('Object expected for parameter math'); - } - - // definitions globally available inside the closure of the compiled expressions - var defs = { - math: _transform(math), - _validateScope: _validateScope - }; - - var code = this._compile(defs); - - var defsCode = Object.keys(defs).map(function (name) { - return ' var ' + name + ' = defs["' + name + '"];'; - }); - - var factoryCode = - defsCode.join(' ') + - 'return {' + - ' "eval": function (scope) {' + - ' if (scope) _validateScope(scope);' + - ' scope = scope || {};' + - ' return ' + code + ';' + - ' }' + - '};'; - - var factory = new Function ('defs', factoryCode); - return factory(defs); - }; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * and constants globally available inside the closure - * of the compiled expression - * @return {String} js - * @private - */ - Node.prototype._compile = function (defs) { - // must be implemented by each of the Node implementations - throw new Error('Cannot compile a Node interface'); - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - Node.prototype.forEach = function (callback) { - // must be implemented by each of the Node implementations - throw new Error('Cannot run forEach on a Node interface'); - }; - - /** - * Create a new Node having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {OperatorNode} Returns a transformed copy of the node - */ - Node.prototype.map = function (callback) { - // must be implemented by each of the Node implementations - throw new Error('Cannot run map on a Node interface'); - }; - - /** - * Validate whether an object is a Node, for use with map - * @param {Node} node - * @returns {Node} Returns the input if it's a node, else throws an Error - * @protected - */ - Node.prototype._ifNode = function (node) { - if (!(node instanceof Node)) { - throw new TypeError('Callback function must return a Node'); - } - - return node; - }; - - /** - * Recursively traverse all nodes in a node tree. Executes given callback for - * this node and each of its child nodes. - * @param {function(node: Node, path: string, parent: Node)} callback - * A callback called for every node in the node tree. - */ - Node.prototype.traverse = function (callback) { - // execute callback for itself - callback(this, null, null); - - // recursively traverse over all childs of a node - function _traverse (node, callback) { - node.forEach(function(child, path, parent) { - callback(child, path, parent); - _traverse(child, callback); - }); - } - _traverse(this, callback); - }; - - /** - * Recursively transform a node tree via a transform function. - * - * For example, to replace all nodes of type SymbolNode having name 'x' with a - * ConstantNode with value 2: - * - * var res = Node.transform(function (node, path, parent) { - * if (node instanceof SymbolNode) && (node.name == 'x')) { - * return new ConstantNode(2); - * } - * else { - * return node; - * } - * }); - * - * @param {function(node: Node, path: string, parent: Node) : Node} callback - * A mapping function accepting a node, and returning - * a replacement for the node or the original node. - * Signature: callback(node: Node, index: string, parent: Node) : Node - * @return {Node} Returns the original node or its replacement - */ - Node.prototype.transform = function (callback) { - // check itself - var replacement = callback(this, null, null); - if (replacement !== this) { - return replacement; - } - - // traverse over all childs - function _transform (node, callback) { - return node.map(function(child, path, parent) { - var replacement = callback(child, path, parent); - return (replacement !== child) ? replacement : _transform(child, callback); - }); - } - return _transform(this, callback); - }; - - /** - * Find any node in the node tree matching given filter function. For example, to - * find all nodes of type SymbolNode having name 'x': - * - * var results = Node.filter(function (node) { - * return (node instanceof SymbolNode) && (node.name == 'x'); - * }); - * - * @param {function(node: Node, path: string, parent: Node) : Node} callback - * A test function returning true when a node matches, and false - * otherwise. Function signature: - * callback(node: Node, index: string, parent: Node) : boolean - * @return {Node[]} nodes An array with nodes matching given filter criteria - */ - Node.prototype.filter = function (callback) { - var nodes = []; - - this.traverse(function (node, path, parent) { - if (callback(node, path, parent)) { - nodes.push(node); - } - }); - - return nodes; - }; - - // TODO: deprecated since version 1.1.0, remove this some day - Node.prototype.find = function () { - throw new Error('Function Node.find is deprecated. Use Node.filter instead.'); - }; - - // TODO: deprecated since version 1.1.0, remove this some day - Node.prototype.match = function () { - throw new Error('Function Node.match is deprecated. See functions Node.filter, Node.transform, Node.traverse.'); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {Node} - */ - Node.prototype.clone = function() { - // must be implemented by each of the Node implementations - throw new Error('Cannot clone a Node interface'); - }; - - /** - * Get string representation - * @return {String} - */ - Node.prototype.toString = function() { - return ''; - }; - - /** - * Get LaTeX representation - * @return {String} - */ - Node.prototype.toTex = function() { - return ''; - }; - - /** - * Test whether an object is a Node - * @param {*} object - * @returns {boolean} isNode - */ - Node.isNode = function(object) { - return object instanceof Node; - }; - - /** - * Validate the symbol names of a scope. - * Throws an error when the scope contains an illegal symbol. - * @param {Object} scope - */ - function _validateScope (scope) { - for (var symbol in scope) { - if (scope.hasOwnProperty(symbol)) { - if (symbol in keywords) { - throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword'); - } - } - } - } - - /** - * Replace all functions having a transform function attached at property transform - * with their transform. - * @param {Object} math - * @return {Object} transformed - * @private - */ - function _transform(math) { - var transformed = Object.create(math); - - if (math.expression && math.expression.transform) { - for (var name in math.expression.transform) { - if (math.expression.transform.hasOwnProperty(name)) { - transformed[name] = math.expression.transform[name]; - } - } - } - - return transformed; - } - - module.exports = Node; + 'use strict'; + + var Node = __webpack_require__(190); + var ResultSet = __webpack_require__(9); + var isBoolean = __webpack_require__(209).isBoolean; + + /** + * @constructor BlockNode + * @extends {Node} + * Holds a set with blocks + * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks + * An array with blocks, where a block is constructed as an Object + * with properties block, which is a Node, and visible, which is + * a boolean. The property visible is optional and is true by default + */ + function BlockNode(blocks) { + if (!(this instanceof BlockNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input, copy blocks + if (!Array.isArray(blocks)) throw new Error('Array expected'); + this.blocks = blocks.map(function (block) { + var node = block && block.node; + var visible = block && block.visible !== undefined ? block.visible : true; + + if (!(node instanceof Node)) throw new TypeError('Property "node" must be a Node'); + if (!isBoolean(visible)) throw new TypeError('Property "visible" must be a boolean'); + + return { + node: node, + visible: visible + } + }); + } + + BlockNode.prototype = new Node(); + + BlockNode.prototype.type = 'BlockNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + BlockNode.prototype._compile = function (defs) { + defs.ResultSet = ResultSet; + var blocks = this.blocks.map(function (param) { + var js = param.node._compile(defs); + if (param.visible) { + return 'results.push(' + js + ');'; + } + else { + return js + ';'; + } + }); + + return '(function () {' + + 'var results = [];' + + blocks.join('') + + 'return new ResultSet(results);' + + '})()'; + }; + + /** + * Execute a callback for each of the child blocks of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + BlockNode.prototype.forEach = function (callback) { + for (var i = 0; i < this.blocks.length; i++) { + callback(this.blocks[i].node, 'blocks[' + i + '].node', this); + } + }; + + /** + * Create a new BlockNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {BlockNode} Returns a transformed copy of the node + */ + BlockNode.prototype.map = function (callback) { + var blocks = []; + for (var i = 0; i < this.blocks.length; i++) { + var block = this.blocks[i]; + var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this)); + blocks[i] = { + node: node, + visible: block.visible + }; + } + return new BlockNode(blocks); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {BlockNode} + */ + BlockNode.prototype.clone = function() { + var blocks = this.blocks.map(function(block) { + return { + node: block.node, + visible: block.visible + }; + }); + + return new BlockNode(blocks); + }; + + /** + * Get string representation + * @return {String} str + * @override + */ + BlockNode.prototype.toString = function() { + return this.blocks.map(function (param) { + return param.node.toString() + (param.visible ? '' : ';'); + }).join('\n'); + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + BlockNode.prototype._toTex = function(callbacks) { + return this.blocks.map(function (param) { + return param.node.toTex(callbacks) + (param.visible ? '' : ';'); + }).join('\n'); + }; + + module.exports = BlockNode; /***/ }, /* 181 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180), - ConstantNode = __webpack_require__(176), - SymbolNode = __webpack_require__(183), - FunctionNode = __webpack_require__(179), - latex = __webpack_require__(339); - - /** - * @constructor OperatorNode - * @extends {Node} - * An operator with two arguments, like 2+3 - * - * @param {String} op Operator name, for example '+' - * @param {String} fn Function name, for example 'add' - * @param {Node[]} args Operator arguments - */ - function OperatorNode (op, fn, args) { - if (!(this instanceof OperatorNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // TODO: validate input - this.op = op; - this.fn = fn; - this.args = args || []; - } - - OperatorNode.prototype = new Node(); - - OperatorNode.prototype.type = 'OperatorNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - OperatorNode.prototype._compile = function (defs) { - if (!(this.fn in defs.math)) { - throw new Error('Function ' + this.fn + ' missing in provided namespace "math"'); - } - - var args = this.args.map(function (arg) { - return arg._compile(defs); - }); - return 'math.' + this.fn + '(' + args.join(', ') + ')'; - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - OperatorNode.prototype.forEach = function (callback) { - for (var i = 0; i < this.args.length; i++) { - callback(this.args[i], 'args[' + i + ']', this); - } - }; - - /** - * Create a new OperatorNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {OperatorNode} Returns a transformed copy of the node - */ - OperatorNode.prototype.map = function (callback) { - var args = []; - for (var i = 0; i < this.args.length; i++) { - args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this)); - } - return new OperatorNode(this.op, this.fn, args); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {OperatorNode} - */ - OperatorNode.prototype.clone = function() { - return new OperatorNode(this.op, this.fn, this.args.slice(0)); - }; - - /** - * Get string representation - * @return {String} str - */ - OperatorNode.prototype.toString = function() { - var args = this.args; - - switch (args.length) { - case 1: - if (this.op == '-') { - // special case: unary minus - return '-' + args[0].toString(); - } - else { - // for example '5!' - return args[0].toString() + this.op; - } - - case 2: // for example '2+3' - var lhs = args[0].toString(); - if (args[0] instanceof OperatorNode) { - lhs = '(' + lhs + ')'; - } - var rhs = args[1].toString(); - if (args[1] instanceof OperatorNode) { - rhs = '(' + rhs + ')'; - } - return lhs + ' ' + this.op + ' ' + rhs; - - default: // this should not occur. format as a function call - return this.op + '(' + this.args.join(', ') + ')'; - } - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - OperatorNode.prototype.toTex = function() { - var args = this.args, - mop = latex.toOperator(this.op), - lp = args[0], - rp = args[1]; - - switch (args.length) { - case 1: - var operand = lp.toTex(); - switch (this.op) { - case '-': //unary minus needs brackets around '-' and '+' - if (lp instanceof OperatorNode && (lp.op === '-' || lp.op === '+')) { - return this.op + latex.addBraces(operand, true); - } - case '+': - return this.op + operand; - break; - default: // fox example '5!' - if (lp instanceof OperatorNode) { - return latex.addBraces(operand, true) + this.op; - } - return operand + this.op; - } - - case 2: // for example '2+3' - var lhs = lp.toTex(), - lhb = false, - rhs = rp.toTex(), - rhb = false, - lop = '', - rop = ''; - - switch (this.op) { - case '/': - lop = mop; - mop = ''; - - break; - - case '*': - if (lp instanceof OperatorNode) { - if (lp.op === '+' || lp.op === '-') { - lhb = true; - } - } - - if (rp instanceof OperatorNode) { - if (rp.op === '+' || rp.op === '-' || rp.op === '*') { - rhb = true; - } - } - - if ((lp instanceof ConstantNode || lp instanceof OperatorNode) && - (rp instanceof ConstantNode || rp instanceof OperatorNode)) { - mop = ' \\cdot '; - } - else { - mop = ' \\, '; - } - - break; - - case '-': - if (rp instanceof OperatorNode) { - if (rp.op === '+' | rp.op === '-' ) { - rhb = true; - } - } - break; - - case '^': - if (lp instanceof OperatorNode || lp instanceof FunctionNode) { - lhb = true; - } - else if (lp instanceof SymbolNode) { - lhb = null; - } - - break; - - case 'to': - rhs = latex.toUnit(rhs, true); - break; - } - - lhs = latex.addBraces(lhs, lhb); - rhs = latex.addBraces(rhs, rhb); - - return lop + lhs + mop + rhs + rop; - - default: // this should not occur. format as a function call - return mop + '(' + this.args.map(latex.toSymbol).join(', ') + ')'; - } - }; - - module.exports = OperatorNode; + 'use strict'; + + var Node = __webpack_require__(190); + var latex = __webpack_require__(354); + var BigNumber = __webpack_require__(350); + var Complex = __webpack_require__(3); + var Unit = __webpack_require__(7); + var util = __webpack_require__(171); + var operators = __webpack_require__(353); + var isString = util.string.isString; + var isNumber = util.number.isNumber; + var isBoolean = util['boolean'].isBoolean; + + /** + * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr' + * + * @param {Node} condition Condition, must result in a boolean + * @param {Node} trueExpr Expression evaluated when condition is true + * @param {Node} falseExpr Expression evaluated when condition is true + * + * @constructor ConditionalNode + * @extends {Node} + */ + function ConditionalNode (condition, trueExpr, falseExpr) { + if (!(this instanceof ConditionalNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + if (!(condition instanceof Node)) throw new TypeError('Parameter condition must be a Node'); + if (!(trueExpr instanceof Node)) throw new TypeError('Parameter trueExpr must be a Node'); + if (!(falseExpr instanceof Node)) throw new TypeError('Parameter falseExpr must be a Node'); + + this.condition = condition; + this.trueExpr = trueExpr; + this.falseExpr = falseExpr; + } + + ConditionalNode.prototype = new Node(); + + ConditionalNode.prototype.type = 'ConditionalNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + ConditionalNode.prototype._compile = function(defs) { + /** + * Test whether a condition is met + * @param {*} condition + * @returns {boolean} true if condition is true or non-zero, else false + */ + defs.testCondition = function (condition) { + if (isNumber(condition) || isBoolean(condition) || isString(condition)) { + return condition ? true : false; + } + + if (condition instanceof BigNumber) { + return condition.isZero() ? false : true; + } + + if (condition instanceof Complex) { + return (condition.re || condition.im) ? true : false; + } + + if (condition instanceof Unit) { + return condition.value ? true : false; + } + + if (condition === null || condition === undefined) { + return false; + } + + throw new TypeError('Unsupported type of condition "' + defs.math['typeof'](condition) + '"'); + }; + + return ( + 'testCondition(' + this.condition._compile(defs) + ') ? ' + + '( ' + this.trueExpr._compile(defs) + ') : ' + + '( ' + this.falseExpr._compile(defs) + ')' + ); + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + ConditionalNode.prototype.forEach = function (callback) { + callback(this.condition, 'condition', this); + callback(this.trueExpr, 'trueExpr', this); + callback(this.falseExpr, 'falseExpr', this); + }; + + /** + * Create a new ConditionalNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {ConditionalNode} Returns a transformed copy of the node + */ + ConditionalNode.prototype.map = function (callback) { + return new ConditionalNode( + this._ifNode(callback(this.condition, 'condition', this)), + this._ifNode(callback(this.trueExpr, 'trueExpr', this)), + this._ifNode(callback(this.falseExpr, 'falseExpr', this)) + ); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {ConditionalNode} + */ + ConditionalNode.prototype.clone = function() { + return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr); + }; + + /** + * Get string representation + * @return {String} str + */ + ConditionalNode.prototype.toString = function() { + var precedence = operators.getPrecedence(this); + + //Enclose Arguments in parentheses if they are an OperatorNode + //or have lower or equal precedence + //NOTE: enclosing all OperatorNodes in parentheses is a decision + //purely based on aesthetics and readability + var condition = this.condition.toString(); + var conditionPrecedence = operators.getPrecedence(this.condition); + if ((this.condition.type === 'OperatorNode') + || ((conditionPrecedence !== null) && (conditionPrecedence <= precedence))) { + condition = '(' + condition + ')'; + } + + var trueExpr = this.trueExpr.toString(); + var truePrecedence = operators.getPrecedence(this.trueExpr); + if ((this.trueExpr.type === 'OperatorNode') + || ((truePrecedence !== null) && (truePrecedence <= precedence))) { + trueExpr = '(' + trueExpr + ')'; + } + + var falseExpr = this.falseExpr.toString(); + var falsePrecedence = operators.getPrecedence(this.falseExpr); + if ((this.falseExpr.type === 'OperatorNode') + || ((falsePrecedence !== null) && (falsePrecedence <= precedence))) { + falseExpr = '(' + falseExpr + ')'; + } + return condition + ' ? ' + trueExpr + ' : ' + falseExpr; + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + ConditionalNode.prototype._toTex = function(callbacks) { + return '\\left\\{\\begin{array}{l l}{' + + this.trueExpr.toTex(callbacks) + '}, &\\quad{\\text{if}\\;' + + this.condition.toTex(callbacks) + + '}\\\\{' + this.falseExpr.toTex(callbacks) + + '}, &\\quad{\\text{otherwise}}\\end{array}\\right.'; + }; + + module.exports = ConditionalNode; /***/ }, /* 182 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180); - - var isNode = Node.isNode; - - /** - * @constructor RangeNode - * @extends {Node} - * create a range - * @param {Node} start included lower-bound - * @param {Node} end included lower-bound - * @param {Node} [step] optional step - */ - function RangeNode (start, end, step) { - if (!(this instanceof RangeNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate inputs - if (!isNode(start)) throw new TypeError('Node expected'); - if (!isNode(end)) throw new TypeError('Node expected'); - if (step && !isNode(step)) throw new TypeError('Node expected'); - if (arguments.length > 3) throw new Error('Too many arguments'); - - this.start = start; // included lower-bound - this.end = end; // included upper-bound - this.step = step || null; // optional step - } - - RangeNode.prototype = new Node(); - - RangeNode.prototype.type = 'RangeNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - RangeNode.prototype._compile = function (defs) { - return 'math.range(' + - this.start._compile(defs) + ', ' + - this.end._compile(defs) + - (this.step ? (', ' + this.step._compile(defs)) : '') + - ')'; - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - RangeNode.prototype.forEach = function (callback) { - callback(this.start, 'start', this); - callback(this.end, 'end', this); - if (this.step) { - callback(this.step, 'step', this); - } - }; - - /** - * Create a new RangeNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {RangeNode} Returns a transformed copy of the node - */ - RangeNode.prototype.map = function (callback) { - return new RangeNode( - this._ifNode(callback(this.start, 'start', this)), - this._ifNode(callback(this.end, 'end', this)), - this.step && this._ifNode(callback(this.step, 'step', this)) - ); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {RangeNode} - */ - RangeNode.prototype.clone = function() { - return new RangeNode(this.start, this.end, this.step && this.step); - }; - - /** - * Get string representation - * @return {String} str - */ - RangeNode.prototype.toString = function() { - // format the range like "start:step:end" - var str = this.start.toString(); - if (this.step) { - str += ':' + this.step.toString(); - } - str += ':' + this.end.toString(); - - return str; - }; - - /** - * Get LaTeX representation - * @return {String} str - */ - RangeNode.prototype.toTex = function() { - var str = this.start.toTex(); - if (this.step) { - str += ':' + this.step.toTex(); - } - str += ':' + this.end.toTex(); - - return str; - }; - - module.exports = RangeNode; + 'use strict'; + + var Node = __webpack_require__(190); + var BigNumber = __webpack_require__(350); + var type = __webpack_require__(216).type; + var isString = __webpack_require__(176).isString; + + /** + * A ConstantNode holds a constant value like a number or string. A ConstantNode + * stores a stringified version of the value and uses this to compile to + * JavaScript. + * + * In case of a stringified number as input, this may be compiled to a BigNumber + * when the math instance is configured for BigNumbers. + * + * Usage: + * + * // stringified values with type + * new ConstantNode('2.3', 'number'); + * new ConstantNode('true', 'boolean'); + * new ConstantNode('hello', 'string'); + * + * // non-stringified values, type will be automatically detected + * new ConstantNode(2.3); + * new ConstantNode('hello'); + * + * @param {String | Number | Boolean | null | undefined} value + * When valueType is provided, value must contain + * an uninterpreted string representing the value. + * When valueType is undefined, value can be a + * number, string, boolean, null, or undefined, and + * the type will be determined automatically. + * @param {String} [valueType] The type of value. Choose from 'number', 'string', + * 'boolean', 'undefined', 'null' + * @constructor ConstantNode + * @extends {Node} + */ + function ConstantNode(value, valueType) { + if (!(this instanceof ConstantNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + if (valueType) { + if (!isString(valueType)) { + throw new TypeError('String expected for parameter "valueType"'); + } + if (!isString(value)){ + throw new TypeError('String expected for parameter "value"'); + } + + this.value = value; + this.valueType = valueType; + } + else { + // stringify the value and determine the type + this.value = value + ''; + this.valueType = type(value); + } + + if (!SUPPORTED_TYPES[this.valueType]) { + throw new TypeError('Unsupported type of value "' + this.valueType + '"'); + } + } + + var SUPPORTED_TYPES = { + 'number': true, + 'string': true, + 'boolean': true, + 'undefined': true, + 'null': true + }; + + ConstantNode.prototype = new Node(); + + ConstantNode.prototype.type = 'ConstantNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + ConstantNode.prototype._compile = function (defs) { + switch (this.valueType) { + case 'number': + if (defs.math.config().number === 'bignumber') { + return 'math.bignumber("' + this.value + '")'; + } + else { + // remove leading zeros like '003.2' which are not allowed by JavaScript + return this.value.replace(/^(0*)[0-9]/, function (match, zeros) { + return match.substring(zeros.length); + }); + } + + case 'string': + return '"' + this.value + '"'; + + case 'boolean': + return this.value; + + case 'undefined': + return this.value; + + case 'null': + return this.value; + + default: + // TODO: move this error to the constructor? + throw new TypeError('Unsupported type of constant "' + this.valueType + '"'); + } + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + ConstantNode.prototype.forEach = function (callback) { + // nothing to do, we don't have childs + }; + + + /** + * Create a new ConstantNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node) : Node} callback + * @returns {ConstantNode} Returns a clone of the node + */ + ConstantNode.prototype.map = function (callback) { + return this.clone(); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {ConstantNode} + */ + ConstantNode.prototype.clone = function() { + return new ConstantNode(this.value, this.valueType); + }; + + /** + * Get string representation + * @return {String} str + */ + ConstantNode.prototype.toString = function() { + switch (this.valueType) { + case 'string': + return '"' + this.value + '"'; + + default: + return this.value; + } + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + ConstantNode.prototype._toTex = function(callbacks) { + var value = this.value, + index; + switch (this.valueType) { + case 'string': + return '\\text{' + value + '}'; + + case 'number': + index = value.toLowerCase().indexOf('e'); + if (index !== -1) { + return value.substring(0, index) + '\\cdot10^{' + + value.substring(index + 1) + '}'; + } + return value; + + default: + return value; + } + }; + + module.exports = ConstantNode; /***/ }, /* 183 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180), - Unit = __webpack_require__(8), - - latex = __webpack_require__(339), - isString = __webpack_require__(205).isString; - - /** - * @constructor SymbolNode - * @extends {Node} - * A symbol node can hold and resolve a symbol - * @param {String} name - * @extends {Node} - */ - function SymbolNode(name) { - if (!(this instanceof SymbolNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - // validate input - if (!isString(name)) throw new TypeError('String expected for parameter "name"'); - - this.name = name; - } - - SymbolNode.prototype = new Node(); - - SymbolNode.prototype.type = 'SymbolNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - SymbolNode.prototype._compile = function (defs) { - // add a function to the definitions - defs['undef'] = undef; - defs['Unit'] = Unit; - - if (this.name in defs.math) { - return '("' + this.name + '" in scope ? scope["' + this.name + '"] : math["' + this.name + '"])'; - } - else { - return '(' + - '"' + this.name + '" in scope ? scope["' + this.name + '"] : ' + - (Unit.isValuelessUnit(this.name) ? - 'new Unit(null, "' + this.name + '")' : - 'undef("' + this.name + '")') + - ')'; - } - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - SymbolNode.prototype.forEach = function (callback) { - // nothing to do, we don't have childs - }; - - /** - * Create a new SymbolNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node) : Node} callback - * @returns {SymbolNode} Returns a clone of the node - */ - SymbolNode.prototype.map = function (callback) { - return this.clone(); - }; - - /** - * Throws an error 'Undefined symbol {name}' - * @param {String} name - */ - function undef (name) { - throw new Error('Undefined symbol ' + name); - } - - /** - * Create a clone of this node, a shallow copy - * @return {SymbolNode} - */ - SymbolNode.prototype.clone = function() { - return new SymbolNode(this.name); - }; - - /** - * Get string representation - * @return {String} str - * @override - */ - SymbolNode.prototype.toString = function() { - return this.name; - }; - - /** - * Get LaTeX representation - * @return {String} str - * @override - */ - SymbolNode.prototype.toTex = function() { - return latex.toSymbol(this.name); - }; - - module.exports = SymbolNode; + 'use strict'; + + var Node = __webpack_require__(190); + var keywords = __webpack_require__(352); + var latex = __webpack_require__(354); + var operators = __webpack_require__(353); + var isString = __webpack_require__(176).isString; + var isArray = Array.isArray; + + /** + * @constructor FunctionAssignmentNode + * @extends {Node} + * Function assignment + * + * @param {String} name Function name + * @param {String[]} params Function parameter names + * @param {Node} expr The function expression + */ + function FunctionAssignmentNode(name, params, expr) { + if (!(this instanceof FunctionAssignmentNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input + if (!isString(name)) throw new TypeError('String expected for parameter "name"'); + if (!isArray(params) || !params.every(isString)) throw new TypeError('Array containing strings expected for parameter "params"'); + if (!(expr instanceof Node)) throw new TypeError('Node expected for parameter "expr"'); + if (name in keywords) throw new Error('Illegal function name, "' + name + '" is a reserved keyword'); + + this.name = name; + this.params = params; + this.expr = expr; + } + + FunctionAssignmentNode.prototype = new Node(); + + FunctionAssignmentNode.prototype.type = 'FunctionAssignmentNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + FunctionAssignmentNode.prototype._compile = function (defs) { + // add the function arguments to defs (used by SymbolNode and UpdateNode) + this.params.forEach(function (variable) { + defs.args[variable] = true; + }); + + return 'scope["' + this.name + '"] = ' + + ' (function () {' + + ' var fn = function ' + this.name + '(' + this.params.join(',') + ') {' + + ' if (arguments.length != ' + this.params.length + ') {' + + // TODO: use util.error.ArgumentsError here? + // TODO: test arguments error + ' throw new SyntaxError("Wrong number of arguments in function ' + this.name + ' (" + arguments.length + " provided, ' + this.params.length + ' expected)");' + + ' }' + + ' return ' + this.expr._compile(defs) + '' + + ' };' + + ' fn.syntax = "' + this.name + '(' + this.params.join(', ') + ')";' + + ' return fn;' + + ' })();'; + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + FunctionAssignmentNode.prototype.forEach = function (callback) { + callback(this.expr, 'expr', this); + }; + + /** + * Create a new FunctionAssignmentNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {FunctionAssignmentNode} Returns a transformed copy of the node + */ + FunctionAssignmentNode.prototype.map = function (callback) { + var expr = this._ifNode(callback(this.expr, 'expr', this)); + + return new FunctionAssignmentNode(this.name, this.params.slice(0), expr); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {FunctionAssignmentNode} + */ + FunctionAssignmentNode.prototype.clone = function() { + return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr); + }; + + /** + * get string representation + * @return {String} str + */ + FunctionAssignmentNode.prototype.toString = function() { + var precedence = operators.getPrecedence(this); + var exprPrecedence = operators.getPrecedence(this.expr); + + var expr = this.expr.toString(); + if ((exprPrecedence !== null) && (exprPrecedence <= precedence)) { + expr = '(' + expr + ')'; + } + return 'function ' + this.name + + '(' + this.params.join(', ') + ') = ' + expr; + }; + + /** + * get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + FunctionAssignmentNode.prototype._toTex = function(callbacks) { + var precedence = operators.getPrecedence(this); + var exprPrecedence = operators.getPrecedence(this.expr); + + var expr = this.expr.toTex(callbacks); + if ((exprPrecedence !== null) && (exprPrecedence <= precedence)) { + expr = '\\left(' + expr + '\\right)'; + } + + return latex.toSymbol(this.name) + + '\\left(' + this.params.map(latex.toSymbol).join(',') + '\\right):=' + expr; + }; + + module.exports = FunctionAssignmentNode; /***/ }, /* 184 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var Node = __webpack_require__(180), - IndexNode = __webpack_require__(177); - - /** - * @constructor UpdateNode - * @extends {Node} - * Update a matrix subset, like A[2,3] = 4.5 - * - * @param {IndexNode} index IndexNode containing symbol and ranges - * @param {Node} expr The expression defining the symbol - */ - function UpdateNode(index, expr) { - if (!(this instanceof UpdateNode)) { - throw new SyntaxError('Constructor must be called with the new operator'); - } - - if (!(index instanceof IndexNode)) { - throw new TypeError('Expected IndexNode for parameter "index"'); - } - if (!(expr instanceof Node)) { - throw new TypeError('Expected Node for parameter "expr"'); - } - - this.index = index; - this.expr = expr; - } - - UpdateNode.prototype = new Node(); - - UpdateNode.prototype.type = 'UpdateNode'; - - /** - * Compile the node to javascript code - * @param {Object} defs Object which can be used to define functions - * or constants globally available for the compiled - * expression - * @return {String} js - * @private - */ - UpdateNode.prototype._compile = function (defs) { - return 'scope["' + this.index.objectName() + '\"] = ' + - this.index.compileSubset(defs, this.expr._compile(defs)); - }; - - /** - * Execute a callback for each of the child nodes of this node - * @param {function(child: Node, path: string, parent: Node)} callback - */ - UpdateNode.prototype.forEach = function (callback) { - callback(this.index, 'index', this); - callback(this.expr, 'expr', this); - }; - - /** - * Create a new UpdateNode having it's childs be the results of calling - * the provided callback function for each of the childs of the original node. - * @param {function(child: Node, path: string, parent: Node): Node} callback - * @returns {UpdateNode} Returns a transformed copy of the node - */ - UpdateNode.prototype.map = function (callback) { - return new UpdateNode( - this._ifNode(callback(this.index, 'index', this)), - this._ifNode(callback(this.expr, 'expr', this)) - ); - }; - - /** - * Create a clone of this node, a shallow copy - * @return {UpdateNode} - */ - UpdateNode.prototype.clone = function() { - return new UpdateNode(this.index, this.expr); - }; - - /** - * Get string representation - * @return {String} - */ - UpdateNode.prototype.toString = function() { - return this.index.toString() + ' = ' + this.expr.toString(); - }; - - /** - * Get LaTeX representation - * @return {String} - */ - UpdateNode.prototype.toTex = function() { - return this.index.toTex() + ' = ' + this.expr.toTex(); - }; - - module.exports = UpdateNode; + 'use strict'; + + var Node = __webpack_require__(190); + var RangeNode = __webpack_require__(187); + var SymbolNode = __webpack_require__(188); + + var BigNumber = __webpack_require__(350); + var Range = __webpack_require__(4); + + var isNode = Node.isNode; + var isArray = Array.isArray; + + /** + * @constructor IndexNode + * @extends Node + * + * get a subset of a matrix + * + * @param {Node} object + * @param {Node[]} ranges + */ + function IndexNode (object, ranges) { + if (!(this instanceof IndexNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input + if (!(object instanceof Node)) throw new TypeError('Node expected for parameter "object"'); + if (!isArray(ranges) || !ranges.every(isNode)) { + throw new TypeError('Array containing Nodes expected for parameter "ranges"'); + } + + this.object = object; + this.ranges = ranges; + } + + IndexNode.prototype = new Node(); + + IndexNode.prototype.type = 'IndexNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + IndexNode.prototype._compile = function (defs) { + return this.compileSubset(defs); + }; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the + * compiled expression + * @param {String} [replacement] If provided, the function returns + * "math.subset(obj, math.index(...), replacement)" + * Else, the function returns + * "math.subset(obj, math.index(...))" + * @return {String} js + * @returns {string} + */ + IndexNode.prototype.compileSubset = function(defs, replacement) { + // check whether any of the ranges expressions uses the context symbol 'end' + function test(node) { + return (node instanceof SymbolNode) && (node.name == 'end'); + } + + var someUseEnd = false; + var rangesUseEnd = this.ranges.map(function (range) { + var useEnd = range.filter(test).length > 0; + someUseEnd = useEnd ? useEnd : someUseEnd; + return useEnd; + }); + + // create a Range from start, step and end + defs.range = function (start, end, step) { + return new Range( + start instanceof BigNumber ? start.toNumber() : start, + end instanceof BigNumber ? end.toNumber() : end, + step instanceof BigNumber ? step.toNumber() : step + ); + }; + + // TODO: implement support for bignumber (currently bignumbers are silently + // reduced to numbers when changing the value to zero-based) + + // TODO: Optimization: when the range values are ConstantNodes, + // we can beforehand resolve the zero-based value + + var ranges = this.ranges.map(function(range, i) { + var useEnd = rangesUseEnd[i]; + if (range instanceof RangeNode) { + if (useEnd) { + defs.args.end = true; + + // resolve end and create range + return '(function () {' + + ' var end = size[' + i + '];' + + ' return range(' + + ' ' + range.start._compile(defs) + ', ' + + ' ' + range.end._compile(defs) + ', ' + + ' ' + (range.step ? range.step._compile(defs) : '1') + + ' );' + + '})()'; + } + else { + // create range + return 'range(' + + range.start._compile(defs) + ', ' + + range.end._compile(defs) + ', ' + + (range.step ? range.step._compile(defs) : '1') + + ')'; + } + } + else { + if (useEnd) { + defs.args.end = true; + + // resolve the parameter 'end' + return '(function () {' + + ' var end = size[' + i + '];' + + ' return ' + range._compile(defs) + ';' + + '})()' + } + else { + // just evaluate the expression + return range._compile(defs); + } + } + }); + + // if some parameters use the 'end' parameter, we need to calculate the size + if (someUseEnd) { + return '(function () {' + + ' var obj = ' + this.object._compile(defs) + ';' + + ' var size = math.size(obj).valueOf();' + + ' return math.subset(' + + ' obj, ' + + ' math.index(' + ranges.join(', ') + ')' + + ' ' + (replacement ? (', ' + replacement) : '') + + ' );' + + '})()'; + } + else { + return 'math.subset(' + + this.object._compile(defs) + ',' + + 'math.index(' + ranges.join(', ') + ')' + + (replacement ? (', ' + replacement) : '') + + ')'; + } + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + IndexNode.prototype.forEach = function (callback) { + // object + callback(this.object, 'object', this); + + // ranges + for (var i = 0; i < this.ranges.length; i++) { + callback(this.ranges[i], 'ranges[' + i + ']', this); + } + }; + + /** + * Create a new IndexNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {IndexNode} Returns a transformed copy of the node + */ + IndexNode.prototype.map = function (callback) { + var object = this._ifNode(callback(this.object, 'object', this)); + + var ranges = []; + for (var i = 0; i < this.ranges.length; i++) { + ranges[i] = this._ifNode(callback(this.ranges[i], 'ranges[' + i + ']', this)); + } + + return new IndexNode(object, ranges); + }; + + /** + * Get the name of the object linked to this IndexNode + * @return {string} name + */ + IndexNode.prototype.objectName = function() { + return this.object.name; + }; + + /** + * Create a clone of this node, a shallow copy + * @return {IndexNode} + */ + IndexNode.prototype.clone = function() { + return new IndexNode(this.object, this.ranges.slice(0)); + }; + + /** + * Get string representation + * @return {String} str + */ + IndexNode.prototype.toString = function() { + // format the parameters like "[1, 0:5]" + return this.object.toString() + '[' + this.ranges.join(', ') + ']'; + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + IndexNode.prototype._toTex = function(callbacks) { + var ranges = this.ranges.map(function (range) { + return range.toTex(callbacks); + }); + return this.object.toTex(callbacks) + '_{\\left[' + ranges.join(',') + '\\right]}'; + }; + + module.exports = IndexNode; /***/ }, /* 185 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'e', - 'category': 'Constants', - 'syntax': [ - 'e' - ], - 'description': 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828', - 'examples': [ - 'e', - 'e ^ 2', - 'exp(2)', - 'log(e)' - ], - 'seealso': ['exp'] - }; + 'use strict'; + + var Node = __webpack_require__(190), + ConstantNode = __webpack_require__(182), + SymbolNode = __webpack_require__(188), + FunctionNode = __webpack_require__(186), + latex = __webpack_require__(354), + operators = __webpack_require__(353), + isArray = Array.isArray, + isNode = Node.isNode; + + /** + * @constructor OperatorNode + * @extends {Node} + * An operator with two arguments, like 2+3 + * + * @param {String} op Operator name, for example '+' + * @param {String} fn Function name, for example 'add' + * @param {Node[]} args Operator arguments + */ + function OperatorNode (op, fn, args) { + if (!(this instanceof OperatorNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + //validate input + if (typeof op !== 'string') { + throw new TypeError('string expected for parameter "op"'); + } + if (typeof fn !== 'string') { + throw new TypeError('string expected for parameter "fn"'); + } + if (!isArray(args) || !args.every(isNode)) { + throw new TypeError('Array containing Nodes expected for parameter "args"'); + } + + this.op = op; + this.fn = fn; + this.args = args || []; + } + + OperatorNode.prototype = new Node(); + + OperatorNode.prototype.type = 'OperatorNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + OperatorNode.prototype._compile = function (defs) { + if (!(this.fn in defs.math)) { + throw new Error('Function ' + this.fn + ' missing in provided namespace "math"'); + } + + var args = this.args.map(function (arg) { + return arg._compile(defs); + }); + return 'math.' + this.fn + '(' + args.join(', ') + ')'; + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + OperatorNode.prototype.forEach = function (callback) { + for (var i = 0; i < this.args.length; i++) { + callback(this.args[i], 'args[' + i + ']', this); + } + }; + + /** + * Create a new OperatorNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {OperatorNode} Returns a transformed copy of the node + */ + OperatorNode.prototype.map = function (callback) { + var args = []; + for (var i = 0; i < this.args.length; i++) { + args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this)); + } + return new OperatorNode(this.op, this.fn, args); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {OperatorNode} + */ + OperatorNode.prototype.clone = function() { + return new OperatorNode(this.op, this.fn, this.args.slice(0)); + }; + + /** + * Calculate which parentheses are necessary. Gets an OperatorNode + * (which is the root of the tree) and an Array of Nodes + * (this.args) and returns an array where 'true' means that an argument + * has to be enclosed in parentheses whereas 'false' means the opposite. + * + * @param {OperatorNode} root + * @param {Node[]} arguments + * @param {bool} + * @return {bool[]} + * @private + */ + function calculateNecessaryParentheses (root, args, latex) { + //precedence of the root OperatorNode + var precedence = operators.getPrecedence(root); + var associativity = operators.getAssociativity(root); + + switch (args.length) { + case 1: //unary operators + //precedence of the operand + var operandPrecedence = operators.getPrecedence(args[0]); + + //handle special cases for LaTeX, where some of the parentheses aren't needed + if (latex && (operandPrecedence !== null)) { + var operandIdentifier = args[0].getIdentifier(); + var rootIdentifier = root.getIdentifier(); + if (operators.properties[precedence][rootIdentifier].latexLeftParens === false) { + return [false]; + } + + if (operators.properties[operandPrecedence][operandIdentifier].latexParens === false) { + return [false]; + } + } + + if (operandPrecedence === null) { + //if the operand has no defined precedence, no parens are needed + return [false]; + } + + if (operandPrecedence <= precedence) { + //if the operands precedence is lower, parens are needed + return [true]; + } + + //otherwise, no parens needed + return [false]; + + case 2: //binary operators + var lhsParens; //left hand side needs parenthesis? + //precedence of the left hand side + var lhsPrecedence = operators.getPrecedence(args[0]); + //is the root node associative with the left hand side + var assocWithLhs = operators.isAssociativeWith(root, args[0]); + + if (lhsPrecedence === null) { + //if the left hand side has no defined precedence, no parens are needed + //FunctionNode for example + lhsParens = false; + } + else if ((lhsPrecedence === precedence) && (associativity === 'right') && !assocWithLhs) { + //In case of equal precedence, if the root node is left associative + // parens are **never** necessary for the left hand side. + //If it is right associative however, parens are necessary + //if the root node isn't associative with the left hand side + lhsParens = true; + } + else if (lhsPrecedence < precedence) { + lhsParens = true; + } + else { + lhsParens = false; + } + + var rhsParens; //right hand side needs parenthesis? + //precedence of the right hand side + var rhsPrecedence = operators.getPrecedence(args[1]); + //is the root node associative with the right hand side? + var assocWithRhs = operators.isAssociativeWith(root, args[1]); + + if (rhsPrecedence === null) { + //if the right hand side has no defined precedence, no parens are needed + //FunctionNode for example + rhsParens = false; + } + else if ((rhsPrecedence === precedence) && (associativity === 'left') && !assocWithRhs) { + //In case of equal precedence, if the root node is right associative + // parens are **never** necessary for the right hand side. + //If it is left associative however, parens are necessary + //if the root node isn't associative with the right hand side + rhsParens = true; + } + else if (rhsPrecedence < precedence) { + rhsParens = true; + } + else { + rhsParens = false; + } + + //handle special cases for LaTeX, where some of the parentheses aren't needed + if (latex) { + var rootIdentifier = root.getIdentifier(); + var lhsIdentifier = root.args[0].getIdentifier(); + var rhsIdentifier = root.args[1].getIdentifier(); + + if (lhsPrecedence !== null) { + if (operators.properties[precedence][rootIdentifier].latexLeftParens === false) { + lhsParens = false; + } + + if (operators.properties[lhsPrecedence][lhsIdentifier].latexParens === false) { + lhsParens = false; + } + } + + if (rhsPrecedence !== null) { + if (operators.properties[precedence][rootIdentifier].latexRightParens === false) { + rhsParens = false; + } + + if (operators.properties[rhsPrecedence][rhsIdentifier].latexParens === false) { + rhsParens = false; + } + } + } + + return [lhsParens, rhsParens]; + default: + //behavior is undefined, fall back to putting everything in parens + var parens = []; + args.forEach(function () { + parens.push(true); + }); + return parens; + } + } + + /** + * Get string representation. + * @return {String} str + */ + OperatorNode.prototype.toString = function() { + var args = this.args; + var parens = calculateNecessaryParentheses(this, args, false); + + switch (args.length) { + case 1: //unary operators + var assoc = operators.getAssociativity(this); + + var operand = args[0].toString(); + if (parens[0]) { + operand = '(' + operand + ')'; + } + + if (assoc === 'right') { //prefix operator + return this.op + operand; + } + else if (assoc === 'left') { //postfix + return operand + this.op; + } + + //fall back to postfix + return operand + this.op; + + case 2: + var lhs = args[0].toString(); //left hand side + var rhs = args[1].toString(); //right hand side + if (parens[0]) { //left hand side in parenthesis? + lhs = '(' + lhs + ')'; + } + if (parens[1]) { //right hand side in parenthesis? + rhs = '(' + rhs + ')'; + } + + return lhs + ' ' + this.op + ' ' + rhs; + + default: + //fallback to formatting as a function call + return this.fn + '(' + this.args.join(', ') + ')'; + } + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + OperatorNode.prototype._toTex = function(callbacks) { + var args = this.args; + var parens = calculateNecessaryParentheses(this, args, true); + var op = latex.operators[this.fn]; + op = typeof op === 'undefined' ? this.op : op; //fall back to using this.op + + switch (args.length) { + case 1: //unary operators + var assoc = operators.getAssociativity(this); + + var operand = args[0].toTex(callbacks); + if (parens[0]) { + operand = '\\left(' + operand + '\\right)'; + } + + if (assoc === 'right') { //prefix operator + return op + operand; + } + else if (assoc === 'left') { //postfix operator + return operand + op; + } + + //fall back to postfix + return operand + op; + + case 2: //binary operators + var lhs = args[0]; //left hand side + var lhsTex = lhs.toTex(callbacks); + if (parens[0]) { + lhsTex = '\\left(' + lhsTex + '\\right)'; + } + + var rhs = args[1]; //right hand side + var rhsTex = rhs.toTex(callbacks); + if (parens[1]) { + rhsTex = '\\left(' + rhsTex + '\\right)'; + } + + //handle some exceptions (due to the way LaTeX works) + switch (this.getIdentifier()) { + case 'OperatorNode:divide': + //op contains '\\frac' at this point + return op + '{' + lhsTex + '}' + '{' + rhsTex + '}'; + case 'OperatorNode:pow': + lhsTex = '{' + lhsTex + '}'; + rhsTex = '{' + rhsTex + '}'; + switch (lhs.getIdentifier()) { + case 'ConditionalNode': // + case 'OperatorNode:divide': + lhsTex = '\\left(' + lhsTex + '\\right)'; + } + } + return lhsTex + op + rhsTex; + + default: + //fall back to formatting as a function call + //as this is a fallback, it doesn't use + //fancy function names + return '\\mathrm{' + this.fn + '}\\left(' + + args.map(function (arg) { + return arg.toTex(callbacks); + }).join(',') + '\\right)'; + } + }; + + /** + * Get identifier. + * @return {String} + */ + OperatorNode.prototype.getIdentifier = function () { + return this.type + ':' + this.fn; + }; + + module.exports = OperatorNode; /***/ }, /* 186 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'false', - 'category': 'Constants', - 'syntax': [ - 'false' - ], - 'description': 'Boolean value false', - 'examples': [ - 'false' - ], - 'seealso': ['true'] - }; + 'use strict'; + + var Node = __webpack_require__(190); + var SymbolNode = __webpack_require__(188); + + var latex = __webpack_require__(354); + var isNode = Node.isNode; + var isArray = Array.isArray; + + /** + * @constructor FunctionNode + * @extends {Node} + * invoke a list with arguments on a node + * @param {string} name + * @param {Node[]} args + */ + function FunctionNode (name, args) { + if (!(this instanceof FunctionNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input + if (typeof name !== 'string') throw new TypeError('string expected for parameter "name"'); + if (!isArray(args) || !args.every(isNode)) { + throw new TypeError('Array containing Nodes expected for parameter "args"'); + } + + this.name = name; + this.args = args || []; + } + + FunctionNode.prototype = new Node(); + + FunctionNode.prototype.type = 'FunctionNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + FunctionNode.prototype._compile = function (defs) { + var fn = defs.math[this.name]; + var isRaw = (typeof fn === 'function') && (fn.rawArgs == true); + + // compile the parameters + var args = this.args.map(function (arg) { + return arg._compile(defs); + }); + + if (isRaw) { + // pass unevaluated parameters (nodes) to the function + var paramsName; + do { + paramsName = 'p' + Math.round(Math.random() * 10000); + } + while (paramsName in defs); + defs[paramsName] = this.args; + + return '("' + this.name + '" in scope ? ' + + 'scope["' + this.name + '"](' + args.join(', ') + ') : ' + + 'math["' + this.name + '"]' + '(' + paramsName + ', math, scope))'; + } + else { + // "regular" evaluation + var symbol = new SymbolNode(this.name); + return symbol._compile(defs) + '(' + args.join(', ') + ')'; + } + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + FunctionNode.prototype.forEach = function (callback) { + for (var i = 0; i < this.args.length; i++) { + callback(this.args[i], 'args[' + i + ']', this); + } + }; + + /** + * Create a new FunctionNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {FunctionNode} Returns a transformed copy of the node + */ + FunctionNode.prototype.map = function (callback) { + var args = []; + for (var i = 0; i < this.args.length; i++) { + args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this)); + } + return new FunctionNode(this.name, args); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {FunctionNode} + */ + FunctionNode.prototype.clone = function() { + return new FunctionNode(this.name, this.args.slice(0)); + }; + + /** + * Get string representation + * @return {String} str + */ + FunctionNode.prototype.toString = function() { + // format the parameters like "add(2, 4.2)" + return this.name + '(' + this.args.join(', ') + ')'; + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + */ + FunctionNode.prototype._toTex = function(callbacks) { + return latex.toFunction(this, callbacks, this.name); + }; + + /** + * Get identifier. + * @return {String} + */ + FunctionNode.prototype.getIdentifier = function () { + return this.type + ':' + this.name; + }; + + module.exports = FunctionNode; /***/ }, /* 187 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'i', - 'category': 'Constants', - 'syntax': [ - 'i' - ], - 'description': 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.', - 'examples': [ - 'i', - 'i * i', - 'sqrt(-1)' - ], - 'seealso': [] - }; + 'use strict'; + + var Node = __webpack_require__(190); + var operators = __webpack_require__(353); + + var isNode = Node.isNode; + + /** + * @constructor RangeNode + * @extends {Node} + * create a range + * @param {Node} start included lower-bound + * @param {Node} end included lower-bound + * @param {Node} [step] optional step + */ + function RangeNode (start, end, step) { + if (!(this instanceof RangeNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate inputs + if (!isNode(start)) throw new TypeError('Node expected'); + if (!isNode(end)) throw new TypeError('Node expected'); + if (step && !isNode(step)) throw new TypeError('Node expected'); + if (arguments.length > 3) throw new Error('Too many arguments'); + + this.start = start; // included lower-bound + this.end = end; // included upper-bound + this.step = step || null; // optional step + } + + RangeNode.prototype = new Node(); + + RangeNode.prototype.type = 'RangeNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + RangeNode.prototype._compile = function (defs) { + return 'math.range(' + + this.start._compile(defs) + ', ' + + this.end._compile(defs) + + (this.step ? (', ' + this.step._compile(defs)) : '') + + ')'; + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + RangeNode.prototype.forEach = function (callback) { + callback(this.start, 'start', this); + callback(this.end, 'end', this); + if (this.step) { + callback(this.step, 'step', this); + } + }; + + /** + * Create a new RangeNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {RangeNode} Returns a transformed copy of the node + */ + RangeNode.prototype.map = function (callback) { + return new RangeNode( + this._ifNode(callback(this.start, 'start', this)), + this._ifNode(callback(this.end, 'end', this)), + this.step && this._ifNode(callback(this.step, 'step', this)) + ); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {RangeNode} + */ + RangeNode.prototype.clone = function() { + return new RangeNode(this.start, this.end, this.step && this.step); + }; + + /** + * Get string representation + * @return {String} str + */ + RangeNode.prototype.toString = function() { + var precedence = operators.getPrecedence(this); + + //format string as start:step:stop + var str; + + var start = this.start.toString(); + var startPrecedence = operators.getPrecedence(this.start); + if ((startPrecedence !== null) && (startPrecedence <= precedence)) { + start = '(' + start + ')'; + } + str = start; + + if (this.step) { + var step = this.step.toString(); + var stepPrecedence = operators.getPrecedence(this.step); + if ((stepPrecedence !== null) && (stepPrecedence <= precedence)) { + step = '(' + step + ')'; + } + str += ':' + step; + } + + var end = this.end.toString(); + var endPrecedence = operators.getPrecedence(this.end); + if ((endPrecedence !== null) && (endPrecedence <= precedence)) { + end = '(' + end + ')'; + } + str += ':' + end; + + return str; + }; + + /** + * Get LaTeX representation + * @params {Object|function} callback(s) + * @return {String} str + */ + RangeNode.prototype._toTex = function(callbacks) { + var str = this.start.toTex(callbacks); + if (this.step) { + str += ':' + this.step.toTex(callbacks); + } + str += ':' + this.end.toTex(callbacks); + + return str; + }; + + module.exports = RangeNode; /***/ }, /* 188 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'Infinity', - 'category': 'Constants', - 'syntax': [ - 'Infinity' - ], - 'description': 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.', - 'examples': [ - 'Infinity', - '1 / 0' - ], - 'seealso': [] - }; + 'use strict'; + + var Node = __webpack_require__(190), + Unit = __webpack_require__(7), + + latex = __webpack_require__(354), + isString = __webpack_require__(176).isString; + + /** + * @constructor SymbolNode + * @extends {Node} + * A symbol node can hold and resolve a symbol + * @param {String} name + * @extends {Node} + */ + function SymbolNode(name) { + if (!(this instanceof SymbolNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + // validate input + if (!isString(name)) throw new TypeError('String expected for parameter "name"'); + + this.name = name; + } + + SymbolNode.prototype = new Node(); + + SymbolNode.prototype.type = 'SymbolNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + SymbolNode.prototype._compile = function (defs) { + // add a function to the definitions + defs['undef'] = undef; + defs['Unit'] = Unit; + + if (this.name in defs.args) { + // this is a FunctionAssignment argument + // (like an x when inside the expression of a function assignment `f(x) = ...`) + return this.name; + } + else if (this.name in defs.math) { + return '("' + this.name + '" in scope ? scope["' + this.name + '"] : math["' + this.name + '"])'; + } + else { + return '(' + + '"' + this.name + '" in scope ? scope["' + this.name + '"] : ' + + (Unit.isValuelessUnit(this.name) ? + 'new Unit(null, "' + this.name + '")' : + 'undef("' + this.name + '")') + + ')'; + } + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + SymbolNode.prototype.forEach = function (callback) { + // nothing to do, we don't have childs + }; + + /** + * Create a new SymbolNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node) : Node} callback + * @returns {SymbolNode} Returns a clone of the node + */ + SymbolNode.prototype.map = function (callback) { + return this.clone(); + }; + + /** + * Throws an error 'Undefined symbol {name}' + * @param {String} name + */ + function undef (name) { + throw new Error('Undefined symbol ' + name); + } + + /** + * Create a clone of this node, a shallow copy + * @return {SymbolNode} + */ + SymbolNode.prototype.clone = function() { + return new SymbolNode(this.name); + }; + + /** + * Get string representation + * @return {String} str + * @override + */ + SymbolNode.prototype.toString = function() { + return this.name; + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} str + * @override + */ + SymbolNode.prototype._toTex = function(callbacks) { + var symbol = latex.toSymbol(this.name); + if (symbol[0] === '\\') { + //no space needed if the symbol starts with '\' + return symbol; + } + //the space prevents symbols from breaking stuff like '\cdot' if it's written right before the symbol + return ' ' + symbol; + }; + + module.exports = SymbolNode; /***/ }, /* 189 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'LN2', - 'category': 'Constants', - 'syntax': [ - 'LN2' - ], - 'description': 'Returns the natural logarithm of 2, approximately equal to 0.693', - 'examples': [ - 'LN2', - 'log(2)' - ], - 'seealso': [] - }; + 'use strict'; + + var Node = __webpack_require__(190), + IndexNode = __webpack_require__(184); + + /** + * @constructor UpdateNode + * @extends {Node} + * Update a matrix subset, like A[2,3] = 4.5 + * + * @param {IndexNode} index IndexNode containing symbol and ranges + * @param {Node} expr The expression defining the symbol + */ + function UpdateNode(index, expr) { + if (!(this instanceof UpdateNode)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + if (!(index instanceof IndexNode)) { + throw new TypeError('Expected IndexNode for parameter "index"'); + } + if (!(expr instanceof Node)) { + throw new TypeError('Expected Node for parameter "expr"'); + } + + this.index = index; + this.expr = expr; + } + + UpdateNode.prototype = new Node(); + + UpdateNode.prototype.type = 'UpdateNode'; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * or constants globally available for the compiled + * expression + * @return {String} js + * @private + */ + UpdateNode.prototype._compile = function (defs) { + var lhs = (this.index.objectName() in defs.args) + ? this.name + ' = ' // this is a FunctionAssignment argument + : 'scope["' + this.index.objectName() + '\"]'; + + var rhs = this.index.compileSubset(defs, this.expr._compile(defs)); + + return lhs + ' = ' + rhs; + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + UpdateNode.prototype.forEach = function (callback) { + callback(this.index, 'index', this); + callback(this.expr, 'expr', this); + }; + + /** + * Create a new UpdateNode having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {UpdateNode} Returns a transformed copy of the node + */ + UpdateNode.prototype.map = function (callback) { + return new UpdateNode( + this._ifNode(callback(this.index, 'index', this)), + this._ifNode(callback(this.expr, 'expr', this)) + ); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {UpdateNode} + */ + UpdateNode.prototype.clone = function() { + return new UpdateNode(this.index, this.expr); + }; + + /** + * Get string representation + * @return {String} + */ + UpdateNode.prototype.toString = function() { + return this.index.toString() + ' = ' + this.expr.toString(); + }; + + /** + * Get LaTeX representation + * @param {Object|function} callback(s) + * @return {String} + */ + UpdateNode.prototype._toTex = function(callbacks) { + return this.index.toTex(callbacks) + ':=' + this.expr.toTex(callbacks); + }; + + module.exports = UpdateNode; /***/ }, /* 190 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'LN10', - 'category': 'Constants', - 'syntax': [ - 'LN10' - ], - 'description': 'Returns the natural logarithm of 10, approximately equal to 2.302', - 'examples': [ - 'LN10', - 'log(10)' - ], - 'seealso': [] - }; + 'use strict'; + + var keywords = __webpack_require__(352); + + /** + * Node + */ + function Node() { + if (!(this instanceof Node)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + } + + /** + * Evaluate the node + * @return {*} result + */ + // TODO: cleanup deprecated code one day. Deprecated since version 0.19.0 + Node.prototype.eval = function () { + throw new Error('Node.eval is deprecated. ' + + 'Use Node.compile(math).eval([scope]) instead.'); + }; + + Node.prototype.type = 'Node'; + + /** + * Compile the node to javascript code + * @param {Object} math math.js instance + * @return {{eval: function}} expr Returns an object with a function 'eval', + * which can be invoked as expr.eval([scope]), + * where scope is an optional object with + * variables. + */ + Node.prototype.compile = function (math) { + if (!(math instanceof Object)) { + throw new TypeError('Object expected for parameter math'); + } + + // definitions globally available inside the closure of the compiled expressions + var defs = { + math: _transform(math), + args: {}, // can be filled with names of FunctionAssignment arguments + _validateScope: _validateScope + }; + + var code = this._compile(defs); + + var defsCode = Object.keys(defs).map(function (name) { + return ' var ' + name + ' = defs["' + name + '"];'; + }); + + var factoryCode = + defsCode.join(' ') + + 'return {' + + ' "eval": function (scope) {' + + ' if (scope) _validateScope(scope);' + + ' scope = scope || {};' + + ' return ' + code + ';' + + ' }' + + '};'; + + var factory = new Function ('defs', factoryCode); + return factory(defs); + }; + + /** + * Compile the node to javascript code + * @param {Object} defs Object which can be used to define functions + * and constants globally available inside the closure + * of the compiled expression + * @return {String} js + * @private + */ + Node.prototype._compile = function (defs) { + // must be implemented by each of the Node implementations + throw new Error('Cannot compile a Node interface'); + }; + + /** + * Execute a callback for each of the child nodes of this node + * @param {function(child: Node, path: string, parent: Node)} callback + */ + Node.prototype.forEach = function (callback) { + // must be implemented by each of the Node implementations + throw new Error('Cannot run forEach on a Node interface'); + }; + + /** + * Create a new Node having it's childs be the results of calling + * the provided callback function for each of the childs of the original node. + * @param {function(child: Node, path: string, parent: Node): Node} callback + * @returns {OperatorNode} Returns a transformed copy of the node + */ + Node.prototype.map = function (callback) { + // must be implemented by each of the Node implementations + throw new Error('Cannot run map on a Node interface'); + }; + + /** + * Validate whether an object is a Node, for use with map + * @param {Node} node + * @returns {Node} Returns the input if it's a node, else throws an Error + * @protected + */ + Node.prototype._ifNode = function (node) { + if (!(node instanceof Node)) { + throw new TypeError('Callback function must return a Node'); + } + + return node; + }; + + /** + * Recursively traverse all nodes in a node tree. Executes given callback for + * this node and each of its child nodes. + * @param {function(node: Node, path: string, parent: Node)} callback + * A callback called for every node in the node tree. + */ + Node.prototype.traverse = function (callback) { + // execute callback for itself + callback(this, null, null); + + // recursively traverse over all childs of a node + function _traverse (node, callback) { + node.forEach(function(child, path, parent) { + callback(child, path, parent); + _traverse(child, callback); + }); + } + _traverse(this, callback); + }; + + /** + * Recursively transform a node tree via a transform function. + * + * For example, to replace all nodes of type SymbolNode having name 'x' with a + * ConstantNode with value 2: + * + * var res = Node.transform(function (node, path, parent) { + * if (node instanceof SymbolNode) && (node.name == 'x')) { + * return new ConstantNode(2); + * } + * else { + * return node; + * } + * }); + * + * @param {function(node: Node, path: string, parent: Node) : Node} callback + * A mapping function accepting a node, and returning + * a replacement for the node or the original node. + * Signature: callback(node: Node, index: string, parent: Node) : Node + * @return {Node} Returns the original node or its replacement + */ + Node.prototype.transform = function (callback) { + // check itself + var replacement = callback(this, null, null); + if (replacement !== this) { + return replacement; + } + + // traverse over all childs + function _transform (node, callback) { + return node.map(function(child, path, parent) { + var replacement = callback(child, path, parent); + return (replacement !== child) ? replacement : _transform(child, callback); + }); + } + return _transform(this, callback); + }; + + /** + * Find any node in the node tree matching given filter function. For example, to + * find all nodes of type SymbolNode having name 'x': + * + * var results = Node.filter(function (node) { + * return (node instanceof SymbolNode) && (node.name == 'x'); + * }); + * + * @param {function(node: Node, path: string, parent: Node) : Node} callback + * A test function returning true when a node matches, and false + * otherwise. Function signature: + * callback(node: Node, index: string, parent: Node) : boolean + * @return {Node[]} nodes An array with nodes matching given filter criteria + */ + Node.prototype.filter = function (callback) { + var nodes = []; + + this.traverse(function (node, path, parent) { + if (callback(node, path, parent)) { + nodes.push(node); + } + }); + + return nodes; + }; + + // TODO: deprecated since version 1.1.0, remove this some day + Node.prototype.find = function () { + throw new Error('Function Node.find is deprecated. Use Node.filter instead.'); + }; + + // TODO: deprecated since version 1.1.0, remove this some day + Node.prototype.match = function () { + throw new Error('Function Node.match is deprecated. See functions Node.filter, Node.transform, Node.traverse.'); + }; + + /** + * Create a clone of this node, a shallow copy + * @return {Node} + */ + Node.prototype.clone = function() { + // must be implemented by each of the Node implementations + throw new Error('Cannot clone a Node interface'); + }; + + /** + * Get string representation + * @return {String} + */ + Node.prototype.toString = function() { + return ''; + }; + + /** + * Get LaTeX representation. (wrapper function) + * This functions get's either an object containing callbacks or + * a single callback. It decides whether to call the callback and if + * not or if the callback returns nothing, it calls the default + * LaTeX implementation of the node (_toTex). + * + * @param {Object|function} callback(s) + * @return {String} + */ + Node.prototype.toTex = function(callback) { + var customTex; + if (this.type === 'ArrayNode') { + //FIXME this is only a workaround for a breaking change, + //remove this in version2 + delete this.latexType; + } + if (typeof callback === 'object') { + if ((this.type === 'FunctionNode') && callback.hasOwnProperty(this.name)) { + //if callback is a map of callback functions and this is a FunctionNode + customTex = callback[this.name](this, callback); + } + } + else if (typeof callback === 'function') { + //if callback is a function + customTex = callback(this, callback); + } + else if ((typeof callback === 'string') && (this.type === 'ArrayNode')) { + //FIXME this is only a workaround for a breaking change, + //remove this in version2 + this.latexType = callback; + } + else if (typeof callback !== 'undefined') { + throw new TypeError('Object or function expected as callback'); + } + + if (typeof customTex !== 'undefined') { + return customTex; + } + + return this._toTex(callback); + }; + + /** + * Internal function to generate the LaTeX output. + * This has to be implemented by every Node + * + * @param {Object}|function} + * @throws {Error} + */ + Node.prototype._toTex = function () { + if (this.type === 'Node') { + //FIXME remove this in v2 + return ''; + } + //must be implemented by each of the Node implementations + throw new Error('_toTex not implemented for this Node'); + }; + + /** + * Get identifier. + * @return {String} + */ + Node.prototype.getIdentifier = function () { + return this.type; + }; + + /** + * Test whether an object is a Node + * @param {*} object + * @returns {boolean} isNode + */ + Node.isNode = function(object) { + return object instanceof Node; + }; + + /** + * Validate the symbol names of a scope. + * Throws an error when the scope contains an illegal symbol. + * @param {Object} scope + */ + function _validateScope (scope) { + for (var symbol in scope) { + if (scope.hasOwnProperty(symbol)) { + if (symbol in keywords) { + throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword'); + } + } + } + } + + /** + * Replace all functions having a transform function attached at property transform + * with their transform. + * @param {Object} math + * @return {Object} transformed + * @private + */ + function _transform(math) { + var transformed = Object.create(math); + + if (math.expression && math.expression.transform) { + for (var name in math.expression.transform) { + if (math.expression.transform.hasOwnProperty(name)) { + transformed[name] = math.expression.transform[name]; + } + } + } + + return transformed; + } + + module.exports = Node; /***/ }, /* 191 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'LOG2E', - 'category': 'Constants', - 'syntax': [ - 'LOG2E' - ], - 'description': 'Returns the base-2 logarithm of E, approximately equal to 1.442', - 'examples': [ - 'LOG2E', - 'log(e, 2)' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'e', + 'category': 'Constants', + 'syntax': [ + 'e' + ], + 'description': 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828', + 'examples': [ + 'e', + 'e ^ 2', + 'exp(2)', + 'log(e)' + ], + 'seealso': ['exp'] + }; /***/ }, /* 192 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'LOG10E', - 'category': 'Constants', - 'syntax': [ - 'LOG10E' - ], - 'description': 'Returns the base-10 logarithm of E, approximately equal to 0.434', - 'examples': [ - 'LOG10E', - 'log(e, 10)' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'false', + 'category': 'Constants', + 'syntax': [ + 'false' + ], + 'description': 'Boolean value false', + 'examples': [ + 'false' + ], + 'seealso': ['true'] + }; /***/ }, /* 193 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'NaN', - 'category': 'Constants', - 'syntax': [ - 'NaN' - ], - 'description': 'Not a number', - 'examples': [ - 'NaN', - '0 / 0' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'i', + 'category': 'Constants', + 'syntax': [ + 'i' + ], + 'description': 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.', + 'examples': [ + 'i', + 'i * i', + 'sqrt(-1)' + ], + 'seealso': [] + }; /***/ }, /* 194 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'null', - 'category': 'Constants', - 'syntax': [ - 'null' - ], - 'description': 'Value null', - 'examples': [ - 'null' - ], - 'seealso': ['true', 'false'] - }; + module.exports = { + 'name': 'Infinity', + 'category': 'Constants', + 'syntax': [ + 'Infinity' + ], + 'description': 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.', + 'examples': [ + 'Infinity', + '1 / 0' + ], + 'seealso': [] + }; /***/ }, /* 195 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'pi', - 'category': 'Constants', - 'syntax': [ - 'pi' - ], - 'description': 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159', - 'examples': [ - 'pi', - 'sin(pi/2)' - ], - 'seealso': ['tau'] - }; + module.exports = { + 'name': 'LN2', + 'category': 'Constants', + 'syntax': [ + 'LN2' + ], + 'description': 'Returns the natural logarithm of 2, approximately equal to 0.693', + 'examples': [ + 'LN2', + 'log(2)' + ], + 'seealso': [] + }; /***/ }, /* 196 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'phi', - 'category': 'Constants', - 'syntax': [ - 'phi' - ], - 'description': 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...', - 'examples': [ - 'tau' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'LN10', + 'category': 'Constants', + 'syntax': [ + 'LN10' + ], + 'description': 'Returns the natural logarithm of 10, approximately equal to 2.302', + 'examples': [ + 'LN10', + 'log(10)' + ], + 'seealso': [] + }; /***/ }, /* 197 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'SQRT1_2', - 'category': 'Constants', - 'syntax': [ - 'SQRT1_2' - ], - 'description': 'Returns the square root of 1/2, approximately equal to 0.707', - 'examples': [ - 'SQRT1_2', - 'sqrt(1/2)' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'LOG2E', + 'category': 'Constants', + 'syntax': [ + 'LOG2E' + ], + 'description': 'Returns the base-2 logarithm of E, approximately equal to 1.442', + 'examples': [ + 'LOG2E', + 'log(e, 2)' + ], + 'seealso': [] + }; /***/ }, /* 198 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'SQRT2', - 'category': 'Constants', - 'syntax': [ - 'SQRT2' - ], - 'description': 'Returns the square root of 2, approximately equal to 1.414', - 'examples': [ - 'SQRT2', - 'sqrt(2)' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'LOG10E', + 'category': 'Constants', + 'syntax': [ + 'LOG10E' + ], + 'description': 'Returns the base-10 logarithm of E, approximately equal to 0.434', + 'examples': [ + 'LOG10E', + 'log(e, 10)' + ], + 'seealso': [] + }; /***/ }, /* 199 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'tau', - 'category': 'Constants', - 'syntax': [ - 'tau' - ], - 'description': 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.', - 'examples': [ - 'tau', - '2 * pi' - ], - 'seealso': ['pi'] - }; + module.exports = { + 'name': 'NaN', + 'category': 'Constants', + 'syntax': [ + 'NaN' + ], + 'description': 'Not a number', + 'examples': [ + 'NaN', + '0 / 0' + ], + 'seealso': [] + }; /***/ }, /* 200 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'true', - 'category': 'Constants', - 'syntax': [ - 'true' - ], - 'description': 'Boolean value true', - 'examples': [ - 'true' - ], - 'seealso': ['false'] - }; + module.exports = { + 'name': 'null', + 'category': 'Constants', + 'syntax': [ + 'null' + ], + 'description': 'Value null', + 'examples': [ + 'null' + ], + 'seealso': ['true', 'false'] + }; /***/ }, /* 201 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'version', - 'category': 'Constants', - 'syntax': [ - 'version' - ], - 'description': 'A string with the version number of math.js', - 'examples': [ - 'version' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'pi', + 'category': 'Constants', + 'syntax': [ + 'pi' + ], + 'description': 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159', + 'examples': [ + 'pi', + 'sin(pi/2)' + ], + 'seealso': ['tau'] + }; /***/ }, /* 202 */ /***/ function(module, exports, __webpack_require__) { - var map = { - "./clone": 154, - "./clone.js": 154, - "./filter": 155, - "./filter.js": 155, - "./forEach": 162, - "./forEach.js": 162, - "./format": 156, - "./format.js": 156, - "./import": 157, - "./import.js": 157, - "./map": 158, - "./map.js": 158, - "./print": 159, - "./print.js": 159, - "./sort": 160, - "./sort.js": 160, - "./typeof": 161, - "./typeof.js": 161 - }; - function webpackContext(req) { - return __webpack_require__(webpackContextResolve(req)); - }; - function webpackContextResolve(req) { - return map[req] || (function() { throw new Error("Cannot find module '" + req + "'.") }()); - }; - webpackContext.keys = function webpackContextKeys() { - return Object.keys(map); - }; - webpackContext.resolve = webpackContextResolve; - module.exports = webpackContext; - webpackContext.id = 202; + module.exports = { + 'name': 'phi', + 'category': 'Constants', + 'syntax': [ + 'phi' + ], + 'description': 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...', + 'examples': [ + 'tau' + ], + 'seealso': [] + }; /***/ }, /* 203 */ /***/ function(module, exports, __webpack_require__) { - var DimensionError = __webpack_require__(165); - var IndexError = __webpack_require__(170); - - /** - * Transform zero-based indices to one-based indices in errors - * @param {Error} err - * @returns {Error} Returns the transformed error - */ - exports.transform = function (err) { - if (err instanceof IndexError) { - return new IndexError(err.index + 1, err.min + 1, err.max + 1); - } - - return err; - }; + module.exports = { + 'name': 'SQRT1_2', + 'category': 'Constants', + 'syntax': [ + 'SQRT1_2' + ], + 'description': 'Returns the square root of 1/2, approximately equal to 0.707', + 'examples': [ + 'SQRT1_2', + 'sqrt(1/2)' + ], + 'seealso': [] + }; /***/ }, /* 204 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Test whether value is a Boolean - * @param {*} value - * @return {Boolean} isBoolean - */ - exports.isBoolean = function(value) { - return (value instanceof Boolean) || (typeof value == 'boolean'); - }; + module.exports = { + 'name': 'SQRT2', + 'category': 'Constants', + 'syntax': [ + 'SQRT2' + ], + 'description': 'Returns the square root of 2, approximately equal to 1.414', + 'examples': [ + 'SQRT2', + 'sqrt(2)' + ], + 'seealso': [] + }; /***/ }, /* 205 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - var number = __webpack_require__(3); - var bignumber = __webpack_require__(166); - var BigNumber = __webpack_require__(12); - - /** - * Test whether value is a String - * @param {*} value - * @return {Boolean} isString - */ - exports.isString = function(value) { - return (value instanceof String) || (typeof value == 'string'); - }; - - /** - * Check if a text ends with a certain string. - * @param {String} text - * @param {String} search - */ - exports.endsWith = function(text, search) { - var start = text.length - search.length; - var end = text.length; - return (text.substring(start, end) === search); - }; - - /** - * Format a value of any type into a string. - * - * Usage: - * math.format(value) - * math.format(value, precision) - * - * If value is a function, the returned string is 'function' unless the function - * has a property `description`, in that case this properties value is returned. - * - * Example usage: - * math.format(2/7); // '0.2857142857142857' - * math.format(math.pi, 3); // '3.14' - * math.format(new Complex(2, 3)); // '2 + 3i' - * math.format('hello'); // '"hello"' - * - * @param {*} value Value to be stringified - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @return {String} str - */ - exports.format = function(value, options) { - if (number.isNumber(value)) { - return number.format(value, options); - } - - if (value instanceof BigNumber) { - return bignumber.format(value, options); - } - - if (Array.isArray(value)) { - return formatArray(value, options); - } - - if (exports.isString(value)) { - return '"' + value + '"'; - } - - if (typeof value === 'function') { - return value.syntax ? value.syntax + '' : 'function'; - } - - if (value instanceof Object) { - if (typeof value.format === 'function') { - return value.format(options); - } - else { - return value.toString(); - } - } - - return String(value); - }; - - /** - * Recursively format an n-dimensional matrix - * Example output: "[[1, 2], [3, 4]]" - * @param {Array} array - * @param {Object | Number | Function} [options] Formatting options. See - * lib/util/number:format for a - * description of the available - * options. - * @returns {String} str - */ - function formatArray (array, options) { - if (Array.isArray(array)) { - var str = '['; - var len = array.length; - for (var i = 0; i < len; i++) { - if (i != 0) { - str += ', '; - } - str += formatArray(array[i], options); - } - str += ']'; - return str; - } - else { - return exports.format(array, options); - } - } + module.exports = { + 'name': 'tau', + 'category': 'Constants', + 'syntax': [ + 'tau' + ], + 'description': 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.', + 'examples': [ + 'tau', + '2 * pi' + ], + 'seealso': ['pi'] + }; /***/ }, /* 206 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'abs', - 'category': 'Arithmetic', - 'syntax': [ - 'abs(x)' - ], - 'description': 'Compute the absolute value.', - 'examples': [ - 'abs(3.5)', - 'abs(-4.2)' - ], - 'seealso': ['sign'] - }; + module.exports = { + 'name': 'true', + 'category': 'Constants', + 'syntax': [ + 'true' + ], + 'description': 'Boolean value true', + 'examples': [ + 'true' + ], + 'seealso': ['false'] + }; /***/ }, /* 207 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'add', - 'category': 'Operators', - 'syntax': [ - 'x + y', - 'add(x, y)' - ], - 'description': 'Add two values.', - 'examples': [ - 'a = 2.1 + 3.6', - 'a - 3.6', - '3 + 2i', - '"hello" + " world"', - '3 cm + 2 inch' - ], - 'seealso': [ - 'subtract' - ] - }; + module.exports = { + 'name': 'version', + 'category': 'Constants', + 'syntax': [ + 'version' + ], + 'description': 'A string with the version number of math.js', + 'examples': [ + 'version' + ], + 'seealso': [] + }; /***/ }, /* 208 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'ceil', - 'category': 'Arithmetic', - 'syntax': [ - 'ceil(x)' - ], - 'description': - 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.', - 'examples': [ - 'ceil(3.2)', - 'ceil(3.8)', - 'ceil(-4.2)' - ], - 'seealso': ['floor', 'fix', 'round'] - }; + var DimensionError = __webpack_require__(174); + var IndexError = __webpack_require__(173); + + /** + * Transform zero-based indices to one-based indices in errors + * @param {Error} err + * @returns {Error} Returns the transformed error + */ + exports.transform = function (err) { + if (err instanceof IndexError) { + return new IndexError(err.index + 1, err.min + 1, err.max + 1); + } + + return err; + }; /***/ }, /* 209 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'cube', - 'category': 'Arithmetic', - 'syntax': [ - 'cube(x)' - ], - 'description': 'Compute the cube of a value. The cube of x is x * x * x.', - 'examples': [ - 'cube(2)', - '2^3', - '2 * 2 * 2' - ], - 'seealso': [ - 'multiply', - 'square', - 'pow' - ] - }; + 'use strict'; + + /** + * Test whether value is a Boolean + * @param {*} value + * @return {Boolean} isBoolean + */ + exports.isBoolean = function(value) { + return (value instanceof Boolean) || (typeof value == 'boolean'); + }; /***/ }, /* 210 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'divide', - 'category': 'Operators', - 'syntax': [ - 'x / y', - 'divide(x, y)' - ], - 'description': 'Divide two values.', - 'examples': [ - 'a = 2 / 3', - 'a * 3', - '4.5 / 2', - '3 + 4 / 2', - '(3 + 4) / 2', - '18 km / 4.5' - ], - 'seealso': [ - 'multiply' - ] - }; + 'use strict'; + + function factory(type, config, load) { + + var addScalar = load(__webpack_require__(211)); + var multiplyScalar = load(__webpack_require__(212)); + + /** + * Copies a sparse vector into a dense one. Computes x = x + v * A(:,j) + * + * @param {Matrix} a The source sparse matrix + * @param {Number} j The columns in the sparse matrix to copy the values from + * @param {Scalar} v The value to use in the calculation + * @param {Array} w Array with marks indicating the column j has been copied for a given row + * @param {Array} x The dense vector of values + * @param {Number} mark The value column j must have in w array + * @param {Matrix} c The target sparce matrix + * + * @return {Number} The nonzero elements in matrix c + * @private + */ + var sparseScatter = function (a, j, v, w, x, mark, c) { + // a arrays + var avalues = a._values; + var aindex = a._index; + var aptr = a._ptr; + // c arrays + var cindex = c._index; + + // values in j + for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) { + // row + var i = aindex[k]; + // check value exists in current j + if (!w[i] || w[i] < mark) { + // i is new entry in j + w[i] = mark; + // add i to pattern of C + cindex.push(i); + // x(i) = A + if (x) + x[i] = multiplyScalar(v, avalues[k]); + } + else if (x) { + // i exists in C already + x[i] = addScalar(x[i], multiplyScalar(v, avalues[k])); + } + } + // number of nonzero elements in C + return cindex.length; + }; + + return sparseScatter; + } + + exports.name = 'sparseScatter'; + exports.factory = factory; /***/ }, /* 211 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'dotDivide', - 'category': 'Operators', - 'syntax': [ - 'x ./ y', - 'dotDivide(x, y)' - ], - 'description': 'Divide two values element wise.', - 'examples': [ - 'a = [1, 2, 3; 4, 5, 6]', - 'b = [2, 1, 1; 3, 2, 5]', - 'a ./ b' - ], - 'seealso': [ - 'multiply', - 'dotMultiply', - 'divide' - ] - }; + 'use strict'; + + function factory(type, config, load, typed) { + + /** + * Add two scalar values, `x + y`. + * This function is meant for internal use: it is used by the public function + * `add` + * + * This function does not support collections (Array or Matrix), and does + * not validate the number of of inputs. + * + * @param {Number | BigNumber | Boolean | Complex | Unit | null} x First value to add + * @param {Number | BigNumber | Boolean | Complex | null} y Second value to add + * @return {Number | BigNumber | Complex | Unit} Sum of `x` and `y` + * @private + */ + var addScalar = typed('addScalar', { + + 'number, number': function (x, y) { + return x + y; + }, + + 'Complex, Complex': function (x, y) { + return new type.Complex( + x.re + y.re, + x.im + y.im + ); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.plus(y); + }, + + 'Unit, Unit': function (x, y) { + if (x.value == null) throw new Error('Parameter x contains a unit with undefined value'); + if (y.value == null) throw new Error('Parameter y contains a unit with undefined value'); + if (!x.equalBase(y)) throw new Error('Units do not match'); + + var res = x.clone(); + res.value += y.value; + res.fixPrefix = false; + return res; + }, + + 'string, string': function (x, y) { + return x + y; + } + }); + + return addScalar; + } + + exports.name = 'addScalar'; + exports.factory = factory; /***/ }, /* 212 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'dotMultiply', - 'category': 'Operators', - 'syntax': [ - 'x .* y', - 'dotMultiply(x, y)' - ], - 'description': 'Multiply two values element wise.', - 'examples': [ - 'a = [1, 2, 3; 4, 5, 6]', - 'b = [2, 1, 1; 3, 2, 5]', - 'a .* b' - ], - 'seealso': [ - 'multiply', - 'divide', - 'dotDivide' - ] - }; + 'use strict'; + + function factory(type, config, load, typed) { + + /** + * Multiply two scalar values, `x * y`. + * This function is meant for internal use: it is used by the public function + * `multiply` + * + * This function does not support collections (Array or Matrix), and does + * not validate the number of of inputs. + * + * @param {Number | BigNumber | Boolean | Complex | Unit | null} x First value to multiply + * @param {Number | BigNumber | Boolean | Complex | null} y Second value to multiply + * @return {Number | BigNumber | Complex | Unit} Multiplication of `x` and `y` + * @private + */ + var multiplyScalar = typed('multiplyScalar', { + + 'number, number': function (x, y) { + return x * y; + }, + + 'Complex, Complex': function (x, y) { + return new type.Complex( + x.re * y.re - x.im * y.im, + x.re * y.im + x.im * y.re + ); + }, + + 'BigNumber, BigNumber': function (x, y) { + return x.times(y); + }, + + 'number, Unit': function (x, y) { + var res = y.clone(); + res.value = (res.value === null) ? res._normalize(x) : (res.value * x); + return res; + }, + + 'Unit, number': function (x, y) { + var res = x.clone(); + res.value = (res.value === null) ? res._normalize(y) : (res.value * y); + return res; + }, + }); + + return multiplyScalar; + } + + exports.name = 'multiplyScalar'; + exports.factory = factory; /***/ }, /* 213 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'dotpow', - 'category': 'Operators', - 'syntax': [ - 'x .^ y', - 'dotpow(x, y)' - ], - 'description': - 'Calculates the power of x to y element wise.', - 'examples': [ - 'a = [1, 2, 3; 4, 5, 6]', - 'a .^ 2' - ], - 'seealso': [ - 'pow' - ] - }; + 'use strict'; + + function factory(type, config, load, typed) { + /** + * Divide two scalar values, `x / y`. + * This function is meant for internal use: it is used by the public functions + * `divide` and `inv`. + * + * This function does not support collections (Array or Matrix), and does + * not validate the number of of inputs. + * + * @param {Number | BigNumber | Boolean | Complex | Unit | null} x Numerator + * @param {Number | BigNumber | Boolean | Complex | null} y Denominator + * @return {Number | BigNumber | Complex | Unit} Quotient, `x / y` + * @private + */ + var divideScalar = typed('divideScalar', { + 'number, number': function (x, y) { + return x / y; + }, + + 'Complex, Complex': _divideComplex, + + 'BigNumber, BigNumber': function (x, y) { + return x.div(y); + }, + + 'Unit, number': function (x, y) { + var res = x.clone(); + res.value = ((res.value === null) ? res._normalize(1) : res.value) / y; + return res; + } + }); + + /** + * Divide two complex numbers. x / y or divide(x, y) + * @param {Complex} x + * @param {Complex} y + * @return {Complex} res + * @private + */ + function _divideComplex (x, y) { + var den = y.re * y.re + y.im * y.im; + if (den != 0) { + return new type.Complex( + (x.re * y.re + x.im * y.im) / den, + (x.im * y.re - x.re * y.im) / den + ); + } + else { + // both y.re and y.im are zero + return new type.Complex( + (x.re != 0) ? (x.re / 0) : 0, + (x.im != 0) ? (x.im / 0) : 0 + ); + } + } + + return divideScalar; + } + + exports.name = 'divideScalar'; + exports.factory = factory; /***/ }, /* 214 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'exp', - 'category': 'Arithmetic', - 'syntax': [ - 'exp(x)' - ], - 'description': 'Calculate the exponent of a value.', - 'examples': [ - 'exp(1.3)', - 'e ^ 1.3', - 'log(exp(1.3))', - 'x = 2.4', - '(exp(i*x) == cos(x) + i*sin(x)) # Euler\'s formula' - ], - 'seealso': [ - 'pow', - 'log' - ] - }; + 'use strict'; + + var BigNumber = __webpack_require__(350); + var isNumber = __webpack_require__(175).isNumber; + var digits = __webpack_require__(175).digits; + var memoize = __webpack_require__(349).memoize; + + /** + * Test whether value is a BigNumber + * @param {*} value + * @return {Boolean} isBigNumber + */ + // TODO: remove function isBigNumber + exports.isBigNumber = function (value) { + return (value instanceof BigNumber); + }; + + /** + * Try to convert a Number in to a BigNumber. + * If the number has 15 or mor significant digits, the Number cannot be + * converted to BigNumber and will return the original number. + * @param {Number} number + * @param {function} constructor BigNumber constructor + * @return {BigNumber} bignumber + */ + // TODO: remove function toBigNumber + exports.toBigNumber = function(number, constructor) { + // stringify in case of more than 15 digits to circumvent the safety error + // of decimal.js + return new constructor((digits(number) > 15) ? (number + '') : number); + }; + + + /************************************* + * Constants * + *************************************/ + + /** + * Calculate BigNumber e + * @param {Number} precision + * @returns {BigNumber} Returns e + */ + exports.e = memoize(function (precision) { + var Big = BigNumber.constructor({precision: precision}); + + return new Big(1).exp(); + }); + + /** + * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2 + * @param {Number} precision + * @returns {BigNumber} Returns phi + */ + exports.phi = memoize(function (precision) { + var Big = BigNumber.constructor({precision: precision}); + + return new Big(1).plus(new Big(5).sqrt()).div(2); + }); + + /** + * Calculate BigNumber pi. + * + * Uses Machin's formula: pi / 4 = 4 * arctan(1 / 5) - arctan(1 / 239) + * http://milan.milanovic.org/math/english/pi/machin.html + * @param {Number} precision + * @returns {BigNumber} Returns pi + */ + exports.pi = memoize(function (precision) { + // we calculate pi with a few decimal places extra to prevent round off issues + var Big = BigNumber.constructor({precision: precision + 4}); + var pi4th = new Big(4).times(arctan_taylor(new Big(1).div(5))) + .minus(arctan_taylor(new Big(1).div(239))); + + Big.config({precision: precision}); + + // the final pi has the requested number of decimals + return new Big(4).times(pi4th); + }); + + /** + * Calculate BigNumber tau, tau = 2 * pi + * @param {Number} precision + * @returns {BigNumber} Returns tau + */ + exports.tau = memoize(function (precision) { + // we calculate pi at a slightly higher precision than configured to prevent round off errors + // when multiplying by two in the end + + var pi = exports.pi(precision + 2); + + var Big = BigNumber.constructor({precision: precision}); + + return new Big(2).times(pi); + }); + + + /************************************* + * Bitwise functions * + *************************************/ + + /* + * Special Cases: + * N & n = N + * n & 0 = 0 + * n & -1 = n + * n & n = n + * I & I = I + * -I & -I = -I + * I & -I = 0 + * I & n = n + * I & -n = I + * -I & n = 0 + * -I & -n = -I + * + * @param {BigNumber} value + * @param {BigNumber} value + * @return {BigNumber} Result of `x` & `y`, is fully precise + * + */ + exports.and = function(x, y) { + if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { + throw new Error('Integers expected in function bitAnd'); + } + + var BigNumber = x.constructor; + if (x.isNaN() || y.isNaN()) { + return new BigNumber(NaN); + } + + if (x.isZero() || y.eq(-1) || x.eq(y)) { + return x; + } + if (y.isZero() || x.eq(-1)) { + return y; + } + + if (!x.isFinite() || !y.isFinite()) { + if (!x.isFinite() && !y.isFinite()) { + if (x.isNegative() == y.isNegative()) { + return x; + } + return new BigNumber(0); + } + if (!x.isFinite()) { + if (y.isNegative()) { + return x; + } + if (x.isNegative()) { + return new BigNumber(0); + } + return y; + } + if (!y.isFinite()) { + if (x.isNegative()) { + return y; + } + if (y.isNegative()) { + return new BigNumber(0); + } + return x; + } + } + return bitwise(x, y, function (a, b) { return a & b }); + }; + + /* + * Special Cases: + * n << -n = N + * n << N = N + * N << n = N + * n << 0 = n + * 0 << n = 0 + * I << I = N + * I << n = I + * n << I = I + * + * @param {BigNumber} value + * @param {BigNumber} value + * @return {BigNumber} Result of `x` << `y` + * + */ + exports.leftShift = function (x, y) { + if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { + throw new Error('Integers expected in function leftShift'); + } + + var BigNumber = x.constructor; + if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) { + return new BigNumber(NaN); + } + if (x.isZero() || y.isZero()) { + return x; + } + if (!x.isFinite() && !y.isFinite()) { + return new BigNumber(NaN); + } + + // Math.pow(2, y) is fully precise for y < 55, and fast + if (y.lt(55)) { + return x.times(Math.pow(2, y.toNumber()) + ''); + } + return x.times(new BigNumber(2).pow(y)); + }; + + /* + * @param {BigNumber} value + * @return {BigNumber} Result of ~`x`, fully precise + * + */ + exports.not = function (x) { + if (x.isFinite() && !x.isInteger()) { + throw new Error('Integer expected in function bitNot'); + } + + var BigNumber = x.constructor; + var prevPrec = BigNumber.precision; + BigNumber.config({precision: 1E9}); + + var x = x.plus(BigNumber.ONE); + x.s = -x.s || null; + + BigNumber.config({precision: prevPrec}); + return x; + }; + + /* + * Special Cases: + * N | n = N + * n | 0 = n + * n | -1 = -1 + * n | n = n + * I | I = I + * -I | -I = -I + * I | -n = -1 + * I | -I = -1 + * I | n = I + * -I | n = -I + * -I | -n = -n + * + * @param {BigNumber} value + * @param {BigNumber} value + * @return {BigNumber} Result of `x` | `y`, fully precise + * + */ + exports.or = function (x, y) { + if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { + throw new Error('Integers expected in function bitOr'); + } + + var BigNumber = x.constructor; + if (x.isNaN() || y.isNaN()) { + return new BigNumber(NaN); + } + + var negOne = new BigNumber(-1); + if (x.isZero() || y.eq(negOne) || x.eq(y)) { + return y; + } + if (y.isZero() || x.eq(negOne)) { + return x; + } + + if (!x.isFinite() || !y.isFinite()) { + if ((!x.isFinite() && !x.isNegative() && y.isNegative()) || + (x.isNegative() && !y.isNegative() && !y.isFinite())) { + return negOne; + } + if (x.isNegative() && y.isNegative()) { + return x.isFinite() ? x : y; + } + return x.isFinite() ? y : x; + } + return bitwise(x, y, function (a, b) { return a | b }); + }; + + /* + * Special Cases: + * n >> -n = N + * n >> N = N + * N >> n = N + * I >> I = N + * n >> 0 = n + * I >> n = I + * -I >> n = -I + * -I >> I = -I + * n >> I = I + * -n >> I = -1 + * 0 >> n = 0 + * + * @param {BigNumber} value + * @param {BigNumber} value + * @return {BigNumber} Result of `x` >> `y` + * + */ + exports.rightArithShift = function (x, y) { + if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { + throw new Error('Integers expected in function rightArithShift'); + } + + var BigNumber = x.constructor; + if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) { + return new BigNumber(NaN); + } + if (x.isZero() || y.isZero()) { + return x; + } + if (!y.isFinite()) { + if (x.isNegative()) { + return new BigNumber(-1); + } + if (!x.isFinite()) { + return new BigNumber(NaN); + } + return new BigNumber(0); + } + + // Math.pow(2, y) is fully precise for y < 55, and fast + if (y.lt(55)) { + return x.div(Math.pow(2, y.toNumber()) + '').floor(); + } + return x.div(new BigNumber(2).pow(y)).floor(); + }; + + /* + * Special Cases: + * N ^ n = N + * n ^ 0 = n + * n ^ n = 0 + * n ^ -1 = ~n + * I ^ n = I + * I ^ -n = -I + * I ^ -I = -1 + * -I ^ n = -I + * -I ^ -n = I + * + * @param {BigNumber} value + * @param {BigNumber} value + * @return {BigNumber} Result of `x` ^ `y`, fully precise + * + */ + exports.xor = function (x, y) { + if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) { + throw new Error('Integers expected in function bitXor'); + } + + var BigNumber = x.constructor; + if (x.isNaN() || y.isNaN()) { + return new BigNumber(NaN); + } + if (x.isZero()) { + return y; + } + if (y.isZero()) { + return x; + } + + if (x.eq(y)) { + return new BigNumber(0); + } + + var negOne = new BigNumber(-1); + if (x.eq(negOne)) { + return exports.not(y); + } + if (y.eq(negOne)) { + return exports.not(x); + } + + if (!x.isFinite() || !y.isFinite()) { + if (!x.isFinite() && !y.isFinite()) { + return negOne; + } + return new BigNumber(x.isNegative() == y.isNegative() + ? Infinity + : -Infinity); + } + return bitwise(x, y, function (a, b) { return a ^ b }); + }; + + /* Applies bitwise function to numbers. */ + function bitwise(x, y, func) { + var BigNumber = x.constructor; + + var xBits, yBits; + var xSign = +(x.s < 0); + var ySign = +(y.s < 0); + if (xSign) { + xBits = decCoefficientToBinaryString(exports.not(x)); + for (var i = 0; i < xBits.length; ++i) { + xBits[i] ^= 1; + } + } else { + xBits = decCoefficientToBinaryString(x); + } + if (ySign) { + yBits = decCoefficientToBinaryString(exports.not(y)); + for (var i = 0; i < yBits.length; ++i) { + yBits[i] ^= 1; + } + } else { + yBits = decCoefficientToBinaryString(y); + } + + var minBits, maxBits, minSign; + if (xBits.length <= yBits.length) { + minBits = xBits; + maxBits = yBits; + minSign = xSign; + } else { + minBits = yBits; + maxBits = xBits; + minSign = ySign; + } + + var shortLen = minBits.length; + var longLen = maxBits.length; + var expFuncVal = func(xSign, ySign) ^ 1; + var outVal = new BigNumber(expFuncVal ^ 1); + var twoPower = BigNumber.ONE; + var two = new BigNumber(2); + + var prevPrec = BigNumber.precision; + BigNumber.config({precision: 1E9}); + + while (shortLen > 0) { + if (func(minBits[--shortLen], maxBits[--longLen]) == expFuncVal) { + outVal = outVal.plus(twoPower); + } + twoPower = twoPower.times(two); + } + while (longLen > 0) { + if (func(minSign, maxBits[--longLen]) == expFuncVal) { + outVal = outVal.plus(twoPower); + } + twoPower = twoPower.times(two); + } + + BigNumber.config({precision: prevPrec}); + + if (expFuncVal == 0) { + outVal.s = -outVal.s; + } + return outVal; + } + + /* Extracted from decimal.js, and edited to specialize. */ + function decCoefficientToBinaryString(x) { + // Convert to string + var a = x.c; + var r = a[0] + ''; + + for (var i = 1; i < a.length; ++i) { + var s = a[i] + ''; + for (var z = 7 - s.length; z--; ) { + s = '0' + s; + } + + r += s; + } + + var j; + for (j = r.length - 1; r.charAt(j) == '0'; --j); + + var xe = x.e; + var str = r.slice(0, j + 1 || 1); + var strL = str.length; + if (xe > 0) { + if (++xe > strL) { + // Append zeros. + for (xe -= strL; xe--; str += '0'); + } else if (xe < strL) { + str = str.slice(0, xe) + '.' + str.slice(xe); + } + } + + // Convert from base 10 (decimal) to base 2 + var arr = [0]; + for (var i = 0; i < str.length; ) { + for (var arrL = arr.length; arrL--; arr[arrL] *= 10); + + arr[0] += str.charAt(i++) << 0; // convert to int + for (var j = 0; j < arr.length; ++j) { + if (arr[j] > 1) { + if (arr[j + 1] == null) { + arr[j + 1] = 0; + } + + arr[j + 1] += arr[j] >> 1; + arr[j] &= 1; + } + } + } + + return arr.reverse(); + } + + + /************************************* + * Trigonometric functions * + *************************************/ + + /** + * Calculate the arccosine or arcsecant of x + * + * acos(x) = 2*atan(sqrt(1-x^2)/(1+x)) + * + * asec(x) = acos(1/x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is sec + * @returns {BigNumber} arccosine or arcsecant of x + */ + exports.arccos_arcsec = function (x, Big, reciprocal) { + var precision = Big.precision; + if (reciprocal) { + if (x.abs().lt(Big.ONE)) { + throw new Error('asec() only has non-complex values for |x| >= 1.'); + } + } else if (x.abs().gt(Big.ONE)) { + throw new Error('acos() only has non-complex values for |x| <= 1.'); + } + if (x.eq(-1)) { + return exports.pi(precision); + } + + Big.config({precision: precision + 4}); + + if (reciprocal) { + x = Big.ONE.div(x); + } + + var acos = exports.arctan_arccot(Big.ONE.minus(x.times(x)).sqrt() + .div(x.plus(Big.ONE)), Big).times(2); + + Big.config({precision: precision}); + return acos.toDP(precision - 1); + }; + + /** + * Calculate the arcsine or arccosecant of x + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is csc + * @returns {BigNumber} arcsine or arccosecant of x + */ + exports.arcsin_arccsc = function (x, Big, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + + var precision = Big.precision; + var absX = x.abs(); + if (reciprocal) { + if (absX.lt(Big.ONE)) { + throw new Error('acsc() only has non-complex values for |x| >= 1.'); + } + + Big.config({precision: precision + 2}); + x = Big.ONE.div(x); + Big.config({precision: precision}); + + absX = x.abs(); + } else if (absX.gt(Big.ONE)) { + throw new Error('asin() only has non-complex values for |x| <= 1.'); + } + + // Get x below 0.58 + if (absX.gt(0.8)) { + Big.config({precision: precision + 4}); + + // arcsin(x) = sign(x)*(Pi/2 - arcsin(sqrt(1 - x^2))) + var sign = x.s; + var halfPi = exports.pi(precision + 4).div(2); + x = halfPi.minus(exports.arcsin_arccsc(Big.ONE.minus(x.times(x)).sqrt(), Big)); + x.s = sign; + + x.constructor = Big; + Big.config({precision: precision}); + return x.toDP(precision - 1); + } + var wasReduced = absX.gt(0.58); + if (wasReduced) { + Big.config({precision: precision + 8}); + + // arcsin(x) = 2*arcsin(x / (sqrt(2)*sqrt(sqrt(1 - x^2) + 1))) + x = x.div(new Big(2).sqrt().times(Big.ONE.minus(x.times(x)).sqrt() + .plus(Big.ONE).sqrt())); + + Big.config({precision: precision}); + } + + // Avoid overhead of Newton's Method if feasible + var ret = (precision <= 60 || ((x.dp() <= Math.log(precision)) && x.lt(0.05))) + ? arcsin_taylor(x, precision) + : arcsin_newton(x, Big); + + if (wasReduced) { + return ret.times(2); + } + return ret; + }; + + /** + * Calculate the arctangent or arccotangent of x + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is cot + * @returns {BigNumber} arctangent or arccotangent of x + */ + exports.arctan_arccot = function (x, Big, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + if ((!reciprocal && x.isZero()) || (reciprocal && !x.isFinite())) { + return new Big(0); + } + + var precision = Big.precision; + if ((!reciprocal && !x.isFinite()) || (reciprocal && x.isZero())) { + var halfPi = exports.pi(precision + 2).div(2).toDP(precision - 1); + halfPi.constructor = Big; + halfPi.s = x.s; + + return halfPi; + } + + Big.config({precision: precision + 4}); + + if (reciprocal) { + x = Big.ONE.div(x); + } + + var absX = x.abs(); + if (absX.lte(0.875)) { + var ret = arctan_taylor(x); + + ret.constructor = Big; + Big.config({precision: precision}); + return ret.toDP(Big.precision - 1); + } + if (absX.gte(1.143)) { + // arctan(x) = sign(x)*((PI / 2) - arctan(1 / |x|)) + var halfPi = exports.pi(precision + 4).div(2); + var ret = halfPi.minus(arctan_taylor(Big.ONE.div(absX))); + ret.s = x.s; + + ret.constructor = Big; + Big.config({precision: precision}); + return ret.toDP(Big.precision - 1); + } + + // arctan(x) = arcsin(x / [sqrt(1 + x^2)]) + x = x.div(x.times(x).plus(1).sqrt()); + + Big.config({precision: precision}); + return exports.arcsin_arccsc(x, Big); + }; + + /** + * Calculate the arctangent of y, x + * + * @param {BigNumber} y + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @returns {BigNumber} arctangent of y, x + */ + exports.arctan2 = function (y, x, Big) { + var precision = Big.precision; + if (x.isZero()) { + if (y.isZero()) { + return new Big(NaN); + } + + var halfPi = exports.pi(precision + 2).div(2).toDP(precision - 1); + halfPi.constructor = Big; + halfPi.s = y.s; + + return halfPi; + } + + Big.config({precision: precision + 2}); + + var ret = exports.arctan_arccot(y.div(x), Big, false); + if (x.isNegative()) { + var pi = exports.pi(precision + 2); + ret = y.isNegative() ? ret.minus(pi) : ret.plus(pi); + } + + ret.constructor = Big; + Big.config({precision: precision}); + return ret.toDP(precision - 1); + }; + + /** + * Calculate the hyperbolic arccosine, arcsine, arcsecant, or arccosecant of x + * + * acosh(x) = ln(x + sqrt(x^2 - 1)) + * + * asinh(x) = ln(x + sqrt(x^2 + 1)) + * + * asech(x) = acosh(1 / x) + * + * acsch(x) = asinh(1 / x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} mode sine function if true, cosine function if false + * @param {Boolean} reciprocal is sec or csc + * @returns {BigNumber} hyperbolic arccosine, arcsine, arcsecant, or arccosecant of x + */ + exports.acosh_asinh_asech_acsch = function (x, Big, mode, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + if (reciprocal && x.isZero()) { + return new Big(Infinity); + } + if (!mode) { + if (reciprocal) { + if (x.isNegative() || x.gt(Big.ONE)) { + throw new Error('asech() only has non-complex values for 0 <= x <= 1.'); + } + } else if (x.lt(Big.ONE)) { + throw new Error('acosh() only has non-complex values for x >= 1.'); + } + } + + var precision = Big.precision; + Big.config({precision: precision + 4}); + + var y = new Big(x); + y.constructor = Big; + + if (reciprocal) { + y = Big.ONE.div(y); + } + + var x2PlusOrMinus = (mode) ? y.times(y).plus(Big.ONE) : y.times(y).minus(Big.ONE); + var ret = y.plus(x2PlusOrMinus.sqrt()).ln(); + + Big.config({precision: precision}); + return new Big(ret.toPrecision(precision)); + }; + + /** + * Calculate the hyperbolic arctangent or arccotangent of x + * + * atanh(x) = ln((1 + x)/(1 - x)) / 2 + * + * acoth(x) = atanh(1 / x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is sec or csc + * @returns {BigNumber} hyperbolic arctangent or arccotangent of x + */ + exports.atanh_acoth = function (x, Big, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + + var absX = x.abs(); + if (absX.eq(Big.ONE)) { + return new Big(x.isNegative() ? -Infinity : Infinity); + } + if (absX.gt(Big.ONE)) { + if (!reciprocal) { + throw new Error('atanh() only has non-complex values for |x| <= 1.'); + } + } else if (reciprocal) { + throw new Error('acoth() has complex values for |x| < 1.'); + } + + if (x.isZero()) { + return new Big(0); + } + + var precision = Big.precision; + Big.config({precision: precision + 4}); + + var y = new Big(x); + y.constructor = Big; + + if (reciprocal) { + y = Big.ONE.div(y); + } + var ret = Big.ONE.plus(y).div(Big.ONE.minus(y)).ln().div(2); + + Big.config({precision: precision}); + return new Big(ret.toPrecision(precision)); + }; + + /** + * Calculate the cosine/sine of x using the multiple angle identity: + * + * cos(4x) = 8[cos(x)^4 - cos(x)^2] + 1 + * + * sin(5x) = 16sin(x)^5 - 20sin(x)^3 + 5sin(x) + * http://www.tc.umn.edu/~ringx004/sidebar.html + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Number} mode cosine function if 0, sine function if 1 + * @param {Boolean} reciprocal is sec or csc + * @returns {BigNumber} cosine, sine, secant, or cosecant of x + */ + exports.cos_sin_sec_csc = function (x, Big, mode, reciprocal) { + if (x.isNaN() || !x.isFinite()) { + return new Big(NaN); + } + var precision = Big.precision; + + // Avoid changing the original value + var y = new Big(x); + + // sin(-x) == -sin(x), cos(-x) == cos(x) + var isNeg = y.isNegative(); + if (isNeg) { + y.s = -y.s; + } + + // Apply ~log(precision) guard bits + var precPlusGuardDigits = precision + (Math.log(precision) | 0) + 3; + Big.config({precision: precPlusGuardDigits}); + + y = reduceToPeriod(y, precPlusGuardDigits, mode); // Make this destructive + y[0].constructor = Big; + if (y[1]) { + y = y[0]; + if (reciprocal && y.isZero()) { + y = new Big(Infinity); + } + + Big.config({precision: precision}); + return y; + } + + var ret; + y = y[0]; + if (mode) { + ret = cos_sin_taylor(y.div(3125), mode); + Big.config({precision: Math.min(precPlusGuardDigits, precision + 15)}); + + var five = new Big(5); + var sixteen = new Big(16); + var twenty = new Big(20); + for (var i = 0; i < 5; ++i) { + var ret2 = ret.times(ret); + var ret3 = ret2.times(ret); + var ret5 = ret3.times(ret2); + ret = sixteen.times(ret5).minus( + twenty.times(ret3)).plus( + five.times(ret)); + } + + if (isNeg) { + ret.s = -ret.s; + } + } else { + var div_factor, loops; + if (y.abs().lt(Big.ONE)) { + div_factor = 64; + loops = 3; + } else { + div_factor = 256; + loops = 4; + } + + ret = cos_sin_taylor(y.div(div_factor), mode); + Big.config({precision: Math.min(precPlusGuardDigits, precision + 8)}); + + var eight = new Big(8); + for (; loops > 0; --loops) { + var ret2 = ret.times(ret); + var ret4 = ret2.times(ret2); + ret = eight.times(ret4.minus(ret2)).plus(Big.ONE); + } + } + + if (reciprocal) { + ret = (ret.e <= -precision) + ? new Big(Infinity) + : Big.ONE.div(ret); + } + + Big.config({precision: precision}); + return ret.toDP(precision - 1); + }; + + /** + * Calculate the tangent of x + * + * tan(x) = sin(x) / cos(x) + * + * cot(x) = cos(x) / sin(x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is cot + * @returns {BigNumber} tangent or cotangent of x + */ + exports.tan_cot = function (x, Big, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + + var precision = Big.precision; + var pi = exports.pi(precision + 2); + var halfPi = pi.div(2).toDP(precision - 1); + pi = pi.toDP(precision - 1); + + var y = reduceToPeriod(x, precision, 1)[0]; + if (y.abs().eq(pi)) { + return new Big(Infinity); + } + + Big.config({precision: precision + 4}); + var sin = exports.cos_sin_sec_csc(y, Big, 1, false); + var cos = sinToCos(sin); + + sin = sin.toDP(precision); + cos = cos.toDP(precision); + + // Make sure sign for cosine is correct + if (y.eq(x)) { + if (y.gt(halfPi)) { + cos.s = -cos.s; + } + } else if (pi.minus(y.abs()).gt(halfPi)) { + cos.s = -cos.s; + } + + var tan = (reciprocal) ? cos.div(sin) : sin.div(cos); + + Big.config({precision: precision}); + return new Big(tan.toPrecision(precision)); + }; + + /** + * Calculate the hyperbolic sine, cosine, secant, or cosecant of x + * + * cosh(x) = (exp(x) + exp(-x)) / 2 + * = (e^x + 1/e^x) / 2 + * + * sinh(x) = (exp(x) - exp(-x)) / 2 + * = (e^x - 1/e^x) / 2 + * + * sech(x) = 2 / (exp(x) + exp(-x)) + * = 2 / (e^x + 1/e^x) + * + * csch(x) = 2 / (exp(x) - exp(-x)) + * = 2 / (e^x - 1/e^x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} mode sinh function if true, cosh function if false + * @param {Boolean} reciprocal is sech or csch + * @returns {BigNumber} hyperbolic cosine, sine, secant. or cosecant of x + */ + exports.cosh_sinh_csch_sech = function (x, Big, mode, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + if (!x.isFinite()) { + if (reciprocal) { + return new Big(0); + } + return new Big((mode) ? x : Infinity); + } + + var precision = Big.precision; + Big.config({precision: precision + 4}); + + var y = new Big(x); + y.constructor = Big; + + y = y.exp(); + y = (mode) ? y.minus(Big.ONE.div(y)) : y.plus(Big.ONE.div(y)); + y = (reciprocal) ? new Big(2).div(y) : y.div(2); + + Big.config({precision: precision}); + return new Big(y.toPrecision(precision)); + }; + + /** + * Calculate the hyperbolic tangent of x + * + * tanh(x) = (exp(x) + exp(-x)) / (exp(x) - exp(-x)) + * = (exp(2x) - 1) / (exp(2x) + 1) + * = (e^x - 1/e^x) / (e^x + 1/e^x) + * + * coth(x) = (exp(x) - exp(-x)) / (exp(x) + exp(-x)) + * = (exp(2x) + 1) / (exp(2x) - 1) + * = (e^x + 1/e^x) / (e^x - 1/e^x) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @param {Boolean} reciprocal is coth + * @returns {BigNumber} hyperbolic tangent or cotangent of x + */ + exports.tanh_coth = function (x, Big, reciprocal) { + if (x.isNaN()) { + return new Big(NaN); + } + if (!x.isFinite()) { + return new Big(x.s); + } + + var precision = Big.precision; + Big.config({precision: precision + 4}); + + var y = new Big(x); + y.constructor = Big; + + var posExp = y.exp(); + var negExp = Big.ONE.div(posExp); + var ret = posExp.minus(negExp); + ret = (reciprocal) ? posExp.plus(negExp).div(ret) : ret.div(posExp.plus(negExp)); + + Big.config({precision: precision}); + return ret.toDP(precision - 1); + }; + + /** + * Calculate the arc sine of x using Newton's method + * + * f(x) = sin(x) = N => f(x) = sin(x) - N + * f'(x) = cos(x) + * + * Thus we solve each step as follows: + * x_(i+1) = x_i - (sin(x_i) - N)/cos(x_i) + * + * @param {BigNumber} x + * @param {DecimalFactory} Big current BigNumber constructor + * @returns {BigNumber} arc sine of x + */ + function arcsin_newton(x, Big) { + var oldPrecision = Big.precision; + + // Calibration variables, adjusted from MAPM + var tolerance = -(oldPrecision + 4); + var maxp = oldPrecision + 8 - x.e; + var localPrecision = 25 - x.e; + var maxIter = Math.max(Math.log(oldPrecision + 2) * 1.442695 | 0 + 5, 5); + Big.config({precision: localPrecision}); + + var i = 0; + var curr = new Big(Math.asin(x.toNumber()) + ''); + do { + var tmp0 = exports.cos_sin_sec_csc(curr, Big, 1, false); + var tmp1 = sinToCos(tmp0); + if (!tmp0.isZero()) { + tmp0.s = curr.s; + } + + var tmp2 = tmp0.minus(x).div(tmp1); + curr = curr.minus(tmp2); + + localPrecision = Math.min(2*localPrecision, maxp); + Big.config({precision: localPrecision}); + } while ((2*tmp2.e >= tolerance) && !tmp2.isZero() && (++i <= maxIter)) + + if (i == maxIter) { + throw new Error('asin() failed to converge to the requested accuracy.' + + 'Try with a higher precision.'); + } + + Big.config({precision: oldPrecision}); + return curr.toDP(oldPrecision - 1); + } + + /** + * Calculate the arc sine of x + * + * arcsin(x) = x + (1/2)*x^3/3 + (3/8)*x^5/5 + (15/48)*x^7/7 ... + * = x + (1/2)*x^2*x^1/3 + [(1*3)/(2*4)]*x^2*x^3/5 + [(1*3*5)/(2*4*6)]*x^2*x^5/7 ... + * + * @param {BigNumber} x + * @param {Number} precision + * @returns {BigNumber} arc sine of x + */ + function arcsin_taylor(x, precision) { + var Big = x.constructor; + Big.config({precision: precision + Math.log(precision) | 0 + 4}); + + var one = new Big(1); + var y = x; + var yPrev = NaN; + var x2 = x.times(x); + var polyNum = x; + var constNum = new Big(one); + var constDen = new Big(one); + + var bigK = new Big(one); + for (var k = 3; !y.equals(yPrev); k += 2) { + polyNum = polyNum.times(x2); + + constNum = constNum.times(bigK); + constDen = constDen.times(bigK.plus(one)); + + yPrev = y; + bigK = new Big(k); + y = y.plus(polyNum.times(constNum).div(bigK.times(constDen))); + } + + Big.config({precision: precision}); + return y.toDP(precision - 1); + } + + /** + * Calculate the arc tangent of x using a Taylor expansion + * + * arctan(x) = x - x^3/3 + x^5/5 - x^7/7 + x^9/9 - ... + * = x - x^2*x^1/3 + x^2*x^3/5 - x^2*x^5/7 + x^2*x^7/9 - ... + * + * @param {BigNumber} x + * @returns {BigNumber} arc tangent of x + */ + function arctan_taylor(x) { + var y = x; + var yPrev = NaN; + var x2 = x.times(x); + var num = x; + var add = true; + + for (var k = 3; !y.equals(yPrev); k += 2) { + num = num.times(x2); + + yPrev = y; + add = !add; + y = (add) ? y.plus(num.div(k)) : y.minus(num.div(k)); + } + + return y; + } + + /** + * Calculate the cosine or sine of x using Taylor Series. + * + * cos(x) = 1 - x^2/2! + x^4/4! - x^6/6! + x^8/8! - ... + * = 1 - 1*x^2/2! + x^2*x^2/4! - x^2*x^4/6! + x^2*x^6/8! - ... + * + * sin(x) = x - x^3/3! + x^5/5! - x^7/7! + x^9/9! - ... + * = x - x^2*x^1/3! + x^2*x^3/5! - x^2*x^5/7! + x^2*x^7/9! - ... + * + * @param {BigNumber} x reduced argument + * @param {Number} mode sine function if 1, cosine function if 0 + * @returns {BigNumber} sine or cosine of x + */ + function cos_sin_taylor(x, mode) { + var one = x.constructor.ONE; + + var y = x; + var yPrev = NaN; + var x2 = x.times(x); + var num = (mode) ? y : y = one; + var den = one; + var add = true; + + for (var k = mode; !y.equals(yPrev); k += 2) { + num = num.times(x2); + den = den.times(k+1).times(k+2); + + yPrev = y; + add = !add; + y = (add) ? y.plus(num.div(den)) : y.minus(num.div(den)); + } + + return y; + } + + /** + * Reduce x within a period of pi (0, pi] with guard digits. + * + * @param {BigNumber} x + * @param {Number} precision + * @param {Number} mode + * @returns {Array} [Reduced x, is tau multiple?] + */ + function reduceToPeriod(x, precision, mode) { + var pi = exports.pi(precision + 2); + var tau = exports.tau(precision); + if (x.abs().lte(pi.toDP(x.dp()))) { + return [x, false]; + } + + var Big = x.constructor; + // Catch if input is tau multiple using pi's precision + if (x.div(pi.toDP(x.dp())).toNumber() % 2 == 0) { + return [new Big(mode ^ 1), true]; + } + + var y = x.mod(tau); + + // Catch if tau multiple with tau's precision + if (y.toDP(x.dp(), 1).isZero()) { + return [new Big(mode ^ 1), true]; + } + + if (y.gt(pi)) { + if (mode) { + // sin(x + pi) = -sin(x) + y = y.minus(pi); + y.s = -y.s; + } else { + // cos(x) = cos(tau - x) + y = tau.minus(y); + } + } + + y.constructor = Big; + return [y, false]; + } + + /** + * Convert from sine to cosine + * + * |cos(x)| = sqrt(1 - sin(x)^2) + * + * @param {BigNumber} sine of x + * @returns {BigNumber} sine as cosine + */ + function sinToCos(sinVal) { + var Big = sinVal.constructor; + var precision = Big.precision; + Big.config({precision: precision + 2}); + + var ret = Big.ONE.minus(sinVal.times(sinVal)).sqrt(); + + Big.config({precision: precision}); + return ret.toDP(precision - 1); + } + + + /************************************ + * Format functions * + ************************************/ + + /** + * Convert a number to a formatted string representation. + * + * Syntax: + * + * format(value) + * format(value, options) + * format(value, precision) + * format(value, fn) + * + * Where: + * + * {Number} value The value to be formatted + * {Object} options An object with formatting options. Available options: + * {String} notation + * Number notation. Choose from: + * 'fixed' Always use regular number notation. + * For example '123.40' and '14000000' + * 'exponential' Always use exponential notation. + * For example '1.234e+2' and '1.4e+7' + * 'auto' (default) Regular number notation for numbers + * having an absolute value between + * `lower` and `upper` bounds, and uses + * exponential notation elsewhere. + * Lower bound is included, upper bound + * is excluded. + * For example '123.4' and '1.4e7'. + * {Number} precision A number between 0 and 16 to round + * the digits of the number. + * In case of notations 'exponential' and + * 'auto', `precision` defines the total + * number of significant digits returned + * and is undefined by default. + * In case of notation 'fixed', + * `precision` defines the number of + * significant digits after the decimal + * point, and is 0 by default. + * {Object} exponential An object containing two parameters, + * {Number} lower and {Number} upper, + * used by notation 'auto' to determine + * when to return exponential notation. + * Default values are `lower=1e-3` and + * `upper=1e5`. + * Only applicable for notation `auto`. + * {Function} fn A custom formatting function. Can be used to override the + * built-in notations. Function `fn` is called with `value` as + * parameter and must return a string. Is useful for example to + * format all values inside a matrix in a particular way. + * + * Examples: + * + * format(6.4); // '6.4' + * format(1240000); // '1.24e6' + * format(1/3); // '0.3333333333333333' + * format(1/3, 3); // '0.333' + * format(21385, 2); // '21000' + * format(12.071, {notation: 'fixed'}); // '12' + * format(2.3, {notation: 'fixed', precision: 2}); // '2.30' + * format(52.8, {notation: 'exponential'}); // '5.28e+1' + * + * @param {BigNumber} value + * @param {Object | Function | Number} [options] + * @return {String} str The formatted value + */ + exports.format = function(value, options) { + if (typeof options === 'function') { + // handle format(value, fn) + return options(value); + } + + // handle special cases + if (!value.isFinite()) { + return value.isNaN() ? 'NaN' : (value.gt(0) ? 'Infinity' : '-Infinity'); + } + + // default values for options + var notation = 'auto'; + var precision = undefined; + + if (options !== undefined) { + // determine notation from options + if (options.notation) { + notation = options.notation; + } + + // determine precision from options + if (isNumber(options)) { + precision = options; + } + else if (options.precision) { + precision = options.precision; + } + } + + // handle the various notations + switch (notation) { + case 'fixed': + return exports.toFixed(value, precision); + + case 'exponential': + return exports.toExponential(value, precision); + + case 'auto': + // determine lower and upper bound for exponential notation. + // TODO: implement support for upper and lower to be BigNumbers themselves + var lower = 1e-3; + var upper = 1e5; + if (options && options.exponential) { + if (options.exponential.lower !== undefined) { + lower = options.exponential.lower; + } + if (options.exponential.upper !== undefined) { + upper = options.exponential.upper; + } + } + + // adjust the configuration of the BigNumber constructor (yeah, this is quite tricky...) + var oldConfig = { + toExpNeg: value.constructor.toExpNeg, + toExpPos: value.constructor.toExpPos + }; + + value.constructor.config({ + toExpNeg: Math.round(Math.log(lower) / Math.LN10), + toExpPos: Math.round(Math.log(upper) / Math.LN10) + }); + + // handle special case zero + if (value.isZero()) return '0'; + + // determine whether or not to output exponential notation + var str; + var abs = value.abs(); + if (abs.gte(lower) && abs.lt(upper)) { + // normal number notation + str = value.toSignificantDigits(precision).toFixed(); + } + else { + // exponential notation + str = exports.toExponential(value, precision); + } + + // remove trailing zeros after the decimal point + return str.replace(/((\.\d*?)(0+))($|e)/, function () { + var digits = arguments[2]; + var e = arguments[4]; + return (digits !== '.') ? digits + e : e; + }); + + default: + throw new Error('Unknown notation "' + notation + '". ' + + 'Choose "auto", "exponential", or "fixed".'); + } + }; + + /** + * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3' + * @param {BigNumber} value + * @param {Number} [precision] Number of digits in formatted output. + * If not provided, the maximum available digits + * is used. + * @returns {string} str + */ + exports.toExponential = function(value, precision) { + if (precision !== undefined) { + return value.toExponential(precision - 1); // Note the offset of one + } + else { + return value.toExponential(); + } + }; + + /** + * Format a number with fixed notation. + * @param {BigNumber} value + * @param {Number} [precision=0] Optional number of decimals after the + * decimal point. Zero by default. + */ + exports.toFixed = function(value, precision) { + return value.toFixed(precision || 0); + // Note: the (precision || 0) is needed as the toFixed of BigNumber has an + // undefined default precision instead of 0. + }; /***/ }, /* 215 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'fix', - 'category': 'Arithmetic', - 'syntax': [ - 'fix(x)' - ], - 'description': - 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.', - 'examples': [ - 'fix(3.2)', - 'fix(3.8)', - 'fix(-4.2)', - 'fix(-4.8)' - ], - 'seealso': ['ceil', 'floor', 'round'] - }; + 'use strict'; + + var ArgumentsError = __webpack_require__(177); + + // TODO: rethink math.distribution + // TODO: rework to a typed function + function factory (type, config, load, typed) { + var collection = load(__webpack_require__(2)); + var matrix = load(__webpack_require__(75)); + var array = __webpack_require__(172); + + var isCollection = collection.isCollection; + + /** + * Create a distribution object with a set of random functions for given + * random distribution. + * + * Syntax: + * + * math.distribution(name) + * + * Examples: + * + * var normalDist = math.distribution('normal'); // create a normal distribution + * normalDist.random(0, 10); // get a random value between 0 and 10 + * + * See also: + * + * random, randomInt, pickRandom + * + * @param {String} name Name of a distribution. Choose from 'uniform', 'normal'. + * @return {Object} Returns a distribution object containing functions: + * `random([size] [, min] [, max])`, + * `randomInt([min] [, max])`, + * `pickRandom(array)` + */ + function distribution(name) { + if (!distributions.hasOwnProperty(name)) + throw new Error('Unknown distribution ' + name); + + var args = Array.prototype.slice.call(arguments, 1), + distribution = distributions[name].apply(this, args); + + return (function(distribution) { + + // This is the public API for all distributions + var randFunctions = { + + random: function(arg1, arg2, arg3) { + var size, min, max; + if (arguments.length > 3) { + throw new ArgumentsError('random', arguments.length, 0, 3); + + // `random(max)` or `random(size)` + } else if (arguments.length === 1) { + if (isCollection(arg1)) { + size = arg1; + } + else { + max = arg1; + } + // `random(min, max)` or `random(size, max)` + } else if (arguments.length === 2) { + if (isCollection(arg1)) { + size = arg1; + max = arg2; + } + else { + min = arg1; + max = arg2; + } + // `random(size, min, max)` + } else { + size = arg1; + min = arg2; + max = arg3; + } + + // TODO: validate type of min, max, and size + + if (max === undefined) max = 1; + if (min === undefined) min = 0; + if (size !== undefined) { + var res = _randomDataForMatrix(size.valueOf(), min, max, _random); + return (size instanceof type.Matrix) ? matrix(res) : res; + } + else return _random(min, max); + }, + + randomInt: function(arg1, arg2, arg3) { + var size, min, max; + if (arguments.length > 3 || arguments.length < 1) + throw new ArgumentsError('randomInt', arguments.length, 1, 3); + + // `random(max)` or `random(size)` + else if (arguments.length === 1) + if (isCollection(arg1)) { + size = arg1; + } + else { + max = arg1; + } + // `randomInt(min, max)` or `randomInt(size, max)` + else if (arguments.length === 2) { + if (isCollection(arg1)) { + size = arg1; + max = arg2; + } + else { + min = arg1; + max = arg2; + } + // `randomInt(size, min, max)` + } else { + size = arg1; + min = arg2; + max = arg3; + } + + // TODO: validate type of min, max, and size + + if (min === undefined) min = 0; + if (size !== undefined) { + var res = _randomDataForMatrix(size.valueOf(), min, max, _randomInt); + return (size instanceof type.Matrix) ? matrix(res) : res; + } + else return _randomInt(min, max); + }, + + pickRandom: function(possibles) { + if (arguments.length !== 1) { + throw new ArgumentsError('pickRandom', arguments.length, 1); + } + if (possibles instanceof type.Matrix) { + possibles = possibles.valueOf(); // get Array + } + else if (!Array.isArray(possibles)) { + throw new TypeError('Unsupported type of value in function pickRandom'); + } + + if (array.size(possibles).length > 1) { + throw new Error('Only one dimensional vectors supported'); + } + + // TODO: add support for multi dimensional matrices + return possibles[Math.floor(Math.random() * possibles.length)]; + } + + }; + + var _random = function(min, max) { + return min + distribution() * (max - min); + }; + + var _randomInt = function(min, max) { + return Math.floor(min + distribution() * (max - min)); + }; + + // This is a function for generating a random matrix recursively. + var _randomDataForMatrix = function(size, min, max, randFunc) { + var data = [], length, i; + size = size.slice(0); + + if (size.length > 1) { + for (i = 0, length = size.shift(); i < length; i++) + data.push(_randomDataForMatrix(size, min, max, randFunc)); + } else { + for (i = 0, length = size.shift(); i < length; i++) + data.push(randFunc(min, max)); + } + + return data; + }; + + return randFunctions; + + })(distribution); + } + + // Each distribution is a function that takes no argument and when called returns + // a number between 0 and 1. + var distributions = { + + uniform: function() { + return Math.random; + }, + + // Implementation of normal distribution using Box-Muller transform + // ref : http://en.wikipedia.org/wiki/Box%E2%80%93Muller_transform + // We take : mean = 0.5, standard deviation = 1/6 + // so that 99.7% values are in [0, 1]. + normal: function() { + return function() { + var u1, u2, + picked = -1; + // We reject values outside of the interval [0, 1] + // TODO: check if it is ok to do that? + while (picked < 0 || picked > 1) { + u1 = Math.random(); + u2 = Math.random(); + picked = 1/6 * Math.pow(-2 * Math.log(u1), 0.5) * Math.cos(2 * Math.PI * u2) + 0.5; + } + return picked; + } + } + }; + + return distribution; + } + + exports.name = 'distribution'; + exports.factory = factory; /***/ }, /* 216 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'floor', - 'category': 'Arithmetic', - 'syntax': [ - 'floor(x)' - ], - 'description': - 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.', - 'examples': [ - 'floor(3.2)', - 'floor(3.8)', - 'floor(-4.2)' - ], - 'seealso': ['ceil', 'fix', 'round'] - }; + 'use strict'; + + /** + * Determine the type of a variable + * + * type(x) + * + * @param {*} x + * @return {String} type Lower case type, for example 'number', 'string', + * 'array', 'date'. + */ + exports.type = function(x) { + var type = typeof x; + + if (type === 'object') { + if (x === null) return 'null'; + if (x instanceof Boolean) return 'boolean'; + if (x instanceof Number) return 'number'; + if (x instanceof String) return 'string'; + if (Array.isArray(x)) return 'array'; + if (x instanceof Date) return 'date'; + if (x instanceof Function)return 'function'; + if (x instanceof RegExp) return 'regexp'; + } + + return type; + }; /***/ }, /* 217 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'gcd', - 'category': 'Arithmetic', - 'syntax': [ - 'gcd(a, b)', - 'gcd(a, b, c, ...)' - ], - 'description': 'Compute the greatest common divisor.', - 'examples': [ - 'gcd(8, 12)', - 'gcd(-4, 6)', - 'gcd(25, 15, -10)' - ], - 'seealso': [ 'lcm', 'xgcd' ] - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var divideScalar = load(__webpack_require__(213)); + var multiply = load(__webpack_require__(47)); + var subtract = load(__webpack_require__(55)); + var equal = load(__webpack_require__(115)); + + var substitutionValidation = load(__webpack_require__(355)); + + var SparseMatrix = type.SparseMatrix; + var DenseMatrix = type.DenseMatrix; + + /** + * Solves the linear equation system by backward substitution. Matrix must be an upper triangular matrix. + * + * M * x = b + * + * @param {Matrix, Array} A N x N matrix or array + * @param {Matrix, Array} A column vector with the b values + * + * @return {Matrix} A column vector with the linear system solution + */ + var backwardSubstitution = typed('backwardSubstitution', { + 'Matrix, Array | Matrix': function (m, b) { + // process matrix storage format + switch (m.storage()) { + case 'dense': + return _denseBackwardSubstitution(m, b); + case 'sparse': + return _sparseBackwardSubstitution(m, b); + } + }, + 'Array, Array | Matrix': function (a, b) { + // create dense matrix from array + var m = matrix(a); + // use matrix implementation + var r = backwardSubstitution(m, b); + // result + return r.valueOf(); + } + }); + + var _denseBackwardSubstitution = function (m, b) { + // validate matrix and vector, return copy of column vector b + b = substitutionValidation(m, b); + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // result + var x = new Array(rows); + // arrays + var data = m._data; + // backward solve m * x = b, loop columns (backwards) + for (var j = columns - 1; j >= 0 ; j--) { + // b[j] + var bj = b[j] || 0; + // x[j] + var xj; + // backward substitution (outer product) avoids inner looping when bj == 0 + if (!equal(bj, 0)) { + // value @ [j, j] + var vjj = data[j][j]; + // check vjj + if (equal(vjj, 0)) { + // system cannot be solved + throw new Error('Linear system cannot be solved since matrix is singular'); + } + // calculate xj + xj = divideScalar(bj, vjj); + // loop rows + for (var i = j - 1; i >= 0; i--) { + // update copy of b + b[i] = subtract(b[i] || 0, multiply(xj, data[i][j])); + } + } + else { + // zero value @ j + xj = 0; + } + // update x + x[j] = [xj]; + } + // return column vector + return new DenseMatrix({ + data: x, + size: [rows, 1] + }); + }; + + var _sparseBackwardSubstitution = function (m, b) { + // validate matrix and vector, return copy of column vector b + b = substitutionValidation(m, b); + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // matrix arrays + var values = m._values; + var index = m._index; + var ptr = m._ptr; + // result arrays + var xvalues = []; + var xindex = []; + var xptr = []; + // vars + var i, k; + // init ptr + xptr.push(0); + // backward solve m * x = b, loop columns (backwards) + for (var j = columns - 1; j >= 0 ; j--) { + // b[j] + var bj = b[j] || 0; + // backward substitution (outer product) avoids inner looping when bj == 0 + if (!equal(bj, 0)) { + // value @ [j, j] + var vjj = 0; + // first & last indeces in column + var f = ptr[j]; + var l = ptr[j + 1]; + // values in column, find value @ [j, j], loop backwards + for (k = l - 1; k >= f; k--) { + // row + i = index[k]; + // check row + if (i === j) { + // update vjj + vjj = values[k]; + } + else if (i < j) { + // exit loop + break; + } + } + // at this point we must have a value @ [j, j] + if (equal(vjj, 0)) { + // system cannot be solved, there is no value @ [j, j] + throw new Error('Linear system cannot be solved since matrix is singular'); + } + // calculate xj + var xj = divideScalar(bj, vjj); + // values in column, continue from last loop + for (; k >= f; k--) { + // row + i = index[k]; + // update copy of b + b[i] = subtract(b[i] || 0, multiply(xj, values[k])); + } + // check for non zero + if (!equal(xj, 0)) { + // push to values (at the beginning since we are looping backwards) + xvalues.unshift(xj); + // row + xindex.unshift(j); + } + } + } + // update ptr + xptr.push(xvalues.length); + // return column vector + return new SparseMatrix({ + values: xvalues, + index: xindex, + ptr: xptr, + size: [rows, 1] + }); + }; + + return backwardSubstitution; + } + + exports.name = 'backwardSubstitution'; + exports.factory = factory; /***/ }, /* 218 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'lcm', - 'category': 'Arithmetic', - 'syntax': [ - 'lcm(x, y)' - ], - 'description': 'Compute the least common multiple.', - 'examples': [ - 'lcm(4, 6)', - 'lcm(6, 21)', - 'lcm(6, 21, 5)' - ], - 'seealso': [ 'gcd' ] - }; + 'use strict'; + + function factory (type, config, load, typed) { + + var matrix = load(__webpack_require__(75)); + var divideScalar = load(__webpack_require__(213)); + var multiply = load(__webpack_require__(47)); + var subtract = load(__webpack_require__(55)); + var equal = load(__webpack_require__(115)); + + var substitutionValidation = load(__webpack_require__(355)); + + var SparseMatrix = type.SparseMatrix; + var DenseMatrix = type.DenseMatrix; + + /** + * Solves the linear equation system by forwards substitution. Matrix must be a lower triangular matrix. + * + * M * x = b + * + * @param {Matrix, Array} A N x N matrix or array + * @param {Matrix, Array} A column vector with the b values + * + * @return {Matrix} A column vector with the linear system solution + */ + var forwardSubstitution = typed('forwardSubstitution', { + 'Matrix, Array | Matrix': function (m, b) { + // process matrix storage format + switch (m.storage()) { + case 'dense': + return _denseForwardSubstitution(m, b); + case 'sparse': + return _sparseForwardSubstitution(m, b); + } + }, + 'Array, Array | Matrix': function (a, b) { + // create dense matrix from array + var m = matrix(a); + // use matrix implementation + var r = forwardSubstitution(m, b); + // result + return r.valueOf(); + } + }); + + var _denseForwardSubstitution = function (m, b) { + // validate matrix and vector, return copy of column vector b + b = substitutionValidation(m, b); + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // result + var x = new Array(rows); + // data + var data = m._data; + // forward solve m * x = b, loop columns + for (var j = 0; j < columns; j++) { + // b[j] + var bj = b[j] || 0; + // x[j] + var xj; + // forward substitution (outer product) avoids inner looping when bj == 0 + if (!equal(bj, 0)) { + // value @ [j, j] + var vjj = data[j][j]; + // check vjj + if (equal(vjj, 0)) { + // system cannot be solved + throw new Error('Linear system cannot be solved since matrix is singular'); + } + // calculate xj + xj = divideScalar(bj, vjj); + // loop rows + for (var i = j + 1; i < rows; i++) { + // update copy of b + b[i] = subtract(b[i] || 0, multiply(xj, data[i][j])); + } + } + else { + // zero @ j + xj = 0; + } + // update x + x[j] = [xj]; + } + // return vector + return new DenseMatrix({ + data: x, + size: [rows, 1] + }); + }; + + var _sparseForwardSubstitution = function (m, b) { + // validate matrix and vector, return copy of column vector b + b = substitutionValidation(m, b); + // rows & columns + var rows = m._size[0]; + var columns = m._size[1]; + // matrix arrays + var values = m._values; + var index = m._index; + var ptr = m._ptr; + // result arrays + var xvalues = []; + var xindex = []; + var xptr = []; + // vars + var i, k; + // init ptr + xptr.push(0); + // forward solve m * x = b, loop columns + for (var j = 0; j < columns; j++) { + // b[j] + var bj = b[j] || 0; + // forward substitution (outer product) avoids inner looping when bj == 0 + if (!equal(bj, 0)) { + // value @ [j, j] + var vjj = 0; + // last index in column + var l = ptr[j + 1]; + // values in column, find value @ [j, j] + for (k = ptr[j]; k < l; k++) { + // row + i = index[k]; + // check row + if (i === j) { + // update vjj + vjj = values[k]; + } + else if (i > j) { + // exit loop + break; + } + } + // at this point we must have a value @ [j, j] + if (equal(vjj, 0)) { + // system cannot be solved, there is no value @ [j, j] + throw new Error('Linear system cannot be solved since matrix is singular'); + } + // calculate xj + var xj = divideScalar(bj, vjj); + // values in column, continue from last loop + for (; k < l; k++) { + // row + i = index[k]; + // update copy of b + b[i] = subtract(b[i] || 0, multiply(xj, values[k])); + } + // check for non zero + if (!equal(xj, 0)) { + // value @ row i + xvalues.push(xj); + // row + xindex.push(j); + } + } + } + // update ptr + xptr.push(xvalues.length); + // return column vector + return new SparseMatrix({ + values: xvalues, + index: xindex, + ptr: xptr, + size: [rows, 1] + }); + }; + + return forwardSubstitution; + } + + exports.name = 'forwardSubstitution'; + exports.factory = factory; /***/ }, /* 219 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'log', - 'category': 'Arithmetic', - 'syntax': [ - 'log(x)', - 'log(x, base)' - ], - 'description': 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).', - 'examples': [ - 'log(3.5)', - 'a = log(2.4)', - 'exp(a)', - '10 ^ 4', - 'log(10000, 10)', - 'log(10000) / log(10)', - 'b = log(1024, 2)', - '2 ^ b' - ], - 'seealso': [ - 'exp', - 'log10' - ] - }; + module.exports = { + 'name': 'abs', + 'category': 'Arithmetic', + 'syntax': [ + 'abs(x)' + ], + 'description': 'Compute the absolute value.', + 'examples': [ + 'abs(3.5)', + 'abs(-4.2)' + ], + 'seealso': ['sign'] + }; + /***/ }, /* 220 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'log10', - 'category': 'Arithmetic', - 'syntax': [ - 'log10(x)' - ], - 'description': 'Compute the 10-base logarithm of a value.', - 'examples': [ - 'log10(0.00001)', - 'log10(10000)', - '10 ^ 4', - 'log(10000) / log(10)', - 'log(10000, 10)' - ], - 'seealso': [ - 'exp', - 'log' - ] - }; + module.exports = { + 'name': 'add', + 'category': 'Operators', + 'syntax': [ + 'x + y', + 'add(x, y)' + ], + 'description': 'Add two values.', + 'examples': [ + 'a = 2.1 + 3.6', + 'a - 3.6', + '3 + 2i', + '"hello" + " world"', + '3 cm + 2 inch' + ], + 'seealso': [ + 'subtract' + ] + }; /***/ }, /* 221 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'mod', - 'category': 'Operators', - 'syntax': [ - 'x % y', - 'x mod y', - 'mod(x, y)' - ], - 'description': - 'Calculates the modulus, the remainder of an integer division.', - 'examples': [ - '7 % 3', - '11 % 2', - '10 mod 4', - 'function isOdd(x) = x % 2', - 'isOdd(2)', - 'isOdd(3)' - ], - 'seealso': ['divide'] - }; + module.exports = { + 'name': 'ceil', + 'category': 'Arithmetic', + 'syntax': [ + 'ceil(x)' + ], + 'description': + 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.', + 'examples': [ + 'ceil(3.2)', + 'ceil(3.8)', + 'ceil(-4.2)' + ], + 'seealso': ['floor', 'fix', 'round'] + }; /***/ }, /* 222 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'multiply', - 'category': 'Operators', - 'syntax': [ - 'x * y', - 'multiply(x, y)' - ], - 'description': 'multiply two values.', - 'examples': [ - 'a = 2.1 * 3.4', - 'a / 3.4', - '2 * 3 + 4', - '2 * (3 + 4)', - '3 * 2.1 km' - ], - 'seealso': [ - 'divide' - ] - }; + module.exports = { + 'name': 'cube', + 'category': 'Arithmetic', + 'syntax': [ + 'cube(x)' + ], + 'description': 'Compute the cube of a value. The cube of x is x * x * x.', + 'examples': [ + 'cube(2)', + '2^3', + '2 * 2 * 2' + ], + 'seealso': [ + 'multiply', + 'square', + 'pow' + ] + }; /***/ }, /* 223 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'norm', - 'category': 'Arithmetic', - 'syntax': [ - 'norm(x)', - 'norm(x, p)' - ], - 'description': 'Calculate the norm of a number, vector or matrix.', - 'examples': [ - 'abs(-3.5)', - 'norm(-3.5)', - 'norm(3 - 4i))', - 'norm([1, 2, -3], Infinity)', - 'norm([1, 2, -3], -Infinity)', - 'norm([3, 4], 2)', - 'norm([[1, 2], [3, 4]], 1)', - 'norm([[1, 2], [3, 4]], \'inf\')', - 'norm([[1, 2], [3, 4]], \'fro\')' - ] - }; + module.exports = { + 'name': 'divide', + 'category': 'Operators', + 'syntax': [ + 'x / y', + 'divide(x, y)' + ], + 'description': 'Divide two values.', + 'examples': [ + 'a = 2 / 3', + 'a * 3', + '4.5 / 2', + '3 + 4 / 2', + '(3 + 4) / 2', + '18 km / 4.5' + ], + 'seealso': [ + 'multiply' + ] + }; /***/ }, /* 224 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'nthRoot', - 'category': 'Arithmetic', - 'syntax': [ - 'nthRoot(a)', - 'nthRoot(a, root)' - ], - 'description': 'Calculate the nth root of a value. ' + - 'The principal nth root of a positive real number A, ' + - 'is the positive real solution of the equation "x^root = A".', - 'examples': [ - '4 ^ 3', - 'nthRoot(64, 3)', - 'nthRoot(9, 2)', - 'sqrt(9)' - ], - 'seealso': [ - 'sqrt', - 'pow' - ] - }; + module.exports = { + 'name': 'dotDivide', + 'category': 'Operators', + 'syntax': [ + 'x ./ y', + 'dotDivide(x, y)' + ], + 'description': 'Divide two values element wise.', + 'examples': [ + 'a = [1, 2, 3; 4, 5, 6]', + 'b = [2, 1, 1; 3, 2, 5]', + 'a ./ b' + ], + 'seealso': [ + 'multiply', + 'dotMultiply', + 'divide' + ] + }; + /***/ }, /* 225 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'pow', - 'category': 'Operators', - 'syntax': [ - 'x ^ y', - 'pow(x, y)' - ], - 'description': - 'Calculates the power of x to y, x^y.', - 'examples': [ - '2^3 = 8', - '2*2*2', - '1 + e ^ (pi * i)' - ], - 'seealso': [ 'multiply' ] - }; + module.exports = { + 'name': 'dotMultiply', + 'category': 'Operators', + 'syntax': [ + 'x .* y', + 'dotMultiply(x, y)' + ], + 'description': 'Multiply two values element wise.', + 'examples': [ + 'a = [1, 2, 3; 4, 5, 6]', + 'b = [2, 1, 1; 3, 2, 5]', + 'a .* b' + ], + 'seealso': [ + 'multiply', + 'divide', + 'dotDivide' + ] + }; /***/ }, /* 226 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'round', - 'category': 'Arithmetic', - 'syntax': [ - 'round(x)', - 'round(x, n)' - ], - 'description': - 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.', - 'examples': [ - 'round(3.2)', - 'round(3.8)', - 'round(-4.2)', - 'round(-4.8)', - 'round(pi, 3)', - 'round(123.45678, 2)' - ], - 'seealso': ['ceil', 'floor', 'fix'] - }; + module.exports = { + 'name': 'dotpow', + 'category': 'Operators', + 'syntax': [ + 'x .^ y', + 'dotpow(x, y)' + ], + 'description': + 'Calculates the power of x to y element wise.', + 'examples': [ + 'a = [1, 2, 3; 4, 5, 6]', + 'a .^ 2' + ], + 'seealso': [ + 'pow' + ] + }; /***/ }, /* 227 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sign', - 'category': 'Arithmetic', - 'syntax': [ - 'sign(x)' - ], - 'description': - 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.', - 'examples': [ - 'sign(3.5)', - 'sign(-4.2)', - 'sign(0)' - ], - 'seealso': [ - 'abs' - ] - }; + module.exports = { + 'name': 'exp', + 'category': 'Arithmetic', + 'syntax': [ + 'exp(x)' + ], + 'description': 'Calculate the exponent of a value.', + 'examples': [ + 'exp(1.3)', + 'e ^ 1.3', + 'log(exp(1.3))', + 'x = 2.4', + '(exp(i*x) == cos(x) + i*sin(x)) # Euler\'s formula' + ], + 'seealso': [ + 'pow', + 'log' + ] + }; /***/ }, /* 228 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sqrt', - 'category': 'Arithmetic', - 'syntax': [ - 'sqrt(x)' - ], - 'description': - 'Compute the square root value. If x = y * y, then y is the square root of x.', - 'examples': [ - 'sqrt(25)', - '5 * 5', - 'sqrt(-1)' - ], - 'seealso': [ - 'square', - 'multiply' - ] - }; + module.exports = { + 'name': 'fix', + 'category': 'Arithmetic', + 'syntax': [ + 'fix(x)' + ], + 'description': + 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.', + 'examples': [ + 'fix(3.2)', + 'fix(3.8)', + 'fix(-4.2)', + 'fix(-4.8)' + ], + 'seealso': ['ceil', 'floor', 'round'] + }; /***/ }, /* 229 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'square', - 'category': 'Arithmetic', - 'syntax': [ - 'square(x)' - ], - 'description': - 'Compute the square of a value. The square of x is x * x.', - 'examples': [ - 'square(3)', - 'sqrt(9)', - '3^2', - '3 * 3' - ], - 'seealso': [ - 'multiply', - 'pow', - 'sqrt', - 'cube' - ] - }; + module.exports = { + 'name': 'floor', + 'category': 'Arithmetic', + 'syntax': [ + 'floor(x)' + ], + 'description': + 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.', + 'examples': [ + 'floor(3.2)', + 'floor(3.8)', + 'floor(-4.2)' + ], + 'seealso': ['ceil', 'fix', 'round'] + }; /***/ }, /* 230 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'subtract', - 'category': 'Operators', - 'syntax': [ - 'x - y', - 'subtract(x, y)' - ], - 'description': 'subtract two values.', - 'examples': [ - 'a = 5.3 - 2', - 'a + 2', - '2/3 - 1/6', - '2 * 3 - 3', - '2.1 km - 500m' - ], - 'seealso': [ - 'add' - ] - }; + module.exports = { + 'name': 'gcd', + 'category': 'Arithmetic', + 'syntax': [ + 'gcd(a, b)', + 'gcd(a, b, c, ...)' + ], + 'description': 'Compute the greatest common divisor.', + 'examples': [ + 'gcd(8, 12)', + 'gcd(-4, 6)', + 'gcd(25, 15, -10)' + ], + 'seealso': [ 'lcm', 'xgcd' ] + }; /***/ }, /* 231 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'unaryMinus', - 'category': 'Operators', - 'syntax': [ - '-x', - 'unaryMinus(x)' - ], - 'description': - 'Inverse the sign of a value. Converts booleans and strings to numbers.', - 'examples': [ - '-4.5', - '-(-5.6)', - '-"22"' - ], - 'seealso': [ - 'add', 'subtract', 'unaryPlus' - ] - }; + module.exports = { + 'name': 'lcm', + 'category': 'Arithmetic', + 'syntax': [ + 'lcm(x, y)' + ], + 'description': 'Compute the least common multiple.', + 'examples': [ + 'lcm(4, 6)', + 'lcm(6, 21)', + 'lcm(6, 21, 5)' + ], + 'seealso': [ 'gcd' ] + }; /***/ }, /* 232 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'unaryPlus', - 'category': 'Operators', - 'syntax': [ - '+x', - 'unaryPlus(x)' - ], - 'description': - 'Converts booleans and strings to numbers.', - 'examples': [ - '+true', - '+"2"' - ], - 'seealso': [ - 'add', 'subtract', 'unaryMinus' - ] + module.exports = { + 'name': 'log', + 'category': 'Arithmetic', + 'syntax': [ + 'log(x)', + 'log(x, base)' + ], + 'description': 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).', + 'examples': [ + 'log(3.5)', + 'a = log(2.4)', + 'exp(a)', + '10 ^ 4', + 'log(10000, 10)', + 'log(10000) / log(10)', + 'b = log(1024, 2)', + '2 ^ b' + ], + 'seealso': [ + 'exp', + 'log10' + ] }; - /***/ }, /* 233 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'xgcd', - 'category': 'Arithmetic', - 'syntax': [ - 'xgcd(a, b)' - ], - 'description': 'Calculate the extended greatest common divisor for two values', - 'examples': [ - 'xgcd(8, 12)', - 'gcd(8, 12)', - 'xgcd(36163, 21199)' - ], - 'seealso': [ 'gcd', 'lcm' ] - }; + module.exports = { + 'name': 'log10', + 'category': 'Arithmetic', + 'syntax': [ + 'log10(x)' + ], + 'description': 'Compute the 10-base logarithm of a value.', + 'examples': [ + 'log10(0.00001)', + 'log10(10000)', + '10 ^ 4', + 'log(10000) / log(10)', + 'log(10000, 10)' + ], + 'seealso': [ + 'exp', + 'log' + ] + }; /***/ }, /* 234 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'bitAnd', - 'category': 'Bitwise', - 'syntax': [ - 'x & y', - 'bitAnd(x, y)' - ], - 'description': 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0', - 'examples': [ - '5 & 3', - 'bitAnd(53, 131)', - '[1, 12, 31] & 42' - ], - 'seealso': [ - 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' - ] - }; + module.exports = { + 'name': 'mod', + 'category': 'Operators', + 'syntax': [ + 'x % y', + 'x mod y', + 'mod(x, y)' + ], + 'description': + 'Calculates the modulus, the remainder of an integer division.', + 'examples': [ + '7 % 3', + '11 % 2', + '10 mod 4', + 'function isOdd(x) = x % 2', + 'isOdd(2)', + 'isOdd(3)' + ], + 'seealso': ['divide'] + }; /***/ }, /* 235 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'bitNot', - 'category': 'Bitwise', - 'syntax': [ - '~x', - 'bitNot(x)' - ], - 'description': 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.', - 'examples': [ - '~1', - '~2', - 'bitNot([2, -3, 4])' - ], - 'seealso': [ - 'bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' - ] - }; + module.exports = { + 'name': 'multiply', + 'category': 'Operators', + 'syntax': [ + 'x * y', + 'multiply(x, y)' + ], + 'description': 'multiply two values.', + 'examples': [ + 'a = 2.1 * 3.4', + 'a / 3.4', + '2 * 3 + 4', + '2 * (3 + 4)', + '3 * 2.1 km' + ], + 'seealso': [ + 'divide' + ] + }; /***/ }, /* 236 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'bitOr', - 'category': 'Bitwise', - 'syntax': [ - 'x | y', - 'bitOr(x, y)' - ], - 'description': 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.', - 'examples': [ - '5 | 3', - 'bitOr([1, 2, 3], 4)' - ], - 'seealso': [ - 'bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' - ] - }; + module.exports = { + 'name': 'norm', + 'category': 'Arithmetic', + 'syntax': [ + 'norm(x)', + 'norm(x, p)' + ], + 'description': 'Calculate the norm of a number, vector or matrix.', + 'examples': [ + 'abs(-3.5)', + 'norm(-3.5)', + 'norm(3 - 4i))', + 'norm([1, 2, -3], Infinity)', + 'norm([1, 2, -3], -Infinity)', + 'norm([3, 4], 2)', + 'norm([[1, 2], [3, 4]], 1)', + 'norm([[1, 2], [3, 4]], \'inf\')', + 'norm([[1, 2], [3, 4]], \'fro\')' + ] + }; /***/ }, /* 237 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'bitXor', - 'category': 'Bitwise', - 'syntax': [ - 'bitXor(x, y)' - ], - 'description': 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.', - 'examples': [ - 'bitOr(1, 2)', - 'bitXor([2, 3, 4], 4)' - ], - 'seealso': [ - 'bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift' - ] + module.exports = { + 'name': 'nthRoot', + 'category': 'Arithmetic', + 'syntax': [ + 'nthRoot(a)', + 'nthRoot(a, root)' + ], + 'description': 'Calculate the nth root of a value. ' + + 'The principal nth root of a positive real number A, ' + + 'is the positive real solution of the equation "x^root = A".', + 'examples': [ + '4 ^ 3', + 'nthRoot(64, 3)', + 'nthRoot(9, 2)', + 'sqrt(9)' + ], + 'seealso': [ + 'sqrt', + 'pow' + ] }; - /***/ }, /* 238 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'leftShift', - 'category': 'Bitwise', - 'syntax': [ - 'x << y', - 'leftShift(x, y)' - ], - 'description': 'Bitwise left logical shift of a value x by y number of bits.', - 'examples': [ - '4 << 1', - '8 >> 1' - ], - 'seealso': [ - 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift' - ] - }; + module.exports = { + 'name': 'pow', + 'category': 'Operators', + 'syntax': [ + 'x ^ y', + 'pow(x, y)' + ], + 'description': + 'Calculates the power of x to y, x^y.', + 'examples': [ + '2^3 = 8', + '2*2*2', + '1 + e ^ (pi * i)' + ], + 'seealso': [ 'multiply' ] + }; /***/ }, /* 239 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'rightArithShift', - 'category': 'Bitwise', - 'syntax': [ - 'x >> y', - 'leftShift(x, y)' - ], - 'description': 'Bitwise right arithmetic shift of a value x by y number of bits.', - 'examples': [ - '8 >> 1', - '4 << 1', - '-12 >> 2' - ], - 'seealso': [ - 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift' - ] - }; + module.exports = { + 'name': 'round', + 'category': 'Arithmetic', + 'syntax': [ + 'round(x)', + 'round(x, n)' + ], + 'description': + 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.', + 'examples': [ + 'round(3.2)', + 'round(3.8)', + 'round(-4.2)', + 'round(-4.8)', + 'round(pi, 3)', + 'round(123.45678, 2)' + ], + 'seealso': ['ceil', 'floor', 'fix'] + }; /***/ }, /* 240 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'rightLogShift', - 'category': 'Bitwise', - 'syntax': [ - 'x >> y', - 'leftShift(x, y)' - ], - 'description': 'Bitwise right logical shift of a value x by y number of bits.', - 'examples': [ - '8 >>> 1', - '4 << 1', - '-12 >>> 2' - ], - 'seealso': [ - 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift' - ] - }; + module.exports = { + 'name': 'sign', + 'category': 'Arithmetic', + 'syntax': [ + 'sign(x)' + ], + 'description': + 'Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.', + 'examples': [ + 'sign(3.5)', + 'sign(-4.2)', + 'sign(0)' + ], + 'seealso': [ + 'abs' + ] + }; /***/ }, /* 241 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'arg', - 'category': 'Complex', - 'syntax': [ - 'arg(x)' - ], - 'description': - 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).', - 'examples': [ - 'arg(2 + 2i)', - 'atan2(3, 2)', - 'arg(2 + 3i)' - ], - 'seealso': [ - 're', - 'im', - 'conj', - 'abs' - ] - }; + module.exports = { + 'name': 'sqrt', + 'category': 'Arithmetic', + 'syntax': [ + 'sqrt(x)' + ], + 'description': + 'Compute the square root value. If x = y * y, then y is the square root of x.', + 'examples': [ + 'sqrt(25)', + '5 * 5', + 'sqrt(-1)' + ], + 'seealso': [ + 'square', + 'multiply' + ] + }; /***/ }, /* 242 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'conj', - 'category': 'Complex', - 'syntax': [ - 'conj(x)' - ], - 'description': - 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.', - 'examples': [ - 'conj(2 + 3i)', - 'conj(2 - 3i)', - 'conj(-5.2i)' - ], - 'seealso': [ - 're', - 'im', - 'abs', - 'arg' - ] - }; + module.exports = { + 'name': 'square', + 'category': 'Arithmetic', + 'syntax': [ + 'square(x)' + ], + 'description': + 'Compute the square of a value. The square of x is x * x.', + 'examples': [ + 'square(3)', + 'sqrt(9)', + '3^2', + '3 * 3' + ], + 'seealso': [ + 'multiply', + 'pow', + 'sqrt', + 'cube' + ] + }; /***/ }, /* 243 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 're', - 'category': 'Complex', - 'syntax': [ - 're(x)' - ], - 'description': 'Get the real part of a complex number.', - 'examples': [ - 're(2 + 3i)', - 'im(2 + 3i)', - 're(-5.2i)', - 're(2.4)' - ], - 'seealso': [ - 'im', - 'conj', - 'abs', - 'arg' - ] - }; + module.exports = { + 'name': 'subtract', + 'category': 'Operators', + 'syntax': [ + 'x - y', + 'subtract(x, y)' + ], + 'description': 'subtract two values.', + 'examples': [ + 'a = 5.3 - 2', + 'a + 2', + '2/3 - 1/6', + '2 * 3 - 3', + '2.1 km - 500m' + ], + 'seealso': [ + 'add' + ] + }; /***/ }, /* 244 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'im', - 'category': 'Complex', - 'syntax': [ - 'im(x)' - ], - 'description': 'Get the imaginary part of a complex number.', - 'examples': [ - 'im(2 + 3i)', - 're(2 + 3i)', - 'im(-5.2i)', - 'im(2.4)' - ], - 'seealso': [ - 're', - 'conj', - 'abs', - 'arg' - ] - }; + module.exports = { + 'name': 'unaryMinus', + 'category': 'Operators', + 'syntax': [ + '-x', + 'unaryMinus(x)' + ], + 'description': + 'Inverse the sign of a value. Converts booleans and strings to numbers.', + 'examples': [ + '-4.5', + '-(-5.6)', + '-"22"' + ], + 'seealso': [ + 'add', 'subtract', 'unaryPlus' + ] + }; /***/ }, /* 245 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'bignumber', - 'category': 'Type', - 'syntax': [ - 'bignumber(x)' - ], - 'description': - 'Create a big number from a number or string.', - 'examples': [ - '0.1 + 0.2', - 'bignumber(0.1) + bignumber(0.2)', - 'bignumber("7.2")', - 'bignumber("7.2e500")', - 'bignumber([0.1, 0.2, 0.3])' - ], - 'seealso': [ - 'boolean', 'complex', 'index', 'matrix', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'unaryPlus', + 'category': 'Operators', + 'syntax': [ + '+x', + 'unaryPlus(x)' + ], + 'description': + 'Converts booleans and strings to numbers.', + 'examples': [ + '+true', + '+"2"' + ], + 'seealso': [ + 'add', 'subtract', 'unaryMinus' + ] + }; /***/ }, /* 246 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'boolean', - 'category': 'Type', - 'syntax': [ - 'x', - 'boolean(x)' - ], - 'description': - 'Convert a string or number into a boolean.', - 'examples': [ - 'boolean(0)', - 'boolean(1)', - 'boolean(3)', - 'boolean("true")', - 'boolean("false")', - 'boolean([1, 0, 1, 1])' - ], - 'seealso': [ - 'bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'xgcd', + 'category': 'Arithmetic', + 'syntax': [ + 'xgcd(a, b)' + ], + 'description': 'Calculate the extended greatest common divisor for two values', + 'examples': [ + 'xgcd(8, 12)', + 'gcd(8, 12)', + 'xgcd(36163, 21199)' + ], + 'seealso': [ 'gcd', 'lcm' ] + }; /***/ }, /* 247 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'complex', - 'category': 'Type', - 'syntax': [ - 'complex()', - 'complex(re, im)', - 'complex(string)' - ], - 'description': - 'Create a complex number.', - 'examples': [ - 'complex()', - 'complex(2, 3)', - 'complex("7 - 2i")' - ], - 'seealso': [ - 'bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'bitAnd', + 'category': 'Bitwise', + 'syntax': [ + 'x & y', + 'bitAnd(x, y)' + ], + 'description': 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0', + 'examples': [ + '5 & 3', + 'bitAnd(53, 131)', + '[1, 12, 31] & 42' + ], + 'seealso': [ + 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' + ] + }; /***/ }, /* 248 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'index', - 'category': 'Type', - 'syntax': [ - '[start]', - '[start:end]', - '[start:step:end]', - '[start1, start 2, ...]', - '[start1:end1, start2:end2, ...]', - '[start1:step1:end1, start2:step2:end2, ...]' - ], - 'description': - 'Create an index to get or replace a subset of a matrix', - 'examples': [ - '[]', - '[1, 2, 3]', - 'A = [1, 2, 3; 4, 5, 6]', - 'A[1, :]', - 'A[1, 2] = 50', - 'A[0:2, 0:2] = ones(2, 2)' - ], - 'seealso': [ - 'bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'bitNot', + 'category': 'Bitwise', + 'syntax': [ + '~x', + 'bitNot(x)' + ], + 'description': 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.', + 'examples': [ + '~1', + '~2', + 'bitNot([2, -3, 4])' + ], + 'seealso': [ + 'bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' + ] + }; /***/ }, /* 249 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'matrix', - 'category': 'Type', - 'syntax': [ - '[]', - '[a1, b1, ...; a2, b2, ...]', - 'matrix()', - 'matrix([...])' - ], - 'description': - 'Create a matrix.', - 'examples': [ - '[]', - '[1, 2, 3]', - '[1, 2, 3; 4, 5, 6]', - 'matrix()', - 'matrix([3, 4])' - ], - 'seealso': [ - 'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'bitOr', + 'category': 'Bitwise', + 'syntax': [ + 'x | y', + 'bitOr(x, y)' + ], + 'description': 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.', + 'examples': [ + '5 | 3', + 'bitOr([1, 2, 3], 4)' + ], + 'seealso': [ + 'bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift' + ] + }; /***/ }, /* 250 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'number', - 'category': 'Type', - 'syntax': [ - 'x', - 'number(x)' - ], - 'description': - 'Create a number or convert a string or boolean into a number.', - 'examples': [ - '2', - '2e3', - '4.05', - 'number(2)', - 'number("7.2")', - 'number(true)', - 'number([true, false, true, true])', - 'number("52cm", "m")' - ], - 'seealso': [ - 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit' - ] - }; + module.exports = { + 'name': 'bitXor', + 'category': 'Bitwise', + 'syntax': [ + 'bitXor(x, y)' + ], + 'description': 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.', + 'examples': [ + 'bitOr(1, 2)', + 'bitXor([2, 3, 4], 4)' + ], + 'seealso': [ + 'bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift' + ] + }; /***/ }, /* 251 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'string', - 'category': 'Type', - 'syntax': [ - '"text"', - 'string(x)' - ], - 'description': - 'Create a string or convert a value to a string', - 'examples': [ - '"Hello World!"', - 'string(4.2)', - 'string(3 + 2i)' - ], - 'seealso': [ - 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit' - ] - }; + module.exports = { + 'name': 'leftShift', + 'category': 'Bitwise', + 'syntax': [ + 'x << y', + 'leftShift(x, y)' + ], + 'description': 'Bitwise left logical shift of a value x by y number of bits.', + 'examples': [ + '4 << 1', + '8 >> 1' + ], + 'seealso': [ + 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift' + ] + }; /***/ }, /* 252 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'unit', - 'category': 'Type', - 'syntax': [ - 'value unit', - 'unit(value, unit)', - 'unit(string)' - ], - 'description': - 'Create a unit.', - 'examples': [ - '5.5 mm', - '3 inch', - 'unit(7.1, "kilogram")', - 'unit("23 deg")' - ], - 'seealso': [ - 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string' - ] - }; + module.exports = { + 'name': 'rightArithShift', + 'category': 'Bitwise', + 'syntax': [ + 'x >> y', + 'leftShift(x, y)' + ], + 'description': 'Bitwise right arithmetic shift of a value x by y number of bits.', + 'examples': [ + '8 >> 1', + '4 << 1', + '-12 >> 2' + ], + 'seealso': [ + 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift' + ] + }; /***/ }, /* 253 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'eval', - 'category': 'Expression', - 'syntax': [ - 'eval(expression)', - 'eval([expr1, expr2, expr3, ...])' - ], - 'description': 'Evaluate an expression or an array with expressions.', - 'examples': [ - 'eval("2 + 3")', - 'eval("sqrt(" + 4 + ")")' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'rightLogShift', + 'category': 'Bitwise', + 'syntax': [ + 'x >> y', + 'leftShift(x, y)' + ], + 'description': 'Bitwise right logical shift of a value x by y number of bits.', + 'examples': [ + '8 >>> 1', + '4 << 1', + '-12 >>> 2' + ], + 'seealso': [ + 'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift' + ] + }; /***/ }, /* 254 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'help', - 'category': 'Expression', - 'syntax': [ - 'help(object)', - 'help(string)' - ], - 'description': 'Display documentation on a function or data type.', - 'examples': [ - 'help(sqrt)', - 'help("complex")' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'arg', + 'category': 'Complex', + 'syntax': [ + 'arg(x)' + ], + 'description': + 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).', + 'examples': [ + 'arg(2 + 2i)', + 'atan2(3, 2)', + 'arg(2 + 3i)' + ], + 'seealso': [ + 're', + 'im', + 'conj', + 'abs' + ] + }; /***/ }, /* 255 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'and', - 'category': 'Logical', - 'syntax': [ - 'x and y', - 'and(x, y)' - ], - 'description': 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.', - 'examples': [ - 'true and false', - 'true and true', - '2 and 4' - ], - 'seealso': [ - 'not', 'or', 'xor' - ] - }; + module.exports = { + 'name': 'conj', + 'category': 'Complex', + 'syntax': [ + 'conj(x)' + ], + 'description': + 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.', + 'examples': [ + 'conj(2 + 3i)', + 'conj(2 - 3i)', + 'conj(-5.2i)' + ], + 'seealso': [ + 're', + 'im', + 'abs', + 'arg' + ] + }; /***/ }, /* 256 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'not', - 'category': 'Logical', - 'syntax': [ - '!x', - 'not x', - 'not(x)' - ], - 'description': 'Logical not. Flips the boolean value of given argument.', - 'examples': [ - '!true', - 'not false', - '!2', - '!0' - ], - 'seealso': [ - 'and', 'or', 'xor' - ] - }; + module.exports = { + 'name': 're', + 'category': 'Complex', + 'syntax': [ + 're(x)' + ], + 'description': 'Get the real part of a complex number.', + 'examples': [ + 're(2 + 3i)', + 'im(2 + 3i)', + 're(-5.2i)', + 're(2.4)' + ], + 'seealso': [ + 'im', + 'conj', + 'abs', + 'arg' + ] + }; /***/ }, /* 257 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'or', - 'category': 'Logical', - 'syntax': [ - 'x or y', - 'or(x, y)' - ], - 'description': 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.', - 'examples': [ - 'true or false', - 'false or false', - '0 or 4' - ], - 'seealso': [ - 'not', 'and', 'xor' - ] - }; + module.exports = { + 'name': 'im', + 'category': 'Complex', + 'syntax': [ + 'im(x)' + ], + 'description': 'Get the imaginary part of a complex number.', + 'examples': [ + 'im(2 + 3i)', + 're(2 + 3i)', + 'im(-5.2i)', + 'im(2.4)' + ], + 'seealso': [ + 're', + 'conj', + 'abs', + 'arg' + ] + }; /***/ }, /* 258 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'xor', - 'category': 'Logical', - 'syntax': [ - 'x or y', - 'or(x, y)' - ], - 'description': 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.', - 'examples': [ - 'true xor false', - 'false xor false', - 'true xor true', - '0 or 4' - ], - 'seealso': [ - 'not', 'and', 'or' - ] - }; + module.exports = { + 'name': 'bignumber', + 'category': 'Type', + 'syntax': [ + 'bignumber(x)' + ], + 'description': + 'Create a big number from a number or string.', + 'examples': [ + '0.1 + 0.2', + 'bignumber(0.1) + bignumber(0.2)', + 'bignumber("7.2")', + 'bignumber("7.2e500")', + 'bignumber([0.1, 0.2, 0.3])' + ], + 'seealso': [ + 'boolean', 'complex', 'index', 'matrix', 'string', 'unit' + ] + }; /***/ }, /* 259 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'concat', - 'category': 'Matrix', - 'syntax': [ - 'concat(A, B, C, ...)', - 'concat(A, B, C, ..., dim)' - ], - 'description': 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.', - 'examples': [ - 'A = [1, 2; 5, 6]', - 'B = [3, 4; 7, 8]', - 'concat(A, B)', - 'concat(A, B, 1)', - 'concat(A, B, 2)' - ], - 'seealso': [ - 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'boolean', + 'category': 'Type', + 'syntax': [ + 'x', + 'boolean(x)' + ], + 'description': + 'Convert a string or number into a boolean.', + 'examples': [ + 'boolean(0)', + 'boolean(1)', + 'boolean(3)', + 'boolean("true")', + 'boolean("false")', + 'boolean([1, 0, 1, 1])' + ], + 'seealso': [ + 'bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit' + ] + }; /***/ }, /* 260 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'cross', - 'category': 'Matrix', - 'syntax': [ - 'cross(A, B)' - ], - 'description': 'Calculate the cross product for two vectors in three dimensional space.', - 'examples': [ - 'cross([1, 1, 0], [0, 1, 1])', - 'cross([3, -3, 1], [4, 9, 2])', - 'cross([2, 3, 4], [5, 6, 7])' - ], - 'seealso': [ - 'multiply', - 'dot' - ] - }; + module.exports = { + 'name': 'complex', + 'category': 'Type', + 'syntax': [ + 'complex()', + 'complex(re, im)', + 'complex(string)' + ], + 'description': + 'Create a complex number.', + 'examples': [ + 'complex()', + 'complex(2, 3)', + 'complex("7 - 2i")' + ], + 'seealso': [ + 'bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit' + ] + }; /***/ }, /* 261 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'det', - 'category': 'Matrix', - 'syntax': [ - 'det(x)' - ], - 'description': 'Calculate the determinant of a matrix', - 'examples': [ - 'det([1, 2; 3, 4])', - 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])' - ], - 'seealso': [ - 'concat', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'index', + 'category': 'Type', + 'syntax': [ + '[start]', + '[start:end]', + '[start:step:end]', + '[start1, start 2, ...]', + '[start1:end1, start2:end2, ...]', + '[start1:step1:end1, start2:step2:end2, ...]' + ], + 'description': + 'Create an index to get or replace a subset of a matrix', + 'examples': [ + '[]', + '[1, 2, 3]', + 'A = [1, 2, 3; 4, 5, 6]', + 'A[1, :]', + 'A[1, 2] = 50', + 'A[0:2, 0:2] = ones(2, 2)' + ], + 'seealso': [ + 'bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit' + ] + }; /***/ }, /* 262 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'diag', - 'category': 'Matrix', - 'syntax': [ - 'diag(x)', - 'diag(x, k)' - ], - 'description': 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.', - 'examples': [ - 'diag(1:3)', - 'diag(1:3, 1)', - 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', - 'diag(a)' - ], - 'seealso': [ - 'concat', 'det', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'matrix', + 'category': 'Type', + 'syntax': [ + '[]', + '[a1, b1, ...; a2, b2, ...]', + 'matrix()', + 'matrix([...])' + ], + 'description': + 'Create a matrix.', + 'examples': [ + '[]', + '[1, 2, 3]', + '[1, 2, 3; 4, 5, 6]', + 'matrix()', + 'matrix([3, 4])' + ], + 'seealso': [ + 'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit' + ] + }; /***/ }, /* 263 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'dot', - 'category': 'Matrix', - 'syntax': [ - 'dot(A, B)' - ], - 'description': 'Calculate the dot product of two vectors. ' + - 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + - 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn', - 'examples': [ - 'dot([2, 4, 1], [2, 2, 3])', - '[2, 4, 1] * [2, 2, 3]' - ], - 'seealso': [ - 'multiply', - 'cross' - ] - }; + module.exports = { + 'name': 'number', + 'category': 'Type', + 'syntax': [ + 'x', + 'number(x)' + ], + 'description': + 'Create a number or convert a string or boolean into a number.', + 'examples': [ + '2', + '2e3', + '4.05', + 'number(2)', + 'number("7.2")', + 'number(true)', + 'number([true, false, true, true])', + 'number("52cm", "m")' + ], + 'seealso': [ + 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit' + ] + }; /***/ }, /* 264 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'eye', - 'category': 'Matrix', - 'syntax': [ - 'eye(n)', - 'eye(m, n)', - 'eye([m, n])', - 'eye' - ], - 'description': 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.', - 'examples': [ - 'eye(3)', - 'eye(3, 5)', - 'a = [1, 2, 3; 4, 5, 6]', - 'eye(size(a))' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'string', + 'category': 'Type', + 'syntax': [ + '"text"', + 'string(x)' + ], + 'description': + 'Create a string or convert a value to a string', + 'examples': [ + '"Hello World!"', + 'string(4.2)', + 'string(3 + 2i)' + ], + 'seealso': [ + 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit' + ] + }; /***/ }, /* 265 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'flatten', - 'category': 'Matrix', - 'syntax': [ - 'flatten(x)' - ], - 'description': 'Flatten a multi dimensional matrix into a single dimensional matrix.', - 'examples': [ - 'a = [1, 2, 3; 4, 5, 6]', - 'size(a)', - 'b = flatten(a)', - 'size(b)' - ], - 'seealso': [ - 'concat', 'resize', 'size', 'squeeze' - ] - }; + module.exports = { + 'name': 'unit', + 'category': 'Type', + 'syntax': [ + 'value unit', + 'unit(value, unit)', + 'unit(string)' + ], + 'description': + 'Create a unit.', + 'examples': [ + '5.5 mm', + '3 inch', + 'unit(7.1, "kilogram")', + 'unit("23 deg")' + ], + 'seealso': [ + 'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string' + ] + }; /***/ }, /* 266 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'inv', - 'category': 'Matrix', - 'syntax': [ - 'inv(x)' - ], - 'description': 'Calculate the inverse of a matrix', - 'examples': [ - 'inv([1, 2; 3, 4])', - 'inv(4)', - '1 / 4' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'eval', + 'category': 'Expression', + 'syntax': [ + 'eval(expression)', + 'eval([expr1, expr2, expr3, ...])' + ], + 'description': 'Evaluate an expression or an array with expressions.', + 'examples': [ + 'eval("2 + 3")', + 'eval("sqrt(" + 4 + ")")' + ], + 'seealso': [] + }; /***/ }, /* 267 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'ones', - 'category': 'Matrix', - 'syntax': [ - 'ones(m)', - 'ones(m, n)', - 'ones(m, n, p, ...)', - 'ones([m])', - 'ones([m, n])', - 'ones([m, n, p, ...])', - 'ones' - ], - 'description': 'Create a matrix containing ones.', - 'examples': [ - 'ones(3)', - 'ones(3, 5)', - 'ones([2,3]) * 4.5', - 'a = [1, 2, 3; 4, 5, 6]', - 'ones(size(a))' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'help', + 'category': 'Expression', + 'syntax': [ + 'help(object)', + 'help(string)' + ], + 'description': 'Display documentation on a function or data type.', + 'examples': [ + 'help(sqrt)', + 'help("complex")' + ], + 'seealso': [] + }; /***/ }, /* 268 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'range', - 'category': 'Type', - 'syntax': [ - 'start:end', - 'start:step:end', - 'range(start, end)', - 'range(start, end, step)', - 'range(string)' - ], - 'description': - 'Create a range. Lower bound of the range is included, upper bound is excluded.', - 'examples': [ - '1:5', - '3:-1:-3', - 'range(3, 7)', - 'range(0, 12, 2)', - 'range("4:10")', - 'a = [1, 2, 3, 4; 5, 6, 7, 8]', - 'a[1:2, 1:2]' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'and', + 'category': 'Logical', + 'syntax': [ + 'x and y', + 'and(x, y)' + ], + 'description': 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.', + 'examples': [ + 'true and false', + 'true and true', + '2 and 4' + ], + 'seealso': [ + 'not', 'or', 'xor' + ] + }; /***/ }, /* 269 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'resize', - 'category': 'Matrix', - 'syntax': [ - 'resize(x, size)', - 'resize(x, size, defaultValue)' - ], - 'description': 'Resize a matrix.', - 'examples': [ - 'resize([1,2,3,4,5], [3])', - 'resize([1,2,3], [5])', - 'resize([1,2,3], [5], -1)', - 'resize(2, [2, 3])', - 'resize("hello", [8], "!")' - ], - 'seealso': [ - 'size', 'subset', 'squeeze' - ] - }; + module.exports = { + 'name': 'not', + 'category': 'Logical', + 'syntax': [ + '!x', + 'not x', + 'not(x)' + ], + 'description': 'Logical not. Flips the boolean value of given argument.', + 'examples': [ + '!true', + 'not false', + '!2', + '!0' + ], + 'seealso': [ + 'and', 'or', 'xor' + ] + }; /***/ }, /* 270 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'size', - 'category': 'Matrix', - 'syntax': [ - 'size(x)' - ], - 'description': 'Calculate the size of a matrix.', - 'examples': [ - 'size(2.3)', - 'size("hello world")', - 'a = [1, 2; 3, 4; 5, 6]', - 'size(a)', - 'size(1:6)' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'or', + 'category': 'Logical', + 'syntax': [ + 'x or y', + 'or(x, y)' + ], + 'description': 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.', + 'examples': [ + 'true or false', + 'false or false', + '0 or 4' + ], + 'seealso': [ + 'not', 'and', 'xor' + ] + }; /***/ }, /* 271 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'squeeze', - 'category': 'Matrix', - 'syntax': [ - 'squeeze(x)' - ], - 'description': 'Remove inner and outer singleton dimensions from a matrix.', - 'examples': [ - 'a = zeros(3,2,1)', - 'size(squeeze(a))', - 'b = zeros(1,1,3)', - 'size(squeeze(b))' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'xor', + 'category': 'Logical', + 'syntax': [ + 'x or y', + 'or(x, y)' + ], + 'description': 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.', + 'examples': [ + 'true xor false', + 'false xor false', + 'true xor true', + '0 or 4' + ], + 'seealso': [ + 'not', 'and', 'or' + ] + }; /***/ }, /* 272 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'subset', - 'category': 'Matrix', - 'syntax': [ - 'value(index)', - 'value(index) = replacement', - 'subset(value, [index])', - 'subset(value, [index], replacement)' - ], - 'description': 'Get or set a subset of a matrix or string. ' + - 'Indexes are one-based. ' + - 'Both the ranges lower-bound and upper-bound are included.', - 'examples': [ - 'd = [1, 2; 3, 4]', - 'e = []', - 'e[1, 1:2] = [5, 6]', - 'e[2, :] = [7, 8]', - 'f = d * e', - 'f[2, 1]', - 'f[:, 1]' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'concat', + 'category': 'Matrix', + 'syntax': [ + 'concat(A, B, C, ...)', + 'concat(A, B, C, ..., dim)' + ], + 'description': 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.', + 'examples': [ + 'A = [1, 2; 5, 6]', + 'B = [3, 4; 7, 8]', + 'concat(A, B)', + 'concat(A, B, 1)', + 'concat(A, B, 2)' + ], + 'seealso': [ + 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 273 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'trace', - 'category': 'Matrix', - 'syntax': [ - 'trace(A)' - ], - 'description': 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.', - 'examples': [ - 'A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', - 'trace(A)' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros' - ] - }; + module.exports = { + 'name': 'cross', + 'category': 'Matrix', + 'syntax': [ + 'cross(A, B)' + ], + 'description': 'Calculate the cross product for two vectors in three dimensional space.', + 'examples': [ + 'cross([1, 1, 0], [0, 1, 1])', + 'cross([3, -3, 1], [4, 9, 2])', + 'cross([2, 3, 4], [5, 6, 7])' + ], + 'seealso': [ + 'multiply', + 'dot' + ] + }; /***/ }, /* 274 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'transpose', - 'category': 'Matrix', - 'syntax': [ - 'x\'', - 'transpose(x)' - ], - 'description': 'Transpose a matrix', - 'examples': [ - 'a = [1, 2, 3; 4, 5, 6]', - 'a\'', - 'transpose(a)' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros' - ] - }; + module.exports = { + 'name': 'det', + 'category': 'Matrix', + 'syntax': [ + 'det(x)' + ], + 'description': 'Calculate the determinant of a matrix', + 'examples': [ + 'det([1, 2; 3, 4])', + 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])' + ], + 'seealso': [ + 'concat', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 275 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'zeros', - 'category': 'Matrix', - 'syntax': [ - 'zeros(m)', - 'zeros(m, n)', - 'zeros(m, n, p, ...)', - 'zeros([m])', - 'zeros([m, n])', - 'zeros([m, n, p, ...])', - 'zeros' - ], - 'description': 'Create a matrix containing zeros.', - 'examples': [ - 'zeros(3)', - 'zeros(3, 5)', - 'a = [1, 2, 3; 4, 5, 6]', - 'zeros(size(a))' - ], - 'seealso': [ - 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose' - ] - }; + module.exports = { + 'name': 'diag', + 'category': 'Matrix', + 'syntax': [ + 'diag(x)', + 'diag(x, k)' + ], + 'description': 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.', + 'examples': [ + 'diag(1:3)', + 'diag(1:3, 1)', + 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', + 'diag(a)' + ], + 'seealso': [ + 'concat', 'det', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 276 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'combinations', - 'category': 'Probability', - 'syntax': [ - 'combinations(n, k)' - ], - 'description': 'Compute the number of combinations of n items taken k at a time', - 'examples': [ - 'combinations(7, 5)' - ], - 'seealso': ['permutations', 'factorial'] - }; + module.exports = { + 'name': 'dot', + 'category': 'Matrix', + 'syntax': [ + 'dot(A, B)' + ], + 'description': 'Calculate the dot product of two vectors. ' + + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn', + 'examples': [ + 'dot([2, 4, 1], [2, 2, 3])', + '[2, 4, 1] * [2, 2, 3]' + ], + 'seealso': [ + 'multiply', + 'cross' + ] + }; /***/ }, /* 277 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'factorial', - 'category': 'Probability', - 'syntax': [ - 'n!', - 'factorial(n)' - ], - 'description': 'Compute the factorial of a value', - 'examples': [ - '5!', - '5 * 4 * 3 * 2 * 1', - '3!' - ], - 'seealso': ['combinations', 'permutations', 'gamma'] - }; + module.exports = { + 'name': 'eye', + 'category': 'Matrix', + 'syntax': [ + 'eye(n)', + 'eye(m, n)', + 'eye([m, n])', + 'eye' + ], + 'description': 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.', + 'examples': [ + 'eye(3)', + 'eye(3, 5)', + 'a = [1, 2, 3; 4, 5, 6]', + 'eye(size(a))' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 278 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'gamma', - 'category': 'Probability', - 'syntax': [ - 'gamma(n)' - ], - 'description': 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.', - 'examples': [ - 'gamma(4)', - '3!', - 'gamma(1/2)', - 'sqrt(pi)' - ], - 'seealso': ['factorial'] - }; + module.exports = { + 'name': 'flatten', + 'category': 'Matrix', + 'syntax': [ + 'flatten(x)' + ], + 'description': 'Flatten a multi dimensional matrix into a single dimensional matrix.', + 'examples': [ + 'a = [1, 2, 3; 4, 5, 6]', + 'size(a)', + 'b = flatten(a)', + 'size(b)' + ], + 'seealso': [ + 'concat', 'resize', 'size', 'squeeze' + ] + }; /***/ }, /* 279 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'permutations', - 'category': 'Probability', - 'syntax': [ - 'permutations(n)', - 'permutations(n, k)' - ], - 'description': 'Compute the number of permutations of n items taken k at a time', - 'examples': [ - 'permutations(5)', - 'permutations(5, 3)' - ], - 'seealso': ['combinations', 'factorial'] - }; + module.exports = { + 'name': 'inv', + 'category': 'Matrix', + 'syntax': [ + 'inv(x)' + ], + 'description': 'Calculate the inverse of a matrix', + 'examples': [ + 'inv([1, 2; 3, 4])', + 'inv(4)', + '1 / 4' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 280 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'pickRandom', - 'category': 'Probability', - 'syntax': [ - 'pickRandom(array)' - ], - 'description': - 'Pick a random entry from a given array.', - 'examples': [ - 'pickRandom(0:10)', - 'pickRandom([1, 3, 1, 6])' - ], - 'seealso': ['random', 'randomInt'] - }; + module.exports = { + 'name': 'ones', + 'category': 'Matrix', + 'syntax': [ + 'ones(m)', + 'ones(m, n)', + 'ones(m, n, p, ...)', + 'ones([m])', + 'ones([m, n])', + 'ones([m, n, p, ...])', + 'ones' + ], + 'description': 'Create a matrix containing ones.', + 'examples': [ + 'ones(3)', + 'ones(3, 5)', + 'ones([2,3]) * 4.5', + 'a = [1, 2, 3; 4, 5, 6]', + 'ones(size(a))' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 281 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'random', - 'category': 'Probability', - 'syntax': [ - 'random()', - 'random(max)', - 'random(min, max)', - 'random(size)', - 'random(size, max)', - 'random(size, min, max)' - ], - 'description': - 'Return a random number.', - 'examples': [ - 'random()', - 'random(10, 20)', - 'random([2, 3])' - ], - 'seealso': ['pickRandom', 'randomInt'] - }; + module.exports = { + 'name': 'range', + 'category': 'Type', + 'syntax': [ + 'start:end', + 'start:step:end', + 'range(start, end)', + 'range(start, end, step)', + 'range(string)' + ], + 'description': + 'Create a range. Lower bound of the range is included, upper bound is excluded.', + 'examples': [ + '1:5', + '3:-1:-3', + 'range(3, 7)', + 'range(0, 12, 2)', + 'range("4:10")', + 'a = [1, 2, 3, 4; 5, 6, 7, 8]', + 'a[1:2, 1:2]' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 282 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'randInt', - 'category': 'Probability', - 'syntax': [ - 'randInt()', - 'randInt(max)', - 'randInt(min, max)', - 'randInt(size)', - 'randInt(size, max)', - 'randInt(size, min, max)' - ], - 'description': - 'Return a random integer number', - 'examples': [ - 'randInt()', - 'randInt(10, 20)', - 'randInt([2, 3], 10)' - ], - 'seealso': ['pickRandom', 'random'] - }; + module.exports = { + 'name': 'resize', + 'category': 'Matrix', + 'syntax': [ + 'resize(x, size)', + 'resize(x, size, defaultValue)' + ], + 'description': 'Resize a matrix.', + 'examples': [ + 'resize([1,2,3,4,5], [3])', + 'resize([1,2,3], [5])', + 'resize([1,2,3], [5], -1)', + 'resize(2, [2, 3])', + 'resize("hello", [8], "!")' + ], + 'seealso': [ + 'size', 'subset', 'squeeze' + ] + }; + /***/ }, /* 283 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'compare', - 'category': 'Relational', - 'syntax': [ - 'compare(x, y)' - ], - 'description': - 'Compare two values. Returns 1 if x is larger than y, -1 if x is smaller than y, and 0 if x and y are equal.', - 'examples': [ - 'compare(2, 3)', - 'compare(3, 2)', - 'compare(2, 2)', - 'compare(5cm, 40mm)', - 'compare(2, [1, 2, 3])' - ], - 'seealso': [ - 'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq' - ] - }; + module.exports = { + 'name': 'size', + 'category': 'Matrix', + 'syntax': [ + 'size(x)' + ], + 'description': 'Calculate the size of a matrix.', + 'examples': [ + 'size(2.3)', + 'size("hello world")', + 'a = [1, 2; 3, 4; 5, 6]', + 'size(a)', + 'size(1:6)' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 284 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'deepEqual', - 'category': 'Relational', - 'syntax': [ - 'deepEqual(x, y)' - ], - 'description': - 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.', - 'examples': [ - '[1,3,4] == [1,3,4]', - '[1,3,4] == [1,3]' - ], - 'seealso': [ - 'equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare' - ] - }; + module.exports = { + 'name': 'squeeze', + 'category': 'Matrix', + 'syntax': [ + 'squeeze(x)' + ], + 'description': 'Remove inner and outer singleton dimensions from a matrix.', + 'examples': [ + 'a = zeros(3,2,1)', + 'size(squeeze(a))', + 'b = zeros(1,1,3)', + 'size(squeeze(b))' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 285 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'equal', - 'category': 'Relational', - 'syntax': [ - 'x == y', - 'equal(x, y)' - ], - 'description': - 'Check equality of two values. Returns true if the values are equal, and false if not.', - 'examples': [ - '2+2 == 3', - '2+2 == 4', - 'a = 3.2', - 'b = 6-2.8', - 'a == b', - '50cm == 0.5m' - ], - 'seealso': [ - 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual' - ] - }; + module.exports = { + 'name': 'subset', + 'category': 'Matrix', + 'syntax': [ + 'value(index)', + 'value(index) = replacement', + 'subset(value, [index])', + 'subset(value, [index], replacement)' + ], + 'description': 'Get or set a subset of a matrix or string. ' + + 'Indexes are one-based. ' + + 'Both the ranges lower-bound and upper-bound are included.', + 'examples': [ + 'd = [1, 2; 3, 4]', + 'e = []', + 'e[1, 1:2] = [5, 6]', + 'e[2, :] = [7, 8]', + 'f = d * e', + 'f[2, 1]', + 'f[:, 1]' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros' + ] + }; /***/ }, /* 286 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'larger', - 'category': 'Relational', - 'syntax': [ - 'x > y', - 'larger(x, y)' - ], - 'description': - 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.', - 'examples': [ - '2 > 3', - '5 > 2*2', - 'a = 3.3', - 'b = 6-2.8', - '(a > b)', - '(b < a)', - '5 cm > 2 inch' - ], - 'seealso': [ - 'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare' - ] - }; + module.exports = { + 'name': 'trace', + 'category': 'Matrix', + 'syntax': [ + 'trace(A)' + ], + 'description': 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.', + 'examples': [ + 'A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', + 'trace(A)' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros' + ] + }; /***/ }, /* 287 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'largerEq', - 'category': 'Relational', - 'syntax': [ - 'x >= y', - 'largerEq(x, y)' - ], - 'description': - 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.', - 'examples': [ - '2 > 1+1', - '2 >= 1+1', - 'a = 3.2', - 'b = 6-2.8', - '(a > b)' - ], - 'seealso': [ - 'equal', 'unequal', 'smallerEq', 'smaller', 'largerEq', 'compare' - ] - }; + module.exports = { + 'name': 'transpose', + 'category': 'Matrix', + 'syntax': [ + 'x\'', + 'transpose(x)' + ], + 'description': 'Transpose a matrix', + 'examples': [ + 'a = [1, 2, 3; 4, 5, 6]', + 'a\'', + 'transpose(a)' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros' + ] + }; /***/ }, /* 288 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'smaller', - 'category': 'Relational', - 'syntax': [ - 'x < y', - 'smaller(x, y)' - ], - 'description': - 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.', - 'examples': [ - '2 < 3', - '5 < 2*2', - 'a = 3.3', - 'b = 6-2.8', - '(a < b)', - '5 cm < 2 inch' - ], - 'seealso': [ - 'equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare' - ] - }; + module.exports = { + 'name': 'zeros', + 'category': 'Matrix', + 'syntax': [ + 'zeros(m)', + 'zeros(m, n)', + 'zeros(m, n, p, ...)', + 'zeros([m])', + 'zeros([m, n])', + 'zeros([m, n, p, ...])', + 'zeros' + ], + 'description': 'Create a matrix containing zeros.', + 'examples': [ + 'zeros(3)', + 'zeros(3, 5)', + 'a = [1, 2, 3; 4, 5, 6]', + 'zeros(size(a))' + ], + 'seealso': [ + 'concat', 'det', 'diag', 'eye', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose' + ] + }; /***/ }, /* 289 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'smallerEq', - 'category': 'Relational', - 'syntax': [ - 'x <= y', - 'smallerEq(x, y)' - ], - 'description': - 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.', - 'examples': [ - '2 < 1+1', - '2 <= 1+1', - 'a = 3.2', - 'b = 6-2.8', - '(a < b)' - ], - 'seealso': [ - 'equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare' - ] - }; + module.exports = { + 'name': 'combinations', + 'category': 'Probability', + 'syntax': [ + 'combinations(n, k)' + ], + 'description': 'Compute the number of combinations of n items taken k at a time', + 'examples': [ + 'combinations(7, 5)' + ], + 'seealso': ['permutations', 'factorial'] + }; /***/ }, /* 290 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'unequal', - 'category': 'Relational', - 'syntax': [ - 'x != y', - 'unequal(x, y)' - ], - 'description': - 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.', - 'examples': [ - '2+2 != 3', - '2+2 != 4', - 'a = 3.2', - 'b = 6-2.8', - 'a != b', - '50cm != 0.5m', - '5 cm != 2 inch' - ], - 'seealso': [ - 'equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual' - ] - }; + module.exports = { + 'name': 'factorial', + 'category': 'Probability', + 'syntax': [ + 'n!', + 'factorial(n)' + ], + 'description': 'Compute the factorial of a value', + 'examples': [ + '5!', + '5 * 4 * 3 * 2 * 1', + '3!' + ], + 'seealso': ['combinations', 'permutations', 'gamma'] + }; /***/ }, /* 291 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'max', - 'category': 'Statistics', - 'syntax': [ - 'max(a, b, c, ...)', - 'max(A)', - 'max(A, dim)' - ], - 'description': 'Compute the maximum value of a list of values.', - 'examples': [ - 'max(2, 3, 4, 1)', - 'max([2, 3, 4, 1])', - 'max([2, 5; 4, 3])', - 'max([2, 5; 4, 3], 1)', - 'max([2, 5; 4, 3], 2)', - 'max(2.7, 7.1, -4.5, 2.0, 4.1)', - 'min(2.7, 7.1, -4.5, 2.0, 4.1)' - ], - 'seealso': [ - 'mean', - 'median', - 'min', - 'prod', - 'std', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'gamma', + 'category': 'Probability', + 'syntax': [ + 'gamma(n)' + ], + 'description': 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.', + 'examples': [ + 'gamma(4)', + '3!', + 'gamma(1/2)', + 'sqrt(pi)' + ], + 'seealso': ['factorial'] + }; /***/ }, /* 292 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'mean', - 'category': 'Statistics', - 'syntax': [ - 'mean(a, b, c, ...)', - 'mean(A)', - 'mean(A, dim)' - ], - 'description': 'Compute the arithmetic mean of a list of values.', - 'examples': [ - 'mean(2, 3, 4, 1)', - 'mean([2, 3, 4, 1])', - 'mean([2, 5; 4, 3])', - 'mean([2, 5; 4, 3], 1)', - 'mean([2, 5; 4, 3], 2)', - 'mean([1.0, 2.7, 3.2, 4.0])' - ], - 'seealso': [ - 'max', - 'median', - 'min', - 'prod', - 'std', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'permutations', + 'category': 'Probability', + 'syntax': [ + 'permutations(n)', + 'permutations(n, k)' + ], + 'description': 'Compute the number of permutations of n items taken k at a time', + 'examples': [ + 'permutations(5)', + 'permutations(5, 3)' + ], + 'seealso': ['combinations', 'factorial'] + }; /***/ }, /* 293 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'median', - 'category': 'Statistics', - 'syntax': [ - 'median(a, b, c, ...)', - 'median(A)' - ], - 'description': 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.', - 'examples': [ - 'median(5, 2, 7)', - 'median([3, -1, 5, 7])' - ], - 'seealso': [ - 'max', - 'mean', - 'min', - 'prod', - 'std', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'pickRandom', + 'category': 'Probability', + 'syntax': [ + 'pickRandom(array)' + ], + 'description': + 'Pick a random entry from a given array.', + 'examples': [ + 'pickRandom(0:10)', + 'pickRandom([1, 3, 1, 6])' + ], + 'seealso': ['random', 'randomInt'] + }; /***/ }, /* 294 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'min', - 'category': 'Statistics', - 'syntax': [ - 'min(a, b, c, ...)', - 'min(A)', - 'min(A, dim)' - ], - 'description': 'Compute the minimum value of a list of values.', - 'examples': [ - 'min(2, 3, 4, 1)', - 'min([2, 3, 4, 1])', - 'min([2, 5; 4, 3])', - 'min([2, 5; 4, 3], 1)', - 'min([2, 5; 4, 3], 2)', - 'min(2.7, 7.1, -4.5, 2.0, 4.1)', - 'max(2.7, 7.1, -4.5, 2.0, 4.1)' - ], - 'seealso': [ - 'max', - 'mean', - 'median', - 'prod', - 'std', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'random', + 'category': 'Probability', + 'syntax': [ + 'random()', + 'random(max)', + 'random(min, max)', + 'random(size)', + 'random(size, max)', + 'random(size, min, max)' + ], + 'description': + 'Return a random number.', + 'examples': [ + 'random()', + 'random(10, 20)', + 'random([2, 3])' + ], + 'seealso': ['pickRandom', 'randomInt'] + }; /***/ }, /* 295 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'prod', - 'category': 'Statistics', - 'syntax': [ - 'prod(a, b, c, ...)', - 'prod(A)' - ], - 'description': 'Compute the product of all values.', - 'examples': [ - 'prod(2, 3, 4)', - 'prod([2, 3, 4])', - 'prod([2, 5; 4, 3])' - ], - 'seealso': [ - 'max', - 'mean', - 'min', - 'median', - 'min', - 'std', - 'sum', - 'var' - ] + module.exports = { + 'name': 'randInt', + 'category': 'Probability', + 'syntax': [ + 'randInt()', + 'randInt(max)', + 'randInt(min, max)', + 'randInt(size)', + 'randInt(size, max)', + 'randInt(size, min, max)' + ], + 'description': + 'Return a random integer number', + 'examples': [ + 'randInt()', + 'randInt(10, 20)', + 'randInt([2, 3], 10)' + ], + 'seealso': ['pickRandom', 'random'] }; - /***/ }, /* 296 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'std', - 'category': 'Statistics', - 'syntax': [ - 'std(a, b, c, ...)', - 'std(A)', - 'std(A, normalization)' - ], - 'description': 'Compute the standard deviation of all values, defined as std(A) = sqrt(var(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".', - 'examples': [ - 'std(2, 4, 6)', - 'std([2, 4, 6, 8])', - 'std([2, 4, 6, 8], "uncorrected")', - 'std([2, 4, 6, 8], "biased")', - 'std([1, 2, 3; 4, 5, 6])' - ], - 'seealso': [ - 'max', - 'mean', - 'min', - 'median', - 'min', - 'prod', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'compare', + 'category': 'Relational', + 'syntax': [ + 'compare(x, y)' + ], + 'description': + 'Compare two values. Returns 1 if x is larger than y, -1 if x is smaller than y, and 0 if x and y are equal.', + 'examples': [ + 'compare(2, 3)', + 'compare(3, 2)', + 'compare(2, 2)', + 'compare(5cm, 40mm)', + 'compare(2, [1, 2, 3])' + ], + 'seealso': [ + 'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq' + ] + }; /***/ }, /* 297 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sum', - 'category': 'Statistics', - 'syntax': [ - 'sum(a, b, c, ...)', - 'sum(A)' - ], - 'description': 'Compute the sum of all values.', - 'examples': [ - 'sum(2, 3, 4, 1)', - 'sum([2, 3, 4, 1])', - 'sum([2, 5; 4, 3])' - ], - 'seealso': [ - 'max', - 'mean', - 'median', - 'min', - 'prod', - 'std', - 'sum', - 'var' - ] - }; + module.exports = { + 'name': 'deepEqual', + 'category': 'Relational', + 'syntax': [ + 'deepEqual(x, y)' + ], + 'description': + 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.', + 'examples': [ + '[1,3,4] == [1,3,4]', + '[1,3,4] == [1,3]' + ], + 'seealso': [ + 'equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare' + ] + }; /***/ }, /* 298 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'var', - 'category': 'Statistics', - 'syntax': [ - 'var(a, b, c, ...)', - 'var(A)', - 'var(A, normalization)' - ], - 'description': 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".', - 'examples': [ - 'var(2, 4, 6)', - 'var([2, 4, 6, 8])', - 'var([2, 4, 6, 8], "uncorrected")', - 'var([2, 4, 6, 8], "biased")', - 'var([1, 2, 3; 4, 5, 6])' - ], - 'seealso': [ - 'max', - 'mean', - 'min', - 'median', - 'min', - 'prod', - 'std', - 'sum' - ] - }; + module.exports = { + 'name': 'equal', + 'category': 'Relational', + 'syntax': [ + 'x == y', + 'equal(x, y)' + ], + 'description': + 'Check equality of two values. Returns true if the values are equal, and false if not.', + 'examples': [ + '2+2 == 3', + '2+2 == 4', + 'a = 3.2', + 'b = 6-2.8', + 'a == b', + '50cm == 0.5m' + ], + 'seealso': [ + 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual' + ] + }; /***/ }, /* 299 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acos', - 'category': 'Trigonometry', - 'syntax': [ - 'acos(x)' - ], - 'description': 'Compute the inverse cosine of a value in radians.', - 'examples': [ - 'acos(0.5)', - 'acos(cos(2.3))' - ], - 'seealso': [ - 'cos', - 'atan', - 'asin' - ] - }; + module.exports = { + 'name': 'larger', + 'category': 'Relational', + 'syntax': [ + 'x > y', + 'larger(x, y)' + ], + 'description': + 'Check if value x is larger than y. Returns true if x is larger than y, and false if not.', + 'examples': [ + '2 > 3', + '5 > 2*2', + 'a = 3.3', + 'b = 6-2.8', + '(a > b)', + '(b < a)', + '5 cm > 2 inch' + ], + 'seealso': [ + 'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare' + ] + }; /***/ }, /* 300 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acosh', - 'category': 'Trigonometry', - 'syntax': [ - 'acosh(x)' - ], - 'description': 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.', - 'examples': [ - 'acosh(1.5)' - ], - 'seealso': [ - 'cosh', - 'asinh', - 'atanh' - ] - }; + module.exports = { + 'name': 'largerEq', + 'category': 'Relational', + 'syntax': [ + 'x >= y', + 'largerEq(x, y)' + ], + 'description': + 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.', + 'examples': [ + '2 > 1+1', + '2 >= 1+1', + 'a = 3.2', + 'b = 6-2.8', + '(a > b)' + ], + 'seealso': [ + 'equal', 'unequal', 'smallerEq', 'smaller', 'largerEq', 'compare' + ] + }; + /***/ }, /* 301 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acot', - 'category': 'Trigonometry', - 'syntax': [ - 'acot(x)' - ], - 'description': 'Calculate the inverse cotangent of a value.', - 'examples': [ - 'acot(0.5)', - 'acot(cot(0.5))', - 'acot(2)' - ], - 'seealso': [ - 'cot', - 'atan' - ] - }; + module.exports = { + 'name': 'smaller', + 'category': 'Relational', + 'syntax': [ + 'x < y', + 'smaller(x, y)' + ], + 'description': + 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.', + 'examples': [ + '2 < 3', + '5 < 2*2', + 'a = 3.3', + 'b = 6-2.8', + '(a < b)', + '5 cm < 2 inch' + ], + 'seealso': [ + 'equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare' + ] + }; /***/ }, /* 302 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acoth', - 'category': 'Trigonometry', - 'syntax': [ - 'acoth(x)' - ], - 'description': 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.', - 'examples': [ - 'acoth(0.5)' - ], - 'seealso': [ - 'acsch', - 'asech' - ] - }; + module.exports = { + 'name': 'smallerEq', + 'category': 'Relational', + 'syntax': [ + 'x <= y', + 'smallerEq(x, y)' + ], + 'description': + 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.', + 'examples': [ + '2 < 1+1', + '2 <= 1+1', + 'a = 3.2', + 'b = 6-2.8', + '(a < b)' + ], + 'seealso': [ + 'equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare' + ] + }; + /***/ }, /* 303 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acsc', - 'category': 'Trigonometry', - 'syntax': [ - 'acsc(x)' - ], - 'description': 'Calculate the inverse cotangent of a value.', - 'examples': [ - 'acsc(0.5)', - 'acsc(csc(0.5))', - 'acsc(2)' - ], - 'seealso': [ - 'csc', - 'asin', - 'asec' - ] - }; + module.exports = { + 'name': 'unequal', + 'category': 'Relational', + 'syntax': [ + 'x != y', + 'unequal(x, y)' + ], + 'description': + 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.', + 'examples': [ + '2+2 != 3', + '2+2 != 4', + 'a = 3.2', + 'b = 6-2.8', + 'a != b', + '50cm != 0.5m', + '5 cm != 2 inch' + ], + 'seealso': [ + 'equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual' + ] + }; /***/ }, /* 304 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'acsch', - 'category': 'Trigonometry', - 'syntax': [ - 'acsch(x)' - ], - 'description': 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.', - 'examples': [ - 'acsch(0.5)' - ], - 'seealso': [ - 'asech', - 'acoth' - ] - }; + module.exports = { + 'name': 'max', + 'category': 'Statistics', + 'syntax': [ + 'max(a, b, c, ...)', + 'max(A)', + 'max(A, dim)' + ], + 'description': 'Compute the maximum value of a list of values.', + 'examples': [ + 'max(2, 3, 4, 1)', + 'max([2, 3, 4, 1])', + 'max([2, 5; 4, 3])', + 'max([2, 5; 4, 3], 1)', + 'max([2, 5; 4, 3], 2)', + 'max(2.7, 7.1, -4.5, 2.0, 4.1)', + 'min(2.7, 7.1, -4.5, 2.0, 4.1)' + ], + 'seealso': [ + 'mean', + 'median', + 'min', + 'prod', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 305 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'asec', - 'category': 'Trigonometry', - 'syntax': [ - 'asec(x)' - ], - 'description': 'Calculate the inverse secant of a value.', - 'examples': [ - 'asec(0.5)', - 'asec(sec(0.5))', - 'asec(2)' - ], - 'seealso': [ - 'acos', - 'acot', - 'acsc' - ] - }; + module.exports = { + 'name': 'mean', + 'category': 'Statistics', + 'syntax': [ + 'mean(a, b, c, ...)', + 'mean(A)', + 'mean(A, dim)' + ], + 'description': 'Compute the arithmetic mean of a list of values.', + 'examples': [ + 'mean(2, 3, 4, 1)', + 'mean([2, 3, 4, 1])', + 'mean([2, 5; 4, 3])', + 'mean([2, 5; 4, 3], 1)', + 'mean([2, 5; 4, 3], 2)', + 'mean([1.0, 2.7, 3.2, 4.0])' + ], + 'seealso': [ + 'max', + 'median', + 'min', + 'prod', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 306 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'asech', - 'category': 'Trigonometry', - 'syntax': [ - 'asech(x)' - ], - 'description': 'Calculate the inverse secant of a value.', - 'examples': [ - 'asech(0.5)' - ], - 'seealso': [ - 'acsch', - 'acoth' - ] - }; + module.exports = { + 'name': 'median', + 'category': 'Statistics', + 'syntax': [ + 'median(a, b, c, ...)', + 'median(A)' + ], + 'description': 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.', + 'examples': [ + 'median(5, 2, 7)', + 'median([3, -1, 5, 7])' + ], + 'seealso': [ + 'max', + 'mean', + 'min', + 'prod', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 307 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'asin', - 'category': 'Trigonometry', - 'syntax': [ - 'asin(x)' - ], - 'description': 'Compute the inverse sine of a value in radians.', - 'examples': [ - 'asin(0.5)', - 'asin(sin(2.3))' - ], - 'seealso': [ - 'sin', - 'acos', - 'atan' - ] - }; + module.exports = { + 'name': 'min', + 'category': 'Statistics', + 'syntax': [ + 'min(a, b, c, ...)', + 'min(A)', + 'min(A, dim)' + ], + 'description': 'Compute the minimum value of a list of values.', + 'examples': [ + 'min(2, 3, 4, 1)', + 'min([2, 3, 4, 1])', + 'min([2, 5; 4, 3])', + 'min([2, 5; 4, 3], 1)', + 'min([2, 5; 4, 3], 2)', + 'min(2.7, 7.1, -4.5, 2.0, 4.1)', + 'max(2.7, 7.1, -4.5, 2.0, 4.1)' + ], + 'seealso': [ + 'max', + 'mean', + 'median', + 'prod', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 308 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'asinh', - 'category': 'Trigonometry', - 'syntax': [ - 'asinh(x)' - ], - 'description': 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.', - 'examples': [ - 'asinh(0.5)' - ], - 'seealso': [ - 'acosh', - 'atanh' - ] - }; + module.exports = { + 'name': 'prod', + 'category': 'Statistics', + 'syntax': [ + 'prod(a, b, c, ...)', + 'prod(A)' + ], + 'description': 'Compute the product of all values.', + 'examples': [ + 'prod(2, 3, 4)', + 'prod([2, 3, 4])', + 'prod([2, 5; 4, 3])' + ], + 'seealso': [ + 'max', + 'mean', + 'min', + 'median', + 'min', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 309 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'atan', - 'category': 'Trigonometry', - 'syntax': [ - 'atan(x)' - ], - 'description': 'Compute the inverse tangent of a value in radians.', - 'examples': [ - 'atan(0.5)', - 'atan(tan(2.3))' - ], - 'seealso': [ - 'tan', - 'acos', - 'asin' - ] - }; + module.exports = { + 'name': 'std', + 'category': 'Statistics', + 'syntax': [ + 'std(a, b, c, ...)', + 'std(A)', + 'std(A, normalization)' + ], + 'description': 'Compute the standard deviation of all values, defined as std(A) = sqrt(var(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".', + 'examples': [ + 'std(2, 4, 6)', + 'std([2, 4, 6, 8])', + 'std([2, 4, 6, 8], "uncorrected")', + 'std([2, 4, 6, 8], "biased")', + 'std([1, 2, 3; 4, 5, 6])' + ], + 'seealso': [ + 'max', + 'mean', + 'min', + 'median', + 'min', + 'prod', + 'sum', + 'var' + ] + }; /***/ }, /* 310 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'atanh', - 'category': 'Trigonometry', - 'syntax': [ - 'atanh(x)' - ], - 'description': 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.', - 'examples': [ - 'atanh(0.5)' - ], - 'seealso': [ - 'acosh', - 'asinh' - ] - }; + module.exports = { + 'name': 'sum', + 'category': 'Statistics', + 'syntax': [ + 'sum(a, b, c, ...)', + 'sum(A)' + ], + 'description': 'Compute the sum of all values.', + 'examples': [ + 'sum(2, 3, 4, 1)', + 'sum([2, 3, 4, 1])', + 'sum([2, 5; 4, 3])' + ], + 'seealso': [ + 'max', + 'mean', + 'median', + 'min', + 'prod', + 'std', + 'sum', + 'var' + ] + }; /***/ }, /* 311 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'atan2', - 'category': 'Trigonometry', - 'syntax': [ - 'atan2(y, x)' - ], - 'description': - 'Computes the principal value of the arc tangent of y/x in radians.', - 'examples': [ - 'atan2(2, 2) / pi', - 'angle = 60 deg in rad', - 'x = cos(angle)', - 'y = sin(angle)', - 'atan2(y, x)' - ], - 'seealso': [ - 'sin', - 'cos', - 'tan' - ] - }; + module.exports = { + 'name': 'var', + 'category': 'Statistics', + 'syntax': [ + 'var(a, b, c, ...)', + 'var(A)', + 'var(A, normalization)' + ], + 'description': 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".', + 'examples': [ + 'var(2, 4, 6)', + 'var([2, 4, 6, 8])', + 'var([2, 4, 6, 8], "uncorrected")', + 'var([2, 4, 6, 8], "biased")', + 'var([1, 2, 3; 4, 5, 6])' + ], + 'seealso': [ + 'max', + 'mean', + 'min', + 'median', + 'min', + 'prod', + 'std', + 'sum' + ] + }; /***/ }, /* 312 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'cos', - 'category': 'Trigonometry', - 'syntax': [ - 'cos(x)' - ], - 'description': 'Compute the cosine of x in radians.', - 'examples': [ - 'cos(2)', - 'cos(pi / 4) ^ 2', - 'cos(180 deg)', - 'cos(60 deg)', - 'sin(0.2)^2 + cos(0.2)^2' - ], - 'seealso': [ - 'acos', - 'sin', - 'tan' - ] - }; + module.exports = { + 'name': 'acos', + 'category': 'Trigonometry', + 'syntax': [ + 'acos(x)' + ], + 'description': 'Compute the inverse cosine of a value in radians.', + 'examples': [ + 'acos(0.5)', + 'acos(cos(2.3))' + ], + 'seealso': [ + 'cos', + 'atan', + 'asin' + ] + }; /***/ }, /* 313 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'acosh', + 'category': 'Trigonometry', + 'syntax': [ + 'acosh(x)' + ], + 'description': 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.', + 'examples': [ + 'acosh(1.5)' + ], + 'seealso': [ + 'cosh', + 'asinh', + 'atanh' + ] + }; + +/***/ }, +/* 314 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'acot', + 'category': 'Trigonometry', + 'syntax': [ + 'acot(x)' + ], + 'description': 'Calculate the inverse cotangent of a value.', + 'examples': [ + 'acot(0.5)', + 'acot(cot(0.5))', + 'acot(2)' + ], + 'seealso': [ + 'cot', + 'atan' + ] + }; + + +/***/ }, +/* 315 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'acoth', + 'category': 'Trigonometry', + 'syntax': [ + 'acoth(x)' + ], + 'description': 'Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.', + 'examples': [ + 'acoth(0.5)' + ], + 'seealso': [ + 'acsch', + 'asech' + ] + }; + +/***/ }, +/* 316 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'acsc', + 'category': 'Trigonometry', + 'syntax': [ + 'acsc(x)' + ], + 'description': 'Calculate the inverse cotangent of a value.', + 'examples': [ + 'acsc(0.5)', + 'acsc(csc(0.5))', + 'acsc(2)' + ], + 'seealso': [ + 'csc', + 'asin', + 'asec' + ] + }; + + +/***/ }, +/* 317 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'acsch', + 'category': 'Trigonometry', + 'syntax': [ + 'acsch(x)' + ], + 'description': 'Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.', + 'examples': [ + 'acsch(0.5)' + ], + 'seealso': [ + 'asech', + 'acoth' + ] + }; + + +/***/ }, +/* 318 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'asec', + 'category': 'Trigonometry', + 'syntax': [ + 'asec(x)' + ], + 'description': 'Calculate the inverse secant of a value.', + 'examples': [ + 'asec(0.5)', + 'asec(sec(0.5))', + 'asec(2)' + ], + 'seealso': [ + 'acos', + 'acot', + 'acsc' + ] + }; + + +/***/ }, +/* 319 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'asech', + 'category': 'Trigonometry', + 'syntax': [ + 'asech(x)' + ], + 'description': 'Calculate the inverse secant of a value.', + 'examples': [ + 'asech(0.5)' + ], + 'seealso': [ + 'acsch', + 'acoth' + ] + }; + + +/***/ }, +/* 320 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'asin', + 'category': 'Trigonometry', + 'syntax': [ + 'asin(x)' + ], + 'description': 'Compute the inverse sine of a value in radians.', + 'examples': [ + 'asin(0.5)', + 'asin(sin(2.3))' + ], + 'seealso': [ + 'sin', + 'acos', + 'atan' + ] + }; + + +/***/ }, +/* 321 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'asinh', + 'category': 'Trigonometry', + 'syntax': [ + 'asinh(x)' + ], + 'description': 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.', + 'examples': [ + 'asinh(0.5)' + ], + 'seealso': [ + 'acosh', + 'atanh' + ] + }; + + +/***/ }, +/* 322 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'atan', + 'category': 'Trigonometry', + 'syntax': [ + 'atan(x)' + ], + 'description': 'Compute the inverse tangent of a value in radians.', + 'examples': [ + 'atan(0.5)', + 'atan(tan(2.3))' + ], + 'seealso': [ + 'tan', + 'acos', + 'asin' + ] + }; + + +/***/ }, +/* 323 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'atanh', + 'category': 'Trigonometry', + 'syntax': [ + 'atanh(x)' + ], + 'description': 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.', + 'examples': [ + 'atanh(0.5)' + ], + 'seealso': [ + 'acosh', + 'asinh' + ] + }; + + +/***/ }, +/* 324 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'atan2', + 'category': 'Trigonometry', + 'syntax': [ + 'atan2(y, x)' + ], + 'description': + 'Computes the principal value of the arc tangent of y/x in radians.', + 'examples': [ + 'atan2(2, 2) / pi', + 'angle = 60 deg in rad', + 'x = cos(angle)', + 'y = sin(angle)', + 'atan2(y, x)' + ], + 'seealso': [ + 'sin', + 'cos', + 'tan' + ] + }; + + +/***/ }, +/* 325 */ +/***/ function(module, exports, __webpack_require__) { + + module.exports = { + 'name': 'cos', + 'category': 'Trigonometry', + 'syntax': [ + 'cos(x)' + ], + 'description': 'Compute the cosine of x in radians.', + 'examples': [ + 'cos(2)', + 'cos(pi / 4) ^ 2', + 'cos(180 deg)', + 'cos(60 deg)', + 'sin(0.2)^2 + cos(0.2)^2' + ], + 'seealso': [ + 'acos', + 'sin', + 'tan' + ] + }; + + +/***/ }, +/* 326 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27614,30 +30611,30 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 314 */ +/* 327 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'cot', - 'category': 'Trigonometry', - 'syntax': [ - 'cot(x)' - ], - 'description': 'Compute the cotangent of x in radians. Defined as 1/tan(x)', - 'examples': [ - 'cot(2)', - '1 / tan(2)' - ], - 'seealso': [ - 'sec', - 'csc', - 'tan' - ] - }; + module.exports = { + 'name': 'cot', + 'category': 'Trigonometry', + 'syntax': [ + 'cot(x)' + ], + 'description': 'Compute the cotangent of x in radians. Defined as 1/tan(x)', + 'examples': [ + 'cot(2)', + '1 / tan(2)' + ], + 'seealso': [ + 'sec', + 'csc', + 'tan' + ] + }; /***/ }, -/* 315 */ +/* 328 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27660,30 +30657,30 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 316 */ +/* 329 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'csc', - 'category': 'Trigonometry', - 'syntax': [ - 'csc(x)' - ], - 'description': 'Compute the cosecant of x in radians. Defined as 1/sin(x)', - 'examples': [ - 'csc(2)', - '1 / sin(2)' - ], - 'seealso': [ - 'sec', - 'cot', - 'sin' - ] - }; + module.exports = { + 'name': 'csc', + 'category': 'Trigonometry', + 'syntax': [ + 'csc(x)' + ], + 'description': 'Compute the cosecant of x in radians. Defined as 1/sin(x)', + 'examples': [ + 'csc(2)', + '1 / sin(2)' + ], + 'seealso': [ + 'sec', + 'cot', + 'sin' + ] + }; /***/ }, -/* 317 */ +/* 330 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27706,30 +30703,30 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 318 */ +/* 331 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sec', - 'category': 'Trigonometry', - 'syntax': [ - 'sec(x)' - ], - 'description': 'Compute the secant of x in radians. Defined as 1/cos(x)', - 'examples': [ - 'sec(2)', - '1 / cos(2)' - ], - 'seealso': [ - 'cot', - 'csc', - 'cos' - ] - }; + module.exports = { + 'name': 'sec', + 'category': 'Trigonometry', + 'syntax': [ + 'sec(x)' + ], + 'description': 'Compute the secant of x in radians. Defined as 1/cos(x)', + 'examples': [ + 'sec(2)', + '1 / cos(2)' + ], + 'seealso': [ + 'cot', + 'csc', + 'cos' + ] + }; /***/ }, -/* 319 */ +/* 332 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27752,33 +30749,33 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 320 */ +/* 333 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sin', - 'category': 'Trigonometry', - 'syntax': [ - 'sin(x)' - ], - 'description': 'Compute the sine of x in radians.', - 'examples': [ - 'sin(2)', - 'sin(pi / 4) ^ 2', - 'sin(90 deg)', - 'sin(30 deg)', - 'sin(0.2)^2 + cos(0.2)^2' - ], - 'seealso': [ - 'asin', - 'cos', - 'tan' - ] - }; + module.exports = { + 'name': 'sin', + 'category': 'Trigonometry', + 'syntax': [ + 'sin(x)' + ], + 'description': 'Compute the sine of x in radians.', + 'examples': [ + 'sin(2)', + 'sin(pi / 4) ^ 2', + 'sin(90 deg)', + 'sin(30 deg)', + 'sin(0.2)^2 + cos(0.2)^2' + ], + 'seealso': [ + 'asin', + 'cos', + 'tan' + ] + }; /***/ }, -/* 321 */ +/* 334 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27799,32 +30796,32 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 322 */ +/* 335 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'tan', - 'category': 'Trigonometry', - 'syntax': [ - 'tan(x)' - ], - 'description': 'Compute the tangent of x in radians.', - 'examples': [ - 'tan(0.5)', - 'sin(0.5) / cos(0.5)', - 'tan(pi / 4)', - 'tan(45 deg)' - ], - 'seealso': [ - 'atan', - 'sin', - 'cos' - ] - }; + module.exports = { + 'name': 'tan', + 'category': 'Trigonometry', + 'syntax': [ + 'tan(x)' + ], + 'description': 'Compute the tangent of x in radians.', + 'examples': [ + 'tan(0.5)', + 'sin(0.5) / cos(0.5)', + 'tan(pi / 4)', + 'tan(45 deg)' + ], + 'seealso': [ + 'atan', + 'sin', + 'cos' + ] + }; /***/ }, -/* 323 */ +/* 336 */ /***/ function(module, exports, __webpack_require__) { module.exports = { @@ -27846,505 +30843,311 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 324 */ +/* 337 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'to', - 'category': 'Units', - 'syntax': [ - 'x to unit', - 'to(x, unit)' - ], - 'description': 'Change the unit of a value.', - 'examples': [ - '5 inch to cm', - '3.2kg to g', - '16 bytes in bits' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'to', + 'category': 'Units', + 'syntax': [ + 'x to unit', + 'to(x, unit)' + ], + 'description': 'Change the unit of a value.', + 'examples': [ + '5 inch to cm', + '3.2kg to g', + '16 bytes in bits' + ], + 'seealso': [] + }; /***/ }, -/* 325 */ +/* 338 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'clone', - 'category': 'Utils', - 'syntax': [ - 'clone(x)' - ], - 'description': 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices', - 'examples': [ - 'clone(3.5)', - 'clone(2 - 4i)', - 'clone(45 deg)', - 'clone([1, 2; 3, 4])', - 'clone("hello world")' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'clone', + 'category': 'Utils', + 'syntax': [ + 'clone(x)' + ], + 'description': 'Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices', + 'examples': [ + 'clone(3.5)', + 'clone(2 - 4i)', + 'clone(45 deg)', + 'clone([1, 2; 3, 4])', + 'clone("hello world")' + ], + 'seealso': [] + }; /***/ }, -/* 326 */ +/* 339 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'map', - 'category': 'Utils', - 'syntax': [ - 'map(x, callback)' - ], - 'description': 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.', - 'examples': [ - 'map([1, 2, 3], function(val) { return value * value })' - ], - 'seealso': ['filter', 'forEach'] - }; + module.exports = { + 'name': 'map', + 'category': 'Utils', + 'syntax': [ + 'map(x, callback)' + ], + 'description': 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.', + 'examples': [ + 'map([1, 2, 3], function(val) { return value * value })' + ], + 'seealso': ['filter', 'forEach'] + }; /***/ }, -/* 327 */ +/* 340 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'filter', - 'category': 'Utils', - 'syntax': [ - 'filter(x, test)' - ], - 'description': 'Filter items in a matrix.', - 'examples': [ - 'isPositive(x) = x > 0', - 'filter([6, -2, -1, 4, 3], isPositive)', - 'filter([6, -2, 0, 1, 0], x != 0)' - ], - 'seealso': ['sort', 'map', 'forEach'] - }; + module.exports = { + 'name': 'filter', + 'category': 'Utils', + 'syntax': [ + 'filter(x, test)' + ], + 'description': 'Filter items in a matrix.', + 'examples': [ + 'isPositive(x) = x > 0', + 'filter([6, -2, -1, 4, 3], isPositive)', + 'filter([6, -2, 0, 1, 0], x != 0)' + ], + 'seealso': ['sort', 'map', 'forEach'] + }; /***/ }, -/* 328 */ +/* 341 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'forEach', - 'category': 'Utils', - 'syntax': [ - 'forEach(x, callback)' - ], - 'description': 'Iterates over all elements of a matrix/array, and executes the given callback function.', - 'examples': [ - 'forEach([1, 2, 3], function(val) { console.log(val) })' - ], - 'seealso': ['map', 'sort', 'filter'] - }; + module.exports = { + 'name': 'forEach', + 'category': 'Utils', + 'syntax': [ + 'forEach(x, callback)' + ], + 'description': 'Iterates over all elements of a matrix/array, and executes the given callback function.', + 'examples': [ + 'forEach([1, 2, 3], function(val) { console.log(val) })' + ], + 'seealso': ['map', 'sort', 'filter'] + }; /***/ }, -/* 329 */ +/* 342 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'format', - 'category': 'Utils', - 'syntax': [ - 'format(value)', - 'format(value, precision)' - ], - 'description': 'Format a value of any type as string.', - 'examples': [ - 'format(2.3)', - 'format(3 - 4i)', - 'format([])', - 'format(pi, 3)' - ], - 'seealso': ['print'] - }; + module.exports = { + 'name': 'format', + 'category': 'Utils', + 'syntax': [ + 'format(value)', + 'format(value, precision)' + ], + 'description': 'Format a value of any type as string.', + 'examples': [ + 'format(2.3)', + 'format(3 - 4i)', + 'format([])', + 'format(pi, 3)' + ], + 'seealso': ['print'] + }; /***/ }, -/* 330 */ +/* 343 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'import', - 'category': 'Utils', - 'syntax': [ - 'import(string)' - ], - 'description': 'Import functions from a file.', - 'examples': [ - 'import("numbers")', - 'import("./mylib.js")' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'import', + 'category': 'Utils', + 'syntax': [ + 'import(string)' + ], + 'description': 'Import functions from a file.', + 'examples': [ + 'import("numbers")', + 'import("./mylib.js")' + ], + 'seealso': [] + }; /***/ }, -/* 331 */ +/* 344 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'sort', - 'category': 'Utils', - 'syntax': [ - 'sort(x)', - 'sort(x, compare)' - ], - 'description': 'Sort the items in a matrix. Compare can be a string "asc" or "desc", or a custom sort function.', - 'examples': [ - 'sort([5, 10, 1])', - 'sort(["C", "B", "A", "D"])', - 'sortByLength(a, b) = size(a)[1] - size(b)[1]', - 'sort(["Langdon", "Tom", "Sara"], sortByLength)' - ], - 'seealso': ['map', 'filter', 'forEach'] - }; + module.exports = { + 'name': 'sort', + 'category': 'Utils', + 'syntax': [ + 'sort(x)', + 'sort(x, compare)' + ], + 'description': 'Sort the items in a matrix. Compare can be a string "asc" or "desc", or a custom sort function.', + 'examples': [ + 'sort([5, 10, 1])', + 'sort(["C", "B", "A", "D"])', + 'sortByLength(a, b) = size(a)[1] - size(b)[1]', + 'sort(["Langdon", "Tom", "Sara"], sortByLength)' + ], + 'seealso': ['map', 'filter', 'forEach'] + }; /***/ }, -/* 332 */ +/* 345 */ /***/ function(module, exports, __webpack_require__) { - module.exports = { - 'name': 'typeof', - 'category': 'Utils', - 'syntax': [ - 'typeof(x)' - ], - 'description': 'Get the type of a variable.', - 'examples': [ - 'typeof(3.5)', - 'typeof(2 - 4i)', - 'typeof(45 deg)', - 'typeof("hello world")' - ], - 'seealso': [] - }; + module.exports = { + 'name': 'typeof', + 'category': 'Utils', + 'syntax': [ + 'typeof(x)' + ], + 'description': 'Get the type of a variable.', + 'examples': [ + 'typeof(3.5)', + 'typeof(2 - 4i)', + 'typeof(45 deg)', + 'typeof("hello world")' + ], + 'seealso': [] + }; /***/ }, -/* 333 */ +/* 346 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - module.exports = function (config) { - var typed = __webpack_require__(163); - var Complex = __webpack_require__(4); - - /** - * Divide two scalar values, `x / y`. - * This function is meant for internal use: it is used by the public functions - * `divide` and `inv`. - * - * This function does not support collections (Array or Matrix), and does - * not validate the number of of inputs. - * - * @param {Number | BigNumber | Boolean | Complex | Unit | null} x Numerator - * @param {Number | BigNumber | Boolean | Complex | null} y Denominator - * @return {Number | BigNumber | Complex | Unit} Quotient, `x / y` - * @private - */ - var divideScalar = typed('divideScalar', { - 'number, number': function (x, y) { - return x / y; - }, - - 'Complex, Complex': _divideComplex, - - 'BigNumber, BigNumber': function (x, y) { - return x.div(y); - }, - - 'Unit, number': function (x, y) { - var res = x.clone(); - res.value = ((res.value === null) ? res._normalize(1) : res.value) / y; - return res; - } - }); - - /** - * Divide two complex numbers. x / y or divide(x, y) - * @param {Complex} x - * @param {Complex} y - * @return {Complex} res - * @private - */ - function _divideComplex (x, y) { - var den = y.re * y.re + y.im * y.im; - if (den != 0) { - return new Complex( - (x.re * y.re + x.im * y.im) / den, - (x.im * y.re - x.re * y.im) / den - ); - } - else { - // both y.re and y.im are zero - return new Complex( - (x.re != 0) ? (x.re / 0) : 0, - (x.im != 0) ? (x.im / 0) : 0 - ); - } - } - - return divideScalar; + var map = { + "./clone": 155, + "./clone.js": 155, + "./config": 156, + "./config.js": 156, + "./filter": 157, + "./filter.js": 157, + "./forEach": 163, + "./forEach.js": 163, + "./format": 158, + "./format.js": 158, + "./import": 168, + "./import.js": 168, + "./map": 159, + "./map.js": 159, + "./print": 160, + "./print.js": 160, + "./sort": 161, + "./sort.js": 161, + "./typeof": 162, + "./typeof.js": 162 }; + function webpackContext(req) { + return __webpack_require__(webpackContextResolve(req)); + }; + function webpackContextResolve(req) { + return map[req] || (function() { throw new Error("Cannot find module '" + req + "'.") }()); + }; + webpackContext.keys = function webpackContextKeys() { + return Object.keys(map); + }; + webpackContext.resolve = webpackContextResolve; + module.exports = webpackContext; + webpackContext.id = 346; /***/ }, -/* 334 */ +/* 347 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - // NOTE: distribution is NOT added to math.distribution but returned by the factory function - // TODO: rethink math.distribution - - module.exports = function (math) { - var Matrix = __webpack_require__(7); - var array = __webpack_require__(167); - var collection = __webpack_require__(14); - var isCollection = collection.isCollection; - - /** - * Create a distribution object with a set of random functions for given - * random distribution. - * - * Syntax: - * - * math.distribution(name) - * - * Examples: - * - * var normalDist = math.distribution('normal'); // create a normal distribution - * normalDist.random(0, 10); // get a random value between 0 and 10 - * - * See also: - * - * random, randomInt, pickRandom - * - * @param {String} name Name of a distribution. Choose from 'uniform', 'normal'. - * @return {Object} Returns a distribution object containing functions: - * `random([size] [, min] [, max])`, - * `randomInt([min] [, max])`, - * `pickRandom(array)` - */ - function distribution(name) { - if (!distributions.hasOwnProperty(name)) - throw new Error('Unknown distribution ' + name); - - var args = Array.prototype.slice.call(arguments, 1), - distribution = distributions[name].apply(this, args); - - return (function(distribution) { - - // This is the public API for all distributions - var randFunctions = { - - random: function(arg1, arg2, arg3) { - var size, min, max; - if (arguments.length > 3) { - throw new math.error.ArgumentsError('random', arguments.length, 0, 3); - - // `random(max)` or `random(size)` - } else if (arguments.length === 1) { - if (isCollection(arg1)) { - size = arg1; - } - else { - max = arg1; - } - // `random(min, max)` or `random(size, max)` - } else if (arguments.length === 2) { - if (isCollection(arg1)) { - size = arg1; - max = arg2; - } - else { - min = arg1; - max = arg2; - } - // `random(size, min, max)` - } else { - size = arg1; - min = arg2; - max = arg3; - } - - // TODO: validate type of min, max, and size - - if (max === undefined) max = 1; - if (min === undefined) min = 0; - if (size !== undefined) { - var res = _randomDataForMatrix(size.valueOf(), min, max, _random); - return (size instanceof Matrix) ? new Matrix(res) : res; - } - else return _random(min, max); - }, - - randomInt: function(arg1, arg2, arg3) { - var size, min, max; - if (arguments.length > 3 || arguments.length < 1) - throw new math.error.ArgumentsError('randomInt', arguments.length, 1, 3); - - // `random(max)` or `random(size)` - else if (arguments.length === 1) - if (isCollection(arg1)) { - size = arg1; - } - else { - max = arg1; - } - // `randomInt(min, max)` or `randomInt(size, max)` - else if (arguments.length === 2) { - if (isCollection(arg1)) { - size = arg1; - max = arg2; - } - else { - min = arg1; - max = arg2; - } - // `randomInt(size, min, max)` - } else { - size = arg1; - min = arg2; - max = arg3; - } - - // TODO: validate type of min, max, and size - - if (min === undefined) min = 0; - if (size !== undefined) { - var res = _randomDataForMatrix(size.valueOf(), min, max, _randomInt); - return (size instanceof Matrix) ? new Matrix(res) : res; - } - else return _randomInt(min, max); - }, - - pickRandom: function(possibles) { - if (arguments.length !== 1) { - throw new math.error.ArgumentsError('pickRandom', arguments.length, 1); - } - if (possibles instanceof Matrix) { - possibles = possibles.valueOf(); // get Array - } - else if (!Array.isArray(possibles)) { - throw new math.error.UnsupportedTypeError('pickRandom', math['typeof'](possibles)); - } - - if (array.size(possibles).length > 1) { - throw new Error('Only one dimensional vectors supported'); - } - - // TODO: add support for multi dimensional matrices - return possibles[Math.floor(Math.random() * possibles.length)]; - } - - }; - - var _random = function(min, max) { - return min + distribution() * (max - min); - }; - - var _randomInt = function(min, max) { - return Math.floor(min + distribution() * (max - min)); - }; - - // This is a function for generating a random matrix recursively. - var _randomDataForMatrix = function(size, min, max, randFunc) { - var data = [], length, i; - size = size.slice(0); - - if (size.length > 1) { - for (i = 0, length = size.shift(); i < length; i++) - data.push(_randomDataForMatrix(size, min, max, randFunc)); - } else { - for (i = 0, length = size.shift(); i < length; i++) - data.push(randFunc(min, max)); - } - - return data; - }; - - return randFunctions; - - })(distribution); - }; - - // Each distribution is a function that takes no argument and when called returns - // a number between 0 and 1. - var distributions = { - - uniform: function() { - return Math.random; - }, - - // Implementation of normal distribution using Box-Muller transform - // ref : http://en.wikipedia.org/wiki/Box%E2%80%93Muller_transform - // We take : mean = 0.5, standard deviation = 1/6 - // so that 99.7% values are in [0, 1]. - normal: function() { - return function() { - var u1, u2, - picked = -1; - // We reject values outside of the interval [0, 1] - // TODO: check if it is ok to do that? - while (picked < 0 || picked > 1) { - u1 = Math.random(); - u2 = Math.random(); - picked = 1/6 * Math.pow(-2 * Math.log(u1), 0.5) * Math.cos(2 * Math.PI * u2) + 0.5; - } - return picked; - } - } - }; - - return distribution; - }; + module.exports = '2.0.0-SNAPSHOT'; + // Note: This file is automatically generated when building math.js. + // Changes made in this file will be overwritten. /***/ }, -/* 335 */ +/* 348 */ /***/ function(module, exports, __webpack_require__) { - 'use strict'; - - /** - * Determine the type of a variable - * - * type(x) - * - * @param {*} x - * @return {String} type Lower case type, for example 'number', 'string', - * 'array', 'date'. - */ - exports.type = function(x) { - var type = typeof x; - - if (type === 'object') { - if (x === null) return 'null'; - if (x instanceof Boolean) return 'boolean'; - if (x instanceof Number) return 'number'; - if (x instanceof String) return 'string'; - if (Array.isArray(x)) return 'array'; - if (x instanceof Date) return 'date'; - if (x instanceof Function)return 'function'; - if (x instanceof RegExp) return 'regexp'; - } - - return type; - }; + 'use strict'; + + /** + * Create a TypeError with message: + * 'Function does not support a parameter of type '; + * @param {String} fn Function name + * @param {*...} [types] The types of the function arguments + * @extends TypeError + */ + function UnsupportedTypeError(fn, types) { + if (!(this instanceof UnsupportedTypeError)) { + throw new SyntaxError('Constructor must be called with the new operator'); + } + + this.fn = fn; + this.types = Array.prototype.splice.call(arguments, 1); + + if (!fn) { + this.message = 'Unsupported type of argument'; + } + else { + if (this.types.length == 0) { + this.message = 'Unsupported type of argument in function ' + fn; + } + else { + this.message = 'Function ' + fn + '(' + this.types.join(', ') + ') not supported'; + } + } + + this.stack = (new Error()).stack; + } + + UnsupportedTypeError.prototype = new TypeError(); + UnsupportedTypeError.prototype.constructor = TypeError; + UnsupportedTypeError.prototype.name = 'UnsupportedTypeError'; + + module.exports = UnsupportedTypeError; /***/ }, -/* 336 */ +/* 349 */ +/***/ function(module, exports, __webpack_require__) { + + // function utils + + /* + * Memoize a given function by caching the computed result. + * The cache of a memoized function can be cleared by deleting the `cache` + * property of the function. + * + * @param {function} fn The function to be memoized. Must be a pure function. + * @return {function} Returns the memoized function + */ + exports.memoize = function(fn) { + return function memoize() { + if (typeof memoize.cache !== 'object') { + memoize.cache = {}; + } + + var hash = JSON.stringify(arguments); + if (!(hash in memoize.cache)) { + return memoize.cache[hash] = fn.apply(fn, arguments); + } + return memoize.cache[hash]; + }; + }; + + +/***/ }, +/* 350 */ /***/ function(module, exports, __webpack_require__) { var __WEBPACK_AMD_DEFINE_RESULT__;/*! decimal.js v4.0.2 https://github.com/MikeMcl/decimal.js/LICENCE */ @@ -32410,552 +35213,2105 @@ return /******/ (function(modules) { // webpackBootstrap /***/ }, -/* 337 */ +/* 351 */ /***/ function(module, exports, __webpack_require__) { - // function utils + 'use strict'; + + /** + * Format a number using methods toPrecision, toFixed, toExponential. + * @param {number | string} value + * @constructor + */ + function NumberFormatter (value) { + // parse the input value + var match = String(value).toLowerCase().match(/^0*?(-?)(\d+\.?\d*)(e([+-]?\d+))?$/); + if (!match) { + throw new SyntaxError('Invalid number'); + } + + var sign = match[1]; + var coefficients = match[2]; + var exponent = parseFloat(match[4] || '0'); + + var dot = coefficients.indexOf('.'); + exponent += (dot !== -1) ? (dot - 1) : (coefficients.length - 1); + + this.sign = sign; + this.coefficients = coefficients + .replace('.', '') // remove the dot (must be removed before removing leading zeros) + .replace(/^0*/, function (zeros) { + // remove leading zeros, add their count to the exponent + exponent -= zeros.length; + return ''; + }) + .replace(/0*$/, '') // remove trailing zeros + .split('') + .map(function (d) { + return parseInt(d); + }); + + if (this.coefficients.length === 0) { + this.coefficients.push(0); + exponent++; + } + + this.exponent = exponent; + } + + /** + * Format a number with fixed notation. + * @param {Number} [precision=0] Optional number of decimals after the + * decimal point. Zero by default. + */ + NumberFormatter.prototype.toFixed = function (precision) { + var rounded = this.roundDigits(this.exponent + 1 + (precision || 0)); + var c = rounded.coefficients; + var p = rounded.exponent + 1; // exponent may have changed + + // append zeros if needed + var pp = p + (precision || 0); + if (c.length < pp) { + c = c.concat(zeros(pp - c.length)); + } + + // prepend zeros if needed + if (p < 0) { + c = zeros(-p + 1).concat(c); + p = 1; + } + + // insert a dot if needed + if (precision) { + c.splice(p, 0, (p === 0) ? '0.' : '.'); + } + + return this.sign + c.join(''); + }; + + /** + * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3' + * @param {Number} [precision] Number of digits in formatted output. + * If not provided, the maximum available digits + * is used. + */ + NumberFormatter.prototype.toExponential = function (precision) { + // round if needed, else create a clone + var rounded = precision ? this.roundDigits(precision) : this.clone(); + var c = rounded.coefficients; + var e = rounded.exponent; + + // append zeros if needed + if (c.length < precision) { + c = c.concat(zeros(precision - c.length)); + } + + // format as `C.CCCe+EEE` or `C.CCCe-EEE` + var first = c.shift(); + return this.sign + first + (c.length > 0 ? ('.' + c.join('')) : '') + + 'e' + (e >= 0 ? '+' : '') + e; + }; + + /** + * Format a number with a certain precision + * @param {Number} [precision=undefined] Optional number of digits. + * @param {{lower: number | undefined, upper: number | undefined}} [options] + * By default: + * lower = 1e-3 (excl) + * upper = 1e+5 (incl) + * @return {string} + */ + NumberFormatter.prototype.toPrecision = function(precision, options) { + // determine lower and upper bound for exponential notation. + var lower = (options && options.lower !== undefined) ? options.lower : 1e-3; + var upper = (options && options.upper !== undefined) ? options.upper : 1e+5; + + var abs = Math.abs(Math.pow(10, this.exponent)); + if (abs < lower || abs >= upper) { + // exponential notation + return this.toExponential(precision); + } + else { + var rounded = precision ? this.roundDigits(precision) : this.clone(); + var c = rounded.coefficients; + var e = rounded.exponent; + + // append trailing zeros + if (c.length < precision) { + c = c.concat(zeros(precision - c.length)); + } + + // append trailing zeros + // TODO: simplify the next statement + c = c.concat(zeros(e - c.length + 1 + + (c.length < precision ? precision - c.length : 0))); + + // prepend zeros + c = zeros(-e).concat(c); + + var dot = e > 0 ? e : 0; + if (dot < c.length - 1) { + c.splice(dot + 1, 0, '.'); + } + + return this.sign + c.join(''); + } + }; + + /** + * Crete a clone of the NumberFormatter + * @return {NumberFormatter} Returns a clone of the NumberFormatter + */ + NumberFormatter.prototype.clone = function () { + var clone = new NumberFormatter('0'); + clone.sign = this.sign; + clone.coefficients = this.coefficients.slice(0); + clone.exponent = this.exponent; + return clone; + }; + + /** + * Round the number of digits of a number * + * @param {number} precision A positive integer + * @return {NumberFormatter} Returns a new NumberFormatter with the rounded + * digits + */ + NumberFormatter.prototype.roundDigits = function (precision) { + var rounded = this.clone(); + var c = rounded.coefficients; + + // prepend zeros if needed + while (precision <= 0) { + c.unshift(0); + rounded.exponent++; + precision++; + } + + if (c.length > precision) { + var removed = c.splice(precision); + + if (removed[0] >= 5) { + var i = precision - 1; + c[i]++; + while (c[i] === 10) { + c.pop(); + if (i === 0) { + c.unshift(0); + rounded.exponent++; + i++; + } + i--; + c[i]++; + } + } + } + + return rounded; + }; + + /** + * Create an array filled with zeros. + * @param {number} length + * @return {Array} + */ + function zeros(length) { + var arr = []; + for (var i = 0; i < length; i++) { + arr.push(0); + } + return arr; + } + + module.exports = NumberFormatter; - /* - * Memoize a given function by caching the computed result. - * The cache of a memoized function can be cleared by deleting the `cache` - * property of the function. + +/***/ }, +/* 352 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + // Reserved keywords not allowed to use in the parser + module.exports = { + end: true + }; + + +/***/ }, +/* 353 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict' + + //list of identifiers of nodes in order of their precedence + //also contains information about left/right associativity + //and which other operator the operator is associative with + //Example: + // addition is associative with addition and subtraction, because: + // (a+b)+c=a+(b+c) + // (a+b)-c=a+(b-c) + // + // postfix operators are left associative, prefix operators + // are right associative + // + //It's also possible to set the following properties: + // latexParens: if set to false, this node doesn't need to be enclosed + // in parentheses when using LaTeX + // latexLeftParens: if set to false, this !OperatorNode's! + // left argument doesn't need to be enclosed + // in parentheses + // latexRightParens: the same for the right argument + var properties = [ + { //assignment + 'AssignmentNode': {}, + 'FunctionAssignmentNode': {} + }, + { //conditional expression + 'ConditionalNode': { + latexLeftParens: false, + latexRightParens: false, + latexParens: false + //conditionals don't need parentheses in LaTeX because + //they are 2 dimensional + } + }, + { //logical or + 'OperatorNode:or': { + associativity: 'left', + associativeWith: [] + } + + }, + { //logical xor + 'OperatorNode:xor': { + associativity: 'left', + associativeWith: [] + } + }, + { //logical and + 'OperatorNode:and': { + associativity: 'left', + associativeWith: [] + } + }, + { //bitwise or + 'OperatorNode:bitOr': { + associativity: 'left', + associativeWith: [] + } + }, + { //bitwise xor + 'OperatorNode:bitXor': { + associativity: 'left', + associativeWith: [] + } + }, + { //bitwise and + 'OperatorNode:bitAnd': { + associativity: 'left', + associativeWith: [] + } + }, + { //relational operators + 'OperatorNode:equal': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:unequal': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:smaller': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:larger': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:smallerEq': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:largerEq': { + associativity: 'left', + associativeWith: [] + } + }, + { //bitshift operators + 'OperatorNode:leftShift': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:rightArithShift': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:rightLogShift': { + associativity: 'left', + associativeWith: [] + } + }, + { //unit conversion + 'OperatorNode:to': { + associativity: 'left', + associativeWith: [] + } + }, + { //range + 'RangeNode': {} + }, + { //addition, subtraction + 'OperatorNode:add': { + associativity: 'left', + associativeWith: ['OperatorNode:add', 'OperatorNode:subtract'] + }, + 'OperatorNode:subtract': { + associativity: 'left', + associativeWith: [] + } + }, + { //multiply, divide, modulus + 'OperatorNode:multiply': { + associativity: 'left', + associativeWith: [ + 'OperatorNode:multiply', + 'OperatorNode:divide', + 'Operator:dotMultiply', + 'Operator:dotDivide' + ] + }, + 'OperatorNode:divide': { + associativity: 'left', + associativeWith: [], + latexLeftParens: false, + latexRightParens: false, + latexParens: false + //fractions don't require parentheses because + //they're 2 dimensional, so parens aren't needed + //in LaTeX + }, + 'OperatorNode:dotMultiply': { + associativity: 'left', + associativeWith: [ + 'OperatorNode:multiply', + 'OperatorNode:divide', + 'OperatorNode:dotMultiply', + 'OperatorNode:doDivide' + ] + }, + 'OperatorNode:dotDivide': { + associativity: 'left', + associativeWith: [] + }, + 'OperatorNode:mod': { + associativity: 'left', + associativeWith: [] + } + }, + { //unary prefix operators + 'OperatorNode:unaryPlus': { + associativity: 'right' + }, + 'OperatorNode:unaryMinus': { + associativity: 'right' + }, + 'OperatorNode:bitNot': { + associativity: 'right' + }, + 'OperatorNode:not': { + associativity: 'right' + } + }, + { //exponentiation + 'OperatorNode:pow': { + associativity: 'right', + associativeWith: [], + latexRightParens: false, + //the exponent doesn't need parentheses in + //LaTeX because it's 2 dimensional + //(it's on top) + }, + 'OperatorNode:dotPow': { + associativity: 'right', + associativeWith: [] + } + }, + { //factorial + 'OperatorNode:factorial': { + associativity: 'left' + } + }, + { //matrix transpose + 'OperatorNode:transpose': { + associativity: 'left' + } + } + ]; + + /** + * Get the precedence of a Node. + * Higher number for higher precedence, starting with 0. + * Returns null if the precedence is undefined. + * + * @param {Node} + * @return {Number|null} + */ + function getPrecedence (node) { + var identifier = node.getIdentifier(); + for (var i = 0; i < properties.length; i++) { + if (identifier in properties[i]) { + return i; + } + } + return null; + } + + /** + * Get the associativity of an operator (left or right). + * Returns a string containing 'left' or 'right' or null if + * the associativity is not defined. + * + * @param {Node} + * @return {String|null} + * @throws {Error} + */ + function getAssociativity (node) { + var identifier = node.getIdentifier(); + var index = getPrecedence(node); + if (index === null) { + //node isn't in the list + return null; + } + var property = properties[index][identifier]; + + if (property.hasOwnProperty('associativity')) { + if (property.associativity === 'left') { + return 'left'; + } + if (property.associativity === 'right') { + return 'right'; + } + //associativity is invalid + throw Error('\'' + identifier + '\' has the invalid associativity \'' + + property.associativity + '\'.'); + } + + //associativity is undefined + return null; + } + + /** + * Check if an operator is associative with another operator. + * Returns either true or false or null if not defined. + * + * @param {Node} nodeA + * @param {Node} nodeB + * @return {bool|null} + */ + function isAssociativeWith (nodeA, nodeB) { + var identifierA = nodeA.getIdentifier(); + var identifierB = nodeB.getIdentifier(); + var index = getPrecedence(nodeA); + if (index === null) { + //node isn't in the list + return null; + } + var property = properties[index][identifierA]; + + if (property.hasOwnProperty('associativeWith') + && (property.associativeWith instanceof Array)) { + for (var i = 0; i < property.associativeWith.length; i++) { + if (property.associativeWith[i] === identifierB) { + return true; + } + } + return false; + } + + //associativeWith is not defined + return null; + } + + module.exports.properties = properties; + module.exports.getPrecedence = getPrecedence; + module.exports.getAssociativity = getAssociativity; + module.exports.isAssociativeWith = isAssociativeWith; + + +/***/ }, +/* 354 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + exports.symbols = { + // GREEK LETTERS + Alpha: 'A', alpha: '\\alpha', + Beta: 'B', beta: '\\beta', + Gamma: '\\Gamma', gamma: '\\gamma', + Delta: '\\Delta', delta: '\\delta', + Epsilon: 'E', epsilon: '\\epsilon', varepsilon: '\\varepsilon', + Zeta: 'Z', zeta: '\\zeta', + Eta: 'H', eta: '\\eta', + Theta: '\\Theta', theta: '\\theta', vartheta: '\\vartheta', + Iota: 'I', iota: '\\iota', + Kappa: 'K', kappa: '\\kappa', varkappa: '\\varkappa', + Lambda: '\\Lambda', lambda: '\\lambda', + Mu: 'M', mu: '\\mu', + Nu: 'N', nu: '\\nu', + Xi: '\\Xi', xi: '\\xi', + Omicron: 'O', omicron: 'o', + Pi: '\\Pi', pi: '\\pi', varpi: '\\varpi', + Rho: 'P', rho: '\\rho', varrho: '\\varrho', + Sigma: '\\Sigma', sigma: '\\sigma', varsigma: '\\varsigma', + Tau: 'T', tau: '\\tau', + Upsilon: '\\Upsilon', upsilon: '\\upsilon', + Phi: '\\Phi', phi: '\\phi', varphi: '\\varphi', + Chi: 'X', chi: '\\chi', + Psi: '\\Psi', psi: '\\psi', + Omega: '\\Omega', omega: '\\omega', + //logic + 'true': '\\mathrm{True}', + 'false': '\\mathrm{False}', + //other + i: 'i', //TODO use \i ?? + inf: '\\infty', + Inf: '\\infty', + infinity: '\\infty', + Infinity: '\\infty', + oo: '\\infty', + lim: '\\lim', + 'undefined': '\\mathbf{?}' + }; + + exports.operators = { + 'transpose': '^\\top', + 'factorial': '!', + 'pow': '^', + 'dotPow': '.^\\wedge', //TODO find ideal solution + 'unaryPlus': '+', + 'unaryMinus': '-', + 'bitNot': '~', //TODO find ideal solution + 'not': '\\neg', + 'multiply': '\\cdot', + 'divide': '\\frac', //TODO how to handle that properly? + 'dotMultiply': '.\\cdot', //TODO find ideal solution + 'dotDivide': '.:', //TODO find ideal solution + 'mod': '\\mod', + 'add': '+', + 'subtract': '-', + 'to': '\\rightarrow', + 'leftShift': '<<', + 'rightArithShift': '>>', + 'rightLogShift': '>>>', + 'equal': '=', + 'unequal': '\\neq', + 'smaller': '<', + 'larger': '>', + 'smallerEq': '\\leq', + 'largerEq': '\\geq', + 'bitAnd': '\\&', + 'bitXor': '\\underline{|}', + 'bitOr': '|', + 'and': '\\wedge', + 'xor': '\\veebar', + 'or': '\\vee' + }; + + + //create a comma separated list of function arguments + function functionArgs(args, callbacks) { + return args.map( function (arg) { + return arg.toTex(callbacks); + }).join(','); + } + + var defaultTemplate = '\\mathrm{%name%}\\left(%*%\\right)'; + + /* + * expand a template + * + * @param {String} template + * @param {String} name of the function + * @param {Array} arguments of the function ( Strings ) + **/ + function expandTemplate(template, name, args) { + //replace %name% with the variable 'name' + template = template.replace(/%name%/g, name); + + //replace %0%, %1% .... with the arguments in args + args.forEach(function (arg, index) { + template = template.replace(RegExp('%' + index + '%', 'g'), arg); + }); + + //replace %*% with a comma separated list of all arguments + template = template.replace('%*%', args.map(function (arg) { + return arg; + }).join(',')); + + //replace %% with %, this comes in handy when you need a % in your LaTeX string + template = template.replace('%%', '%'); + + return template; + } + + //this is a map containing all the latex converters for all the functions + var functions = { + //arithmetic + 'abs': '\\left|%0%\\right|', + 'add': '\\left(%0%+%1%\\right)', + 'ceil': '\\left\\lceil%0%\\right\\rceil', + 'cube': '\\left(%0%\\right)^3', + 'divide': '\\frac{%0%}{%1%}', + 'dotDivide': '\\left(%0%' + exports.operators['dotDivide'] + '%1%\\right)', + 'dotMultiply': '\\left(%0%' + exports.operators['dotMultiply'] + '%1%\\right)', + 'dotPow': '\\left(%0%' + exports.operators['dotPow'] + '%1%\\right)', + 'exp': '\\exp\\left(%0%\\right)', + 'fix': defaultTemplate, + 'floor': '\\left\\lfloor%0%\\right\\rfloor', + 'gcd': '\\gcd\\left(%*%\\right)', + 'lcm': defaultTemplate, + 'log10': '\\log_{10}\\left(%0%\\right)', + 'log': { + 1: '\\ln\\left(%0%\\right)', + 2: '\\log_{%1%}\\left(%0%\\right)' + }, + 'mod': '\\left(%0%' + exports.operators['mod'] + '%1%\\right)', + 'multiply': '\\left(%0%' + exports.operators['multiply'] + '%1%\\right)', + 'norm': { + 1: '\\left\\|%0%\\right\\|', + 2: defaultTemplate + }, + 'nthRoot': '\\sqrt[%1%]{%0%}', + 'pow': '\\left(%0%\\right)' + exports.operators['pow'] + '{%1%}', + 'round': { + 1: '\\left\\lfloor%0%\\right\\rceil', + 2: defaultTemplate + }, + 'sign': defaultTemplate, + 'sqrt': '\\sqrt{%0%}', + 'square': '\\left(%0%\\right)^2', + 'subtract': '\\left(%0%' + exports.operators['subtract'] + '%1%\\right)', + 'unaryMinus': exports.operators['unaryMinus'] + '\\left(%0%\\right)', + 'unaryPlus': exports.operators['unaryPlus'] + '\\left(%0%\\right)', + 'xgcd': defaultTemplate, + + //bitwise + 'bitAnd': '\\left(%0%' + exports.operators['bitAnd'] + '%1%\\right)', + 'bitOr': '\\left(%0%' + exports.operators['bitOr'] + '%1%\\right)', + 'bitXor': '\\left(%0%' + exports.operators['bitXor'] + '%1%\\right)', + 'bitNot': exports.operators['bitNot'] + '\\left(%0%\\right)', + 'leftShift': '\\left(%0%' + exports.operators['leftShift'] + '%1%\\right)', + 'rightArithShift': '\\left(%0%' + exports.operators['rightArithShift'] + '%1%\\right)', + 'rightLogShift': '\\left(%0%' + exports.operators['rightLogShift'] + '%1%\\right)', + + //complex + 'arg': '\\arg\\left(%0%\\right)', + 'conj': '\\left(%0%\\right)^*', + 'im': '\\Im\\left\\lbrace%0%\\right\\rbrace', + 're': '\\Re\\left\\lbrace%0%\\right\\rbrace', + + //construction + 'bignumber': { + 0: '0', + 1: '\\left(%0%\\right)' + }, + 'boolean': defaultTemplate, + 'chain': defaultTemplate, + 'complex': { + 0: '0', + 1: '\\left(%0%\\right)', + 2: '\\left(\\left(%0%\\right)+' + + exports.symbols['i'] + '\\cdot\\left(%1%\\right)\\right)', + }, + 'index': defaultTemplate, + 'matrix': { + 0: '\\begin{bmatrix}\\end{bmatrix}', + 1: '\\left(%0%\\right)', + 2: '\\left(%0%\\right)' + }, + 'number': { + 0: '0', + 1: '\\left(%0%\\right)', + 2: '\\left(\\left(%0%\\right)%1%\\right)' + }, + 'parser': defaultTemplate, + 'sparse': { + 0: '\\begin{bsparse}\\end{bsparse}', + 1: '\\left(%0%\\right)' + }, + 'string': { + 0: '""', + 1: function (node) { + return '"' + node.args[0].toString() + '"'; + } + }, + 'unit': { + 1: '\\left(%0%\\right)', + 2: '\\left(\\left(%0%\\right)%1%\\right)' + }, + + //expression TODO does the default even work in this case? (.toTex on the args) + 'compile': defaultTemplate, + 'eval': defaultTemplate, + 'help': defaultTemplate, + 'parse': defaultTemplate, + + //logical + 'and': '\\left(%0%' + exports.operators['and'] + '%1%\\right)', + 'not': exports.operators['not'] + '\\left(%0%\\right)', + 'or': '\\left(%0%' + exports.operators['or'] + '%1%\\right)', + 'xor': '\\left(%0%' + exports.operators['xor'] + '%1%\\right)', + + //matrix + 'concat': defaultTemplate, + 'cross': '\\left(%0%\\right)\\times\\left(%1%\\right)', + 'det': '\\det\\left(%0%\\right)', + 'diag': defaultTemplate, + 'dot': '\\left(%0%\\cdot%1%\\right)', + 'eye': defaultTemplate, + 'flatten': defaultTemplate, + 'inv': '\\left(%0%\\right)^{-1}', + 'ones': defaultTemplate, + 'range': defaultTemplate, + 'resize': defaultTemplate, + 'size': defaultTemplate, + 'squeeze': defaultTemplate, + 'subset': defaultTemplate, + 'trace': '\\mathrm{tr}\\left(%0%\\right)', + 'transpose': '\\left(%0%\\right)' + exports.operators['transpose'], + 'zeros': defaultTemplate, + + //probability + 'combinations': '\\binom{%0%}{%1%}', + 'distribution': defaultTemplate, + 'factorial': '\\left(%0%\\right)' + exports.operators['factorial'], + 'gamma': '\\Gamma\\left(%0%\\right)', + 'permutations': defaultTemplate, + 'pickRandom': defaultTemplate, + 'randomInt': defaultTemplate, + 'random': defaultTemplate, + + //relational + 'compare': defaultTemplate, + 'deepEqual': defaultTemplate, + 'equal': '\\left(%0%' + exports.operators['equal'] + '%1%\\right)', + 'largerEq': '\\left(%0%' + exports.operators['largerEq'] + '%1%\\right)', + 'larger': '\\left(%0%' + exports.operators['larger'] + '%1%\\right)', + 'smallerEq': '\\left(%0%' + exports.operators['smallerEq'] + '%1%\\right)', + 'smaller': '\\left(%0%' + exports.operators['smaller'] + '%1%\\right)', + 'unequal': '\\left(%0%' + exports.operators['unequal'] + '%1%\\right)', + + //statistics + 'max': '\\max\\left(%*%\\right)', + 'mean': defaultTemplate, + 'median': defaultTemplate, + 'min': '\\min\\left(%*%\\right)', + 'prod': defaultTemplate, + 'std': defaultTemplate, + 'sum': defaultTemplate, + 'var': '\\mathrm{Var}\\left(%*%\\right)', + + //trigonometry + 'acosh': '\\cosh^{-1}\\left(%0%\\right)', + 'acos': '\\cos^{-1}\\left(%0%\\right)', + 'acoth': '\\coth^{-1}\\left(%0%\\right)', + 'acot': '\\cot^{-1}\\left(%0%\\right)', + 'acsch': '\\mathrm{csch}^{-1}\\left(%0%\\right)', + 'acsc': '\\csc^{-1}\\left(%0%\\right)', + 'asech': '\\mathrm{sech}^{-1}\\left(%0%\\right)', + 'asec': '\\sec^{-1}\\left(%0%\\right)', + 'asinh': '\\sinh^{-1}\\left(%0%\\right)', + 'asin': '\\sin^{-1}\\left(%0%\\right)', + 'atan2': '\\mathrm{atan2}\\left(%*%\\right)', + 'atanh': '\\tanh^{-1}\\left(%0%\\right)', + 'atan': '\\tan^{-1}\\left(%0%\\right)', + 'cosh': '\\cosh\\left(%0%\\right)', + 'cos': '\\cos\\left(%0%\\right)', + 'coth': '\\coth\\left(%0%\\right)', + 'cot': '\\cot\\left(%0%\\right)', + 'csch': '\\mathrm{csch}\\left(%0%\\right)', + 'csc': '\\csc\\left(%0%\\right)', + 'sech': '\\mathrm{sech}\\left(%0%\\right)', + 'sec': '\\sec\\left(%0%\\right)', + 'sinh': '\\sinh\\left(%0%\\right)', + 'sin': '\\sin\\left(%0%\\right)', + 'tanh': '\\tanh\\left(%0%\\right)', + 'tan': '\\tan\\left(%0%\\right)', + + //units + 'to': '\\left(%0%' + exports.operators['to'] + '%1%\\right)', + + //utils + 'clone': defaultTemplate, + 'filter': defaultTemplate, + 'forEach': defaultTemplate, + 'format': defaultTemplate, + 'import': defaultTemplate, + 'map': defaultTemplate, + 'print': defaultTemplate, + 'sort': defaultTemplate, + 'typeof': defaultTemplate + }; + + var units = { + deg: '^\\circ' + }; + + //FIXME find a good solution so that single characters still + //get rendered in regular italic whereas single character units + //are rendered with \mathrm + exports.toSymbol = function (name) { + if (units.hasOwnProperty(name)) { + return units[name]; + } + + if (exports.symbols.hasOwnProperty(name)) { + return exports.symbols[name]; + } + else if (name.indexOf('_') !== -1) { + //symbol with index (eg. alpha_1) + var index = name.indexOf('_'); + return exports.toSymbol(name.substring(0, index)) + '_{' + + exports.toSymbol(name.substring(index + 1)) + '}'; + } + return '\\mathrm{' + name + '}'; + }; + + //returns the latex output for a given function + exports.toFunction = function (node, callbacks, name) { + var latexConverter = functions[name]; + var args = node.args.map(function (arg) { //get LaTeX of the arguments + return arg.toTex(callbacks); + }); + + switch (typeof latexConverter) { + case 'function': //a callback function + return latexConverter(node, callbacks); + case 'string': //a template string + return expandTemplate(latexConverter, name, args); + case 'object': //an object with different "converters" for different numbers of arguments + switch (typeof latexConverter[args.length]) { + case 'function': + return latexConverter[args.length](node, callbacks); + case 'string': + return expandTemplate(latexConverter[args.length], name, args); + } + //no break here! That's intentionally + default: + return expandTemplate(defaultTemplate, name, args); + } + } + + +/***/ }, +/* 355 */ +/***/ function(module, exports, __webpack_require__) { + + 'use strict'; + + var util = __webpack_require__(171); + + var string = util.string; + var array = util.array; + var object = util.object; + + var isArray = Array.isArray; + + function factory (type, config, load, typed) { + + var Matrix = type.Matrix; + + /** + * Validates matrix and column vector b for backward/forward substitution algorithms. + * + * @param {Matrix} m An N x N matrix + * @param {Array | Matrix} b A column vector + * + * @return {Array} Dense copy of column vector b + */ + var substitutionValidation = function (m, b) { + // matrix size + var size = m.size(); + // validate matrix dimensions + if (size.length !== 2) + throw new RangeError('Matrix must be two dimensional (size: ' + string.format(size) + ')'); + // rows & columns + var rows = size[0]; + var columns = size[1]; + // validate rows & columns + if (rows !== columns) + throw new RangeError('Matrix must be square (size: ' + string.format(size) + ')'); + // check b is matrix + if (b instanceof Matrix) { + // matrix size + var msize = b.size(); + // check matrix dimensions, vector + if (msize.length === 1) { + // check vector length + if (msize[0] !== rows) + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + } + else if (msize.length === 2) { + // array must be a column vector + if (msize[0] !== rows || msize[1] !== 1) + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + } + else { + // throw error + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + } + // dense copy of column vector + var x = new Array(rows); + // copy values (skip zeros) + b.forEach(function (v, index) { + x[index[0]] = object.clone(v); + }, true); + // return vector + return x; + } + // check b is array + if (isArray(b)) { + // size + var asize = array.size(b); + // check matrix dimensions, vector + if (asize.length === 1) { + // check vector length + if (asize[0] !== rows) + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + // return copy of b + return object.clone(b); + } + if (asize.length === 2) { + // array must be a column vector + if (asize[0] !== rows || asize[1] !== 1) + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + // loop rows in array, return copy of column vector + return b.map(function (v) { + return object.clone(v[0]); + }); + } + // throw error + throw new RangeError('Dimension mismatch. Matrix columns must match vector length.'); + } + }; + + return substitutionValidation; + } + + exports.name = 'substitutionValidation'; + exports.factory = factory; + +/***/ }, +/* 356 */ +/***/ function(module, exports, __webpack_require__) { + + var __WEBPACK_AMD_DEFINE_FACTORY__, __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/** + * typed-function * - * @param {function} fn The function to be memoized. Must be a pure function. - * @return {function} Returns the memoized function + * Type checking for JavaScript functions + * + * https://github.com/josdejong/typed-function */ - exports.memoize = function(fn) { - return function memoize() { - if (typeof memoize.cache !== 'object') { - memoize.cache = {}; - } - - var hash = JSON.stringify(arguments); - if (!(hash in memoize.cache)) { - return memoize.cache[hash] = fn.apply(fn, arguments); - } - return memoize.cache[hash]; - }; - }; - - -/***/ }, -/* 338 */ -/***/ function(module, exports, __webpack_require__) { - 'use strict'; - // Reserved keywords not allowed to use in the parser - module.exports = { - end: true - }; - - -/***/ }, -/* 339 */ -/***/ function(module, exports, __webpack_require__) { - - 'use strict'; - - // FIXME: remove dependencies on Nodes - var ArrayNode = __webpack_require__(172); - var OperatorNode = __webpack_require__(181); - var SymbolNode = __webpack_require__(183); - var ConstantNode = __webpack_require__(176); - - // GREEK LETTERS - var greek = { - Alpha: 'A', alpha: true, - Beta: 'B', beta: true, - Gamma: true, gamma: true, - Delta: true, delta: true, - Epsilon: 'E', epsilon: true, varepsilon: true, - Zeta: 'Z', zeta: true, - Eta: 'H', eta: true, - Theta: true, theta: true, vartheta: true, - Iota: 'I', iota: true, - Kappa: 'K', kappa: true, varkappa: true, - Lambda: true, lambda: true, - Mu: 'M', mu: true, - Nu: 'N', nu: true, - Xi: true, xi: true, - Omicron: 'O', omicron: true, - Pi: true, pi: true, varpi: true, - Rho: 'P', rho: true, varrho: true, - Sigma: true, sigma: true, varsigma: true, - Tau: 'T', tau: true, - Upsilon: true, upsilon: true, - Phi: true, phi: true, varphi: true, - Chi: 'X', chi: true, - Psi: true, psi: true, - Omega: true, omega: true - }; - - var dots = { - dots: true, - ldots: true, - cdots: true, - vdots: true, - ddots: true, - idots: true - }; - - var logic = { - 'true': '\\mathrm{True}', - 'false': '\\mathrm{False}' - }; - - var other = { - inf: '\\infty', - Inf: '\\infty', - infinity: '\\infty', - Infinity: '\\infty', - oo: '\\infty', - lim: true, - 'undefined': '\\mathbf{?}' - }; - - // FUNCTIONS - var functions = { - acos: '\\cos^{-1}', - arccos: '\\cos^{-1}', - cos: true, - csc: true, - csch: false, - exp: true, - ker: true, - limsup: true, - min: true, - sinh: true, - asin: '\\sin^{-1}', - arcsin: '\\sin^{-1}', - cosh: true, - deg: true, - gcd: true, - lg: true, - ln: true, - Pr: true, - sup: true, - atan: '\\tan^{-1}', - atan2: '\\tan2^{-1}', - arctan: '\\tan^{-1}', - cot: true, - det: true, - hom: true, - log: true, - log10: '\\log_{10}', - sec: true, - sech: false, - tan: true, - arg: true, - coth: true, - dim: true, - inf: true, - max: true, - sin: true, - tanh: true, - - fix: false, - lcm: false, - sign: false, - xgcd: false, - unaryMinus: false, - unaryPlus: false, - - // complex - complex: false, - conj: false, - im: false, - re: false, - - // matrix - diag: false, - resize: false, - size: false, - squeeze: false, - subset: false, - index: false, - ones: false, - zeros: false, - range: false, - - // probability - random: false, - - // statistics - mean: '\\mu', - median: false, - prod: false, - std: '\\sigma', - 'var': '\\sigma^2' - }; - - // CURLY FUNCTIONS - // wrap parameters with {} - var curlyFunctions = { - sqrt: true, - inv: true, - int: '\\int', - Int: '\\int', - integrate: '\\int', - eigenvalues: '\\lambda', - liminf: true, - lim: true, - exp: 'e^', - sum: true, - - eye: '\\mathbf{I}' - }; - - var operators = { - '<=': '\\leq', - '>=': '\\geq', - '!=': '\\neq', - 'in': true, - '*': '\\cdot', - '/': '\\frac', - 'mod': '\\bmod', - 'to': '\\rightarrow' - }; - - var units = { - deg: '^{\\circ}' - }; - - var symbols = {}; - - function mapSymbols() { - var args = Array.prototype.slice.call(arguments), - obj; - for (var i = 0, len = args.length; i < len; i++) { - obj = args[i]; - for (var key in obj) { - if (obj.hasOwnProperty(key)) { - symbols[key] = obj[key]; - } - } + (function (factory) { + if (true) { + // AMD. Register as an anonymous module. + !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory), __WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ? (__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); + } else if (typeof exports === 'object') { + // OldNode. Does not work with strict CommonJS, but + // only CommonJS-like environments that support module.exports, + // like OldNode. + module.exports = factory(); + } else { + // Browser globals (root is window) + window.typed = factory(); } - } + }(function () { + /** + * Get a type test function for a specific data type + * @param {string} type A data type like 'number' or 'string' + * @returns {function(obj: *) : boolean} Returns a type testing function. + * Throws an error for an unknown type. + */ + function getTypeTest(type) { + var test = typed.types[type]; + if (!test) { + var hint; + for (var name in typed.types) { + if (typed.types.hasOwnProperty(name)) { + if (name.toLowerCase() == type.toLowerCase()) { + hint = name; + break; + } + } + } - mapSymbols( - functions, - curlyFunctions, - greek, - dots, - logic, - other - ); + throw new Error('Unknown type "' + type + '"' + + (hint ? ('. Did you mean "' + hint + '"?') : '')); + } + return test; + } - function latexIs(arr, value) { - return typeof arr[value] !== 'undefined'; - } + /** + * Create an ArgumentsError. Creates messages like: + * + * Unexpected type of argument (expected: ..., actual: ..., index: ...) + * Too few arguments (expected: ..., index: ...) + * Too many arguments (expected: ..., actual: ...) + * + * @param {String} fn Function name + * @param {number} argCount Number of arguments + * @param {Number} index Current argument index + * @param {*} actual Current argument + * @param {string} [expected] An optional, comma separated string with + * expected types on given index + * @extends Error + */ + function createError(fn, argCount, index, actual, expected) { + var actualType = getTypeOf(actual); + var _expected = expected ? expected.split(',') : null; + var anyType = _expected && contains(_expected, 'any'); + var message; + var data = { + fn: fn, + index: index, + actual: actual, + expected: _expected + }; - function latexIsFn(arr) { - return function(value) { - return latexIs(arr, value); - }; - } + //console.log('createError', fn, args, index, expected) // TODO: cleanup - function latexToFn(arr) { - return function(value) { - if (typeof arr[value] === 'boolean') { - if (arr[value] === true) { - value = '\\' + value; + // TODO: add function name to the message + if (_expected) { + if (argCount > index && !anyType) { + // unexpected type + message = 'Unexpected type of argument' + + ' (expected: ' + _expected.join(' or ') + ', actual: ' + actualType + ', index: ' + index + ')'; } else { - value = '\\mathrm{' + value + '}'; + // too few arguments + message = 'Too few arguments' + + ' (expected: ' + _expected.join(' or ') + ', index: ' + index + ')'; } } - else if (typeof arr[value] === 'string') { - value = arr[value]; + else { + // too many arguments + message = 'Too many arguments' + + ' (expected: ' + index + ', actual: ' + argCount + ')' } - else if (typeof value === 'string') { - var index = value.indexOf('_'); - if (index !== -1) { - value = exports.toSymbol(value.substring(0, index)) + '_{' + - exports.toSymbol(value.substring(index+1)) + '}'; + + var err = new TypeError(message); + err.data = data; + return err; + } + + /** + * Collection with function references (local shortcuts to functions) + * @constructor + * @param {string} [name='refs'] Optional name for the refs, used to generate + * JavaScript code + */ + function Refs(name) { + this.name = name || 'refs'; + this.categories = {}; + } + + /** + * Add a function reference. + * @param {function} fn + * @param {string} [category='fn'] A function category, like 'fn' or 'signature' + * @returns {string} Returns the function name, for example 'fn0' or 'signature2' + */ + Refs.prototype.add = function (fn, category) { + var cat = category || 'fn'; + if (!this.categories[cat]) this.categories[cat] = []; + + var index = this.categories[cat].indexOf(fn); + if (index == -1) { + index = this.categories[cat].length; + this.categories[cat].push(fn); + } + + return cat + index; + }; + + /** + * Create code lines for all function references + * @returns {string} Returns the code containing all function references + */ + Refs.prototype.toCode = function () { + var code = []; + var path = this.name + '.categories'; + var categories = this.categories; + + for (var cat in categories) { + if (categories.hasOwnProperty(cat)) { + var category = categories[cat]; + + for (var i = 0; i < category.length; i++) { + code.push('var ' + cat + i + ' = ' + path + '[\'' + cat + '\'][' + i + '];'); + } } } - return value; + return code.join('\n'); }; - } - exports.isSymbol = latexIsFn(symbols); - exports.toSymbol = latexToFn(symbols); - - exports.isFunction = latexIsFn(functions); - exports.toFunction = latexToFn(functions); - - exports.isCurlyFunction = latexIsFn(curlyFunctions); - exports.toCurlyFunction = latexToFn(curlyFunctions); - - exports.isOperator = latexIsFn(operators); - exports.toOperator = latexToFn(operators); - - exports.isUnit = latexIsFn(units); - exports.toUnit = (function() { - var _toUnit = latexToFn(units); - - return function(value, notSpaced) { - if (exports.isUnit(value)) { - return _toUnit(value); + /** + * A function parameter + * @param {string | string[] | Param} types A parameter type like 'string', + * 'number | boolean' + * @param {boolean} [varArgs=false] Variable arguments if true + * @constructor + */ + function Param(types, varArgs) { + // parse the types, can be a string with types separated by pipe characters | + if (typeof types === 'string') { + // parse variable arguments operator (ellipses '...number') + var _types = types.trim(); + var _varArgs = _types.substr(0, 3) === '...'; + if (_varArgs) { + _types = _types.substr(3); + } + if (_types === '') { + this.types = ['any']; + } + else { + this.types = _types.split('|'); + for (var i = 0; i < this.types.length; i++) { + this.types[i] = this.types[i].trim(); + } + } + } + else if (Array.isArray(types)) { + this.types = types; + } + else if (types instanceof Param) { + return types.clone(); + } + else { + throw new Error('String or Array expected'); } - return (notSpaced ? '' : '\\,') + '\\mathrm{' + value + '}'; + // can hold a type to which to convert when handling this parameter + this.conversions = []; + // TODO: better implement support for conversions, be able to add conversions via constructor (support a new type Object?) + + // variable arguments + this.varArgs = _varArgs || varArgs || false; + + // check for any type arguments + this.anyType = this.types.indexOf('any') !== -1; + } + + /** + * Order Params + * any type ('any') will be ordered last, and object as second last (as other + * types may be an object as well, like Array). + * + * @param {Param} a + * @param {Param} b + * @returns {number} Returns 1 if a > b, -1 if a < b, and else 0. + */ + Param.compare = function (a, b) { + if (a.anyType) return 1; + if (b.anyType) return -1; + + if (contains(a.types, 'Object')) return 1; + if (contains(b.types, 'Object')) return -1; + + if (a.hasConversions()) { + if (b.hasConversions()) { + var i, ac, bc; + + for (i = 0; i < a.conversions.length; i++) { + if (a.conversions[i] !== undefined) { + ac = a.conversions[i]; + break; + } + } + + for (i = 0; i < b.conversions.length; i++) { + if (b.conversions[i] !== undefined) { + bc = b.conversions[i]; + break; + } + } + + return typed.conversions.indexOf(ac) - typed.conversions.indexOf(bc); + } + else { + return 1; + } + } + else { + if (b.hasConversions()) { + return -1; + } + } + + return 0; }; - }()); - exports.addBraces = function(s, brace, type) { - if (brace === null) { - return s; + /** + * Test whether this parameters types overlap an other parameters types. + * @param {Param} other + * @return {boolean} Returns true when there are conflicting types + */ + Param.prototype.overlapping = function (other) { + for (var i = 0; i < this.types.length; i++) { + if (contains(other.types, this.types[i])) { + return true; + } + } + return false; + }; + + /** + * Create a clone of this param + * @returns {Param} Returns a cloned version of this param + */ + Param.prototype.clone = function () { + var param = new Param(this.types.slice(), this.varArgs); + param.conversions = this.conversions.slice(); + return param; + }; + + /** + * Test whether this parameter contains conversions + * @returns {boolean} Returns true if the parameter contains one or + * multiple conversions. + */ + Param.prototype.hasConversions = function () { + return this.conversions.length > 0; + }; + + /** + * Return a string representation of this params types, like 'string' or + * 'number | boolean' or '...number' + * @param {boolean} [toConversion] If true, the returned types string + * contains the types where the parameter + * will convert to. If false (default) + * the "from" types are returned + * @returns {string} + */ + Param.prototype.toString = function (toConversion) { + var types = []; + var keys = {}; + + for (var i = 0; i < this.types.length; i++) { + var conversion = this.conversions[i]; + var type = toConversion && conversion ? conversion.to : this.types[i]; + if (!(type in keys)) { + keys[type] = true; + types.push(type); + } + } + + return (this.varArgs ? '...' : '') + types.join('|'); + }; + + /** + * A function signature + * @param {string | string[] | Param[]} params + * Array with the type(s) of each parameter, + * or a comma separated string with types + * @param {function} fn The actual function + * @constructor + */ + function Signature(params, fn) { + var _params; + if (typeof params === 'string') { + _params = (params !== '') ? params.split(',') : []; + } + else if (Array.isArray(params)) { + _params = params; + } + else { + throw new Error('string or Array expected'); + } + + this.params = new Array(_params.length); + for (var i = 0; i < _params.length; i++) { + var param = new Param(_params[i]); + this.params[i] = param; + if (i === _params.length - 1) { + // the last argument + this.varArgs = param.varArgs; + } + else { + // non-last argument + if (param.varArgs) { + throw new SyntaxError('Unexpected variable arguments operator "..."'); + } + } + } + + this.fn = fn; } - var braces = ['', '']; - type = type || 'normal'; + /** + * Create a clone of this signature + * @returns {Signature} Returns a cloned version of this signature + */ + Signature.prototype.clone = function () { + return new Signature(this.params.slice(), this.fn); + }; - if (typeof brace === 'undefined' || brace === false) { - braces = ['{', '}']; - } - else if (brace === true) { - braces = ['(', ')']; - type = 'lr'; - } - else if (Array.isArray(brace) && brace.length === 2) { - braces = brace; - } - else { - braces = [brace, brace]; - } + /** + * Expand a signature: split params with union types in separate signatures + * For example split a Signature "string | number" into two signatures. + * @return {Signature[]} Returns an array with signatures (at least one) + */ + Signature.prototype.expand = function () { + var signatures = []; - switch (type) { - case 'normal': - case false: - return braces[0] + s + braces[1]; + function recurse(signature, path) { + if (path.length < signature.params.length) { + var i, newParam, conversion; - case 'lr': - return '\\left' + braces[0] + '{' + s + '}' + '\\right' + braces[1]; + var param = signature.params[path.length]; + if (param.varArgs) { + // a variable argument. do not split the types in the parameter + newParam = param.clone(); - case 'be': - return '\\begin{' + braces[0] + '}' + s + '\\end{' + braces[1] + '}'; - } + // add conversions to the parameter + // recurse for all conversions + for (i = 0; i < typed.conversions.length; i++) { + conversion = typed.conversions[i]; + if (!contains(param.types, conversion.from) && contains(param.types, conversion.to)) { + var j = newParam.types.length; + newParam.types[j] = conversion.from; + newParam.conversions[j] = conversion; + } + } - return braces[0] + s + braces[1]; - }; - - exports.toArgs = function(that) { - var name = that.name, - args = that.args, - func = exports.toSymbol(that.name), - texParams = null, - brace = null, - type = false, - showFunc = false, - prefix = '', - suffix = '', - op = null; - - switch (name) { - // OPERATORS - case 'add': - op = '+'; - break; - - case 'subtract': - op = '-'; - break; - - case 'larger': - op = '>'; - break; - - case 'largerEq': - op = '>='; - break; - - case 'smaller': - op = '<'; - break; - - case 'smallerEq': - op = '<='; - break; - - case 'unequal': - op = '!='; - break; - - case 'equal': - op = '='; - break; - - case 'mod': - op = 'mod'; - break; - - case 'multiply': - op = '*'; - break; - - case 'pow': - op = '^'; - break; - - case 'concat': - op = '||'; - break; - - case 'factorial': - op = '!'; - break; - - case 'permutations': - if (args.length === 1) { - if (args[0] instanceof SymbolNode || args[0] instanceof ConstantNode) { - op = '!'; + recurse(signature, path.concat(newParam)); } else { - return '{\\left(' + args[0].toTex() + '\\right)!}'; + // split each type in the parameter + for (i = 0; i < param.types.length; i++) { + recurse(signature, path.concat(new Param(param.types[i]))); + } + + // recurse for all conversions + for (i = 0; i < typed.conversions.length; i++) { + conversion = typed.conversions[i]; + if (!contains(param.types, conversion.from) && contains(param.types, conversion.to)) { + newParam = new Param(conversion.from); + newParam.conversions[0] = conversion; + recurse(signature, path.concat(newParam)); + } + } } } else { - // op = 'P'; - var n = args[0].toTex(), - k = args[1].toTex(); - return '\\frac{' + n + '!}{\\left(' + n + ' - ' + k + '\\right)!}'; + signatures.push(new Signature(path, signature.fn)); } - break; + } + recurse(this, []); - // probability - case 'combinations': - op = '\\choose'; - break; + return signatures; + }; - // LR BRACES - case 'abs': - brace = '|'; - type = 'lr'; - break; + /** + * Compare two signatures. + * + * When two params are equal and contain conversions, they will be sorted + * by lowest index of the first conversions. + * + * @param {Signature} a + * @param {Signature} b + * @returns {number} Returns 1 if a > b, -1 if a < b, and else 0. + */ + Signature.compare = function (a, b) { + if (a.params.length > b.params.length) return 1; + if (a.params.length < b.params.length) return -1; - case 'norm': - brace = '\\|'; - type = 'lr'; + // count the number of conversions + var i; + var len = a.params.length; // a and b have equal amount of params + var ac = 0; + var bc = 0; + for (i = 0; i < len; i++) { + if (a.params[i].hasConversions()) ac++; + if (b.params[i].hasConversions()) bc++; + } - if (args.length === 2) { - var tmp = args[1].toTex(); + if (ac > bc) return 1; + if (ac < bc) return -1; - if (tmp === '\\text{inf}') { - tmp = '\\infty'; + // compare the conversion index per parameter + for (i = 0; i < a.params.length; i++) { + var cmp = Param.compare(a.params[i], b.params[i]); + if (cmp !== 0) { + return cmp; + } + } + + return 0; + }; + + /** + * Test whether any of the signatures parameters has conversions + * @return {boolean} Returns true when any of the parameters contains + * conversions. + */ + Signature.prototype.hasConversions = function () { + for (var i = 0; i < this.params.length; i++) { + if (this.params[i].hasConversions()) { + return true; + } + } + return false; + }; + + /** + * Generate the code to invoke this signature + * @param {Refs} refs + * @param {string} prefix + * @returns {string} Returns code + */ + Signature.prototype.toCode = function (refs, prefix) { + var code = []; + + var args = new Array(this.params.length); + for (var i = 0; i < this.params.length; i++) { + var param = this.params[i]; + var conversion = param.conversions[0]; + if (param.varArgs) { + args[i] = 'varArgs'; + } + else if (conversion) { + args[i] = refs.add(conversion.convert, 'convert') + '(arg' + i + ')'; + } + else { + args[i] = 'arg' + i; + } + } + + var ref = this.fn ? refs.add(this.fn, 'signature') : undefined; + if (ref) { + return prefix + 'return ' + ref + '(' + args.join(', ') + '); // signature: ' + this.params.join(', '); + } + + return code.join('\n'); + }; + + /** + * Return a string representation of the signature + * @returns {string} + */ + Signature.prototype.toString = function () { + return this.params.join(', '); + }; + + /** + * A group of signatures with the same parameter on given index + * @param {Param[]} path + * @param {Signature} [signature] + * @param {Node[]} childs + * @constructor + */ + function Node(path, signature, childs) { + this.path = path || []; + this.param = path[path.length - 1] || null; + this.signature = signature || null; + this.childs = childs || []; + } + + /** + * Generate code for this group of signatures + * @param {Refs} refs + * @param {string} prefix + * @param {Node | undefined} [anyType] Sibling of this node with any type parameter + * @returns {string} Returns the code as string + */ + Node.prototype.toCode = function (refs, prefix, anyType) { + // TODO: split this function in multiple functions, it's too large + var code = []; + + if (this.param) { + var index = this.path.length - 1; + var conversion = this.param.conversions[0]; + var comment = '// type: ' + (conversion ? + (conversion.from + ' (convert to ' + conversion.to + ')') : + this.param); + + // non-root node (path is non-empty) + if (this.param.varArgs) { + if (this.param.anyType) { + // variable arguments with any type + code.push(prefix + 'if (arguments.length > ' + index + ') {'); + code.push(prefix + ' var varArgs = [];'); + code.push(prefix + ' for (var i = ' + index + '; i < arguments.length; i++) {'); + code.push(prefix + ' varArgs.push(arguments[i]);'); + code.push(prefix + ' }'); + code.push(this.signature.toCode(refs, prefix + ' ')); + code.push(prefix + '}'); } - else if (tmp === '\\text{-inf}') { - tmp = '{- \\infty}'; + else { + // variable arguments with a fixed type + var getTests = function (types, arg) { + var tests = new Array(types.length); + for (var i = 0; i < types.length; i++) { + tests[i] = refs.add(getTypeTest(types[i]), 'test') + '(' + arg + ')'; + } + return tests.join(' || '); + }.bind(this); + + var allTypes = this.param.types; + var exactTypes = []; + for (var i = 0; i < allTypes.length; i++) { + if (this.param.conversions[i] === undefined) { + exactTypes.push(allTypes[i]); + } + } + + code.push(prefix + 'if (' + getTests(allTypes, 'arg' + index) + ') { ' + comment); + code.push(prefix + ' var varArgs = [arg' + index + '];'); + code.push(prefix + ' for (var i = ' + (index + 1) + '; i < arguments.length; i++) {'); + code.push(prefix + ' if (' + getTests(exactTypes, 'arguments[i]') + ') {'); + code.push(prefix + ' varArgs.push(arguments[i]);'); + + for (var i = 0; i < allTypes.length; i++) { + var conversion_i = this.param.conversions[i]; + if (conversion_i) { + var test = refs.add(getTypeTest(allTypes[i]), 'test'); + var convert = refs.add(conversion_i.convert, 'convert'); + code.push(prefix + ' }'); + code.push(prefix + ' else if (' + test + '(arguments[i])) {'); + code.push(prefix + ' varArgs.push(' + convert + '(arguments[i]));'); + } + } + code.push(prefix + ' } else {'); + code.push(prefix + ' throw createError(\'\', arguments.length, i, arguments[i], \'' + allTypes.join(',') + '\');'); + code.push(prefix + ' }'); + code.push(prefix + ' }'); + code.push(this.signature.toCode(refs, prefix + ' ')); + code.push(prefix + '}'); } - else if (tmp === '\\text{fro}') { - tmp = 'F'; + } + else { + if (this.param.anyType) { + // any type + code.push(prefix + '// type: any'); + code.push(this._innerCode(refs, prefix, anyType)); + } + else { + // regular type + var type = this.param.types[0]; + var test = type !== 'any' ? refs.add(getTypeTest(type), 'test') : null; + + code.push(prefix + 'if (' + test + '(arg' + index + ')) { ' + comment); + code.push(this._innerCode(refs, prefix + ' ', anyType)); + code.push(prefix + '}'); + } + } + } + else { + // root node (path is empty) + code.push(this._innerCode(refs, prefix, anyType)); + } + + return code.join('\n'); + }; + + /** + * Generate inner code for this group of signatures. + * This is a helper function of Node.prototype.toCode + * @param {Refs} refs + * @param {string} prefix + * @param {Node | undefined} [anyType] Sibling of this node with any type parameter + * @returns {string} Returns the inner code as string + * @private + */ + Node.prototype._innerCode = function(refs, prefix, anyType) { + var code = []; + var i; + + if (this.signature) { + code.push(prefix + 'if (arguments.length === ' + this.path.length + ') {'); + code.push(this.signature.toCode(refs, prefix + ' ')); + code.push(prefix + '}'); + } + + var nextAnyType; + for (i = 0; i < this.childs.length; i++) { + if (this.childs[i].param.anyType) { + nextAnyType = this.childs[i]; + break; + } + } + + for (i = 0; i < this.childs.length; i++) { + code.push(this.childs[i].toCode(refs, prefix, nextAnyType)); + } + + if (anyType && !this.param.anyType) { + code.push(anyType.toCode(refs, prefix, nextAnyType)); + } + + var exceptions = this._exceptions(refs, prefix); + if (exceptions) { + code.push(exceptions); + } + + return code.join('\n'); + }; + + /** + * Generate code to throw exceptions + * @param {Refs} refs + * @param {string} prefix + * @returns {string} Returns the inner code as string + * @private + */ + Node.prototype._exceptions = function (refs, prefix) { + var index = this.path.length; + + // TODO: add function name to exceptions + if (this.childs.length === 0) { + // TODO: can this condition be simplified? (we have a fall-through here) + return [ + prefix + 'if (arguments.length > ' + index + ') {', + prefix + ' throw createError(\'\', arguments.length, ' + index + ', arguments[' + index + ']);', + prefix + '}' + ].join('\n'); + } + else { + var keys = {}; + var types = []; + + for (var i = 0; i < this.childs.length; i++) { + var node = this.childs[i]; + if (node.param) { + for (var j = 0; j < node.param.types.length; j++) { + var type = node.param.types[j]; + if (!(type in keys)) { + keys[type] = true; + types.push(type); + } + } + } + } + + return prefix + 'throw createError(\'\', arguments.length, ' + index + ', arguments[' + index + '], \'' + types.join(',') + '\');'; + } + }; + + /** + * Split all raw signatures into an array with expanded Signatures + * @param {Object.} rawSignatures + * @return {Signature[]} Returns an array with expanded signatures + */ + function parseSignatures(rawSignatures) { + // FIXME: need to have deterministic ordering of signatures, do not create via object + var signature; + var keys = {}; + var signatures = []; + var i; + + for (var types in rawSignatures) { + if (rawSignatures.hasOwnProperty(types)) { + var fn = rawSignatures[types]; + signature = new Signature(types, fn); + + var expanded = signature.expand(); + + for (i = 0; i < expanded.length; i++) { + var signature_i = expanded[i]; + var key = signature_i.toString(); + var existing = keys[key]; + if (!existing) { + keys[key] = signature_i; + } + else { + var cmp = Signature.compare(signature_i, existing); + if (cmp < 0) { + // override if sorted first + keys[key] = signature_i; + } + else if (cmp === 0) { + throw new Error('Signature "' + key + '" is defined twice'); + } + // else: just ignore + } + } + } + } + + // convert from map to array + for (key in keys) { + if (keys.hasOwnProperty(key)) { + signatures.push(keys[key]); + } + } + + // filter redundant conversions from signatures with varArgs + // TODO: simplify this loop or move it to a separate function + for (i = 0; i < signatures.length; i++) { + signature = signatures[i]; + + if (signature.varArgs) { + var index = signature.params.length - 1; + var param = signature.params[index]; + + var t = 0; + while (t < param.types.length) { + if (param.conversions[t]) { + var type = param.types[t]; + + for (var j = 0; j < signatures.length; j++) { + var other = signatures[j]; + var p = other.params[index]; + + if (other !== signature && + p && + contains(p.types, type) && + !p.conversions[index]) { + // this (conversion) type already exists, remove it + param.types.splice(t, 1); + param.conversions.splice(t, 1); + t--; + break; + } + } + } + t++; + } + } + } + + return signatures; + } + + /** + * create a map with normalized signatures as key and the function as value + * @param {Signature[]} signatures An array with split signatures + * @return {Object.} Returns a map with normalized + * signatures as key, and the function + * as value. + */ + function mapSignatures(signatures) { + var normalized = {}; + + for (var i = 0; i < signatures.length; i++) { + var signature = signatures[i]; + if (signature.fn) { + var params = signature.params.join(','); + normalized[params] = signature.fn; + } + } + + return normalized; + } + + /** + * Parse signatures recursively in a node tree. + * @param {Signature[]} signatures Array with expanded signatures + * @param {Param[]} path Traversed path of parameter types + * @return {Node} Returns a node tree + */ + function parseTree(signatures, path) { + var i, signature; + var index = path.length; + var nodeSignature; + + var filtered = []; + for (i = 0; i < signatures.length; i++) { + signature = signatures[i]; + + // filter the first signature with the correct number of params + if (signature.params.length === index && !nodeSignature) { + nodeSignature = signature; + } + + if (signature.params[index] != undefined) { + filtered.push(signature); + } + } + + // sort the filtered signatures by param + filtered.sort(function (a, b) { + return Param.compare(a.params[index], b.params[index]); + }); + + // recurse over the signatures + var entries = []; + for (i = 0; i < filtered.length; i++) { + signature = filtered[i]; + // group signatures with the same param at current index + var param = signature.params[index]; + + // TODO: replace the next filter loop + var existing = entries.filter(function (entry) { + return entry.param.overlapping(param); + })[0]; + + //var existing; + //for (var j = 0; j < entries.length; j++) { + // if (entries[j].param.overlapping(param)) { + // existing = entries[j]; + // break; + // } + //} + + if (existing) { + if (existing.param.varArgs) { + throw new Error('Conflicting types "' + existing.param + '" and "' + param + '"'); + } + existing.signatures.push(signature); + } + else { + entries.push({ + param: param, + signatures: [signature] + }); + } + } + + // parse the childs + var childs = new Array(entries.length); + for (i = 0; i < entries.length; i++) { + var entry = entries[i]; + childs[i] = parseTree(entry.signatures, path.concat(entry.param)) + } + + return new Node(path, nodeSignature, childs); + } + + /** + * Generate an array like ['arg0', 'arg1', 'arg2'] + * @param {number} count Number of arguments to generate + * @returns {Array} Returns an array with argument names + */ + function getArgs(count) { + // create an array with all argument names + var args = []; + for (var i = 0; i < count; i++) { + args[i] = 'arg' + i; + } + + return args; + } + + /** + * Compose a function from sub-functions each handling a single type signature. + * Signatures: + * typed(signature: string, fn: function) + * typed(name: string, signature: string, fn: function) + * typed(signatures: Object.) + * typed(name: string, signatures: Object.) + * + * @param {string | null} name + * @param {Object.} signatures + * @return {function} Returns the typed function + * @private + */ + function _typed(name, signatures) { + var refs = new Refs(); + + // parse signatures, expand them + var _signatures = parseSignatures(signatures); + if (_signatures.length == 0) { + throw new Error('No signatures provided'); + } + + // parse signatures into a node tree + var node = parseTree(_signatures, []); + + //var util = require('util'); + //console.log('ROOT'); + //console.log(util.inspect(node, { depth: null })); + + // generate code for the typed function + var code = []; + var _name = name || ''; + var _args = getArgs(maxParams(_signatures)); + code.push('function ' + _name + '(' + _args.join(', ') + ') {'); + code.push(' "use strict";'); + code.push(node.toCode(refs, ' ')); + code.push('}'); + + // generate body for the factory function + var body = [ + refs.toCode(), + 'return ' + code.join('\n') + ].join('\n'); + + // evaluate the JavaScript code and attach function references + var factory = (new Function(refs.name, 'createError', body)); + var fn = factory(refs, createError); + + //console.log('FN\n' + fn.toString()); // TODO: cleanup + + // attach the signatures with sub-functions to the constructed function + fn.signatures = mapSignatures(_signatures); + + return fn; + } + + // data type tests + var types = { + 'null': function (x) {return x === null}, + 'undefined':function (x) {return x === undefined}, + 'boolean': function (x) {return typeof x === 'boolean'}, + 'number': function (x) {return typeof x === 'number'}, + 'string': function (x) {return typeof x === 'string'}, + 'function': function (x) {return typeof x === 'function'}, + 'Array': function (x) {return Array.isArray(x)}, + 'Date': function (x) {return x instanceof Date}, + 'RegExp': function (x) {return x instanceof RegExp}, + 'Object': function (x) {return typeof x === 'object'} + }; + + /** + * Calculate the maximum number of parameters in givens signatures + * @param {Signature[]} signatures + * @returns {number} The maximum number of parameters + */ + function maxParams(signatures) { + var max = 0; + + for (var i = 0; i < signatures.length; i++) { + var len = signatures[i].params.length; + if (len > max) { + max = len; + } + } + + return max; + } + + /** + * Get the type of a value + * @param {*} x + * @returns {string} Returns a string with the type of value + */ + function getTypeOf(x) { + for (var type in types) { + if (types.hasOwnProperty(type) && type !== 'Object') { + // Array and Date are also Object, so test for Object afterwards + if (types[type](x)) return type; + } + } + if (types['Object'](x)) return type; + return 'unknown'; + } + + /** + * Test whether an array contains some entry + * @param {Array} array + * @param {*} entry + * @return {boolean} Returns true if array contains entry, false if not. + */ + function contains(array, entry) { + return array.indexOf(entry) !== -1; + } + + // configuration + var config = {}; + + // type conversions. Order is important + var conversions = []; + + // temporary object for holding types and conversions, for constructing + // the `typed` function itself + // TODO: find a more elegant solution for this + var typed = { + config: config, + types: types, + conversions: conversions + }; + + /** + * Construct the typed function itself with various signatures + * + * Signatures: + * + * typed(signature: string, fn: function) + * typed(name: string, signature: string, fn: function) + * typed(signatures: Object.) + * typed(name: string, signatures: Object.) + */ + typed = _typed('typed', { + 'Object': function (signatures) { + return _typed(null, signatures); + }, + 'string, Object': _typed, + 'string, function': function (signature, fn) { + var signatures = {}; + signatures[signature] = fn; + return _typed(fn.name || null, signatures); + }, + 'string, string, function': function(name, signature, fn) { + var signatures = {}; + signatures[signature] = fn; + return _typed(name, signatures); + }, + '...function': function (fns) { + var err; + var name = ''; + var signatures = {}; + + for (var i = 0; i < fns.length; i++) { + var fn = fns[i]; + + // test whether this is a typed-function + if (!(typeof fn.signatures === 'object')) { + err = new TypeError('Function is no typed-function (index: ' + i + ')'); + err.data = {index: i}; + throw err; } - suffix = '_{' + tmp + '}'; - args = [args[0]]; - } - break; + // merge the signatures + for (var signature in fn.signatures) { + if (fn.signatures.hasOwnProperty(signature)) { + if (signatures.hasOwnProperty(signature)) { + err = new Error('Signature "' + signature + '" is defined twice'); + err.data = {signature: signature}; + throw err; + } + else { + signatures[signature] = fn.signatures[signature]; + } + } + } - case 'ceil': - brace = ['\\lceil', '\\rceil']; - type = 'lr'; - break; - - case 'floor': - brace = ['\\lfloor', '\\rfloor']; - type = 'lr'; - break; - - case 'round': - brace = ['\\lfloor', '\\rceil']; - type = 'lr'; - - if (args.length === 2) { - suffix = '_' + exports.addBraces(args[1].toTex()); - args = [args[0]]; - } - break; - - - // NORMAL BRACES - case 'inv': - suffix = '^{-1}'; - break; - - case 'transpose': - suffix = '^{T}'; - brace = false; - break; - - // SPECIAL NOTATION - case 'log': - var base = 'e'; - if (args.length === 2) { - base = args[1].toTex(); - func = '\\log_{' + base + '}'; - args = [args[0]]; - } - if (base === 'e') { - func = '\\ln'; + // merge function name + if (fn.name != '') { + if (name == '') { + name = fn.name; + } + else if (name != fn.name) { + err = new Error('Function names do not match (expected: ' + name + ', actual: ' + fn.name + ')'); + err.data = { + actual: fn.name, + expected: name + }; + throw err; + } + } } - showFunc = true; - break; + return _typed(name, signatures); + } + }); - case 'square': - suffix = '^{2}'; - break; + // attach types and conversions to the final `typed` function + typed.config = config; + typed.types = types; + typed.conversions = conversions; - case 'cube': - suffix = '^{3}'; - break; - - - // MATRICES - case 'eye': - showFunc = true; - brace = false; - func += '_'; - break; - - case 'det': - if (that.args[0] instanceof ArrayNode) { - return that.args[0].toTex('vmatrix'); - } - - brace = 'vmatrix'; - type = 'be'; - break; - - default: - showFunc = true; - break; - } - - if (op !== null) { - brace = (op === '+' || op === '-'); - texParams = (new OperatorNode(op, name, args)).toTex(); - } - else { - op = ', '; - } - - if (brace === null && !exports.isCurlyFunction(name)) { - brace = true; - } - - texParams = texParams || args.map(function(param) { - return '{' + param.toTex() + '}' ; - }).join(op); - - return prefix + (showFunc ? func : '') + - exports.addBraces(texParams, brace, type) + - suffix; - }; + return typed; + })); /***/ } /******/ ]) }); +; \ No newline at end of file diff --git a/dist/math.map b/dist/math.map index 890cef3bd..3133ddf9e 100644 --- a/dist/math.map +++ b/dist/math.map @@ -1 +1 @@ -{"version":3,"file":"math.map","sources":["./dist/math.js"],"names":["root","factory","exports","module","define","amd","this","modules","__webpack_require__","moduleId","installedModules","id","loaded","call","m","c","p","create","config","Object","Error","math","_config","matrix","number","precision","epsilon","options","object","deepExtend","type","BigNumber","defaultType","decimals","clone","constructor","convert","digits","error","Complex","Range","Index","Matrix","Unit","Help","ResultSet","typed","types","x","conversions","from","to","toNumber","TypeError","array","collection","expression","node","parse","Parser","docs","json","reviver","abs","add","divide","exp","log","multiply","pow","sqrt","subtract","unaryMinus","bitAnd","det","eye","inv","equal","larger","smaller","min","sum","ifElse","transform","concat","filter","forEach","index","map","max","mean","range","subset","chaining","Chain","Selector","window","mathjs","undefined","Array","isArray","value","Number","valueOf","String","Boolean","Date","RegExp","key","hasOwnProperty","extend","a","b","prop","deepEqual","i","len","length","canDefineProperty","defineProperty","e","lazy","fn","_value","_uninitialized","get","set","isNumber","isInteger","Math","round","sign","format","Infinity","isNaN","notation","toFixed","toExponential","lower","upper","exponential","str","valueStr","toPrecision","parseFloat","replace","arguments","DBL_EPSILON","EPSILON","nearlyEqual","y","isFinite","diff","re","im","SyntaxError","arg","construct","fromPolar","r","phi","skipWhitespace","next","isDigitDot","isDigit","text","charAt","revert","oldIndex","parseNumber","parseComplex","cnext","util","isUnit","isString","string","isComplex","first","separator","second","substring","hasBase","BASE_UNITS","ANGLE","cos","sin","prototype","toPolar","atan2","equals","other","strRe","strIm","toString","toJSON","fromJSON","start","end","step","args","split","nums","invalid","some","num","isRange","size","ceil","callback","obj","toArray","_ranges","_isScalar","ii","push","_createRange","primitive","isIndex","ranges","apply","values","dim","isScalar","row","strings","join","data","_data","preprocess","_size","_get","DimensionError","validateIndex","_getSubmatrix","dims","last","child","_set","submatrix","defaultValue","sSize","iSize","outer","unsqueeze","_fit","_setSubmatrix","dataIndex","subIndex","newSize","changed","resize","elem","isMatrix","replacement","index_i","me","recurse","name","res","_findUnit","unit","prefix","UNIT_NONE","PREFIX_NONE","_normalize","fixPrefix","parseUnit","unitName","UNITS","endsWith","prefixLen","prefixName","prefixes","err","offset","_denormalize","prefixValue","isValuelessUnit","base","equalBase","valuelessUnit","bestPrefix","_bestPrefix","absValue","bestDiff","LN10","scientific","PREFIXES","NONE","SHORT","da","h","k","M","G","T","P","E","Z","Y","d","u","n","f","z","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT","Ki","Mi","Gi","Ti","Pi","Ei","Zi","Yi","BINARY_LONG","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","LENGTH","MASS","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","BIT","BASE_UNIT_NONE","meter","inch","foot","yard","mile","link","rod","chain","angstrom","in","ft","yd","mi","li","rd","ch","mil","m2","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","m3","L","l","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","cp","pt","qt","gal","bbl","obl","g","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","gr","dr","oz","lbm","cwt","s","sec","minute","hour","day","rad","deg","grad","cycle","A","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","N","newton","lbf","poundforce","bits","B","bytes","PLURALS","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","teaspoons","tablespoons","minims","fluiddrams","fluidounces","gills","cups","pints","quarts","gallons","beerbarrels","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","seconds","minutes","hours","days","radians","degrees","gradients","cycles","amperes","moles","plural","lt","liter","liters","lb","lbs","doc","isHelp","toText","desc","category","description","syntax","examples","parser","expr","eval","seealso","entries","bignumber","UNINITIALIZED","NaN","pi","tau","ln","div","PI","LN2","LOG2E","LOG10E","SQRT1_2","SQRT2","version","ArgumentsError","IndexError","UnsupportedTypeError","_reduce","mat","ret","val","tran","_switch","j","I","J","tmp","argsToArray","isCollection","deepMap","deepMap2","array1","array2","reduce","deepForEach","ArrayNode","AssignmentNode","BlockNode","ConditionalNode","ConstantNode","IndexNode","FunctionAssignmentNode","FunctionNode","Node","OperatorNode","RangeNode","SymbolNode","UpdateNode","extra_nodes","nodes","parseStart","nesting_level","conditional_level","nextPreview","nextNextPreview","getToken","token_type","TOKENTYPE","NULL","token","DELIMITER","c2","c3","DELIMITERS","isAlpha","NAMED_DELIMITERS","SYMBOL","UNKNOWN","createSyntaxError","NUMBER","getTokenSkipNewline","openParams","closeParams","parseBlock","createError","visible","blocks","parseFunctionAssignment","parseAssignment","valid","parseConditional","parseLogicalOr","prev","condition","trueExpr","falseExpr","parseLogicalXor","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","operators","params","parseShift","==","!=","<",">","<=",">=","parseConversion","<<",">>",">>>","parseRange","parseAddSubtract","parseMultiplyDivide","+","-","parseUnary","*",".*","/","./","%","mod","~","not","parsePow","parseLeftHandOperators","parseCustomNodes","!","'","handler","parseSymbol","parseFunctions","parseIndex","parseString","tPrev","parseMatrix","rows","cols","parseRow","parseParentheses","parseEnd","col","message",",","(",")","[","]","\"",";","^",".^","&","|","^|","=",":","?","and","xor","or","scope","_parse","compile","remove","clear","cube","dotDivide","dotMultiply","dotPow","fix","floor","gcd","lcm","log10","norm","nthRoot","square","unaryPlus","xgcd","bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift","conj","complex","help","cross","diag","dot","flatten","ones","squeeze","trace","transpose","zeros","combinations","factorial","gamma","permutations","pickRandom","random","randomInt","compare","largerEq","smallerEq","unequal","median","prod","std","acos","acosh","acot","acoth","acsc","acsch","asec","asech","asin","asinh","atan","atanh","cosh","cot","coth","csc","csch","sech","sinh","tan","tanh","sort","errorTransform","lastIndex","minus","isBoolean","_filter","test","_scope","symbol","sub","eq","rawArgs","_forEachArray","arrayOrig","_mapArray","arrayIn","createProxy","slice","done","search","Array | Matrix","coll","number, number","BigNumber, BigNumber","plus","Complex, Complex","Unit, Unit","Array | Matrix, any","any, Array | Matrix","string, string","times","divideScalar","any, any","Array | Matrix, Array | Matrix","edivide","emultiply","epow","isNegative","_bigGcd","isInt","zero","isZero","neg","_bigLcm","t","_logNumber","_mod","_multiply","sizeX","sizeY","RangeError","_multiplyVectorVector","_multiplyVectorMatrix","_multiplyMatrixVector","_multiplyMatrixMatrix","result","number, Unit","Unit, number","Array, Array","Matrix, Matrix","Matrix, Array","Array, Matrix","POSITIVE_INFINITY","v","NEGATIVE_INFINITY","rs","_nthRoot","_root","iMax","delta","_nthRootBig","one","negated","xPrev","_powComplex","_powArray","px","_powMatrix","Array, number","Array, BigNumber","Matrix, number","Matrix, BigNumber","roundNumber","toDecimalPlaces","cmp","_sqrtNumber","_sqrtComplex","_xgcd","q","lastx","lasty","_bigXgcd","bigBitAnd","bigBitNot","bigBitOr","bigBitXor","bigLeftShift","bigRightShift","rightShift","bool","lcase","toLowerCase","select","console","_concat","concatDim","prevDim","asMatrix","matrices","shift","_cross","xSize","ySize","_det","compute_mu","mu","fa","any","vector","asArray","kSuper","kSub","_dot","_eyeVector","_eye","Big","minimum","number | BigNumber","number | BigNumber, number | BigNumber","flat","_inv","temp","Ac","Bc","Ar","Br","asBigNumber","_range","_rangeInc","_bigRange","gt","_bigRangeInc","lte","gte","includeEnd","pop","_resizeString","defaultChar","_getSubset","_getSubstring","strLen","substr","_setSubset","_setSubstring","chars","_trace","transposedRow","transposed","preciseFacs","isNonNegativeInteger","smallBigFacs","toSD","bigBigFacs","twoN","threeN","fourN","fiveN","real","den","twoPiSqrt","distribution","arity","isPositiveInteger","dividedBy","_deepEqual","_equal","boolean, boolean","largereq","smallereq","_smallest","_min","Array | Matrix, number | BigNumber","...","_getLarger","_max","_nmean","_mean","_median","left","right","middle","_prod","variance","_sum","_var","normalization","DEFAULT_NORMALIZATION","bigArcCos","arccos_arcsec","temp1","temp2","temp3","temp4","bigAcosh","acosh_asinh_asech_acsch","bigArcCot","arctan_arccot","halfPi","bigAcoth","atanh_acoth","bigArcCsc","arcsin_arccsc","bigAcsch","bigArcSec","bigAsech","bigArcSin","bigAsinh","bigArcTan","bigAtanh","noIM","oneMinus","onePlus","bigCos","cos_sin_sec_csc","bigCosh","cosh_sinh_csch_sech","ep","en","bigCot","tan_cot","bigCoth","tanh_coth","bigCsc","bigCsch","bigSec","bigSech","bigSin","bigSinh","cim","sim","bigTan","bigTanh","entry","_import","override","wrap","isSupportedType","math_import","opts","_module","print","template","original","keys","_compare","__WEBPACK_AMD_DEFINE_FACTORY__","__WEBPACK_AMD_DEFINE_ARRAY__","__WEBPACK_AMD_DEFINE_RESULT__","getTypeTest","matches","expected","actual","actualType","getTypeOf","_expected","anyType","contains","Refs","categories","Param","varArgs","_types","trim","_varArgs","Signature","withVarArgs","param","path","signature","childs","parseSignatures","rawSignatures","signatures","expand","arr","exists","splice","mapSignatures","normalized","parseTree","existing","overlapping","getArgs","count","_typed","refs","_signatures","code","_name","_args","maxParams","toCode","indexOf","cat","ref","hasConversions","ac","conversion","bc","toConversion","bind","newParam","comment","getTests","allTypes","exactTypes","_innerCode","nextAnyType","exceptions","_exceptions","null","boolean","function","string, Object","string, function","string, string, function","...function","fns","relation","stack","bitwise","func","xBits","yBits","xSign","ySign","decCoefficientToBinaryString","minBits","maxBits","minSign","shortLen","longLen","expFuncVal","outVal","twoPower","ONE","two","prevPrec","xe","strL","arrL","reverse","arcsin_newton","oldPrecision","tolerance","maxp","localPrecision","maxIter","curr","tmp0","tmp1","sinToCos","tmp2","toDP","arcsin_taylor","yPrev","x2","polyNum","constNum","constDen","bigK","arctan_taylor","cos_sin_taylor","mode","reduceToPeriod","dp","sinVal","memoize","isBigNumber","toBigNumber","pi4th","isNegtive","negOne","reciprocal","absX","wasReduced","x2PlusOrMinus","isNeg","precPlusGuardDigits","five","sixteen","twenty","ret2","ret3","ret5","div_factor","loops","eight","ret4","posExp","negExp","toExpNeg","toExpPos","toSignificantDigits","_validate","dimNext","_resize","oldLen","newLen","minLen","_squeeze","_unsqueeze","validate","_defaultValue","unshift","every","isNode","_compile","defs","_ifNode","toTex","childNode","keywords","latex","brace","addBraces","toSymbol","block","js","testCondition","valueType","SUPPORTED_TYPES","match","compileSubset","someUseEnd","rangesUseEnd","useEnd","objectName","variable","isRaw","paramsName","toArgs","_validateScope","_transform","transformed","defsCode","factoryCode","Function","traverse","_traverse","parent","find","op","lhs","rhs","mop","toOperator","lp","rp","operand","lhb","rhb","lop","rop","toUnit","undef","webpackContext","req","webpackContextResolve","./clone","./clone.js","./filter","./filter.js","./forEach","./forEach.js","./format","./format.js","./import","./import.js","./map","./map.js","./print","./print.js","./sort","./sort.js","./typeof","./typeof.js","resolve","formatArray","_divideComplex","distributions","randFunctions","arg1","arg2","arg3","_randomDataForMatrix","_random","_randomInt","possibles","randFunc","uniform","normal","u1","u2","picked","global","coefficientToString","LOGBASE","charCodeAt","checkRoundingDigits","rm","repeating","ci","mathpow","checkRM","method","Decimal","outOfRange","parseInt","ifExceptionsThrow","checkArg","MAX_DIGITS","pr","denom","guard","sd","rep","external","rnd","getCoeffLength","more","intPow","c0","x1","xc","xci","out","mathfloor","BASE","convertBase","decimal","crypto","NUMERALS","EXP_LIMIT","INT_POW_LIMIT","yc","base10","inf","sd10","xLTy","half","pos","groupSeparator","g1","g2","intPart","fractionPart","intDigits","maxD","d0","d2","frac","n0","n1","d1","yN","toBaseOut","baseIn","baseOut","multiplyInteger","carry","aL","bL","logbase","prodL","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","maxOrMin","ltgt","rand","Uint32Array","copy","decimalFactory","parseDecimal","decimalSeparator","groupSize","secondaryGroupSize","fractionGroupSeparator","fractionGroupSize","isValid","isNum","orig","cache","hash","JSON","stringify","mapSymbols","symbols","latexIs","latexIsFn","latexToFn","greek","Alpha","alpha","Beta","beta","Gamma","Delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","Nu","nu","Xi","Omicron","omicron","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","psi","Omega","omega","dots","ldots","cdots","vdots","ddots","idots","logic","true","false","Inf","infinity","oo","lim","functions","arccos","ker","limsup","arcsin","lg","Pr","sup","arctan","hom","var","curlyFunctions","int","Int","integrate","eigenvalues","liminf","units","isSymbol","isFunction","toFunction","isCurlyFunction","toCurlyFunction","isOperator","_toUnit","notSpaced","braces","that","texParams","showFunc","suffix"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAA2CA,EAAMC,GAC1B,gBAAZC,UAA0C,gBAAXC,QACxCA,OAAOD,QAAUD,IACQ,kBAAXG,SAAyBA,OAAOC,IAC9CD,OAAOH,GACmB,gBAAZC,SACdA,QAAc,KAAID,IAElBD,EAAW,KAAIC,KACdK,KAAM,WACT,MAAgB,UAAUC,GAKhB,QAASC,GAAoBC,GAG5B,GAAGC,EAAiBD,GACnB,MAAOC,GAAiBD,GAAUP,OAGnC,IAAIC,GAASO,EAAiBD,IAC7BP,WACAS,GAAIF,EACJG,QAAQ,EAUT,OANAL,GAAQE,GAAUI,KAAKV,EAAOD,QAASC,EAAQA,EAAOD,QAASM,GAG/DL,EAAOS,QAAS,EAGTT,EAAOD,QAvBf,GAAIQ,KAqCJ,OATAF,GAAoBM,EAAIP,EAGxBC,EAAoBO,EAAIL,EAGxBF,EAAoBQ,EAAI,GAGjBR,EAAoB,KAK/B,SAASL,EAAQD,EAASM,GAE/BL,EAAOD,QAAUM,EAAoB,IAKhC,SAASL,EAAQD,EAASM,GAE/B,YAyBA,SAASS,GAAQC,GAEf,GAA6B,kBAAlBC,QAAOF,OAChB,KAAM,IAAIG,OAAM,gHAKlB,IAAIC,MAGAC,GAEFC,OAAQ,SAGRC,OAAQ,SAGRC,UAAW,GAIXC,QAAS,MAeXL,GAAKH,OAAS,SAASS,GACrB,GAAIA,EAAS,CAeX,GAbAC,EAAOC,WAAWP,EAASK,GAEvBA,EAAQF,WACVJ,EAAKS,KAAKC,UAAUb,QAClBO,UAAWE,EAAQF,YAMvBjB,EAAoB,IAAIa,EAAMC,GAG1BK,EAAQH,QAAUG,EAAQH,OAAOQ,YACnC,KAAM,IAAIZ,OAAM,oEAIlB,IAAIO,EAAQH,QAAUG,EAAQH,OAAOC,UACnC,KAAM,IAAIL,OAAM,qEAIlB,IAAIO,EAAQJ,QAAUI,EAAQJ,OAAOS,YACnC,KAAM,IAAIZ,OAAM,oEAIlB,IAAIO,EAAQJ,QAAUI,EAAQJ,OAAO,WACnC,KAAM,IAAIH,OAAM,gEAIlB,IAAIO,EAAQM,SACV,KAAM,IAAIb,OAAM,8DAKpB,MAAOQ,GAAOM,MAAMZ,IAetBD,EAAKJ,OAASA,CAGd,IAAIc,GAAYvB,EAAoB,IAAI2B,aA2UxC,OA/TEJ,GAAUK,QAAU,SAASZ,GAC3B,MAAIa,GAAOb,GAAU,GACZA,EAGA,GAAIO,GAAUP,IAS3BH,EAAKiB,MAAQ9B,EAAoB,IAGjCa,EAAKS,MACHS,QAASA,EACTC,MAAOA,EACPC,MAAOA,EACPC,OAAQA,EACRC,KAAMA,EACNC,KAAMA,EACNC,UAAWA,EACXd,UAAWA,GAIbe,EAAMC,MAAe,QAAO,SAAUC,GAAK,MAAOA,aAAaT,IAC/DO,EAAMC,MAAa,MAAS,SAAUC,GAAK,MAAOA,aAAaR,IAC/DM,EAAMC,MAAa,MAAS,SAAUC,GAAK,MAAOA,aAAaP,IAC/DK,EAAMC,MAAc,OAAQ,SAAUC,GAAK,MAAOA,aAAaN,IAC/DI,EAAMC,MAAY,KAAU,SAAUC,GAAK,MAAOA,aAAaL,IAC/DG,EAAMC,MAAY,KAAU,SAAUC,GAAK,MAAOA,aAAaJ,IAC/DE,EAAMC,MAAiB,UAAK,SAAUC,GAAK,MAAOA,aAAaH,IAC/DC,EAAMC,MAAiB,UAAK,SAAUC,GAAK,MAAOA,aAAajB,IAE/De,EAAMG,cAEFC,KAAM,SACNC,GAAI,UACJf,QAAS,SAAUY,GACjB,MAAO,IAAIT,GAAQS,EAAG,MAGxBE,KAAM,YACNC,GAAI,UACJf,QAAS,SAAUY,GACjB,MAAO,IAAIT,GAAQS,EAAEI,WAAY,MAGnCF,KAAM,SACNC,GAAI,SACJf,QAAS,SAAUY,GACjB,MAAOA,GAAI,MAGbE,KAAM,SACNC,GAAI,YACJf,QAAS,SAAUY,GAEjB,GAAIX,EAAOW,GAAK,GACd,KAAM,IAAIK,WAAU,uFACHL,EAAI,wDAGvB,OAAO,IAAIjB,GAAUiB,MAGvBE,KAAM,UACNC,GAAI,SACJf,QAAS,SAAUY,GACjB,OAAQA,KAGVE,KAAM,UACNC,GAAI,SACJf,QAAS,SAAUY,GACjB,OAAQA,KAGVE,KAAM,UACNC,GAAI,YACJf,QAAS,SAAUY,GACjB,MAAO,IAAIjB,IAAWiB,MAGxBE,KAAM,OACNC,GAAI,SACJf,QAAS,WACP,MAAO,MAGTc,KAAM,OACNC,GAAI,SACJf,QAAS,WACP,MAAO,UAGTc,KAAM,OACNC,GAAI,YACJf,QAAS,WACP,MAAO,IAAIL,GAAU,MAGvBmB,KAAM,QACNC,GAAI,SACJf,QAAS,SAAUkB,GACjB,MAAO,IAAIZ,GAAOY,MAKxBjC,EAAKkC,WAAa/C,EAAoB,IAGtCa,EAAKmC,cACLnC,EAAKmC,WAAWC,KAAOjD,EAAoB,IAC3Ca,EAAKmC,WAAWE,MAAQlD,EAAoB,IAC5Ca,EAAKmC,WAAWG,OAASnD,EAAoB,IAC7Ca,EAAKmC,WAAWI,KAAOpD,EAAoB,IAG3Ca,EAAKwC,MACHC,QAAStD,EAAoB,KAI/BA,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9BD,EAAK0C,IAAMvD,EAAoB,IAAIc,GACnCD,EAAK2C,IAAMxD,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAK4C,OAASzD,EAAoB,IAAIc,GACtCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAK6C,IAAM1D,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAK8C,IAAM3D,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAK+C,SAAW5D,EAAoB,IAAIc,GACxCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKgD,IAAM7D,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKiD,KAAO9D,EAAoB,IAAIc,GACpCd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKkD,SAAW/D,EAAoB,IAAIc,GACxCD,EAAKmD,WAAahE,EAAoB,IAAIc,GAC1Cd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9BD,EAAKoD,OAASjE,EAAoB,IAAIc,GACtCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAG9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKqD,IAAMlE,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKsD,IAAMnE,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9BD,EAAKuD,IAAMpE,EAAoB,IAAIc,GACnCd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,IAAIa,EAAMC,GAC9Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAI/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAG/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/BD,EAAKwD,MAAQrE,EAAoB,KAAKc,GACtCD,EAAKyD,OAAStE,EAAoB,KAAKc,GACvCd,EAAoB,KAAKa,EAAMC,GAC/BD,EAAK0D,QAAUvE,EAAoB,KAAKc,GACxCd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAG/BD,EAAK2D,IAAMxE,EAAoB,KAAKc,GACpCd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/BD,EAAK4D,IAAMzE,EAAoB,KAAKc,GACpCd,EAAoB,KAAKa,EAAMC,GAG/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAG/Bd,EAAoB,KAAKa,EAAMC,GAG/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAC/Bd,EAAoB,KAAKa,EAAMC,GAG/BD,EAAK6D,OAAS,WACZ,KAAM,IAAI9D,OAAM,yEAIlBZ,EAAoB,IAAIa,EAAMC,GAG9BD,EAAKmC,WAAW2B,WACdC,OAAQ5E,EAAoB,IAAIa,EAAMC,GACtC+D,OAAQ7E,EAAoB,IAAIa,EAAMC,GACtCgE,QAAQ9E,EAAoB,IAAIa,EAAMC,GACtCiE,MAAQ/E,EAAoB,IAAIa,EAAMC,GACtCkE,IAAQhF,EAAoB,IAAIa,EAAMC,GACtCmE,IAAQjF,EAAoB,IAAIa,EAAMC,GACtCoE,KAAQlF,EAAoB,IAAIa,EAAMC,GACtC0D,IAAQxE,EAAoB,IAAIa,EAAMC,GACtCqE,MAAQnF,EAAoB,IAAIa,EAAMC,GACtCsE,OAAQpF,EAAoB,IAAIa,EAAMC,IAIxCD,EAAKwE,YACLxE,EAAKwE,SAASC,MAAQtF,EAAoB,IAAIa,EAAMC,GACpDD,EAAKwE,SAASE,SAAW1E,EAAKwE,SAASC,MAGvCzE,EAAKH,OAAOI,GACZD,EAAKH,OAAOA,GAGLG,EApcT,GAAIyB,GAAQtC,EAAoB,KAC5BoB,EAASpB,EAAoB,GAC7B6B,EAAS7B,EAAoB,GAAG6B,OAChCE,EAAU/B,EAAoB,GAC9BgC,EAAQhC,EAAoB,GAC5BiC,EAAQjC,EAAoB,GAC5BkC,EAASlC,EAAoB,GAC7BmC,EAAOnC,EAAoB,GAC3BoC,EAAOpC,EAAoB,GAC3BqC,EAAYrC,EAAoB,IA+bhCa,EAAOJ,GAEW,oBAAX+E,UACTA,OAAOC,OAAS5E,GAIlBlB,EAAOD,QAAUmB,GAMZ,SAASlB,EAAQD,EAASM,GAE/B,YAEA,IAAIuB,GAAYvB,EAAoB,IAapCN,GAAQgC,MAAQ,QAASA,GAAMc,GAC7B,GAAIlB,SAAckB,EAGlB,IAAa,WAATlB,GAA8B,WAATA,GAA8B,YAATA,GACpC,OAANkB,GAAoBkD,SAANlD,EAChB,MAAOA,EAIT,IAAuB,kBAAZA,GAAEd,MACX,MAAOc,GAAEd,OAIX,IAAIiE,MAAMC,QAAQpD,GAChB,MAAOA,GAAEwC,IAAI,SAAUa,GACrB,MAAOnE,GAAMmE,IAIjB,IAAIrD,YAAasD,QAAW,MAAO,IAAIA,QAAOtD,EAAEuD,UAChD,IAAIvD,YAAawD,QAAW,MAAO,IAAIA,QAAOxD,EAAEuD,UAChD,IAAIvD,YAAayD,SAAW,MAAO,IAAIA,SAAQzD,EAAEuD,UACjD,IAAIvD,YAAa0D,MAAW,MAAO,IAAIA,MAAK1D,EAAEuD,UAC9C,IAAIvD,YAAajB,GAAW,MAAOiB,EACnC,IAAIA,YAAa2D,QAAS,KAAM,IAAItD,WAAU,gBAAkBL,EAGhE,IAAIlC,KACJ,KAAK,GAAI8F,KAAO5D,GACVA,EAAE6D,eAAeD,KACnB9F,EAAE8F,GAAO1E,EAAMc,EAAE4D,IAGrB,OAAO9F,IASTZ,EAAQ4G,OAAS,SAASC,EAAGC,GAC3B,IAAK,GAAIC,KAAQD,GACXA,EAAEH,eAAeI,KACnBF,EAAEE,GAAQD,EAAEC,GAGhB,OAAOF,IAST7G,EAAQ2B,WAAa,QAASA,GAAYkF,EAAGC,GAE3C,GAAIb,MAAMC,QAAQY,GAChB,KAAM,IAAI3D,WAAU,yCAGtB,KAAK,GAAI4D,KAAQD,GACf,GAAIA,EAAEH,eAAeI,GACnB,GAAID,EAAEC,IAASD,EAAEC,GAAM9E,cAAgBhB,OACrB+E,SAAZa,EAAEE,KACJF,EAAEE,OAEAF,EAAEE,GAAM9E,cAAgBhB,OAC1BU,EAAWkF,EAAEE,GAAOD,EAAEC,IAGtBF,EAAEE,GAAQD,EAAEC,OAET,CAAA,GAAId,MAAMC,QAAQY,EAAEC,IACzB,KAAM,IAAI5D,WAAU,yCAEpB0D,GAAEE,GAAQD,EAAEC,GAIlB,MAAOF,IAST7G,EAAQgH,UAAY,SAAoBH,EAAGC,GACzC,GAAIC,GAAME,EAAGC,CACb,IAAIjB,MAAMC,QAAQW,GAAI,CACpB,IAAKZ,MAAMC,QAAQY,GACjB,OAAO,CAGT,IAAID,EAAEM,QAAUL,EAAEK,OAChB,OAAO,CAGT,KAAKF,EAAI,EAAGC,EAAML,EAAEM,OAAYD,EAAJD,EAASA,IACnC,IAAKjH,EAAQgH,UAAUH,EAAEI,GAAIH,EAAEG,IAC7B,OAAO,CAGX,QAAO,EAEJ,GAAIJ,YAAa5F,QAAQ,CAC5B,GAAIgF,MAAMC,QAAQY,MAAQA,YAAa7F,SACrC,OAAO,CAGT,KAAK8F,IAAQF,GAEX,IAAK7G,EAAQgH,UAAUH,EAAEE,GAAOD,EAAEC,IAChC,OAAO,CAGX,KAAKA,IAAQD,GAEX,IAAK9G,EAAQgH,UAAUH,EAAEE,GAAOD,EAAEC,IAChC,OAAO,CAGX,QAAO,EAGP,aAAeF,UAAaC,IAAOD,GAAKC,GAQ5C9G,EAAQoH,kBAAoB,WAE1B,IACE,GAAInG,OAAOoG,eAET,MADApG,QAAOoG,kBAAmB,SACnB,EAET,MAAOC,IAET,OAAO,GAaTtH,EAAQuH,KAAO,SAAU7F,EAAQqF,EAAMS,GACrC,GAAIxH,EAAQoH,oBAAqB,CAC/B,GACIK,GADAC,GAAiB,CAErBzG,QAAOoG,eAAe3F,EAAQqF,GAC5BY,IAAK,WAKH,MAJID,KACFD,EAASD,IACTE,GAAiB,GAEZD,GAGTG,IAAK,SAAUzB,GACbsB,EAAStB,EACTuB,GAAiB,SAMrBhG,GAAOqF,GAAQS,MAOd,SAASvH,EAAQD,GAEtB,YAOAA,GAAQ6H,SAAW,SAAS1B,GAC1B,MAAQA,aAAiBC,SAA4B,gBAATD,IAQ9CnG,EAAQ8H,UAAY,SAAS3B,GAC3B,MAAQA,IAAS4B,KAAKC,MAAM7B,IAS9BnG,EAAQiI,KAAO,SAASnF,GACtB,MAAIA,GAAI,EACC,EAEI,EAAJA,EACA,GAGA,GAoEX9C,EAAQkI,OAAS,SAAS/B,EAAO1E,GAC/B,GAAuB,kBAAZA,GAET,MAAOA,GAAQ0E,EAIjB,IAAcgC,MAAVhC,EACF,MAAO,UAEJ,IAAIA,KAAWgC,IAClB,MAAO,WAEJ,IAAIC,MAAMjC,GACb,MAAO,KAIT,IAAIkC,GAAW,OACX9G,EAAYyE,MAkBhB,QAhBIvE,IAEEA,EAAQ4G,WACVA,EAAW5G,EAAQ4G,UAIjBrI,EAAQ6H,SAASpG,GACnBF,EAAYE,EAELA,EAAQF,YACfA,EAAYE,EAAQF,YAKhB8G,GACN,IAAK,QACH,MAAOrI,GAAQsI,QAAQnC,EAAO5E,EAEhC,KAAK,cACH,MAAOvB,GAAQuI,cAAcpC,EAAO5E,EAEtC,KAAK,OAGH,GAAIiH,GAAQ,KACRC,EAAQ,GAWZ,IAVIhH,GAAWA,EAAQiH,cACa1C,SAA9BvE,EAAQiH,YAAYF,QACtBA,EAAQ/G,EAAQiH,YAAYF,OAEIxC,SAA9BvE,EAAQiH,YAAYD,QACtBA,EAAQhH,EAAQiH,YAAYD,QAKlB,IAAVtC,EAAa,MAAO,GAGxB,IAAIwC,GACA9E,EAAMkE,KAAKlE,IAAIsC,EACnB,IAAItC,GAAO2E,GAAeC,EAAN5E,EAAa,CAG/B,GAAI+E,GAAWrH,EACX4E,EAAM0C,YAAYd,KAAKjD,IAAIvD,EAAW,KACtC4E,EAAM0C,aACVF,GAAMG,WAAWF,GAAY,OAI7BD,GAAM3I,EAAQuI,cAAcpC,EAAO5E,EAIrC,OAAOoH,GAAII,QAAQ,sBAAuB,WACxC,GAAI5G,GAAS6G,UAAU,GACnB1B,EAAI0B,UAAU,EAClB,OAAmB,MAAX7G,EAAkBA,EAASmF,EAAIA,GAG3C,SACE,KAAM,IAAIpG,OAAM,qBAAuBmH,EAAW,kDAaxDrI,EAAQuI,cAAgB,SAASpC,EAAO5E,GACtC,MAAkByE,UAAdzE,EACK4E,EAAMoC,cAAcR,KAAKjD,IAAIvD,EAAY,EAAG,KAG5C4E,EAAMoC,iBAUjBvI,EAAQsI,QAAU,SAASnC,EAAO5E,GAChC,MAAO4E,GAAMmC,QAAQP,KAAKjD,IAAIvD,EAAW,MAc3CvB,EAAQmC,OAAS,SAASgE,GACxB,MAAOA,GACFoC,gBACAQ,QAAQ,OAAQ,IAChBA,QAAS,aAAc,IACvB5B,QAMPnH,EAAQiJ,YAAc7C,OAAO8C,SAAW,sBAWxClJ,EAAQmJ,YAAc,SAASrG,EAAGsG,EAAG5H,GAEnC,GAAe,MAAXA,EAAiB,MAAOsB,IAAKsG,CAGjC,IAAItG,GAAKsG,EAAG,OAAO,CAGnB,IAAIhB,MAAMtF,IAAMsF,MAAMgB,GAAI,OAAO,CAGjC,IAAGC,SAASvG,IAAMuG,SAASD,GAAI,CAE7B,GAAIE,GAAOvB,KAAKlE,IAAIf,EAAIsG,EACxB,OAAIE,GAAOtJ,EAAQiJ,aACV,EAIAK,GAAQvB,KAAKxC,IAAIwC,KAAKlE,IAAIf,GAAIiF,KAAKlE,IAAIuF,IAAM5H,EAKxD,OAAO,IAMJ,SAASvB,EAAQD,EAASM,GAE/B,YA6BA,SAAS+B,GAAQkH,EAAIC,GACnB,KAAMpJ,eAAgBiC,IACpB,KAAM,IAAIoH,aAAY,mDAGxB,QAAQT,UAAU7B,QAChB,IAAK,GACH/G,KAAKmJ,GAAK,EACVnJ,KAAKoJ,GAAK,CACV,MAEF,KAAK,GACH,GAAIE,GAAMV,UAAU,EACpB,IAAmB,gBAARU,GAAkB,CAC3B,GAAG,MAAQA,IAAO,MAAQA,GAAK,CAC7B,GAAIC,GAAY,GAAItH,GAAQqH,EAAIH,GAAIG,EAAIF,GACxCpJ,MAAKmJ,GAAKI,EAAUJ,GACpBnJ,KAAKoJ,GAAKG,EAAUH,EACpB,OACK,GAAI,KAAOE,IAAO,OAASA,GAAK,CACrC,GAAIC,GAAYtH,EAAQuH,UAAUF,EAAIG,EAAGH,EAAII,IAC7C1J,MAAKmJ,GAAKI,EAAUJ,GACpBnJ,KAAKoJ,GAAKG,EAAUH,EACpB,QAGJ,KAAM,IAAIC,aAAY,8DAExB,KAAK,GACH,IAAK5B,EAAS0B,KAAQ1B,EAAS2B,GAC7B,KAAM,IAAIrG,WAAU,8CAEtB/C,MAAKmJ,GAAKA,EACVnJ,KAAKoJ,GAAKA,CACV,MAEF,SACE,KAAM,IAAIC,aAAY,gEAgB5B,QAASM,KACP,KAAY,KAALlJ,GAAiB,KAALA,GACjBmJ,IAIJ,QAASC,GAAYpJ,GACnB,MAASA,IAAK,KAAY,KAALA,GAAkB,KAALA,EAGpC,QAASqJ,GAASrJ,GAChB,MAASA,IAAK,KAAY,KAALA,EAGvB,QAASmJ,KACP3E,IACAxE,EAAIsJ,EAAKC,OAAO/E,GAGlB,QAASgF,GAAOC,GACdjF,EAAQiF,EACRzJ,EAAIsJ,EAAKC,OAAO/E,GAGlB,QAASkF,KACP,GACID,GADAhJ,EAAS,EAYb,IAVAgJ,EAAWjF,EAEF,KAALxE,EACFmJ,IAEY,KAALnJ,IACPS,GAAUT,EACVmJ,MAGGC,EAAWpJ,GAGd,MADAwJ,GAAOC,GACA,IAIT,IAAS,KAALzJ,GAGF,GAFAS,GAAUT,EACVmJ,KACKE,EAAQrJ,GAGX,MADAwJ,GAAOC,GACA,SAGN,CACH,KAAOJ,EAAQrJ,IACbS,GAAUT,EACVmJ,GAEO,MAALnJ,IACFS,GAAUT,EACVmJ,KAGJ,KAAOE,EAAQrJ,IACbS,GAAUT,EACVmJ,GAIF,IAAS,KAALnJ,GAAiB,KAALA,EAAU,CAUxB,GATAS,GAAUT,EACVmJ,KAES,KAALnJ,GAAiB,KAALA,KACdS,GAAUT,EACVmJ,MAIGE,EAAQrJ,GAGX,MADAwJ,GAAOC,GACA,IAGT,MAAOJ,EAAQrJ,IACbS,GAAUT,EACVmJ,IAIJ,MAAO1I,GAGT,QAASkJ,KAEP,GAAIC,GAAQN,EAAKC,OAAO/E,EAAQ,EAChC,IAAS,KAALxE,GAAiB,KAALA,EAEd,MADAmJ,KACO,GAEJ,MAAU,KAALnJ,GAAiB,KAALA,GAAuB,KAAT4J,GAAyB,KAATA,GAAe,CACjE,GAAInJ,GAAe,KAALT,EAAY,IAAM,IAGhC,OAFAmJ,KACAA,IACO1I,EAGT,MAAO,MA5LT,GAAIoJ,GAAOpK,EAAoB,KAC3BmC,EAAOnC,EAAoB,GAC3BgB,EAASoJ,EAAKpJ,OAEduG,EAAW6C,EAAKpJ,OAAOuG,SACvB8C,EAASlI,EAAKkI,OACdC,EAAWF,EAAKG,OAAOD,QAmE3BvI,GAAQyI,UAAY,SAAU3E,GAC5B,MAAQA,aAAiB9D,GAI3B,IAAI8H,GAAM9E,EAAOxE,CAwHjBwB,GAAQmB,MAAQ,SAAUmF,GAKxB,GAJAwB,EAAOxB,EACPtD,EAAQ,GACRxE,EAAI,IAEC+J,EAAST,GACZ,MAAO,KAGTH,KACAD,GACA,IAAIgB,GAAQR,GACZ,IAAIQ,EAAO,CACT,GAAS,KAALlK,GAAiB,KAALA,EAId,MAFAmJ,KACAD,IACIlJ,EAEK,KAGF,GAAIwB,GAAQ,EAAG+D,OAAO2E,GAI7BhB,IACA,IAAIiB,GAAYnK,CAChB,IAAiB,KAAbmK,GAAiC,KAAbA,EAGtB,MADAjB,KACIlJ,EAEK,KAGF,GAAIwB,GAAQ+D,OAAO2E,GAAQ,EAIlCf,KACAD,GACA,IAAIkB,GAASV,GACb,IAAIU,EAAQ,CACV,GAAS,KAALpK,GAAiB,KAALA,EAEd,MAAO,KAETmJ,SAIA,IADAiB,EAAST,KACJS,EAEH,MAAO,KAeX,OAXiB,KAAbD,IAEAC,EADe,KAAbA,EAAO,GACC,IAAMA,EAAOC,UAAU,GAGxB,IAAMD,GAInBjB,IACAD,IACIlJ,EAEK,KAGF,GAAIwB,GAAQ+D,OAAO2E,GAAQ3E,OAAO6E,IAO7C,OADAF,EAAQP,MAENT,IACIlJ,EAEK,KAGF,GAAIwB,GAAQ,EAAG+D,OAAO2E,KAI1B,MAcT1I,EAAQuH,UAAY,WAClB,OAAQZ,UAAU7B,QAChB,IAAK,GACH,GAAIuC,GAAMV,UAAU,EACpB,IAAkB,gBAARU,GACR,MAAOrH,GAAQuH,UAAUF,EAAIG,EAAGH,EAAII,IAEtC,MAAM,IAAI3G,WAAU,iDAEtB,KAAK,GACH,GAAI0G,GAAIb,UAAU,GAChBc,EAAMd,UAAU,EAClB,IAAGnB,EAASgC,GAAI,CAMd,GALIc,EAAOb,IAAQA,EAAIqB,QAAQ1I,EAAK2I,WAAWC,SAE7CvB,EAAMA,EAAI5G,SAAS,QAGlB2E,EAASiC,GACV,MAAO,IAAIzH,GAAQwH,EAAI9B,KAAKuD,IAAIxB,GAAMD,EAAI9B,KAAKwD,IAAIzB,GAGrD,MAAM,IAAI3G,WAAU,0CAEpB,KAAM,IAAIA,WAAU,4BAGxB,SACE,KAAM,IAAIsG,aAAY,qDAS5BpH,EAAQmJ,UAAUC,QAAU,WAC1B,OACE5B,EAAG9B,KAAK3D,KAAKhE,KAAKmJ,GAAKnJ,KAAKmJ,GAAKnJ,KAAKoJ,GAAKpJ,KAAKoJ,IAChDM,IAAK/B,KAAK2D,MAAMtL,KAAKoJ,GAAIpJ,KAAKmJ,MAQlClH,EAAQmJ,UAAUxJ,MAAQ,WACxB,MAAO,IAAIK,GAAQjC,KAAKmJ,GAAInJ,KAAKoJ,KAUnCnH,EAAQmJ,UAAUG,OAAS,SAAUC,GACnC,MAAQxL,MAAKmJ,KAAOqC,EAAMrC,IAAQnJ,KAAKoJ,KAAOoC,EAAMpC,IAYtDnH,EAAQmJ,UAAUtD,OAAS,SAAUzG,GACnC,GAAIkH,GAAM,GACNa,EAAKpJ,KAAKoJ,GACVD,EAAKnJ,KAAKmJ,GACVsC,EAAQvK,EAAO4G,OAAO9H,KAAKmJ,GAAI9H,GAC/BqK,EAAQxK,EAAO4G,OAAO9H,KAAKoJ,GAAI/H,GAG/BF,EAAYsG,EAASpG,GAAWA,EAAUA,EAAUA,EAAQF,UAAY,IAC5E,IAAkB,OAAdA,EAAoB,CACtB,GAAIC,GAAUuG,KAAK5D,IAAI,IAAK5C,EACxBwG,MAAKlE,IAAI0F,EAAKC,GAAMhI,IAAU+H,EAAK,GACnCxB,KAAKlE,IAAI2F,EAAKD,GAAM/H,IAAUgI,EAAK,GAuCzC,MAlCEb,GAFQ,GAANa,EAEIqC,EAEO,GAANtC,EAEG,GAANC,EACI,IAEO,IAANA,EACD,KAGAsC,EAAQ,IAKZtC,EAAK,EACG,GAANA,EACIqC,EAAQ,OAGRA,EAAQ,MAAQC,EAAQ,IAItB,IAANtC,EACIqC,EAAQ,OAGRA,EAAQ,MAAQC,EAAMZ,UAAU,GAAK,KAYnD7I,EAAQmJ,UAAUO,SAAW,WAC3B,MAAO3L,MAAK8H,UAQd7F,EAAQmJ,UAAUQ,OAAS,WACzB,OACEjG,OAAQ,UACRwD,GAAInJ,KAAKmJ,GACTC,GAAIpJ,KAAKoJ,KAYbnH,EAAQ4J,SAAW,SAAUtI,GAC3B,MAAO,IAAItB,GAAQsB,IAOrBtB,EAAQmJ,UAAUnF,QAAUhE,EAAQmJ,UAAUO,SAG9C9L,EAAOD,QAAUqC,GAKZ,SAASpC,EAAQD,EAASM,GAE/B,YAoCA,SAASgC,GAAM4J,EAAOC,EAAKC,GACzB,KAAMhM,eAAgBkC,IACpB,KAAM,IAAImH,aAAY,mDAGxB,IAAa,MAATyC,IAAkB5K,EAAOuG,SAASqE,GACpC,KAAM,IAAI/I,WAAU,mCAEtB,IAAW,MAAPgJ,IAAgB7K,EAAOuG,SAASsE,GAClC,KAAM,IAAIhJ,WAAU,iCAEtB,IAAY,MAARiJ,IAAiB9K,EAAOuG,SAASuE,GACnC,KAAM,IAAIjJ,WAAU,kCAGtB/C,MAAK8L,MAAkB,MAATA,EAAiBpD,WAAWoD,GAAS,EACnD9L,KAAK+L,IAAgB,MAAPA,EAAerD,WAAWqD,GAAO,EAC/C/L,KAAKgM,KAAiB,MAARA,EAAgBtD,WAAWsD,GAAQ,EAnDnD,CAAA,GAAI1B,GAAOpK,EAAoB,KAE3BgB,EAASoJ,EAAKpJ,OACduJ,EAASH,EAAKG,MACNH,GAAKtH,MA0DjBd,EAAMkB,MAAQ,SAAUmF,GACtB,IAAKkC,EAAOD,SAASjC,GACnB,MAAO,KAGT,IAAI0D,GAAO1D,EAAI2D,MAAM,KACjBC,EAAOF,EAAK/G,IAAI,SAAUoE,GAC5B,MAAOZ,YAAWY,KAGhB8C,EAAUD,EAAKE,KAAK,SAAUC,GAChC,MAAOtE,OAAMsE,IAEf,IAAGF,EACD,MAAO,KAGT,QAAQD,EAAKpF,QACX,IAAK,GAAG,MAAO,IAAI7E,GAAMiK,EAAK,GAAIA,EAAK,GACvC,KAAK,GAAG,MAAO,IAAIjK,GAAMiK,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAChD,SAAS,MAAO,QAQpBjK,EAAMkJ,UAAUxJ,MAAQ,WACtB,MAAO,IAAIM,GAAMlC,KAAK8L,MAAO9L,KAAK+L,IAAK/L,KAAKgM,OAQ9C9J,EAAMqK,QAAU,SAAUjL,GACxB,MAAQA,aAAkBY,IAQ5BA,EAAMkJ,UAAUoB,KAAO,WACrB,GAAI1F,GAAM,EACNgF,EAAQ9L,KAAK8L,MACbE,EAAOhM,KAAKgM,KACZD,EAAM/L,KAAK+L,IACX7C,EAAO6C,EAAMD,CAYjB,OAVI5K,GAAO2G,KAAKmE,IAAS9K,EAAO2G,KAAKqB,GACnCpC,EAAMa,KAAK8E,KAAK,EAAST,GAEV,GAAR9C,IACPpC,EAAM,GAGJkB,MAAMlB,KACRA,EAAM,IAEAA,IAOV5E,EAAMkJ,UAAU1G,IAAM,WACpB,GAAI8H,GAAOxM,KAAKwM,OAAO,EAEvB,OAAIA,GAAO,EACLxM,KAAKgM,KAAO,EAEPhM,KAAK8L,MAIL9L,KAAK8L,OAASU,EAAO,GAAKxM,KAAKgM,KAIjCpG,QAQX1D,EAAMkJ,UAAUjG,IAAM,WACpB,GAAIqH,GAAOxM,KAAKwM,OAAO,EAEvB,OAAIA,GAAO,EACLxM,KAAKgM,KAAO,EAEPhM,KAAK8L,OAASU,EAAO,GAAKxM,KAAKgM,KAI/BhM,KAAK8L,MAIPlG,QAWX1D,EAAMkJ,UAAUpG,QAAU,SAAU0H,GAClC,GAAIhK,GAAI1C,KAAK8L,MACTE,EAAOhM,KAAKgM,KACZD,EAAM/L,KAAK+L,IACXlF,EAAI,CAER,IAAImF,EAAO,EACT,KAAWD,EAAJrJ,GACLgK,EAAShK,EAAGmE,EAAG7G,MACf0C,GAAKsJ,EACLnF,QAGC,IAAW,EAAPmF,EACP,KAAOtJ,EAAIqJ,GACTW,EAAShK,EAAGmE,EAAG7G,MACf0C,GAAKsJ,EACLnF,KAaN3E,EAAMkJ,UAAUlG,IAAM,SAAUwH,GAC9B,GAAI1J,KAIJ,OAHAhD,MAAKgF,QAAQ,SAAUe,EAAOd,EAAO0H,GACnC3J,EAAMiC,GAASyH,EAAS3G,EAAOd,EAAO0H,KAEjC3J,GAOTd,EAAMkJ,UAAUwB,QAAU,WACxB,GAAI5J,KAIJ,OAHAhD,MAAKgF,QAAQ,SAAUe,EAAOd,GAC5BjC,EAAMiC,GAASc,IAEV/C,GAOTd,EAAMkJ,UAAUnF,QAAU,WAExB,MAAOjG,MAAK4M,WAYd1K,EAAMkJ,UAAUtD,OAAS,SAAUzG,GACjC,GAAIkH,GAAMrH,EAAO4G,OAAO9H,KAAK8L,MAAOzK,EAMpC,OAJiB,IAAbrB,KAAKgM,OACPzD,GAAO,IAAMrH,EAAO4G,OAAO9H,KAAKgM,KAAM3K,IAExCkH,GAAO,IAAMrH,EAAO4G,OAAO9H,KAAK+L,IAAK1K,IAQvCa,EAAMkJ,UAAUO,SAAW,WACzB,MAAO3L,MAAK8H,UAQd5F,EAAMkJ,UAAUQ,OAAS,WACvB,OACEjG,OAAQ,QACRmG,MAAO9L,KAAK8L,MACZC,IAAK/L,KAAK+L,IACVC,KAAMhM,KAAKgM,OAUf9J,EAAM2J,SAAW,SAAUtI,GACzB,MAAO,IAAIrB,GAAMqB,EAAKuI,MAAOvI,EAAKwI,IAAKxI,EAAKyI,OAI9CnM,EAAOD,QAAUsC,GAKZ,SAASrC,EAAQD,EAASM,GAE/B,YA+BA,SAASiC,KACP,KAAMnC,eAAgBmC,IACpB,KAAM,IAAIkH,aAAY,mDAGxBrJ,MAAK6M,WACL7M,KAAK8M,WAAY,CAEjB,KAAK,GAAIjG,GAAI,EAAGkG,EAAKnE,UAAU7B,OAAYgG,EAAJlG,EAAQA,IAAK,CAClD,GAAIyC,GAAMV,UAAU/B,EAEpB,IAAIyC,YAAepH,GACjBlC,KAAK6M,QAAQG,KAAK1D,GAClBtJ,KAAK8M,WAAY,MAEd,IAAIhH,EAAQwD,GACftJ,KAAK6M,QAAQG,KAAKC,EAAa3D,IAC/BtJ,KAAK8M,WAAY,MAEd,IAAIrF,EAAS6B,GAChBtJ,KAAK6M,QAAQG,KAAKC,GAAc3D,EAAKA,EAAM,SAGxC,CACH,GAAI4D,GAAY5D,EAAIrD,SACpB,KAAIH,EAAQoH,GAKV,KAAM,IAAInK,WAAU,4CAJpB/C,MAAK6M,QAAQG,KAAKC,EAAaC,IAC/BlN,KAAK8M,WAAY,IAgBzB,QAASG,GAAa3D,GAKpB,IAAK,GADDgD,GAAMhD,EAAIvC,OACLF,EAAI,EAAOyF,EAAJzF,EAASA,IACvB,IAAKY,EAAS6B,EAAIzC,MAAQa,EAAU4B,EAAIzC,IACtC,KAAM,IAAI9D,WAAU,2CAIxB,QAAQuG,EAAIvC,QACV,IAAK,GACH,MAAO,IAAI7E,GAAMoH,EAAI,GAAIA,EAAI,GAC/B,KAAK,GACH,MAAO,IAAIpH,GAAMoH,EAAI,GAAIA,EAAI,GAAIA,EAAI,GACvC,SAEE,KAAM,IAAID,aAAY,yDA1F5B,GAAIiB,GAAOpK,EAAoB,KAE3BgC,EAAQhC,EAAoB,GAE5BgB,EAASoJ,EAAKpJ,OAEduG,EAAWvG,EAAOuG,SAClBC,EAAYxG,EAAOwG,UACnB5B,EAAUD,MAAMC,OA0FpB3D,GAAMiJ,UAAUxJ,MAAQ,WACtB,GAAIqD,GAAQ,GAAI9C,EAGhB,OAFA8C,GAAM4H,QAAUvC,EAAKhJ,OAAOM,MAAM5B,KAAK6M,SACvC5H,EAAM6H,UAAY9M,KAAK8M,UAChB7H,GAQT9C,EAAMgL,QAAU,SAAU7L,GACxB,MAAQA,aAAkBa,IAS5BA,EAAMxB,OAAS,SAAUyM,GACvB,GAAInI,GAAQ,GAAI9C,EAEhB,OADAA,GAAMkL,MAAMpI,EAAOmI,GACZnI,GAOT9C,EAAMiJ,UAAUoB,KAAO,WAGrB,IAAK,GAFDA,MAEK3F,EAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAAK,CACrD,GAAIxB,GAAQrF,KAAK6M,QAAQhG,EAEzB2F,GAAK3F,GAAKxB,EAAMmH,OAAO,GAGzB,MAAOA,IAOTrK,EAAMiJ,UAAUjG,IAAM,WAGpB,IAAK,GAFDmI,MAEKzG,EAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAAK,CACrD,GAAIxB,GAAQrF,KAAK6M,QAAQhG,EACzByG,GAAOzG,GAAKxB,EAAMF,MAGpB,MAAOmI,IAOTnL,EAAMiJ,UAAU1G,IAAM,WAGpB,IAAK,GAFD4I,MAEKzG,EAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAAK,CACrD,GAAIxB,GAAQrF,KAAK6M,QAAQhG,EAEzByG,GAAOzG,GAAKxB,EAAMX,MAGpB,MAAO4I,IASTnL,EAAMiJ,UAAUpG,QAAU,SAAU0H,GAClC,IAAK,GAAI7F,GAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAChD6F,EAAS1M,KAAK6M,QAAQhG,GAAIA,EAAG7G,OASjCmC,EAAMiJ,UAAU/F,MAAQ,SAASkI,GAC/B,MAAOvN,MAAK6M,QAAQU,IAAQ,MAU9BpL,EAAMiJ,UAAUoC,SAAW,WACzB,MAAOxN,MAAK8M,WAQd3K,EAAMiJ,UAAUwB,QAAU,WAExB,IAAK,GADD5J,MACK6D,EAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAAK,CACrD,GAAIxB,GAAQrF,KAAK6M,QAAQhG,GACrB4G,KACA/K,EAAI2C,EAAMyG,MACVC,EAAM1G,EAAM0G,IACZC,EAAO3G,EAAM2G,IAEjB,IAAIA,EAAO,EACT,KAAWD,EAAJrJ,GACL+K,EAAIT,KAAKtK,GACTA,GAAKsJ,MAGJ,IAAW,EAAPA,EACP,KAAOtJ,EAAIqJ,GACT0B,EAAIT,KAAKtK,GACTA,GAAKsJ,CAIThJ,GAAMgK,KAAKS,GAGb,MAAOzK,IAQTb,EAAMiJ,UAAUnF,QAAU9D,EAAMiJ,UAAUwB,QAM1CzK,EAAMiJ,UAAUO,SAAW,WAGzB,IAAK,GAFD+B,MAEK7G,EAAI,EAAGkG,EAAK/M,KAAK6M,QAAQ9F,OAAYgG,EAAJlG,EAAQA,IAAK,CACrD,GAAIxB,GAAQrF,KAAK6M,QAAQhG,GACrB0B,EAAMrH,EAAO4G,OAAOzC,EAAMyG,MACZ,IAAdzG,EAAM2G,OACRzD,GAAO,IAAMrH,EAAO4G,OAAOzC,EAAM2G,OAEnCzD,GAAO,IAAMrH,EAAO4G,OAAOzC,EAAM0G,KACjC2B,EAAQV,KAAKzE,GAGf,MAAO,IAAMmF,EAAQC,KAAK,MAAQ,KAQpCxL,EAAMiJ,UAAUQ,OAAS,WACvB,OACEjG,OAAQ,QACRyH,OAAQpN,KAAK6M,UAUjB1K,EAAM0J,SAAW,SAAUtI,GACzB,MAAOpB,GAAMxB,OAAO4C,EAAK6J,SAI3BvN,EAAOD,QAAUuC,GAKZ,SAAStC,EAAQD,EAASM,GAE/B,YAoCA,SAASkC,GAAOwL,GACd,KAAM5N,eAAgBoC,IACpB,KAAM,IAAIiH,aAAY,mDAGxB,IAAIuE,YAAgBxL,GAElBpC,KAAK6N,MAAQD,EAAKhM,QAAQiM,UAEvB,IAAI/H,EAAQ8H,GAGf5N,KAAK6N,MAAQC,EAAWF,OAErB,CAAA,GAAY,MAARA,EAEP,KAAM,IAAI7K,WAAU,6BAA+BuH,EAAK7H,MAAMjB,KAAKoM,GAAQ,IAI3E5N,MAAK6N,SAIP7N,KAAK+N,MAAQ/K,EAAMwJ,KAAKxM,KAAK6N,OA+G/B,QAASG,GAAM/M,EAAQgE,GACrB,KAAMA,YAAiB9C,IACrB,KAAM,IAAIY,WAAU,gBAGtB,IAAIyK,GAAWvI,EAAMuI,UACrB,IAAIA,EAEF,MAAOvM,GAAOsG,IAAItC,EAAMP,MAIxB,IAAI8H,GAAOvH,EAAMuH,MACjB,IAAIA,EAAKzF,QAAU9F,EAAO8M,MAAMhH,OAC9B,KAAM,IAAIkH,GAAezB,EAAKzF,OAAQ9F,EAAO8M,MAAMhH,OAMrD,KAAK,GAFDrC,GAAMO,EAAMP,MACZS,EAAMF,EAAME,MACP0B,EAAI,EAAGkG,EAAK9L,EAAO8M,MAAMhH,OAAYgG,EAAJlG,EAAQA,IAChDqH,EAAcxJ,EAAImC,GAAI5F,EAAO8M,MAAMlH,IACnCqH,EAAc/I,EAAI0B,GAAI5F,EAAO8M,MAAMlH,GAKrC,OAAO,IAAIzE,GAAO+L,EAAclN,EAAO4M,MAAO5I,EAAOuH,EAAKzF,OAAQ,IActE,QAASoH,GAAeP,EAAM3I,EAAOmJ,EAAMb,GACzC,GAAIc,GAAQd,GAAOa,EAAO,EACtB/I,EAAQJ,EAAMI,MAAMkI,EAExB,OACSlI,GAAMH,IADXmJ,EACe,SAAUxH,GACzB,MAAO+G,GAAK/G,IAIG,SAAUA,GACzB,GAAIyH,GAAQV,EAAK/G,EACjB,OAAOsH,GAAcG,EAAOrJ,EAAOmJ,EAAMb,EAAM,KAgBrD,QAASgB,GAAMtN,EAAQgE,EAAOuJ,EAAWC,GACvC,KAAMxJ,YAAiB9C,IACrB,KAAM,IAAIY,WAAU,gBAItB,IAII2L,GAJAC,EAAQ1J,EAAMuH,OACdgB,EAAWvI,EAAMuI,UAYrB,IARIgB,YAAqBpM,IACvBsM,EAAQF,EAAUhC,OAClBgC,EAAYA,EAAUvI,WAGtByI,EAAQ1L,EAAMwJ,KAAKgC,GAGjBhB,EAAU,CAIZ,GAAoB,GAAhBkB,EAAM3H,OACR,KAAM,IAAIhE,WAAU,kBAGtB9B,GAAOuG,IAAIvC,EAAMP,MAAO8J,EAAWC,OAEhC,CAIH,GAAIE,EAAM5H,OAAS9F,EAAO8M,MAAMhH,OAC9B,KAAM,IAAIkH,GAAeU,EAAM5H,OAAQ9F,EAAO8M,MAAMhH,OAAQ,IAG9D,IAAI2H,EAAM3H,OAAS4H,EAAM5H,OAAQ,CAI/B,IAFA,GAAIF,GAAI,EACJ+H,EAAQ,EACQ,IAAbD,EAAM9H,IAAyB,IAAb6H,EAAM7H,IAC7BA,GAEF,MAAoB,IAAb8H,EAAM9H,IACX+H,IACA/H,GAIF2H,GAAYxL,EAAM6L,UAAUL,EAAWG,EAAM5H,OAAQ6H,EAAOF,GAI9D,IAAKpN,EAAOsF,UAAU+H,EAAOD,GAC3B,KAAM,IAAIT,GAAeU,EAAOD,EAAO,IAIzC,IAAIlC,GAAOvH,EAAME,MAAMD,IAAI,SAAU2B,GACnC,MAAOA,GAAI,GAEbiI,GAAK7N,EAAQuL,EAAMiC,EAGnB,IAAIL,GAAOO,EAAM5H,OACbwG,EAAM,CACVwB,GAAe9N,EAAO4M,MAAO5I,EAAOuJ,EAAWJ,EAAMb,GAGvD,MAAOtM,GAYT,QAAS8N,GAAenB,EAAM3I,EAAOuJ,EAAWJ,EAAMb,GACpD,GAAIc,GAAQd,GAAOa,EAAO,EACtB/I,EAAQJ,EAAMI,MAAMkI,EAGtBlI,GAAML,QADJqJ,EACY,SAAUW,EAAWC,GACjCf,EAAcc,GACdpB,EAAKoB,GAAaR,EAAUS,IAIhB,SAAUD,EAAWC,GACjCf,EAAcc,GACdD,EAAcnB,EAAKoB,GAAY/J,EAAOuJ,EAAUS,GAAWb,EAAMb,EAAM,KA6B7E,QAASuB,GAAK7N,EAAQuL,EAAMiC,GAK1B,IAJA,GAAIS,GAAU5N,EAAOM,MAAMX,EAAO8M,OAC9BoB,GAAU,EAGPD,EAAQnI,OAASyF,EAAKzF,QAC3BmI,EAAQlC,KAAK,GACbmC,GAAU,CAIZ,KAAK,GAAItI,GAAI,EAAGkG,EAAKP,EAAKzF,OAAYgG,EAAJlG,EAAQA,IACpC2F,EAAK3F,GAAKqI,EAAQrI,KACpBqI,EAAQrI,GAAK2F,EAAK3F,GAClBsI,GAAU,EAIVA,IAEFlO,EAAOmO,OAAOF,EAAST,GAyI3B,QAASX,GAAWF,GAClB,IAAK,GAAI/G,GAAI,EAAGkG,EAAKa,EAAK7G,OAAYgG,EAAJlG,EAAQA,IAAK,CAC7C,GAAIwI,GAAOzB,EAAK/G,EACZf,GAAQuJ,GACVzB,EAAK/G,GAAKiH,EAAWuB,GAEdA,YAAgBjN,KACvBwL,EAAK/G,GAAKiH,EAAWuB,EAAKxB,QAI9B,MAAOD,GAlhBT,GAAItD,GAAOpK,EAAoB,KAC3B+N,EAAiB/N,EAAoB,KAErCiC,EAAQjC,EAAoB,GAG5BuK,GADSH,EAAKpJ,OACLoJ,EAAKG,QACdzH,EAAQsH,EAAKtH,MACb1B,EAASgJ,EAAKhJ,OAEdwE,EAAUD,MAAMC,QAChBoI,EAAgBlL,EAAMkL,aAuD1B9L,GAAOkN,SAAW,SAAUhO,GAC1B,MAAQA,aAAkBc,IAgB5BA,EAAOgJ,UAAU9F,OAAS,SAAUL,EAAOsK,EAAad,GACtD,OAAQ7F,UAAU7B,QAChB,IAAK,GACH,MAAOiH,GAAKhO,KAAMiF,EAGpB,KAAK,GACL,IAAK,GACH,MAAOsJ,GAAKvO,KAAMiF,EAAOsK,EAAad,EAExC,SACE,KAAM,IAAIpF,aAAY,+BAS5BjH,EAAOgJ,UAAU7D,IAAM,SAAUtC,GAC/B,IAAKa,EAAQb,GACX,KAAM,IAAIlC,WAAU,iBAEtB,IAAIkC,EAAM8B,QAAU/G,KAAK+N,MAAMhH,OAC7B,KAAM,IAAIkH,GAAehJ,EAAM8B,OAAQ/G,KAAK+N,MAAMhH,OAIpD,KAAK,GADD6G,GAAO5N,KAAK6N,MACPhH,EAAI,EAAGkG,EAAK9H,EAAM8B,OAAYgG,EAAJlG,EAAQA,IAAK,CAC9C,GAAI2I,GAAUvK,EAAM4B,EACpBqH,GAAcsB,EAAS5B,EAAK7G,QAC5B6G,EAAOA,EAAK4B,GAGd,MAAOlO,GAAOM,MAAMgM,IAYtBxL,EAAOgJ,UAAU5D,IAAM,SAAUvC,EAAOc,EAAO0I,GAC7C,GAAI5H,GAAGkG,CAGP,KAAKjH,EAAQb,GACX,KAAM,IAAInE,OAAM,iBAElB,IAAImE,EAAM8B,OAAS/G,KAAK+N,MAAMhH,OAC5B,KAAM,IAAIkH,GAAehJ,EAAM8B,OAAQ/G,KAAK+N,MAAMhH,OAAQ,IAI5D,IAAIyF,GAAOvH,EAAMC,IAAI,SAAU2B,GAC7B,MAAOA,GAAI,GAEbiI,GAAK9O,KAAMwM,EAAMiC,EAGjB,IAAIb,GAAO5N,KAAK6N,KAChB,KAAKhH,EAAI,EAAGkG,EAAK9H,EAAM8B,OAAS,EAAOgG,EAAJlG,EAAQA,IAAK,CAC9C,GAAI2I,GAAUvK,EAAM4B,EACpBqH,GAAcsB,EAAS5B,EAAK7G,QAC5B6G,EAAOA,EAAK4B,GAQd,MAJAA,GAAUvK,EAAMA,EAAM8B,OAAS,GAC/BmH,EAAcsB,EAAS5B,EAAK7G,QAC5B6G,EAAK4B,GAAWzJ,EAET/F,MA0LToC,EAAOgJ,UAAUgE,OAAS,SAAU5C,EAAMiC,GAKxC,MAJAzO,MAAK+N,MAAQzM,EAAOM,MAAM4K,GAC1BxM,KAAK6N,MAAQ7K,EAAMoM,OAAOpP,KAAK6N,MAAO7N,KAAK+N,MAAOU,GAG3CzO,MAuCToC,EAAOgJ,UAAUxJ,MAAQ,WACvB,GAAIX,GAAS,GAAImB,EAGjB,OAFAnB,GAAO4M,MAAQvM,EAAOM,MAAM5B,KAAK6N,OACjC5M,EAAO8M,MAAQzM,EAAOM,MAAM5B,KAAK+N,OAC1B9M,GAOTmB,EAAOgJ,UAAUoB,KAAO,WACtB,MAAOxM,MAAK+N,OAWd3L,EAAOgJ,UAAUlG,IAAM,SAAUwH,GAC/B,GAAI+C,GAAKzP,KACLiB,EAAS,GAAImB,GAEbsN,EAAU,SAAU3J,EAAOd,GAC7B,MAAIa,GAAQC,GACHA,EAAMb,IAAI,SAAUoJ,EAAOzH,GAChC,MAAO6I,GAAQpB,EAAOrJ,EAAMH,OAAO+B,MAI9B6F,EAAS3G,EAAOd,EAAOwK,GAMlC,OAHAxO,GAAO4M,MAAQ6B,EAAQ1P,KAAK6N,UAC5B5M,EAAO8M,MAAQzM,EAAOM,MAAM5B,KAAK+N,OAE1B9M,GASTmB,EAAOgJ,UAAUpG,QAAU,SAAU0H,GACnC,GAAI+C,GAAKzP,KAEL0P,EAAU,SAAU3J,EAAOd,GACzBa,EAAQC,GACVA,EAAMf,QAAQ,SAAUsJ,EAAOzH,GAC7B6I,EAAQpB,EAAOrJ,EAAMH,OAAO+B,MAI9B6F,EAAS3G,EAAOd,EAAOwK,GAG3BC,GAAQ1P,KAAK6N,WAOfzL,EAAOgJ,UAAUwB,QAAU,WACzB,MAAOtL,GAAOM,MAAM5B,KAAK6N,QAO3BzL,EAAOgJ,UAAUnF,QAAU,WACzB,MAAOjG,MAAK6N,OAWdzL,EAAOgJ,UAAUtD,OAAS,SAAUzG,GAClC,MAAOoJ,GAAO3C,OAAO9H,KAAK6N,MAAOxM,IAOnCe,EAAOgJ,UAAUO,SAAW,WAC1B,MAAOlB,GAAO3C,OAAO9H,KAAK6N,QAO5BzL,EAAOgJ,UAAUQ,OAAS,WACxB,OACEjG,OAAQ,SACRiI,KAAM5N,KAAK6N,QAWfzL,EAAOyJ,SAAW,SAAUtI,GAC1B,MAAO,IAAInB,GAAOmB,EAAKqK,OAwBzB/N,EAAOD,QAAUwC,GAKZ,SAASvC,EAAQD,EAASM,GAE/B,YAyBA,SAASmC,GAAK0D,EAAO4J,GACnB,KAAM3P,eAAgBqC,IACpB,KAAM,IAAIvB,OAAM,mDAGlB,IAAa8E,QAATG,IAAuB0B,EAAS1B,GAClC,KAAM,IAAIhD,WAAU,uDAEtB,IAAY6C,QAAR+J,KAAuBnF,EAASmF,IAAiB,IAARA,GAC3C,KAAM,IAAI5M,WAAU,wDAGtB,IAAY6C,QAAR+J,EAAmB,CAErB,GAAIC,GAAMC,EAAUF,EACpB,KAAKC,EACH,KAAM,IAAIvG,aAAY,iBAAmBsG,EAAO,IAElD3P,MAAK8P,KAAOF,EAAIE,KAChB9P,KAAK+P,OAASH,EAAIG,WAGlB/P,MAAK8P,KAAOE,EACZhQ,KAAK+P,OAASE,CAGhBjQ,MAAK+F,MAAkBH,QAATG,EAAsB/F,KAAKkQ,WAAWnK,GAAS,KAC7D/F,KAAKmQ,WAAY,EAQnB,QAASxG,KACP,KAAY,KAALlJ,GAAiB,KAALA,GACjBmJ,IAIJ,QAASC,GAAYpJ,GACnB,MAASA,IAAK,KAAY,KAALA,GAAkB,KAALA,EAGpC,QAASqJ,GAASrJ,GAChB,MAASA,IAAK,KAAY,KAALA,EAGvB,QAASmJ,KACP3E,IACAxE,EAAIsJ,EAAKC,OAAO/E,GAGlB,QAASgF,GAAOC,GACdjF,EAAQiF,EACRzJ,EAAIsJ,EAAKC,OAAO/E,GAGlB,QAASkF,KACP,GACID,GADAhJ,EAAS,EAYb,IAVAgJ,EAAWjF,EAEF,KAALxE,EACFmJ,IAEY,KAALnJ,IACPS,GAAUT,EACVmJ,MAGGC,EAAWpJ,GAGd,MADAwJ,GAAOC,GACA,IAIT,IAAS,KAALzJ,GAGF,GAFAS,GAAUT,EACVmJ,KACKE,EAAQrJ,GAGX,MADAwJ,GAAOC,GACA,SAGN,CACH,KAAOJ,EAAQrJ,IACbS,GAAUT,EACVmJ,GAEO,MAALnJ,IACFS,GAAUT,EACVmJ,KAGJ,KAAOE,EAAQrJ,IACbS,GAAUT,EACVmJ,GAIF,IAAS,KAALnJ,GAAiB,KAALA,EAAU,CAUxB,GATAS,GAAUT,EACVmJ,KAES,KAALnJ,GAAiB,KAALA,KACdS,GAAUT,EACVmJ,MAIGE,EAAQrJ,GAGX,MADAwJ,GAAOC,GACA,IAGT,MAAOJ,EAAQrJ,IACbS,GAAUT,EACVmJ,IAIJ,MAAO1I,GAGT,QAASkP,KACP,GAAIC,GAAW,EAGf,KADA1G,IACOlJ,GAAU,KAALA,GAAiB,KAALA,GACtB4P,GAAY5P,EACZmJ,GAGF,OAAOyG,IAAY,KAwHrB,QAASR,GAAUtH,GACjB,IAAK,GAAIoH,KAAQW,GACf,GAAIA,EAAM/J,eAAeoJ,IACnBlF,EAAO8F,SAAShI,EAAKoH,GAAQ,CAC/B,GAAIG,GAAOQ,EAAMX,GACba,EAAajI,EAAIxB,OAAS4I,EAAK5I,OAC/B0J,EAAalI,EAAIuC,UAAU,EAAG0F,GAC9BT,EAASD,EAAKY,SAASD,EAC3B,IAAe7K,SAAXmK,EAEF,OACED,KAAMA,EACNC,OAAQA,GAOlB,MAAO,MA5ST,GAwDIhG,GAAM9E,EAAOxE,EAxDb6J,EAAOpK,EAAoB,KAE3BgB,EAASoJ,EAAKpJ,OACduJ,EAASH,EAAKG,OACdhD,EAAW6C,EAAKpJ,OAAOuG,SACvB+C,EAAWF,EAAKG,OAAOD,QAqK3BnI,GAAKe,MAAQ,SAASmF,GAKpB,GAJAwB,EAAOxB,EACPtD,EAAQ,GACRxE,EAAI,IAEC+J,EAAST,GACZ,MAAO,KAGTH,KACAD,GACA,IACIgG,GADA5J,EAAQoE,GAEZ,IAAIpE,EAAO,CAKT,GAJA4J,EAAOS,IAEPxG,IACAD,IACIlJ,EAEF,MAAO,KAGT,IAAIsF,GAAS4J,EACX,IAEE,MAAO,IAAItN,GAAK2D,OAAOD,GAAQ4J,GAEjC,MAAOgB,SAGN,CAKH,GAJAhB,EAAOS,IAEPxG,IACAD,IACIlJ,EAEF,MAAO,KAGT,IAAIkP,EACF,IAEE,MAAO,IAAItN,GAAK,KAAMsN,GAExB,MAAOgB,KAIX,MAAO,OAQTtO,EAAKkI,OAAS,SAASxE,GACrB,MAAQA,aAAiB1D,IAO3BA,EAAK+I,UAAUxJ,MAAQ,WACrB,GAAIA,GAAQ,GAAIS,EAEhB,KAAK,GAAI3B,KAAKV,MACRA,KAAKuG,eAAe7F,KACtBkB,EAAMlB,GAAKV,KAAKU,GAIpB,OAAOkB,IASTS,EAAK+I,UAAU8E,WAAa,SAASnK,GACnC,OAAQA,EAAQ/F,KAAK8P,KAAKc,QAAU5Q,KAAK8P,KAAK/J,MAAQ/F,KAAK+P,OAAOhK,OAUpE1D,EAAK+I,UAAUyF,aAAe,SAAU9K,EAAO+K,GAC7C,MAAmBlL,SAAfkL,EACK/K,EAAQ/F,KAAK8P,KAAK/J,MAAQ/F,KAAK+P,OAAOhK,MAAQ/F,KAAK8P,KAAKc,OAGxD7K,EAAQ/F,KAAK8P,KAAK/J,MAAQ+K,EAAc9Q,KAAK8P,KAAKc,QAwC7DvO,EAAK0O,gBAAkB,SAAUpB,GAC/B,MAA2B,OAAnBE,EAAUF,IAOpBtN,EAAK+I,UAAUL,QAAU,SAASiG,GAChC,MAAQhR,MAAK8P,KAAKkB,OAASA,GAQ7B3O,EAAK+I,UAAU6F,UAAY,SAASzF,GAClC,MAAQxL,MAAK8P,KAAKkB,OAASxF,EAAMsE,KAAKkB,MAQxC3O,EAAK+I,UAAUG,OAAS,SAASC,GAC/B,MAAQxL,MAAKiR,UAAUzF,IAAUxL,KAAK+F,OAASyF,EAAMzF,OAQvD1D,EAAK+I,UAAUvI,GAAK,SAAUqO,GAC5B,GAAI1F,GACAzF,EAAsB,MAAd/F,KAAK+F,MAAgB/F,KAAKkQ,WAAW,GAAKlQ,KAAK+F,KAC3D,IAAIyE,EAAS0G,GAAgB,CAG3B,GAFA1F,EAAQ,GAAInJ,GAAK,KAAM6O,IAElBlR,KAAKiR,UAAUzF,GAClB,KAAM,IAAI1K,OAAM,qBAKlB,OAFA0K,GAAMzF,MAAQA,EACdyF,EAAM2E,WAAY,EACX3E,EAEJ,GAAI0F,YAAyB7O,GAAM,CACtC,IAAKrC,KAAKiR,UAAUC,GAClB,KAAM,IAAIpQ,OAAM,qBAElB,IAA4B,OAAxBoQ,EAAcnL,MAChB,KAAM,IAAIjF,OAAM,wCAMlB,OAHA0K,GAAQ0F,EAActP,QACtB4J,EAAMzF,MAAQA,EACdyF,EAAM2E,WAAY,EACX3E,EAGP,KAAM,IAAI1K,OAAM,yCASpBuB,EAAK+I,UAAUtI,SAAW,SAAUoO,GAClC,GAAI1F,GAAQxL,KAAK6C,GAAGqO,EACpB,OAAO1F,GAAMqF,aAAarF,EAAMzF,MAAOyF,EAAMuE,OAAOhK,QAQtD1D,EAAK+I,UAAUO,SAAW,WACxB,MAAO3L,MAAK8H,UAQdzF,EAAK+I,UAAUQ,OAAS,WACtB,OACEjG,OAAQ,OACRI,MAAO/F,KAAK6Q,aAAa7Q,KAAK+F,OAC9B+J,KAAM9P,KAAK+P,OAAOJ,KAAO3P,KAAK8P,KAAKH,KACnCQ,UAAWnQ,KAAKmQ,YAUpB9N,EAAKwJ,SAAW,SAAUtI,GACxB,GAAIuM,GAAO,GAAIzN,GAAKkB,EAAKwC,MAAOxC,EAAKuM,KAErC,OADAA,GAAKK,UAAY5M,EAAK4M,YAAa,EAC5BL,GAOTzN,EAAK+I,UAAUnF,QAAU5D,EAAK+I,UAAUO,SAUxCtJ,EAAK+I,UAAUtD,OAAS,SAASzG,GAC/B,GAAI0E,GACAwC,CAEJ,IAAmB,OAAfvI,KAAK+F,OAAmB/F,KAAKmQ,UAO/BpK,EAAQ/F,KAAK6Q,aAAa7Q,KAAK+F,OAC/BwC,EAAsB,OAAfvI,KAAK+F,MAAmB7E,EAAO4G,OAAO/B,EAAO1E,GAAW,IAAO,GACtEkH,GAAOvI,KAAK+P,OAAOJ,KAAO3P,KAAK8P,KAAKH,SATM,CAC1C,GAAIwB,GAAanR,KAAKoR,aACtBrL,GAAQ/F,KAAK6Q,aAAa7Q,KAAK+F,MAAOoL,EAAWpL,OACjDwC,EAAMrH,EAAO4G,OAAO/B,EAAO1E,GAAW,IACtCkH,GAAO4I,EAAWxB,KAAO3P,KAAK8P,KAAKH,KAQrC,MAAOpH,IAQTlG,EAAK+I,UAAUgG,YAAc,WAK3B,GAAIC,GAAW1J,KAAKlE,IAAIzD,KAAK+F,MAAQ/F,KAAK8P,KAAK/J,OAC3CoL,EAAalB,EACbqB,EAAW3J,KAAKlE,IAChBkE,KAAK9D,IAAIwN,EAAWF,EAAWpL,OAAS4B,KAAK4J,KAAO,KAEpDb,EAAW1Q,KAAK8P,KAAKY,QACzB,KAAK,GAAIhQ,KAAKgQ,GACZ,GAAIA,EAASnK,eAAe7F,GAAI,CAC9B,GAAIqP,GAASW,EAAShQ,EACtB,IAAIqP,EAAOyB,WAAY,CACrB,GAAItI,GAAOvB,KAAKlE,IACZkE,KAAK9D,IAAIwN,EAAWtB,EAAOhK,OAAS4B,KAAK4J,KAAO,IAEzCD,GAAPpI,IACFiI,EAAapB,EACbuB,EAAWpI,IAMnB,MAAOiI,GAGT,IAAIM,IACFC,MACE,IAAK/B,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,IAEvCG,OACE,IAAKhC,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GAErCI,IAAOjC,KAAM,KAAM5J,MAAO,GAAKyL,YAAY,GAC3CK,GAAMlC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCM,GAAMnC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCO,GAAMpC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCQ,GAAMrC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCS,GAAMtC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CU,GAAMvC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CW,GAAMxC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CY,GAAMzC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ca,GAAM1C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAE1Cc,GAAM3C,KAAM,IAAK5J,MAAO,GAAMyL,YAAY,GAC1C/Q,GAAMkP,KAAM,IAAK5J,MAAO,IAAMyL,YAAY,GAC1ChR,GAAMmP,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ce,GAAM5C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CgB,GAAM7C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1C9Q,GAAMiP,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CiB,GAAM9C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3C/K,GAAMkJ,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CkB,GAAM/C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CxI,GAAM2G,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,IAE7CmB,MACE,IAAKhD,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GAErCoB,MAASjD,KAAM,OAAQ5J,MAAO,GAAKyL,YAAY,GAC/CqB,OAAUlD,KAAM,QAAS5J,MAAO,IAAKyL,YAAY,GACjDsB,MAASnD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CuB,MAASpD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CwB,MAASrD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CyB,MAAStD,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChD0B,MAASvD,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChD2B,KAAQxD,KAAM,MAAO5J,MAAO,KAAMyL,YAAY,GAC9C4B,OAAUzD,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAClD6B,OAAU1D,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAElD8B,MAAS3D,KAAM,OAAQ5J,MAAO,GAAMyL,YAAY,GAChD+B,OAAU5D,KAAM,QAAS5J,MAAO,IAAMyL,YAAY,GAClDgC,OAAU7D,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAClDiC,OAAU9D,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAClDkC,MAAS/D,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChDmC,MAAShE,KAAM,OAAQ5J,MAAO,MAAOyL,YAAY,GACjDoC,OAAUjE,KAAM,QAAS5J,MAAO,MAAOyL,YAAY,GACnDqC,MAASlE,KAAM,OAAQ5J,MAAO,MAAOyL,YAAY,GACjDsC,OAAUnE,KAAM,QAAS5J,MAAO,MAAOyL,YAAY,GACnDuC,OAAUpE,KAAM,QAAS5J,MAAO,MAAOyL,YAAY,IAErDwC,SACE,IAAKrE,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GAErCI,IAAOjC,KAAM,KAAM5J,MAAO,IAAKyL,YAAY,GAC3CK,GAAMlC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCM,GAAMnC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCO,GAAMpC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CQ,GAAMrC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CS,GAAMtC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CU,GAAMvC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CW,GAAMxC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CY,GAAMzC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ca,GAAM1C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAE1Cc,GAAM3C,KAAM,IAAK5J,MAAO,IAAMyL,YAAY,GAC1C/Q,GAAMkP,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1ChR,GAAMmP,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ce,GAAM5C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CgB,GAAM7C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3C9Q,GAAMiP,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CiB,GAAM9C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3C/K,GAAMkJ,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CkB,GAAM/C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CxI,GAAM2G,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,IAE7CyC,OACE,IAAKtE,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GAErCI,IAAOjC,KAAM,KAAM5J,MAAO,IAAKyL,YAAY,GAC3CK,GAAMlC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCM,GAAMnC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCO,GAAMpC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CQ,GAAMrC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CS,GAAMtC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CU,GAAMvC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CW,GAAMxC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CY,GAAMzC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ca,GAAM1C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAE1Cc,GAAM3C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1C/Q,GAAMkP,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1ChR,GAAMmP,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ce,GAAM5C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CgB,GAAM7C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3C9Q,GAAMiP,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CiB,GAAM9C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3C/K,GAAMkJ,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CkB,GAAM/C,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,GAC3CxI,GAAM2G,KAAM,IAAK5J,MAAO,MAAOyL,YAAY,IAE7C0C,cACE,IAAKvE,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GACrCM,GAAMnC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCO,GAAMpC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCQ,GAAMrC,KAAM,IAAK5J,MAAO,IAAKyL,YAAY,GACzCS,GAAMtC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CU,GAAMvC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CW,GAAMxC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1CY,GAAMzC,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAC1Ca,GAAM1C,KAAM,IAAK5J,MAAO,KAAMyL,YAAY,GAE1C2C,IAAOxE,KAAM,KAAM5J,MAAO,KAAMyL,YAAY,GAC5C4C,IAAOzE,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzD6C,IAAO1E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzD8C,IAAO3E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzD+C,IAAO5E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzDgD,IAAO7E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzDiD,IAAO9E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GACzDkD,IAAO/E,KAAM,KAAM5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,IAE3DmD,aACE,IAAKhF,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GACrCsB,MAASnD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CuB,MAASpD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CwB,MAASrD,KAAM,OAAQ5J,MAAO,IAAKyL,YAAY,GAC/CyB,MAAStD,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChD0B,MAASvD,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChD2B,KAASxD,KAAM,MAAO5J,MAAO,KAAMyL,YAAY,GAC/C4B,OAAUzD,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAClD6B,OAAU1D,KAAM,QAAS5J,MAAO,KAAMyL,YAAY,GAElDoD,MAASjF,KAAM,OAAQ5J,MAAO,KAAMyL,YAAY,GAChDqD,MAASlF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC7DsD,MAASnF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC7DuD,MAASpF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC7DwD,MAASrF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC7DyD,KAAStF,KAAM,MAAO5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC5D0D,MAASvF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,GAC7D2D,MAASxF,KAAM,OAAQ5J,MAAO4B,KAAK5D,IAAI,KAAM,GAAIyN,YAAY,KAI7DvB,GAAeN,KAAM,GAAI5J,MAAO,EAAGyL,YAAY,GAE/CxG,GACF0G,QAEA0D,UACAC,QACAC,QACAC,WACAC,eACAC,sBACAC,uBAEAC,SACAC,WACAC,UACA5K,SACA6K,QAGEC,KAEA/F,GAAaL,KAAM,GAAIqB,KAAM+E,EAAgBhQ,MAAO,EAAG6K,OAAQ,GAE/DN,GAEF0F,OAAQrG,KAAM,QAASqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASkB,KAAM5M,MAAO,EAAG6K,OAAQ,GAC3FqF,MAAOtG,KAAM,OAAQqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC9FsF,MAAOvG,KAAM,OAAQqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC9FuF,MAAOxG,KAAM,OAAQqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC9FwF,MAAOzG,KAAM,OAAQqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,SAAU6K,OAAQ,GAChGyF,MAAO1G,KAAM,OAAQqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAU6K,OAAQ,GAChG0F,KAAM3G,KAAM,MAAOqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAU6K,OAAQ,GAC9F2F,OAAQ5G,KAAM,QAASqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAS6K,OAAQ,GACjG4F,UAAW7G,KAAM,WAAYqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAO6K,OAAQ,GAErGpQ,GAAImP,KAAM,IAAKqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASE,MAAO5L,MAAO,EAAG6K,OAAQ,GACpF6F,MAAO9G,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC5F8F,IAAK/G,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC1F+F,IAAKhH,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,MAAQ6K,OAAQ,GAC1FgG,IAAKjH,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,SAAU6K,OAAQ,GAC5FiG,IAAKlH,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAU6K,OAAQ,GAC5FkG,IAAKnH,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAU6K,OAAQ,GAC5FmG,IAAKpH,KAAM,KAAMqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,QAAS6K,OAAQ,GAC3FoG,KAAMrH,KAAM,MAAOqB,KAAMhG,EAAWoK,OAAQ1E,SAAUe,EAASC,KAAM3L,MAAO,OAAW6K,OAAQ,GAG/FqG,IAAKtH,KAAM,KAAMqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASuC,QAASjO,MAAO,EAAG6K,OAAQ,GACzFsG,MAAOvH,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,SAAY6K,OAAQ,GACnGuG,MAAOxH,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,UAAY6K,OAAQ,GACnGwG,MAAOzH,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,UAAY6K,OAAQ,GACnGyG,MAAO1H,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,eAAgB6K,OAAQ,GACvG0G,MAAO3H,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,SAAU6K,OAAQ,GACjG2G,MAAO5H,KAAM,OAAQqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,SAAU6K,OAAQ,GACjG4G,OAAQ7H,KAAM,QAASqB,KAAMhG,EAAW4K,QAASlF,SAAUe,EAASC,KAAM3L,MAAO,WAAY6K,OAAQ,GAGrG6G,IAAK9H,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASwC,MAAOlO,MAAO,EAAG6K,OAAQ,GACtF8G,GAAI/H,KAAM,IAAKqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASE,MAAO5L,MAAO,KAAO6K,OAAQ,GACxF+G,GAAIhI,KAAM,IAAKqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASE,MAAO5L,MAAO,KAAO6K,OAAQ,GACxFgH,OAAQjI,KAAM,QAASqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASkB,KAAM5M,MAAO,KAAO6K,OAAQ,GAC/FiH,MAAOlI,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,aAAc6K,OAAQ,GACpGkH,MAAOnI,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,cAAgB6K,OAAQ,GACtGmH,MAAOpI,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,cAAgB6K,OAAQ,GACtGoH,UAAWrI,KAAM,WAAYqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,KAAU6K,OAAQ,GACxGqH,YAAatI,KAAM,aAAcqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,MAAU6K,OAAQ,GAE5GsH,MAAOvI,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,KAAM6K,OAAQ,GAC5FuH,KAAMxI,KAAM,MAAOqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,KAAM6K,OAAQ,GAG1FwH,OAAQzI,KAAM,QAASqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAkB6K,OAAQ,GAC1GyH,WAAY1I,KAAM,YAAaqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,aAAiB6K,OAAQ,GACjH0H,YAAa3I,KAAM,aAAcqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAe6K,OAAQ,GACjH2H,MAAO5I,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GACpG4H,IAAK7I,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,KAAM6K,OAAQ,GACxF6H,KAAM9I,KAAM,MAAOqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GAClG8H,MAAO/I,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GACpG+H,OAAQhJ,KAAM,QAASqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GACtGgI,QAASjJ,KAAM,SAAUqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,WAAa6K,OAAQ,GACvGiI,YAAalJ,KAAM,aAAcqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,SAAW6K,OAAQ,GAC7GkI,WAAYnJ,KAAM,YAAaqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,SAAW6K,OAAQ,GAC3GmI,UAAWpJ,KAAM,WAAYqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,QAAW6K,OAAQ,GAGzGoI,MAAOrJ,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,aAAiB6K,OAAQ,GACvGqI,MAAOtJ,KAAM,OAAQqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAe6K,OAAQ,GACrGsI,IAAKvJ,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GAChGuI,IAAKxJ,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GAChGwI,IAAKzJ,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GAChGyI,IAAK1J,KAAM,KAAMqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,YAAc6K,OAAQ,GAChG0I,KAAM3J,KAAM,MAAOqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,WAAa6K,OAAQ,GACjG2I,KAAM5J,KAAM,MAAOqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,SAAW6K,OAAQ,GAC/F4I,KAAM7J,KAAM,MAAOqB,KAAMhG,EAAW6K,OAAQnF,SAAUe,EAASC,KAAM3L,MAAO,SAAW6K,OAAQ,GAI/F6I,GAAI9J,KAAM,IAAKqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASE,MAAO5L,MAAO,KAAO6K,OAAQ,GACtF8I,MAAO/J,KAAM,OAAQqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASkB,KAAM5M,MAAO,KAAO6K,OAAQ,GAE3F+I,KAAMhK,KAAM,MAAOqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASE,MAAO5L,MAAO,UAAW6K,OAAQ,GAC9FgJ,OAAQjK,KAAM,QAASqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASE,MAAO5L,MAAO,IAAM6K,OAAQ,GAE7FiJ,OAAQlK,KAAM,QAASqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,YAAa6K,OAAQ,GACnGkJ,MAAOnK,KAAM,OAAQqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,kBAAoB6K,OAAQ,GACxGmJ,OAAQpK,KAAM,QAASqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,cAAiB6K,OAAQ,GACvGoJ,WAAYrK,KAAM,YAAaqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,UAAc6K,OAAQ,GAC5GqJ,eAAgBtK,KAAM,gBAAiBqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,UAAW6K,OAAQ,GACjHsJ,OAAQvK,KAAM,QAASqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,KAAQ6K,OAAQ,GAE9FuJ,IAAKxK,KAAM,KAAMqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,YAAa6K,OAAQ,GAC7FwJ,IAAKzK,KAAM,KAAMqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,kBAAoB6K,OAAQ,GACpGyJ,IAAK1K,KAAM,KAAMqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,cAAiB6K,OAAQ,GACjG0J,KAAM3K,KAAM,MAAOqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,UAAc6K,OAAQ,GAChG2J,KAAM5K,KAAM,MAAOqB,KAAMhG,EAAWqK,KAAM3E,SAAUe,EAASC,KAAM3L,MAAO,UAAW6K,OAAQ,GAG7F4J,GAAI7K,KAAM,IAAKqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASE,MAAO5L,MAAO,EAAG6K,OAAQ,GAClFlM,KAAMiL,KAAM,MAAOqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASC,KAAM3L,MAAO,GAAI6K,OAAQ,GACtFiB,GAAIlC,KAAM,IAAKqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASC,KAAM3L,MAAO,KAAM6K,OAAQ,GACpF/F,QAAS8E,KAAM,SAAUqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASkB,KAAM5M,MAAO,EAAG6K,OAAQ,GAC3F6J,KAAM9K,KAAM,MAAOqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASkB,KAAM5M,MAAO,EAAG6K,OAAQ,GACrF8J,QAAS/K,KAAM,SAAUqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASC,KAAM3L,MAAO,GAAI6K,OAAQ,GAC5F+J,MAAOhL,KAAM,OAAQqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASC,KAAM3L,MAAO,KAAM6K,OAAQ,GAC1FgK,KAAMjL,KAAM,MAAOqB,KAAMhG,EAAWsK,KAAM5E,SAAUe,EAASC,KAAM3L,MAAO,MAAO6K,OAAQ,GAGzFiK,KAAMlL,KAAM,MAAOqB,KAAMhG,EAAWC,MAAOyF,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GAEtFkK,KAAMnL,KAAM,MAAOqB,KAAMhG,EAAWC,MAAOyF,SAAUe,EAASC,KAAM3L,MAAO,oBAAqC6K,OAAQ,GAExHmK,MAAOpL,KAAM,OAAQqB,KAAMhG,EAAWC,MAAOyF,SAAUe,EAASC,KAAM3L,MAAO,oBAAqC6K,OAAQ,GAE1HoK,OAAQrL,KAAM,QAASqB,KAAMhG,EAAWC,MAAOyF,SAAUe,EAASC,KAAM3L,MAAO,kBAAmC6K,OAAQ,GAG1HqK,GAAItL,KAAM,IAAKqB,KAAMhG,EAAWuK,QAAS7E,SAAUe,EAASE,MAAO5L,MAAO,EAAG6K,OAAQ,GACrFsK,QAASvL,KAAM,SAAUqB,KAAMhG,EAAWuK,QAAS7E,SAAUe,EAASkB,KAAM5M,MAAO,EAAG6K,OAAQ,GAM9FuK,GAAIxL,KAAM,IAAKqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GACxFwK,MAAOzL,KAAM,OAAQqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,QAC9FyK,MAAO1L,KAAM,OAAQqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAE,IAAK6K,OAAQ,QAClG0K,MAAO3L,KAAM,OAAQqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAE,IAAK6K,OAAQ,GAClG2K,QAAS5L,KAAM,SAAUqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GAClG4K,SAAU7L,KAAM,UAAWqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,QACpG6K,YAAa9L,KAAM,aAAcqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAE,IAAK6K,OAAQ,QAC9G8K,SAAU/L,KAAM,UAAWqB,KAAMhG,EAAWwK,YAAa9E,SAAUe,EAASC,KAAM3L,MAAO,EAAE,IAAK6K,OAAQ,GAGxG+K,KAAMhM,KAAM,MAAOqB,KAAMhG,EAAW0K,oBAAqBhF,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GACpGgL,MAAOjM,KAAM,OAAQqB,KAAMhG,EAAW0K,oBAAqBhF,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GAGtGiL,IAAKlM,KAAM,KAAMqB,KAAMhG,EAAWyK,mBAAoB/E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GACjGkL,SAAUnM,KAAM,UAAWqB,KAAMhG,EAAWyK,mBAAoB/E,SAAUe,EAASC,KAAM3L,MAAO,EAAG6K,OAAQ,GAM3GmL,GAAIpM,KAAM,IAAKqB,KAAMhG,EAAW2K,MAAOjF,SAAUe,EAASE,MAAO5L,MAAO,EAAG6K,OAAQ,GACnFoL,QAASrM,KAAM,SAAUqB,KAAMhG,EAAW2K,MAAOjF,SAAUe,EAASkB,KAAM5M,MAAO,EAAG6K,OAAQ,GAC5FqL,KAAMtM,KAAM,MAAOqB,KAAMhG,EAAW2K,MAAOjF,SAAUe,EAASC,KAAM3L,MAAO,gBAAiB6K,OAAQ,GACpGsL,YAAavM,KAAM,aAAcqB,KAAMhG,EAAW2K,MAAOjF,SAAUe,EAASC,KAAM3L,MAAO,gBAAiB6K,OAAQ,GAGlHlK,GAAIiJ,KAAM,IAAKqB,KAAMhG,EAAW8K,IAAKpF,SAAUe,EAASyC,aAAcnO,MAAO,EAAG6K,OAAQ,GACxFuL,MAAOxM,KAAM,OAAQqB,KAAMhG,EAAW8K,IAAKpF,SAAUe,EAASkD,YAAa5O,MAAO,EAAG6K,OAAQ,GAC7FwL,GAAIzM,KAAM,IAAKqB,KAAMhG,EAAW8K,IAAKpF,SAAUe,EAASyC,aAAcnO,MAAO,EAAG6K,OAAQ,GACxFyL,OAAQ1M,KAAM,QAASqB,KAAMhG,EAAW8K,IAAKpF,SAAUe,EAASkD,YAAa5O,MAAO,EAAG6K,OAAQ,IAI7F0L,GACFC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WAEXC,OAAQ,QACRC,UAAW,WACXC,YAAa,aACbC,OAAQ,QACRC,WAAY,YACZC,YAAa,aACbC,MAAO,OACPC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,YAAa,aACbC,WAAY,YACZC,UAAW,WACXC,KAAM,MAENC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QAERC,QAAS,SACTC,QAAS,SACTC,MAAO,OACPC,KAAM,MAENC,QAAS,MACTC,QAAS,MACTC,UAAW,OACXC,OAAQ,QAERC,QAAS,SACTC,MAAO,OAGT;IAAK,GAAItP,KAAQ2M,GAEf,GAAIA,EAAQ/V,eAAeoJ,GAAO,CAChC,GAAIG,GAAOQ,EAAMgM,EAAQ3M,IACrBuP,EAASre,OAAOF,OAAOmP,EAC3BoP,GAAOvP,KAAOA,EACdW,EAAMX,GAAQuP,EAKlB5O,EAAM6O,GAAK7O,EAAMqH,EACjBrH,EAAM8O,MAAQ9O,EAAMsH,MACpBtH,EAAM+O,OAAS/O,EAAM0M,OACrB1M,EAAMgP,GAAKhP,EAAMgK,IACjBhK,EAAMiP,IAAMjP,EAAMgK,IAGlBjY,EAAKoP,SAAWA,EAChBpP,EAAK2I,WAAaA,EAClB3I,EAAKiO,MAAQA,EAMbzQ,EAAOD,QAAUyC,GAKZ,SAASxC,EAAQD,EAASM,GAE/B,YAiBA,SAASoC,GAAMkd,GACb,KAAMxf,eAAgBsC,IACpB,KAAM,IAAI+G,aAAY,mDAGxB,KAAKmW,EAAM,KAAM,IAAI1e,OAAM,yBAE3Bd,MAAKwf,IAAMA,EAtBb,GAAIlV,GAAOpK,EAAoB,KAC3BoB,EAASgJ,EAAKhJ,OACdmJ,EAASH,EAAKG,MA4BlBnI,GAAKmd,OAAS,SAAU1Z,GACtB,MAAQA,aAAiBzD,IAS3BA,EAAK8I,UAAUsU,OAAS,SAAU3e,GAChC,GAAIye,GAAMxf,KAAKwf,QACXG,EAAO,IAcX,IAZIH,EAAI7P,OACNgQ,GAAQ,SAAWH,EAAI7P,KAAO,QAE5B6P,EAAII,WACND,GAAQ,aAAeH,EAAII,SAAW,QAEpCJ,EAAIK,cACNF,GAAQ,qBAAuBH,EAAIK,YAAc,QAE/CL,EAAIM,SACNH,GAAQ,gBAAkBH,EAAIM,OAAOnS,KAAK,UAAY,QAEpD6R,EAAIO,SAAU,CAChB,GAAIC,GAASjf,GAAQA,EAAKif,QAC1BL,IAAQ,aACR,KAAK,GAAI9Y,GAAI,EAAGA,EAAI2Y,EAAIO,SAAShZ,OAAQF,IAAK,CAC5C,GAAIoZ,GAAOT,EAAIO,SAASlZ,EAGxB,IAFA8Y,GAAQ,OAASM,EAAO,KAEpBD,EAAQ,CACV,GAAIpQ,EACJ,KACEA,EAAMoQ,EAAOE,KAAKD,GAEpB,MAAO/Y,GACL0I,EAAM1I,EAEItB,SAARgK,GAAuBA,YAAetN,KACxCqd,GAAQ,WAAalV,EAAO3C,OAAO8H,GAAMzO,UAAW,KAAO,OAIjEwe,GAAQ,KAMV,MAJIH,GAAIW,UACNR,GAAQ,aAAeH,EAAIW,QAAQxS,KAAK,MAAQ,MAG3CgS,GAQTrd,EAAK8I,UAAUO,SAAW,WACxB,MAAO3L,MAAK0f,UAMdpd,EAAK8I,UAAUQ,OAAS,WACtB,GAAIe,GAAMrL,EAAOM,MAAM5B,KAAKwf,IAE5B,OADA7S,GAAIhH,OAAS,OACNgH,GAQTrK,EAAKuJ,SAAW,SAAUtI,GACxB,GAAIic,KACJ,KAAK,GAAI7Y,KAAQpD,GACF,WAAToD,IACF6Y,EAAI7Y,GAAQpD,EAAKoD,GAGrB,OAAO,IAAIrE,GAAKkd,IAMlBld,EAAK8I,UAAUnF,QAAU3D,EAAK8I,UAAUO,SAGxC9L,EAAOD,QAAU0C,GAKZ,SAASzC,GAEd,YAOA,SAAS0C,GAAU6d,GACjB,KAAMpgB,eAAgBuC,IACpB,KAAM,IAAI8G,aAAY,mDAGxBrJ,MAAKogB,QAAUA,MAOjB7d,EAAU6I,UAAUnF,QAAU,WAC5B,MAAOjG,MAAKogB,SAOd7d,EAAU6I,UAAUO,SAAW,WAC7B,MAAO,IAAM3L,KAAKogB,QAAQzS,KAAK,MAAQ,KAQzCpL,EAAU6I,UAAUQ,OAAS,WAC3B,OACEjG,OAAQ,YACRya,QAASpgB,KAAKogB,UAUlB7d,EAAUsJ,SAAW,SAAUtI,GAC7B,MAAO,IAAIhB,GAAUgB,EAAK6c,UAG5BvgB,EAAOD,QAAU2C,GAKZ,SAAS1C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAIU,GAASpB,EAAoB,GAC7BmgB,EAAYngB,EAAoB,KAChC+B,EAAU/B,EAAoB,GAC9BuB,EAAYV,EAAKS,KAAKC,SAE1BV,GAAK,SAAc,EACnBA,EAAK,UAAc,EACnBA,EAAK,QAAc,KACnBA,EAAoB,cAAIb,EAAoB,KAAKogB,cAE3B,cAAlB1f,EAAOM,QACTH,EAAe,SAAI,GAAIU,GAAUsG,KACjChH,EAAU,IAAS,GAAIU,GAAU8e,KAEjCjf,EAAO6F,KAAKpG,EAAM,KAAO,WAAa,MAAOsf,GAAUG,GAAG5f,EAAOO,aACjEG,EAAO6F,KAAKpG,EAAM,MAAO,WAAa,MAAOsf,GAAUI,IAAI7f,EAAOO,aAClEG,EAAO6F,KAAKpG,EAAM,IAAO,WAAa,MAAOsf,GAAUnZ,EAAEtG,EAAOO,aAChEG,EAAO6F,KAAKpG,EAAM,MAAO,WAAa,MAAOsf,GAAU3W,IAAI9I,EAAOO,aAGlEG,EAAO6F,KAAKpG,EAAM,IAAW,WAAa,MAAOA,GAAKmG,IACtD5F,EAAO6F,KAAKpG,EAAM,MAAW,WAAa,MAAO,IAAIU,GAAU,GAAGif,OAClEpf,EAAO6F,KAAKpG,EAAM,OAAW,WAAa,MAAO,IAAIU,GAAU,IAAIif,OACnEpf,EAAO6F,KAAKpG,EAAM,QAAW,WAAa,MAAO,IAAIU,GAAU,GAAGkf,IAAI,GAAIlf,GAAU,GAAGif,QACvFpf,EAAO6F,KAAKpG,EAAM,SAAW,WAAa,MAAO,IAAIU,GAAU,GAAGkf,IAAI,GAAIlf,GAAU,IAAIif,QACxFpf,EAAO6F,KAAKpG,EAAM,KAAW,WAAa,MAAOA,GAAKyf,KACtDlf,EAAO6F,KAAKpG,EAAM,UAAW,WAAa,MAAO,IAAIU,GAAU,OAAOuC,SACtE1C,EAAO6F,KAAKpG,EAAM,QAAW,WAAa,MAAO,IAAIU,GAAU,GAAGuC,WAGlEjD,EAAe,SAAIgH,IACnBhH,EAAU,IAASwf,IAEnBxf,EAAKyf,GAAM7Y,KAAKiZ,GAChB7f,EAAK0f,IAAgB,EAAV9Y,KAAKiZ,GAChB7f,EAAKmG,EAAMS,KAAKwK,EAChBpR,EAAK2I,IAAM,kBAGX3I,EAAKoR,EAAcpR,EAAKmG,EACxBnG,EAAK8f,IAAclZ,KAAKkZ,IACxB9f,EAAKwQ,KAAc5J,KAAK4J,KACxBxQ,EAAK+f,MAAcnZ,KAAKmZ,MACxB/f,EAAKggB,OAAcpZ,KAAKoZ,OACxBhgB,EAAK6f,GAAc7f,EAAKyf,GACxBzf,EAAKigB,QAAcrZ,KAAKqZ,QACxBjgB,EAAKkgB,MAActZ,KAAKsZ,OAI1BlgB,EAAK8F,EAAI,GAAI5E,GAAQ,EAAG,GAGxBlB,EAAKmgB,QAAUhhB,EAAoB,OAMhC,SAASL,EAAQD,EAASM,GAE/B,GAAIuB,GAAYvB,EAAoB,IAUpCuB,GAAU2J,UAAUQ,OAAS,WAC3B,OACEjG,OAAQ,YACRI,MAAO/F,KAAK2L,aAUhBlK,EAAUoK,SAAW,SAAUtI,GAC7B,MAAO,IAAI9B,GAAU8B,EAAKwC,QAG5BlG,EAAOD,QAAU6B,GAKZ,SAAS5B,EAAQD,EAASM,GAE/B,YAEAN,GAAQuhB,eAAiBjhB,EAAoB,KAC7CN,EAAQqO,eAAiB/N,EAAoB,KAC7CN,EAAQwhB,WAAalhB,EAAoB,KACzCN,EAAQyhB,qBAAuBnhB,EAAoB,MAO9C,SAASL,EAAQD,EAASM,GAG/B,YA6LA,SAASohB,GAAQC,EAAKhU,EAAKb,GACzB,GAAI7F,GAAG2a,EAAKC,EAAKC,CAElB,IAAQ,GAALnU,EAAO,CACT,GAAKzH,EAAQyb,EAAI,IAMZ,CAGJ,IAFAG,EAAOC,EAAQJ,GACfC,KACI3a,EAAE,EAAGA,EAAE6a,EAAK3a,OAAQF,IACvB2a,EAAI3a,GAAKya,EAAQI,EAAK7a,GAAI0G,EAAI,EAAGb,EAElC,OAAO8U,GAVP,IADAC,EAAMF,EAAI,GACN1a,EAAE,EAAGA,EAAE0a,EAAIxa,OAAQF,IACtB4a,EAAM/U,EAAS+U,EAAKF,EAAI1a,GAEzB,OAAO4a,GAWR,IADAD,KACI3a,EAAE,EAAGA,EAAE0a,EAAIxa,OAAQF,IACtB2a,EAAI3a,GAAKya,EAAQC,EAAI1a,GAAI0G,EAAI,EAAGb,EAEjC,OAAO8U,GAUT,QAASG,GAAQJ,GACf,GAEI1a,GAAG+a,EAFHC,EAAIN,EAAIxa,OACR+a,EAAIP,EAAI,GAAGxa,OAEXya,IACJ,KAAKI,EAAE,EAAKE,EAAFF,EAAKA,IAAK,CAClB,GAAIG,KACJ,KAAKlb,EAAE,EAAKgb,EAAFhb,EAAKA,IACbkb,EAAI/U,KAAKuU,EAAI1a,GAAG+a,GAElBJ,GAAIxU,KAAK+U,GAEX,MAAOP,GAxOT,CAAA,GAAIlX,GAAOpK,EAAoB,KAE3BkhB,EAAalhB,EAAoB,KACjC+N,EAAiB/N,EAAoB,KAErCkC,EAASlC,EAAoB,GAE7B8C,EAAQsH,EAAKtH,MACb8C,EAAUwE,EAAKtH,MAAM8C,OACVwE,GAAKG,OAAOD,SAY3B5K,EAAQoiB,YAAc,SAAS/V,GAC7B,GAAmB,GAAfA,EAAKlF,OAEP,QAEG,IAAmB,GAAfkF,EAAKlF,OAAa,CAGzB,GAAI/D,GAAQiJ,EAAK,EAOjB,OANIjJ,aAAiBZ,KACnBY,EAAQA,EAAMiD,WAEXH,EAAQ9C,KACXA,GAASA,IAEJA,EAIP,MAAOsH,GAAKtH,MAAMgf,YAAY/V,IAUlCrM,EAAQqiB,aAAe,SAASvf,GAC9B,MAAQoD,GAAQpD,IAAOA,YAAaN,IAatCxC,EAAQsiB,QAAU,QAASA,GAAQlf,EAAO0J,GACxC,MAAI1J,IAA+B,kBAAdA,GAAMkC,IAClBlC,EAAMkC,IAAI,SAAUxC,GACzB,MAAOwf,GAAQxf,EAAGgK,KAIbA,EAAS1J,IAepBpD,EAAQuiB,SAAW,QAASA,GAASC,EAAQC,EAAQ3V,GACnD,GAAIkD,GAAK9I,EAAKD,CAEd,IAAIf,EAAQsc,GACV,GAAItc,EAAQuc,GAAS,CAEnB,GAAID,EAAOrb,QAAUsb,EAAOtb,OAC1B,KAAM,IAAIkH,GAAemU,EAAOrb,OAAQsb,EAAOtb,OAKjD,KAFA6I,KACA9I,EAAMsb,EAAOrb,OACRF,EAAI,EAAOC,EAAJD,EAASA,IACnB+I,EAAI/I,GAAKsb,EAASC,EAAOvb,GAAIwb,EAAOxb,GAAI6F,OAGvC,CAAA,GAAI2V,YAAkBjgB,GAGzB,MADAwN,GAAMuS,EAASC,EAAQC,EAAOpc,UAAWyG,GAClC,GAAItK,GAAOwN,EAMlB,KAFAA,KACA9I,EAAMsb,EAAOrb,OACRF,EAAI,EAAOC,EAAJD,EAASA,IACnB+I,EAAI/I,GAAKsb,EAASC,EAAOvb,GAAIwb,EAAQ3V,OAItC,CAAA,GAAI0V,YAAkBhgB,GACzB,MAAIigB,aAAkBjgB,IAEpBwN,EAAMuS,EAASC,EAAOnc,UAAWoc,EAAOpc,UAAWyG,GAC5C,GAAItK,GAAOwN,KAKlBA,EAAMuS,EAASC,EAAOnc,UAAWoc,EAAQ3V,GAClC,GAAItK,GAAOwN,GAIpB,IAAI9J,EAAQuc,GAIV,IAFAzS,KACA9I,EAAMub,EAAOtb,OACRF,EAAI,EAAOC,EAAJD,EAASA,IACnB+I,EAAI/I,GAAKsb,EAASC,EAAQC,EAAOxb,GAAI6F,OAGpC,CAAA,GAAI2V,YAAkBjgB,GAGzB,MADAwN,GAAMuS,EAASC,EAAQC,EAAOpc,UAAWyG,GAClC,GAAItK,GAAOwN,EAIlBA,GAAMlD,EAAS0V,EAAQC,IAI3B,MAAOzS,IAYThQ,EAAQ0iB,OAAS,SAASf,EAAKhU,EAAKb,GAClC,GAAIF,GAAO1G,EAAQyb,GAAOve,EAAMwJ,KAAK+U,GAAOA,EAAI/U,MAChD,IAAU,EAANe,EAEF,KAAM,IAAI6T,GAAW7T,EAEvB,IAAIA,GAAOf,EAAKzF,OAEd,KAAM,IAAIqa,GAAW7T,EAAKf,EAAKzF,OAGlC,OAAIwa,aAAenf,GACX,GAAIA,GAAOkf,EAAQC,EAAItb,UAAWsH,EAAKb,IAEvC4U,EAAQC,EAAKhU,EAAKb,IAmE3B9M,EAAQ2iB,YAAc,QAASA,GAAavf,EAAO0J,GAC7C1J,YAAiBZ,KACnBY,EAAQA,EAAMiD,UAGhB,KAAK,GAAIY,GAAI,EAAGkG,EAAK/J,EAAM+D,OAAYgG,EAAJlG,EAAQA,IAAK,CAC9C,GAAId,GAAQ/C,EAAM6D,EAEdf,GAAQC,GACVwc,EAAYxc,EAAO2G,GAGnBA,EAAS3G,MAQV,SAASlG,EAAQD,EAASM,GAE/B,YAEAN,GAAQ4iB,UAAYtiB,EAAoB,KACxCN,EAAQ6iB,eAAiBviB,EAAoB,KAC7CN,EAAQ8iB,UAAYxiB,EAAoB,KACxCN,EAAQ+iB,gBAAkBziB,EAAoB,KAC9CN,EAAQgjB,aAAe1iB,EAAoB,KAC3CN,EAAQijB,UAAY3iB,EAAoB,KACxCN,EAAQkjB,uBAAyB5iB,EAAoB,KACrDN,EAAQmjB,aAAe7iB,EAAoB,KAC3CN,EAAQojB,KAAO9iB,EAAoB,KACnCN,EAAQqjB,aAAe/iB,EAAoB,KAC3CN,EAAQsjB,UAAYhjB,EAAoB,KACxCN,EAAQujB,WAAajjB,EAAoB,KACzCN,EAAQwjB,WAAaljB,EAAoB,MAKpC,SAASL,EAAQD,EAASM,GAE/B,YA8DA,SAASkD,GAAO6c,EAAM5e,GACpB,GAAwB,GAApBuH,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIoa,GAAe,QAASvY,UAAU7B,OAAQ,EAAG,EAMzD,IAFAsc,GAAehiB,GAAWA,EAAQiiB,MAASjiB,EAAQiiB,SAE/C9Y,EAASyV,GAGX,MADA/c,IAAa+c,EACNsD,GAEJ,IAAIzd,EAAQma,IAASA,YAAgB7d,GAExC,MAAOa,GAAWif,QAAQjC,EAAM,SAAU5Q,GACxC,IAAK7E,EAAS6E,GAAO,KAAM,IAAItM,WAAU,kBAGzC,OADAG,IAAamM,EACNkU,KAKT,MAAM,IAAIxgB,WAAU,6BAgFxB,QAAS4H,KACP1F,GAAQ,EACRxE,GAAIyC,GAAW8G,OAAO,GACtBwZ,GAAgB,EAChBC,GAAoB,KAStB,QAAS7Z,KACP3E,KACAxE,GAAIyC,GAAW8G,OAAO/E,IAQxB,QAASye,KACP,MAAOxgB,IAAW8G,OAAO/E,GAAQ,GAQnC,QAAS0e,KACP,MAAOzgB,IAAW8G,OAAO/E,GAAQ,GAQnC,QAAS2e,KAMP,IALAC,GAAaC,GAAUC,KACvBC,GAAQ,GAII,KAALvjB,IAAiB,KAALA,IAAmB,MAALA,IAAa+iB,IAE5C5Z,GAIF,IAAS,KAALnJ,GACF,KAAY,MAALA,IAAkB,IAALA,IAClBmJ,GAKJ,IAAS,IAALnJ,GAGF,YADAojB,GAAaC,GAAUG,UAKzB,IAAS,MAALxjB,KAAc+iB,GAIhB,MAHAK,IAAaC,GAAUG,UACvBD,GAAQvjB,OACRmJ,IAKF,IAAIsa,GAAKzjB,GAAIijB,IACTS,EAAKD,EAAKP,GACd,IAAiB,GAAbQ,EAAGpd,QAAeqd,GAAWD,GAM/B,MALAN,IAAaC,GAAUG,UACvBD,GAAQG,EACRva,IACAA,QACAA,IAKF,IAAiB,GAAbsa,EAAGnd,QAAeqd,GAAWF,GAK/B,MAJAL,IAAaC,GAAUG,UACvBD,GAAQE,EACRta,QACAA,IAKF,IAAIwa,GAAW3jB,IAIb,MAHAojB,IAAaC,GAAUG,UACvBD,GAAQvjB,OACRmJ,IAKF,KAAIC,EAAWpJ,IAAf,CAuDA,GAAI4jB,EAAQ5jB,IAAI,CACd,KAAO4jB,EAAQ5jB,KAAMqJ,EAAQrJ,KAC3BujB,IAASvjB,GACTmJ,GAUF,aANEia,GADES,GAAiBN,IACNF,GAAUG,UAGVH,GAAUS,QAQ3B,IADAV,GAAaC,GAAUU,QACX,IAAL/jB,IACLujB,IAASvjB,GACTmJ,GAEF,MAAM6a,GAAkB,yBAA2BT,GAAQ,KAzEzD,GAHAH,GAAaC,GAAUY,OAGd,KAALjkB,GACFujB,IAASvjB,GACTmJ,IAEKE,EAAQrJ,MAEXojB,GAAaC,GAAUU,aAGtB,CACH,KAAO1a,EAAQrJ,KACbujB,IAASvjB,GACTmJ,GAEO,MAALnJ,KACFujB,IAASvjB,GACTmJ,KAGJ,KAAOE,EAAQrJ,KACbujB,IAASvjB,GACTmJ,GAKF,IADAsa,EAAKR,KACK,KAALjjB,IAAiB,KAALA,MAAcqJ,EAAQoa,IAAa,KAANA,GAAmB,KAANA,GAezD,IAdAF,IAASvjB,GACTmJ,KAES,KAALnJ,IAAiB,KAALA,MACdujB,IAASvjB,GACTmJ,KAIGE,EAAQrJ,MAEXojB,GAAaC,GAAUU,SAGlB1a,EAAQrJ,KACbujB,IAASvjB,GACTmJ,IAoCR,QAAS+a,KACP,EACEf,WAEc,MAATI,IAOT,QAASY,KACPpB,KAOF,QAASqB,KACPrB,KAUF,QAASa,GAAS5jB,GAChB,MAASA,IAAK,KAAY,KAALA,GAChBA,GAAK,KAAY,KAALA,GACR,KAALA,EASN,QAASoJ,GAAYpJ,GACnB,MAASA,IAAK,KAAY,KAALA,GACZ,KAALA,EASN,QAASqJ,GAASrJ,GAChB,MAASA,IAAK,KAAY,KAALA,EAQvB,QAAS8iB,KAEP5Y,IAEAiZ,GAEA,IAAIzgB,GAAO2hB,GAIX,IAAa,IAATd,GACF,KAAIH,KAAcC,GAAUG,UAIpBc,EAAY,uBAAyBf,IAGrCS,EAAkB,oBAAsBT,GAAQ,IAI1D,OAAO7gB,GAUT,QAAS2hB,KACP,GAAI3hB,GAEA6hB,EADAC,IAGJ,IAAa,IAATjB,GAEF,MAAO,IAAIpB,IAAa,YAAa,YAQvC,KALa,MAAToB,IAA0B,KAATA,KACnB7gB,EAAO+hB,KAIO,MAATlB,IAA0B,KAATA,IACD,GAAjBiB,EAAOle,QAAe5D,IACxB6hB,EAAoB,KAAThB,GACXiB,EAAOjY,MACL7J,KAAMA,EACN6hB,QAASA,KAIbpB,IACa,MAATI,IAA0B,KAATA,IAAyB,IAATA,KACnC7gB,EAAO+hB,IAEPF,EAAoB,KAAThB,GACXiB,EAAOjY,MACL7J,KAAMA,EACN6hB,QAASA,IAKf,OAAIC,GAAOle,OAAS,EACX,GAAI2b,IAAUuC,GAGd9hB,EASX,QAAS+hB,KAEP,GAAIrB,IAAcC,GAAUS,QAAmB,YAATP,GACpC,KAAMS,GAAkB,8FAI1B,OAAOU,KAST,QAASA,KACP,GAAIxV,GAAM1D,EAAMgU,EAAMmF,EAElBjiB,EAAOkiB,GAEX,IAAa,KAATrB,GAAc,CAChB,GAAI7gB,YAAgBggB,IAKlB,MAHAxT,GAAOxM,EAAKwM,KACZgV,IACA1E,EAAOkF,IACA,GAAI1C,IAAe9S,EAAMsQ,EAE7B,IAAI9c,YAAgB0f,IAIvB,MAFA8B,KACA1E,EAAOkF,IACA,GAAI/B,IAAWjgB,EAAM8c,EAEzB,IAAI9c,YAAgB4f,MAEvBqC,GAAQ,EACRnZ,KAEA0D,EAAOxM,EAAKwM,KACZxM,EAAK8I,KAAKjH,QAAQ,SAAUsE,EAAKrE,GAC3BqE,YAAe6Z,IACjBlX,EAAKhH,GAASqE,EAAIqG,KAGlByV,GAAQ,IAIRA,GAGF,MAFAT,KACA1E,EAAOkF,IACA,GAAIrC,IAAuBnT,EAAM1D,EAAMgU,EAIlD,MAAMwE,GAAkB,mDAG1B,MAAOthB,GAaT,QAASkiB,KAGP,IAFA,GAAIliB,GAAOmiB,IAEK,KAATtB,IAAc,CAGnB,GAAIuB,GAAO9B,EACXA,IAAoBD,GACpBmB,GAEA,IAAIa,GAAYriB,EACZsiB,EAAWH,GAEf,IAAa,KAATtB,GAAc,KAAMS,GAAkB,gDAE1ChB,IAAoB,KACpBkB,GAEA,IAAIe,GAAYL,GAEhBliB,GAAO,GAAIwf,IAAgB6C,EAAWC,EAAUC,GAGhDjC,GAAoB8B,EAGtB,MAAOpiB,GAQT,QAASmiB,KAGP,IAFA,GAAIniB,GAAOwiB,IAEK,MAAT3B,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,KAAM,MAAO9f,EAAMwiB,KAG7C,OAAOxiB,GAQT,QAASwiB,KAGP,IAFA,GAAIxiB,GAAOyiB,IAEK,OAAT5B,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,MAAO,OAAQ9f,EAAMyiB,KAG/C,OAAOziB,GAQT,QAASyiB,KAGP,IAFA,GAAIziB,GAAO0iB,IAEK,OAAT7B,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,MAAO,OAAQ9f,EAAM0iB,KAG/C,OAAO1iB,GAQT,QAAS0iB,KAGP,IAFA,GAAI1iB,GAAO2iB,IAEK,KAAT9B,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,IAAK,SAAU9f,EAAM2iB,KAG/C,OAAO3iB,GAQT,QAAS2iB,KAGP,IAFA,GAAI3iB,GAAO4iB,IAEK,MAAT/B,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,KAAM,UAAW9f,EAAM4iB,KAGjD,OAAO5iB,GAQT,QAAS4iB,KAGP,IAFA,GAAI5iB,GAAO6iB,IAEK,KAAThC,IACLW,IACAxhB,EAAO,GAAI8f,IAAa,IAAK,UAAW9f,EAAM6iB,KAGhD,OAAO7iB,GAQT,QAAS6iB,KACP,GAAI7iB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAY/B,KAVA/iB,EAAOgjB,IAEPF,GACEG,KAAM,QACNC,KAAM,UACNC,IAAK,UACLC,IAAK,SACLC,KAAM,YACNC,KAAM,YAEDzC,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfgV,IACAuB,GAAU/iB,EAAMgjB,KAChBhjB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAGpC,OAAO/iB,GAQT,QAASgjB,KACP,GAAIhjB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAU/B,KARA/iB,EAAOujB,IAEPT,GACEU,KAAO,YACPC,KAAO,kBACPC,MAAQ,iBAGH7C,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfgV,IACAuB,GAAU/iB,EAAMujB,KAChBvjB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAGpC,OAAO/iB,GAQT,QAASujB,KACP,GAAIvjB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAS/B,KAPA/iB,EAAO2jB,IAEPb,GACEpjB,GAAO,KACP4T,KAAO,MAGFuN,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfgV,IACAuB,GAAU/iB,EAAM2jB,KAChB3jB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAGpC,OAAO/iB,GAQT,QAAS2jB,KACP,GAAI3jB,GAAM+iB,IAWV,IAPE/iB,EAFW,KAAT6gB,GAEK,GAAIpB,IAAa,IAAK,UAItBmE,IAGI,KAAT/C,IAAiBP,KAAsBD,GAAgB,CAKzD,IAHA0C,EAAOlZ,KAAK7J,GAGI,KAAT6gB,IAAgBkC,EAAOnf,OAAS,GACrC4d,IAIEuB,EAAOlZ,KAFI,KAATgX,IAAyB,KAATA,IAAyB,KAATA,IAAyB,IAATA,GAEtC,GAAIb,IAAW,OAIf4D,IAMd5jB,GAFmB,GAAjB+iB,EAAOnf,OAEF,GAAImc,IAAUgD,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAI3C,GAAIhD,IAAUgD,EAAO,GAAIA,EAAO,IAI3C,MAAO/iB,GAQT,QAAS4jB,KACP,GAAI5jB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAQ/B,KANA/iB,EAAO6jB,IAEPf,GACEgB,IAAK,MACLC,IAAK,YAEAlD,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfgV,IACAuB,GAAU/iB,EAAM6jB,KAChB7jB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAGpC,OAAO/iB,GAQT,QAAS6jB,KACP,GAAI7jB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAa/B,IAXA/iB,EAAOgkB,IAEPlB,GACEmB,IAAK,WACLC,KAAM,cACNC,IAAK,SACLC,KAAM,YACNC,IAAK,MACLC,IAAO,OAGLzD,KAASiC,GACX,KAAOjC,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfgV,IACAuB,GAAU/iB,EAAMgkB,KAChBhkB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAiBtC,QAZKrC,IAAcC,GAAUS,QACf,MAATP,IAAkB7gB,YAAgByf,KAClCiB,IAAcC,GAAUY,UAAYvhB,YAAgByf,MAC3C,KAAToB,IAAyB,KAATA,MAMnB7gB,EAAO,GAAI8f,IAAa,IAAK,YAAa9f,EAAM6jB,OAG3C7jB,EAQT,QAASgkB,KACP,GAAIxX,GAAMuW,EACN9e,GACF8f,IAAK,aACLD,IAAK,YACLS,IAAK,SACLC,IAAO,OACP3D,GAEF,OAAI5c,IACFuI,EAAOqU,GAEPW,IACAuB,GAAUiB,KAEH,GAAIlE,IAAatT,EAAMvI,EAAI8e,IAG7B0B,IAST,QAASA,KACP,GAAIzkB,GAAMwM,EAAMvI,EAAI8e,CAapB,OAXA/iB,GAAO0kB,KAEM,KAAT7D,IAAyB,MAATA,MAClBrU,EAAOqU,GACP5c,EAAc,KAARuI,EAAe,MAAQ,SAE7BgV,IACAuB,GAAU/iB,EAAMgkB,KAChBhkB,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,IAG7B/iB,EAQT,QAAS0kB,KACP,GAAI1kB,GAAM8iB,EAAWtW,EAAMvI,EAAI8e,CAS/B,KAPA/iB,EAAO2kB,IAEP7B,GACE8B,IAAK,YACLC,IAAM,aAGDhE,KAASiC,IACdtW,EAAOqU,GACP5c,EAAK6e,EAAUtW,GAEfiU,IACAsC,GAAU/iB,GAEVA,EAAO,GAAI8f,IAAatT,EAAMvI,EAAI8e,EAGpC,OAAO/iB,GA+BT,QAAS2kB,KACP,GAAiBG,GAAb/B,IAEJ,IAAIrC,IAAcC,GAAUS,QAAUlB,GAAYW,IAAQ,CAMxD,GALAiE,EAAU5E,GAAYW,IAEtBJ,IAGa,KAATI,GAAc,CAMhB,GALAkC,KAEAtB,IACAhB,IAEa,KAATI,GAIF,IAHAkC,EAAOlZ,KAAKqY,KAGI,KAATrB,IACLJ,IACAsC,EAAOlZ,KAAKqY,IAIhB,IAAa,KAATrB,GACF,KAAMS,GAAkB,yBAE1BI,KACAjB,IAKF,MAAO,IAAIqE,GAAQ/B,GAGrB,MAAOgC,KAQT,QAASA,KACP,GAAI/kB,GAAMwM,CAEV,OAAIkU,KAAcC,GAAUS,QACvBV,IAAcC,GAAUG,WAAaD,KAASM,KACjD3U,EAAOqU,GAEPJ,IAGAzgB,EAAOglB,EAAexY,GACtBxM,EAAOilB,EAAWjlB,IAIbklB,IAST,QAASF,GAAgBxY,GACvB,GAAIuW,EAEJ,IAAa,KAATlC,GAAc,CAMhB,GALAkC,KAEAtB,IACAhB,IAEa,KAATI,GAIF,IAHAkC,EAAOlZ,KAAKqY,KAGI,KAATrB,IACLJ,IACAsC,EAAOlZ,KAAKqY,IAIhB,IAAa,KAATrB,GACF,KAAMS,GAAkB,yBAK1B,OAHAI,KACAjB,IAEO,GAAIb,IAAapT,EAAMuW,GAGhC,MAAO,IAAI/C,IAAWxT,GAWxB,QAASyY,GAAYjlB,GAGnB,IAFA,GAAI+iB,GAEY,KAATlC,IAAc,CAMnB,GALAkC,KAEAtB,IACAhB,IAEa,KAATI,GAIF,IAHAkC,EAAOlZ,KAAKqY,KAGI,KAATrB,IACLJ,IACAsC,EAAOlZ,KAAKqY,IAIhB,IAAa,KAATrB,GACF,KAAMS,GAAkB,yBAE1BI,KACAjB,IAEAzgB,EAAO,GAAI0f,IAAU1f,EAAM+iB,GAG7B,MAAO/iB,GAST,QAASklB,KACP,GAAIllB,GAAMoF,EAAK+f,CAEf,IAAa,KAATtE,GAAc,CAIhB,IAFAzb,EAAM,GACN+f,EAAQ,GACI,IAAL7nB,KAAiB,KAALA,IAAsB,MAAT6nB,IAC9B/f,GAAO9H,GACP6nB,EAAQ7nB,GACRmJ,GAIF,IADAga,IACa,KAATI,GACF,KAAMS,GAAkB,2BAU1B,OARAb,KAGAzgB,EAAO,GAAIyf,IAAara,EAAK,UAG7BpF,EAAOilB,EAAWjlB,GAKpB,MAAOolB,KAQT,QAASA,KACP,GAAIvlB,GAAOkjB,EAAQsC,EAAMC,CAEzB,IAAa,KAATzE,GAAc,CAKhB,GAHAY,IACAhB,IAEa,KAATI,GAAc,CAEhB,GAAIvW,GAAMib,GAEV,IAAa,KAAT1E,GAAc,CAMhB,IAJAwE,EAAO,EACPtC,GAAUzY,GAGM,KAATuW,IACLJ,IAEAsC,EAAOsC,GAAQE,IACfF,GAGF,IAAa,KAATxE,GACF,KAAMS,GAAkB,2BAE1BI,KACAjB,IAGA6E,EAAOvC,EAAO,GAAG5C,MAAMvc,MACvB,KAAK,GAAI0C,GAAI,EAAO+e,EAAJ/e,EAAUA,IACxB,GAAIyc,EAAOzc,GAAG6Z,MAAMvc,QAAU0hB,EAC5B,KAAM1D,GAAY,+BACRmB,EAAOzc,GAAG6Z,MAAMvc,OAAS,OAAS0hB,EAAO,IAIvDzlB,GAAQ,GAAIwf,IAAU0D,OAEnB,CAEH,GAAa,KAATlC,GACF,KAAMS,GAAkB,2BAE1BI,KACAjB,IAEA5gB,EAAQyK,OAKVoX,KACAjB,IACA5gB,EAAQ,GAAIwf,OAGd,OAAOxf,GAGT,MAAOmH,KAOT,QAASue,KAIP,IAHA,GAAIxC,IAAUf,KACVre,EAAM,EAEM,KAATkd,IACLJ,IAGAsC,EAAOpf,GAAOqe,IACdre,GAGF,OAAO,IAAI0b,IAAU0D,GAQvB,QAAS/b,KACP,GAAIjJ,EAEJ,OAAI2iB,KAAcC,GAAUY,QAE1BxjB,EAAS8iB,GACTJ,IAEO,GAAIhB,IAAa1hB,EAAQ,WAG3BynB,IAQT,QAASA,KACP,GAAIxlB,EAGJ,IAAa,KAAT6gB,GAAc,CAOhB,GALAY,IACAhB,IAEAzgB,EAAOgiB,IAEM,KAATnB,GACF,KAAMS,GAAkB,yBAK1B,OAHAI,KACAjB,IAEOzgB,EAGT,MAAOylB,KAQT,QAASA,KACP,KAEQnE,GAFK,IAATT,GAEsB,+BAEA,kBAoB5B,QAAS6E,KACP,MAAO5jB,IAAQ+e,GAAMjd,OAAS,EAShC,QAAS0d,GAAmBqE,GAC1B,GAAIroB,GAAIooB,IACJ7mB,EAAQ,GAAIqH,aAAYyf,EAAU,UAAYroB,EAAI,IAGtD,OAFAuB,GAAM,QAAUvB,EAETuB,EAST,QAAS+iB,GAAa+D,GACpB,GAAIroB,GAAIooB,IACJ7mB,EAAQ,GAAIlB,OAAMgoB,EAAU,UAAYroB,EAAI,IAGhD,OAFAuB,GAAM,QAAUvB,EAETuB,EA91CT,GAAIsI,GAAOpK,EAAoB,KAE3BihB,EAAiBjhB,EAAoB,KAErCsK,EAAWF,EAAKG,OAAOD,SACvB1E,EAAUD,MAAMC,QAKhB1D,GAJOkI,EAAK7H,MAAMjB,KAGRtB,EAAoB,GACrBA,EAAoB,IAE7B+C,GADO/C,EAAoB,GACdA,EAAoB,KAGjCsiB,GAAYtiB,EAAoB,KAChCuiB,GAAiBviB,EAAoB,KACrCwiB,GAAYxiB,EAAoB,KAChCyiB,GAAkBziB,EAAoB,KACtC0iB,GAAe1iB,EAAoB,KACnC4iB,GAAyB5iB,EAAoB,KAC7C2iB,GAAY3iB,EAAoB,KAChC+iB,GAAe/iB,EAAoB,KACnC6iB,GAAe7iB,EAAoB,KACnCgjB,GAAYhjB,EAAoB,KAChCijB,GAAajjB,EAAoB,KACjCkjB,GAAaljB,EAAoB,KA+DjC4jB,IACFC,KAAO,EACPE,UAAY,EACZS,OAAS,EACTH,OAAS,EACTC,QAAU,GAIRJ,IACF2E,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAM,EACNC,KAAK,EAELpC,KAAK,EACLC,KAAK,EACLE,KAAK,EACLC,MAAM,EACNC,KAAK,EACLC,MAAM,EACNC,KAAK,EACL8B,KAAK,EACLC,MAAM,EACN7B,KAAK,EACLK,KAAK,EACLyB,KAAK,EACLC,KAAK,EACLC,MAAM,EACN1B,KAAM,EACN2B,KAAK,EACLC,KAAK,EACLC,KAAK,EAELzD,MAAM,EACNC,MAAM,EACNC,KAAK,EACLC,KAAK,EACLC,MAAM,EACNC,MAAM,EAENE,MAAM,EACNC,MAAM,EACNC,OAAO,GAILvC,IACFmD,KAAO,EACP5kB,IAAM,EACN4T,MAAM,EACNqT,KAAO,EACPC,KAAO,EACPC,IAAM,EACNrC,KAAO,GAGLtE,MACAngB,GAAa,GACb+B,GAAQ,EACRxE,GAAI,GACJujB,GAAQ,GACRH,GAAaC,GAAUC,KACvBP,GAAgB,EAChBC,GAAoB,IAqsCxB5jB,GAAOD,QAAUwD,GAKZ,SAASvD,EAAQD,EAASM,GAE/B,YAqDA,SAASmD,GAAOtC,GACd,KAAMf,eAAgBqD,IACpB,KAAM,IAAIgG,aACN,mDAGN,MAAMtI,YAAgBF,SACpB,KAAM,IAAIkC,WAAU,oCAGtB/C,MAAKe,KAAOA,EACZf,KAAKiqB,SA9DP,GAAIC,GAAShqB,EAAoB,GAyEjCmD,GAAO+H,UAAUhI,MAAQ,WACvB,KAAM,IAAItC,OAAM,wDAUlBuC,EAAO+H,UAAU+e,QAAU,WACzB,KAAM,IAAIrpB,OAAM,4DASlBuC,EAAO+H,UAAU8U,KAAO,SAAUD,GAEhC,MAAOiK,GAAOjK,GACTkK,QAAQnqB,KAAKe,MACbmf,KAAKlgB,KAAKiqB,QASjB5mB,EAAO+H,UAAU7D,IAAM,SAAUoI,GAE/B,MAAO3P,MAAKiqB,MAAMta,IAQpBtM,EAAO+H,UAAU5D,IAAM,SAAUmI,EAAM5J,GAErC,MAAO/F,MAAKiqB,MAAMta,GAAQ5J,GAO5B1C,EAAO+H,UAAUgf,OAAS,SAAUza,SAE3B3P,MAAKiqB,MAAMta,IAMpBtM,EAAO+H,UAAUif,MAAQ,WACvB,IAAK,GAAI1a,KAAQ3P,MAAKiqB,MAChBjqB,KAAKiqB,MAAM1jB,eAAeoJ,UACrB3P,MAAKiqB,MAAMta,IAKxB9P,EAAOD,QAAUyD,GAKZ,SAASxD,EAAQD,EAASM,GAG/BN,EAAQsH,EAAIhH,EAAoB,KAChCN,EAAQuS,EAAIjS,EAAoB,KAChCN,EAAQ,SAAWM,EAAoB,KACvCN,EAAQiH,EAAI3G,EAAoB,KAChCN,EAAkB,SAAIM,EAAoB,KAC1CN,EAAQihB,IAAM3gB,EAAoB,KAClCN,EAAQ2R,KAAOrR,EAAoB,KACnCN,EAAQkhB,MAAQ5gB,EAAoB,KACpCN,EAAQmhB,OAAS7gB,EAAoB,KACrCN,EAAQ2gB,IAAMrgB,EAAoB,KAClCN,EAAQ,QAAUM,EAAoB,KACtCN,EAAQ4gB,GAAKtgB,EAAoB,KACjCN,EAAQghB,GAAK1gB,EAAoB,KACjCN,EAAQ8J,IAAMxJ,EAAoB,KAClCN,EAAQohB,QAAU9gB,EAAoB,KACtCN,EAAQqhB,MAAQ/gB,EAAoB,KACpCN,EAAQ6gB,IAAMvgB,EAAoB,KAClCN,EAAQ,QAAUM,EAAoB,KACtCN,EAAQshB,QAAUhhB,EAAoB,KAGtCN,EAAQ6D,IAAMvD,EAAoB,KAClCN,EAAQ8D,IAAMxD,EAAoB,KAClCN,EAAQ6M,KAAOvM,EAAoB,KACnCN,EAAQ0qB,KAAOpqB,EAAoB,KACnCN,EAAQ+D,OAASzD,EAAoB,KACrCN,EAAQ2qB,UAAYrqB,EAAoB,KACxCN,EAAQ4qB,YAActqB,EAAoB,KAC1CN,EAAQ6qB,OAASvqB,EAAoB,KACrCN,EAAQgE,IAAM1D,EAAoB,KAClCN,EAAQ8qB,IAAMxqB,EAAoB,KAClCN,EAAQ+qB,MAAQzqB,EAAoB,KACpCN,EAAQgrB,IAAM1qB,EAAoB,KAClCN,EAAQirB,IAAM3qB,EAAoB,KAClCN,EAAQiE,IAAM3D,EAAoB,KAClCN,EAAQkrB,MAAQ5qB,EAAoB,KACpCN,EAAQ6nB,IAAMvnB,EAAoB,KAClCN,EAAQkE,SAAW5D,EAAoB,KACvCN,EAAQmrB,KAAO7qB,EAAoB,KACnCN,EAAQorB,QAAU9qB,EAAoB,KACtCN,EAAQmE,IAAM7D,EAAoB,KAClCN,EAAQgI,MAAQ1H,EAAoB,KACpCN,EAAQiI,KAAO3H,EAAoB,KACnCN,EAAQoE,KAAO9D,EAAoB,KACnCN,EAAQqrB,OAAS/qB,EAAoB,KACrCN,EAAQqE,SAAW/D,EAAoB,KACvCN,EAAQsE,WAAahE,EAAoB,KACzCN,EAAQsrB,UAAYhrB,EAAoB,KACxCN,EAAQurB,KAAOjrB,EAAoB,KAGnCN,EAAQuE,OAASjE,EAAoB,KACrCN,EAAQwrB,OAASlrB,EAAoB,KACrCN,EAAQyrB,MAAQnrB,EAAoB,KACpCN,EAAQ0rB,OAASprB,EAAoB,KACrCN,EAAQ2rB,UAAYrrB,EAAoB,KACxCN,EAAQ4rB,gBAAkBtrB,EAAoB,KAC9CN,EAAQ6rB,cAAgBvrB,EAAoB,KAG5CN,EAAQ0J,IAAMpJ,EAAoB,KAClCN,EAAQ8rB,KAAOxrB,EAAoB,KACnCN,EAAQuJ,GAAKjJ,EAAoB,KACjCN,EAAQwJ,GAAKlJ,EAAoB,KAGjCN,EAAQygB,UAAYngB,EAAoB,KACxCN,EAAQ,WAAaM,EAAoB,KACzCN,EAAQ+rB,QAAUzrB,EAAoB,KACtCN,EAAQqF,MAAQ/E,EAAoB,KACpCN,EAAQqB,OAASf,EAAoB,KACrCN,EAAQsB,OAAShB,EAAoB,KACrCN,EAAQ6K,OAASvK,EAAoB,KACrCN,EAAQkQ,KAAO5P,EAAoB,KAGnCN,EAAc,KAAKM,EAAoB,KACvCN,EAAQgsB,KAAQ1rB,EAAoB,KAGpCN,EAAa,IAAIM,EAAoB,KACrCN,EAAa,IAAIM,EAAoB,KACrCN,EAAY,GAAIM,EAAoB,KACpCN,EAAa,IAAIM,EAAoB,KAGrCN,EAAgB,OAAIM,EAAoB,KACxCN,EAAQisB,MAAQ3rB,EAAoB,KACpCN,EAAQwE,IAAMlE,EAAoB,KAClCN,EAAQksB,KAAO5rB,EAAoB,KACnCN,EAAQmsB,IAAM7rB,EAAoB,KAClCN,EAAQyE,IAAMnE,EAAoB,KAClCN,EAAQosB,QAAU9rB,EAAoB,KACtCN,EAAQ0E,IAAMpE,EAAoB,KAClCN,EAAQqsB,KAAO/rB,EAAoB,KACnCN,EAAQyF,MAAQnF,EAAoB,KACpCN,EAAQwP,OAASlP,EAAoB,KACrCN,EAAQ4M,KAAOtM,EAAoB,KACnCN,EAAQssB,QAAUhsB,EAAoB,KACtCN,EAAQ0F,OAASpF,EAAoB,KACrCN,EAAQusB,MAAQjsB,EAAoB,KACpCN,EAAQwsB,UAAYlsB,EAAoB,KACxCN,EAAQysB,MAAQnsB,EAAoB,KAGpCN,EAAQ0sB,aAAepsB,EAAoB,KAE3CN,EAAQ2sB,UAAYrsB,EAAoB,KACxCN,EAAQ4sB,MAAQtsB,EAAoB,KACpCN,EAAQ6sB,aAAevsB,EAAoB,KAC3CN,EAAQ8sB,WAAaxsB,EAAoB,KACzCN,EAAQ+sB,OAASzsB,EAAoB,KACrCN,EAAQgtB,UAAY1sB,EAAoB,KAGxCN,EAAQitB,QAAU3sB,EAAoB,KACtCN,EAAQgH,UAAY1G,EAAoB,KACxCN,EAAe,MAAIM,EAAoB,KACvCN,EAAQ4E,OAAStE,EAAoB,KACrCN,EAAQktB,SAAW5sB,EAAoB,KACvCN,EAAQ6E,QAAUvE,EAAoB,KACtCN,EAAQmtB,UAAY7sB,EAAoB,KACxCN,EAAQotB,QAAU9sB,EAAoB,KAGtCN,EAAQuF,IAAMjF,EAAoB,KAClCN,EAAQwF,KAAOlF,EAAoB,KACnCN,EAAQqtB,OAAS/sB,EAAoB,KACrCN,EAAQ8E,IAAMxE,EAAoB,KAClCN,EAAQstB,KAAOhtB,EAAoB,KACnCN,EAAQutB,IAAMjtB,EAAoB,KAClCN,EAAQ+E,IAAMzE,EAAoB,KAClCN,EAAQ,OAASM,EAAoB,KAGrCN,EAAQwtB,KAAOltB,EAAoB,KACnCN,EAAQytB,MAAQntB,EAAoB,KACpCN,EAAQ0tB,KAAOptB,EAAoB,KACnCN,EAAQ2tB,MAAQrtB,EAAoB,KACpCN,EAAQ4tB,KAAOttB,EAAoB,KACnCN,EAAQ6tB,MAAQvtB,EAAoB,KACpCN,EAAQ8tB,KAAOxtB,EAAoB,KACnCN,EAAQ+tB,MAAQztB,EAAoB,KACpCN,EAAQguB,KAAO1tB,EAAoB,KACnCN,EAAQiuB,MAAQ3tB,EAAoB,KACpCN,EAAQkuB,KAAO5tB,EAAoB,KACnCN,EAAQmuB,MAAQ7tB,EAAoB,KACpCN,EAAQ0L,MAAQpL,EAAoB,KACpCN,EAAQsL,IAAMhL,EAAoB,KAClCN,EAAQouB,KAAO9tB,EAAoB,KACnCN,EAAQquB,IAAM/tB,EAAoB,KAClCN,EAAQsuB,KAAOhuB,EAAoB,KACnCN,EAAQuuB,IAAMjuB,EAAoB,KAClCN,EAAQwuB,KAAOluB,EAAoB,KACnCN,EAAQ6a,IAAMva,EAAoB,KAClCN,EAAQyuB,KAAOnuB,EAAoB,KACnCN,EAAQuL,IAAMjL,EAAoB,KAClCN,EAAQ0uB,KAAOpuB,EAAoB,KACnCN,EAAQ2uB,IAAMruB,EAAoB,KAClCN,EAAQ4uB,KAAOtuB,EAAoB,KAGnCN,EAAQiD,GAAK3C,EAAoB,KAGjCN,EAAQgC,MAAS1B,EAAoB,KACrCN,EAAQsF,IAAOhF,EAAoB,KACnCN,EAAQmF,OAAU7E,EAAoB,KACtCN,EAAQoF,QAAW9E,EAAoB,KACvCN,EAAQkI,OAAU5H,EAAoB,KAEtCN,EAAQ,UAAaM,EAAoB,KACzCN,EAAQ6uB,KAAQvuB,EAAoB,KACpCN,EAAQ,UAAaM,EAAoB,MAKpC,SAASL,EAAQD,EAASM,GAE/B,YAiBA,SAASsD,GAAQ8C,EAAKP,GACpB,GAAIvE,GAAOuE,GAASA,EAAMJ,MAE1B,QAAQnE,GACN,IAAK,YAAa,MAAOC,GAAUoK,SAAS9F,EAC5C,KAAK,UAAa,MAAO9D,GAAQ4J,SAAS9F,EAC1C,KAAK,OAAa,MAAOzD,GAAKuJ,SAAS9F,EACvC,KAAK,QAAa,MAAO5D,GAAM0J,SAAS9F,EACxC,KAAK,SAAa,MAAO3D,GAAOyJ,SAAS9F,EACzC,KAAK,QAAa,MAAO7D,GAAM2J,SAAS9F,EACxC,KAAK,YAAa,MAAOxD,GAAUsJ,SAAS9F,EAC5C,KAAK,OAAa,MAAO1D,GAAKwJ,SAAS9F,GAGzC,MAAOA,GA7BT,GAAItE,GAAYvB,EAAoB,IAChC+B,EAAY/B,EAAoB,GAChCoC,EAAYpC,EAAoB,GAChCiC,EAAYjC,EAAoB,GAChCkC,EAAYlC,EAAoB,GAChCgC,EAAYhC,EAAoB,GAChCqC,EAAYrC,EAAoB,IAChCmC,EAAYnC,EAAoB,EAyBpCL,GAAOD,QAAU4D,GAKZ,SAAS3D,EAAQD,EAASM,GAE/B,YAEA,IAAIuB,GAAYvB,EAAoB,IAChCwuB,EAAiBxuB,EAAoB,KAAK2E,UAC1C4C,EAAWvH,EAAoB,GAAGuH,SAClCua,EAAc9hB,EAAoB,KAAK8hB,WAU3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WAEd,GAAIoH,GAAO+V,EAAYpZ,WAGnB+lB,EAAY1iB,EAAKlF,OAAS,EAC1BsH,EAAOpC,EAAK0iB,EACZlnB,GAAS4G,GACXpC,EAAK0iB,GAAatgB,EAAO,EAElBA,YAAgB5M,KACvBwK,EAAK0iB,GAAatgB,EAAKugB,MAAM,GAG/B,KACE,MAAO7tB,GAAK+D,OAAOuI,MAAMtM,EAAMkL,GAEjC,MAAO0E,GACL,KAAM+d,GAAe/d,IAMzB,OAFA5P,GAAK+D,OAAOD,UAAYA,EAEjBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIijB,GAAajjB,EAAoB,KAGjCihB,GAFYjhB,EAAoB,KAAK2uB,UACvB3uB,EAAoB,KAAK8hB,YACtB9hB,EAAoB,KAUzCL,GAAOD,QAAU,SAAUmB,GACzB,GAAI+tB,GAAU/tB,EAAKgE,OAEfF,EAAY,SAAUoH,EAAMlL,EAAMkpB,GACpC,GAAoB,IAAhBhe,EAAKlF,OACP,KAAM,IAAIoa,GAAe,SAAUvY,UAAU7B,OAAQ,EAGvD,IACIgoB,GADArsB,EAAIuJ,EAAK,GAAGke,QAAQppB,GAAMmf,KAAK+J,EAEnC,IAAIhe,EAAK,YAAckX,GAErB4L,EAAO9iB,EAAK,GAAGke,QAAQppB,GAAMmf,KAAK+J,OAE/B,CAIH,GAAI+E,GAAS/E,MACTgF,EAAShjB,EAAK,GACblH,OAAO,SAAU5B,GAChB,MAAQA,aAAgBggB,MAClBhgB,EAAKwM,OAAQ5O,OACboC,EAAKwM,OAAQqf,MAClB,GAGHE,EAAMruB,OAAOF,OAAOquB,GACpBG,EAAKljB,EAAK,GAAGke,QAAQppB,EACzB,KAAIkuB,EAQF,KAAM,IAAInuB,OAAM,iDAPhB,IAAI6O,GAAOsf,EAAOtf,IAClBof,GAAO,SAAUrsB,GAEf,MADAwsB,GAAIvf,GAAQjN,EACLysB,EAAGjP,KAAKgP,IAQrB,MAAOJ,GAAQpsB,EAAGqsB,GAMpB,OAHAlqB,GAAUuqB,SAAU,EACpBruB,EAAKgE,OAAOF,UAAYA,EAEjBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIkC,GAASlC,EAAoB,EASjCL,GAAOD,QAAU,SAAUmB,GAezB,QAASsuB,GAAersB,EAAO0J,EAAU4iB,GACvC,GAAI5f,GAAU,SAAU3J,EAAOd,GACzBY,MAAMC,QAAQC,GAChBA,EAAMf,QAAQ,SAAUsJ,EAAOzH,GAE7B6I,EAAQpB,EAAOrJ,EAAMH,OAAO+B,EAAI,MAIlC6F,EAAS3G,EAAOd,EAAOqqB,GAG3B5f,GAAQ1M,MA1BV,GAAI6B,GAAY,SAAUnC,EAAGgK,GAC3B,GAAwB,GAApB9D,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIlB,MAAMC,QAAQpD,GAChB2sB,EAAc3sB,EAAGgK,EAAUhK,OACtB,CAAA,KAAIA,YAAaN,IAGtB,KAAM,IAAIrB,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU2B,GAFpE2sB,GAAc3sB,EAAEuD,UAAWyG,EAAUhK,IAuBzC,OAFA3B,GAAKiE,QAAQH,UAAYA,EAElBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,EAAA,GAAIuB,GAAYvB,EAAoB,IAChCgC,EAAQhC,EAAoB,GAC5BiC,EAAQjC,EAAoB,GAE5BuH,GADSvH,EAAoB,GAClBA,EAAoB,GAAGuH,SACxB5B,OAAMC,QASpBjG,EAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WAEd,IAAK,GADDoH,MACKpF,EAAI,EAAGkG,EAAKnE,UAAU7B,OAAYgG,EAAJlG,EAAQA,IAAK,CAClD,GAAIyC,GAAMV,UAAU/B,EAGpB,IAAIyC,YAAepH,GACjBoH,EAAIwC,QACJxC,EAAIyC,KAAQzC,EAAI0C,KAAO,EAAI,EAAI,MAE5B,IAAIvE,EAAS6B,GAChBA,QAEG,CAAA,KAAIA,YAAe7H,IAItB,KAAM,IAAIsB,WAAU,mCAHpBuG,GAAMA,EAAIxG,WAAa,EAMzBmJ,EAAKpF,GAAKyC,EAGZ,GAAIsG,GAAM,GAAIzN,EAEd,OADAA,GAAMkL,MAAMuC,EAAK3D,GACV2D,EAKT,OAFA7O,GAAKkE,MAAMJ,UAAYA,EAEhBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,EAAA,GAAIkC,GAASlC,EAAoB,EACjBA,GAAoB,IACxBA,EAAoB,GACpBA,EAAoB,GACjBA,EAAoB,GAAGuH,SACxB5B,MAAMC,QASpBjG,EAAOD,QAAU,SAAUmB,GAezB,QAASwuB,GAAWC,EAAS9iB,EAAU4iB,GACrC,GAAI5f,GAAU,SAAU3J,EAAOd,GAC7B,MAAIY,OAAMC,QAAQC,GACTA,EAAMb,IAAI,SAAUoJ,EAAOzH,GAEhC,MAAO6I,GAAQpB,EAAOrJ,EAAMH,OAAO+B,EAAI,MAIlC6F,EAAS3G,EAAOd,EAAOqqB,GAIlC,OAAO5f,GAAQ8f,MA3BjB,GAAI3qB,GAAY,SAAUnC,EAAGgK,GAC3B,GAAwB,GAApB9D,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIlB,MAAMC,QAAQpD,GAChB,MAAO6sB,GAAU7sB,EAAGgK,EAAUhK,EACzB,IAAIA,YAAaN,GACtB,MAAO,IAAIA,GAAOmtB,EAAU7sB,EAAEuD,UAAWyG,EAAUhK,GAEnD,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,IAsBpE,OAFA3B,GAAKmE,IAAIL,UAAYA,EAEdA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIuB,GAAYvB,EAAoB,IAChCwuB,EAAiBxuB,EAAoB,KAAK2E,UAC1C4C,EAAWvH,EAAoB,GAAGuH,SAClCwa,EAAe/hB,EAAoB,IAAI+hB,aACvCD,EAAc9hB,EAAoB,KAAK8hB,WAU3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WACd,GAAIoH,GAAO+V,EAAYpZ,UAGvB,IAAmB,GAAfqD,EAAKlF,QAAekb,EAAahW,EAAK,IAAK,CAC7C,GAAIsB,GAAMtB,EAAK,EACXxE,GAAS8F,GACXtB,EAAK,GAAKsB,EAAM,EAETA,YAAe9L,KACtBwK,EAAK,GAAKsB,EAAIqhB,MAAM,IAIxB,IACE,MAAO7tB,GAAKoE,IAAIkI,MAAMtM,EAAMkL,GAE9B,MAAO0E,GACL,KAAM+d,GAAe/d,IAMzB,OAFA5P,GAAKoE,IAAIN,UAAYA,EAEdA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIuB,GAAYvB,EAAoB,IAChCwuB,EAAiBxuB,EAAoB,KAAK2E,UAC1C4C,EAAWvH,EAAoB,GAAGuH,SAClCwa,EAAe/hB,EAAoB,IAAI+hB,aACvCD,EAAc9hB,EAAoB,KAAK8hB,WAU3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WACd,GAAIoH,GAAO+V,EAAYpZ,UAGvB,IAAmB,GAAfqD,EAAKlF,QAAekb,EAAahW,EAAK,IAAK,CAC7C,GAAIsB,GAAMtB,EAAK,EACXxE,GAAS8F,GACXtB,EAAK,GAAKsB,EAAM,EAETA,YAAe9L,KACtBwK,EAAK,GAAKsB,EAAIqhB,MAAM,IAIxB,IACE,MAAO7tB,GAAKqE,KAAKiI,MAAMtM,EAAMkL,GAE/B,MAAO0E,GACL,KAAM+d,GAAe/d,IAMzB,OAFA5P,GAAKqE,KAAKP,UAAYA,EAEfA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIuB,GAAYvB,EAAoB,IAChCwuB,EAAiBxuB,EAAoB,KAAK2E,UAC1C4C,EAAWvH,EAAoB,GAAGuH,SAClCwa,EAAe/hB,EAAoB,IAAI+hB,aACvCD,EAAc9hB,EAAoB,KAAK8hB,WAU3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WACd,GAAIoH,GAAO+V,EAAYpZ,UAGvB,IAAmB,GAAfqD,EAAKlF,QAAekb,EAAahW,EAAK,IAAK,CAC7C,GAAIsB,GAAMtB,EAAK,EACXxE,GAAS8F,GACXtB,EAAK,GAAKsB,EAAM,EAETA,YAAe9L,KACtBwK,EAAK,GAAKsB,EAAIqhB,MAAM,IAIxB,IACE,MAAO7tB,GAAK2D,IAAI2I,MAAMtM,EAAMkL,GAE9B,MAAO0E,GACL,KAAM+d,GAAe/d,IAMzB,OAFA5P,GAAK2D,IAAIG,UAAYA,EAEdA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAI2uB,GAAY3uB,EAAoB,KAAK2uB,UACrC7M,EAAc9hB,EAAoB,KAAK8hB,WAS3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WACd,GAAIoH,GAAO+V,EAAYpZ,WAEnB+lB,EAAY1iB,EAAKlF,OAAS,EAC1BsH,EAAOpC,EAAK0iB,EAKhB,OAJKE,GAAUxgB,IACbpC,EAAKe,MAAK,GAGLjM,EAAKsE,MAAMgI,MAAMtM,EAAMkL,GAKhC,OAFAlL,GAAKsE,MAAMR,UAAYA,EAEhBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEA,IAAIwuB,GAAiBxuB,EAAoB,KAAK2E,UAE1Cmd,GADY9hB,EAAoB,KAAK2uB,UACvB3uB,EAAoB,KAAK8hB,YAS3CniB,GAAOD,QAAU,SAAUmB,GACzB,GAAI8D,GAAY,WACd,IACE,MAAO9D,GAAKuE,OAAO+H,MAAMtM,EAAMihB,EAAYpZ,YAE7C,MAAO+H,GACL,KAAM+d,GAAe/d,IAMzB,OAFA5P,GAAKuE,OAAOT,UAAYA,EAEjBA,IAMJ,SAAShF,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAqBzB,QAASyE,GAAOO,GACd,KAAM/F,eAAgBwF,IACpB,KAAM,IAAI6D,aAAY,mDAItBrJ,MAAK+F,MADHA,YAAiBP,GACNO,EAAMA,MAGNA,EAmCjB,QAAS0pB,GAAY9f,EAAM5J,GACzB,GAAI2pB,GAAQ7pB,MAAMuF,UAAUskB,KAG1BlqB,GAAM4F,UAAUuE,GAFG,kBAAV5J,GAEe,WACtB,GAAIkG,IAAQjM,KAAK+F,OAAOjB,OAAO4qB,EAAMnvB,KAAKqI,UAAW,GACrD,OAAO,IAAIpD,GAAMO,EAAMsH,MAAMrN,KAAMiM,KAKb,GAAIzG,GAAMO,GA3EtC,GAAI0E,GAASvK,EAAoB,IAsCjCsF,GAAM4F,UAAUukB,KAAO,WACrB,MAAO3vB,MAAK+F,OAQdP,EAAM4F,UAAUnF,QAAU,WACxB,MAAOjG,MAAK+F,OAOdP,EAAM4F,UAAUO,SAAW,WACzB,MAAOlB,GAAO3C,OAAO9H,KAAK+F,QAuB5BP,EAAMiqB,YAAcA,CAKpB,KAAK,GAAI9oB,KAAQ5F,GACXA,EAAKwF,eAAeI,IACtB8oB,EAAY9oB,EAAM5F,EAAK4F,GAI3B,OAAOnB,KAMJ,SAAS3F,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAC3BgqB,EAAShqB,EAAoB,IAE7B+C,EAAa/C,EAAoB,IAEjCsK,EAAWF,EAAKG,OAAOD,SACvByX,EAAehf,EAAWgf,YAoC9BlhB,GAAKopB,QAAU,SAAkBlK,GAC/B,GAAwB,GAApBrX,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIyD,EAASyV,GAEX,MAAOiK,GAAOjK,GAAMkK,QAAQppB,EAEzB,IAAIkhB,EAAahC,GAEpB,MAAOhd,GAAWif,QAAQjC,EAAM,SAAU5Q,GACxC,MAAO6a,GAAO7a,GAAM8a,QAAQppB,IAK9B,MAAM,IAAIgC,WAAU,wCAQrB,SAASlD,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAC3BgqB,EAAShqB,EAAoB,IAE7B+C,EAAa/C,EAAoB,IAEjCsK,EAAWF,EAAKG,OAAOD,SACvByX,EAAehf,EAAWgf,YA+B9BlhB,GAAKmf,KAAO,SAAgBD,EAAMgK,GAChC,GAAwB,GAApBrhB,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAAG,EAMnE,IAFAkjB,EAAQA,MAEJzf,EAASyV,GAEX,MAAOiK,GAAOjK,GACTkK,QAAQppB,GACRmf,KAAK+J,EAEP,IAAIhI,EAAahC,GAEpB,MAAOhd,GAAWif,QAAQjC,EAAM,SAAU5Q,GACxC,MAAO6a,GAAO7a,GACT8a,QAAQppB,GAAMmf,KAAK+J,IAK1B,MAAM,IAAIlnB,WAAU,wCAQrB,SAASlD,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuB,GAAOpC,EAAoB,EAoB/Ba,GAAK6qB,KAAO,SAAcgE,GACxB,GAAwB,GAApBhnB,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,+CACZT,UAAU7B,OAAS,yBAG/B,IAAIgD,GAAO,IACX,IAAK6lB,YAAkB1pB,SAA+B,gBAAb,GACvC6D,EAAO6lB,MAEJ,CACH,GAAIjpB,EACJ,KAAKA,IAAQ5F,GAEX,GAAIA,EAAKwF,eAAeI,IAAUipB,IAAW7uB,EAAK4F,GAAQ,CACxDoD,EAAOpD,CACP,QAmBN,GAAI6Y,GAAMze,EAAKmC,WAAWI,KAAKyG,EAC/B,KAAKA,EACH,KAAM,IAAIjJ,OAAM,gBAAkB8uB,EAAS,eACtC,KAAKpQ,EACV,KAAM,IAAI1e,OAAM,8BAAgCiJ,EAAO,IAEzD,OAAO,IAAIzH,GAAKkd,MAOf,SAAS3f,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAImpB,GAAShqB,EAAoB,GAkCjCa,GAAKqC,MAAQ,WACX,MAAO8mB,GAAO7c,MAAM6c,EAAQthB,cAQ3B,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IA0BjCuD,EAAMjB,EAAM,OACdtB,OAAUyG,KAAKlE,IAEfxB,QAAW,SAAUS,GAEnB,GAAIyG,GAAKxB,KAAKlE,IAAIf,EAAEyG,IAChBC,EAAKzB,KAAKlE,IAAIf,EAAE0G,GACpB,IAAID,GAAMC,EAAI,CACZ,GAAI1G,GAAI0G,EAAKD,CACb,OAAOA,GAAKxB,KAAK3D,KAAK,EAAItB,EAAIA,GAEhC,GAAIsG,GAAIG,EAAKC,CACb,OAAOA,GAAKzB,KAAK3D,KAAK,EAAIgF,EAAIA,IAGhCvH,UAAa,SAAUiB,GACrB,MAAOA,GAAEe,OAGXosB,iBAAkB,SAAUC,GAC1B,MAAO7sB,GAAWif,QAAQ4N,EAAMrsB,KAIpC,OAAOA,KAMJ,SAAS5D,EAAQD,EAASM,GAE/B,YAGAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5B+B,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAgCjCwD,EAAMlB,EAAM,OACdutB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,GAAIsG,GAGbgnB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAEutB,KAAKjnB,IAGhBknB,mBAAoB,SAAUxtB,EAAGsG,GAC/B,MAAO,IAAI/G,GACPS,EAAEyG,GAAKH,EAAEG,GACTzG,EAAE0G,GAAKJ,EAAEI,KAIf+mB,aAAc,SAAUztB,EAAGsG,GACzB,GAAe,MAAXtG,EAAEqD,MAAe,KAAM,IAAIjF,OAAM,mDACrC,IAAe,MAAXkI,EAAEjD,MAAe,KAAM,IAAIjF,OAAM,mDACrC,KAAK4B,EAAEuO,UAAUjI,GAAI,KAAM,IAAIlI,OAAM,qBAErC,IAAI8O,GAAMlN,EAAEd,OAGZ,OAFAgO,GAAI7J,OAASiD,EAAEjD,MACf6J,EAAIO,WAAY,EACTP,GAGTwgB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGtF,IAGnC2sB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGtF,IAGnC4sB,iBAAkB,SAAU5tB,EAAGsG,GAC7B,MAAOtG,GAAIsG,IAIf,OAAOtF,KAMJ,SAAS7D,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAchf,EAAWgf,aACzBvX,EAAYzI,EAAQyI,SA8BxB3J,GAAK0L,KAAO,QAASA,GAAK/J,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAOiF,MAAK8E,KAAK/J,EAGnB,IAAIgI,EAAUhI,GACZ,MAAO,IAAIT,GACP0F,KAAK8E,KAAK/J,EAAEyG,IACZxB,KAAK8E,KAAK/J,EAAE0G,IAIlB,IAAI1G,YAAajB,GACf,MAAOiB,GAAE+J,MAGX,IAAIwV,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG+J,EAG/B,IAAIoiB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAK8E,KAAK/J,EAGnB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YA0B9BlhB,GAAKupB,KAAO,QAASA,GAAK5nB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAOA,GAAIA,EAAIA,CAGjB,IAAIgI,EAAUhI,GACZ,MAAO3B,GAAK+C,SAAS/C,EAAK+C,SAASpB,EAAGA,GAAIA,EAG5C,IAAIA,YAAajB,GACf,MAAOiB,GAAE6tB,MAAM7tB,GAAG6tB,MAAM7tB,EAG1B,IAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG4nB,EAG/B,IAAIuE,EAAUnsB,IAAY,OAANA,EAClB,MAAO4nB,IAAM5nB,EAGf,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAASgB,GACxB,GAAI4B,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IAEjCswB,EAAetwB,EAAoB,KAAKU,GACxCkD,EAAW5D,EAAoB,IAAIU,GACnC0D,EAAMpE,EAAoB,IAAIU,EAiClC,OAAO4B,GAAM,UACXiuB,WAAYD,EAEZE,iCAAkC,SAAUhuB,EAAGsG,GAK7C,MAAOlF,GAASpB,EAAG4B,EAAI0E,KAGzBonB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGwnB,IAGnCH,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAOlF,GAASpB,EAAG4B,EAAI0E,SAQxB,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIkC,GAAa/C,EAAoB,GA4BrCa,GAAKwpB,UAAY,SAAmB7nB,EAAGsG,GACrC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,OAAO9D,GAAWkf,SAASzf,EAAGsG,EAAGjI,EAAK4C,SAIxC5C,EAAK4vB,QAAU,WACb,KAAM,IAAI7vB,OAAM,+CAOf,SAASjB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GACIkC,IADO/C,EAAoB,KACdA,EAAoB,IA4BrCa,GAAKypB,YAAc,SAAqB9nB,EAAGsG,GACzC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,cAAevY,UAAU7B,OAAQ,EAGvE,OAAO9D,GAAWkf,SAASzf,EAAGsG,EAAGjI,EAAK+C,WAIxC/C,EAAK6vB,UAAY,WACf,KAAM,IAAI9vB,OAAM,mDAOf,SAASjB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GACIkC,IADO/C,EAAoB,KACdA,EAAoB,IAyBrCa,GAAK0pB,OAAS,SAAgB/nB,EAAGsG,GAC/B,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAGlE,OAAO9D,GAAWkf,SAASzf,EAAGsG,EAAGjI,EAAKgD,MAIxChD,EAAK8vB,KAAO,WACV,KAAM,IAAI/vB,OAAM,yCAOf,SAASjB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5B+B,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IA8BjC0D,EAAMpB,EAAM,OACdtB,OAAUyG,KAAK/D,IAEf3B,QAAW,SAAUS,GACnB,GAAI+G,GAAI9B,KAAK/D,IAAIlB,EAAEyG,GACnB,OAAO,IAAIlH,GACPwH,EAAI9B,KAAKuD,IAAIxI,EAAE0G,IACfK,EAAI9B,KAAKwD,IAAIzI,EAAE0G,MAIrB3H,UAAa,SAAUiB,GACrB,MAAOA,GAAEkB,OAGXisB,iBAAkB,SAAUntB,GAC1B,MAAOO,GAAWif,QAAQxf,EAAGkB,KAIjC,OAAOA,KAMJ,SAAS/D,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YA6B9BlhB,GAAK2pB,IAAM,QAASA,GAAIhoB,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAQA,GAAI,EAAKiF,KAAKgjB,MAAMjoB,GAAKiF,KAAK8E,KAAK/J,EAG7C,IAAIgI,EAAUhI,GACZ,MAAO,IAAIT,GACNS,EAAEyG,GAAK,EAAKxB,KAAKgjB,MAAMjoB,EAAEyG,IAAMxB,KAAK8E,KAAK/J,EAAEyG,IAC3CzG,EAAE0G,GAAK,EAAKzB,KAAKgjB,MAAMjoB,EAAE0G,IAAMzB,KAAK8E,KAAK/J,EAAE0G,IAIlD,IAAI1G,YAAajB,GACf,MAAOiB,GAAEouB,aAAepuB,EAAE+J,OAAS/J,EAAEioB,OAGvC,IAAI1I,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGgoB,EAG/B,IAAImE,EAAUnsB,IAAY,OAANA,EAClB,MAAOgoB,IAAKhoB,EAGd,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YA6B9BlhB,GAAK4pB,MAAQ,QAASA,GAAMjoB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAOiF,MAAKgjB,MAAMjoB,EAGpB,IAAIgI,EAAUhI,GACZ,MAAO,IAAIT,GACP0F,KAAKgjB,MAAMjoB,EAAEyG,IACbxB,KAAKgjB,MAAMjoB,EAAE0G,IAInB,IAAI1G,YAAajB,GACf,MAAOiB,GAAEioB,OAGX,IAAI1I,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGioB,EAG/B,IAAIkE,EAAUnsB,IAAY,OAANA,EAClB,MAAOioB,IAAOjoB,EAGhB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA4HzB,QAASgwB,GAAQtqB,EAAGC,GAClB,IAAKD,EAAEuqB,UAAYtqB,EAAEsqB,QACnB,KAAM,IAAIlwB,OAAM,qDAKlB,KADA,GAAImwB,GAAO,GAAIxvB,GAAU,IACjBiF,EAAEwqB,UAAU,CAClB,GAAIznB,GAAIhD,EAAEghB,IAAI/gB,EACdD,GAAIC,EACJA,EAAI+C,EAEN,MAAOhD,GAAE0Y,GAAG8R,GAAQxqB,EAAE0qB,MAAQ1qB,EAvIhC,GAAI6D,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBua,EAAehf,EAAWgf,YA2B9BlhB,GAAK6pB,IAAM,QAASA,KAClB,GAEInhB,GAFAhD,EAAImC,UAAU,GACdlC,EAAIkC,UAAU,EAGlB,IAAwB,GAApBA,UAAU7B,OAAa,CAEzB,GAAIU,EAAShB,IAAMgB,EAASf,GAAI,CAC9B,IAAKgB,EAAUjB,KAAOiB,EAAUhB,GAC9B,KAAM,IAAI5F,OAAM,qDAIlB,MAAY,GAAL4F,GACL+C,EAAIhD,EAAIC,EACRD,EAAIC,EACJA,EAAI+C,CAEN,OAAY,GAAJhD,GAAUA,EAAIA,EAIxB,GAAIwb,EAAaxb,IAAMwb,EAAavb,GAClC,MAAOzD,GAAWkf,SAAS1b,EAAGC,EAAGkkB,EAGnC,IAAInkB,YAAahF,GASf,MAPIgG,GAASf,GACXA,EAAIjF,EAAUK,QAAQ4E,IAEfmoB,EAAUnoB,IAAY,OAANA,KACvBA,EAAI,GAAIjF,GAAUiF,EAAI,EAAI,IAGxBA,YAAajF,GACRsvB,EAAQtqB,EAAGC,GAIbkkB,EAAInkB,EAAE3D,WAAY4D,EAE3B,IAAIA,YAAajF,GASf,MAPIgG,GAAShB,GACXA,EAAIhF,EAAUK,QAAQ2E,IAEfooB,EAAUpoB,IAAY,OAANA,KACvBA,EAAI,GAAIhF,GAAUgF,EAAI,EAAI,IAGxBA,YAAahF,GACRsvB,EAAQtqB,EAAGC,GAIbkkB,EAAInkB,EAAE3D,WAAY4D,EAG3B,IAAImoB,EAAUpoB,IAAY,OAANA,EAClB,MAAOmkB,IAAKnkB,EAAGC,EAEjB,IAAImoB,EAAUnoB,IAAY,OAANA,EAClB,MAAOkkB,GAAInkB,GAAIC,EAGjB,MAAM,IAAI3F,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU0F,GAAI1F,EAAK,UAAU2F,IAGrF,GAAIkC,UAAU7B,OAAS,EAAG,CAExB,IAAK,GAAIF,GAAI,EAAGA,EAAI+B,UAAU7B,OAAQF,IACpCJ,EAAImkB,EAAInkB,EAAGmC,UAAU/B,GAEvB,OAAOJ,GAIT,KAAM,IAAI4C,aAAY,iDA6BrB,SAASxJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAsIzB,QAASqwB,GAAQ3qB,EAAGC,GAClB,IAAKD,EAAEuqB,UAAYtqB,EAAEsqB,QACnB,KAAM,IAAIlwB,OAAM,qDAGlB,IAAI2F,EAAEyqB,UAAYxqB,EAAEwqB,SAClB,MAAO,IAAIzvB,GAAU,EAMvB,KADA,GAAIyrB,GAAOzmB,EAAE8pB,MAAM7pB,IACXA,EAAEwqB,UAAU,CAClB,GAAIG,GAAI3qB,CACRA,GAAID,EAAEghB,IAAI4J,GACV5qB,EAAI4qB,EAEN,MAAOnE,GAAKvM,IAAIla,GAAGhD,MAtJrB,GAAI6G,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBua,EAAehf,EAAWgf,YA+B9BlhB,GAAK8pB,IAAM,QAASA,KAClB,GAEIwG,GAFA5qB,EAAImC,UAAU,GACdlC,EAAIkC,UAAU,EAGlB,IAAwB,GAApBA,UAAU7B,OAAa,CAEzB,GAAIU,EAAShB,IAAMgB,EAASf,GAAI,CAC9B,IAAKgB,EAAUjB,KAAOiB,EAAUhB,GAC9B,KAAM,IAAI5F,OAAM,qDAGlB,IAAS,GAAL2F,GAAe,GAALC,EACZ,MAAO,EAMT,KADA,GAAIwmB,GAAOzmB,EAAIC,EACH,GAALA,GACL2qB,EAAI3qB,EACJA,EAAID,EAAI4qB,EACR5qB,EAAI4qB,CAEN,OAAO1pB,MAAKlE,IAAIypB,EAAOzmB,GAIzB,GAAIwb,EAAaxb,IAAMwb,EAAavb,GAClC,MAAOzD,GAAWkf,SAAS1b,EAAGC,EAAGmkB,EAGnC,IAAIpkB,YAAahF,GASf,MAPIgG,GAASf,GACXA,EAAIjF,EAAUK,QAAQ4E,IAEfmoB,EAAUnoB,IAAY,OAANA,KACvBA,EAAI,GAAIjF,GAAUiF,EAAI,EAAI,IAGxBA,YAAajF,GACR2vB,EAAQ3qB,EAAGC,GAIbmkB,EAAIpkB,EAAE3D,WAAY4D,EAE3B,IAAIA,YAAajF,GASf,MAPIgG,GAAShB,GACXA,EAAIhF,EAAUK,QAAQ2E,IAEfooB,EAAUpoB,IAAY,OAANA,KACvBA,EAAI,GAAIhF,GAAUgF,EAAI,EAAI,IAGxBA,YAAahF,GACR2vB,EAAQ3qB,EAAGC,GAIbmkB,EAAIpkB,EAAE3D,WAAY4D,EAG3B,IAAImoB,EAAUpoB,IAAY,OAANA,EAClB,MAAOokB,IAAKpkB,EAAGC,EAEjB,IAAImoB,EAAUnoB,IAAY,OAANA,EAClB,MAAOmkB,GAAIpkB,GAAIC,EAGjB,MAAM,IAAI3F,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU0F,GAAI1F,EAAK,UAAU2F,IAGrF,GAAIkC,UAAU7B,OAAS,EAAG,CAExB,IAAK,GAAIF,GAAI,EAAGA,EAAI+B,UAAU7B,OAAQF,IACpCJ,EAAIokB,EAAIpkB,EAAGmC,UAAU/B,GAEvB,OAAOJ,GAIT,KAAM,IAAI4C,aAAY,iDAkCrB,SAASxJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAuEzB,QAAS0wB,GAAW5uB,GAClB,MAAIA,IAAK,EACAiF,KAAK9D,IAAInB,GAITmB,EAAI,GAAI5B,GAAQS,EAAG,IA5E9B,GAAIF,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IACjC+B,EAAU/B,EAAoB,GAE9BswB,EAAetwB,EAAoB,KAAKU,GAoCxCiD,EAAMrB,EAAM,OACdtB,OAAUowB,EAEVrvB,QAAW,SAAUS,GACnB,MAAO,IAAIT,GACP0F,KAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEyG,GAAKzG,EAAEyG,GAAKzG,EAAE0G,GAAK1G,EAAE0G,KAC1CzB,KAAK2D,MAAM5I,EAAE0G,GAAI1G,EAAEyG,MAIzB1H,UAAa,SAAUiB,GACrB,MAAOA,GAAEge,MAGXmP,iBAAkB,SAAUntB,GAC1B,MAAOO,GAAWif,QAAQxf,EAAGmB,IAG/B4sB,WAAY,SAAU/tB,EAAGsO,GAEvB,MAAOwf,GAAa3sB,EAAInB,GAAImB,EAAImN,MAoBpC,OAAOnN,KAMJ,SAAShE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YA2B9BlhB,GAAK+pB,MAAQ,QAASA,GAAMpoB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAIA,IAAK,EACAiF,KAAK9D,IAAInB,GAAKiF,KAAK4J,KAInBuZ,EAAM,GAAI7oB,GAAQS,EAAG,GAIhC,IAAIA,YAAajB,GACf,MAAIiB,GAAEouB,aAEGhG,EAAMpoB,EAAEI,YAGRJ,EAAEmB,KAIb,IAAI6G,EAAUhI,GACZ,MAAO,IAAIT,GACP0F,KAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEyG,GAAKzG,EAAEyG,GAAKzG,EAAE0G,GAAK1G,EAAE0G,KAAOzB,KAAK4J,KACtD5J,KAAK2D,MAAM5I,EAAE0G,GAAI1G,EAAEyG,IAAMxB,KAAK4J,KAIpC,IAAI0Q,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGooB,EAG/B,IAAI+D,EAAUnsB,IAAY,OAANA,EAClB,MAAOooB,IAAOpoB,EAGhB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAmHzB,QAASwwB,GAAK7uB,EAAGsG,GACf,GAAIA,EAAI,EAIN,MAAOtG,GAAIsG,EAAIrB,KAAKgjB,MAAMjoB,EAAIsG,EAE3B,IAAS,GAALA,EACP,MAAOtG,EAIP,MAAM,IAAI5B,OAAM,+CA9HpB,GAAIwJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAehf,EAAWgf,YAqC9BlhB,GAAK0mB,IAAM,QAASA,GAAI/kB,EAAGsG,GACzB,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAK/D,IAAIU,EAAS/E,IACP+E,EAASuB,GAEX,MAAOuoB,GAAK7uB,EAAGsG,EAInB,IAAItG,YAAajB,GASf,MAPIgG,GAASuB,GACXA,EAAIvH,EAAUK,QAAQkH,IAEf6lB,EAAU7lB,IAAY,OAANA,KACvBA,EAAI,GAAIvH,GAAUuH,EAAI,EAAI,IAGxBA,YAAavH,GACRuH,EAAEkoB,SAAWxuB,EAAIA,EAAE+kB,IAAIze,GAIzBye,EAAI/kB,EAAEI,WAAYkG,EAE3B,IAAIA,YAAavH,GASf,MAPIgG,GAAS/E,GACXA,EAAIjB,EAAUK,QAAQY,IAEfmsB,EAAUnsB,IAAY,OAANA,KACvBA,EAAI,GAAIjB,GAAUiB,EAAI,EAAI,IAGxBA,YAAajB,GACRuH,EAAEkoB,SAAWxuB,EAAIA,EAAE+kB,IAAIze,GAIzBye,EAAI/kB,EAAGsG,EAAElG,WAKlB,IAAImf,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGye,EAGnC,IAAIoH,EAAUnsB,IAAY,OAANA,EAClB,MAAO+kB,IAAK/kB,EAAGsG,EAEjB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOye,GAAI/kB,GAAIsG,EAGjB,MAAM,IAAIjI,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OA8BlF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAwGzB,QAAS4wB,GAAU9uB,EAAGsG,GACpB,GAAIyoB,GAAQjlB,EAAK9J,GACbgvB,EAAQllB,EAAKxD,EAEjB,IAAoB,GAAhByoB,EAAM1qB,OAAa,CACrB,GAAoB,GAAhB2qB,EAAM3qB,OAAa,CAErB,GAAI0qB,EAAM,IAAMC,EAAM,GACpB,KAAM,IAAIC,YAAW,kFAEVF,EAAM,GACjB,UAAYC,EAAM,GAAK,KACvBD,EAAM,GAAK,OAASC,EAAM,GAAK,IAGjC,OAAOE,GAAsBlvB,EAAGsG,GAE7B,GAAoB,GAAhB0oB,EAAM3qB,OAAa,CAE1B,GAAI0qB,EAAM,IAAMC,EAAM,GACpB,KAAM,IAAIC,YAAW,gFAEVF,EAAM,GACjB,UAAYC,EAAM,GAAK,IAAMA,EAAM,GAAK,KACxCD,EAAM,GAAK,OAASC,EAAM,GAAK,IAGjC,OAAOG,GAAsBnvB,EAAGsG,GAGhC,KAAM,IAAIlI,OAAM,wDACJ4wB,EAAM3qB,OAAS,gBAG1B,GAAoB,GAAhB0qB,EAAM1qB,OAAa,CAC1B,GAAoB,GAAhB2qB,EAAM3qB,OAAa,CAErB,GAAI0qB,EAAM,IAAMC,EAAM,GACpB,KAAM,IAAIC,YAAW,mFAEVF,EAAM,GAAK,IAAMA,EAAM,GAClC,UAAYC,EAAM,GAAK,KACvBD,EAAM,GAAK,OAASC,EAAM,GAAK,IAGjC,OAAOI,GAAsBpvB,EAAGsG,GAE7B,GAAoB,GAAhB0oB,EAAM3qB,OAAa,CAE1B,GAAI0qB,EAAM,IAAMC,EAAM,GACpB,KAAM,IAAIC,YAAW,iFAEVF,EAAM,GAAK,IAAMA,EAAM,GAClC,UAAYC,EAAM,GAAK,IAAMA,EAAM,GAAK,KACxCD,EAAM,GAAK,OAASC,EAAM,GAAK,IAGjC,OAAOK,GAAsBrvB,EAAGsG,GAGhC,KAAM,IAAIlI,OAAM,wDACJ4wB,EAAM3qB,OAAS,gBAI7B,KAAM,IAAIjG,OAAM,wDACJ2wB,EAAM1qB,OAAS,gBAY/B,QAASgrB,GAAsBrvB,EAAGsG,GAOhC,IAAK,GALD4G,MACA4Y,EAAO9lB,EAAEqE,OACT0hB,EAAOzf,EAAE,GAAGjC,OACZuF,EAAM5J,EAAE,GAAGqE,OAEN0C,EAAI,EAAO+e,EAAJ/e,EAAUA,IAAK,CAC7BmG,EAAInG,KACJ;IAAK,GAAIhJ,GAAI,EAAOgoB,EAAJhoB,EAAUA,IAAK,CAE7B,IAAK,GADDuxB,GAAS,KACJxf,EAAI,EAAOlG,EAAJkG,EAASA,IAAK,CAC5B,GAAI9R,GAAIoD,EAASpB,EAAE+G,GAAG+I,GAAIxJ,EAAEwJ,GAAG/R,GAC/BuxB,GAAqB,OAAXA,EAAmBtxB,EAAIgD,EAAIsuB,EAAQtxB,GAE/CkP,EAAInG,GAAGhJ,GAAKuxB,GAIhB,GAAIxkB,GAAoB,IAATgb,GAAuB,IAATC,CAC7B,OAAOjb,GAAWoC,EAAI,GAAG,GAAKA,EAWhC,QAASiiB,GAAsBnvB,EAAGsG,GAMhC,IAAK,GAJD4G,MACA4Y,EAAOxf,EAAEjC,OACT0hB,EAAOzf,EAAE,GAAGjC,OAEPtG,EAAI,EAAOgoB,EAAJhoB,EAAUA,IAAK,CAE7B,IAAK,GADDuxB,GAAS,KACJvoB,EAAI,EAAO+e,EAAJ/e,EAAUA,IAAK,CAC7B,GAAI/I,GAAIoD,EAASpB,EAAE+G,GAAIT,EAAES,GAAGhJ,GAC5BuxB,GAAgB,IAANvoB,EAAW/I,EAAIgD,EAAIsuB,EAAQtxB,GAEvCkP,EAAInP,GAAKuxB,EAGX,MAAsB,KAAfpiB,EAAI7I,OAAe6I,EAAI,GAAKA,EAWrC,QAASkiB,GAAsBpvB,EAAGsG,GAMhC,IAAK,GAJD4G,MACA4Y,EAAO9lB,EAAEqE,OACT0hB,EAAO/lB,EAAE,GAAGqE,OAEP0C,EAAI,EAAO+e,EAAJ/e,EAAUA,IAAK,CAE7B,IAAK,GADDuoB,GAAS,KACJvxB,EAAI,EAAOgoB,EAAJhoB,EAAUA,IAAK,CAC7B,GAAIC,GAAIoD,EAASpB,EAAE+G,GAAGhJ,GAAIuI,EAAEvI,GAC5BuxB,GAAgB,IAANvxB,EAAWC,EAAIgD,EAAIsuB,EAAQtxB,GAEvCkP,EAAInG,GAAKuoB,EAGX,MAAsB,KAAfpiB,EAAI7I,OAAe6I,EAAI,GAAKA,EAWrC,QAASgiB,GAAsBlvB,EAAGsG,GAEhC,GAAIlC,GAAMpE,EAAEqE,MAEZ,KAAKD,EACH,KAAM,IAAIhG,OAAM,oCAIlB,KAAK,GADDirB,GAAM,EACDllB,EAAI,EAAOC,EAAJD,EAASA,IACvBklB,EAAMroB,EAAIqoB,EAAKjoB,EAASpB,EAAEmE,GAAImC,EAAEnC,IAElC,OAAOklB,GApRT,GAAIvpB,GAAQtC,EAAoB,KAC5BsM,EAAOtM,EAAoB,KAAKsM,KAEhCvK,EAAU/B,EAAoB,GAC9BkC,EAASlC,EAAoB,GAC7B+C,EAAa/C,EAAoB,IAEjCwD,EAAMxD,EAAoB,IAAIU,GAiC9BkD,EAAWtB,EAAM,YACnButB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,GAAIsG,GAGbgnB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAE6tB,MAAMvnB,IAGjBknB,mBAAoB,SAAUxtB,EAAGsG,GAC/B,MAAO,IAAI/G,GACPS,EAAEyG,GAAKH,EAAEG,GAAKzG,EAAE0G,GAAKJ,EAAEI,GACvB1G,EAAEyG,GAAKH,EAAEI,GAAK1G,EAAE0G,GAAKJ,EAAEG,KAI7B8oB,eAAgB,SAAUvvB,EAAGsG,GAC3B,GAAI4G,GAAM5G,EAAEpH,OAEZ,OADAgO,GAAI7J,MAAuB,OAAd6J,EAAI7J,MAAkB6J,EAAIM,WAAWxN,GAAMkN,EAAI7J,MAAQrD,EAC7DkN,GAGTsiB,eAAgB,SAAUxvB,EAAGsG,GAC3B,GAAI4G,GAAMlN,EAAEd,OAEZ,OADAgO,GAAI7J,MAAuB,OAAd6J,EAAI7J,MAAkB6J,EAAIM,WAAWlH,GAAM4G,EAAI7J,MAAQiD,EAC7D4G,GAGTuiB,eAAgB,SAAUzvB,EAAGsG,GAC3B,MAAOwoB,GAAU9uB,EAAGsG,IAGtBopB,iBAAkB,SAAU1vB,EAAGsG,GAC7B,GAAI4G,GAAM9L,EAASpB,EAAEuD,UAAW+C,EAAE/C,UAClC,OAAOJ,OAAMC,QAAQ8J,GAAO,GAAIxN,GAAOwN,GAAOA,GAGhDyiB,gBAAiB,SAAU3vB,EAAGsG,GAC5B,GAAI4G,GAAM9L,EAASpB,EAAEuD,UAAW+C,EAChC,OAAOnD,OAAMC,QAAQ8J,GAAO,GAAIxN,GAAOwN,GAAOA,GAGhD0iB,gBAAiB,SAAU5vB,EAAGsG,GAC5B,GAAI4G,GAAM9L,EAASpB,EAAGsG,EAAE/C,UACxB,OAAOJ,OAAMC,QAAQ8J,GAAO,GAAIxN,GAAOwN,GAAOA,GAGhDwgB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGlF,IAGnCusB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGlF,KA2LrC,OAAOA,KAMJ,SAASjE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE7B8C,EAAQ9C,EAAoB,KAE5BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BkC,EAASlC,EAAoB,GAG7BuH,GAFavH,EAAoB,IAEtBoK,EAAKpJ,OAAOuG,UACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpB5E,EAAUD,MAAMC,OAwClB/E,GAAKgqB,KAAO,QAASA,GAAKroB,EAAGhC,GAC3B,GAAIkI,UAAU7B,OAAS,GAAK6B,UAAU7B,OAAS,EAC7C,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAAG,EAGlE,IAAIU,EAAS/E,GAEX,MAAOiF,MAAKlE,IAAIf,EAGlB,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIyG,GAAKxB,KAAKlE,IAAIf,EAAEyG,IAChBC,EAAKzB,KAAKlE,IAAIf,EAAE0G,GACpB,IAAID,GAAMC,EAAI,CACZ,GAAI1G,GAAI0G,EAAKD,CACb,OAAOA,GAAKxB,KAAK3D,KAAK,EAAItB,EAAIA,GAEhC,GAAIsG,GAAIG,EAAKC,CACb,OAAOA,GAAKzB,KAAK3D,KAAK,EAAIgF,EAAIA,GAGhC,GAAItG,YAAajB,GAEf,MAAOiB,GAAEe,KAGX,IAAIorB,EAAUnsB,IAAY,OAANA,EAElB,MAAOiF,MAAKlE,IAAIf,EAGlB,IAAIoD,EAAQpD,GAAI,CAEd,GAAI+uB,GAAQzuB,EAAMwJ,KAAK9J,EAKvB,IAHS,MAALhC,IACFA,EAAI,GAEc,GAAhB+wB,EAAM1qB,OAAa,CAErB,GAAIrG,IAAMsF,OAAOusB,mBAA2B,QAAN7xB,EAAa,CAEjD,GAAI8R,EAMJ,OALAzR,GAAKiE,QAAQtC,EAAG,SAAUqD,GACxB,GAAIysB,GAAIzxB,EAAK0C,IAAIsC,KACZyM,GAAKzR,EAAKyD,OAAOguB,EAAGhgB,MACvBA,EAAIggB,KAEDhgB,EAET,GAAI9R,IAAMsF,OAAOysB,mBAA2B,SAAN/xB,EAAc,CAElD,GAAI8R,EAMJ,OALAzR,GAAKiE,QAAQtC,EAAG,SAAUqD,GACxB,GAAIysB,GAAIzxB,EAAK0C,IAAIsC,KACZyM,GAAKzR,EAAK0D,QAAQ+tB,EAAGhgB,MACxBA,EAAIggB,KAEDhgB,EAET,GAAU,QAAN9R,EACA,MAAOqqB,GAAKroB,EAChB,IAAI+E,EAAS/G,KAAOsH,MAAMtH,GAAI,CAE5B,IAAKK,EAAKwD,MAAM7D,EAAG,GAAI,CAErB,GAAI8R,GAAI,CAIR,OAHAzR,GAAKiE,QAAQtC,EAAG,SAAUqD,GACxByM,EAAIzR,EAAK2C,IAAI3C,EAAKgD,IAAIhD,EAAK0C,IAAIsC,GAAQrF,GAAI8R,KAEtCzR,EAAKgD,IAAIyO,EAAG,EAAI9R,GAEzB,MAAOsF,QAAOusB,kBAGhB,KAAM,IAAIzxB,OAAM,+BAEb,GAAoB,GAAhB2wB,EAAM1qB,OAAa,CAE1B,GAAS,GAALrG,EAAQ,CAIV,IAAK,GAFDD,MAEKoG,EAAI,EAAGA,EAAInE,EAAEqE,OAAQF,IAG5B,IAAK,GAFD4C,GAAI/G,EAAEmE,GAED+a,EAAI,EAAGA,EAAInY,EAAE1C,OAAQ6a,IAC5BnhB,EAAEmhB,GAAK7gB,EAAK2C,IAAIjD,EAAEmhB,IAAM,EAAG7gB,EAAK0C,IAAIgG,EAAEmY,IAG1C,OAAO7gB,GAAKoE,IAAI1E,GAElB,GAAIC,GAAKsF,OAAOusB,mBAA2B,QAAN7xB,EAAa,CAIhD,IAAK,GAFD8R,GAAI,EAEC3L,EAAI,EAAGA,EAAInE,EAAEqE,OAAQF,IAAK,CAIjC,IAAK,GAHD6rB,GAAK,EACLjpB,EAAI/G,EAAEmE,GAED+a,EAAI,EAAGA,EAAInY,EAAE1C,OAAQ6a,IAC5B8Q,EAAK3xB,EAAK2C,IAAIgvB,EAAI3xB,EAAK0C,IAAIgG,EAAEmY,IAE3B7gB,GAAKyD,OAAOkuB,EAAIlgB,KAClBA,EAAIkgB,GAER,MAAOlgB,GAET,GAAU,QAAN9R,EAAa,CAEf,GAAI4R,GAAIvR,EAAK+qB,KAAK/qB,EAAK+C,SAAS/C,EAAKqrB,UAAU1pB,GAAIA,IAC/C8X,EAAI,CAIR,OAHAzZ,GAAKiE,QAAQsN,EAAG,SAAUvM,GACxByU,EAAIzZ,EAAK2C,IAAIqC,EAAOyU,KAEfzZ,EAAKiD,KAAKwW,GAEnB,GAAS,GAAL9Z,EAEF,KAAM,IAAII,OAAM,6FAGlB,MAAM,IAAIA,OAAM,gCAIpB,GAAI4B,YAAaN,GACf,MAAO2oB,GAAKroB,EAAEuD,UAAWvF,EAG3B,MAAM,IAAIK,GAAKiB,MAAMqf,qBAAqB,OAAQ3e,MAOjD,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA6HzB,QAAS4xB,GAASlsB,EAAG/G,GACnB,GAAIkzB,GAAiBhtB,QAARlG,EAAqBA,EAAO,EACrC4E,EAAc,EAARsuB,CAGV,IAFItuB,IAAKsuB,GAASA,GAEL,GAATA,EAAY,KAAM,IAAI9xB,OAAM,wBAChC,IAAQ,EAAJ2F,GAAUkB,KAAKlE,IAAImvB,GAAS,GAAK,EAAI,KAAM,IAAI9xB,OAAM,uCAGzD,IAAS,GAAL2F,EAAQ,MAAO,EACnB,KAAKT,OAAOiD,SAASxC,GACnB,MAAOnC,GAAM,EAAImC,CAGnB,IAAIrF,GAAU,MACVsB,EAAI,EACJmE,EAAI,EACJgsB,EAAO,GACX,GAAG,CACD,GAAIC,IAASrsB,EAAIkB,KAAK5D,IAAIrB,EAAGkwB,EAAQ,GAAKlwB,GAAKkwB,CAC/ClwB,IAAQowB,EACRjsB,UAEKc,KAAKlE,IAAIqvB,GAAS1xB,GAAeyxB,EAAJhsB,EAEpC,OAAOvC,GAAM,EAAI5B,EAAIA,EAUvB,QAASqwB,GAAYtsB,EAAG/G,GACtB,GAAIkzB,GAAiBhtB,QAARlG,EAAqBA,EAAO,GAAI+B,GAAU,GACnDwvB,EAAO,GAAIxvB,GAAU,GACrBuxB,EAAM,GAAIvxB,GAAU,GACpB6C,EAAMsuB,EAAM9B,YAGhB,IAFIxsB,IAAKsuB,EAAQA,EAAMK,WAEnBL,EAAM1B,SAAU,KAAM,IAAIpwB,OAAM,wBACpC,IAAI2F,EAAEqqB,eAAiB8B,EAAMnvB,MAAMgkB,IAAI,GAAGlc,OAAO,GAAI,KAAM,IAAIzK,OAAM,uCAGrE,IAAI2F,EAAEyqB,SAAU,MAAOD,EACvB,KAAKxqB,EAAEwC,WAEL,MAAO3E,GAAM2sB,EAAOxqB,CAGtB,IAAI/D,GAAIswB,EACJnsB,EAAI,EACJgsB,EAAO,GACX,GAAG,CACD,GAAIK,GAAQxwB,EACRowB,EAAQrsB,EAAEka,IAAIje,EAAEqB,IAAI6uB,EAAMhE,MAAM,KAAKA,MAAMlsB,GAAGie,IAAIiS,EACtDlwB,GAAIA,EAAEutB,KAAK6C,GACXjsB,WAEMnE,EAAE6I,OAAO2nB,IAAcL,EAAJhsB,EAE3B,OAAOvC,GAAM0uB,EAAIrS,IAAIje,GAAKA,EA3L5B,GAAI4H,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAehf,EAAWgf,YA8B9BlhB,GAAKiqB,QAAU,QAASA,GAASvkB,EAAG/G,GAClC,GAAwB,GAApBkJ,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAAG,EAGtE,QAAO6B,UAAU7B,QACf,IAAK,GACH,GAAIU,EAAShB,GACX,MAAOksB,GAASlsB,EAEb,IAAIA,YAAahF,GACpB,MAAOsxB,GAAYtsB,EAEhB,IAAIwb,EAAaxb,GACpB,MAAOxD,GAAWif,QAAQxf,EAAGsoB,EAG/B,IAAI6D,EAAUpoB,IAAY,OAANA,EAClB,MAAOukB,IAASvkB,EAGlB,MAEF,KAAK,GACH,GAAIgB,EAAShB,GAAI,CACf,GAAIgB,EAAS/H,GACX,MAAOizB,GAASlsB,EAAG/G,EAEhB,IAAIA,YAAgB+B,GAIvB,MAFAgF,GAAIhF,EAAUK,QAAQ2E,GAElBA,YAAahF,GACRsxB,EAAYtsB,EAAG/G,GAIfizB,EAASlsB,EAAG/G,EAAKoD,gBAIzB,CAAA,GAAI2D,YAAahF,GAMpB,MAJIgG,GAAS/H,KACXA,EAAO+B,EAAUK,QAAQpC,IAGvBA,YAAgB+B,GACXsxB,EAAYtsB,EAAG/G,GAIfizB,EAASlsB,EAAE3D,WAAYpD,EAG7B,IAAIuiB,EAAaxb,KAAOwb,EAAaviB,GACxC,MAAOuD,GAAWkf,SAAS1b,EAAG/G,EAAMsrB,GAGtC,GAAI6D,EAAUpoB,IAAY,OAANA,EAClB,MAAOukB,IAASvkB,EAAG/G,EAErB,IAAImvB,EAAUnvB,IAAkB,OAATA,EACrB,MAAOsrB,GAAQvkB,GAAI/G,EAGrB,MAEF,SACE,KAAM,IAAIqB,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAAG,GAGxE,GAAI8nB,EAAUnsB,IAAY,OAANA,EAClB,MAA2B,IAApBkG,UAAU7B,OAAcikB,GAAStoB,EAAG8P,GAAKwY,GAAStoB,EAI3D,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU0F,GAAI1F,EAAK,UAAUrB,OAgFtF,SAASG,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAgFzB,QAASuyB,GAAazwB,EAAGsG,GAQvB,MAAOpF,GAAIE,EAASD,EAAInB,GAAIsG,IAU9B,QAASoqB,GAAU1wB,EAAGsG,GACpB,IAAKtB,EAAUsB,IAAU,EAAJA,EACnB,KAAM,IAAIjG,WAAU,mDAAqDiG,EAAI,IAG/E,IAAIwR,GAAIhO,EAAK9J,EACb,IAAgB,GAAZ8X,EAAEzT,OACJ,KAAM,IAAIjG,OAAM,2CAA6C0Z,EAAEzT,OAAS,eAE1E,IAAIyT,EAAE,IAAMA,EAAE,GACZ,KAAM,IAAI1Z,OAAM,sCAAwC0Z,EAAE,GAAK,IAAMA,EAAE,GAAK,IAK9E,KAFA,GAAI5K,GAAMvL,EAAImW,EAAE,IAAIvU,UAChBotB,EAAK3wB,EACFsG,GAAK,GACK,IAAN,EAAJA,KACH4G,EAAM9L,EAASuvB,EAAIzjB,IAErB5G,IAAM,EACNqqB,EAAKvvB,EAASuvB,EAAIA,EAEpB,OAAOzjB,GAUT,QAAS0jB,GAAY5wB,EAAGsG,GACtB,MAAO,IAAI5G,GAAOgxB,EAAU1wB,EAAEuD,UAAW+C,IAlI3C,GAAIxG,GAAQtC,EAAoB,KAC5BkC,EAASlC,EAAoB,GAC7B+B,EAAU/B,EAAoB,GAC9BwH,EAAYxH,EAAoB,GAAGwH,UACnC8E,EAAOtM,EAAoB,KAAKsM,KAEhC5I,EAAM1D,EAAoB,IAAIU,GAC9ByD,EAAMnE,EAAoB,IAAIU,GAC9BiD,EAAM3D,EAAoB,IAAIU,GAC9BkD,EAAW5D,EAAoB,IAAIU,GA6BnCmD,EAAMvB,EAAM,OACdutB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAItB,GAAUsB,IAAMtG,GAAK,EAChBiF,KAAK5D,IAAIrB,EAAGsG,GAGZmqB,EAAY,GAAIlxB,GAAQS,EAAG,GAAI,GAAIT,GAAQ+G,EAAG,KAIzDgnB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAItB,GAAUsB,IAAMtG,GAAK,EAChBA,EAAEqB,IAAIiF,GAGNmqB,EAAY,GAAIlxB,GAAQS,EAAEI,WAAY,GAAI,GAAIb,GAAQ+G,EAAElG,WAAY,KAI/EotB,mBAAoBiD,EAEpBI,gBAAiBH,EAEjBI,mBAAoB,SAAU9wB,EAAGsG,GAC/B,MAAOoqB,GAAU1wB,EAAGsG,EAAElG,aAGxB2wB,iBAAkBH,EAElBI,oBAAqB,SAAUhxB,EAAGsG,GAChC,MAAOsqB,GAAW5wB,EAAGsG,EAAElG,cAiE3B,OAAOiB,KAMJ,SAASlE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA+HzB,QAAS4yB,GAAa5tB,EAAOpE,GAC3B,GAAIjB,GAAIiH,KAAK5D,IAAI,GAAIpC,EACrB,OAAOgG,MAAKC,MAAM7B,EAAQrF,GAAKA,EAhIjC,GAAI4J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,UACxBmnB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YAiC9BlhB,GAAK6G,MAAQ,QAASA,GAAMlF,EAAG8P,GAC7B,GAAwB,GAApB5J,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAAG,EAGpE,IAASnB,QAAL4M,EAAgB,CAElB,GAAI/K,EAAS/E,GACX,MAAOiF,MAAKC,MAAMlF,EAGpB,IAAIgI,EAAUhI,GACZ,MAAO,IAAIT,GACP0F,KAAKC,MAAMlF,EAAEyG,IACbxB,KAAKC,MAAMlF,EAAE0G,IAInB,IAAI1G,YAAajB,GACf,MAAOiB,GAAEkxB,gBAAgB,EAG3B,IAAI3R,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGkF,EAG/B,IAAIinB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKC,MAAMlF,EAGpB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,IAIlE,IAAK+E,EAAS+K,KAAO9K,EAAU8K,GAAI,CACjC,KAAIA,YAAa/Q,IAGZ,CAAA,GAAIotB,EAAUrc,IAAY,OAAN9P,EACvB,MAAOkF,GAAMlF,GAAI8P,EAGjB,MAAM,IAAIzP,WAAU,2DANpByP,EAAI9J,WAAW8J,EAAEvM,WASrB,GAAQ,EAAJuM,GAASA,EAAI,GACf,KAAM,IAAI1R,OAAO,mEAGnB,IAAI2G,EAAS/E,GACX,MAAOixB,GAAYjxB,EAAG8P,EAGxB,IAAI9H,EAAUhI,GACZ,MAAO,IAAIT,GACP0xB,EAAYjxB,EAAEyG,GAAIqJ,GAClBmhB,EAAYjxB,EAAE0G,GAAIoJ,GAIxB,IAAI9P,YAAajB,GACf,MAAOiB,GAAEkxB,gBAAgBphB,EAG3B,IAAIyP,EAAavf,IAAMuf,EAAazP,GAClC,MAAOvP,GAAWkf,SAASzf,EAAG8P,EAAG5K,EAGnC,IAAIinB,EAAUnsB,IAAY,OAANA,EAClB,MAAOkF,IAAOlF,EAAG8P,EAGnB,MAAM,IAAIzR,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUyR,OAoBtF,SAAS3S,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCgB,EAASoJ,EAAKpJ,OACduG,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YAgC9BlhB,GAAK8G,KAAO,QAASA,GAAKnF,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAOxB,GAAO2G,KAAKnF,EAGrB,IAAIgI,EAAUhI,GAAI,CAChB,GAAIe,GAAMkE,KAAK3D,KAAKtB,EAAEyG,GAAKzG,EAAEyG,GAAKzG,EAAE0G,GAAK1G,EAAE0G,GAC3C,OAAO,IAAInH,GAAQS,EAAEyG,GAAK1F,EAAKf,EAAE0G,GAAK3F,GAGxC,GAAIf,YAAajB,GACf,MAAO,IAAIA,GAAUiB,EAAEmxB,IAAI,GAG7B,IAAI5R,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGmF,EAG/B,IAAIgnB,EAAUnsB,IAAY,OAANA,EAClB,MAAOxB,GAAO2G,KAAKnF,EAGrB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WAuDf,QAASk0B,GAAYpxB,GACnB,MAAIA,IAAK,EACAiF,KAAK3D,KAAKtB,GAGVqxB,EAAa,GAAI9xB,GAAQS,EAAG,IAUvC,QAASqxB,GAAarxB,GACpB,GAEIyG,GAAIC,EAFJK,EAAI9B,KAAK3D,KAAKtB,EAAEyG,GAAKzG,EAAEyG,GAAKzG,EAAE0G,GAAK1G,EAAE0G,GAkBzC,OAbED,GADEzG,EAAEyG,IAAM,EACL,GAAMxB,KAAK3D,KAAK,GAAOyF,EAAI/G,EAAEyG,KAG7BxB,KAAKlE,IAAIf,EAAE0G,IAAMzB,KAAK3D,KAAK,GAAKyF,EAAI/G,EAAEyG,KAI3CC,EADE1G,EAAEyG,IAAM,EACL,GAAMxB,KAAK3D,KAAK,GAAOyF,EAAI/G,EAAEyG,KAG7BxB,KAAKlE,IAAIf,EAAE0G,IAAMzB,KAAK3D,KAAK,GAAKyF,EAAI/G,EAAEyG,KAGzCzG,EAAE0G,IAAM,EACH,GAAInH,GAAQkH,EAAIC,GAGhB,GAAInH,GAAQkH,GAAKC,GA5F5B,GAAI5G,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IACjC+B,EAAU/B,EAAoB,GA0B9B8D,EAAOxB,EAAM,QACftB,OAAU4yB,EAEV7xB,QAAW8xB,EAEXtyB,UAAa,SAAUiB,GACrB,MAAIA,GAAEouB,aAEGgD,EAAYpxB,EAAEI,YAGdJ,EAAEsB,QAIb6rB,iBAAkB,SAAUC,GAC1B,MAAO7sB,GAAWif,QAAQ4N,EAAM9rB,KAoDpC,OAAOA,KAMJ,SAASnE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,YA4B9BlhB,GAAKkqB,OAAS,QAASA,GAAOvoB,GAC5B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAGlE,IAAIU,EAAS/E,GACX,MAAOA,GAAIA,CAGb,IAAIgI,EAAUhI,GACZ,MAAO3B,GAAK+C,SAASpB,EAAGA,EAG1B,IAAIA,YAAajB,GACf,MAAOiB,GAAE6tB,MAAM7tB,EAGjB,IAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGuoB,EAG/B,IAAI4D,EAAUnsB,IAAY,OAANA,EAClB,MAAOA,GAAIA,CAGb,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAU2B,OAOlE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5B+B,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAmCjC+D,EAAWzB,EAAM,YACnButB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,GAAIsG,GAGbknB,mBAAoB,SAAUxtB,EAAGsG,GAC/B,MAAO,IAAI/G,GACPS,EAAEyG,GAAKH,EAAEG,GACTzG,EAAE0G,GAAKJ,EAAEI,KAIf4mB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAEksB,MAAM5lB,IAGjBmnB,aAAc,SAAUztB,EAAGsG,GACzB,GAAe,MAAXtG,EAAEqD,MACJ,KAAM,IAAIjF,OAAM,mDAGlB,IAAe,MAAXkI,EAAEjD,MACJ,KAAM,IAAIjF,OAAM,mDAGlB,KAAK4B,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,qBAGlB,IAAI8O,GAAMlN,EAAEd,OAIZ,OAHAgO,GAAI7J,OAASiD,EAAEjD,MACf6J,EAAIO,WAAY,EAETP,GAGTwgB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG/E,IAGnCosB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG/E,KAIrC,OAAOA,KAMJ,SAASpE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5B+B,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAyBjCgE,EAAa1B,EAAM,cACrBtB,OAAU,SAAUwB,GAClB,OAAQA,GAGVT,QAAW,SAAUS,GACnB,MAAO,IAAIT,IACNS,EAAEyG,IACFzG,EAAE0G,KAIT3H,UAAa,SAAUiB,GACrB,MAAOA,GAAEyuB,OAGX9uB,KAAQ,SAAUK,GAChB,GAAIkN,GAAMlN,EAAEd,OAEZ,OADAgO,GAAI7J,OAASrD,EAAEqD,MACR6J,GAGTigB,iBAAkB,SAAUntB,GAC1B,MAAOO,GAAWif,QAAQxf,EAAGwB,KAIjC,OAAOA,KAMJ,SAASrE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA0B9BlhB,GAAKmqB,UAAY,QAASA,GAAUxoB,GAClC,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,IAAIU,EAAS/E,GACX,MAAOA,EAGT,IAAIgI,EAAUhI,GACZ,MAAOA,GAAEd,OAGX,IAAIc,YAAajB,GACf,MAAOiB,EAGT,IAAI6H,EAAO7H,GACT,MAAOA,GAAEd,OAGX,IAAIqgB,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGwoB,EAG/B,IAAI2D,EAAUnsB,IAAM8H,EAAS9H,IAAY,OAANA,EAEjC,MAAyB,aAAjB9B,EAAOM,OAAyB,GAAIO,IAAWiB,IAAKA,CAG9D,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,YAAatgB,EAAK,UAAU2B,OAOrE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAkG/B,QAASozB,GAAMvtB,EAAGC,GAQhB,IANA,GAAI2qB,GACA4C,EACAxqB,EACA/G,EAAI,EAAGwxB,EAAQ,EACflrB,EAAI,EAAGmrB,EAAQ,EAEZztB,GACLutB,EAAItsB,KAAKgjB,MAAMlkB,EAAIC,GACnB+C,EAAIhD,EAAIC,EAER2qB,EAAI3uB,EACJA,EAAIwxB,EAAQD,EAAIvxB,EAChBwxB,EAAQ7C,EAERA,EAAIroB,EACJA,EAAImrB,EAAQF,EAAIjrB,EAChBmrB,EAAQ9C,EAER5qB,EAAIC,EACJA,EAAI+C,CAGN,IAAImG,EAOJ,OALEA,GADM,EAAJnJ,IACMA,GAAIytB,GAAQC,IAGb1tB,EAAGA,EAAIytB,EAAQ,EAAGC,GAED,UAAlBvzB,EAAOK,OAAsB2O,EAAM,GAAIxN,GAAOwN,GAUxD,QAASwkB,GAAS3tB,EAAGC,GASnB,IAPA,GAAI2qB,GACA4C,EACAxqB,EACAwnB,EAAO,GAAIxvB,GAAU,GACrBiB,EAAI,GAAIjB,GAAU,GAAIyyB,EAAQ,GAAIzyB,GAAU,GAC5CuH,EAAI,GAAIvH,GAAU,GAAI0yB,EAAQ,GAAI1yB,GAAU,IAExCiF,EAAEwqB,UACR+C,EAAIxtB,EAAEka,IAAIja,GAAGikB,QACblhB,EAAIhD,EAAEghB,IAAI/gB,GAEV2qB,EAAI3uB,EACJA,EAAIwxB,EAAMtF,MAAMqF,EAAE1D,MAAM7tB,IACxBwxB,EAAQ7C,EAERA,EAAIroB,EACJA,EAAImrB,EAAMvF,MAAMqF,EAAE1D,MAAMvnB,IACxBmrB,EAAQ9C,EAER5qB,EAAIC,EACJA,EAAI+C,CAGN,IAAImG,EAOJ,OALEA,GADEnJ,EAAE0Y,GAAG8R,IACAxqB,EAAE0qB,MAAO+C,EAAM/C,MAAOgD,EAAMhD,QAG5B1qB,EAAIA,EAAEyqB,SAAmB,EAARgD,EAAWC,GAEX,UAAlBvzB,EAAOK,OAAsB2O,EAAM,GAAIxN,GAAOwN,GA1KxD,GAAItF,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAC7BuB,EAAYV,EAAKS,KAAKC,UAEtBgG,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,SAyB5B3G,GAAKoqB,KAAO,QAASA,GAAK1kB,EAAGC,GAC3B,GAAwB,GAApBkC,UAAU7B,OAAa,CAEzB,GAAIU,EAAShB,IAAMgB,EAASf,GAAI,CAC9B,IAAKgB,EAAUjB,KAAOiB,EAAUhB,GAC9B,KAAM,IAAI5F,OAAM,sDAGlB,OAAOkzB,GAAMvtB,EAAGC,GAGlB,GAAID,YAAahF,GASf,MAPIgG,GAASf,GACXA,EAAIjF,EAAUK,QAAQ4E,IAEfmoB,EAAUnoB,IAAY,OAANA,KACvBA,EAAI,GAAIjF,GAAUiF,EAAI,EAAI,IAGxBA,YAAajF,GACR2yB,EAAS3tB,EAAGC,GAIdykB,EAAK1kB,EAAE3D,WAAY4D,EAE5B,IAAIA,YAAajF,GASf,MAPIgG,GAAShB,GACXA,EAAIhF,EAAUK,QAAQ2E,IAEfooB,EAAUpoB,IAAY,OAANA,KACvBA,EAAI,GAAIhF,GAAUgF,EAAI,EAAI,IAGxBA,YAAahF,GACR2yB,EAAS3tB,EAAGC,GAIdykB,EAAK1kB,EAAE3D,WAAY4D,EAG5B,IAAImoB,EAAUpoB,IAAY,OAANA,EAClB,MAAO0kB,IAAM1kB,EAAGC,EAElB,IAAImoB,EAAUnoB,IAAY,OAANA,EAClB,MAAOykB,GAAK1kB,GAAIC,EAGlB,MAAM,IAAI3F,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU0F,GAAI1F,EAAK,UAAU2F,IAItF,KAAM,IAAI2C,aAAY,0CA0FrB,SAASxJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WACf,GAAI4C,GAAQtC,EAAoB,KAC5BwH,EAAYxH,EAAoB,GAAGwH,UACnC2sB,EAAYn0B,EAAoB,KAAK4pB,IACrC7mB,EAAa/C,EAAoB,IAwBjCiE,EAAS3B,EAAM,UACjButB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,wDAGlB,OAAO4B,GAAIsG,GAGbgnB,uBAAwBqE,EAExBjE,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG7E,IAGnCksB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG7E,KAIrC,OAAOA,KAMJ,SAAStE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBwB,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,aAE1BqS,EAAYhqB,EAAK+V,UAAUsH,GAwB/B5mB,GAAKqqB,OAAS,QAASA,GAAO1oB,GAC5B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAGlE,IAAIU,EAAS/E,GAAI,CACf,IAAKgF,EAAUhF,GACb,KAAM,IAAI5B,OAAM,uDAGlB,QAAQ4B,EAGV,GAAIA,YAAajB,GACf,MAAO6yB,GAAU5xB,EAGnB,IAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG0oB,EAG/B,IAAIyD,EAAUnsB,IAAY,OAANA,EAClB,MAAO0oB,IAAQ1oB,EAGjB,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAU2B,OAOlE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBwB,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,aAE1BsS,EAAWjqB,EAAK+V,UAAU2J,EAyB9BjpB,GAAKsqB,MAAQ,QAASA,GAAM3oB,EAAGsG,GAC7B,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAAI,CAC9B,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,uDAGlB,OAAO4B,GAAIsG,EAGb,GAAIiZ,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGqiB,EAGnC,IAAIwD,EAAUnsB,IAAY,OAANA,EAClB,MAAO2oB,IAAO3oB,EAAGsG,EAEnB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOqiB,GAAM3oB,GAAIsG,EAGnB,IAAItG,YAAajB,GAMf,MAJIgG,GAASuB,KACXA,EAAIvH,EAAUK,QAAQkH,IAGpBA,YAAavH,GACR8yB,EAAS7xB,EAAGsG,GAIdqiB,EAAM3oB,EAAEI,WAAYkG,EAE7B,IAAIA,YAAavH,GAMf,MAJIgG,GAAS/E,KACXA,EAAIjB,EAAUK,QAAQY,IAGpBA,YAAajB,GACR8yB,EAAS7xB,EAAGsG,GAIdqiB,EAAM3oB,EAAGsG,EAAElG,WAGpB,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOpF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBwB,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,aAE1BuS,EAAYlqB,EAAK+V,UAAU0J,GAwB/BhpB,GAAKuqB,OAAS,QAASA,GAAO5oB,EAAGsG,GAC/B,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAGlE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAAI,CAC9B,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,wDAGlB,OAAO4B,GAAIsG,EAGb,GAAIiZ,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGsiB,EAGnC,IAAIuD,EAAUnsB,IAAY,OAANA,EAClB,MAAO4oB,IAAQ5oB,EAAGsG,EAEpB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOsiB,GAAO5oB,GAAIsG,EAGpB,IAAItG,YAAajB,GAMf,MAJIgG,GAASuB,KACXA,EAAIvH,EAAUK,QAAQkH,IAGpBA,YAAavH,GACR+yB,EAAU9xB,EAAGsG,GAIfsiB,EAAO5oB,EAAEI,WAAYkG,EAE9B,IAAIA,YAAavH,GAMf,MAJIgG,GAAS/E,KACXA,EAAIjB,EAAUK,QAAQY,IAGpBA,YAAajB,GACR+yB,EAAU9xB,EAAGsG,GAIfsiB,EAAO5oB,EAAGsG,EAAElG,WAGrB,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOrF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBwB,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,aAE1BwS,EAAenqB,EAAK+V,UAAUkL,SAyBlCxqB,GAAKwqB,UAAY,QAASA,GAAU7oB,EAAGsG,GACrC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,IAAIU,EAAS/E,GAAI,CACf,GAAI+E,EAASuB,GAAI,CACf,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,2DAGlB,OAAO4B,IAAKsG,EAGd,GAAIA,YAAavH,GACf,MAAOgzB,GAAahzB,EAAUK,QAAQY,GAAIsG,GAG9C,GAAIvB,EAASuB,GAAI,CACf,GAAIC,SAASD,KAAOtB,EAAUsB,GAC5B,KAAM,IAAIlI,OAAM,2DAGlB,IAAI4B,YAAajB,GAAW,CAC1B,GAAIiB,EAAEuG,aAAevG,EAAEgF,YACrB,KAAM,IAAI5G,OAAM,2DAGlB,OAAI4B,GAAEsF,SAAWA,MAAMgB,IAAU,EAAJA,EACpB,GAAIvH,GAAU8e,KAGd,GAALvX,GAAUtG,EAAEwuB,SACPxuB,EAEAqF,KAALiB,GAAkBtG,EAAEuG,WAKhB,GAAJD,EACKtG,EAAE6tB,MAAM5oB,KAAK5D,IAAI,EAAGiF,GAAK,KAGlCA,EAAIvH,EAAUK,QAAQkH,GACfyrB,EAAa/xB,EAAGsG,IATd,GAAIvH,GAAU8e,MAa3B,GAAI0B,EAAavf,IAAM+E,EAASuB,GAC9B,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGuiB,EAGnC,IAAIsD,EAAUnsB,IAAY,OAANA,EAClB,MAAO6oB,IAAW7oB,EAAGsG,EAEvB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOuiB,GAAU7oB,GAAIsG,EAGvB,IAAItG,YAAajB,GACf,MAAIuH,aAAavH,GACRgzB,EAAa/xB,EAAGsG,GAIlBuiB,EAAU7oB,EAAEI,WAAYkG,EAEjC,IAAIA,YAAavH,GAEf,MAAO8pB,GAAU7oB,EAAGsG,EAAElG,WAGxB,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,YAAatgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOxF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBwB,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,aAE1ByS,EAAgBpqB,EAAK+V,UAAUsU,UAyBnC5zB,GAAKyqB,gBAAkB,QAASA,GAAgB9oB,EAAGsG,GACjD,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,kBAAmBvY,UAAU7B,OAAQ,EAG3E,IAAIU,EAAS/E,GAAI,CACf,GAAI+E,EAASuB,GAAI,CACf,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,iEAGlB,OAAO4B,IAAKsG,EAGd,GAAIA,YAAavH,GACf,MAAOizB,GAAcjzB,EAAUK,QAAQY,GAAIsG,GAG/C,GAAIvB,EAASuB,GAAI,CACf,GAAIC,SAASD,KAAOtB,EAAUsB,GAC5B,KAAM,IAAIlI,OAAM,iEAGlB,IAAI4B,YAAajB,GAAW,CAC1B,GAAIiB,EAAEuG,aAAevG,EAAEgF,YACrB,KAAM,IAAI5G,OAAM,iEAGlB,OAAI4B,GAAEsF,SAAWA,MAAMgB,IAAU,EAAJA,EACpB,GAAIvH,GAAU8e,KAEdxY,KAALiB,EAEO,GAAIvH,GADTiB,EAAEouB,aACiB,GAElBpuB,EAAEuG,WAGc,EAFEsX,KAMjB,GAAJvX,EACKtG,EAAEie,IAAIhZ,KAAK5D,IAAI,EAAGiF,GAAK,IAAI2hB,SAGpC3hB,EAAIvH,EAAUK,QAAQkH,GACf0rB,EAAchyB,EAAGsG,KAI5B,GAAIiZ,EAAavf,IAAM+E,EAASuB,GAC9B,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGwiB,EAGnC,IAAIqD,EAAUnsB,IAAY,OAANA,EAClB,MAAO8oB,IAAiB9oB,EAAGsG,EAE7B,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOwiB,GAAgB9oB,GAAIsG,EAG7B,IAAItG,YAAajB,GACf,MAAIuH,aAAavH,GACRizB,EAAchyB,EAAGsG,GAInBwiB,EAAgB9oB,EAAEI,WAAYkG,EAEvC,IAAIA,YAAavH,GAEf,MAAO+pB,GAAgB9oB,EAAGsG,EAAElG,WAG9B,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,kBAAmBtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAO9F,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAI3B+C,GAFS/C,EAAoB,GACtBA,EAAoB,GACdA,EAAoB,KAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnnB,EAAY4C,EAAKpJ,OAAOwG,UACxBD,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,YAyB9BlhB,GAAK0qB,cAAgB,QAASA,GAAc/oB,EAAGsG,GAC7C,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,gBAAiBvY,UAAU7B,OAAQ,EAGzE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAAI,CAC9B,IAAKtB,EAAUhF,KAAOgF,EAAUsB,GAC9B,KAAM,IAAIlI,OAAM,+DAGlB,OAAO4B,KAAMsG,EAGf,GAAIiZ,EAAavf,IAAM+E,EAASuB,GAC9B,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGyiB,EAGnC,IAAIoD,EAAUnsB,IAAY,OAANA,EAClB,MAAO+oB,IAAe/oB,EAAGsG,EAE3B,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAOyiB,GAAc/oB,GAAIsG,EAG3B,MAAM,IAAIjI,GAAKiB,MAAMqf,qBAAqB,gBAAiBtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAO5F,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAehf,EAAWgf,aAC1BvX,EAAYzI,EAAQyI,SA6BxB3J,GAAKuI,IAAM,QAASA,GAAI5G,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAOiF,MAAK2D,MAAM,EAAG5I,EAGvB,IAAIgI,EAAUhI,GACZ,MAAOiF,MAAK2D,MAAM5I,EAAE0G,GAAI1G,EAAEyG,GAG5B,IAAI8Y,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG4G,EAG/B,IAAIulB,EAAUnsB,IAAY,OAANA,EAClB,MAAO4G,IAAK5G,EAGd,IAAIA,YAAajB,GAGf,MAAO6H,GAAI5G,EAAEI,WAGf,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCoB,EAASgJ,EAAKhJ,OACdmG,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAchf,EAAWgf,aACzBvX,EAAYzI,EAAQyI,SA2BxB3J,GAAK2qB,KAAO,QAASA,GAAKhpB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,OAAIU,GAAS/E,GACJA,EAGLA,YAAajB,GACR,GAAIA,GAAUiB,GAGnBgI,EAAUhI,GACL,GAAIT,GAAQS,EAAEyG,IAAKzG,EAAE0G,IAG1B6Y,EAAavf,GACRO,EAAWif,QAAQxf,EAAGgpB,GAG3BmD,EAAUnsB,IAAY,OAANA,GACVA,EAIHpB,EAAOM,MAAMc,MAOnB,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCoB,EAASgJ,EAAKhJ,OACdmG,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAehf,EAAWgf,aAC1BvX,EAAYzI,EAAQyI,SA6BxB3J,GAAKoI,GAAK,QAASA,GAAGzG,GACpB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,KAAMvY,UAAU7B,OAAQ,EAG9D,OAAIU,GAAS/E,GACJA,EAGLA,YAAajB,GACR,GAAIA,GAAUiB,GAGnBgI,EAAUhI,GACLA,EAAEyG,GAGP8Y,EAAavf,GACRO,EAAWif,QAAQxf,EAAGyG,GAG3B0lB,EAAUnsB,IAAY,OAANA,GACVA,EAIHpB,EAAOM,MAAMc,MAOnB,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5B5M,EAAchf,EAAWgf,aACzBvX,EAAYzI,EAAQyI,SA6BxB3J,GAAKqI,GAAK,QAASA,GAAG1G,GACpB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,KAAMvY,UAAU7B,OAAQ,EAG9D,OAAIU,GAAS/E,GACJ,EAGLA,YAAajB,GACR,GAAIA,GAAU,GAGnBiJ,EAAUhI,GACLA,EAAE0G,GAGP6Y,EAAavf,GACRO,EAAWif,QAAQxf,EAAG0G,IAG3BylB,EAAUnsB,IAAY,OAANA,EAApB,MAYC,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAG3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1Bxa,EAAW6C,EAAKpJ,OAAOuG,SACvB+C,EAAWF,EAAKG,OAAOD,SACvBqkB,EAAYvkB,EAAK,WAAWukB,SA2BhC9tB,GAAKsf,UAAY,QAASA,GAAUta,GAClC,GAAI6C,UAAU7B,OAAS,EACrB,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAAG,EAGxE,IAAIU,EAAS1B,GAEX,MAAO,IAAItE,GAAUsE,EAAQ,GAG/B,IAAIyE,EAASzE,GACX,MAAO,IAAItE,GAAUsE,EAGvB,IAAIA,YAAiBtE,GACnB,MAAOsE,EAGT,IAAI8oB,EAAU9oB,IAAoB,OAAVA,EACtB,MAAO,IAAItE,IAAWsE,EAGxB,IAAIkc,EAAalc,GACf,MAAO9C,GAAWif,QAAQnc,EAAOsa,EAGnC,IAAwB,GAApBzX,UAAU7B,OACZ,MAAO,IAAItF,GAAU,EAGvB,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,YAAatgB,EAAK,UAAUgF,OAOrE,SAASlG,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1Bxa,EAAW6C,EAAKpJ,OAAOuG,SACvB+C,EAAWF,EAAKG,OAAOD,QA6B3BzJ,GAAK,WAAa,QAAS6zB,GAAM7uB,GAC/B,GAAwB,GAApB6C,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAAG,EAGtE,IAAc,SAAVhB,GAAoBA,KAAU,EAChC,OAAO,CAGT,IAAc,UAAVA,GAAqBA,KAAU,GAAmB,OAAVA,EAC1C,OAAO,CAGT,IAAIA,YAAiBI,SACnB,MAAgB,IAATJ,CAGT,IAAI0B,EAAS1B,GACX,MAAkB,KAAVA,CAGV,IAAIA,YAAiBtE,GACnB,OAAQsE,EAAMmrB,QAGhB,IAAI1mB,EAASzE,GAAQ,CAEnB,GAAI8uB,GAAQ9uB,EAAM+uB,aAClB,IAAc,SAAVD,EACF,OAAO,CAEJ,IAAc,UAAVA,EACP,OAAO,CAIT,IAAIvoB,GAAMtG,OAAOD,EACjB,IAAa,IAATA,IAAgBiC,MAAMsE,GACxB,MAAgB,KAARA,EAIZ,GAAI2V,EAAalc,GACf,MAAO9C,GAAWif,QAAQnc,EAAO6uB,EAGnC,MAAM,IAAIvrB,aAAYtD,EAAM4F,WAAa,2BAOxC,SAAS9L,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1Bxa,EAAW6C,EAAKpJ,OAAOuG,SACvB+C,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,SAwCxB3J,GAAK4qB,QAAU,QAASA,KACtB,OAAQ/iB,UAAU7B,QAChB,IAAK,GAEH,MAAO,IAAI9E,GAAQ,EAAG,EAExB,KAAK,GAEH,GAAIqH,GAAMV,UAAU,EAEpB,IAAInB,EAAS6B,GACX,MAAO,IAAIrH,GAAQqH,EAAK,EAG1B,IAAIA,YAAe7H,GAEjB,MAAO,IAAIQ,GAAQqH,EAAIxG,WAAY,EAGrC,IAAI4H,EAAUpB,GAEZ,MAAOA,GAAI1H,OAGb,IAAI4I,EAASlB,GAAM,CACjB,GAAI7I,GAAIwB,EAAQmB,MAAMkG,EACtB,IAAI7I,EACF,MAAOA,EAGP,MAAM,IAAI4I,aAAY,WAAaC,EAAM,gCAI7C,GAAI2Y,EAAa3Y,GACf,MAAOrG,GAAWif,QAAQ5Y,EAAKqiB,EAGjC,IAAmB,gBAARriB,GAAkB,CAC3B,GAAG,MAAQA,IAAO,MAAQA,GACxB,MAAO,IAAIrH,GAAQqH,EAAIH,GAAIG,EAAIF,GAC1B,IAAI,KAAOE,IAAO,OAASA,GAChC,MAAOrH,GAAQuH,UAAUF,EAAIG,EAAGH,EAAII,KAIxC,KAAM,IAAI3G,WAAU,+EAEtB,KAAK,GAEH,GAAIoG,GAAKP,UAAU,GACfQ,EAAKR,UAAU,EAYnB,IATIO,YAAc1H,KAChB0H,EAAKA,EAAGrG,YAINsG,YAAc3H,KAChB2H,EAAKA,EAAGtG,YAGN2E,EAAS0B,IAAO1B,EAAS2B,GAC3B,MAAO,IAAInH,GAAQkH,EAAIC,EAGvB,MAAM,IAAIrG,WAAU,8DAGxB,SACE,KAAM,IAAIhC,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAAG,OAQvE,SAASlH,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAEIU,IAFOvB,EAAoB,KAEfa,EAAKS,KAAKC,WACtBU,EAAQjC,EAAoB,EAyChCa,GAAKkE,MAAQ,WAEX,GAAIgH,GAAOpG,MAAMuF,UAAUskB,MAAMriB,MAAMzE,WAAW1D,IAAI,SAAUoE,GAC9D,MAAIA,aAAe7H,GACV6H,EAAIxG,WAEJ+C,MAAMC,QAAQwD,GACdA,EAAIpE,IAAI,SAAUmK,GACvB,MAAQA,aAAgB5N,GAAa4N,EAAKvM,WAAauM,IAIlD/F,IAIPsG,EAAM,GAAIzN,EAEd,OADAA,GAAMkL,MAAMuC,EAAK3D,GACV2D,KAON,SAAS/P,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GACIqB,IADOlC,EAAoB,KAClBA,EAAoB,GA2BjCa,GAAKE,OAAS,SAAgB2M,GAC5B,GAAIhF,UAAU7B,OAAS,EACrB,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,EAGrE,OAAO,IAAI3E,GAAOwL,MAOjB,SAAS/N,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBY,EAAOtB,EAAKS,KAAKa,KACjBY,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1Bxa,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,QA2B3BzJ,GAAKG,OAAS,QAASA,GAAQ6E,EAAOmL,GACpC,OAAQtI,UAAU7B,QAChB,IAAK,GACH,MAAO,EAET,KAAK,GACH,GAAIkb,EAAalc,GACf,MAAO9C,GAAWif,QAAQnc,EAAO7E,EAGnC,IAAI6E,YAAiBtE,GACnB,MAAOsE,GAAMjD,UAGf,IAAI0H,EAASzE,GAAQ,CACnB,GAAIuG,GAAMtG,OAAOD,EAIjB,IAHIiC,MAAMsE,KACRA,EAAMtG,OAAOD,EAAME,YAEjB+B,MAAMsE,GACR,KAAM,IAAIjD,aAAYtD,EAAM4F,WAAa,sBAE3C,OAAOW,GAGT,GAAIuiB,EAAU9oB,IAAoB,OAAVA,EACtB,OAAQA,CAGV,IAAI0B,EAAS1B,GACX,MAAOA,EAGT,IAAIA,YAAiB1D,GACnB,KAAM,IAAIvB,OAAM,+CAGlB,MAAM,IAAIC,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUgF,GAErE,KAAK,GACH,GAAIA,YAAiB1D,IAAQmI,EAAS0G,IAAkBA,YAAyB7O,GAC/E,MAAO0D,GAAMjD,SAASoO,EAGxB,MAAM,IAAInQ,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUgF,GAAQhF,EAAK,UAAUmQ,GAG5F,SACE,KAAM,IAAInQ,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,OAQtE,SAASlH,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIsC,GAASnD,EAAoB,GA6CjCa,GAAKif,OAAS,WACZ,MAAO,IAAI3c,GAAOtC,MAOjB,SAASlB,GAEd,YAEAA,GAAOD,QAAU,SAAUmB,GAoCzBA,EAAKwV,MAAQ,SAASxQ,GAEpB,MAAO,IAAIhF,GAAKwE,SAASC,MAAMO,IAIjChF,EAAKg0B,OAAS,SAAShvB,GAUrB,MARIivB,UAAkC,kBAAhBA,SAAQnxB,KAC5BmxB,QAAQnxB,IAAI,oFAId9C,EAAKg0B,OAASh0B,EAAKwV,MACnBxV,EAAKwE,SAASC,MAAM4F,UAAkB,OAAIrK,EAAKg0B,OAExCh0B,EAAKwV,MAAMxQ,MAOjB,SAASlG,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3B+C,EAAa/C,EAAoB,IAEjCgB,EAASoJ,EAAKpJ,OACduG,EAAW6C,EAAKpJ,OAAOuG,SACvBwa,EAAehf,EAAWgf,YA2B9BlhB,GAAK0J,OAAS,QAASA,GAAQ1E,GAC7B,OAAQ6C,UAAU7B,QAChB,IAAK,GACH,MAAO,EAET,KAAK,GACH,MAAIU,GAAS1B,GACJ7E,EAAO4G,OAAO/B,GAGnBkc,EAAalc,GACR9C,EAAWif,QAAQnc,EAAO0E,GAGrB,OAAV1E,EACK,OAGFA,EAAM4F,UAEf,SACE,KAAM,IAAI5K,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,OAQtE,SAASlH,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBY,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1BzX,EAAWF,EAAKG,OAAOD,QAyB3BzJ,GAAK+O,KAAO,QAASA,GAAK7D,GACxB,OAAOrD,UAAU7B,QACf,IAAK,GAEH,GAAIuC,GAAMV,UAAU,EAEpB,IAAIU,YAAejH,GAEjB,MAAOiH,GAAI1H,OAGb,IAAI4I,EAASlB,GAAM,CACjB,GAAIjH,EAAK0O,gBAAgBzH,GACvB,MAAO,IAAIjH,GAAK,KAAMiH,EAGxB,IAAIiJ,GAAIlQ,EAAKe,MAAMkG,EACnB,IAAIiJ,EACF,MAAOA,EAGT,MAAM,IAAIlJ,aAAY,WAAaC,EAAM,sBAG3C,GAAI2Y,EAAahW,GACf,MAAOhJ,GAAWif,QAAQjW,EAAM6D,EAGlC,MAAM,IAAI/M,WAAU,4DAEtB,KAAK,GAGH,MAAI6F,WAAU,YAAcnH,GAEnB,GAAIY,GAAKuG,UAAU,GAAG9F,WAAY8F,UAAU,IAG5C,GAAIvG,GAAKuG,UAAU,GAAIA,UAAU,GAG5C,SACE,KAAM,IAAI7H,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAAG,OAQpE,SAASlH,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA8B9BlhB,GAAK+oB,IAAM,QAASA,GAAIpnB,EAAGsG,GACzB,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,KAAKU,EAAS/E,IAAMmsB,EAAUnsB,IAAY,OAANA,KAC/B+E,EAASuB,IAAM6lB,EAAU7lB,IAAY,OAANA,GAClC,SAAUtG,IAAKsG,EAGjB,IAAI0B,EAAUhI,GACZ,MAAY,IAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,IACV,EAGF0gB,GAAI,EAAM9gB,EAEnB,IAAI0B,EAAU1B,GACZ,MAAY,IAARA,EAAEG,IAAmB,GAARH,EAAEI,IACV,EAGF0gB,EAAIpnB,GAAG,EAGhB,IAAIA,YAAajB,GACf,MAAIiB,GAAEwuB,UAAYxuB,EAAEsF,SACX,EAGF8hB,GAAI,EAAM9gB,EAEnB,IAAIA,YAAavH,GACf,MAAIuH,GAAEkoB,UAAYloB,EAAEhB,SACX,EAGF8hB,EAAIpnB,GAAG,EAGhB,IAAI6H,EAAO7H,GACT,MAAgB,QAAZA,EAAEqD,OAA6B,GAAXrD,EAAEqD,OACjB,EAGF+jB,GAAI,EAAM9gB,EAEnB,IAAIuB,EAAOvB,GACT,MAAgB,QAAZA,EAAEjD,OAA6B,GAAXiD,EAAEjD,OACjB,EAGF+jB,EAAIpnB,GAAG,EAGhB,IAAIuf,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG8gB,EAGnC,MAAM,IAAI/oB,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOlF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA2B9BlhB,GAAK4mB,IAAM,QAASA,GAAIjlB,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,IAAMmsB,EAAUnsB,IAAY,OAANA,EACjC,OAAQA,CAGV,IAAIgI,EAAUhI,GACZ,MAAe,IAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,EAGxB,IAAI1G,YAAajB,GACf,MAAOiB,GAAEwuB,UAAYxuB,EAAEsF,OAGzB,IAAIuC,EAAO7H,GACT,MAAmB,QAAZA,EAAEqD,OAA6B,GAAXrD,EAAEqD,KAG/B,IAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGilB,EAG/B,MAAM,IAAI5mB,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA8B9BlhB,GAAKipB,GAAK,QAASA,GAAGtnB,EAAGsG,GACvB,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,KAAMvY,UAAU7B,OAAQ,EAG9D,KAAKU,EAAS/E,IAAMmsB,EAAUnsB,IAAY,OAANA,KAC/B+E,EAASuB,IAAM6lB,EAAU7lB,IAAY,OAANA,GAClC,SAAUtG,IAAKsG,EAGjB,IAAI0B,EAAUhI,GACZ,MAAY,IAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,GACV4gB,GAAG,EAAOhhB,IAEZ,CAET,IAAI0B,EAAU1B,GACZ,MAAY,IAARA,EAAEG,IAAmB,GAARH,EAAEI,GACV4gB,EAAGtnB,GAAG,IAER,CAGT,IAAIA,YAAajB,GACf,MAAIiB,GAAEwuB,UAAYxuB,EAAEsF,QACXgiB,GAAG,EAAOhhB,IAEZ,CAET,IAAIA,YAAavH,GACf,MAAIuH,GAAEkoB,UAAYloB,EAAEhB,QACXgiB,EAAGtnB,GAAG,IAER,CAGT,IAAI6H,EAAO7H,GACT,MAAgB,QAAZA,EAAEqD,OAA6B,GAAXrD,EAAEqD,MACjBikB,GAAG,EAAOhhB,IAEZ,CAET,IAAIuB,EAAOvB,GACT,MAAgB,QAAZA,EAAEjD,OAA6B,GAAXiD,EAAEjD,MACjBikB,EAAGtnB,GAAG,IAER,CAGT,IAAIuf,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGghB,EAGnC,MAAM,IAAIjpB,GAAKiB,MAAMqf,qBAAqB,KAAMtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOjF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA8B9BlhB,GAAKgpB,IAAM,QAASA,GAAIrnB,EAAGsG,GACzB,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,KAAKU,EAAS/E,IAAMmsB,EAAUnsB,IAAY,OAANA,KAC/B+E,EAASuB,IAAM6lB,EAAU7lB,IAAY,OAANA,GAClC,WAAYtG,IAAMsG,EAGpB,IAAI0B,EAAUhI,GACZ,MAAOqnB,KAAc,GAARrnB,EAAEyG,IAAmB,GAARzG,EAAE0G,IAAUJ,EAExC,IAAI0B,EAAU1B,GACZ,MAAO+gB,GAAIrnB,IAAa,GAARsG,EAAEG,IAAmB,GAARH,EAAEI,IAGjC,IAAI1G,YAAajB,GACf,MAAOsoB,KAAMrnB,EAAEwuB,UAAYxuB,EAAEsF,SAAUgB,EAEzC,IAAIA,YAAavH,GACf,MAAOsoB,GAAIrnB,IAAKsG,EAAEkoB,UAAYloB,EAAEhB,SAGlC,IAAIuC,EAAO7H,GACT,MAAOqnB,KAAkB,OAAZrnB,EAAEqD,OAA6B,GAAXrD,EAAEqD,OAAaiD,EAElD,IAAIuB,EAAOvB,GACT,MAAO+gB,GAAIrnB,IAAiB,OAAZsG,EAAEjD,OAA6B,GAAXiD,EAAEjD,OAGxC,IAAIkc,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG+gB,EAGnC,MAAM,IAAIhpB,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOlF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAmHzB,QAASk0B,GAAQxuB,EAAGC,EAAGwuB,EAAW3nB,GAChC,GAAU2nB,EAAN3nB,EAAiB,CAEnB,GAAI9G,EAAEM,QAAUL,EAAEK,OAChB,KAAM,IAAIhG,GAAKiB,MAAMiM,eAAexH,EAAEM,OAAQL,EAAEK,OAIlD,KAAK,GADDtG,MACKoG,EAAI,EAAGA,EAAIJ,EAAEM,OAAQF,IAC5BpG,EAAEoG,GAAKouB,EAAQxuB,EAAEI,GAAIH,EAAEG,GAAIquB,EAAW3nB,EAAM,EAE9C,OAAO9M,GAIP,MAAOgG,GAAE3B,OAAO4B,GAjIpB,GAAI4D,GAAOpK,EAAoB,KAE3BuB,EAAYvB,EAAoB,IAChCkC,EAASlC,EAAoB,GAC7B+C,EAAa/C,EAAoB,IAEjCoB,EAASgJ,EAAKhJ,OACd0B,EAAQsH,EAAKtH,MACbyE,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,UACxBua,EAAehf,EAAWgf,YA8B9BlhB,GAAK+D,OAAS,WACZ,GAAI+B,GAGAsuB,EAFAruB,EAAM8B,UAAU7B,OAChBwG,EAAM,GAEN6nB,GAAW,EACXC,IAEJ,KAAKxuB,EAAI,EAAOC,EAAJD,EAASA,IAAK,CACxB,GAAIyC,GAAMV,UAAU/B,EAOpB,IAJIyC,YAAelH,KACjBgzB,GAAW,GAGRvuB,GAAKC,EAAM,IAAOW,EAAS6B,IAAQA,YAAe7H,IAAY,CAKjE,GAHA0zB,EAAU5nB,EACVA,EAAMjE,EAAIrD,WAELyB,EAAU6F,GACb,KAAM,IAAIxK,WAAU,wCAGtB,IAAU,EAANwK,EAEF,KAAM,IAAIxM,GAAKiB,MAAMof,WAAW7T,EAElC,IAAI1G,EAAI,GAAK0G,EAAM4nB,EAEjB,KAAM,IAAIp0B,GAAKiB,MAAMof,WAAW7T,EAAK4nB,EAAU,OAG9C,CAAA,IAAIlT,EAAa3Y,GAcpB,KAAM,IAAIvI,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUuI,GAZnE,IAAIrI,GAASK,EAAOM,MAAM0H,GAAKrD,UAC3BuG,EAAOxJ,EAAMwJ,KAAKlD,EAAIrD,UAM1B,IALAovB,EAASxuB,GAAK5F,EACdk0B,EAAU5nB,EACVA,EAAMf,EAAKzF,OAAS,EAGhBF,EAAI,GAAK0G,GAAO4nB,EAClB,KAAM,IAAIp0B,GAAKiB,MAAMiM,eAAeknB,EAAU,EAAG5nB,EAAM,IAQ7D,GAAuB,GAAnB8nB,EAAStuB,OACX,KAAM,IAAIsC,aAAY,+BAIxB,KADA,GAAIuG,GAAMylB,EAASC,QACZD,EAAStuB,QACd6I,EAAMqlB,EAAQrlB,EAAKylB,EAASC,QAAS/nB,EAAK,EAG5C,OAAO6nB,GAAW,GAAIhzB,GAAOwN,GAAOA,KAoCnC,SAAS/P,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAASmB,GA6DxB,QAASw0B,GAAO7yB,EAAGsG,GACjB,GAAIwsB,GAAOxyB,EAAMwJ,KAAK9J,GAClB+yB,EAAQzyB,EAAMwJ,KAAKxD,EAEvB,IAAoB,GAAhBwsB,EAAMzuB,QAA+B,GAAhB0uB,EAAM1uB,QAA2B,GAAZyuB,EAAM,IAAuB,GAAZC,EAAM,GACnE,KAAM,IAAI9D,YAAW,6CACL6D,EAAM7nB,KAAK,MAAQ,WAAa8nB,EAAM9nB,KAAK,MAAQ,KAGrE,QACE5M,EAAKkD,SAASlD,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,IAAKjI,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,KAC/DjI,EAAKkD,SAASlD,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,IAAKjI,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,KAC/DjI,EAAKkD,SAASlD,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,IAAKjI,EAAK+C,SAASpB,EAAE,GAAIsG,EAAE,MAxEnE,GAAIhG,GAAQ9C,EAAoB,KAC5BkC,EAASlC,EAAoB,EA+BjCa,GAAK8qB,MAAQ,SAAenpB,EAAGsG,GAC7B,GAAItG,YAAaN,GAAQ,CACvB,GAAI4G,YAAa5G,GACf,MAAO,IAAIA,GAAOmzB,EAAO7yB,EAAEkK,UAAW5D,EAAE4D,WAErC,IAAI/G,MAAMC,QAAQkD,GACrB,MAAO,IAAI5G,GAAOmzB,EAAO7yB,EAAEkK,UAAW5D,QAGrC,IAAInD,MAAMC,QAAQpD,GAAI,CACzB,GAAIsG,YAAa5G,GACf,MAAO,IAAIA,GAAOmzB,EAAO7yB,EAAGsG,EAAE4D,WAE3B,IAAI/G,MAAMC,QAAQkD,GACrB,MAAOusB,GAAO7yB,EAAGsG,GAIrB,KAAM,IAAIjI,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OA8BpF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAqGzB,QAAS80B,GAAMz0B,EAAQunB,GACrB,GAAY,GAARA,EAEF,MAAOlnB,GAAOM,MAAMX,EAAO,GAAG,GAE3B,IAAY,GAARunB,EAGP,MAAOvkB,GACHH,EAAS7C,EAAO,GAAG,GAAIA,EAAO,GAAG,IACjC6C,EAAS7C,EAAO,GAAG,GAAIA,EAAO,GAAG,IAsCrC,KAAK,GAjCD00B,GAAa,SAAU10B,GACzB,GAAI4F,GAAG+a,EAKHgU,EAAK,GAAI/vB,OAAM5E,EAAO8F,QACtBpC,EAAM,CACV,KAAKkC,EAAI,EAAGA,EAAI5F,EAAO8F,OAAQF,IAC7BlC,EAAMjB,EAAIiB,EAAK1D,EAAO4F,GAAGA,GAG3B,KAAKA,EAAI,EAAGA,EAAI5F,EAAO8F,OAAQF,IAAK,CAIlC,IAHA+uB,EAAG/uB,GAAK,GAAIhB,OAAM5E,EAAO8F,QACzB6uB,EAAG/uB,GAAGA,GAAK3C,EAAWS,GAEjBid,EAAI,EAAO/a,EAAJ+a,EAAOA,IACjBgU,EAAG/uB,GAAG+a,GAAK,CAGb,KAAKA,EAAI/a,EAAI,EAAG+a,EAAI3gB,EAAO8F,OAAQ6a,IACjCgU,EAAG/uB,GAAG+a,GAAK3gB,EAAO4F,GAAG+a,EAGnB/a,GAAE,EAAI5F,EAAO8F,SACfpC,EAAMV,EAASU,EAAK1D,EAAO4F,EAAI,GAAGA,EAAI,KAI1C,MAAO+uB,IAGLC,EAAK50B,EACA4F,EAAI,EAAO2hB,EAAO,EAAX3hB,EAAcA,IAC5BgvB,EAAK/xB,EAAS6xB,EAAWE,GAAK50B,EAGhC,OAAIunB,GAAO,GAAK,EACPtkB,EAAW2xB,EAAG,GAAG,IAEjBA,EAAG,GAAG,GA3JnB,GAAIrzB,GAAQtC,EAAoB,KAE5BkC,EAASlC,EAAoB,GAE7BwD,EAAMxD,EAAoB,IAAIU,GAC9BqD,EAAW/D,EAAoB,IAAIU,GACnCkD,EAAW5D,EAAoB,IAAIU,GACnCsD,EAAahE,EAAoB,IAAIU,GAErC0J,EAAOpK,EAAoB,KAC3BoB,EAASgJ,EAAKhJ,OACdmJ,EAASH,EAAKG,MA2BlB,OAAOjI,GAAM,OACXszB,IAAO,SAAUpzB,GACf,MAAOpB,GAAOM,MAAMc,IAGtBmtB,iBAAkB,SAAcntB,GAC9B,GAAI8J,EAaJ,QAZI9J,YAAaN,GACfoK,EAAO9J,EAAE8J,OAEF9J,YAAamD,QACpBnD,EAAI,GAAIN,GAAOM,GACf8J,EAAO9J,EAAE8J,QAITA,KAGMA,EAAKzF,QACX,IAAK,GAEH,MAAOzF,GAAOM,MAAMc,EAEtB,KAAK,GAEH,GAAe,GAAX8J,EAAK,GACP,MAAOlL,GAAOM,MAAMc,EAAEuD,UAAU,GAGhC,MAAM,IAAI0rB,YAAW,gCACTlnB,EAAO3C,OAAO0E,GAAQ,IAGtC,KAAK,GAEH,GAAIgc,GAAOhc,EAAK,GACZic,EAAOjc,EAAK,EAChB,IAAIgc,GAAQC,EACV,MAAOiN,GAAKhzB,EAAEd,QAAQqE,UAAWuiB,EAAMC,EAGvC,MAAM,IAAIkJ,YAAW,gCACTlnB,EAAO3C,OAAO0E,GAAQ,IAGtC,SAEE,KAAM,IAAImlB,YAAW,yCACTlnB,EAAO3C,OAAO0E,GAAQ,WA6EvC,SAAS3M,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBW,EAASlC,EAAoB,GAE7BoB,EAASgJ,EAAKhJ,OACdwE,EAAUwE,EAAKtH,MAAM8C,QACrB2B,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,SAmC5B3G,GAAK+qB,KAAO,SAAeppB,EAAGoP,GAC5B,GAAIlE,GAAMmoB,EAAQlvB,EAAGgsB,CAErB,IAAwB,GAApBjqB,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAAG,EAGnE,IAAI+K,GAIF,GAFIA,YAAarQ,KAAWqQ,EAAIA,EAAEhP,aAE7B2E,EAASqK,KAAOpK,EAAUoK,GAC7B,KAAM,IAAI/O,WAAW,4DAIvB+O,GAAI,CAEN,IAIIkkB,GAJAC,EAASnkB,EAAI,EAAIA,EAAI,EACrBokB,EAAW,EAAJpkB,GAASA,EAAI,CAIxB,IAAIpP,YAAaN,GACf4zB,GAAU,MAEP,CAAA,IAAIlwB,EAAQpD,GAMf,KAAM,IAAIK,WAAW,6DAJrBL,GAAI,GAAIN,GAAOM,GACfszB,GAAU,EAMZ,GAAIxb,GAAI9X,EAAE8J,MACV,QAAQgO,EAAEzT,QACR,IAAK,GAEHgvB,EAASrzB,EAAEuD,SACX,IAAIhF,GAAS,GAAImB,GACbqM,EAAgBsnB,EAAO,YAAct0B,GAAa,GAAIA,GAAU,GAAK,CAIzE,KAHAR,EAAOmO,QAAQ2mB,EAAOhvB,OAASmvB,EAAMH,EAAOhvB,OAASkvB,GAASxnB,GAC9Db,EAAO3M,EAAOgF,UACd4sB,EAAOkD,EAAOhvB,OACTF,EAAI,EAAOgsB,EAAJhsB,EAAUA,IACpB+G,EAAK/G,EAAIqvB,GAAMrvB,EAAIovB,GAAU30B,EAAOM,MAAMm0B,EAAOlvB,GAEnD,OAAOmvB,GAAU/0B,EAAOgF,UAAYhF,CAEtC,KAAK,GAKH,IAHA80B,KACAnoB,EAAOlL,EAAEuD,UACT4sB,EAAOlrB,KAAKjD,IAAI8V,EAAE,GAAK0b,EAAM1b,EAAE,GAAKyb,GAC/BpvB,EAAI,EAAOgsB,EAAJhsB,EAAUA,IACpBkvB,EAAOlvB,GAAKvF,EAAOM,MAAMgM,EAAK/G,EAAIqvB,GAAMrvB,EAAIovB,GAE9C,OAAOD,GAAUD,EAAS,GAAI3zB,GAAO2zB,EAEvC,SACE,KAAM,IAAIpE,YAAW,sDAQxB,SAAS9xB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAASmB,GAwDxB,QAASo1B,GAAKzzB,EAAGsG,GACf,GAAIwsB,GAAOxyB,EAAMwJ,KAAK9J,GAClB+yB,EAAQzyB,EAAMwJ,KAAKxD,GACnBlC,EAAM0uB,EAAM,EAEhB,IAAqB,IAAjBA,EAAMzuB,QAAiC,IAAjB0uB,EAAM1uB,OAAc,KAAM,IAAI4qB,YAAW,kBACnE,IAAI6D,EAAM,IAAMC,EAAM,GAAI,KAAM,IAAI9D,YAAW,mCAAqC6D,EAAM,GAAK,OAASC,EAAM,GAAK,IACnH,IAAW,GAAP3uB,EAAU,KAAM,IAAI6qB,YAAW,oDAGnC,KAAK,GADDzE,GAAO,EACFrmB,EAAI,EAAOC,EAAJD,EAASA,IACvBqmB,EAAOnsB,EAAK2C,IAAIwpB,EAAMnsB,EAAK+C,SAASpB,EAAEmE,GAAImC,EAAEnC,IAG9C,OAAOqmB,GArET,GAAIlqB,GAAQ9C,EAAoB,KAC5BkC,EAASlC,EAAoB,EAyBjCa,GAAKgrB,IAAM,SAAarpB,EAAGsG,GACzB,GAAItG,YAAaN,GAAQ,CACvB,GAAI4G,YAAa5G,GACf,MAAO+zB,GAAKzzB,EAAEkK,UAAW5D,EAAE4D,UAExB,IAAI/G,MAAMC,QAAQkD,GACrB,MAAOmtB,GAAKzzB,EAAEkK,UAAW5D,OAGxB,IAAInD,MAAMC,QAAQpD,GAAI,CACzB,GAAIsG,YAAa5G,GACf,MAAO+zB,GAAKzzB,EAAGsG,EAAE4D,UAEd,IAAI/G,MAAMC,QAAQkD,GACrB,MAAOmtB,GAAKzzB,EAAGsG,GAInB,KAAM,IAAIjI,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAgClF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAwDzB,QAASw1B,GAAY5pB,GACnB,OAAQA,EAAKzF,QACX,IAAK,GAAG,MAA0B,WAAlBnG,EAAOK,OAAuB,GAAImB,SAClD,KAAK,GAAG,MAAOi0B,GAAK7pB,EAAK,GAAIA,EAAK,GAClC,KAAK,GAAG,MAAO6pB,GAAK7pB,EAAK,GAAIA,EAAK,GAClC,SAAS,KAAM,IAAI1L,OAAM,0CAW7B,QAASu1B,GAAM7N,EAAMC,GAEnB,GAAI6N,GAAM9N,YAAgB/mB,GAAY+mB,EAAK3mB,YACvC4mB,YAAgBhnB,GAAYgnB,EAAK5mB,YAAc,IAKnD,IAHI2mB,YAAgB/mB,KAAW+mB,EAAOA,EAAK1lB,YACvC2lB,YAAgBhnB,KAAWgnB,EAAOA,EAAK3lB,aAEtC4E,EAAU8gB,IAAgB,EAAPA,EACtB,KAAM,IAAI1nB,OAAM,uDAElB;IAAK4G,EAAU+gB,IAAgB,EAAPA,EACtB,KAAM,IAAI3nB,OAAM,uDAIlB,IAAIG,GAAS,GAAImB,GACb4wB,EAAMsD,EAAM,GAAI70B,GAAU,GAAK,EAC/BgN,EAAe6nB,EAAM,GAAIA,GAAI,GAAK,CACtCr1B,GAAOmO,QAAQoZ,EAAMC,GAAOha,EAK5B,KAAK,GAFD8nB,GAAU5uB,KAAKjD,IAAI8jB,EAAMC,GACzB7a,EAAO3M,EAAOgF,UACTqM,EAAI,EAAOikB,EAAJjkB,EAAaA,IAC3B1E,EAAK0E,GAAGA,GAAK0gB,CAGf,OAAO/xB,GAnGT,GAAIuB,GAAQtC,EAAoB,KAE5BuB,EAAYvB,EAAoB,KAChCkC,EAASlC,EAAoB,GAC7BwH,EAAYxH,EAAoB,GAAGwH,SA2BvC,OAAOlF,GAAM,OACX,GAAI,WACF,MAA0B,WAAlB5B,EAAOK,OAAuB,GAAImB,WAG5Co0B,qBAAsB,SAAUhO,GAC9B,GAAIvnB,GAASo1B,EAAK7N,EAAMA,EACxB,OAA0B,WAAlB5nB,EAAOK,OAAuBA,EAASA,EAAOgF,WAGxDwwB,yCAA0C,SAAUjO,EAAMC,GACxD,GAAIxnB,GAASo1B,EAAK7N,EAAMC,EACxB,OAA0B,WAAlB7nB,EAAOK,OAAuBA,EAASA,EAAOgF,WAGxDJ,MAAU,SAAU2G,GAClB,MAAO4pB,GAAW5pB,GAAMvG,WAG1B7D,OAAU,SAAUoK,GAClB,MAAO4pB,GAAW5pB,EAAKvG,gBAuDxB,SAASpG,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAE7BoB,EAASgJ,EAAKhJ,OACd0B,EAAQsH,EAAKtH,MACb8C,EAAUD,MAAMC,OAoBpB/E,GAAKirB,QAAU,SAAkBtpB,GAC/B,GAAyB,IAArBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIrE,YAAaN,GAAQ,CACvB,GAAIR,GAAQN,EAAOM,MAAMc,EAAEkK,WACvB8pB,EAAO1zB,EAAMgpB,QAAQpqB,EACzB,OAAO,IAAIQ,GAAOs0B,GAGpB,GAAI5wB,EAAQpD,GACV,MAAOM,GAAMgpB,QAAQ1qB,EAAOM,MAAMc,GAGpC,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU2B,OAOnE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAiGzB,QAAS+1B,GAAM11B,EAAQunB,EAAMC,GAC3B,GAAIhf,GAAG+Q,EAAG/H,EAAG1M,EAAO6wB,CAEpB,IAAY,GAARpO,EAAW,CAGb,GADAziB,EAAQ9E,EAAO,GAAG,GACL,GAAT8E,EACF,KAAMjF,OAAM,gDAEd,SACE0vB,EAAa,EAAGzqB,KAGf,GAAY,GAARyiB,EAAW,CAElB,GAAIlW,GAAIlO,EAAInD,EACZ,IAAS,GAALqR,EACF,KAAMxR,OAAM,gDAEd,SAEI0vB,EAAavvB,EAAO,GAAG,GAAIqR,GAC3Bke,EAAatsB,EAAWjD,EAAO,GAAG,IAAKqR,KAGvCke,EAAatsB,EAAWjD,EAAO,GAAG,IAAKqR,GACvCke,EAAavvB,EAAO,GAAG,GAAIqR,KAY/B,GAAI2I,GAAIha,EAAO6D,QACf,KAAK2E,EAAI,EAAO+e,EAAJ/e,EAAUA,IACpBwR,EAAExR,GAAKwR,EAAExR,GAAG3E,QAQd,KAAK,GAHDsX,GAAI/X,EAAImkB,GAAMviB,UAGTxF,EAAI,EAAOgoB,EAAJhoB,EAAUA,IAAK,CAI7B,IADAgJ,EAAIhJ,EACO+nB,EAAJ/e,GAAuB,GAAXwR,EAAExR,GAAGhJ,IACtBgJ,GAEF,IAAIA,GAAK+e,GAAmB,GAAXvN,EAAExR,GAAGhJ,GAEpB,KAAMK,OAAM,gDAEV2I,IAAKhJ,IACPm2B,EAAO3b,EAAExa,GAAIwa,EAAExa,GAAKwa,EAAExR,GAAIwR,EAAExR,GAAKmtB,EACjCA,EAAOxa,EAAE3b,GAAI2b,EAAE3b,GAAK2b,EAAE3S,GAAI2S,EAAE3S,GAAKmtB,EAInC,IAAIC,GAAK5b,EAAExa,GACPq2B,EAAK1a,EAAE3b,EACX,KAAKgJ,EAAI,EAAO+e,EAAJ/e,EAAUA,IAAK,CACzB,GAAIstB,GAAK9b,EAAExR,GACPutB,EAAK5a,EAAE3S,EACX,IAAGA,GAAKhJ,GAEN,GAAa,GAATs2B,EAAGt2B,GAAS,CAKd,IAJAgS,EAAI+d,EAAatsB,EAAW6yB,EAAGt2B,IAAKo2B,EAAGp2B,IAIlC+Z,EAAI/Z,EAAOgoB,EAAJjO,EAAUA,IACpBuc,EAAGvc,GAAK9W,EAAIqzB,EAAGvc,GAAI1W,EAAS2O,EAAGokB,EAAGrc,IAEpC,KAAKA,EAAI,EAAOiO,EAAJjO,EAAUA,IACpBwc,EAAGxc,GAAK9W,EAAIszB,EAAGxc,GAAK1W,EAAS2O,EAAGqkB,EAAGtc,UAIpC,CAIH,IADA/H,EAAIokB,EAAGp2B,GACF+Z,EAAI/Z,EAAOgoB,EAAJjO,EAAUA,IACpBuc,EAAGvc,GAAKgW,EAAauG,EAAGvc,GAAI/H,EAE9B,KAAK+H,EAAI,EAAOiO,EAAJjO,EAAUA,IACpBwc,EAAGxc,GAAKgW,EAAawG,EAAGxc,GAAI/H,KAKpC,MAAO2J,GAlMX,GAAI5Z,GAAQtC,EAAoB,KAC5BoK,EAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAE7BswB,EAAetwB,EAAoB,KAAKU,GACxC8C,EAAMxD,EAAoB,IAAIU,GAC9BkD,EAAW5D,EAAoB,IAAIU,GACnCsD,EAAahE,EAAoB,IAAIU,GACrCwD,EAAMlE,EAAoB,IAAIU,GAC9ByD,EAAMnE,EAAoB,IAAIU,GAsB9B0D,EAAM9B,EAAM,OACdqtB,iBAAkB,SAAUntB,GAC1B,GAAI8J,GAAO9J,YAAaN,GAASM,EAAE8J,OAASlC,EAAKtH,MAAMwJ,KAAK9J,EAC5D,QAAQ8J,EAAKzF,QACX,IAAK,GAEH,GAAe,GAAXyF,EAAK,GACP,MAAI9J,aAAaN,GACR,GAAIA,IACTouB,EAAa,EAAG9tB,EAAEuD,UAAU,OAK5BuqB,EAAa,EAAG9tB,EAAE,IAKtB,MAAM,IAAIivB,YAAW,gCACTrnB,EAAKG,OAAO3C,OAAO0E,GAAQ,IAG3C,KAAK,GAEH,GAAIgc,GAAOhc,EAAK,GACZic,EAAOjc,EAAK,EAChB,IAAIgc,GAAQC,EACV,MAAI/lB,aAAaN,GACR,GAAIA,GACPu0B,EAAKj0B,EAAEuD,UAAWuiB,EAAMC,IAKrBkO,EAAKj0B,EAAG8lB,EAAMC,EAIvB,MAAM,IAAIkJ,YAAW,gCACTrnB,EAAKG,OAAO3C,OAAO0E,GAAQ,IAG3C,SAEE,KAAM,IAAImlB,YAAW,yCACTrnB,EAAKG,OAAO3C,OAAO0E,GAAQ,OAI7CspB,IAAO,SAAUpzB,GAEf,MAAO8tB,GAAa,EAAG9tB,KAkH3B,OAAO4B,KAMJ,SAASzE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBW,EAASlC,EAAoB,GAC7B+C,EAAa/C,EAAoB,IAEjC8C,EAAQsH,EAAKtH,MAEb8C,EAAUD,MAAMC,OA4BpB/E,GAAKkrB,KAAO,SAAezf,GACzB,GAAIP,GAAOhJ,EAAW+e,YAAYpZ,WAC9BwsB,EAAY5oB,YAAgBpK,IAAU,EACrC0D,EAAQ0G,IAAQ,EAA2B,WAAlB5L,EAAOK,MAErC,IAAmB,GAAfgL,EAAKlF,OAEP,MAAOquB,GAAW,GAAIhzB,KAMtB,IAAI60B,IAAc,CAClBhrB,GAAOA,EAAK/G,IAAI,SAAUa,GACxB,MAAIA,aAAiBtE,IACnBw1B,GAAc,EACPlxB,EAAMjD,YAENiD,GAKX,IAAI6J,MACAnB,EAAewoB,EAAc,GAAIx1B,GAAU,GAAK,CAGpD,OAFAmO,GAAM5M,EAAMoM,OAAOQ,EAAK3D,EAAMwC,GAEvB2mB,EAAW,GAAIhzB,GAAOwN,GAAOA,KAQrC,SAAS/P,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GA4J/B,QAASs2B,GAAQprB,EAAOC,EAAKC,GAC3B,GAAIhJ,MACAN,EAAIoJ,CACR,IAAIE,EAAO,EACT,KAAWD,EAAJrJ,GACLM,EAAMgK,KAAKtK,GACXA,GAAKsJ,MAGJ,IAAW,EAAPA,EACP,KAAOtJ,EAAIqJ,GACT/I,EAAMgK,KAAKtK,GACXA,GAAKsJ,CAIT,OAAOhJ,GAWT,QAASm0B,GAAWrrB,EAAOC,EAAKC,GAC9B,GAAIhJ,MACAN,EAAIoJ,CACR,IAAIE,EAAO,EACT,KAAYD,GAALrJ,GACLM,EAAMgK,KAAKtK,GACXA,GAAKsJ,MAGJ,IAAW,EAAPA,EACP,KAAOtJ,GAAKqJ,GACV/I,EAAMgK,KAAKtK,GACXA,GAAKsJ,CAIT,OAAOhJ,GAWT,QAASo0B,GAAWtrB,EAAOC,EAAKC,GAC9B,GAAIhJ,MACAN,EAAIoJ,EACJmlB,EAAO,GAAIxvB,GAAU,EACzB,IAAIuK,EAAKqrB,GAAGpG,GACV,KAAOvuB,EAAEyc,GAAGpT,IACV/I,EAAMgK,KAAKtK,GACXA,EAAIA,EAAEutB,KAAKjkB,OAGV,IAAIA,EAAKmT,GAAG8R,GACf,KAAOvuB,EAAE20B,GAAGtrB,IACV/I,EAAMgK,KAAKtK,GACXA,EAAIA,EAAEutB,KAAKjkB,EAIf,OAAOhJ,GAWT,QAASs0B,GAAcxrB,EAAOC,EAAKC,GACjC,GAAIhJ,MACAN,EAAIoJ,EACJmlB,EAAO,GAAIxvB,GAAU,EACzB,IAAIuK,EAAKqrB,GAAGpG,GACV,KAAOvuB,EAAE60B,IAAIxrB,IACX/I,EAAMgK,KAAKtK,GACXA,EAAIA,EAAEutB,KAAKjkB,OAGV,IAAIA,EAAKmT,GAAG8R,GACf,KAAOvuB,EAAE80B,IAAIzrB,IACX/I,EAAMgK,KAAKtK,GACXA,EAAIA,EAAEutB,KAAKjkB,EAIf,OAAOhJ,GAYT,QAASknB,GAAQ3hB,GACf,GAAI0D,GAAO1D,EAAI2D,MAAM,KACjBC,EAAO,IAEX,IAAsB,cAAlBvL,EAAOM,OAET,IACEiL,EAAOF,EAAK/G,IAAI,SAAUoE,GACxB,MAAO,IAAI7H,GAAU6H,KAGzB,MAAOqH,GACL,MAAO,UAGN,CAEHxE,EAAOF,EAAK/G,IAAI,SAAUoE,GAExB,MAAOtD,QAAOsD,IAGhB,IAAI8C,GAAUD,EAAKE,KAAK,SAAUC,GAChC,MAAOtE,OAAMsE,IAEf,IAAGF,EACD,MAAO,MAIX,OAAQD,EAAKpF,QACX,IAAK,GACH,OACE+E,MAAOK,EAAK,GACZJ,IAAKI,EAAK,GACVH,KAAM,EAGV,KAAK,GACH,OACEF,MAAOK,EAAK,GACZJ,IAAKI,EAAK,GACVH,KAAMG,EAAK,GAGf,SACE,MAAO,OAxTb,GAAI7B,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBW,EAASlC,EAAoB,GAG7B2uB,GAFa3uB,EAAoB,IAErBoK,EAAK,WAAWukB,WAC5BrkB,EAAWF,EAAKG,OAAOD,SACvB/C,EAAW6C,EAAKpJ,OAAOuG,QA6C3B1G,GAAKsE,MAAQ,WACX,GACIyG,GACAC,EACAC,EAHAka,EAASrgB,MAAMuF,UAAUskB,MAAMnvB,KAAKqI,WAIpC6uB,GAAa,CAOjB,QAJI5I,EAAU3I,EAAOA,EAAOnf,OAAS,MACnC0wB,EAAavR,EAAOwR,OAAQ,GAAO,GAG7BxR,EAAOnf,QACb,IAAK,GAGH,IAAIyD,EAAS0b,EAAO,IAWlB,KAAM,IAAInjB,WAAU,qEAVpB,IAAI0G,GAAIygB,EAAOhE,EAAO,GACtB,KAAKzc,EACH,KAAM,IAAIJ,aAAY,WAAa6c,EAAO,GAAK,sBAGjDpa,GAAQrC,EAAEqC,MACVC,EAAMtC,EAAEsC,IACRC,EAAOvC,EAAEuC,IAKX,MAEF,KAAK,GAGHF,EAAQoa,EAAO,GACfna,EAAMma,EAAO,GACbla,EAAO,CACP,MAEF,KAAK,GAEHF,EAAQoa,EAAO,GACfna,EAAMma,EAAO,GACbla,EAAOka,EAAO,EACd,MAEF,KAAK,GACH,KAAM,IAAInjB,WAAU,yCAEtB,SACE,KAAM,IAAIhC,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAAG,GAItE,KAAKU,EAASqE,IAAYA,YAAiBrK,IACzC,KAAM,IAAIsB,WAAU,mCAEtB,MAAK0E,EAASsE,IAAUA,YAAetK,IACrC,KAAM,IAAIsB,WAAU,iCAEtB,MAAK0E,EAASuE,IAAWA,YAAgBvK,IACvC,KAAM,IAAIsB,WAAU,kCAItB,IAAI+I,YAAiBrK,IAAasK,YAAetK,IAAauK,YAAgBvK,GAAW,CAEvF,GAAIw1B,IAAc,CAGZnrB,aAAiBrK,KAAYqK,EAAQrK,EAAUK,QAAQgK,IACvDC,YAAetK,KAAcsK,EAAQtK,EAAUK,QAAQiK,IACvDC,YAAgBvK,KAAauK,EAAQvK,EAAUK,QAAQkK,IAEvDF,YAAiBrK,IAAgBsK,YAAetK,IAAgBuK,YAAgBvK,KAGpFw1B,GAAc,EACVnrB,YAAiBrK,KAAWqK,EAAQA,EAAMhJ,YAC1CiJ,YAAetK,KAAasK,EAAQA,EAAIjJ,YACxCkJ,YAAgBvK,KAAYuK,EAAQA,EAAKlJ,aAKjD,GAAIsE,GAAK6vB,EACJQ,EAAaH,EAAeF,EAC5BK,EAAaN,EAAeD,EAC7Bl0B,EAAQoE,EAAG0E,EAAOC,EAAKC,EAG3B,OAA0B,UAAlBpL,EAAOK,OAAsB+B,EAAQ,GAAIZ,GAAOY,MAiLvD,SAASnD,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GA6F/B,QAAS+2B,GAAcpvB,EAAKiE,EAAMorB,GAChC,GAAoBhyB,SAAhBgyB,GACF,IAAKptB,EAASotB,IAAuC,IAAvBA,EAAY7wB,OACxC,KAAM,IAAIhE,WAAU,iDAItB60B,GAAc,GAGhB,IAAoB,IAAhBprB,EAAKzF,OACP,KAAM,IAAIhG,GAAKiB,MAAMiM,eAAezB,EAAKzF,OAAQ,EAEnD,IAAID,GAAM0F,EAAK,EACf,KAAK/E,EAASX,KAASY,EAAUZ,GAC/B,KAAM,IAAI/D,WAAU,uDACJ0H,EAAO3C,OAAO0E,GAAQ,IAGxC,IAAIjE,EAAIxB,OAASD,EACf,MAAOyB,GAAIuC,UAAU,EAAGhE,EAErB,IAAIyB,EAAIxB,OAASD,EAAK,CAEzB,IAAK,GADD8I,GAAMrH,EACD1B,EAAI,EAAGkG,EAAKjG,EAAMyB,EAAIxB,OAAYgG,EAAJlG,EAAQA,IAC7C+I,GAAOgoB,CAET,OAAOhoB,GAGP,MAAOrH,GA1HX,GAAI+B,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBW,EAASlC,EAAoB,GAE7B8C,EAAQsH,EAAKtH,MACbpB,EAAQ0I,EAAKhJ,OAAOM,MACpB6I,EAASH,EAAKG,OACdD,EAAWF,EAAKG,OAAOD,SACvB/C,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,UACxB5B,EAAU9C,EAAM8C,OA4BpB/E,GAAKqO,OAAS,SAAiB1M,EAAG8J,EAAMiC,GACtC,GAAwB,GAApB7F,UAAU7B,QAAmC,GAApB6B,UAAU7B,OACrC,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,EAGrE,IAAIquB,GAAY1yB,YAAaN,IAAU,EAAO0D,EAAQpD,IAAK,EAA2B,UAAlB9B,EAAOK,MAgB3E,IAdIyB,YAAaN,KACfM,EAAIA,EAAEuD,WAEJuG,YAAgBpK,KAClBoK,EAAOA,EAAKvG,WAGVuG,EAAKzF,QAAUyF,EAAK,YAAc/K,KAEpC+K,EAAOA,EAAKtH,IAAI,SAAUa,GACxB,MAAQA,aAAiBtE,GAAasE,EAAMjD,WAAaiD,KAIzDyE,EAAS9H,GACX,MAAOi1B,GAAcj1B,EAAG8J,EAAMiC,EAG9B,IAAmB,GAAfjC,EAAKzF,OAAa,CAEpB,KAAOjB,EAAQpD,IACbA,EAAIA,EAAE,EAGR,OAAOd,GAAMc,GAIRoD,EAAQpD,KACXA,GAAKA,IAEPA,EAAId,EAAMc,EAEV,IAAIkN,GAAM5M,EAAMoM,OAAO1M,EAAG8J,EAAMiC,EAChC,OAAO2mB,GAAW,GAAIhzB,GAAOwN,GAAOA,KAkDvC,SAAS/P,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3BkC,EAASlC,EAAoB,GAE7B8C,EAAQsH,EAAKtH,MACbyE,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,MAyBlBxJ,GAAKyL,KAAO,SAAe9J,GACzB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIivB,GAA6B,UAAlBp1B,EAAOK,MAEtB,IAAIwG,EAAS/E,IAAMgI,EAAUhI,IAAM6H,EAAO7H,IAAMmsB,EAAUnsB,IACjD,MAALA,GAAaA,YAAajB,GAC5B,MAAOu0B,MAAe,GAAI5zB,MAG5B,IAAIoI,EAAS9H,GACX,MAAOszB,IAAWtzB,EAAEqE,QAAU,GAAI3E,IAAQM,EAAEqE,QAG9C,IAAIlB,MAAMC,QAAQpD,GAChB,MAAOM,GAAMwJ,KAAK9J,EAGpB,IAAIA,YAAaN,GACf,MAAO,IAAIA,GAAOM,EAAE8J,OAGtB,MAAM,IAAIzL,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAE7BoB,EAASgJ,EAAKhJ,OACd0B,EAAQsH,EAAKtH,MACb8C,EAAUD,MAAMC,OA+BpB/E,GAAKmrB,QAAU,SAAkBxpB,GAC/B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIjB,EAAQpD,GACV,MAAOM,GAAMkpB,QAAQ5qB,EAAOM,MAAMc,GAE/B,IAAIA,YAAaN,GAAQ,CAC5B,GAAIwN,GAAM5M,EAAMkpB,QAAQxpB,EAAEkK,UAC1B,OAAO9G,GAAQ8J,GAAO,GAAIxN,GAAOwN,GAAOA,EAIxC,MAAOtO,GAAOM,MAAMc,MAQrB,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAmEzB,QAAS82B,GAAW9xB,EAAOd,GACzB,GAAIzE,GAAG8E,CAEP,IAAIQ,EAAQC,GAGV,MAFAvF,GAAI,GAAI4B,GAAO2D,GACfT,EAAS9E,EAAE8E,OAAOL,GACXK,GAAUA,EAAOW,SAErB,IAAIF,YAAiB3D,GACxB,MAAO2D,GAAMT,OAAOL,EAEjB,IAAIuF,EAASzE,GAChB,MAAO+xB,GAAc/xB,EAAOd,EAG5B,MAAM,IAAIlE,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUgF,IAWvE,QAAS+xB,GAAcvvB,EAAKtD,GAC1B,KAAMA,YAAiB9C,IAErB,KAAM,IAAIY,WAAU,iBAEtB,IAA2B,GAAvBkC,EAAMuH,OAAOzF,OACf,KAAM,IAAIhG,GAAKiB,MAAMiM,eAAehJ,EAAMuH,OAAOzF,OAAQ,EAI3D,IAAIgxB,GAASxvB,EAAIxB,MACjB/D,GAAMkL,cAAcjJ,EAAMP,MAAM,GAAIqzB,GACpC/0B,EAAMkL,cAAcjJ,EAAME,MAAM,GAAI4yB,EAEpC,IAAI1yB,GAAQJ,EAAMI,MAAM,GAEpB2yB,EAAS,EAKb,OAJA3yB,GAAML,QAAQ,SAAUwtB,GACtBwF,GAAUzvB,EAAIyB,OAAOwoB,KAGhBwF,EAeT,QAASC,GAAWlyB,EAAOd,EAAOsK,EAAad,GAC7C,GAAIjO,EAEJ,IAAIsF,EAAQC,GAGV,MAFAvF,GAAI,GAAI4B,GAAOrB,EAAKa,MAAMmE,IAC1BvF,EAAE8E,OAAOL,EAAOsK,EAAad,GACtBjO,EAAEyF,SAEN,IAAIF,YAAiB3D,GACxB,MAAO2D,GAAMnE,QAAQ0D,OAAOL,EAAOsK,EAAad,EAE7C,IAAIjE,EAASzE,GAChB,MAAOmyB,GAAcnyB,EAAOd,EAAOsK,EAAad,EAGhD,MAAM,IAAI1N,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUgF,IAcvE,QAASmyB,GAAc3vB,EAAKtD,EAAOsK,EAAad,GAC9C,KAAMxJ,YAAiB9C,IAErB,KAAM,IAAIY,WAAU,iBAEtB,IAA2B,GAAvBkC,EAAMuH,OAAOzF,OACf,KAAM,IAAIhG,GAAKiB,MAAMiM,eAAehJ,EAAMuH,OAAOzF,OAAQ,EAE3D,IAAqBnB,SAAjB6I,GACF,IAAKjE,EAASiE,IAAyC,IAAxBA,EAAa1H,OAC1C,KAAM,IAAIhE,WAAU,iDAItB0L,GAAe,GAGjB,IAAIpJ,GAAQJ,EAAMI,MAAM,GACpByB,EAAMzB,EAAMmH,OAAO,EAEvB,IAAI1F,GAAOyI,EAAYxI,OACrB,KAAM,IAAIhG,GAAKiB,MAAMiM,eAAe5I,EAAMmH,OAAO,GAAI+C,EAAYxI,OAInE,IAAIgxB,GAASxvB,EAAIxB,MACjB/D,GAAMkL,cAAcjJ,EAAMP,MAAM,IAChC1B,EAAMkL,cAAcjJ,EAAME,MAAM,GAIhC,KAAK,GADDgzB,MACKtxB,EAAI,EAAOkxB,EAAJlxB,EAAYA,IAC1BsxB,EAAMtxB,GAAK0B,EAAIyB,OAAOnD,EAQxB,IALAxB,EAAML,QAAQ,SAAUwtB,EAAG3rB,GACzBsxB,EAAM3F,GAAKjjB,EAAYvF,OAAOnD,KAI5BsxB,EAAMpxB,OAASgxB,EACjB,IAAKlxB,EAAIkxB,EAAS,EAAGjxB,EAAMqxB,EAAMpxB,OAAYD,EAAJD,EAASA,IAC3CsxB,EAAMtxB,KACTsxB,EAAMtxB,GAAK4H,EAKjB,OAAO0pB,GAAMxqB,KAAK,IA7MpB,GAAIrD,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAC7BiC,EAAQjC,EAAoB,GAE5B8C,EAAQsH,EAAKtH,MACbwH,EAAWF,EAAKG,OAAOD,SACvB1E,EAAUD,MAAMC,OAoCpB/E,GAAKuE,OAAS,WACZ,OAAQsD,UAAU7B,QAChB,IAAK,GACH,MAAO8wB,GAAWjvB,UAAU,GAAIA,UAAU,GAG5C,KAAK,GACL,IAAK,GACH,MAAOqvB,GAAWrvB,UAAU,GAAIA,UAAU,GAAIA,UAAU,GAAIA,UAAU,GAExE,SACE,KAAM,IAAI7H,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,OA8JtE,SAASlH,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA4FzB,QAASq3B,GAAQn3B,GAEf,IAAK,GADD0D,GAAM,EACDkC,EAAI,EAAGA,EAAI5F,EAAO8F,OAAQF,IAC/BlC,EAAM5D,EAAK2C,IAAIiB,EAAK1D,EAAO4F,GAAGA,GAElC,OAAOlC,GAhGT,GAAI2F,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAE7BoB,EAASgJ,EAAKhJ,OACdmJ,EAASH,EAAKG,MA4BlB1J,GAAKorB,MAAQ,SAAgBzpB,GAC3B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIyF,EAaJ,QAZI9J,YAAaN,GACfoK,EAAO9J,EAAE8J,OAEF9J,YAAamD,QACpBnD,EAAI,GAAIN,GAAOM,GACf8J,EAAO9J,EAAE8J,QAITA,KAGMA,EAAKzF,QACX,IAAK,GAEH,MAAOzF,GAAOM,MAAMc,EAEtB,KAAK,GAEH,GAAe,GAAX8J,EAAK,GACP,MAAOlL,GAAOM,MAAMc,EAAEuD,UAAU,GAGhC,MAAM,IAAI0rB,YAAW,gCACLlnB,EAAO3C,OAAO0E,GAAQ,IAG1C,KAAK,GAEH,GAAIgc,GAAOhc,EAAK,GACZic,EAAOjc,EAAK,EAChB,IAAIgc,GAAQC,EACV,MAAO2P,GAAO11B,EAAEd,QAAQqE,UAGxB,MAAM,IAAI0rB,YAAW,gCACLlnB,EAAO3C,OAAO0E,GAAQ,IAG1C,SAEE,KAAM,IAAImlB,YAAW,yCACLlnB,EAAO3C,OAAO0E,GAAQ,SAsBzC,SAAS3M,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BkC,EAASlC,EAAoB,GAE7BoB,EAASgJ,EAAKhJ,OACdmJ,EAASH,EAAKG,MAsBlB1J,GAAKqrB,UAAY,SAAoB1pB,GACnC,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,IAAIyF,GAAOzL,EAAKyL,KAAK9J,GAAGuD,SACxB,QAAQuG,EAAKzF,QACX,IAAK,GAEH,MAAOzF,GAAOM,MAAMc,EAEtB,KAAK,GAEH,MAAOpB,GAAOM,MAAMc,EAEtB,KAAK,GAEH,GAKI21B,GALA7P,EAAOhc,EAAK,GACZic,EAAOjc,EAAK,GACZ4oB,EAAY1yB,YAAaN,GACzBwL,EAAOlL,EAAEuD,UACTqyB,KAEA12B,EAAQN,EAAOM,KAEnB,IAAa,IAAT4mB,EAEF,KAAM,IAAImJ,YAAW,mDACLlnB,EAAO3C,OAAO0E,GAAQ,IAGxC,KAAK,GAAI/C,GAAI,EAAO+e,EAAJ/e,EAAUA,IAAK,CAC7B4uB,EAAgBC,EAAW7uB,KAC3B,KAAK,GAAIhJ,GAAI,EAAOgoB,EAAJhoB,EAAUA,IACxB43B,EAAc53B,GAAKmB,EAAMgM,EAAKnN,GAAGgJ,IAIrC,MAAO2rB,GAAW,GAAIhzB,GAAOk2B,GAAcA,CAE7C,SAEE,KAAM,IAAI3G,YAAW,yCACLlnB,EAAO3C,OAAO0E,GAAQ,SAQzC,SAAS3M,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBW,EAASlC,EAAoB,GAC7B+C,EAAa/C,EAAoB,IAEjC8C,EAAQsH,EAAKtH,MACb8C,EAAUD,MAAMC,OA4BpB/E,GAAKsrB,MAAQ,SAAgB7f,GAC3B,GAAIP,GAAOhJ,EAAW+e,YAAYpZ,WAC9BwsB,EAAY5oB,YAAgBpK,IAAU,EACrC0D,EAAQ0G,IAAQ,EAA2B,WAAlB5L,EAAOK,MAErC,IAAmB,GAAfgL,EAAKlF,OAEP,MAAOquB,GAAW,GAAIhzB,KAMtB,IAAI60B,IAAc,CAClBhrB,GAAOA,EAAK/G,IAAI,SAAUa,GACxB,MAAIA,aAAiBtE,IACnBw1B,GAAc,EACPlxB,EAAMjD,YAENiD,GAKX,IAAI6J,MACAnB,EAAewoB,EAAc,GAAIx1B,GAAU,GAAK,CAGpD,OAFAmO,GAAM5M,EAAMoM,OAAOQ,EAAK3D,EAAMwC,GAEvB2mB,EAAW,GAAIhzB,GAAOwN,GAAOA,KAQrC,SAAS/P,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAE5B5M,GADY3X,EAAKpJ,OAAOwG,UACTzE,EAAWgf,aAwB9BlhB,GAAKwrB,UAAY,QAASA,GAAW/Z,GACnC,GAAIzM,GAAO6J,EAAK2oB,CAEhB,IAAwB,GAApB3vB,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,IAAIU,EAAS+K,GACX,MAAOA,KAAMxM,OAAOusB,kBAChBxxB,EAAKyrB,MAAMha,EAAI,GACf7K,KAAK3D,KAAK,EAAE2D,KAAKiZ,GAGvB,IAAIpO,YAAa/Q,GAAW,CAC1B,IAAM+2B,EAAqBhmB,GACzB,MAAOA,GAAEse,cAAgBte,EAAEvJ,WACvBlI,EAAKyrB,MAAMha,EAAEyd,KAAK,IAClB3lB,EAAK+V,UAAUI,IAAI7f,EAAOO,WAAW6C,MAI3C,IADAwO,EAAIA,EAAE1P,WACF0P,EAAIimB,EAAa1xB,OACnB,MAAOtF,GAAUK,QAAQ22B,EAAajmB,IAAIkmB,KAAK93B,EAAOO,UAIxD,IAAIA,GAAYP,EAAOO,WAA2B,EAAdwG,KAAK9D,IAAI2O,IACzC8jB,EAAM70B,EAAUI,aAAaV,UAAWA,GAI5C,IADAqR,GAAKimB,EAAa1xB,OACdwxB,EAAcI,EAAWx3B,GAAY,CACvC,GAAIo3B,EAAY/lB,GACd,MAAO,IAAI/Q,GAAU82B,EAAY/lB,GAAG/J,YAAY7H,EAAOO,WAEzDyO,GAAM2oB,EAAYA,EAAYxxB,OAAO,OAErCwxB,GAAcI,EAAWx3B,MACzByO,EAAM,GAAI0mB,GAAImC,EAAaA,EAAa1xB,OAAO,IAC5C2xB,KAAKv3B,EAGV,IAAI6xB,GAAM,GAAIsD,GAAI,EAClBvwB,GAAQ,GAAIuwB,GAAIiC,EAAYxxB,OAAS0xB,EAAa1xB,OAClD,KAAK,GAAIF,GAAI0xB,EAAYxxB,OAAYyL,EAAJ3L,IAASA,EACxC0xB,EAAY1xB,GAAK+I,EAAMA,EAAI2gB,MAAMxqB,GACjCA,EAAQA,EAAMkqB,KAAK+C,EAIrB,OADAuF,GAAY/lB,GAAK5C,EAAI2gB,MAAMxqB,GACpB,GAAItE,GAAU82B,EAAY/lB,GAAG/J,YAAY7H,EAAOO,YAGzD,GAAI0tB,EAAUrc,IAAY,OAANA,EAClB,MAAO,EAGT,IAAIyP,EAAazP,GACf,MAAOvP,GAAWif,QAAQ1P,EAAG+Z,EAG/B,MAAM,IAAIxrB,GAAKiB,MAAMqf,qBAAqB,YAAatgB,EAAK,UAAUyR,IAQxE,IAAIgmB,GAAuB,SAAShmB,GAClC,MAAOA,GAAE9K,eAAiB8K,EAAEse,cAAgBte,EAAE0e,WAI5CyH,KAGAF,GACF,EACA,EACA,EACA,EACA,GACA,IACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,kBACA,qBAOC,SAAS54B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjC2uB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBjD,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,UACxBua,EAAehf,EAAWgf,YAyB9BlhB,GAAKyrB,MAAQ,QAASA,GAAOha,GAC3B,GAAI6e,GAAG3uB,EACH+W,EAAI,SAER,IAAwB,GAApB7Q,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS+K,GAAI,CACf,GAAI9K,EAAU8K,GAAI,CAChB,GAAS,GAALA,EACF,MAAOvJ,UAASuJ,GACZzK,IACAwY,GAGN,IAAI/N,EAAI,IACN,MAAOzK,IAKT,KAFA,GAAIhC,GAAQyM,EAAI,EACZ5C,EAAM4C,EAAI,EACPzM,EAAQ,GACb6J,GAAO7J,EACPA,GAOF,OAJW,IAAP6J,IACFA,EAAM,GAGDA,EAGT,GAAQ,GAAJ4C,EACF,MAAO7K,MAAKiZ,IAAMjZ,KAAKwD,IAAIxD,KAAKiZ,GAAGpO,GAAKga,EAAM,EAAEha,GAGlD,IAAIA,GAAK,OACP,MAAOzK,IAGT,IAAIyK,EAAI,GAAM,CACZ,GAAIomB,GAAOpmB,EAAEA,EACTqmB,EAASD,EAAKpmB,EACdsmB,EAAQD,EAAOrmB,EACfumB,EAAQD,EAAMtmB,CAClB,OAAO7K,MAAK3D,KAAK,EAAE2D,KAAKiZ,GAAGpO,GAAK7K,KAAK5D,IAAKyO,EAAE7K,KAAKwK,EAAIK,IAClD,EAAI,GAAG,GAAGA,GAAK,GAAG,IAAIomB,GAAQ,KAAK,MAAMC,GACzC,KAAK,QAAQC,GAAS,QAAQ,UAAUC,GACxC,SAAS,YAAYA,EAAMvmB,MAG9BA,EACF9P,EAAIhC,EAAE,EACN,KAAK,GAAImG,GAAI,EAAGA,EAAInG,EAAEqG,SAAUF,EAC9BnE,GAAKhC,EAAEmG,IAAM2L,EAAE3L,EAIjB,OADAwqB,GAAI7e,EAAIiH,EAAI,GACL9R,KAAK3D,KAAK,EAAE2D,KAAKiZ,IAAMjZ,KAAK5D,IAAIstB,EAAG7e,EAAE,IAAO7K,KAAK/D,KAAKytB,GAAK3uB,EAGpE,GAAIgI,EAAU8H,GAAI,CAChB,GAAY,GAARA,EAAEpJ,GACJ,MAAOojB,GAAMha,EAAErJ,GAGjBqJ,GAAI,GAAIvQ,GAAQuQ,EAAErJ,GAAK,EAAGqJ,EAAEpJ,IAC5B1G,EAAI,GAAIT,GAAQvB,EAAE,GAAI,EACtB,KAAK,GAAImG,GAAI,EAAGA,EAAInG,EAAEqG,SAAUF,EAAG,CACjC,GAAImyB,GAAOxmB,EAAErJ,GAAKtC,EACdoyB,EAAMD,EAAKA,EAAOxmB,EAAEpJ,GAAGoJ,EAAEpJ,EAClB,IAAP6vB,GACFv2B,EAAEyG,IAAMzI,EAAEmG,GAAKmyB,EAAOC,EACtBv2B,EAAE0G,MAAQ1I,EAAEmG,GAAK2L,EAAEpJ,IAAM6vB,GAEzBv2B,EAAEyG,GAAKzI,EAAEmG,GAAK,GACTkB,IACAA,IAITspB,EAAI,GAAIpvB,GAAQuQ,EAAErJ,GAAKsQ,EAAI,GAAKjH,EAAEpJ,GAClC,IAAI8vB,GAAYvxB,KAAK3D,KAAK,EAAE2D,KAAKiZ,GAEjCpO,GAAErJ,IAAM,EACR,IAAI6oB,GAASjxB,EAAKgD,IAAIstB,EAAG7e,EACR,IAAbwf,EAAO5oB,GACT4oB,EAAO7oB,IAAM+vB,EACS,GAAblH,EAAO7oB,GAChB6oB,EAAO5oB,IAAM8vB,GAEblH,EAAO7oB,IAAM+vB,EACblH,EAAO5oB,IAAM8vB,EAGf,IAAIzvB,GAAI9B,KAAK/D,KAAKytB,EAAEloB,GAIpB,OAHAkoB,GAAEloB,GAAKM,EAAI9B,KAAKuD,KAAKmmB,EAAEjoB,IACvBioB,EAAEjoB,GAAKK,EAAI9B,KAAKwD,KAAKkmB,EAAEjoB,IAEhBrI,EAAK+C,SAAS/C,EAAK+C,SAASkuB,EAAQX,GAAI3uB,GAGjD,GAAI8P,YAAa/Q,GAAW,CAC1B,GAAI+Q,EAAE9K,YACJ,MAAO8K,GAAEse,cAAgBte,EAAE0e,SACvB,GAAIzvB,GAAUsG,KACdhH,EAAKwrB,UAAU/Z,EAAEoc,MAAM,GAG7B,KAAKpc,EAAEvJ,WACL,MAAO,IAAIxH,GAAU+Q,EAAEse,aACnBvQ,IACAxY,KAIR,GAAI8mB,EAAUrc,IAAY,OAANA,EAClB,MAAOA,GACH,EACAzK,GAGN,IAAIka,EAAazP,GACf,MAAOvP,GAAWif,QAAQ1P,EAAGga,EAG/B,MAAM,IAAIzrB,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAUyR,IAGpE,IAAI9R,IACD,kBACA,kBACD,mBACC,oBACA,kBACA,qBACA,sBACA,qBACA,sBACA,sBACA,uBACA,qBACA,sBACA,sBACA,yBAQA,SAASb,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIo4B,GAAej5B,EAAoB,KAAKa,EAgC5CA,GAAK4rB,OAASwM,EAAa,WAAWxM,SAMnC,SAAS9sB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIo4B,GAAej5B,EAAoB,KAAKa,EAgC5CA,GAAK6rB,UAAYuM,EAAa,WAAWvM,YAMtC,SAAS/sB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIo4B,GAAej5B,EAAoB,KAAKa,EAqB5CA,GAAK2rB,WAAayM,EAAa,WAAWzM,aAMvC,SAAS7sB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAEtBgG,EAAW6C,EAAKpJ,OAAOuG,SACvBC,EAAY4C,EAAKpJ,OAAOwG,SA2B5B3G,GAAK0rB,aAAe,SAAuBja,EAAGV,GAC5C,GAAIkgB,GAAQnrB,EAERuyB,EAAQxwB,UAAU7B,MACtB,IAAIqyB,EAAQ,EACV,KAAM,IAAIr4B,GAAKiB,MAAMmf,eAAe,eAAgBvY,UAAU7B,OAAQ,EAGxE,IAAIU,EAAS+K,GAAI,CACf,IAAK9K,EAAU8K,IAAU,EAAJA,EACnB,KAAM,IAAIzP,WAAU,2DAItB,IAAa,GAATq2B,EACF,MAAOr4B,GAAKwrB,UAAU/Z,EAIxB,IAAa,GAAT4mB,GACE3xB,EAASqK,GAAI,CACf,IAAKpK,EAAUoK,IAAU,EAAJA,EACnB,KAAM,IAAI/O,WAAU,2DAEtB,IAAI+O,EAAIU,EACN,KAAM,IAAIzP,WAAU,mEAItB,KADAivB,EAAS,EACJnrB,EAAI2L,EAAIV,EAAI,EAAQU,GAAL3L,EAAQA,IAC1BmrB,GAAkBnrB,CAEpB,OAAOmrB,IAKb,GAAIxf,YAAa/Q,GAAW,CAC1B,GAAUmE,SAANkM,GAAmBunB,EAAkB7mB,GACvC,MAAOzR,GAAKwrB,UAAU/Z,EAOxB,IAFAV,EAAIrQ,EAAUK,QAAQgQ,KAEhBA,YAAarQ,IAAe43B,EAAkB7mB,IAAO6mB,EAAkBvnB,IAC3E,KAAM,IAAI/O,WAAU,2DAEtB,IAAI+O,EAAEulB,GAAG7kB,GACP,KAAM,IAAIzP,WAAU,mEAItB,KADAivB,EAAS,GAAIvwB,GAAU,GAClBoF,EAAI2L,EAAEoc,MAAM9c,GAAGme,KAAK,GAAIppB,EAAE0wB,IAAI/kB,GAAI3L,EAAIA,EAAEopB,KAAK,GAChD+B,EAASA,EAAOzB,MAAM1pB,EAExB,OAAOmrB,GAGT,KAAM,IAAIjxB,GAAKiB,MAAMqf,qBAAqB,eAAgBtgB,EAAK,UAAUyR,IAQ3E,IAAI6mB,GAAoB,SAAS7mB,GAC/B,MAAOA,GAAE9K,aAAe8K,EAAEglB,IAAI,MAO7B,SAAS33B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UAGtBgG,GAFavH,EAAoB,IAEtBoK,EAAKpJ,OAAOuG,UACvBC,EAAY4C,EAAKpJ,OAAOwG,SAyB5B3G,GAAKurB,aAAe,SAAuB9Z,EAAGV,GAC5C,GAAI3M,GAAK6sB,EAAQnrB,EAAEkG,EAEfqsB,EAAQxwB,UAAU7B,MACtB,IAAa,GAATqyB,EACF,KAAM,IAAIr4B,GAAKiB,MAAMmf,eAAe,eAAgBvY,UAAU7B,OAAQ,EAGxE,IAAIU,EAAS+K,GAAI,CACf,IAAK9K,EAAU8K,IAAU,EAAJA,EACnB,KAAM,IAAIzP,WAAU,2DAEtB,IAAI+O,EAAIU,EACN,KAAM,IAAIzP,WAAU,oCAKtB,KAFAoC,EAAMwC,KAAKxC,IAAI2M,EAAGU,EAAIV,GACtBkgB,EAAS,EACJnrB,EAAI,EAAQ2L,EAAIrN,GAAT0B,EAAcA,IACxBmrB,EAASA,GAAU7sB,EAAM0B,GAAKA,CAEhC,OAAOmrB,GAGT,GAAIxf,YAAa/Q,GAAW,CAK1B,GAFAqQ,EAAIrQ,EAAUK,QAAQgQ,KAEhBA,YAAarQ,IAAe43B,EAAkB7mB,IAAO6mB,EAAkBvnB,IAC3E,KAAM,IAAI/O,WAAU,2DAEtB,IAAI+O,EAAEulB,GAAG7kB,GACP,KAAM,IAAIzP,WAAU,iDAMtB,KAHAoC,EAAMqN,EAAEoc,MAAM9c,GACVA,EAAEqN,GAAGha,KAAMA,EAAM2M,GACrBkgB,EAAS,GAAIvwB,GAAU,GAClBoF,EAAI,GAAIpF,GAAU,GAAIsL,EAAKyF,EAAEoc,MAAMzpB,GAAM0B,EAAE0wB,IAAIxqB,GAAKlG,EAAIA,EAAEopB,KAAK,GAClE+B,EAASA,EAAOzB,MAAMprB,EAAI8qB,KAAKppB,IAAIyyB,UAAUzyB,EAE/C,OAAOmrB,GAGT,KAAM,IAAIjxB,GAAKiB,MAAMqf,qBAAqB,eAAgBtgB,EAAK,UAAUyR,IAQ3E,IAAI6mB,GAAoB,SAAS7mB,GAC/B,MAAOA,GAAE9K,aAAe8K,EAAEglB,IAAI,MAO7B,SAAS33B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBsB,EAAcuB,EAAKpJ,OAAO6H,YAC1B8lB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YAmC9BlhB,GAAK8rB,QAAU,QAASA,GAAQnqB,EAAGsG,GACjC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAC1B,MAAOD,GAAYrG,EAAGsG,EAAGpI,EAAOQ,SAAW,EAAKsB,EAAIsG,EAAI,EAAI,EAG9D,IAAItG,YAAajB,GASf,MAPIgG,GAASuB,GACXA,EAAIvH,EAAUK,QAAQkH,IAEf6lB,EAAU7lB,IAAY,OAANA,KACvBA,EAAI,GAAIvH,GAAUuH,EAAI,EAAI,IAGxBA,YAAavH,GACR,GAAIA,GAAUiB,EAAEmxB,IAAI7qB,IAItB6jB,EAAQnqB,EAAEI,WAAYkG,EAE/B,IAAIA,YAAavH,GASf,MAPIgG,GAAS/E,GACXA,EAAIjB,EAAUK,QAAQY,IAEfmsB,EAAUnsB,IAAY,OAANA,KACvBA,EAAI,GAAIjB,GAAUiB,EAAI,EAAI,IAGxBA,YAAajB,GACR,GAAIA,GAAUiB,EAAEmxB,IAAI7qB,IAItB6jB,EAAQnqB,EAAGsG,EAAElG,WAGtB,IAAKyH,EAAO7H,IAAQ6H,EAAOvB,GAAK,CAC9B,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAQ4B,GAAEqD,MAAQiD,EAAEjD,MAAS,EAAMrD,EAAEqD,MAAQiD,EAAEjD,MAAS,GAAK,EAG/D,GAAIkc,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG6jB,EAKnC,IAAIriB,EAAS9H,IAAM8H,EAASxB,GAC1B,MAAQtG,GAAIsG,EAAK,EAAUA,EAAJtG,EAAS,GAAK,CAGvC,IAAImsB,EAAUnsB,IAAY,OAANA,EAClB,MAAOmqB,IAASnqB,EAAGsG,EAErB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAO6jB,GAAQnqB,GAAIsG,EAGrB,IAAI0B,EAAUhI,IAAMgI,EAAU1B,GAC5B,KAAM,IAAIjG,WAAU,sDAGtB,MAAM,IAAIhC,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOtF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAmDzB,QAASw4B,GAAW72B,EAAGsG,GACrB,GAAIlD,EAAQpD,GAAI,CACd,GAAIoD,EAAQkD,GAAI,CACd,GAAIlC,GAAMpE,EAAEqE,MACZ,IAAID,IAAQkC,EAAEjC,OAAQ,OAAO,CAE7B,KAAK,GAAIF,GAAI,EAAOC,EAAJD,EAASA,IACvB,IAAK0yB,EAAW72B,EAAEmE,GAAImC,EAAEnC,IAAK,OAAO,CAGtC,QAAO,EAGP,OAAO,EAIT,MAAIf,GAAQkD,IACH,EAGAjI,EAAKwD,MAAM7B,EAAGsG,GAvE3B,GAAI/F,GAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1Bnc,EAAUD,MAAMC,OA6BpB/E,GAAK6F,UAAY,SAAmBlE,EAAGsG,GACrC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,OAAIkb,GAAavf,IAAMuf,EAAajZ,GAC3BuwB,EAAW72B,EAAEuD,UAAW+C,EAAE/C,WAG5BlF,EAAKwD,MAAM7B,EAAGsG,MAuCpB,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GACzB,GAAI4B,GAAQtC,EAAoB,KAC5B6I,EAAc7I,EAAoB,GAAG6I,YACrC9F,EAAa/C,EAAoB,IA6CjCqE,EAAQ/B,EAAM,SAChBiuB,WAAY,SAAU/tB,EAAGsG,GAEvB,MAAU,QAANtG,EAA2B,OAANsG,EACf,OAANA,EAA2B,OAANtG,EACfkD,SAANlD,EAAgCkD,SAANoD,EACpBpD,SAANoD,EAAgCpD,SAANlD,EAEvB82B,EAAO92B,EAAGsG,IAGnBonB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGwwB,IAGnCnJ,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGwwB,MAIjCA,EAASh3B,EAAM,UACjBi3B,mBAAoB,SAAU/2B,EAAGsG,GAC/B,MAAOtG,KAAMsG,GAGf+mB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,KAAMsG,GAAKD,EAAYrG,EAAGsG,EAAGpI,EAAOQ,UAG7C4uB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAEysB,GAAGnmB,IAGdknB,mBAAoB,SAAUxtB,EAAGsG,GAC/B,OAAQtG,EAAEyG,KAAOH,EAAEG,IAAMJ,EAAYrG,EAAEyG,GAAIH,EAAEG,GAAIvI,EAAOQ,YAChDsB,EAAE0G,KAAOJ,EAAEI,IAAML,EAAYrG,EAAE0G,GAAIJ,EAAEI,GAAIxI,EAAOQ,WAG1D+uB,aAAc,SAAUztB,EAAGsG,GACzB,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,QAAUiD,EAAEjD,OAASgD,EAAYrG,EAAEqD,MAAOiD,EAAEjD,MAAOnF,EAAOQ,UAGrEkvB,iBAAkB,SAAU5tB,EAAGsG,GAC7B,MAAOtG,KAAMsG,IAIjB,OAAOzE,KAMJ,SAAS1E,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GACzB,GAAI4B,GAAQtC,EAAoB,KAC5B6I,EAAc7I,EAAoB,GAAG6I,YACrC9F,EAAa/C,EAAoB,IAgCjCsE,EAAShC,EAAM,UACjBi3B,mBAAoB,SAAU/2B,EAAGsG,GAC/B,MAAOtG,GAAIsG,GAGb+mB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,GAAIsG,IAAMD,EAAYrG,EAAGsG,EAAGpI,EAAOQ,UAG5C4uB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAE20B,GAAGruB,IAGdknB,mBAAoB,WAClB,KAAM,IAAIntB,WAAU,wDAGtBotB,aAAc,SAAUztB,EAAGsG,GACzB,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,MAAQiD,EAAEjD,QAAUgD,EAAYrG,EAAEqD,MAAOiD,EAAEjD,MAAOnF,EAAOQ,UAGpEkvB,iBAAkB,SAAU5tB,EAAGsG,GAC7B,MAAOtG,GAAIsG,GAGbonB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGxE,IAGnC6rB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGxE,KAIrC,OAAOA,KAMJ,SAAS3E,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBsB,EAAcuB,EAAKpJ,OAAO6H,YAC1B8lB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA4B9BlhB,GAAK+rB,SAAW,QAASA,GAASpqB,EAAGsG,GACnC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,WAAYvY,UAAU7B,OAAQ,EAGpE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAC1B,MAAOtG,GAAIsG,GAAKD,EAAYrG,EAAGsG,EAAGpI,EAAOQ,QAG3C,IAAIsB,YAAajB,GASf,MAPIgG,GAASuB,GACXA,EAAIvH,EAAUK,QAAQkH,IAEf6lB,EAAU7lB,IAAY,OAANA,KACvBA,EAAI,GAAIvH,GAAUuH,EAAI,EAAI,IAGxBA,YAAavH,GACRiB,EAAE80B,IAAIxuB,GAIR8jB,EAASpqB,EAAEI,WAAYkG,EAEhC,IAAIA,YAAavH,GASf,MAPIgG,GAAS/E,GACXA,EAAIjB,EAAUK,QAAQY,IAEfmsB,EAAUnsB,IAAY,OAANA,KACvBA,EAAI,GAAIjB,GAAUiB,EAAI,EAAI,IAGxBA,YAAajB,GACRiB,EAAE80B,IAAIxuB,GAIR8jB,EAASpqB,EAAGsG,EAAElG,WAGvB,IAAKyH,EAAO7H,IAAQ6H,EAAOvB,GAAK,CAC9B,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,OAASiD,EAAEjD,MAGtB,GAAIkc,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG8jB,EAKnC,IAAItiB,EAAS9H,IAAM8H,EAASxB,GAC1B,MAAOtG,IAAKsG,CAGd,IAAI6lB,EAAUnsB,IAAY,OAANA,EAClB,MAAOoqB,IAAUpqB,EAAGsG,EAEtB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAO8jB,GAASpqB,GAAIsG,EAGtB,IAAI0B,EAAUhI,IAAMgI,EAAU1B,GAC5B,KAAM,IAAIjG,WAAU,sDAGtB,MAAM,IAAIhC,GAAKiB,MAAMqf,qBAAqB,WAAYtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,KAI1FjI,EAAK24B,SAAW,WACd,KAAM,IAAI54B,OAAM,+CAOf,SAASjB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GACzB,GAAI4B,GAAQtC,EAAoB,KAC5B6I,EAAc7I,EAAoB,GAAG6I,YACrC9F,EAAa/C,EAAoB,IAgCjCuE,EAAUjC,EAAM,WAClBi3B,mBAAoB,SAAU/2B,EAAGsG,GAC/B,MAAWA,GAAJtG,GAGTqtB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAWA,GAAJtG,IAAUqG,EAAYrG,EAAGsG,EAAGpI,EAAOQ,UAG5C4uB,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAEyc,GAAGnW,IAGdknB,mBAAoB,WAClB,KAAM,IAAIntB,WAAU,wDAGtBotB,aAAc,SAAUztB,EAAGsG,GACzB,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,MAAQiD,EAAEjD,QAAUgD,EAAYrG,EAAEqD,MAAOiD,EAAEjD,MAAOnF,EAAOQ,UAGpEkvB,iBAAkB,SAAU5tB,EAAGsG,GAC7B,MAAWA,GAAJtG,GAGT0tB,sBAAuB,SAAU1tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGvE,IAGnC4rB,sBAAuB,SAAU3tB,EAAGsG,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGvE,KAIrC,OAAOA,KAMJ,SAAS5E,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBsB,EAAcuB,EAAKpJ,OAAO6H,YAC1B8lB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA2B9BlhB,GAAKgsB,UAAY,QAASA,GAAUrqB,EAAGsG,GACrC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAGrE,IAAIU,EAAS/E,IAAM+E,EAASuB,GAC1B,MAAWA,GAAJtG,GAASqG,EAAYrG,EAAGsG,EAAGpI,EAAOQ,QAG3C,IAAIsB,YAAajB,GASf,MAPIgG,GAASuB,GACXA,EAAIvH,EAAUK,QAAQkH,IAEf6lB,EAAU7lB,IAAY,OAANA,KACvBA,EAAI,GAAIvH,GAAUuH,EAAI,EAAI,IAGxBA,YAAavH,GACRiB,EAAE60B,IAAIvuB,GAIR+jB,EAAUrqB,EAAEI,WAAYkG,EAEjC,IAAIA,YAAavH,GASf,MAPIgG,GAAS/E,GACXA,EAAIjB,EAAUK,QAAQY,IAEfmsB,EAAUnsB,IAAY,OAANA,KACvBA,EAAI,GAAIjB,GAAUiB,EAAI,EAAI,IAGxBA,YAAajB,GACRiB,EAAE60B,IAAIvuB,GAIR+jB,EAAUrqB,EAAGsG,EAAElG,WAGxB,IAAKyH,EAAO7H,IAAQ6H,EAAOvB,GAAK,CAC9B,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,OAASiD,EAAEjD,MAGtB,GAAIkc,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAG+jB,EAKnC,IAAIviB,EAAS9H,IAAM8H,EAASxB,GAC1B,MAAYA,IAALtG,CAGT,IAAImsB,EAAUnsB,IAAY,OAANA,EAClB,MAAOqqB,IAAWrqB,EAAGsG,EAEvB,IAAI6lB,EAAU7lB,IAAY,OAANA,EAClB,MAAO+jB,GAAUrqB,GAAIsG,EAGvB,IAAI0B,EAAUhI,IAAMgI,EAAU1B,GAC5B,KAAM,IAAIjG,WAAU,sDAGtB,MAAM,IAAIhC,GAAKiB,MAAMqf,qBAAqB,YAAatgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,KAI3FjI,EAAK44B,UAAY,WACf,KAAM,IAAI74B,OAAM,iDAOf,SAASjB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,EAAMH,GAC/B,GAAI0J,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBsB,EAAcuB,EAAKpJ,OAAO6H,YAC1B8lB,EAAYvkB,EAAK,WAAWukB,UAC5BrkB,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA4C9BlhB,GAAKisB,QAAU,QAASA,GAAQtqB,EAAGsG,GACjC,GAAwB,GAApBJ,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIU,EAAS/E,GAAI,CACf,GAAI+E,EAASuB,GACX,OAAQD,EAAYrG,EAAGsG,EAAGpI,EAAOQ,QAE9B,IAAIsJ,EAAU1B,GACjB,OAAQD,EAAYrG,EAAGsG,EAAEG,GAAIvI,EAAOQ,WAAa2H,EAAYC,EAAEI,GAAI,EAAGxI,EAAOQ,SAIjF,GAAIsJ,EAAUhI,GAAI,CAChB,GAAI+E,EAASuB,GACX,OAAQD,EAAYrG,EAAEyG,GAAIH,EAAGpI,EAAOQ,WAAa2H,EAAYrG,EAAE0G,GAAI,EAAGxI,EAAOQ,QAE1E,IAAIsJ,EAAU1B,GACjB,OAAQD,EAAYrG,EAAEyG,GAAIH,EAAEG,GAAIvI,EAAOQ,WAAa2H,EAAYrG,EAAE0G,GAAIJ,EAAEI,GAAIxI,EAAOQ,SAIvF,GAAIsB,YAAajB,GASf,MAPIgG,GAASuB,GACXA,EAAIvH,EAAUK,QAAQkH,GAEf6lB,EAAU7lB,KACjBA,EAAI,GAAIvH,GAAUuH,EAAI,EAAI,IAGxBA,YAAavH,IACPiB,EAAEysB,GAAGnmB,GAIRgkB,EAAQtqB,EAAEI,WAAYkG,EAE/B,IAAIA,YAAavH,GASf,MAPIgG,GAAS/E,GACXA,EAAIjB,EAAUK,QAAQY,GAEfmsB,EAAUnsB,KACjBA,EAAI,GAAIjB,GAAUiB,EAAI,EAAI,IAGxBA,YAAajB,IACPiB,EAAEysB,GAAGnmB,GAIRgkB,EAAQtqB,EAAGsG,EAAElG,WAGtB,IAAKyH,EAAO7H,IAAQ6H,EAAOvB,GAAK,CAC9B,IAAKtG,EAAEuO,UAAUjI,GACf,KAAM,IAAIlI,OAAM,2CAElB,OAAO4B,GAAEqD,OAASiD,EAAEjD,MAGtB,GAAIkc,EAAavf,IAAMuf,EAAajZ,GAClC,MAAO/F,GAAWkf,SAASzf,EAAGsG,EAAGgkB,EAKnC,IAAIxiB,EAAS9H,IAAM8H,EAASxB,GAC1B,MAAOtG,IAAKsG,CAGd,IAAI6lB,EAAUnsB,GACZ,MAAOsqB,IAAStqB,EAAGsG,EAErB,IAAI6lB,EAAU7lB,GACZ,MAAOgkB,GAAQtqB,GAAIsG,EAGrB,IAAU,OAANtG,EACF,MAAa,QAANsG,CAET,IAAU,OAANA,EACF,MAAa,QAANtG,CAGT,IAAUkD,SAANlD,EACF,MAAakD,UAANoD,CAET,IAAUpD,SAANoD,EACF,MAAapD,UAANlD,CAGT,MAAM,IAAI3B,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAUiI,OAOtF,SAASnJ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GA4DzB,QAASg5B,GAAUl3B,EAAGsG,GACpB,MAAOvE,GAAQ/B,EAAGsG,GAAKtG,EAAIsG,EAS7B,QAAS6wB,GAAK72B,GACZ,GAAI0B,GAAMkB,MAQV,IANA3C,EAAWsf,YAAYvf,EAAO,SAAU+C,IAC1BH,SAARlB,GAAqBD,EAAQsB,EAAOrB,MACtCA,EAAMqB,KAIEH,SAARlB,EACF,KAAM,IAAI5D,OAAM,yCAGlB,OAAO4D,GAlFT,GAAIlC,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IACjCuE,EAAUvE,EAAoB,KAAKU,EAiCvC,OAAO4B,GAAM,OACXqtB,iBAAkB,SAAU7sB,GAE1B,MAAO62B,GAAK72B,IAGd82B,qCAAsC,SAAU92B,EAAOuK,GAErD,MAAOtK,GAAWqf,OAAOtf,EAAOuK,EAAItH,UAAW2zB,IAGjDG,MAAO,WAEL,MAAOF,GAAKjxB,gBAyCb,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA6DzB,QAASi5B,GAAWt3B,EAAGsG,GACtB,MAAOjI,GAAKyD,OAAO9B,EAAGsG,GAAKtG,EAAIsG,EAShC,QAASixB,GAAKj3B,GACZ,GAAImC,GAAMS,MAQV,IANA3C,EAAWsf,YAAYvf,EAAO,SAAU+C,IAC1BH,SAART,GAAqBpE,EAAKyD,OAAOuB,EAAOZ,MAC1CA,EAAMY,KAIEH,SAART,EACF,KAAM,IAAIrE,OAAM,yCAGlB,OAAOqE,GAnFT,GACIlC,IADS/C,EAAoB,GAChBA,EAAoB,KAEjC+hB,EAAehf,EAAWgf,YAiC9BlhB,GAAKoE,IAAM,SAAa8G,GACtB,GAAwB,GAApBrD,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,4DAGxB,IAAI4Y,EAAahW,GAAO,CACtB,GAAwB,GAApBrD,UAAU7B,OAEZ,MAAOkzB,GAAKhuB,EAET,IAAwB,GAApBrD,UAAU7B,OAEjB,MAAO9D,GAAWqf,OAAO1Z,UAAU,GAAIA,UAAU,GAAIoxB,EAGrD,MAAM,IAAI3wB,aAAY,8BAKxB,MAAO4wB,GAAKrxB,cAkCb,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAoEzB,QAASm5B,GAAOl3B,EAAOuK,GACtB,GAAI5I,GAAM1B,EAAWqf,OAAOtf,EAAOuK,EAAKxM,EAAK2C,KACxC8W,EAAI1U,EAAQ9C,GAASwJ,EAAKxJ,GAASA,EAAMwJ,MAC7C,OAAOzL,GAAK4C,OAAOgB,EAAK6V,EAAEjN,IAS5B,QAAS4sB,GAAMn3B,GACb,GAAI2B,GAAM,EACN2H,EAAM,CAOV,IALArJ,EAAWsf,YAAYvf,EAAO,SAAU+C,GACtCpB,EAAM5D,EAAK2C,IAAIiB,EAAKoB,GACpBuG,MAGU,IAARA,EACF,KAAM,IAAIxL,OAAM,0CAGlB,OAAOC,GAAK4C,OAAOgB,EAAK2H,GA5F1B,GACIrJ,IADS/C,EAAoB,GAChBA,EAAoB,KAEjC+hB,EAAehf,EAAWgf,aAE1BzV,EAAOtM,EAAoB,KAAKsM,KAChC1G,EAAUD,MAAMC,OA6BpB/E,GAAKqE,KAAO,SAAc6G,GACxB,GAAwB,GAApBrD,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,6DAGxB,IAAI4Y,EAAahW,GAAO,CACtB,GAAwB,GAApBrD,UAAU7B,OAEZ,MAAOozB,GAAMluB,EAEV,IAAwB,GAApBrD,UAAU7B,OAEjB,MAAOmzB,GAAOtxB,UAAU,GAAIA,UAAU,GAGtC,MAAM,IAAIS,aAAY,8BAKxB,MAAO8wB,GAAMvxB,cA4Cd,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAqEzB,QAASq5B,GAAQp3B,GACf,GAAI0zB,GAAO1K,EAAQhpB,EAEnB0zB,GAAKjI,KAAK1tB,EAAK8rB,QAEf,IAAIvgB,GAAMoqB,EAAK3vB,MAEf,IAAW,GAAPuF,EACF,KAAM,IAAIxL,OAAM,4CAGlB,IAAIwL,EAAM,GAAK,EAAG,CAEhB,GAAI+tB,GAAO3D,EAAKpqB,EAAM,EAAI,GACtBguB,EAAQ5D,EAAKpqB,EAAM,EAEvB,MAAK7E,EAAS4yB,IAAWA,YAAgB54B,IAAgB44B,YAAgBh4B,IACvE,KAAM,IAAItB,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUs5B,GAErE,MAAK5yB,EAAS6yB,IAAYA,YAAiB74B,IAAgB64B,YAAiBj4B,IAC1E,KAAM,IAAItB,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUu5B,GAGrE,OAAOv5B,GAAK4C,OAAO5C,EAAK2C,IAAI22B,EAAMC,GAAQ,GAI1C,GAAIC,GAAS7D,GAAMpqB,EAAM,GAAK,EAE9B,MAAK7E,EAAS8yB,IAAaA,YAAkB94B,IAAgB84B,YAAkBl4B,IAC7E,KAAM,IAAItB,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAUw5B,GAGrE,OAAOA,GArGX,GACIl4B,IADSnC,EAAoB,GACtBA,EAAoB,IAC3BuB,EAAYV,EAAKS,KAAKC,UACtBwB,EAAa/C,EAAoB,IAEjCuH,EAAWvH,EAAoB,GAAGuH,SAClCwa,EAAehf,EAAWgf,aAE1B+J,EAAU9rB,EAAoB,KAAK8rB,OA4BvCjrB,GAAKksB,OAAS,SAAgBhhB,GAC5B,GAAwB,GAApBrD,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,+DAGxB,IAAI4Y,EAAahW,GAAO,CACtB,GAAwB,GAApBrD,UAAU7B,OAEZ,MAAOqzB,GAAQnuB,EAAKhG,UAEjB,MAAwB,IAApB2C,UAAU7B,OAGX,GAAIjG,OAAM,uCAIV,GAAIuI,aAAY,8BAKxB,MAAO+wB,GAAQv0B,MAAMuF,UAAUskB,MAAMnvB,KAAKqI,eAmD3C,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA+DzB,QAASy5B,GAAMx3B,GACb,GAAIkqB,GAAOtnB,MAMX,IAJA3C,EAAWsf,YAAYvf,EAAO,SAAU+C,GACtCmnB,EAAiBtnB,SAATsnB,EAAsBnnB,EAAQhF,EAAK+C,SAASopB,EAAMnnB,KAG/CH,SAATsnB,EACF,KAAM,IAAIpsB,OAAM,0CAGlB,OAAOosB,GAzET,GACIjqB,IADS/C,EAAoB,GAChBA,EAAoB,KAEjC+hB,EAAehf,EAAWgf,YA2B9BlhB,GAAKmsB,KAAO,SAAcjhB,GACxB,GAAwB,GAApBrD,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,6DAGxB,IAAI4Y,EAAahW,GAAO,CACtB,GAAwB,GAApBrD,UAAU7B,OAEZ,MAAOyzB,GAAMvuB,EAEV,MAAwB,IAApBrD,UAAU7B,OAGX,GAAIjG,OAAM,qCAIV,GAAIuI,aAAY,8BAKxB,MAAOmxB,GAAM5xB,cA4Bd,SAAS/I,GAEd,YAEAA,GAAOD,QAAU,SAAUmB,GA2CzBA,EAAKosB,IAAM,WACT,GAAwB,GAApBvkB,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,4DAGxB,IAAIoxB,GAAW15B,EAAK,OAAOsM,MAAM,KAAMzE,UACvC,OAAO7H,GAAKiD,KAAKy2B,MAOhB,SAAS56B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUgB,GAoDzB,QAAS85B,GAAK13B,GACZ,GAAI2B,GAAMiB,MAMV,IAJA3C,EAAWsf,YAAYvf,EAAO,SAAU+C,GACtCpB,EAAeiB,SAARjB,EAAqBoB,EAAQrC,EAAIiB,EAAKoB,KAGnCH,SAARjB,EACF,KAAM,IAAI7D,OAAM,yCAElB,OAAO6D,GA7DT,GAAInC,GAAQtC,EAAoB,KAC5B+C,EAAa/C,EAAoB,IACjCwD,EAAMxD,EAAoB,IAAIU,EAyBlC,OAAO4B,GAAM,OACXqtB,iBAAkB,SAAU5jB,GAE1B,MAAOyuB,GAAKzuB,IAGd6tB,qCAAsC,WAGpC,KAAM,IAAIh5B,OAAM,qCAGlBi5B,MAAO,WAEL,MAAOW,GAAK9xB,gBA2Bb,SAAS/I,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAmGzB,QAAS45B,GAAK33B,EAAO43B,GACnB,GAAIj2B,GAAM,EACN2H,EAAM,CAOV,IAJArJ,EAAWsf,YAAYvf,EAAO,SAAU+C,GACtCpB,EAAM5D,EAAK2C,IAAIiB,EAAKoB,GACpBuG,MAEU,IAARA,EAAW,KAAM,IAAIxL,OAAM,yCAE/B,IAAIsE,GAAOrE,EAAK4C,OAAOgB,EAAK2H,EAS5B,QANA3H,EAAM,EACN1B,EAAWsf,YAAYvf,EAAO,SAAU+C,GACtC,GAAImD,GAAOnI,EAAKkD,SAAS8B,EAAOX,EAChCT,GAAM5D,EAAK2C,IAAIiB,EAAK5D,EAAK+C,SAASoF,EAAMA,MAGlC0xB,GACN,IAAK,cACH,MAAO75B,GAAK4C,OAAOgB,EAAK2H,EAE1B,KAAK,SACH,MAAOvL,GAAK4C,OAAOgB,EAAK2H,EAAM,EAEhC,KAAK,WACH,GAAI2kB,GAAQtsB,YAAelD,GAAa,GAAIA,GAAU,GAAK,CAC3D,OAAe,IAAP6K,EAAY2kB,EAAOlwB,EAAK4C,OAAOgB,EAAK2H,EAAM,EAEpD,SACE,KAAM,IAAIxL,OAAM,0BAA4B85B,EAAgB,gEAlIlE,GACIn5B,IADSvB,EAAoB,GACjBa,EAAKS,KAAKC,WACtBwB,EAAa/C,EAAoB,IAEjC+hB,EAAehf,EAAWgf,aAC1BzX,EAAWtK,EAAoB,KAAKsK,SAEpCqwB,EAAwB,UA4C5B95B,GAAK,OAAS,SAAkBiC,EAAO43B,GACrC,GAAwB,GAApBhyB,UAAU7B,OACZ,KAAM,IAAIsC,aAAY,4DAGxB,IAAI4Y,EAAajf,GAAQ,CACvB,GAAwB,GAApB4F,UAAU7B,OAEZ,MAAO4zB,GAAK33B,EAAO63B,EAEhB,IAAwB,GAApBjyB,UAAU7B,OAAa,CAG9B,IAAKyD,EAASowB,GACZ,KAAM,IAAI95B,OAAM,8CAGlB,OAAO65B,GAAK33B,EAAO43B,GAUnB,KAAM,IAAIvxB,aAAY,8BAKxB,MAAOsxB,GAAK/xB,UAAWiyB,MAwDxB,SAASh7B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1B6Y,EAAYxwB,EAAK+V,UAAU0a,aAyB/Bh6B,GAAKqsB,KAAO,QAASA,GAAK1qB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAIA,IAAK,IAAW,GAALA,EACNiF,KAAKylB,KAAK1qB,GAGV0qB,EAAK,GAAInrB,GAAQS,EAAG,GAI/B,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIs4B,GAAQ,GAAI/4B,GACZS,EAAE0G,GAAK1G,EAAE0G,GAAK1G,EAAEyG,GAAKzG,EAAEyG,GAAK,EAC5B,GAAOzG,EAAEyG,GAAKzG,EAAE0G,IAEhB6xB,EAAQl6B,EAAKiD,KAAKg3B,GAClBE,EAAQ,GAAIj5B,GACZg5B,EAAM9xB,GAAKzG,EAAE0G,GACb6xB,EAAM7xB,GAAK1G,EAAEyG,IAEbgyB,EAAQp6B,EAAK8C,IAAIq3B,EAGrB,OAAO,IAAIj5B,GACP,mBAAyBk5B,EAAM/xB,GAC/B+xB,EAAMhyB,IAIZ,GAAI8Y,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG0qB,EAG/B,IAAIyB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKylB,KAAK1qB,EAGnB,IAAIA,YAAajB,GACf,MAAOq5B,GAAUp4B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1BmZ,EAAW9wB,EAAK+V,UAAUgb,uBAuB9Bt6B,GAAKssB,MAAQ,QAASA,GAAM3qB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAIA,IAAK,EACAiF,KAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEA,EAAI,GAAKA,GAE9B,IAALA,EACK,GAAIT,GAAQ0F,KAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEA,EAAI,GAAKA,GAAIiF,KAAKiZ,IAErDyM,EAAM,GAAIprB,GAAQS,EAAG,GAG9B,IAAIgI,EAAUhI,GAAI,CAGhB,GAAIk0B,GACAxJ,EAAOrsB,EAAKqsB,KAAK1qB,EAWrB,OAVI0qB,GAAKhkB,IAAM,GACbwtB,EAAOxJ,EAAKjkB,GACZikB,EAAKjkB,IAAMikB,EAAKhkB,GAChBgkB,EAAKhkB,GAAKwtB,IAEVA,EAAOxJ,EAAKhkB,GACZgkB,EAAKhkB,IAAMgkB,EAAKjkB,GAChBikB,EAAKjkB,GAAKytB,GAGLxJ,EAGT,GAAInL,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG2qB,EAG/B,IAAIwB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,EAAI,GAAIT,GAAQ,EAAG,mBAGlC,IAAIS,YAAajB,GACf,MAAO25B,GAAS14B,EAAGjB,GAAW,GAAO,EAGvC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1BqZ,EAAYhxB,EAAK+V,UAAUkb,aAyB/Bx6B,GAAKusB,KAAO,QAASA,GAAK5qB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAO,GAAMiF,KAAKmmB,KAAK,EAAIprB,GAAK84B,CAGlC,IAAI9wB,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAE0G,GACJ,MAAO,IAAInH,GAAQS,EAAEyG,GAAKxB,KAAKmmB,KAAK,EAAIprB,EAAEyG,IAAMqyB,EAAQ,EAG1D,IAAIvC,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAS7B,OARA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAMzG,EAAEyG,GAAK8vB,EACfv2B,EAAE0G,IAAM1G,EAAE0G,GAAK6vB,GACjB,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAE3BrI,EAAK+sB,KAAKprB,GAGnB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG4qB,EAG/B,IAAIuB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,kBAAqB84B,CAGpC,IAAI94B,YAAajB,GACf,MAAO65B,GAAU54B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,IAGnE,IAAI84B,GAAS,qBAMV,SAAS37B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1BwZ,EAAWnxB,EAAK+V,UAAUqb,WAuB9B36B,GAAKwsB,MAAQ,QAASA,GAAM7qB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAIA,IAAK,GAAU,IAALA,EACLuG,SAASvG,IAAMiF,KAAK9D,KAAKnB,EAAE,GAAGA,GAAKiF,KAAK9D,IAAInB,GAAGA,EAAE,KAAO,EAAI,EAE9D,EAAM6qB,EAAM,GAAItrB,GAAQS,EAAG,IAAM,GAAIT,GAAQ,EAAGu5B,EAGzD,IAAI9wB,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,GACjB,MAAO,IAAInH,GAAQ,EAAGu5B,EAIxB,IAAIvC,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAW7B,OAVA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAK8vB,GACPv2B,EAAE0G,GAAK6vB,GAET,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAG3BrI,EAAKgtB,MAAMrrB,GAGpB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG6qB,EAG/B,IAAIsB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAMqF,IAAW,GAAI9F,GAAQ,EAAGu5B,EAGzC,IAAI94B,YAAajB,GACf,MAAOg6B,GAAS/4B,EAAGjB,GAAW,EAGhC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,IAGpE,IAAI84B,GAAS,qBAMV,SAAS37B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1B0Z,EAAYrxB,EAAK+V,UAAUub,aAyB/B76B,GAAKysB,KAAO,QAASA,GAAK9qB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAS,IAALA,GAAWA,GAAK,EACXiF,KAAKimB,KAAK,EAAIlrB,GAEhB8qB,EAAK,GAAIvrB,GAAQS,EAAG,GAG7B,IAAIgI,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,GACjB,MAAO,IAAInH,GAAQu5B,EAAQzzB,IAG7B;GAAIkxB,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAS7B,OARA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAMzG,EAAEyG,GAAK8vB,EACfv2B,EAAE0G,IAAM1G,EAAE0G,GAAK6vB,GACjB,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAE3BrI,EAAK6sB,KAAKlrB,GAGnB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG8qB,EAG/B,IAAIqB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM84B,EAAS,GAAIv5B,GAAQu5B,EAAQzzB,IAG5C,IAAIrF,YAAajB,GACf,MAAOk6B,GAAUj5B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,IAGnE,IAAI84B,GAAS,qBAMV,SAAS37B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1B4Z,EAAWvxB,EAAK+V,UAAUgb,uBAuB9Bt6B,GAAK0sB,MAAQ,QAASA,GAAM/qB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GAEX,MADAA,GAAI,EAAIA,EACDiF,KAAK9D,IAAInB,EAAIiF,KAAK3D,KAAKtB,EAAEA,EAAI,GAGtC,IAAIgI,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAE0G,GAIJ,MAHA1G,GAAa,GAARA,EAAEyG,GACHxB,KAAK9D,IAAInB,EAAEyG,GAAKxB,KAAK3D,KAAKtB,EAAEyG,GAAGzG,EAAEyG,GAAK,IACtCpB,IACG,GAAI9F,GAAQS,EAAG,EAIxB,IAAIu2B,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAW7B,OAVA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAK8vB,GACPv2B,EAAE0G,GAAK6vB,GAET,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAG3BrI,EAAK8sB,MAAMnrB,GAGpB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG+qB,EAG/B,IAAIoB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,iBAAoBqF,GAGnC,IAAIrF,YAAajB,GACf,MAAOo6B,GAASn5B,EAAGjB,GAAW,GAAM,EAGtC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1B6Z,EAAYxxB,EAAK+V,UAAU0a,aAyB/Bh6B,GAAK2sB,KAAO,QAASA,GAAKhrB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAS,IAALA,GAAWA,GAAK,EACXiF,KAAKylB,KAAK,EAAI1qB,GAEhBgrB,EAAK,GAAIzrB,GAAQS,EAAG,GAG7B,IAAIgI,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,GACjB,MAAO,IAAInH,GAAQ,EAAG8F,IAGxB,IAAIkxB,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAS7B,OARA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAMzG,EAAEyG,GAAK8vB,EACfv2B,EAAE0G,IAAM1G,EAAE0G,GAAK6vB,GACjB,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAE3BrI,EAAKqsB,KAAK1qB,GAGnB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGgrB,EAG/B,IAAImB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,EAAI,GAAIT,GAAQ,EAAG8F,IAGlC,IAAIrF,YAAajB,GACf,MAAOq6B,GAAUp5B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1B8Z,EAAWzxB,EAAK+V,UAAUgb,uBAuB9Bt6B,GAAK4sB,MAAQ,QAASA,GAAMjrB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GAAI,CACf,GAAS,GAALA,GAAUA,GAAK,GAAI,CACrBA,EAAI,EAAIA,CAER,IAAI8e,GAAM7Z,KAAK3D,KAAKtB,EAAEA,EAAI,EAC1B,OAAIA,GAAI,EACCiF,KAAK9D,IAAI2d,EAAM9e,GAGjB,GAAIT,GAAQ0F,KAAK9D,IAAI2d,EAAM9e,GAAIiF,KAAKiZ,IAG7C,MAAO+M,GAAM,GAAI1rB,GAAQS,EAAG,IAG9B,GAAIgI,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAEyG,IAAmB,GAARzG,EAAE0G,GACjB,MAAO,IAAInH,GAAQ8F,IAAU,EAI/B,IAAIkxB,GAAMv2B,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,EAW7B,OAVA1G,GAAY,GAAPu2B,EACD,GAAIh3B,GACFS,EAAEyG,GAAK8vB,GACPv2B,EAAE0G,GAAK6vB,GAET,GAAIh3B,GACO,GAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,KAAa1G,EAAE0G,GAAK,GAAK,GAG3BrI,EAAKssB,MAAM3qB,GAGpB,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGirB,EAG/B,IAAIkB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,EAAIqF,GAGnB,IAAIrF,YAAajB,GACf,MAAOs6B,GAASr5B,EAAGjB,GAAW,GAAO,EAGvC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1B+Z,EAAY1xB,EAAK+V,UAAUub,aAyB/B76B,GAAK6sB,KAAO,QAASA,GAAKlrB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAIA,IAAK,IAAW,GAALA,EACNiF,KAAKimB,KAAKlrB,GAGVkrB,EAAK,GAAI3rB,GAAQS,EAAG,GAI/B,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIyG,GAAKzG,EAAEyG,GACPC,EAAK1G,EAAE0G,GACP4xB,EAAQ,GAAI/4B,GACZmH,EAAKA,EAAKD,EAAKA,EAAK,EACpB,GAAOA,EAAKC,GAEZ6xB,EAAQl6B,EAAKiD,KAAKg3B,GAClBE,EAAQ,GAAIj5B,GACZg5B,EAAM9xB,GAAKC,EACX6xB,EAAM7xB,GAAKD,GAEXgyB,EAAQp6B,EAAK8C,IAAIq3B,EAErB,OAAO,IAAIj5B,GAAQk5B,EAAM/xB,IAAK+xB,EAAMhyB,IAGtC,GAAI8Y,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGkrB,EAG/B,IAAIiB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKimB,KAAKlrB,EAGnB,IAAIA,YAAajB,GACf,MAAOu6B,GAAUt5B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1Bga,EAAW3xB,EAAK+V,UAAUgb,uBAuB9Bt6B,GAAK8sB,MAAQ,QAASA,GAAMnrB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAOiF,MAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEA,EAAI,GAAKA,EAGvC,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIk0B,GAAOl0B,EAAE0G,EACb1G,GAAE0G,IAAM1G,EAAEyG,GACVzG,EAAEyG,GAAKytB,CAEP,IAAIhJ,GAAO7sB,EAAK6sB,KAAKlrB,EAUrB,OAPAA,GAAEyG,IAAMzG,EAAE0G,GACV1G,EAAE0G,GAAKwtB,EAEPA,EAAOhJ,EAAKzkB,GACZykB,EAAKzkB,IAAMykB,EAAKxkB,GAChBwkB,EAAKxkB,GAAKwtB,EAEHhJ,EAGT,GAAI3L,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGmrB,EAG/B,IAAIgB,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAM,iBAAoB,CAGnC,IAAIA,YAAajB,GACf,MAAOw6B,GAASv5B,EAAGjB,GAAW,GAAM,EAGtC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBuX,EAAehf,EAAWgf,aAE1Bia,EAAY5xB,EAAK+V,UAAUkb,aAyB/Bx6B,GAAK+sB,KAAO,QAASA,GAAKprB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAOiF,MAAKmmB,KAAKprB,EAGnB,IAAIgI,EAAUhI,GAAI,CAChB,GAAY,GAARA,EAAEyG,GAAS,CACb,GAAY,GAARzG,EAAE0G,GACJ,MAAO,IAAInH,GAAQ,EAAG8F,IAExB,IAAY,IAARrF,EAAE0G,GACJ,MAAO,IAAInH,GAAQ,GAAI8F,KAK3B,GAAIoB,GAAKzG,EAAEyG,GACPC,EAAK1G,EAAE0G,GACP6vB,EAAM9vB,EAAKA,GAAM,EAAMC,IAAO,EAAMA,GAEpC4xB,EAAQ,GAAI/4B,IACX,EAAMmH,EAAKA,EAAKD,EAAKA,GAAM8vB,EAC3B,GAAO9vB,EAAM8vB,GAEdgC,EAAQl6B,EAAK8C,IAAIm3B,EAErB,OAAO,IAAI/4B,IACN,GAAMg5B,EAAM7xB,GACb,GAAM6xB,EAAM9xB,IAIlB,GAAI8Y,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGorB,EAG/B,IAAIe,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKmmB,KAAKprB,EAGnB,IAAIA,YAAajB,GACf,MAAOy6B,GAAUx5B,EAAGjB,GAAW,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAE5B5M,GADYhgB,EAAQyI,UACLzH,EAAWgf,aA+B9BlhB,GAAKuK,MAAQ,QAASA,GAAMtC,EAAGtG,GAC7B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAASuB,IACPvB,EAAS/E,GACX,MAAOiF,MAAK2D,MAAMtC,EAAGtG,EAMzB,IAAIuf,EAAajZ,IAAMiZ,EAAavf,GAClC,MAAOO,GAAWkf,SAASnZ,EAAGtG,EAAG4I,EAGnC,IAAIujB,EAAU7lB,IAAY,OAANA,EAClB,MAAOsC,IAAOtC,EAAGtG,EAEnB,IAAImsB,EAAUnsB,IAAY,OAANA,EAClB,MAAO4I,GAAMtC,GAAItG,EAInB,IAAIsG,YAAavH,GACf,MAAO6J,GAAMtC,EAAElG,WAAYJ,EAE7B,IAAIA,YAAajB,GACf,MAAO6J,GAAMtC,EAAGtG,EAAEI,WAGpB,MAAM,IAAI/B,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAUiI,GAAIjI,EAAK,UAAU2B,OAOpF,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UAEpBuX,GADS5f,EAAKkI,OACCtH,EAAWgf,cAE1Bka,EAAW7xB,EAAK+V,UAAUqb,WAuB9B36B,GAAKgtB,MAAQ,QAASA,GAAMrrB,GAC1B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,IAAIU,EAAS/E,GACX,MAAS,IAALA,GAAUA,GAAK,GACViF,KAAK9D,KAAK,EAAInB,IAAI,EAAIA,IAAM,EAE9BqrB,EAAM,GAAI9rB,GAAQS,EAAG,GAG9B,IAAIgI,EAAUhI,GAAI,CAEhB,GAAI05B,GAAO15B,EAAEyG,GAAK,GAAa,GAARzG,EAAE0G,GAErBizB,EAAW,EAAI35B,EAAEyG,GACjBmzB,EAAU,EAAI55B,EAAEyG,GAChB8vB,EAAMoD,EAASA,EAAW35B,EAAE0G,GAAG1G,EAAE0G,EACrC1G,GAAY,GAAPu2B,EACD,GAAIh3B,IACDq6B,EAAQD,EAAW35B,EAAE0G,GAAG1G,EAAE0G,IAAM6vB,GAChCv2B,EAAE0G,GAAGizB,EAAWC,EAAQ55B,EAAE0G,IAAM6vB,GAEnC,GAAIh3B,GACO,IAARS,EAAEyG,GAAazG,EAAEyG,GAAK,EAAK,EACnB,GAARzG,EAAE0G,GAAY1G,EAAE0G,GAAK,EAAK,EAGjC,IAAIwtB,GAAOl0B,EAAEyG,EAOb,OANAzG,GAAEyG,GAAKxB,KAAK9D,IAAI8D,KAAK3D,KAAKtB,EAAEyG,GAAGzG,EAAEyG,GAAKzG,EAAE0G,GAAG1G,EAAE0G,KAAO,EACpD1G,EAAE0G,GAAKzB,KAAK2D,MAAM5I,EAAE0G,GAAIwtB,GAAQ,EAE5BwF,IACF15B,EAAE0G,IAAM1G,EAAE0G,IAEL1G,EAGT,GAAIuf,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGqrB,EAG/B,IAAIc,EAAUnsB,IAAY,OAANA,EAClB,MAAO,GAAMqF,IAAW,CAG1B,IAAIrF,YAAajB,GACf,MAAO06B,GAASz5B,EAAGjB,GAAW,EAGhC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,QAAStgB,EAAK,UAAU2B,OAOjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bsa,EAASjyB,EAAK+V,UAAUmc,eA4B5Bz7B,GAAKmK,IAAM,QAASA,GAAIxI,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAOiF,MAAKuD,IAAIxI,EAGlB,IAAIgI,EAAUhI,GAEZ,MAAO,IAAIT,GACP0F,KAAKuD,IAAIxI,EAAEyG,IAAMpI,EAAKitB,MAAMtrB,EAAE0G,IAC9BzB,KAAKwD,IAAIzI,EAAEyG,IAAMpI,EAAKutB,MAAM5rB,EAAE0G,IAIpC,IAAImB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO4E,MAAKuD,IAAIxI,EAAEqD,OAGpB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGwI,EAG/B,IAAI2jB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKuD,IAAIxI,EAGlB,IAAIA,YAAajB,GACf,MAAO86B,GAAO75B,EAAGjB,EAAW,GAAG,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bwa,EAAUnyB,EAAK+V,UAAUqc,mBAuB7B37B,GAAKitB,KAAO,QAASA,GAAKtrB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,OAAQiF,KAAK/D,IAAIlB,GAAKiF,KAAK/D,KAAKlB,IAAM,CAGxC,IAAIgI,EAAUhI,GAAI,CAChB,GAAIi6B,GAAKh1B,KAAK/D,IAAIlB,EAAEyG,IAChByzB,EAAKj1B,KAAK/D,KAAKlB,EAAEyG,GACrB,OAAO,IAAIlH,GAAQ0F,KAAKuD,IAAIxI,EAAE0G,KAAOuzB,EAAKC,GAAM,EAAGj1B,KAAKwD,IAAIzI,EAAE0G,KAAOuzB,EAAKC,GAAM,GAGlF,GAAIryB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOirB,GAAKtrB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGsrB,EAG/B,IAAIa,EAAUnsB,IAAY,OAANA,EAClB,MAAOsrB,GAAKtrB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAOg7B,GAAQ/5B,EAAGjB,GAAW,GAAO,EAGtC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1B4a,EAASvyB,EAAK+V,UAAUyc,OAuB5B/7B,GAAKktB,IAAM,QAASA,GAAIvrB,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAO,GAAIiF,KAAK4mB,IAAI7rB,EAGtB,IAAIgI,EAAUhI,GAAI,CAChB,GAAIu2B,GAAMtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,IACxB,EAAMzB,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAKuD,IAAI,EAAMxI,EAAEyG,IAAM,CAEzD,OAAO,IAAIlH,GACP,EAAM0F,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAKwD,IAAI,EAAMzI,EAAEyG,IAAM8vB,GACpDtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAM,GAAO6vB,GAItC,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO,GAAI4E,KAAK4mB,IAAI7rB,EAAEqD,OAGxB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGurB,EAG/B,IAAIY,EAAUnsB,IAAY,OAANA,EAClB,MAAOurB,IAAKvrB,EAGd,IAAIA,YAAajB,GACf,MAAOo7B,GAAOn6B,EAAGjB,GAAW,EAG9B,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1B8a,EAAUzyB,EAAK+V,UAAU2c,SAyB7Bj8B,GAAKmtB,KAAO,QAASA,GAAKxrB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GAAI,CACf,GAAIwE,GAAIS,KAAK/D,IAAI,EAAIlB,EACrB,QAAQwE,EAAI,IAAMA,EAAI,GAGxB,GAAIwD,EAAUhI,GAAI,CAChB,GAAI+G,GAAI9B,KAAK/D,IAAI,EAAIlB,EAAEyG,IACnBA,EAAKM,EAAI9B,KAAKuD,IAAI,EAAIxI,EAAE0G,IACxBA,EAAKK,EAAI9B,KAAKwD,IAAI,EAAIzI,EAAE0G,IACxB6vB,GAAO9vB,EAAK,IAAMA,EAAK,GAAKC,EAAKA,CACrC,OAAO,IAAInH,KACPkH,EAAK,IAAMA,EAAK,GAAKC,EAAKA,GAAM6vB,EAClC,GAAK7vB,EAAK6vB,GAId,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOmrB,GAAKxrB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGwrB,EAG/B,IAAIW,EAAUnsB,IAAY,OAANA,EAClB,MAAOwrB,GAAKxrB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAOs7B,GAAQr6B,EAAGjB,GAAW,EAG/B,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bgb,EAAS3yB,EAAK+V,UAAUmc,eAuB5Bz7B,GAAKotB,IAAM,QAASA,GAAIzrB,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAO,GAAIiF,KAAKwD,IAAIzI,EAGtB,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIu2B,GAAM,KAAQtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAK/D,IAAI,EAAMlB,EAAE0G,KACvD,GAAMzB,KAAKuD,IAAI,EAAMxI,EAAEyG,GAE3B,OAAO,IAAIlH,GACP,GAAM0F,KAAKwD,IAAIzI,EAAEyG,KAAOxB,KAAK/D,KAAKlB,EAAE0G,IAAMzB,KAAK/D,IAAIlB,EAAE0G,KAAO6vB,EAC5D,GAAMtxB,KAAKuD,IAAIxI,EAAEyG,KAAOxB,KAAK/D,KAAKlB,EAAE0G,IAAMzB,KAAK/D,IAAIlB,EAAE0G,KAAO6vB,GAIlE,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO,GAAI4E,KAAKwD,IAAIzI,EAAEqD,OAGxB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGyrB,EAG/B,IAAIU,EAAUnsB,IAAY,OAANA,EAClB,MAAOyrB,IAAKzrB,EAGd,IAAIA,YAAajB,GACf,MAAOw7B,GAAOv6B,EAAGjB,EAAW,GAAG,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IACjCgB,EAASoJ,EAAKpJ,OAEduG,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bib,EAAU5yB,EAAK+V,UAAUqc,mBAyB7B37B,GAAKqtB,KAAO,QAASA,GAAK1rB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GAEX,MAAS,IAALA,EAAesD,OAAOusB,kBAEnB5qB,KAAKlE,IAAI,GAAKkE,KAAK/D,IAAIlB,GAAKiF,KAAK/D,KAAKlB,KAAOxB,EAAO2G,KAAKnF,EAGlE,IAAIgI,EAAUhI,GAAI,CAChB,GAAIi6B,GAAKh1B,KAAK/D,IAAIlB,EAAEyG,IAChByzB,EAAKj1B,KAAK/D,KAAKlB,EAAEyG,IACjBA,EAAKxB,KAAKuD,IAAIxI,EAAE0G,KAAOuzB,EAAKC,GAC5BxzB,EAAKzB,KAAKwD,IAAIzI,EAAE0G,KAAOuzB,EAAKC,GAC5B3D,EAAM9vB,EAAKA,EAAKC,EAAKA,CACzB,OAAO,IAAInH,GAAQ,EAAIkH,EAAK8vB,EAAK,GAAK7vB,EAAI6vB,GAG5C,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOqrB,GAAK1rB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG0rB,EAG/B,IAAIS,EAAUnsB,IAAY,OAANA,EAClB,MAAO0rB,GAAK1rB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAOy7B,GAAQx6B,EAAGjB,GAAW,GAAM,EAGrC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bkb,EAAS7yB,EAAK+V,UAAUmc,eAuB5Bz7B,GAAK0Z,IAAM,QAASA,GAAI/X,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAO,GAAIiF,KAAKuD,IAAIxI,EAGtB,IAAIgI,EAAUhI,GAAI,CAEhB,GAAIu2B,GAAM,KAAQtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAK/D,IAAI,EAAMlB,EAAE0G,KACvD,GAAMzB,KAAKuD,IAAI,EAAMxI,EAAEyG,GAE3B,OAAO,IAAIlH,GACP,GAAM0F,KAAKuD,IAAIxI,EAAEyG,KAAOxB,KAAK/D,KAAKlB,EAAE0G,IAAMzB,KAAK/D,IAAKlB,EAAE0G,KAAO6vB,EAC7D,GAAMtxB,KAAKwD,IAAIzI,EAAEyG,KAAOxB,KAAK/D,IAAKlB,EAAE0G,IAAMzB,KAAK/D,KAAKlB,EAAE0G,KAAO6vB,GAInE,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO,GAAI4E,KAAKuD,IAAIxI,EAAEqD,OAGxB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG+X,EAG/B,IAAIoU,EAAUnsB,IAAY,OAANA,EAClB,MAAO+X,IAAK/X,EAGd,IAAIA,YAAajB,GACf,MAAO07B,GAAOz6B,EAAGjB,EAAW,GAAG,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bmb,EAAU9yB,EAAK+V,UAAUqc,mBAyB7B37B,GAAKstB,KAAO,QAASA,GAAK3rB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAO,IAAKiF,KAAK/D,IAAIlB,GAAKiF,KAAK/D,KAAKlB,GAGtC,IAAIgI,EAAUhI,GAAI,CAChB,GAAIi6B,GAAKh1B,KAAK/D,IAAIlB,EAAEyG,IAChByzB,EAAKj1B,KAAK/D,KAAKlB,EAAEyG,IACjBA,EAAKxB,KAAKuD,IAAIxI,EAAE0G,KAAOuzB,EAAKC,GAC5BxzB,EAAKzB,KAAKwD,IAAIzI,EAAE0G,KAAOuzB,EAAKC,GAC5B3D,EAAM9vB,EAAKA,EAAKC,EAAKA,CACzB,OAAO,IAAInH,GAAQ,EAAIkH,EAAK8vB,EAAK,GAAK7vB,EAAK6vB,GAG7C,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOsrB,GAAK3rB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG2rB,EAG/B,IAAIQ,EAAUnsB,IAAY,OAANA,EAClB,MAAO2rB,GAAK3rB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAO27B,GAAQ16B,EAAGjB,GAAW,GAAO,EAGtC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bob,EAAS/yB,EAAK+V,UAAUmc,eA4B5Bz7B,GAAKoK,IAAM,QAASA,GAAIzI,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAOiF,MAAKwD,IAAIzI,EAGlB,IAAIgI,EAAUhI,GACZ,MAAO,IAAIT,GACP0F,KAAKwD,IAAIzI,EAAEyG,IAAMpI,EAAKitB,MAAMtrB,EAAE0G,IAC9BzB,KAAKuD,IAAIxI,EAAEyG,IAAMpI,EAAKutB,KAAK5rB,EAAE0G,IAInC,IAAImB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO4E,MAAKwD,IAAIzI,EAAEqD,OAGpB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAGyI,EAG/B,IAAI0jB,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAKwD,IAAIzI,EAGlB,IAAIA,YAAajB,GACf,MAAO47B,GAAO36B,EAAGjB,EAAW,GAAG,EAGjC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bqb,EAAUhzB,EAAK+V,UAAUqc,mBAuB7B37B,GAAKutB,KAAO,QAASA,GAAK5rB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GACX,MAAIiF,MAAKlE,IAAIf,GAAK,EACTA,EAAKA,EAAIA,EAAIA,EAAK,EAAKA,EAAIA,EAAIA,EAAIA,EAAIA,EAAK,KAE3CiF,KAAK/D,IAAIlB,GAAKiF,KAAK/D,KAAKlB,IAAM,CAI1C,IAAIgI,EAAUhI,GAAI,CAChB,GAAI66B,GAAM51B,KAAKuD,IAAIxI,EAAE0G,IACjBo0B,EAAM71B,KAAKwD,IAAIzI,EAAE0G,IACjBuzB,EAAKh1B,KAAK/D,IAAIlB,EAAEyG,IAChByzB,EAAKj1B,KAAK/D,KAAKlB,EAAEyG,GACrB,OAAO,IAAIlH,GAAQs7B,GAAOZ,EAAKC,GAAM,EAAGY,GAAOb,EAAKC,GAAM,GAG5D,GAAIryB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOurB,GAAK5rB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG4rB,EAG/B,IAAIO,EAAUnsB,IAAY,OAANA,EAClB,MAAO4rB,GAAK5rB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAO67B,GAAQ56B,EAAGjB,GAAW,GAAM,EAGrC,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Bwb,EAASnzB,EAAK+V,UAAUyc,OAyB5B/7B,GAAKwtB,IAAM,QAASA,GAAI7rB,GACtB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIU,EAAS/E,GACX,MAAOiF,MAAK4mB,IAAI7rB,EAGlB,IAAIgI,EAAUhI,GAAI,CAChB,GAAIu2B,GAAMtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,IACxB,EAAMzB,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAKuD,IAAI,EAAMxI,EAAEyG,IAC/C,CAEJ,OAAO,IAAIlH,GACP,EAAM0F,KAAK/D,IAAI,GAAOlB,EAAE0G,IAAMzB,KAAKwD,IAAI,EAAMzI,EAAEyG,IAAM8vB,GACpD,EAAMtxB,KAAK/D,IAAI,GAAOlB,EAAE0G,KAAO6vB,GAItC,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,mCAEvB,OAAO4E,MAAK4mB,IAAI7rB,EAAEqD,OAGpB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG6rB,EAG/B,IAAIM,EAAUnsB,IAAY,OAANA,EAClB,MAAOiF,MAAK4mB,IAAI7rB,EAGlB,IAAIA,YAAajB,GACf,MAAOg8B,GAAO/6B,EAAGjB,GAAW,EAG9B,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAO/D,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BuB,EAAYV,EAAKS,KAAKC,UACtBQ,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCuH,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,UAC5BnkB,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,aAE1Byb,EAAUpzB,EAAK+V,UAAU2c,SA0B7Bj8B,GAAKytB,KAAO,QAASA,GAAK9rB,GACxB,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAGhE,IAAIU,EAAS/E,GAAI,CACf,GAAIwE,GAAIS,KAAK/D,IAAI,EAAIlB,EACrB,QAAQwE,EAAI,IAAMA,EAAI,GAGxB,GAAIwD,EAAUhI,GAAI,CAChB,GAAI+G,GAAI9B,KAAK/D,IAAI,EAAIlB,EAAEyG,IACnBA,EAAKM,EAAI9B,KAAKuD,IAAI,EAAIxI,EAAE0G,IACxBA,EAAKK,EAAI9B,KAAKwD,IAAI,EAAIzI,EAAE0G,IACxB6vB,GAAO9vB,EAAK,IAAMA,EAAK,GAAKC,EAAKA,CACrC,OAAO,IAAInH,KACPkH,EAAK,IAAMA,EAAK,GAAKC,EAAKA,GAAM6vB,EAC7B,EAAL7vB,EAAS6vB,GAIb,GAAI1uB,EAAO7H,GAAI,CACb,IAAKA,EAAEqI,QAAQ1I,EAAK2I,WAAWC,OAC7B,KAAM,IAAIlI,WAAW,oCAEvB,OAAOyrB,GAAK9rB,EAAEqD,OAGhB,GAAIkc,EAAavf,GACf,MAAOO,GAAWif,QAAQxf,EAAG8rB,EAG/B,IAAIK,EAAUnsB,IAAY,OAANA,EAClB,MAAO8rB,GAAK9rB,EAAI,EAAI,EAGtB,IAAIA,YAAajB,GACf,MAAOi8B,GAAQh7B,EAAGjB,GAAW,EAG/B,MAAM,IAAIV,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,OAOhE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BmC,EAAOnC,EAAoB,GAC3B+C,EAAa/C,EAAoB,IAEjCsK,EAAWF,EAAKG,OAAOD,SACvBD,EAASlI,EAAKkI,OACd0X,EAAehf,EAAWgf,YA0B9BlhB,GAAK8B,GAAK,QAASA,GAAGH,EAAGoN,GACvB,GAAwB,GAApBlH,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,KAAMvY,UAAU7B,OAAQ,EAG9D,IAAIwD,EAAO7H,KACL6H,EAAOuF,IAAStF,EAASsF,IAC3B,MAAOpN,GAAEG,GAAGiN,EAMhB,IAAImS,EAAavf,IAAMuf,EAAanS,GAClC,MAAO7M,GAAWkf,SAASzf,EAAGoN,EAAMjN,EAGtC,MAAM,IAAI9B,GAAKiB,MAAMqf,qBAAqB,KAAMtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAU+O,OAOjF,SAASjQ,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAC3BoB,EAASgJ,EAAKhJ,MAoBlBP,GAAKa,MAAQ,SAAgBc,GAC3B,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,QAASvY,UAAU7B,OAAQ,EAGjE,OAAOzF,GAAOM,MAAMc,MAOnB,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAyDzB,QAAS+tB,GAAQpsB,EAAGqsB,GAClB,GAAoB,kBAATA,GACT,MAAOrsB,GAAEqC,OAAO,SAAU44B,GACxB,MAAO5O,GAAK4O,IAGX,IAAI5O,YAAgB1oB,QACvB,MAAO3D,GAAEqC,OAAO,SAAU44B,GACxB,MAAO5O,GAAKA,KAAK4O,IAInB,MAAM,IAAI56B,WAAU,+BApExB,GAAIX,GAASlC,EAAoB,EA6BjCa,GAAKgE,OAAS,SAAUrC,EAAGqsB,GACzB,GAAyB,IAArBnmB,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAGlE,IAAIrE,YAAaN,GAAQ,CACvB,GAAIoK,GAAO9J,EAAE8J,MACb,IAAIA,EAAKzF,OAAS,EAChB,KAAM,IAAIjG,OAAM,0CAElB,OAAO,IAAIsB,GAAO0sB,EAAQpsB,EAAEkK,UAAWmiB,IAEpC,GAAIlpB,MAAMC,QAAQpD,GACrB,MAAOosB,GAAQpsB,EAAGqsB,EAGlB,MAAM,IAAIhuB,GAAKiB,MAAMqf,qBAAqB,SAAUtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAU8rB,aA8BvF,SAAShtB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAC3BuK,EAASH,EAAKG,MAkElB1J,GAAK+G,OAAS,SAAiB/B,EAAO1E,GACpC,GAAIiL,GAAM1D,UAAU7B,MACpB,IAAY,IAARuF,GAAqB,IAARA,EACf,KAAM,IAAIvL,GAAKiB,MAAMmf,eAAe,SAAU7U,EAAK,EAAG,EAGxD,OAAO7B,GAAO3C,OAAO/B,EAAO1E,MAO3B,SAASxB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA2GzB,QAAS68B,GAAQjuB,EAAM5J,EAAO1E,IACxBA,EAAQw8B,UAA2Bj4B,SAAf7E,EAAK4O,MAEvBtO,EAAQy8B,MAAyB,kBAAV/3B,IAEzBhF,EAAK4O,GAAQ,WAEX,IAAK,GADD1D,MACKpF,EAAI,EAAGC,EAAM8B,UAAU7B,OAAYD,EAAJD,EAASA,IAAK,CACpD,GAAIyC,GAAMV,UAAU/B,EACpBoF,GAAKpF,GAAKyC,GAAOA,EAAIrD,UAEvB,MAAOF,GAAMsH,MAAMtM,EAAMkL,IAEvBlG,GAASA,EAAMlB,YACjB9D,EAAK4O,GAAM9K,UAAYkB,EAAMlB,YAK/B9D,EAAK4O,GAAQ5J,EAIXA,GAASA,EAAMlB,YACjB9D,EAAKmC,WAAW2B,UAAU8K,GAAQ5J,EAAMlB,WAI1C9D,EAAKwE,SAASC,MAAMiqB,YAAY9f,EAAM5J,IAU1C,QAASg4B,GAAgBz8B,GACvB,MAAyB,kBAAVA,IACXmG,EAASnG,IAAWkJ,EAASlJ,IAC7BoJ,EAAUpJ,IAAWiJ,EAAOjJ,GAnJlC,GAAIgJ,GAAOpK,EAAoB,KAE3B+B,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAE3BuH,EAAW6C,EAAKpJ,OAAOuG,SACvB+C,EAAWF,EAAKG,OAAOD,SACvBE,EAAYzI,EAAQyI,UACpBH,EAASlI,EAAKkI,MA+ClBxJ,GAAK,UAAY,QAASi9B,GAAY18B,EAAQD,GAC5C,GAAIiL,GAAM1D,UAAU7B,MACpB,IAAW,GAAPuF,GAAmB,GAAPA,EACd,KAAM,IAAIvL,GAAKiB,MAAMmf,eAAe,SAAU7U,EAAK,EAAG,EAGxD,IAAIqD,GACAsuB,GACFJ,SAAUx8B,GAAWA,EAAQw8B,WAAY,EACzCC,KAAUz8B,GAAWA,EAAQy8B,OAAQ,EAGvC,IAAItzB,EAASlJ,GAAS,CAMlB,GAAI48B,GAAUh+B,EAAoB,KAAKoB,EACvC08B,GAAYE,EAAS78B,OAMpB,CAAA,GAAsB,gBAAXC,GAed,KAAM,IAAIyB,WAAU,iCAbpB,KAAK4M,IAAQrO,GACX,GAAIA,EAAOiF,eAAeoJ,GAAO,CAC/B,GAAI5J,GAAQzE,EAAOqO,EACfouB,GAAgBh4B,GAClB63B,EAAQjuB,EAAM5J,EAAOk4B,GAGrBD,EAAYj4B,EAAO1E,QAkE1B,SAASxB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GA0CzB,QAASwuB,GAAWC,EAAS9iB,GAC3B,GAAIgD,GAAU,SAAU3J,EAAOd,GAC7B,MAAIY,OAAMC,QAAQC,GACTA,EAAMb,IAAI,SAAUoJ,EAAOzH,GAEhC,MAAO6I,GAAQpB,EAAOrJ,EAAMH,OAAO+B,MAI9B6F,EAAS3G,EAAOd,EAAOuqB,GAIlC,OAAO9f,GAAQ8f,MAtDjB,GAAIptB,GAASlC,EAAoB,EA2BjCa,GAAKmE,IAAM,SAAUxC,EAAGgK,GACtB,GAAwB,GAApB9D,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,MAAOvY,UAAU7B,OAAQ,EAG/D,IAAIlB,MAAMC,QAAQpD,GAChB,MAAO6sB,GAAU7sB,EAAGgK,EACf,IAAIhK,YAAaN,GACtB,MAAOM,GAAEwC,IAAIwH,EAEb,MAAM,IAAI3L,GAAKiB,MAAMqf,qBAAqB,MAAOtgB,EAAK,UAAU2B,OAwBjE,SAAS7C,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIuJ,GAAOpK,EAAoB,KAE3BsK,EAAWF,EAAKG,OAAOD,QAqC3BzJ,GAAKo9B,MAAQ,SAAgBC,EAAU9wB,EAAQnM,GAC7C,GAAImL,GAAM1D,UAAU7B,MACpB,IAAW,GAAPuF,GAAmB,GAAPA,EACd,KAAM,IAAIvL,GAAKiB,MAAMmf,eAAe,QAAS7U,EAAK,EAAG,EAGvD,KAAK9B,EAAS4zB,GACZ,KAAM,IAAIr7B,WAAU,wDAEtB,MAAMuK,YAAkBzM,SACtB,KAAM,IAAIkC,WAAU,yDAItB,OAAOq7B,GAASz1B,QAAQ,eAAgB,SAAU01B,EAAU/3B,GAGtD,IAFA,GAAIg4B,GAAOh4B,EAAI4F,MAAM,KACjBnG,EAAQuH,EAAOgxB,EAAKhJ,SACjBgJ,EAAKv3B,QAAoBnB,SAAVG,GAAqB,CACzC,GAAI+L,GAAIwsB,EAAKhJ,OACbvvB,GAAQ+L,EAAI/L,EAAM+L,GAAK/L,EAAQ,IAGjC,MAAcH,UAAVG,EACGyE,EAASzE,GAILA,EAHAhF,EAAK+G,OAAO/B,EAAO5E,GAOvBk9B,OASZ,SAASx+B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAIqB,GAASlC,EAAoB,EA+BjCa,GAAK0tB,KAAO,SAAU/rB,EAAGmqB,GACvB,GAAI0R,GAAW,IAEf,IAAyB,IAArB31B,UAAU7B,OACZw3B,EAAWx9B,EAAK8rB,YAEb,CAAA,GAAyB,IAArBjkB,UAAU7B,OAiBjB,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,OAAQvY,UAAU7B,OAAQ,EAAG,EAhBjE,IAAuB,kBAAZ8lB,GACT0R,EAAW1R,MAER,IAAgB,QAAZA,EACP0R,EAAWx9B,EAAK8rB,YAEb,CAAA,GAAgB,SAAZA,EAMP,KAAM,IAAI9rB,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAU8rB,GALpF0R,GAAW,SAAU93B,EAAGC,GACtB,OAAQ3F,EAAK8rB,QAAQpmB,EAAGC,KAW9B,GAAIhE,YAAaN,GAAQ,CACvB,GAAIoK,GAAO9J,EAAE8J,MACb,IAAIA,EAAKzF,OAAS,EAChB,KAAM,IAAIjG,OAAM,0CAElB,OAAO,IAAIsB,GAAOM,EAAEkK,UAAU6hB,KAAK8P,IAEhC,GAAI14B,MAAMC,QAAQpD,GACrB,MAAOA,GAAE+rB,KAAK8P,EAGd,MAAM,IAAIx9B,GAAKiB,MAAMqf,qBAAqB,OAAQtgB,EAAK,UAAU2B,GAAI3B,EAAK,UAAU8rB,OAOrF,SAAShtB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GACzB,GAAI0B,GAAQvC,EAAoB,KAE5B+B,EAAU/B,EAAoB,GAC9BkC,EAASlC,EAAoB,GAC7BmC,EAAOnC,EAAoB,GAC3BiC,EAAQjC,EAAoB,GAC5BgC,EAAQhC,EAAoB,GAC5BoC,EAAOpC,EAAoB,EAyC/Ba,GAAK,UAAY,SAAkB2B,GACjC,GAAwB,GAApBkG,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAIlE,IAAIvF,GAAOiB,EAAMjB,KAAKkB,EAGtB,IAAa,WAATlB,EAAmB,CACrB,GAAIkB,YAAaT,GAAS,MAAO,SACjC,IAAIS,YAAaN,GAAQ,MAAO,QAChC,IAAIM,YAAaL,GAAM,MAAO,MAC9B,IAAIK,YAAaP,GAAO,MAAO,OAC/B,IAAIO,YAAaR,GAAO,MAAO,OAC/B,IAAIQ,YAAaJ,GAAM,MAAO,MAG9B,IAAII,YAAa3B,GAAKS,KAAKC,UAAW,MAAO,WAC7C,IAAIiB,YAAa3B,GAAKwE,SAASC,MAAO,MAAO,QAG/C,MAAOhE,MAON,SAAS3B,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUmB,GAwCzB,QAASsuB,GAAersB,EAAO0J,GAC7B,GAAIgD,GAAU,SAAU3J,EAAOd,GACzBY,MAAMC,QAAQC,GAChBA,EAAMf,QAAQ,SAAUsJ,EAAOzH,GAE7B6I,EAAQpB,EAAOrJ,EAAMH,OAAO+B,MAI9B6F,EAAS3G,EAAOd,EAAOjC,GAG3B0M,GAAQ1M,MAnDV,GAAIZ,GAASlC,EAAoB,EAyBjCa,GAAKiE,QAAU,SAAUtC,EAAGgK,GAC1B,GAAwB,GAApB9D,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,UAAWvY,UAAU7B,OAAQ,EAGnE,IAAIlB,MAAMC,QAAQpD,GAChB,MAAO2sB,GAAc3sB,EAAGgK,EACnB,IAAIhK,YAAaN,GACtB,MAAOM,GAAEsC,QAAQ0H,EAEjB,MAAM,IAAI3L,GAAKiB,MAAMqf,qBAAqB,UAAWtgB,EAAK,UAAU2B,OAsBrE,SAAS7C,OAAQD,QAASM,qBAE/B,GAAIs+B,gCAAgCC,6BAA8BC,+BAOjE,SAAU/+B,GAGL8+B,gCAAmCD,+BAAiC,EAAWE,8BAA2E,kBAAnCF,gCAAiDA,+BAA+BnxB,MAAMzN,QAAS6+B,8BAAiCD,iCAAmE54B,SAAlC84B,gCAAgD7+B,OAAOD,QAAU8+B,iCAU7V,WACA,YAQA,SAASC,aAAYn9B,GACnB,GAAIutB,GAAOvsB,MAAMC,MAAMjB,EACvB,KAAKutB,EAAM,CACT,GAAI6P,GAAU/9B,OAAOy9B,KAAK97B,MAAMC,OAC3BsC,OAAO,SAAUssB,GAChB,MAAOA,GAAEyD,eAAiBtzB,EAAKszB,gBAEhC5vB,IAAI,SAAUmsB,GACb,MAAO,IAAMA,EAAI,KAGvB,MAAM,IAAIvwB,OAAM,iBAAmBU,EAAO,KACrCo9B,EAAQ73B,OAAU,kBAAoB63B,EAAQjxB,KAAK,SAAW,IAAO,KAE5E,MAAOohB,GAiBT,QAAShK,aAAY3d,EAAI6E,EAAMhH,EAAO45B,GACpC,GAII/V,GAJAgW,EAAS7yB,EAAKhH,GACd85B,EAAaC,UAAUF,GACvBG,EAAYJ,EAAWA,EAAS3yB,MAAM,KAAO,KAC7CgzB,EAAUD,GAAaE,SAASF,EAAW,OAE3CrxB,GACFxG,GAAIA,EACJnC,MAAOA,EACP65B,OAAQA,EACRD,SAAUI,EASRnW,GAHAmW,EACEhzB,EAAKlF,OAAS9B,IAAUi6B,EAEhB,0CACWD,EAAUtxB,KAAK,QAAU,aAAeoxB,EAAa,YAAc95B,EAAQ,IAItF,gCACSg6B,EAAUtxB,KAAK,QAAU,YAAc1I,EAAQ,IAK1D,iCACWA,EAAQ,aAAegH,EAAKlF,OAAS,GAG5D,IAAI4J,GAAM,GAAI5N,WAAU+lB,EAExB,OADAnY,GAAI/C,KAAOA,EACJ+C,EAST,QAASyuB,MAAKzvB,GACZ3P,KAAK2P,KAAOA,GAAQ,OACpB3P,KAAKq/B,cA+CP,QAASC,OAAM78B,EAAO88B,GAEpB,GAAqB,gBAAV98B,GAAoB,CAE7B,GAAI+8B,GAAS/8B,EAAMg9B,OACfC,EAAmC,QAAxBF,EAAOxH,OAAO,EAAG,EAC5B0H,KACFF,EAASA,EAAOxH,OAAO,IAGvBh4B,KAAKyC,MADQ,KAAX+8B,GACY,OAGDA,EAAOtzB,MAAM,KAAKhH,IAAI,SAAU1D,GAC3C,MAAOA,GAAKi+B,aAIb,CAAA,IAAI55B,MAAMC,QAAQrD,GAGlB,CAAA,GAAIA,YAAiB68B,OACxB,MAAO78B,GAAMb,OAGb,MAAM,IAAId,OAAM,4BANhBd,KAAKyC,MAAQA,EAUfzC,KAAK2C,eAIL3C,KAAKu/B,QAAUG,GAAYH,IAAW,EAGtCv/B,KAAKk/B,QAAUl/B,KAAKyC,MAAM4J,KAAK,SAAU7K,GACvC,MAAe,OAARA,IAuGX,QAASm+B,WAAUzZ,EAAQ9e,GACzB,GAAsB,gBAAX8e,GACTlmB,KAAKkmB,OAAqB,KAAXA,EAAiBA,EAAOha,MAAM,KAAKhH,IAAI,SAAUzC,GAC9D,MAAO,IAAI68B,OAAM78B,YAGhB,CAAA,IAAIoD,MAAMC,QAAQogB,GAMrB,KAAM,IAAIplB,OAAM,2BALhBd,MAAKkmB,OAASA,EAAOhhB,IAAI,SAAUzC,GACjC,MAAO,IAAI68B,OAAM78B,KAQrB,GAAIm9B,GAAc5/B,KAAKkmB,OAAOnhB,OAAO,SAAU86B,GAC7C,MAAOA,GAAMN,SAEf,IAA2B,IAAvBK,EAAY74B,OACd/G,KAAKu/B,SAAU,MAEZ,CAAA,GAAIK,EAAY,KAAO5/B,KAAKkmB,OAAOlmB,KAAKkmB,OAAOnf,OAAS,GAI3D,KAAM,IAAIsC,aAAY,+CAHtBrJ,MAAKu/B,SAAU,EAMjBv/B,KAAKoH,GAAKA,EAyJZ,QAAS4b,MAAK8c,EAAMC,EAAWC,GAC7BhgC,KAAK8/B,KAAOA,MACZ9/B,KAAK6/B,MAAQC,EAAKA,EAAK/4B,OAAS,IAAM,KACtC/G,KAAK+/B,UAAYA,GAAa,KAC9B//B,KAAKggC,OAASA,MA6KhB,QAASC,iBAAgBC,GACvB,GAAIh7B,GAAMrE,OAAOy9B,KAAK4B,GACjB5d,OAAO,SAAU6d,EAAY19B,GAC5B,GAAI2E,GAAK84B,EAAcz9B,GACnBs9B,EAAY,GAAIJ,WAAUl9B,EAAO2E,EAoBrC,OAlBA24B,GAAUK,SAASp7B,QAAQ,SAAU+6B,GACnC,GAAIz5B,GAAMy5B,EAAUp0B,UACpB,IAAwB/F,SAApBu6B,EAAW75B,GACb65B,EAAW75B,GAAOy5B,MAEf,CACH,GAAIlM,GAAM8L,UAAU9S,QAAQkT,EAAWI,EAAW75B,GAClD,IAAU,EAANutB,EAEFsM,EAAW75B,GAAOy5B,MAEf,IAAY,IAARlM,EACP,KAAM,IAAI/yB,OAAM,cAAgBwF,EAAM,yBAMrC65B,OAITE,EAAMx/B,OAAOy9B,KAAKp5B,GAAKA,IAAI,SAAUzC,GACvC,MAAOyC,GAAIzC,IAiCb,OA5BA49B,GAAIr7B,QAAQ,SAAU+6B,GACpB,GAAIA,EAAUR,QAKZ,IAJA,GAAIt6B,GAAQ86B,EAAU7Z,OAAOnf,OAAS,EAClC84B,EAAQE,EAAU7Z,OAAOjhB,GAEzBosB,EAAI,EACDA,EAAIwO,EAAMp9B,MAAMsE,QAAQ,CAC7B,GAAI84B,EAAMl9B,YAAY0uB,GAAI,CACxB,GAAI7vB,GAAOq+B,EAAMp9B,MAAM4uB,GACnBiP,EAASD,EAAIh0B,KAAK,SAAUb,GAC9B,GAAI9K,GAAI8K,EAAM0a,OAAOjhB,EAErB,OAAOuG,KAAUu0B,GAAar/B,GAC1By+B,SAASz+B,EAAE+B,MAAOjB,KACjBd,EAAEiC,YAAYsC,IAGjBq7B,KACFT,EAAMp9B,MAAM89B,OAAOlP,EAAG,GACtBwO,EAAMl9B,YAAY49B,OAAOlP,EAAG,GAC5BA,KAGJA,OAKCgP,EAUT,QAASG,eAAcL,GACrB,MAAOA,GAAW7d,OAAO,SAAUme,EAAYV,GAC7C,GAAI7Z,GAAS6Z,EAAU7Z,OAAOvY,KAAK,IAInC,OAHIoyB,GAAU34B,KACZq5B,EAAWva,GAAU6Z,EAAU34B,IAE1Bq5B,OAUX,QAASC,WAAUP,EAAYL,GAC7B,GAAI76B,GAAQ66B,EAAK/4B,OAGbg5B,EAAYI,EAAWp7B,OAAO,SAAUg7B,GAC1C,MAAOA,GAAU7Z,OAAOnf,SAAW9B,IAClC,GAGC+6B,EAASG,EACRp7B,OAAO,SAAUg7B,GAChB,MAAkCn6B,SAA3Bm6B,EAAU7Z,OAAOjhB,KAEzBwpB,KAAK,SAAUhoB,EAAGC,GACjB,MAAO44B,OAAMzS,QAAQpmB,EAAEyf,OAAOjhB,GAAQyB,EAAEwf,OAAOjhB,MAEhDqd,OAAO,SAAUlC,EAAS2f,GAEzB,GAAIF,GAAQE,EAAU7Z,OAAOjhB,GACzB07B,EAAWvgB,EAAQrb,OAAO,SAAU44B,GACtC,MAAOA,GAAMkC,MAAMe,YAAYf,KAC9B,EAEH,IAAIc,EAAU,CACZ,GAAIA,EAASd,MAAMN,QACjB,KAAM,IAAIz+B,OAAM,sBAAwB6/B,EAASd,MAAQ,UAAYA,EAAQ,IAE/Ec,GAASR,WAAWnzB,KAAK+yB,OAGzB3f,GAAQpT,MACN6yB,MAAOA,EACPM,YAAaJ,IAIjB,OAAO3f,QAERlb,IAAI,SAAUy4B,GACb,MAAO+C,WAAU/C,EAAMwC,WAAYL,EAAKh7B,OAAO64B,EAAMkC,SAG3D,OAAO,IAAI7c,MAAK8c,EAAMC,EAAWC,GAQnC,QAASa,SAAQC,GAGf,IAAK,GADD70B,MACKpF,EAAI,EAAOi6B,EAAJj6B,EAAWA,IACzBoF,EAAKpF,GAAK,MAAQA,CAGpB,OAAOoF,GAgBT,QAAS80B,QAAOpxB,KAAMwwB,YACpB,GAAIa,MAAO,GAAI5B,MAGX6B,YAAchB,gBAAgBE,WAClC,IAA0B,GAAtBc,YAAYl6B,OACd,KAAM,IAAIjG,OAAM,yBAIlB,IAAIqC,MAAOu9B,UAAUO,gBAOjBC,QACAC,MAAQxxB,MAAQ,GAChByxB,MAAQP,QAAQQ,UAAUJ,aAC9BC,MAAKl0B,KAAK,YAAcm0B,MAAQ,IAAMC,MAAMzzB,KAAK,MAAQ,OACzDuzB,KAAKl0B,KAAK7J,KAAKm+B,OAAON,KAAM,OAC5BE,KAAKl0B,KAAK,IAGV,IAAIrN,UACF,cAAgBqhC,KAAKrxB,KAAO,MAC5BqxB,KAAKM,SACL,UAAYJ,KAAKvzB,KAAK,MACtB,MACAA,KAAK,MAGHvG,GAAK8Y,KAAKvgB,SAASqhC,KAOvB,OAFA55B,IAAG+4B,WAAaK,cAAcS,aAEvB75B,GAsBT,QAASi6B,WAAUlB,GACjB,MAAOA,GAAW7d,OAAO,SAAUnd,EAAK46B,GACtC,MAAOp4B,MAAKxC,IAAIA,EAAK46B,EAAU7Z,OAAOnf,SACrC,GAQL,QAASi4B,WAAUt8B,GACjB,IAAK,GAAIlB,KAAQiB,OACf,GAAIA,MAAM8D,eAAe/E,IAAkB,WAATA,GAE5BiB,MAAMjB,GAAMkB,GAAI,MAAOlB,EAG/B,OAAIiB,OAAc,OAAEC,GAAWlB,EACxB,UAST,QAAS29B,UAASn8B,EAAO26B,GACvB,MAAgC,KAAzB36B,EAAMu+B,QAAQ5D,GArxBvByB,KAAKh0B,UAAU1H,IAAM,SAAU0D,EAAIwY,GACjC,GAAI4hB,GAAM5hB,GAAY,IACjB5f,MAAKq/B,WAAWmC,KAAMxhC,KAAKq/B,WAAWmC,MAE3C,IAAIv8B,GAAQjF,KAAKq/B,WAAWmC,GAAKD,QAAQn6B,EAMzC,OALa,IAATnC,IACFA,EAAQjF,KAAKq/B,WAAWmC,GAAKz6B,OAC7B/G,KAAKq/B,WAAWmC,GAAKx0B,KAAK5F,IAGrBo6B,EAAMv8B,GAOfm6B,KAAKh0B,UAAUk2B,OAAS,WACtB,GAAIJ,MACApB,EAAO9/B,KAAK2P,KAAO,cACnB0vB,EAAar/B,KAAKq/B,UAQtB,OANAx+B,QAAOy9B,KAAKe,GAAYr6B,QAAQ,SAAUw8B,GACxCnC,EAAWmC,GAAKx8B,QAAQ,SAAUy8B,EAAKx8B,GACrCi8B,EAAKl0B,KAAK,OAASw0B,EAAMv8B,EAAQ,MAAQ66B,EAAO,KAAQ0B,EAAM,MAASv8B,EAAQ,UAI5Ei8B,EAAKvzB,KAAK,OA4DnB2xB,MAAMzS,QAAU,SAAUpmB,EAAGC,GAC3B,GAAID,EAAEy4B,QAAS,MAAO,EACtB,IAAIx4B,EAAEw4B,QAAS,MAAO,EAEtB,IAAIC,SAAS14B,EAAEhE,MAAO,UAAW,MAAO,EACxC,IAAI08B,SAASz4B,EAAEjE,MAAO,UAAW,MAAO,EAExC,IAAIgE,EAAEi7B,iBAAkB,CACtB,GAAIh7B,EAAEg7B,iBAAkB,CACtB,GAAIC,GAAKl7B,EAAE9D,YAAYoC,OAAO,SAAU68B,GACtC,MAAsBh8B,UAAfg8B,IACN,GACCC,EAAKn7B,EAAE/D,YAAYoC,OAAO,SAAU68B,GACtC,MAAsBh8B,UAAfg8B,IACN,EACH,OAAOp/B,OAAMG,YAAY4+B,QAAQI,GAAMn/B,MAAMG,YAAY4+B,QAAQM,GAGjE,MAAO,GAIT,MAAIn7B,GAAEg7B,iBACG,GAIJ,GAQTpC,MAAMl0B,UAAUw1B,YAAc,SAAUp1B,GACtC,MAAOxL,MAAKyC,MAAM4J,KAAK,SAAU7K,GAC/B,MAAO29B,UAAS3zB,EAAM/I,MAAOjB,MAQjC89B,MAAMl0B,UAAUxJ,MAAQ,WACtB,GAAIi+B,GAAQ,GAAIP,OAAMt/B,KAAKyC,MAAMitB,QAAS1vB,KAAKu/B,QAE/C,OADAM,GAAMl9B,YAAc3C,KAAK2C,YAAY+sB,QAC9BmQ,GAQTP,MAAMl0B,UAAUs2B,eAAiB,WAC/B,MAAO1hC,MAAK2C,YAAYoE,OAAS,GAYnCu4B,MAAMl0B,UAAUO,SAAW,SAAUm2B,GACnC,GAAIr/B,GAAQzC,KAAKyC,MACZyC,IAAI,SAAU1D,EAAMqF,GACnB,GAAI+6B,GAAa5hC,KAAK2C,YAAYkE,EAClC,OAAOi7B,IAAgBF,EAAaA,EAAW/+B,GAAKrB,GACpDugC,KAAK/hC,OACN+E,OAAO,SAAUvD,EAAMqF,EAAGpE,GACzB,MAAOA,GAAM8+B,QAAQ//B,KAAUqF,GAGrC,QAAQ7G,KAAKu/B,QAAU,MAAQ,IAAM98B,EAAMkL,KAAK,MA+ClDgyB,UAAUv0B,UAAUxJ,MAAQ,WAC1B,MAAO,IAAI+9B,WAAU3/B,KAAKkmB,OAAOwJ,QAAS1vB,KAAKoH,KAQjDu4B,UAAUv0B,UAAUg1B,OAAS,WAG3B,QAAS1wB,GAAQqwB,EAAWD,GAC1B,GAAIA,EAAK/4B,OAASg5B,EAAU7Z,OAAOnf,OAAQ,CACzC,GAAI84B,GAAQE,EAAU7Z,OAAO4Z,EAAK/4B,OAClC,IAAI84B,EAAMN,QAAS,CAEjB,GAAIyC,GAAWnC,EAAMj+B,OAIrBY,OAAMG,YAAYqC,QAAQ,SAAU48B,GAClC,IAAKzC,SAASU,EAAMp9B,MAAOm/B,EAAWh/B,OAASu8B,SAASU,EAAMp9B,MAAOm/B,EAAW/+B,IAAK,CACnF,GAAIgE,GAAIm7B,EAASv/B,MAAMsE,MACvBi7B,GAASv/B,MAAMoE,GAAK+6B,EAAWh/B,KAC/Bo/B,EAASr/B,YAAYkE,GAAK+6B,KAI9BlyB,EAAQqwB,EAAWD,EAAKh7B,OAAOk9B,QAI/BnC,GAAMp9B,MAAMuC,QAAQ,SAAUxD,GAC5BkO,EAAQqwB,EAAWD,EAAKh7B,OAAO,GAAIw6B,OAAM99B,OAI3CgB,MAAMG,YAAYqC,QAAQ,SAAU48B,GAClC,IAAKzC,SAASU,EAAMp9B,MAAOm/B,EAAWh/B,OAASu8B,SAASU,EAAMp9B,MAAOm/B,EAAW/+B,IAAK,CACnF,GAAIm/B,GAAW,GAAI1C,OAAMsC,EAAWh/B,KACpCo/B,GAASr/B,YAAY,GAAKi/B,EAC1BlyB,EAAQqwB,EAAWD,EAAKh7B,OAAOk9B,WAMrC7B,GAAWnzB,KAAK,GAAI2yB,WAAUG,EAAMC,EAAU34B,KAtClD,GAAI+4B,KA2CJ,OAFAzwB,GAAQ1P,SAEDmgC,GAaTR,UAAU9S,QAAU,SAAUpmB,EAAGC,GAC/B,GAAID,EAAEyf,OAAOnf,OAASL,EAAEwf,OAAOnf,OAAQ,MAAO,EAC9C,IAAIN,EAAEyf,OAAOnf,OAASL,EAAEwf,OAAOnf,OAAQ,MAAO,EAG9C,IAAI46B,GAAKl7B,EAAEyf,OAAOnhB,OAAO,SAAU86B,GACjC,MAAOA,GAAM6B,mBAEXG,EAAKn7B,EAAEwf,OAAOnhB,OAAO,SAAU86B,GACjC,MAAOA,GAAM6B,kBAGf,IAAIC,EAAG56B,OAAS86B,EAAG96B,OAAQ,MAAO,EAClC,IAAI46B,EAAG56B,OAAS86B,EAAG96B,OAAQ,MAAO,EAGlC,KAAK,GAAIF,GAAI,EAAGA,EAAIJ,EAAEyf,OAAOnf,OAAQF,IAAK,CACxC,GAAIgtB,GAAMyL,MAAMzS,QAAQpmB,EAAEyf,OAAOrf,GAAIH,EAAEwf,OAAOrf,GAC9C,IAAY,IAARgtB,EACF,MAAOA,GAIX,MAAO,IAQT8L,UAAUv0B,UAAUs2B,eAAiB,WACnC,MAAO1hC,MAAKkmB,OAAO7Z,KAAK,SAAUwzB,GAChC,MAAOA,GAAM6B,oBAUjB/B,UAAUv0B,UAAUk2B,OAAS,SAAUN,EAAMjxB,GAC3C,GAAImxB,MACAj1B,EAAOjM,KAAKkmB,OAAOhhB,IAAI,SAAU26B,EAAO56B,GAC1C,GAAI28B,GAAa/B,EAAMl9B,YAAY,EACnC,OAAIk9B,GAAMN,QACD,UAEAqC,EACAZ,EAAKt9B,IAAIk+B,EAAW9/B,QAAS,WAAa,OAASmD,EAAQ,IAG3D,MAAQA,IAEhB0I,KAAK,MACJ8zB,EAAMzhC,KAAKoH,GAAK45B,EAAKt9B,IAAI1D,KAAKoH,GAAI,aAAexB,MACrD,OAAI67B,GACK1xB,EAAS,UAAY0xB,EAAM,IAAMx1B,EAAQ,oBAAsBjM,KAAKkmB,OAAOvY,KAAK,MAGlFuzB,EAAKvzB,KAAK,OAOnBgyB,UAAUv0B,UAAUO,SAAW,WAC7B,MAAO3L,MAAKkmB,OAAOvY,KAAK,OAwB1BqV,KAAK5X,UAAUk2B,OAAS,SAAUN,EAAMjxB,EAAQmvB,GAE9C,GAAIgC,KAEJ,IAAIlhC,KAAK6/B,MAAO,CACd,GAAI56B,GAAQjF,KAAK8/B,KAAK/4B,OAAS,EAC3B66B,EAAa5hC,KAAK6/B,MAAMl9B,YAAY,GACpCs/B,EAAU,aAAeL,EACxBA,EAAWh/B,KAAO,gBAAkBg/B,EAAW/+B,GAAK,IACrD7C,KAAK6/B,MAGT,IAAI7/B,KAAK6/B,MAAMN,QACb,GAAIv/B,KAAK6/B,MAAMX,QAEbgC,EAAKl0B,KAAK+C,EAAS,0BAA4B9K,EAAQ,OACvDi8B,EAAKl0B,KAAK+C,EAAS,uBACnBmxB,EAAKl0B,KAAK+C,EAAS,kBAAoB9K,EAAQ,kCAC/Ci8B,EAAKl0B,KAAK+C,EAAS,mCACnBmxB,EAAKl0B,KAAK+C,EAAS,OACnBmxB,EAAKl0B,KAAKhN,KAAK+/B,UAAUuB,OAAON,EAAMjxB,EAAS,OAC/CmxB,EAAKl0B,KAAK+C,EAAS,SAEhB,CAEH,GAAImyB,GAAW,SAAUz/B,EAAO6G,GAC9B,MAAO7G,GACFyC,IAAI,SAAU1D,GACb,MAAOw/B,GAAKt9B,IAAIi7B,YAAYn9B,GAAO,QAAU,IAAM8H,EAAM,MAE1DqE,KAAK,SACVo0B,KAAK/hC,MAEHmiC,EAAWniC,KAAK6/B,MAAMp9B,MACtB2/B,EAAaD,EAASp9B,OAAO,SAAUvD,EAAMqF,GAC/C,MAAqCjB,UAA9B5F,KAAK6/B,MAAMl9B,YAAYkE,IAC9Bk7B,KAAK/hC,MAEPkhC,GAAKl0B,KAAK+C,EAAS,OAASmyB,EAASC,EAAU,MAAQl9B,GAAS,OAASg9B,GACzEf,EAAKl0B,KAAK+C,EAAS,uBAAyB9K,EAAQ,MACpDi8B,EAAKl0B,KAAK+C,EAAS,mBAAqB9K,EAAQ,GAAK,kCACrDi8B,EAAKl0B,KAAK+C,EAAS,WAAamyB,EAASE,EAAY,gBAAkB,OACvElB,EAAKl0B,KAAK+C,EAAS,qCACnBoyB,EAASn9B,QAAQ,SAAUxD,EAAMqF,GAC/B,GAAI+6B,GAAa5hC,KAAK6/B,MAAMl9B,YAAYkE,EACxC,IAAI+6B,EAAY,CACd,GAAI7S,GAAOiS,EAAKt9B,IAAIi7B,YAAYn9B,GAAO,QACnCM,EAAUk/B,EAAKt9B,IAAIk+B,EAAW9/B,QAAS,UAC3Co/B,GAAKl0B,KAAK+C,EAAS,SACnBmxB,EAAKl0B,KAAK+C,EAAS,gBAAkBgf,EAAO,qBAC5CmS,EAAKl0B,KAAK+C,EAAS,sBAAwBjO,EAAU,sBAEvDigC,KAAK/hC,OACPkhC,EAAKl0B,KAAK+C,EAAS,gBACnBmxB,EAAKl0B,KAAK+C,EAAS,8CAAmDoyB,EAASx0B,KAAK,KAAO,OAC3FuzB,EAAKl0B,KAAK+C,EAAS,SACnBmxB,EAAKl0B,KAAK+C,EAAS,OACnBmxB,EAAKl0B,KAAKhN,KAAK+/B,UAAUuB,OAAON,EAAMjxB,EAAS,OAC/CmxB,EAAKl0B,KAAK+C,EAAS,SAIrB,IAAI/P,KAAK6/B,MAAMX,QAEbgC,EAAKl0B,KAAK+C,EAAS,gBACnBmxB,EAAKl0B,KAAKhN,KAAKqiC,WAAWrB,EAAMjxB,EAAQmvB,QAErC,CAEH,GAAI19B,GAAOxB,KAAK6/B,MAAMp9B,MAAM,GACxBssB,EAAgB,QAATvtB,EAAiBw/B,EAAKt9B,IAAIi7B,YAAYn9B,GAAO,QAAU,IAElE0/B,GAAKl0B,KAAK+C,EAAS,OAASgf,EAAO,OAAS9pB,EAAQ,QAAUg9B,GAC9Df,EAAKl0B,KAAKhN,KAAKqiC,WAAWrB,EAAMjxB,EAAS,KAAMmvB,IAC/CgC,EAAKl0B,KAAK+C,EAAS,UAMvBmxB,GAAKl0B,KAAKhN,KAAKqiC,WAAWrB,EAAMjxB,EAAQmvB,GAG1C,OAAOgC,GAAKvzB,KAAK,OAYnBqV,KAAK5X,UAAUi3B,WAAa,SAASrB,EAAMjxB,EAAQmvB,GACjD,GAAIgC,KAEAlhC,MAAK+/B,YACPmB,EAAKl0B,KAAK+C,EAAS,4BAA8B/P,KAAK8/B,KAAK/4B,OAAS,OACpEm6B,EAAKl0B,KAAKhN,KAAK+/B,UAAUuB,OAAON,EAAMjxB,EAAS,OAC/CmxB,EAAKl0B,KAAK+C,EAAS,KAGrB,IAAIuyB,GAActiC,KAAKggC,OAAOj7B,OAAO,SAAUuJ,GAC7C,MAAOA,GAAMuxB,MAAMX,UAClB,EAEHl/B,MAAKggC,OAAOh7B,QAAQ,SAAUsJ,GAC5B4yB,EAAKl0B,KAAKsB,EAAMgzB,OAAON,EAAMjxB,EAAQuyB,MAGnCpD,IAAYl/B,KAAK6/B,MAAMX,SACzBgC,EAAKl0B,KAAKkyB,EAAQoC,OAAON,EAAMjxB,EAAQuyB,GAGzC,IAAIC,GAAaviC,KAAKwiC,YAAYxB,EAAMjxB,EAKxC,OAJIwyB,IACFrB,EAAKl0B,KAAKu1B,GAGLrB,EAAKvzB,KAAK,OAUnBqV,KAAK5X,UAAUo3B,YAAc,SAAUxB,EAAMjxB,GAC3C,GAAI9K,GAAQjF,KAAK8/B,KAAK/4B,MAGtB,IAA2B,IAAvB/G,KAAKggC,OAAOj5B,OAEd,OACEgJ,EAAS,0BAA4B9K,EAAQ,MAC7C8K,EAAS,sCAA0C9K,EAAQ,IAC3D8K,EAAS,KACTpC,KAAK,KAGP,IAAIlL,GAAQzC,KAAKggC,OAAO1d,OAAO,SAAU7f,EAAOU,GAO9C,MANAA,GAAK08B,OAAS18B,EAAK08B,MAAMp9B,MAAMuC,QAAQ,SAAUxD,GACnB,KAAxBiB,EAAM8+B,QAAQ//B,IAChBiB,EAAMuK,KAAKxL,KAIRiB,MAGT,OAAOsN,GAAS,oCAAwC9K,EAAQ,MAASxC,EAAMkL,KAAK,KAAO,MAsN/F,IAAIlL,QACFggC,OAAY,SAAU//B,GAAI,MAAa,QAANA,GACjCkD,UAAY,SAAUlD,GAAI,MAAakD,UAANlD,GACjCggC,UAAY,SAAUhgC,GAAI,MAAoB,iBAANA,IACxCxB,OAAY,SAAUwB,GAAI,MAAoB,gBAANA,IACxC+H,OAAY,SAAU/H,GAAI,MAAoB,gBAANA,IACxCigC,WAAY,SAAUjgC,GAAI,MAAoB,kBAANA,IACxCmD,MAAY,SAAUnD,GAAI,MAAOmD,OAAMC,QAAQpD,IAC/C0D,KAAY,SAAU1D,GAAI,MAAOA,aAAa0D,OAC9CC,OAAY,SAAU3D,GAAI,MAAOA,aAAa2D,SAC9CxF,OAAY,SAAU6B,GAAI,MAAoB,gBAANA,KAyCtC9B,UAGA+B,eAKAH,OACF5B,OAAQA,OACR6B,MAAOA,MACPE,YAAaA,YAgFf,OAnEAH,OAAQu+B,OAAO,SACblgC,OAAU,SAAUs/B,GAClB,MAAOY,QAAO,KAAMZ,IAEtByC,iBAAkB7B,OAClB8B,mBAAoB,SAAU9C,EAAW34B,GACvC,GAAI+4B,KAEJ,OADAA,GAAWJ,GAAa34B,EACjB25B,OAAO35B,EAAGuI,MAAQ,KAAMwwB,IAEjC2C,2BAA4B,SAASnzB,EAAMowB,EAAW34B,GACpD,GAAI+4B,KAEJ,OADAA,GAAWJ,GAAa34B,EACjB25B,OAAOpxB,EAAMwwB,IAEtB4C,cAAe,SAAUC,GACvB,GAAIrzB,GAAO,GACPwwB,IAyCJ,OAxCA6C,GAAIh+B,QAAQ,SAAUoC,EAAInC,GACxB,GAAI0L,EAGJ,IAA+B,gBAAlBvJ,GAAG+4B,WAGd,KAFAxvB,GAAM,GAAI5N,WAAU,yCAA2CkC,EAAQ,KACvE0L,EAAI/C,MAAQ3I,MAAOA,GACb0L,CAIR,KAAK,GAAIovB,KAAa34B,GAAG+4B,WACvB,GAAI/4B,EAAG+4B,WAAW55B,eAAew5B,GAAY,CAC3C,GAAII,EAAW55B,eAAew5B,GAG5B,KAFApvB,GAAM,GAAI7P,OAAM,cAAgBi/B,EAAY,sBAC5CpvB,EAAI/C,MAAQmyB,UAAWA,GACjBpvB,CAGNwvB,GAAWJ,GAAa34B,EAAG+4B,WAAWJ,GAM5C,GAAe,IAAX34B,EAAGuI,KACL,GAAY,IAARA,EACFA,EAAOvI,EAAGuI,SAEP,IAAIA,GAAQvI,EAAGuI,KAMlB,KALAgB,GAAM,GAAI7P,OAAM,0CAA4C6O,EAAO,aAAevI,EAAGuI,KAAO,KAC5FgB,EAAI/C,MACFkxB,OAAQ13B,EAAGuI,KACXkvB,SAAUlvB,GAENgB,IAKLowB,OAAOpxB,EAAMwwB,MAKxB39B,MAAM5B,OAASA,OACf4B,MAAMC,MAAQA,MACdD,MAAMG,YAAcA,YAEbH,SAMJ,SAAS3C,EAAQD,EAASM,GAE/B,YAEAN,GAAQoD,MAAQ9C,EAAoB,KACpCN,EAAQ,WAAaM,EAAoB,KACzCN,EAAQ,YAAcM,EAAoB,KAC1CN,EAAQsB,OAAShB,EAAoB,GACrCN,EAAQygB,UAAYngB,EAAoB,KACxCN,EAAQ0B,OAASpB,EAAoB,GACrCN,EAAQ6K,OAASvK,EAAoB,KACrCN,EAAQ6C,MAAQvC,EAAoB;EAK/B,SAASL,GAEd,YAWA,SAASoO,GAAe6wB,EAAQD,EAAUoE,GACxC,KAAMjjC,eAAgBiO,IACpB,KAAM,IAAI5E,aAAY,mDAGxBrJ,MAAK8+B,OAAWA,EAChB9+B,KAAK6+B,SAAWA,EAChB7+B,KAAKijC,SAAWA,EAEhBjjC,KAAK8oB,QAAU,wBACVjjB,MAAMC,QAAQg5B,GAAW,IAAMA,EAAOnxB,KAAK,MAAQ,IAAOmxB,GAC3D,KAAO9+B,KAAKijC,UAAY,MAAQ,KAC/Bp9B,MAAMC,QAAQ+4B,GAAa,IAAMA,EAASlxB,KAAK,MAAQ,IAAOkxB,GAC/D,IAEJ7+B,KAAKkjC,OAAQ,GAAKpiC,QAASoiC,MAG7Bj1B,EAAe7C,UAAY,GAAIumB,YAC/B1jB,EAAe7C,UAAUvJ,YAAc8vB,WACvC1jB,EAAe7C,UAAUuE,KAAO,iBAEhC9P,EAAOD,QAAUqO,GAKZ,SAASpO,EAAQD,EAASM,GAE/B,YA4XA,SAASijC,GAAQzgC,EAAGsG,EAAGo6B,GACrB,GAEIC,GAAOC,EAFP7hC,EAAYiB,EAAEb,YAGd0hC,IAAU7gC,EAAE8X,EAAI,GAChBgpB,IAAUx6B,EAAEwR,EAAI,EACpB,IAAI+oB,EAAO,CACTF,EAAQI,EAA6B7jC,EAAQ+nB,IAAIjlB,GACjD,KAAK,GAAImE,GAAI,EAAGA,EAAIw8B,EAAMt8B,SAAUF,EAClCw8B,EAAMx8B,IAAM,MAGdw8B,GAAQI,EAA6B/gC,EAEvC,IAAI8gC,EAAO,CACTF,EAAQG,EAA6B7jC,EAAQ+nB,IAAI3e,GACjD,KAAK,GAAInC,GAAI,EAAGA,EAAIy8B,EAAMv8B,SAAUF,EAClCy8B,EAAMz8B,IAAM,MAGdy8B,GAAQG,EAA6Bz6B,EAGvC,IAAI06B,GAASC,EAASC,CAClBP,GAAMt8B,QAAUu8B,EAAMv8B,QACxB28B,EAAUL,EACVM,EAAUL,EACVM,EAAUL,IAEVG,EAAUJ,EACVK,EAAUN,EACVO,EAAUJ,EAGZ,IAAIK,GAAWH,EAAQ38B,OACnB+8B,EAAUH,EAAQ58B,OAClBg9B,EAAkC,EAArBX,EAAKG,EAAOC,GACzBQ,EAAS,GAAIviC,GAAuB,EAAbsiC,GACvBE,EAAWxiC,EAAUyiC,IACrBC,EAAM,GAAI1iC,GAAU,GAEpB2iC,EAAW3iC,EAAUN,SAGzB,KAFAM,EAAUb,QAAQO,UAAW,MAEtB0iC,EAAW,GACZT,EAAKM,IAAUG,GAAWF,IAAUG,KAAaC,IACnDC,EAASA,EAAO/T,KAAKgU,IAEvBA,EAAWA,EAAS1T,MAAM4T,EAE5B,MAAOL,EAAU,GACXV,EAAKQ,EAASD,IAAUG,KAAaC,IACvCC,EAASA,EAAO/T,KAAKgU,IAEvBA,EAAWA,EAAS1T,MAAM4T,EAQ5B,OALA1iC,GAAUb,QAAQO,UAAWijC,IAEX,GAAdL,IACFC,EAAOxpB,GAAKwpB,EAAOxpB,GAEdwpB,EAIT,QAASP,GAA6B/gC,GAKpC,IAAK,GAHD+D,GAAI/D,EAAEjC,EACNgJ,EAAIhD,EAAE,GAAK,GAENI,EAAI,EAAGA,EAAIJ,EAAEM,SAAUF,EAAG,CAEjC,IAAK,GADD2T,GAAI/T,EAAEI,GAAK,GACN6L,EAAI,EAAI8H,EAAEzT,OAAQ2L,KACzB8H,EAAI,IAAMA,CAGZ/Q,IAAK+Q,EAGP,GAAIoH,EACJ,KAAKA,EAAInY,EAAE1C,OAAS,EAAkB,KAAf0C,EAAEO,OAAO4X,KAAaA,GAE7C,GAAIyiB,GAAK3hC,EAAEwE,EACPqB,EAAMkB,EAAEimB,MAAM,EAAG9N,EAAI,GAAK,GAC1B0iB,EAAO/7B,EAAIxB,MACf,IAAIs9B,EAAK,EACP,KAAMA,EAAKC,EAET,IAAKD,GAAMC,EAAMD,IAAM97B,GAAO,SAChB+7B,GAALD,IACT97B,EAAMA,EAAImnB,MAAM,EAAG2U,GAAM,IAAM97B,EAAImnB,MAAM2U,GAM7C,KAAK,GADDhE,IAAO,GACFx5B,EAAI,EAAGA,EAAI0B,EAAIxB,QAAU,CAChC,IAAK,GAAIw9B,GAAOlE,EAAIt5B,OAAQw9B,IAAQlE,EAAIkE,IAAS,IAEjDlE,EAAI,IAAM93B,EAAIyB,OAAOnD,MAAQ,CAC7B,KAAK,GAAI+a,GAAI,EAAGA,EAAIye,EAAIt5B,SAAU6a,EAC5Bye,EAAIze,GAAK,IACO,MAAdye,EAAIze,EAAI,KACVye,EAAIze,EAAI,GAAK,GAGfye,EAAIze,EAAI,IAAMye,EAAIze,IAAM,EACxBye,EAAIze,IAAM,GAKhB,MAAOye,GAAImE,UA8fb,QAASC,GAAc/hC,EAAG4zB,GACxB,GAAIoO,GAAepO,EAAIn1B,UAGnBwjC,IAAcD,EAAe,GAC7BE,EAAOF,EAAe,EAAIhiC,EAAEwE,EAC5B29B,EAAiB,GAAKniC,EAAEwE,EACxB49B,EAAUn9B,KAAKxC,IAAiC,SAA7BwC,KAAK9D,IAAI6gC,EAAe,GAAgB,EAAO,EACtEpO,GAAI11B,QAAQO,UAAW0jC,GAEvB,IAAIh+B,GAAI,EACJk+B,EAAO,GAAIzO,GAAI3uB,KAAKimB,KAAKlrB,EAAEI,YAAc,GAC7C,GAAG,CACD,GAAIkiC,GAAOplC,EAAQ48B,gBAAgBuI,EAAMzO,EAAK,GAAG,GAC7C2O,EAAOC,EAASF,EACfA,GAAK9T,WACR8T,EAAKxqB,EAAIuqB,EAAKvqB,EAGhB,IAAI2qB,GAAOH,EAAKpW,MAAMlsB,GAAGie,IAAIskB,EAC7BF,GAAOA,EAAKnW,MAAMuW,GAElBN,EAAiBl9B,KAAKjD,IAAI,EAAEmgC,EAAgBD,GAC5CtO,EAAI11B,QAAQO,UAAW0jC,UACf,EAAEM,EAAKj+B,GAAKy9B,IAAeQ,EAAKjU,YAAerqB,GAAKi+B,EAE9D,IAAIj+B,GAAKi+B,EACP,KAAM,IAAIhkC,OAAM,mFAKlB,OADAw1B,GAAI11B,QAAQO,UAAWujC,IAChBK,EAAKK,KAAKV,EAAe,GAalC,QAASW,GAAc3iC,EAAGvB,GACxB,GAAIm1B,GAAM5zB,EAAEb,WACZy0B,GAAI11B,QAAQO,UAAWA,EAAYwG,KAAK9D,IAAI1C,GAAa,GAWzD,KAAK,GATD6xB,GAAM,GAAIsD,GAAI,GACdttB,EAAItG,EACJ4iC,EAAQ/kB,IACRglB,EAAK7iC,EAAE6tB,MAAM7tB,GACb8iC,EAAU9iC,EACV+iC,EAAW,GAAInP,GAAItD,GACnB0S,EAAW,GAAIpP,GAAItD,GAEnB2S,EAAO,GAAIrP,GAAItD,GACVlhB,EAAI,GAAI9I,EAAEuC,OAAO+5B,GAAQxzB,GAAK,EACrC0zB,EAAUA,EAAQjV,MAAMgV,GAExBE,EAAWA,EAASlV,MAAMoV,GAC1BD,EAAWA,EAASnV,MAAMoV,EAAK1V,KAAK+C,IAEpCsS,EAAQt8B,EACR28B,EAAO,GAAIrP,GAAIxkB,GACf9I,EAAIA,EAAEinB,KAAKuV,EAAQjV,MAAMkV,GAAU9kB,IAAIglB,EAAKpV,MAAMmV,IAIpD,OADApP,GAAI11B,QAAQO,UAAWA,IAChB6H,EAAEo8B,KAAKjkC,EAAY,GAY5B,QAASykC,GAAcljC,GAOrB,IAAK,GANDsG,GAAItG,EACJ4iC,EAAQ/kB,IACRglB,EAAK7iC,EAAE6tB,MAAM7tB,GACb4J,EAAM5J,EACNgB,GAAM,EAEDoO,EAAI,GAAI9I,EAAEuC,OAAO+5B,GAAQxzB,GAAK,EACrCxF,EAAMA,EAAIikB,MAAMgV,GAEhBD,EAAQt8B,EACRtF,GAAOA,EACPsF,EAAI,EAAQA,EAAEinB,KAAK3jB,EAAIqU,IAAI7O,IAAM9I,EAAE4lB,MAAMtiB,EAAIqU,IAAI7O,GAGnD,OAAO9I,GAgBT,QAAS68B,GAAenjC,EAAGojC,GAUzB,IAAK,GATD9S,GAAMtwB,EAAEb,YAAYqiC,IAEpBl7B,EAAItG,EACJ4iC,EAAQ/kB,IACRglB,EAAK7iC,EAAE6tB,MAAM7tB,GACb4J,EAAM,EAAStD,EAAIA,EAAIgqB,EACvBiG,EAAMjG,EACNtvB,GAAM,EAEDoO,EAAIg0B,GAAO98B,EAAEuC,OAAO+5B,GAAQxzB,GAAK,EACxCxF,EAAMA,EAAIikB,MAAMgV,GAChBtM,EAAMA,EAAI1I,MAAMze,EAAE,GAAGye,MAAMze,EAAE,GAE7BwzB,EAAQt8B,EACRtF,GAAOA,EACPsF,EAAI,EAAQA,EAAEinB,KAAK3jB,EAAIqU,IAAIsY,IAAQjwB,EAAE4lB,MAAMtiB,EAAIqU,IAAIsY,GAGrD,OAAOjwB,GAWT,QAAS+8B,GAAerjC,EAAGvB,EAAW2kC,GACpC,GAAItlB,GAAK5gB,EAAQ4gB,GAAGrf,EAAY,GAC5Bsf,EAAM7gB,EAAQ6gB,IAAItf,EACtB,IAAIuB,EAAEe,MAAM8zB,IAAI/W,EAAG4kB,KAAK1iC,EAAEsjC,OACxB,OAAQtjC,GAAG,EAGb,IAAI4zB,GAAM5zB,EAAEb,WAEZ,IAAIa,EAAEie,IAAIH,EAAG4kB,KAAK1iC,EAAEsjC,OAAOljC,WAAa,GAAK,EAC3C,OAAQ,GAAIwzB,GAAW,EAAPwP,IAAW,EAG7B,IAAI98B,GAAItG,EAAE+kB,IAAIhH,EAGd,OAAIzX,GAAEo8B,KAAK1iC,EAAEsjC,KAAM,GAAG9U,UACZ,GAAIoF,GAAW,EAAPwP,IAAW,IAGzB98B,EAAEquB,GAAG7W,KACHslB,GAEF98B,EAAIA,EAAE4lB,MAAMpO,GACZxX,EAAEwR,GAAKxR,EAAEwR,GAGTxR,EAAIyX,EAAImO,MAAM5lB,IAIlBA,EAAEnH,YAAcy0B,GACRttB,GAAG,IAWb,QAASk8B,GAASe,GAChB,GAAI3P,GAAM2P,EAAOpkC,YACbV,EAAYm1B,EAAIn1B,SACpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,GAEnC,IAAIqgB,GAAM8U,EAAI4N,IAAItV,MAAMqX,EAAO1V,MAAM0V,IAASjiC,MAG9C,OADAsyB,GAAI11B,QAAQO,UAAWA,IAChBqgB,EAAI4jB,KAAKjkC,EAAY,GA3qC9B,GAAIM,GAAYvB,EAAoB,IAChCuH,EAAWvH,EAAoB,GAAGuH,SAClC1F,EAAS7B,EAAoB,GAAG6B,OAChCmkC,EAAUhmC,EAAoB,KAAKgmC,OAQvCtmC,GAAQumC,YAAc,SAAUpgC,GAC9B,MAAQA,aAAiBtE,IAY3B7B,EAAQwmC,YAAc,SAASllC,EAAQW,GAGrC,MAAO,IAAIA,GAAaE,EAAOb,GAAU,GAAOA,EAAS,GAAMA,IAajEtB,EAAQsH,EAAIg/B,EAAQ,SAAU/kC,GAC5B,GAAIm1B,GAAM70B,EAAUI,aAAaV,UAAWA,GAE5C,OAAO,IAAIm1B,GAAI,GAAG1yB,QAQpBhE,EAAQ8J,IAAMw8B,EAAQ,SAAU/kC,GAC9B,GAAIm1B,GAAM70B,EAAUI,aAAaV,UAAWA,GAE5C,OAAO,IAAIm1B,GAAI,GAAGrG,KAAK,GAAIqG,GAAI,GAAGtyB,QAAQ2c,IAAI,KAWhD/gB,EAAQ4gB,GAAK0lB,EAAQ,SAAU/kC,GAE7B,GAAIm1B,GAAM70B,EAAUI,aAAaV,UAAWA,EAAY,IACpDklC,EAAQ,GAAI/P,GAAI,GAAG/F,MAAMqV,EAAc,GAAItP,GAAI,GAAG3V,IAAI,KACrDiO,MAAMgX,EAAc,GAAItP,GAAI,GAAG3V,IAAI,MAKxC,OAHA2V,GAAI11B,QAAQO,UAAWA,IAGhB,GAAIm1B,GAAI,GAAG/F,MAAM8V,KAQ1BzmC,EAAQ6gB,IAAMylB,EAAQ,SAAU/kC,GAI9B,GAAIqf,GAAK5gB,EAAQ4gB,GAAGrf,EAAY,GAE5Bm1B,EAAM70B,EAAUI,aAAaV,UAAWA,GAE5C,OAAO,IAAIm1B,GAAI,GAAG/F,MAAM/P,KA2B1B5gB,EAAQkqB,IAAM,SAASpnB,EAAGsG,GACxB,GAAKtG,EAAEuG,aAAevG,EAAEgF,aAAiBsB,EAAEC,aAAeD,EAAEtB,YAC1D,KAAM,IAAI5G,OAAM,wDAGlB,IAAIW,GAAYiB,EAAEb,WAClB,IAAIa,EAAEsF,SAAWgB,EAAEhB,QACjB,MAAO,IAAIvG,GAAU8e,IAGvB,IAAI7d,EAAEwuB,UAAYloB,EAAEmmB,GAAG,KAAOzsB,EAAEysB,GAAGnmB,GACjC,MAAOtG,EAET,IAAIsG,EAAEkoB,UAAYxuB,EAAEysB,GAAG,IACrB,MAAOnmB,EAGT,KAAKtG,EAAEuG,aAAeD,EAAEC,WAAY,CAClC,IAAKvG,EAAEuG,aAAeD,EAAEC,WACtB,MAAIvG,GAAEouB,cAAgB9nB,EAAEs9B,YACf5jC,EAEF,GAAIjB,GAAU,EAEvB,KAAKiB,EAAEuG,WACL,MAAID,GAAE8nB,aACGpuB,EAELA,EAAEouB,aACG,GAAIrvB,GAAU,GAEhBuH,CAET,KAAKA,EAAEC,WACL,MAAIvG,GAAEouB,aACG9nB,EAELA,EAAE8nB,aACG,GAAIrvB,GAAU,GAEhBiB,EAGX,MAAOygC,GAAQzgC,EAAGsG,EAAG,SAAUvC,EAAGC,GAAK,MAAOD,GAAIC,KAmBpD9G,EAAQ2rB,UAAY,SAAU7oB,EAAGsG,GAC/B,GAAKtG,EAAEuG,aAAevG,EAAEgF,aAAiBsB,EAAEC,aAAeD,EAAEtB,YAC1D,KAAM,IAAI5G,OAAM,2DAGlB,IAAIW,GAAYiB,EAAEb,WAClB,OAAIa,GAAEsF,SAAWgB,EAAEhB,SAAYgB,EAAE8nB,eAAiB9nB,EAAEkoB,SAC3C,GAAIzvB,GAAU8e,KAEnB7d,EAAEwuB,UAAYloB,EAAEkoB,SACXxuB,EAEJA,EAAEuG,YAAeD,EAAEC,WAMfvG,EAAE6tB,MADPvnB,EAAEmW,GAAG,IACQxX,KAAK5D,IAAI,EAAGiF,EAAElG,YAAc,GAE9B,GAAIrB,GAAU,GAAGsC,IAAIiF,IAP3B,GAAIvH,GAAU8e,MAezB3gB,EAAQ+nB,IAAM,SAAUjlB,GACtB,GAAIA,EAAEuG,aAAevG,EAAEgF,YACrB,KAAM,IAAI5G,OAAM,uDAGlB,IAAIW,GAAYiB,EAAEb,YACduiC,EAAW3iC,EAAUN,SACzBM,GAAUb,QAAQO,UAAW,KAE7B,IAAIuB,GAAIA,EAAEutB,KAAKxuB,EAAUyiC,IAIzB,OAHAxhC,GAAE8X,GAAK9X,EAAE8X,GAAK,KAEd/Y,EAAUb,QAAQO,UAAWijC,IACtB1hC,GAsBT9C,EAAQoqB,GAAK,SAAUtnB,EAAGsG,GACxB,GAAKtG,EAAEuG,aAAevG,EAAEgF,aAAiBsB,EAAEC,aAAeD,EAAEtB,YAC1D,KAAM,IAAI5G,OAAM,uDAGlB,IAAIW,GAAYiB,EAAEb,WAClB,IAAIa,EAAEsF,SAAWgB,EAAEhB,QACjB,MAAO,IAAIvG,GAAU8e,IAGvB,IAAIgmB,GAAS,GAAI9kC,GAAU,GAC3B,OAAIiB,GAAEwuB,UAAYloB,EAAEmmB,GAAGoX,IAAW7jC,EAAEysB,GAAGnmB,GAC9BA,EAELA,EAAEkoB,UAAYxuB,EAAEysB,GAAGoX,GACd7jC,EAGJA,EAAEuG,YAAeD,EAAEC,WAUjBk6B,EAAQzgC,EAAGsG,EAAG,SAAUvC,EAAGC,GAAK,MAAOD,GAAIC,KAT1ChE,EAAEuG,aAAevG,EAAEouB,cAAgB9nB,EAAE8nB,cACnCpuB,EAAEouB,eAAiB9nB,EAAE8nB,eAAiB9nB,EAAEC,WACvCs9B,EAEL7jC,EAAEouB,cAAgB9nB,EAAE8nB,aACfpuB,EAAEuG,WAAavG,EAAIsG,EAErBtG,EAAEuG,WAAaD,EAAItG,GAwB9B9C,EAAQ+0B,WAAa,SAAUjyB,EAAGsG,GAChC,GAAKtG,EAAEuG,aAAevG,EAAEgF,aAAiBsB,EAAEC,aAAeD,EAAEtB,YAC1D,KAAM,IAAI5G,OAAM,iEAGlB,IAAIW,GAAYiB,EAAEb,WAClB,OAAIa,GAAEsF,SAAWgB,EAAEhB,SAAYgB,EAAE8nB,eAAiB9nB,EAAEkoB,SAC3C,GAAIzvB,GAAU8e,KAEnB7d,EAAEwuB,UAAYloB,EAAEkoB,SACXxuB,EAEJsG,EAAEC,WAWHD,EAAEmW,GAAG,IACAzc,EAAEie,IAAIhZ,KAAK5D,IAAI,EAAGiF,EAAElG,YAAc,IAAI6nB,QAExCjoB,EAAEie,IAAI,GAAIlf,GAAU,GAAGsC,IAAIiF,IAAI2hB,QAZ3B,GAAIlpB,GADTiB,EAAEouB,aACiB,GAElBpuB,EAAEuG,WAGc,EAFEsX,MA6B3B3gB,EAAQmqB,IAAM,SAAUrnB,EAAGsG,GACzB,GAAKtG,EAAEuG,aAAevG,EAAEgF,aAAiBsB,EAAEC,aAAeD,EAAEtB,YAC1D,KAAM,IAAI5G,OAAM,wDAGlB,IAAIW,GAAYiB,EAAEb,WAClB,IAAIa,EAAEsF,SAAWgB,EAAEhB,QACjB,MAAO,IAAIvG,GAAU8e,IAEvB,IAAI7d,EAAEwuB,SACJ,MAAOloB,EAET,IAAIA,EAAEkoB,SACJ,MAAOxuB,EAGT,IAAIA,EAAEysB,GAAGnmB,GACP,MAAO,IAAIvH,GAAU,EAGvB,IAAI8kC,GAAS,GAAI9kC,GAAU,GAC3B,OAAIiB,GAAEysB,GAAGoX,GACA3mC,EAAQ+nB,IAAI3e,GAEjBA,EAAEmmB,GAAGoX,GACA3mC,EAAQ+nB,IAAIjlB,GAGhBA,EAAEuG,YAAeD,EAAEC,WAQjBk6B,EAAQzgC,EAAGsG,EAAG,SAAUvC,EAAGC,GAAK,MAAOD,GAAIC,IAP3ChE,EAAEuG,YAAeD,EAAEC,WAGjB,GAAIxH,GAAUiB,EAAEouB,cAAgB9nB,EAAE8nB,aACpC/oB,KACAA,KAJIw+B,GA+Ib3mC,EAAQm7B,cAAgB,SAAUr4B,EAAG4zB,EAAKkQ,GACxC,GAAIrlC,GAAYm1B,EAAIn1B,SACpB,IAAIqlC,GACF,GAAI9jC,EAAEe,MAAM0b,GAAGmX,EAAI4N,KACjB,KAAM,IAAIpjC,OAAM,wDAEb,IAAI4B,EAAEe,MAAM4zB,GAAGf,EAAI4N,KACxB,KAAM,IAAIpjC,OAAM,mDAElB,IAAI4B,EAAEysB,GAAG,IACP,MAAOvvB,GAAQ4gB,GAAGrf,EAGpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,IAE/BqlC,IACF9jC,EAAI4zB,EAAI4N,IAAIvjB,IAAIje,GAGlB,IAAI0qB,GAAOxtB,EAAQ27B,cAAcjF,EAAI4N,IAAItV,MAAMlsB,EAAE6tB,MAAM7tB,IAAIsB,OACtB2c,IAAIje,EAAEutB,KAAKqG,EAAI4N,MAAO5N,GAAK/F,MAAM,EAGtE,OADA+F,GAAI11B,QAAQO,UAAWA,IAChBisB,EAAKgY,KAAKjkC,EAAY,IAW/BvB,EAAQg8B,cAAgB,SAAUl5B,EAAG4zB,EAAKkQ,GACxC,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAGjB,IAAIpf,GAAYm1B,EAAIn1B,UAChBslC,EAAO/jC,EAAEe,KACb,IAAI+iC,EAAY,CACd,GAAIC,EAAKtnB,GAAGmX,EAAI4N,KACd,KAAM,IAAIpjC,OAAM,mDAGlBw1B,GAAI11B,QAAQO,UAAWA,EAAY,IACnCuB,EAAI4zB,EAAI4N,IAAIvjB,IAAIje,GAChB4zB,EAAI11B,QAAQO,UAAWA,IAEvBslC,EAAO/jC,EAAEe,UACJ,IAAIgjC,EAAKpP,GAAGf,EAAI4N,KACrB,KAAM,IAAIpjC,OAAM,mDAIlB,IAAI2lC,EAAKpP,GAAG,IAAM,CAChBf,EAAI11B,QAAQO,UAAWA,EAAY,GAGnC,IAAI0G,GAAOnF,EAAE8X,EACTghB,EAAS57B,EAAQ4gB,GAAGrf,EAAY,GAAGwf,IAAI,EAM3C,OALAje,GAAI84B,EAAO5M,MAAMhvB,EAAQg8B,cAActF,EAAI4N,IAAItV,MAAMlsB,EAAE6tB,MAAM7tB,IAAIsB,OAAQsyB,IACzE5zB,EAAE8X,EAAI3S,EAENnF,EAAEb,YAAcy0B,EAChBA,EAAI11B,QAAQO,UAAWA,IAChBuB,EAAE0iC,KAAKjkC,EAAY,GAE5B,GAAIulC,GAAaD,EAAKpP,GAAG,IACrBqP,KACFpQ,EAAI11B,QAAQO,UAAWA,EAAY,IAGnCuB,EAAIA,EAAEie,IAAI,GAAI2V,GAAI,GAAGtyB,OAAOusB,MAAM+F,EAAI4N,IAAItV,MAAMlsB,EAAE6tB,MAAM7tB,IAAIsB,OACrDisB,KAAKqG,EAAI4N,KAAKlgC,SAErBsyB,EAAI11B,QAAQO,UAAWA,IAIzB,IAAIqgB,GAAoB,IAAbrgB,GAAqBuB,EAAEsjC,MAAQr+B,KAAK9D,IAAI1C,IAAeuB,EAAEyc,GAAG,KACnEkmB,EAAc3iC,EAAGvB,GACjBsjC,EAAc/hC,EAAG4zB,EAErB,OAAIoQ,GACKllB,EAAI+O,MAAM,GAEZ/O,GAWT5hB,EAAQ27B,cAAgB,SAAU74B,EAAG4zB,EAAKkQ,GACxC,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAEjB,KAAMimB,GAAc9jC,EAAEwuB,UAAcsV,IAAe9jC,EAAEuG,WACnD,MAAO,IAAIqtB,GAAI,EAGjB,IAAIn1B,GAAYm1B,EAAIn1B,SACpB,KAAMqlC,IAAe9jC,EAAEuG,YAAgBu9B,GAAc9jC,EAAEwuB,SAAW,CAChE,GAAIsK,GAAS57B,EAAQ4gB,GAAGrf,EAAY,GAAGwf,IAAI,GAAGykB,KAAKjkC,EAAY,EAG/D,OAFAq6B,GAAOhhB,EAAI9X,EAAE8X,EAENghB,EAGTlF,EAAI11B,QAAQO,UAAWA,EAAY,IAE/BqlC,IACF9jC,EAAI4zB,EAAI4N,IAAIvjB,IAAIje,GAGlB,IAAI+jC,GAAO/jC,EAAEe,KACb,IAAIgjC,EAAKlP,IAAI,MAAQ,CACnB,GAAI/V,GAAMokB,EAAcljC,EAIxB,OAFA8e,GAAI3f,YAAcy0B,EAClBA,EAAI11B,QAAQO,UAAWA,IAChBqgB,EAAI4jB,KAAK9O,EAAIn1B,UAAY,GAElC,GAAIslC,EAAKjP,IAAI,OAAQ,CAEnB,GAAIgE,GAAS57B,EAAQ4gB,GAAGrf,EAAY,GAAGwf,IAAI,GACvCa,EAAMga,EAAO5M,MAAMgX,EAActP,EAAI4N,IAAIvjB,IAAI8lB,IAKjD,OAJAjlB,GAAIhH,EAAI9X,EAAE8X,EAEVgH,EAAI3f,YAAcy0B,EAClBA,EAAI11B,QAAQO,UAAWA,IAChBqgB,EAAI4jB,KAAK9O,EAAIn1B,UAAY,GAOlC,MAHAuB,GAAIA,EAAEie,IAAIje,EAAE6tB,MAAM7tB,GAAGutB,KAAK,GAAGjsB,QAE7BsyB,EAAI11B,QAAQO,UAAWA,IAChBvB,EAAQg8B,cAAcl5B,EAAG4zB,IAoBlC12B,EAAQy7B,wBAA0B,SAAU34B,EAAG4zB,EAAKwP,EAAMU,GACxD,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAEjB,IAAIimB,GAAc9jC,EAAEwuB,SAClB,MAAO,IAAIoF,GAAIvuB,IAEjB,KAAK+9B,EACH,GAAIU,GACF,GAAI9jC,EAAEouB,cAAgBpuB,EAAE20B,GAAGf,EAAI4N,KAC7B,KAAM,IAAIpjC,OAAM,4DAEb,IAAI4B,EAAEyc,GAAGmX,EAAI4N,KAClB,KAAM,IAAIpjC,OAAM,kDAIpB,IAAIK,GAAYm1B,EAAIn1B,SACpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,GAEnC,IAAI6H,GAAI,GAAIstB,GAAI5zB,EAChBsG,GAAEnH,YAAcy0B,EAEZkQ,IACFx9B,EAAIstB,EAAI4N,IAAIvjB,IAAI3X,GAGlB,IAAI29B,GAAgB,EAAS39B,EAAEunB,MAAMvnB,GAAGinB,KAAKqG,EAAI4N,KAAOl7B,EAAEunB,MAAMvnB,GAAG4lB,MAAM0H,EAAI4N,KACzE1iB,EAAMxY,EAAEinB,KAAK0W,EAAc3iC,QAAQ0c,IAGvC,OADA4V,GAAI11B,QAAQO,UAAWA,IAChB,GAAIm1B,GAAI9U,EAAI/Y,YAAYtH,KAejCvB,EAAQ87B,YAAc,SAAUh5B,EAAG4zB,EAAKkQ,GACtC,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAGjB,IAAIkmB,GAAO/jC,EAAEe,KACb,IAAIgjC,EAAKtX,GAAGmH,EAAI4N,KACd,MAAO,IAAI5N,GAAI5zB,EAAEouB,cAAgB/oB,IAAWA,IAE9C,IAAI0+B,EAAKpP,GAAGf,EAAI4N,MACd,IAAKsC,EACH,KAAM,IAAI1lC,OAAM,yDAEb,IAAI0lC,EACT,KAAM,IAAI1lC,OAAM,0CAGlB,IAAI4B,EAAEwuB,SACJ,MAAO,IAAIoF,GAAI,EAGjB,IAAIn1B,GAAYm1B,EAAIn1B,SACpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,GAEnC,IAAI6H,GAAI,GAAIstB,GAAI5zB,EAChBsG,GAAEnH,YAAcy0B,EAEZkQ,IACFx9B,EAAIstB,EAAI4N,IAAIvjB,IAAI3X,GAElB,IAAIwY,GAAM8U,EAAI4N,IAAIjU,KAAKjnB,GAAG2X,IAAI2V,EAAI4N,IAAItV,MAAM5lB,IAAI0X,KAAKC,IAAI,EAGzD,OADA2V,GAAI11B,QAAQO,UAAWA,IAChB,GAAIm1B,GAAI9U,EAAI/Y,YAAYtH,KAiBjCvB,EAAQ48B,gBAAkB,SAAU95B,EAAG4zB,EAAKwP,EAAMU,GAChD,GAAI9jC,EAAEsF,UAAYtF,EAAEuG,WAClB,MAAO,IAAIqtB,GAAI/V,IAEjB,IAAIpf,GAAYm1B,EAAIn1B,UAGhB6H,EAAI,GAAIstB,GAAI5zB,GAGZkkC,EAAQ59B,EAAE8nB,YACV8V,KACF59B,EAAEwR,GAAKxR,EAAEwR,EAIX,IAAIqsB,GAAsB1lC,GAAmC,EAAtBwG,KAAK9D,IAAI1C,IAAkB,CAKlE,IAJAm1B,EAAI11B,QAAQO,UAAW0lC,IAEvB79B,EAAI+8B,EAAe/8B,EAAG69B,EAAqBf,GAC3C98B,EAAE,GAAGnH,YAAcy0B,EACfttB,EAAE,GAOJ,MANAA,GAAIA,EAAE,GACFw9B,GAAcx9B,EAAEkoB,WAClBloB,EAAI,GAAIstB,GAAIvuB,MAGduuB,EAAI11B,QAAQO,UAAWA,IAChB6H,CAGT,IAAIwY,EAEJ,IADAxY,EAAIA,EAAE,GACF88B,EAAM,CACRtkB,EAAMqkB,EAAe78B,EAAE2X,IAAI,MAAOmlB,GAClCxP,EAAI11B,QAAQO,UAAWwG,KAAKjD,IAAImiC,EAAqB1lC,EAAY,KAKjE,KAAK,GAHD2lC,GAAO,GAAIxQ,GAAI,GACfyQ,EAAU,GAAIzQ,GAAI,IAClB0Q,EAAS,GAAI1Q,GAAI,IACZzvB,EAAI,EAAO,EAAJA,IAASA,EAAG,CAC1B,GAAIogC,GAAOzlB,EAAI+O,MAAM/O,GACjB0lB,EAAOD,EAAK1W,MAAM/O,GAClB2lB,EAAOD,EAAK3W,MAAM0W,EACtBzlB,GAAMulB,EAAQxW,MAAM4W,GAAMvY,MAClBoY,EAAOzW,MAAM2W,IAAOjX,KAClB6W,EAAKvW,MAAM/O,IAGnBolB,IACFplB,EAAIhH,GAAKgH,EAAIhH,OAEV,CACL,GAAI4sB,GAAYC,CACZr+B,GAAEvF,MAAM0b,GAAGmX,EAAI4N,MACjBkD,EAAa,GACbC,EAAQ,IAERD,EAAa,IACbC,EAAQ,GAGV7lB,EAAMqkB,EAAe78B,EAAE2X,IAAIymB,GAAatB,GACxCxP,EAAI11B,QAAQO,UAAWwG,KAAKjD,IAAImiC,EAAqB1lC,EAAY,IAGjE,KADA,GAAImmC,GAAQ,GAAIhR,GAAI,GACb+Q,EAAQ,IAAKA,EAAO,CACzB,GAAIJ,GAAOzlB,EAAI+O,MAAM/O,GACjB+lB,EAAON,EAAK1W,MAAM0W,EACtBzlB,GAAM8lB,EAAM/W,MAAMgX,EAAK3Y,MAAMqY,IAAOhX,KAAKqG,EAAI4N,MAWjD,MAPIsC,KACFhlB,EAAOA,EAAIta,IAAM/F,EACb,GAAIm1B,GAAIvuB,KACRuuB,EAAI4N,IAAIvjB,IAAIa,IAGlB8U,EAAI11B,QAAQO,UAAWA,IAChBqgB,EAAI4jB,KAAKjkC,EAAY,IAe9BvB,EAAQk9B,QAAU,SAAUp6B,EAAG4zB,EAAKkQ,GAClC,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAGjB,IAAIpf,GAAYm1B,EAAIn1B,UAChBqf,EAAK5gB,EAAQ4gB,GAAGrf,EAAY,GAC5Bq6B,EAAShb,EAAGG,IAAI,GAAGykB,KAAKjkC,EAAY,EACxCqf,GAAKA,EAAG4kB,KAAKjkC,EAAY,EAEzB,IAAI6H,GAAI+8B,EAAerjC,EAAGvB,EAAW,GAAG,EACxC,IAAI6H,EAAEvF,MAAM0rB,GAAG3O,GACb,MAAO,IAAI8V,GAAIvuB,IAGjBuuB,GAAI11B,QAAQO,UAAWA,EAAY,GACnC,IAAIgK,GAAMvL,EAAQ48B,gBAAgBxzB,EAAGstB,EAAK,GAAG,GACzCprB,EAAMg6B,EAAS/5B,EAEnBA,GAAMA,EAAIi6B,KAAKjkC,GACf+J,EAAMA,EAAIk6B,KAAKjkC,GAGX6H,EAAEmmB,GAAGzsB,GACHsG,EAAEquB,GAAGmE,KACPtwB,EAAIsP,GAAKtP,EAAIsP,GAENgG,EAAGoO,MAAM5lB,EAAEvF,OAAO4zB,GAAGmE,KAC9BtwB,EAAIsP,GAAKtP,EAAIsP,EAGf,IAAI+T,GAAM,EAAerjB,EAAIyV,IAAIxV,GAAOA,EAAIwV,IAAIzV,EAGhD,OADAorB,GAAI11B,QAAQO,UAAWA,IAChB,GAAIm1B,GAAI/H,EAAI9lB,YAAYtH,KAwBjCvB,EAAQ88B,oBAAsB,SAAUh6B,EAAG4zB,EAAKwP,EAAMU,GACpD,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAEjB,KAAK7d,EAAEuG,WACL,MACS,IAAIqtB,GADTkQ,EACa,EAEF,EAAS9jC,EAAIqF,IAG9B,IAAI5G,GAAYm1B,EAAIn1B,SACpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,GAEnC,IAAI6H,GAAI,GAAIstB,GAAI5zB,EAQhB,OAPAsG,GAAEnH,YAAcy0B,EAEhBttB,EAAIA,EAAEpF,MACNoF,EAAI,EAASA,EAAE4lB,MAAM0H,EAAI4N,IAAIvjB,IAAI3X,IAAMA,EAAEinB,KAAKqG,EAAI4N,IAAIvjB,IAAI3X,IAC1DA,EAAI,EAAe,GAAIstB,GAAI,GAAG3V,IAAI3X,GAAKA,EAAE2X,IAAI,GAE7C2V,EAAI11B,QAAQO,UAAWA,IAChB,GAAIm1B,GAAIttB,EAAEP,YAAYtH,KAmB/BvB,EAAQo9B,UAAY,SAAUt6B,EAAG4zB,EAAKkQ,GACpC,GAAI9jC,EAAEsF,QACJ,MAAO,IAAIsuB,GAAI/V,IAEjB,KAAK7d,EAAEuG,WACL,MAAO,IAAIqtB,GAAI5zB,EAAE8X,EAGnB,IAAIrZ,GAAYm1B,EAAIn1B,SACpBm1B,GAAI11B,QAAQO,UAAWA,EAAY,GAEnC,IAAI6H,GAAI,GAAIstB,GAAI5zB,EAChBsG,GAAEnH,YAAcy0B,CAEhB,IAAIkR,GAASx+B,EAAEpF,MACX6jC,EAASnR,EAAI4N,IAAIvjB,IAAI6mB,GACrBhmB,EAAMgmB,EAAO5Y,MAAM6Y,EAIvB,OAHAjmB,GAAM,EAAegmB,EAAOvX,KAAKwX,GAAQ9mB,IAAIa,GAAOA,EAAIb,IAAI6mB,EAAOvX,KAAKwX,IAExEnR,EAAI11B,QAAQO,UAAWA,IAChBqgB,EAAI4jB,KAAKjkC,EAAY,IA0R9BvB,EAAQkI,OAAS,SAAS/B,EAAO1E,GAC/B,GAAuB,kBAAZA,GAET,MAAOA,GAAQ0E,EAIjB,KAAKA,EAAMkD,WACT,MAAOlD,GAAMiC,QAAU,MAASjC,EAAMsxB,GAAG,GAAK,WAAa,WAI7D,IAAIpvB,GAAW,OACX9G,EAAYyE,MAkBhB,QAhBgBA,SAAZvE,IAEEA,EAAQ4G,WACVA,EAAW5G,EAAQ4G,UAIjBR,EAASpG,GACXF,EAAYE,EAELA,EAAQF,YACfA,EAAYE,EAAQF,YAKhB8G,GACN,IAAK,QACH,MAAOrI,GAAQsI,QAAQnC,EAAO5E,EAEhC,KAAK,cACH,MAAOvB,GAAQuI,cAAcpC,EAAO5E,EAEtC,KAAK,OAGH,GAAIiH,GAAQ,KACRC,EAAQ,GACRhH,IAAWA,EAAQiH,cACa1C,SAA9BvE,EAAQiH,YAAYF,QACtBA,EAAQ/G,EAAQiH,YAAYF,OAEIxC,SAA9BvE,EAAQiH,YAAYD,QACtBA,EAAQhH,EAAQiH,YAAYD,OAKhC,IACEq/B,SAAU3hC,EAAMlE,YAAY6lC,SAC5BC,SAAU5hC,EAAMlE,YAAY8lC,WAS9B,GANA5hC,EAAMlE,YAAYjB,QAChB8mC,SAAU//B,KAAKC,MAAMD,KAAK9D,IAAIuE,GAAST,KAAK4J,MAC5Co2B,SAAUhgC,KAAKC,MAAMD,KAAK9D,IAAIwE,GAASV,KAAK4J,QAI1CxL,EAAMmrB,SAAU,MAAO,GAG3B,IAAI3oB,GACA9E,EAAMsC,EAAMtC,KAWhB,OARE8E,GAFE9E,EAAI+zB,IAAIpvB,IAAU3E,EAAI0b,GAAG9W,GAErBtC,EAAM6hC,oBAAoBzmC,GAAW+G,UAIrCtI,EAAQuI,cAAcpC,EAAO5E,GAI9BoH,EAAII,QAAQ,sBAAuB,WACxC,GAAI5G,GAAS6G,UAAU,GACnB1B,EAAI0B,UAAU,EAClB,OAAmB,MAAX7G,EAAkBA,EAASmF,EAAIA,GAG3C,SACE,KAAM,IAAIpG,OAAM,qBAAuBmH,EAAW,kDAaxDrI,EAAQuI,cAAgB,SAASpC,EAAO5E,GACtC,MAAkByE,UAAdzE,EACK4E,EAAMoC,cAAchH,EAAY,GAGhC4E,EAAMoC,iBAUjBvI,EAAQsI,QAAU,SAASnC,EAAO5E,GAChC,MAAO4E,GAAMmC,QAAQ/G,GAAa,KAiB/B,SAAStB,EAAQD,EAASM,GAE/B,YAkBA,SAAS6N,GAAMrL,GAGb,IAFA,GAAI8J,MAEG1G,EAAQpD,IACb8J,EAAKQ,KAAKtK,EAAEqE,QACZrE,EAAIA,EAAE,EAGR,OAAO8J,GA+BT,QAASq7B,GAAU7kC,EAAOwJ,EAAMe,GAC9B,GAAI1G,GACAC,EAAM9D,EAAM+D,MAEhB,IAAID,GAAO0F,EAAKe,GACd,KAAM,IAAIU,GAAenH,EAAK0F,EAAKe,GAGrC,IAAIA,EAAMf,EAAKzF,OAAS,EAAG,CAEzB,GAAI+gC,GAAUv6B,EAAM,CACpB,KAAK1G,EAAI,EAAOC,EAAJD,EAASA,IAAK,CACxB,GAAIyH,GAAQtL,EAAM6D,EAClB,KAAKf,EAAQwI,GACX,KAAM,IAAIL,GAAezB,EAAKzF,OAAS,EAAGyF,EAAKzF,OAAQ,IAEzD8gC,GAAU7kC,EAAM6D,GAAI2F,EAAMs7B,QAK5B,KAAKjhC,EAAI,EAAOC,EAAJD,EAASA,IACnB,GAAIf,EAAQ9C,EAAM6D,IAChB,KAAM,IAAIoH,GAAezB,EAAKzF,OAAS,EAAGyF,EAAKzF,OAAQ,KA2F/D,QAASghC,GAAS/kC,EAAOwJ,EAAMe,EAAKkB,GAClC,GAAI5H,GACAwI,EACA24B,EAAShlC,EAAM+D,OACfkhC,EAASz7B,EAAKe,GACd26B,EAASvgC,KAAKjD,IAAIsjC,EAAQC,EAK9B,IAFAjlC,EAAM+D,OAASkhC,EAEX16B,EAAMf,EAAKzF,OAAS,EAAG,CAEzB,GAAI+gC,GAAUv6B,EAAM,CAGpB,KAAK1G,EAAI,EAAOqhC,EAAJrhC,EAAYA,IAEtBwI,EAAOrM,EAAM6D,GACRf,EAAQuJ,KACXA,GAAQA,GACRrM,EAAM6D,GAAKwI,GAEb04B,EAAQ14B,EAAM7C,EAAMs7B,EAASr5B,EAI/B,KAAK5H,EAAIqhC,EAAYD,EAAJphC,EAAYA,IAE3BwI,KACArM,EAAM6D,GAAKwI,EAGX04B,EAAQ14B,EAAM7C,EAAMs7B,EAASr5B,OAG5B,CAIH,IAAK5H,EAAI,EAAOqhC,EAAJrhC,EAAYA,IACtB,KAAOf,EAAQ9C,EAAM6D,KACnB7D,EAAM6D,GAAK7D,EAAM6D,GAAG,EAIxB,IAAG4H,IAAiB7O,EAAQ0gB,cAE1B,IAAKzZ,EAAIqhC,EAAYD,EAAJphC,EAAYA,IAC3B7D,EAAM6D,GAAKvF,EAAOM,MAAM6M,IA6ChC,QAAS05B,GAAUnlC,EAAOoL,EAAMb,GAC9B,GAAI1G,GAAGkG,CAEP,IAAUqB,EAANb,EAAY,CACd,GAAI3D,GAAO2D,EAAM,CACjB,KAAK1G,EAAI,EAAGkG,EAAK/J,EAAM+D,OAAYgG,EAAJlG,EAAQA,IACrC7D,EAAM6D,GAAKshC,EAASnlC,EAAM6D,GAAIuH,EAAMxE,OAItC,MAAO9D,EAAQ9C,IACbA,EAAQA,EAAM,EAIlB,OAAOA,GAwCT,QAASolC,GAAYplC,EAAOoL,EAAMb,GAChC,GAAI1G,GAAGkG,CAEP,IAAIjH,EAAQ9C,GAAQ,CAClB,GAAI4G,GAAO2D,EAAM,CACjB,KAAK1G,EAAI,EAAGkG,EAAK/J,EAAM+D,OAAYgG,EAAJlG,EAAQA,IACrC7D,EAAM6D,GAAKuhC,EAAWplC,EAAM6D,GAAIuH,EAAMxE,OAIxC,KAAK,GAAI0I,GAAI/E,EAASa,EAAJkE,EAAUA,IAC1BtP,GAASA,EAIb,OAAOA,GA5UT,GAAI9B,GAAShB,EAAoB,GAC7BuK,EAASvK,EAAoB,KAC7BoB,EAASpB,EAAoB,GAG7B+N,GAFQ/N,EAAoB,KAEXA,EAAoB,MACrCkhB,EAAalhB,EAAoB,KAEjC4F,EAAUD,MAAMC,OA2BpBlG,GAAQ4M,KAAO,SAAS9J,GAEtB,GAAI8X,GAAIzM,EAAMrL,EAMd,OAHA9C,GAAQyoC,SAAS3lC,EAAG8X,GAGbA,GAgDT5a,EAAQyoC,SAAW,SAASrlC,EAAOwJ,GACjC,GAAIgB,GAA2B,GAAfhB,EAAKzF,MACrB,IAAIyG,GAEF,GAAI1H,EAAQ9C,GACV,KAAM,IAAIiL,GAAejL,EAAM+D,OAAQ,OAKzC8gC,GAAU7kC,EAAOwJ,EAAM,IAS3B5M,EAAQsO,cAAgB,SAASjJ,EAAO8B,GACtC,IAAK7F,EAAOuG,SAASxC,KAAW/D,EAAOwG,UAAUzC,GAC/C,KAAM,IAAIlC,WAAU,oCAAsCkC,EAAQ,IAEpE,IAAY,EAARA,EACF,KAAM,IAAImc,GAAWnc,EAEvB,IAAeW,SAAXmB,GAAwB9B,GAAS8B,EACnC,KAAM,IAAIqa,GAAWnc,EAAO8B,IAKhCnH,EAAQ0gB,iBAWR1gB,EAAQwP,OAAS,SAASpM,EAAOwJ,EAAMiC,GAIrC,IAAK3I,EAAQ9C,KAAW8C,EAAQ0G,GAC9B,KAAM,IAAIzJ,WAAU,iBAEtB,IAAoB,IAAhByJ,EAAKzF,OACP,KAAM,IAAIjG,OAAM,sCAIlB0L,GAAKxH,QAAQ,SAAUe,GACrB,IAAK7E,EAAOuG,SAAS1B,KAAW7E,EAAOwG,UAAU3B,IAAkB,EAARA,EACzD,KAAM,IAAIhD,WAAU,uDACJ0H,EAAO3C,OAAO0E,GAAQ,MAK1C,IAAI87B,GAAkC1iC,SAAjB6I,EAA8BA,EAAe,CAGlE,OAFAs5B,GAAQ/kC,EAAOwJ,EAAM,EAAG87B,GAEjBtlC,GAyETpD,EAAQssB,QAAU,SAASlpB,EAAOwJ,GAIhC,IAHA,GAAIgO,GAAIhO,GAAQ5M,EAAQ4M,KAAKxJ,GAGtB8C,EAAQ9C,IAA2B,IAAjBA,EAAM+D,QAC7B/D,EAAQA,EAAM,GACdwX,EAAE8a,OAKJ,KADA,GAAIlnB,GAAOoM,EAAEzT,OACU,IAAhByT,EAAEpM,EAAO,IACdA,GASF,OALIA,GAAOoM,EAAEzT,SACX/D,EAAQmlC,EAASnlC,EAAOoL,EAAM,GAC9BoM,EAAEzT,OAASqH,GAGNpL,GAsCTpD,EAAQiP,UAAY,SAAS7L,EAAOoL,EAAMQ,EAAOpC,GAC/C,GAAIgO,GAAIhO,GAAQ5M,EAAQ4M,KAAKxJ,EAG7B,IAAI4L,EACF,IAAK,GAAI/H,GAAI,EAAO+H,EAAJ/H,EAAWA,IACzB7D,GAASA,GACTwX,EAAE+tB,QAAQ,EAMd,KADAvlC,EAAQolC,EAAWplC,EAAOoL,EAAM,GACzBoM,EAAEzT,OAASqH,GAChBoM,EAAExN,KAAK,EAGT,OAAOhK,IAmCTpD,EAAQosB,QAAU,SAAShpB,GAIzB,IAHA,GAAI0zB,GAAO1zB,EACP8C,EAAUD,MAAMC,QAEbA,EAAQ4wB,EAAK,KAAK,CAEvB,IAAK,GADD9sB,MACK/C,EAAI,EAAGkG,EAAK2pB,EAAK3vB,OAAYgG,EAAJlG,EAAQA,IACxC+C,EAAOA,EAAK9E,OAAOuI,MAAMzD,EAAM8sB,EAAK7vB,GAEtC6vB,GAAO9sB,EAGT,MAAO8sB,IAQT92B,EAAQoiB,YAAc,SAAS/V,GAE7B,IAAK,GADDjJ,MACK6D,EAAI,EAAGC,EAAMmF,EAAKlF,OAAYD,EAAJD,EAASA,IAC1C7D,EAAM6D,GAAKoF,EAAKpF,EAElB,OAAO7D,IAQTpD,EAAQkG,QAAUA,GAIb,SAASjG,GAEdA,EAAOD,QAAU,kBAOZ,SAASC,GAEd,YAWA,SAASshB,GAAe/Z,EAAI05B,EAAOp8B,EAAKS,GACtC,KAAMnF,eAAgBmhB,IACpB,KAAM,IAAI9X,aAAY,mDAGxBrJ,MAAKoH,GAAKA,EACVpH,KAAK8gC,MAAQA,EACb9gC,KAAK0E,IAAMA,EACX1E,KAAKmF,IAAMA,EAEXnF,KAAK8oB,QAAU,yCAA2C1hB,EACtD,KAAO05B,EAAQ,cACfp8B,GAAekB,QAAPT,EAAqB,IAAMA,EAAO,IAAM,aAEpDnF,KAAKkjC,OAAQ,GAAKpiC,QAASoiC,MAG7B/hB,EAAe/V,UAAY,GAAItK,OAC/BqgB,EAAe/V,UAAUvJ,YAAcf,MACvCqgB,EAAe/V,UAAUuE,KAAO,iBAEhC9P,EAAOD,QAAUuhB,GAKZ,SAASthB,GAEd,YAYA,SAASuhB,GAAWnc,EAAOP,EAAKS,GAC9B,KAAMnF,eAAgBohB,IACpB,KAAM,IAAI/X,aAAY,mDAGxBrJ,MAAKiF,MAAQA,EACT2D,UAAU7B,OAAS,GACrB/G,KAAK0E,IAAM,EACX1E,KAAKmF,IAAMT,IAGX1E,KAAK0E,IAAMA,EACX1E,KAAKmF,IAAMA,GAIXnF,KAAK8oB,QADUljB,SAAb5F,KAAK0E,KAAqB1E,KAAKiF,MAAQjF,KAAK0E,IAC/B,uBAAyB1E,KAAKiF,MAAQ,MAAQjF,KAAK0E,IAAM,IAEpDkB,SAAb5F,KAAKmF,KAAqBnF,KAAKiF,OAASjF,KAAKmF,IACrC,uBAAyBnF,KAAKiF,MAAQ,OAASjF,KAAKmF,IAAM,GAAK,IAG/D,uBAAyBnF,KAAKiF,MAAQ,IAGvDjF,KAAKkjC,OAAQ,GAAKpiC,QAASoiC,MAG7B9hB,EAAWhW,UAAY,GAAIumB,YAC3BvQ,EAAWhW,UAAUvJ,YAAc8vB,WACnCvQ,EAAWhW,UAAUuE,KAAO,aAE5B9P,EAAOD,QAAUwhB,GAKZ,SAASvhB,GAEd,YASA,SAASwhB,GAAqBja,GAC5B,KAAMpH,eAAgBqhB,IACpB,KAAM,IAAIhY,aAAY,mDAGxBrJ,MAAKoH,GAAKA,EACVpH,KAAKyC,MAAQoD,MAAMuF,UAAUm1B,OAAOhgC,KAAKqI,UAAW,GAOhD5I,KAAK8oB,QALJ1hB,EAIsB,GAArBpH,KAAKyC,MAAMsE,OACE,4CAA8CK,EAG9C,YAAcA,EAAK,IAAMpH,KAAKyC,MAAMkL,KAAK,MAAQ,kBAPnD,+BAWjB3N,KAAKkjC,OAAQ,GAAKpiC,QAASoiC,MAG7B7hB,EAAqBjW,UAAY,GAAIrI,WACrCse,EAAqBjW,UAAUvJ,YAAckB,UAC7Cse,EAAqBjW,UAAUuE,KAAO,uBAEtC9P,EAAOD,QAAUyhB,GAKZ,SAASxhB,EAAQD,EAASM,GAE/B,YAiBA,SAASsiB,GAAUc,GACjB,KAAMtjB,eAAgBwiB,IACpB,KAAM,IAAInZ,aAAY,mDAMxB,IAHArJ,KAAKsjB,MAAQA,OAGRxd,EAAQ9F,KAAKsjB,SAAWtjB,KAAKsjB,MAAMklB,MAAMC,GAC5C,KAAM,IAAI1lC,WAAU,mCAxBxB,GAAIigB,GAAO9iB,EAAoB,KAE3BuK,GADSvK,EAAoB,GACpBA,EAAoB,MAI7B4F,GAHa5F,EAAoB,IAC1BA,EAAoB,KAEjB2F,MAAMC,SAChB2iC,EAASzlB,EAAKylB,MAqBlBjmB,GAAUpX,UAAY,GAAI4X,GAE1BR,EAAUpX,UAAU5J,KAAO,YAS3BghB,EAAUpX,UAAUs9B,SAAW,SAAUC,GACvC,GAAIvT,GAA0C,UAA9BuT,EAAK5nC,KAAKH,SAASK,OAE/BqiB,EAAQtjB,KAAKsjB,MAAMpe,IAAI,SAAU/B,GACnC,MAAOA,GAAKulC,SAASC,IAGvB,QAAQvT,EAAW,gBAAkB,KACjC9R,EAAM3V,KAAK,MACVynB,EAAW,KAAO,MAOzB5S,EAAUpX,UAAUpG,QAAU,SAAU0H,GACtC,IAAK,GAAI7F,GAAI,EAAGA,EAAI7G,KAAKsjB,MAAMvc,OAAQF,IAAK,CAC1C,GAAI1D,GAAOnD,KAAKsjB,MAAMzc,EACtB6F,GAASvJ,EAAM,SAAW0D,EAAI,IAAK7G,QAUvCwiB,EAAUpX,UAAUlG,IAAM,SAAUwH,GAElC,IAAK,GADD4W,MACKzc,EAAI,EAAGA,EAAI7G,KAAKsjB,MAAMvc,OAAQF,IACrCyc,EAAMzc,GAAK7G,KAAK4oC,QAAQl8B,EAAS1M,KAAKsjB,MAAMzc,GAAI,SAAWA,EAAI,IAAK7G,MAEtE,OAAO,IAAIwiB,GAAUc,IAOvBd,EAAUpX,UAAUxJ,MAAQ,WAC1B,MAAO,IAAI4gB,GAAUxiB,KAAKsjB,MAAMoM,MAAM,KAQxClN,EAAUpX,UAAUO,SAAW,WAC7B,MAAOlB,GAAO3C,OAAO9H,KAAKsjB,QAO5Bd,EAAUpX,UAAUy9B,MAAQ,SAASrnC,GACnCA,EAAOA,GAAQ,SACf,IAAIgZ,GAAI,WAAahZ,EAAO,GAgB5B,OAdAxB,MAAKsjB,MAAMte,QAAQ,SAAS7B,GAExBqX,GADErX,EAAKmgB,MACFngB,EAAKmgB,MAAMpe,IAAI,SAAS4jC,GAC3B,MAAOA,GAAUD,UAChBl7B,KAAK,KAGHxK,EAAK0lC,QAIZruB,GAAK,SAEPA,GAAK,SAAWhZ,EAAO,KAIzB3B,EAAOD,QAAU4iB,GAKZ,SAAS3iB,EAAQD,EAASM,GAE/B,YAkBA,SAASuiB,GAAe9S,EAAMsQ,GAC5B,KAAMjgB,eAAgByiB,IACpB,KAAM,IAAIpZ,aAAY,mDAIxB,KAAKmB,EAASmF,GAAgB,KAAM,IAAI5M,WAAU,uCAClD,MAAMkd,YAAgB+C,IAAQ,KAAM,IAAIjgB,WAAU,qCAClD,IAAI4M,IAAQo5B,GAAkB,KAAM,IAAIjoC,OAAM,yBAA4B6O,EAAQ,0BAElF3P,MAAK2P,KAAOA,EACZ3P,KAAKigB,KAAOA,EA3Bd,GAAI+C,GAAO9iB,EAAoB,KAC3BsiB,EAAYtiB,EAAoB,KAEhC6oC,EAAW7oC,EAAoB,KAE/B8oC,EAAQ9oC,EAAoB,KAC5BsK,EAAWtK,EAAoB,KAAKsK,QAwBxCiY,GAAerX,UAAY,GAAI4X,GAE/BP,EAAerX,UAAU5J,KAAO,iBAShCihB,EAAerX,UAAUs9B,SAAW,SAAUC,GAC5C,MAAO,UAAY3oC,KAAK2P,KAAO,QAAU3P,KAAKigB,KAAKyoB,SAASC,IAQ9DlmB,EAAerX,UAAUpG,QAAU,SAAU0H,GAC3CA,EAAS1M,KAAKigB,KAAM,OAAQjgB,OAS9ByiB,EAAerX,UAAUlG,IAAM,SAAUwH,GACvC,MAAO,IAAI+V,GAAeziB,KAAK2P,KAAM3P,KAAK4oC,QAAQl8B,EAAS1M,KAAKigB,KAAM,OAAQjgB,SAOhFyiB,EAAerX,UAAUxJ,MAAQ,WAC/B,MAAO,IAAI6gB,GAAeziB,KAAK2P,KAAM3P,KAAKigB,OAO5CwC,EAAerX,UAAUO,SAAW,WAClC,MAAO3L,MAAK2P,KAAO,MAAQ3P,KAAKigB,KAAKtU,YAOvC8W,EAAerX,UAAUy9B,MAAQ,WAC/B,GAAII,EAIJ,OAHIjpC,MAAKigB,eAAgBuC,KACvBymB,GAAS,YAAa,MAEjBD,EAAME,UAAUF,EAAMG,SAASnpC,KAAK2P,MAAOs5B,GAAS,IACvDD,EAAME,UAAUlpC,KAAKigB,KAAK4oB,UAGhChpC,EAAOD,QAAU6iB,GAIZ,SAAS5iB,EAAQD,EAASM,GAE/B,YAeA,SAASwiB,GAAUuC,GACjB,KAAMjlB,eAAgB0iB,IACpB,KAAM,IAAIrZ,aAAY,mDAIxB,KAAKxD,MAAMC,QAAQmf,GAAS,KAAM,IAAInkB,OAAM,iBAC5Cd,MAAKilB,OAASA,EAAO/f,IAAI,SAAUkkC,GACjC,GAAIjmC,GAAUimC,GAASA,EAAMjmC,KACzB6hB,EAAUokB,GAA2BxjC,SAAlBwjC,EAAMpkB,QAAwBokB,EAAMpkB,SAAU,CAErE,MAAM7hB,YAAgB6f,IAAQ,KAAM,IAAIjgB,WAAU,iCAClD,KAAK8rB,EAAU7J,GAAe,KAAM,IAAIjiB,WAAU,uCAElD,QACEI,KAAMA,EACN6hB,QAASA,KA7Bf,GAAIhC,GAAO9iB,EAAoB,KAC3BqC,EAAYrC,EAAoB,IAChC2uB,EAAY3uB,EAAoB,KAAK2uB,SAgCzCnM,GAAUtX,UAAY,GAAI4X,GAE1BN,EAAUtX,UAAU5J,KAAO,YAU3BkhB,EAAUtX,UAAUs9B,SAAW,SAAUC,GACvCA,EAAKpmC,UAAYA,CACjB,IAAI0iB,GAASjlB,KAAKilB,OAAO/f,IAAI,SAAU26B,GACrC,GAAIwJ,GAAKxJ,EAAM18B,KAAKulC,SAASC,EAC7B,OAAI9I,GAAM7a,QACD,gBAAkBqkB,EAAK,KAGvBA,EAAK,KAIhB,OAAO,kCAEHpkB,EAAOtX,KAAK,IACZ,sCAQN+U,EAAUtX,UAAUpG,QAAU,SAAU0H,GACtC,IAAK,GAAI7F,GAAI,EAAGA,EAAI7G,KAAKilB,OAAOle,OAAQF,IACtC6F,EAAS1M,KAAKilB,OAAOpe,GAAG1D,KAAM,UAAY0D,EAAI,SAAU7G,OAU5D0iB,EAAUtX,UAAUlG,IAAM,SAAUwH,GAElC,IAAK,GADDuY,MACKpe,EAAI,EAAGA,EAAI7G,KAAKilB,OAAOle,OAAQF,IAAK,CAC3C,GAAIuiC,GAAQppC,KAAKilB,OAAOpe,GACpB1D,EAAOnD,KAAK4oC,QAAQl8B,EAAS08B,EAAMjmC,KAAM,UAAY0D,EAAI,SAAU7G,MACvEilB,GAAOpe,IACL1D,KAAMA,EACN6hB,QAASokB,EAAMpkB,SAGnB,MAAO,IAAItC,GAAUuC,IAOvBvC,EAAUtX,UAAUxJ,MAAQ,WAC1B,GAAIqjB,GAASjlB,KAAKilB,OAAO/f,IAAI,SAASkkC,GACpC,OACEjmC,KAAMimC,EAAMjmC,KACZ6hB,QAASokB,EAAMpkB,UAInB,OAAO,IAAItC,GAAUuC,IAQvBvC,EAAUtX,UAAUO,SAAW,WAC7B,MAAO3L,MAAKilB,OAAO/f,IAAI,SAAU26B,GAC/B,MAAOA,GAAM18B,KAAKwI,YAAck0B,EAAM7a,QAAU,GAAK,OACpDrX,KAAK,OAOV+U,EAAUtX,UAAUy9B,MAAQ,WAC1B,MAAO7oC,MAAKilB,OAAO/f,IAAI,SAAU26B,GAC/B,MAAOA,GAAM18B,KAAK0lC,SAAWhJ,EAAM7a,QAAU,GAAK,OACjDrX,KAAK,OAGV9N,EAAOD,QAAU8iB,GAKZ,SAAS7iB,EAAQD,EAASM,GAE/B,YAsBA,SAASyiB,GAAiB6C,EAAWC,EAAUC,GAC7C,KAAM1lB,eAAgB2iB,IACpB,KAAM,IAAItZ,aAAY,mDAExB,MAAMmc,YAAqBxC,IAAO,KAAM,IAAIjgB,WAAU,qCACtD,MAAM0iB,YAAoBzC,IAAQ,KAAM,IAAIjgB,WAAU,oCACtD,MAAM2iB,YAAqB1C,IAAO,KAAM,IAAIjgB,WAAU,qCAEtD/C,MAAKwlB,UAAYA,EACjBxlB,KAAKylB,SAAWA,EAChBzlB,KAAK0lB,UAAYA,EA9BnB,GAAI1C,GAAO9iB,EAAoB,KAC3B8oC,EAAQ9oC,EAAoB,KAC5BuB,EAAYvB,EAAoB,IAChC+B,EAAU/B,EAAoB,GAC9BmC,EAAOnC,EAAoB,GAC3BoK,EAAOpK,EAAoB,KAC3BsK,EAAWF,EAAKG,OAAOD,SACvB/C,EAAW6C,EAAKpJ,OAAOuG,SACvBonB,EAAYvkB,EAAK,WAAWukB,SAyBhClM,GAAgBvX,UAAY,GAAI4X,GAEhCL,EAAgBvX,UAAU5J,KAAO,kBAUjCmhB,EAAgBvX,UAAUs9B,SAAW,SAASC,GA8B5C,MAxBAA,GAAKW,cAAgB,SAAU9jB,GAC7B,GAAI/d,EAAS+d,IAAcqJ,EAAUrJ,IAAchb,EAASgb,GAC1D,MAAOA,IAAY,GAAO,CAG5B,IAAIA,YAAqB/jB,GACvB,MAAO+jB,GAAU0L,UAAW,GAAQ,CAGtC,IAAI1L,YAAqBvjB,GACvB,MAAQujB,GAAUrc,IAAMqc,EAAUpc,IAAM,GAAO,CAGjD,IAAIoc,YAAqBnjB,GACvB,MAAOmjB,GAAUzf,OAAQ,GAAO,CAGlC,IAAkB,OAAdyf,GAAoC5f,SAAd4f,EACxB,OAAO,CAGT,MAAM,IAAIziB,WAAU,kCAAoC4lC,EAAK5nC,KAAK,UAAUykB,GAAa,MAIvF,iBAAmBxlB,KAAKwlB,UAAUkjB,SAASC,GAAQ,SAC5C3oC,KAAKylB,SAASijB,SAASC,GAAQ,SAC/B3oC,KAAK0lB,UAAUgjB,SAASC,GAAQ,KAQ7ChmB,EAAgBvX,UAAUpG,QAAU,SAAU0H,GAC5CA,EAAS1M,KAAKwlB,UAAW,YAAaxlB,MACtC0M,EAAS1M,KAAKylB,SAAU,WAAYzlB,MACpC0M,EAAS1M,KAAK0lB,UAAW,YAAa1lB,OASxC2iB,EAAgBvX,UAAUlG,IAAM,SAAUwH,GACxC,MAAO,IAAIiW,GACP3iB,KAAK4oC,QAAQl8B,EAAS1M,KAAKwlB,UAAW,YAAaxlB,OACnDA,KAAK4oC,QAAQl8B,EAAS1M,KAAKylB,SAAU,WAAYzlB,OACjDA,KAAK4oC,QAAQl8B,EAAS1M,KAAK0lB,UAAW,YAAa1lB,SAQzD2iB,EAAgBvX,UAAUxJ,MAAQ,WAChC,MAAO,IAAI+gB,GAAgB3iB,KAAKwlB,UAAWxlB,KAAKylB,SAAUzlB,KAAK0lB,YAOjE/C,EAAgBvX,UAAUO,SAAW,WAEnC,MAAO,IAAM3L,KAAKwlB,UAAU7Z,WAAa,QACrC3L,KAAKylB,SAAS9Z,WAAa,QAC3B3L,KAAK0lB,UAAU/Z,WAAa,KAOlCgX,EAAgBvX,UAAUy9B,MAAQ,WAChC,GAAIruB,GACAwuB,EAAME,UAAUlpC,KAAKylB,SAASojB,SAC9B,YACAG,EAAME,UAAU,gBAAkBlpC,KAAKwlB,UAAUqjB,SAC7C,QACJG,EAAME,UAAUlpC,KAAK0lB,UAAUmjB,SAC/B,YACAG,EAAME,UAAU,qBAGpB,OAAOF,GAAME,UAAU1uB,GACrB,+BACA,0BAIJ3a,EAAOD,QAAU+iB,GAKZ,SAAS9iB,EAAQD,EAASM,GAE/B,YAqCA,SAAS0iB,GAAa7c,EAAOwjC,GAC3B,KAAMvpC,eAAgB4iB,IACpB,KAAM,IAAIvZ,aAAY,mDAGxB,IAAIkgC,EAAW,CACb,IAAK/+B,EAAS++B,GACZ,KAAM,IAAIxmC,WAAU,4CAEtB,KAAKyH,EAASzE,GACZ,KAAM,IAAIhD,WAAU,wCAGtB/C,MAAK+F,MAAQA,EACb/F,KAAKupC,UAAYA,MAIjBvpC,MAAK+F,MAAQA,EAAQ,GACrB/F,KAAKupC,UAAY/nC,EAAKuE,EAGxB,KAAKyjC,EAAgBxpC,KAAKupC,WACxB,KAAM,IAAIxmC,WAAU,8BAAgC/C,KAAKupC,UAAY,KA1DzE,GAAIvmB,GAAO9iB,EAAoB,KAE3BsB,GADYtB,EAAoB,IACzBA,EAAoB,KAAKsB,MAChCgJ,EAAWtK,EAAoB,KAAKsK,SA2DpCg/B,GACFtoC,QAAU,EACVuJ,QAAU,EACVi4B,WAAW,EACX98B,WAAa,EACb68B,QAAQ,EAGV7f,GAAaxX,UAAY,GAAI4X,GAE7BJ,EAAaxX,UAAU5J,KAAO,eAU9BohB,EAAaxX,UAAUs9B,SAAW,SAAUC,GAC1C,OAAQ3oC,KAAKupC,WACX,IAAK,SACH,MAAkC,cAA9BZ,EAAK5nC,KAAKH,SAASM,OACd,mBAAqBlB,KAAK+F,MAAQ,KAIlC/F,KAAK+F,MAAM4C,QAAQ,aAAc,SAAU8gC,EAAOpd,GACvD,MAAOod,GAAM3+B,UAAUuhB,EAAMtlB,SAInC,KAAK,SACH,MAAO,IAAM/G,KAAK+F,MAAQ,GAE5B,KAAK,UACH,MAAO/F,MAAK+F,KAEd,KAAK,YACH,MAAO/F,MAAK+F,KAEd,KAAK,OACH,MAAO/F,MAAK+F,KAEd,SAEE,KAAM,IAAIhD,WAAU,iCAAmC/C,KAAKupC,UAAY,OAQ9E3mB,EAAaxX,UAAUpG,QAAU,aAWjC4d,EAAaxX,UAAUlG,IAAM,WAC3B,MAAOlF,MAAK4B,SAOdghB,EAAaxX,UAAUxJ,MAAQ,WAC7B,MAAO,IAAIghB,GAAa5iB,KAAK+F,MAAO/F,KAAKupC,YAO3C3mB,EAAaxX,UAAUO,SAAW,WAChC,OAAQ3L,KAAKupC,WACX,IAAK,SACH,MAAO,IAAMvpC,KAAK+F,MAAQ,GAE5B,SACE,MAAO/F,MAAK+F,QAQlB6c,EAAaxX,UAAUy9B,MAAQ,WAC7B,GACI5jC,GADAc,EAAQ/F,KAAK+F,KAEjB,QAAQ/F,KAAKupC,WACX,IAAK,SACH,MAAO,UAAYxjC,EAAQ,GAE7B,KAAK,SAEH,MADAd,GAAQc,EAAM+uB,cAAcyM,QAAQ,KACtB,KAAVt8B,EACKc,EAAM+E,UAAU,EAAG7F,GAAS,eAC/Bc,EAAM+E,UAAU7F,EAAQ,GAAK,IAE5Bc,CAET,SACE,MAAOA,KAIblG,EAAOD,QAAUgjB,GAKZ,SAAS/iB,EAAQD,EAASM,GAE/B,YAqBA,SAAS2iB,GAAWvhB,EAAQ8L,GAC1B,KAAMpN,eAAgB6iB,IACpB,KAAM,IAAIxZ,aAAY,mDAIxB,MAAM/H,YAAkB0hB,IAAO,KAAM,IAAIjgB,WAAU,uCACnD,KAAK+C,EAAQsH,KAAYA,EAAOo7B,MAAMC,GACpC,KAAM,IAAI1lC,WAAU,yDAGtB/C,MAAKsB,OAASA,EACdtB,KAAKoN,OAASA,EA/BhB,GAAI4V,GAAO9iB,EAAoB,KAC3BgjB,EAAYhjB,EAAoB,KAChCijB,EAAajjB,EAAoB,KAEjCuB,EAAYvB,EAAoB,IAChCgC,EAAQhC,EAAoB,GAE5BuoC,EAASzlB,EAAKylB,OACd3iC,EAAUD,MAAMC,OA0BpB+c,GAAUzX,UAAY,GAAI4X,GAE1BH,EAAUzX,UAAU5J,KAAO,YAU3BqhB,EAAUzX,UAAUs9B,SAAW,SAAUC,GACvC,MAAO3oC,MAAK0pC,cAAcf,IAe5B9lB,EAAUzX,UAAUs+B,cAAgB,SAASf,EAAMp5B,GAEjD,QAASwf,GAAK5rB,GACZ,MAAQA,aAAgBggB,IAA6B,OAAbhgB,EAAKwM,KAG/C,GAAIg6B,IAAa,EACbC,EAAe5pC,KAAKoN,OAAOlI,IAAI,SAAUG,GAC3C,GAAIwkC,GAASxkC,EAAMN,OAAOgqB,GAAMhoB,OAAS,CAEzC,OADA4iC,GAAaE,EAASA,EAASF,EACxBE,GAITlB,GAAKtjC,MAAQ,SAAUyG,EAAOC,EAAKC,GACjC,MAAO,IAAI9J,GACH4J,YAAiBrK,GAAYqK,EAAMhJ,WAAagJ,EAChDC,YAAetK,GAAYsK,EAAIjJ,WAAaiJ,EAC5CC,YAAgBvK,GAAYuK,EAAKlJ,WAAakJ,GAUxD,IAAIoB,GAASpN,KAAKoN,OAAOlI,IAAI,SAASG,EAAOwB,GAC3C,GAAIgjC,GAASD,EAAa/iC,EAC1B,OAAIxB,aAAiB6d,GACf2mB,EAEK,4EAEwBhjC,EAAI,wBAEtBxB,EAAMyG,MAAM48B,SAASC,GAAQ,SAC7BtjC,EAAM0G,IAAI28B,SAASC,GAAQ,UAC1BtjC,EAAM2G,KAAO3G,EAAM2G,KAAK08B,SAASC,GAAQ,KACnD,gBAKG,SACHtjC,EAAMyG,MAAM48B,SAASC,GAAQ,KAC7BtjC,EAAM0G,IAAI28B,SAASC,GAAQ,MAC1BtjC,EAAM2G,KAAO3G,EAAM2G,KAAK08B,SAASC,GAAQ,KAC1C,IAIFkB,EAEK,4EAEwBhjC,EAAI,cACjBxB,EAAMqjC,SAASC,GAAQ,aAKlCtjC,EAAMqjC,SAASC,IAM5B,OAAIgB,GACK,6BACc3pC,KAAKsB,OAAOonC,SAASC,GAAQ,uFAI1Bv7B,EAAOO,KAAK,MAAQ,SAC9B4B,EAAe,KAAOA,EAAe,IAC/C,WAIG,eACHvP,KAAKsB,OAAOonC,SAASC,GAAQ,eACbv7B,EAAOO,KAAK,MAAQ,KACnC4B,EAAe,KAAOA,EAAe,IACtC,KAQRsT,EAAUzX,UAAUpG,QAAU,SAAU0H,GAEtCA,EAAS1M,KAAKsB,OAAQ,SAAUtB,KAGhC,KAAK,GAAI6G,GAAI,EAAGA,EAAI7G,KAAKoN,OAAOrG,OAAQF,IACtC6F,EAAS1M,KAAKoN,OAAOvG,GAAI,UAAYA,EAAI,IAAK7G,OAUlD6iB,EAAUzX,UAAUlG,IAAM,SAAUwH,GAIlC,IAAK,GAHDpL,GAAStB,KAAK4oC,QAAQl8B,EAAS1M,KAAKsB,OAAQ,SAAUtB,OAEtDoN,KACKvG,EAAI,EAAGA,EAAI7G,KAAKoN,OAAOrG,OAAQF,IACtCuG,EAAOvG,GAAK7G,KAAK4oC,QAAQl8B,EAAS1M,KAAKoN,OAAOvG,GAAI,UAAYA,EAAI,IAAK7G,MAGzE,OAAO,IAAI6iB,GAAUvhB,EAAQ8L,IAO/ByV,EAAUzX,UAAU0+B,WAAa,WAC/B,MAAO9pC,MAAKsB,OAAOqO,MAOrBkT,EAAUzX,UAAUxJ,MAAQ,WAC1B,MAAO,IAAIihB,GAAU7iB,KAAKsB,OAAQtB,KAAKoN,OAAOsiB,MAAM,KAOtD7M,EAAUzX,UAAUO,SAAW,WAE7B,MAAO3L,MAAKsB,OAAOqK,WAAa,IAAM3L,KAAKoN,OAAOO,KAAK,MAAQ,KAOjEkV,EAAUzX,UAAUy9B,MAAQ,WAC1B,MAAO7oC,MAAKsB,OAAOunC,QAAU,IAAM7oC,KAAKoN,OAAOO,KAAK,MAAQ,KAG9D9N,EAAOD,QAAUijB,GAIZ,SAAShjB,EAAQD,EAASM,GAE/B,YAiBA,SAAS4iB,GAAuBnT,EAAMuW,EAAQjG,GAC5C,KAAMjgB,eAAgB8iB,IACpB,KAAM,IAAIzZ,aAAY,mDAIxB,KAAKmB,EAASmF,GAAO,KAAM,IAAI5M,WAAU,uCACzC,KAAK+C,EAAQogB,KAAYA,EAAOsiB,MAAMh+B,GAAY,KAAM,IAAIzH,WAAU,2DACtE,MAAMkd,YAAgB+C,IAAO,KAAM,IAAIjgB,WAAU,qCACjD,IAAI4M,IAAQo5B,GAAU,KAAM,IAAIjoC,OAAM,2BAA8B6O,EAAQ,0BAE5E3P,MAAK2P,KAAOA,EACZ3P,KAAKkmB,OAASA,EACdlmB,KAAKigB,KAAOA,EA5Bd,GAAI+C,GAAO9iB,EAAoB,KAC3B6oC,EAAW7oC,EAAoB,KAC/B8oC,EAAQ9oC,EAAoB,KAC5BsK,EAAWtK,EAAoB,KAAKsK,SACpC1E,EAAUD,MAAMC,OA2BpBgd,GAAuB1X,UAAY,GAAI4X,GAEvCF,EAAuB1X,UAAU5J,KAAO,yBAUxCshB,EAAuB1X,UAAUs9B,SAAW,SAAUC,GACpD,MAAO,UAAY3oC,KAAK2P,KAAO,qFAGA3P,KAAK2P,KAAO,IAAM3P,KAAKkmB,OAAOvY,KAAK,KAAO,oCAClC3N,KAAKkmB,OAAOnf,OAAS,2EAGkB/G,KAAK2P,KAAO,wCAA0C3P,KAAKkmB,OAAOnf,OAAS,uBAErJ/G,KAAKkmB,OAAOhhB,IAAI,SAAU6kC,EAAU9kC,GAClC,MAAO,UAAY8kC,EAAW,kBAAoB9kC,EAAQ,OACzD0I,KAAK,IACR,gBAAkB3N,KAAKigB,KAAKyoB,SAASC,GACrC,0BACsB3oC,KAAK2P,KAAO,IAAM3P,KAAKkmB,OAAOvY,KAAK,MAAQ,iCASvEmV,EAAuB1X,UAAUpG,QAAU,SAAU0H,GACnDA,EAAS1M,KAAKigB,KAAM,OAAQjgB,OAS9B8iB,EAAuB1X,UAAUlG,IAAM,SAAUwH,GAC/C,GAAIuT,GAAOjgB,KAAK4oC,QAAQl8B,EAAS1M,KAAKigB,KAAM,OAAQjgB,MAEpD,OAAO,IAAI8iB,GAAuB9iB,KAAK2P,KAAM3P,KAAKkmB,OAAOwJ,MAAM,GAAIzP,IAOrE6C,EAAuB1X,UAAUxJ,MAAQ,WACvC,MAAO,IAAIkhB,GAAuB9iB,KAAK2P,KAAM3P,KAAKkmB,OAAOwJ,MAAM,GAAI1vB,KAAKigB,OAO1E6C,EAAuB1X,UAAUO,SAAW,WAC1C,MAAO,YAAc3L,KAAK2P,KACtB,IAAM3P,KAAKkmB,OAAOvY,KAAK,MAAQ,OAC/B3N,KAAKigB,KAAKtU,YAOhBmX,EAAuB1X,UAAUy9B,MAAQ,WACvC,MAAO7oC,MAAK2P,KACRq5B,EAAME,UAAUlpC,KAAKkmB,OAAOhhB,IAAI8jC,EAAMG,UAAUx7B,KAAK,OAAO,GAAQ,IACpEq7B,EAAME,UAAUlpC,KAAKigB,KAAK4oB,UAGhChpC,EAAOD,QAAUkjB,GAKZ,SAASjjB,EAAQD,EAASM,GAE/B,YAgBA,SAAS6iB,GAAcpT,EAAM1D,GAC3B,KAAMjM,eAAgB+iB,IACpB,KAAM,IAAI1Z,aAAY,mDAIxB,IAAoB,gBAATsG,GAAmB,KAAM,IAAI5M,WAAU,uCAClD,KAAK+C,EAAQmG,KAAUA,EAAKu8B,MAAMC,GAChC,KAAM,IAAI1lC,WAAU,uDAGtB/C,MAAK2P,KAAOA,EACZ3P,KAAKiM,KAAOA,MA1Bd,GAAI+W,GAAO9iB,EAAoB,KAC3BijB,EAAajjB,EAAoB,KAEjC8oC,EAAQ9oC,EAAoB,KAC5BuoC,EAASzlB,EAAKylB,OACd3iC,EAAUD,MAAMC,OAwBpBid,GAAa3X,UAAY,GAAI4X,GAE7BD,EAAa3X,UAAU5J,KAAO,eAU9BuhB,EAAa3X,UAAUs9B,SAAW,SAAUC,GAC1C,GAAIvhC,GAAKuhC,EAAK5nC,KAAKf,KAAK2P,MACpBq6B,EAAuB,kBAAP5iC,IAAqC,GAAdA,EAAGgoB,QAG1CnjB,EAAOjM,KAAKiM,KAAK/G,IAAI,SAAUoE,GACjC,MAAOA,GAAIo/B,SAASC,IAGtB,IAAIqB,EAAO,CAET,GAAIC,EACJ,GACEA,GAAa,IAAMtiC,KAAKC,MAAsB,IAAhBD,KAAKglB,gBAE9Bsd,IAActB,GAGrB,OAFAA,GAAKsB,GAAcjqC,KAAKiM,KAEjB,KAAOjM,KAAK2P,KAAO,uBACV3P,KAAK2P,KAAO,MAAQ1D,EAAK0B,KAAK,MAAQ,aACvC3N,KAAK2P,KAAO,MAAas6B,EAAa,kBAIrD,GAAIhb,GAAS,GAAI9L,GAAWnjB,KAAK2P,KACjC,OAAOsf,GAAOyZ,SAASC,GAAQ,IAAM18B,EAAK0B,KAAK,MAAQ,KAQ3DoV,EAAa3X,UAAUpG,QAAU,SAAU0H,GACzC,IAAK,GAAI7F,GAAI,EAAGA,EAAI7G,KAAKiM,KAAKlF,OAAQF,IACpC6F,EAAS1M,KAAKiM,KAAKpF,GAAI,QAAUA,EAAI,IAAK7G,OAU9C+iB,EAAa3X,UAAUlG,IAAM,SAAUwH,GAErC,IAAK,GADDT,MACKpF,EAAI,EAAGA,EAAI7G,KAAKiM,KAAKlF,OAAQF,IACpCoF,EAAKpF,GAAK7G,KAAK4oC,QAAQl8B,EAAS1M,KAAKiM,KAAKpF,GAAI,QAAUA,EAAI,IAAK7G,MAEnE,OAAO,IAAI+iB,GAAa/iB,KAAK2P,KAAM1D,IAOrC8W,EAAa3X,UAAUxJ,MAAQ,WAC7B,MAAO,IAAImhB,GAAa/iB,KAAK2P,KAAM3P,KAAKiM,KAAKyjB,MAAM,KAOrD3M,EAAa3X,UAAUO,SAAW,WAEhC,MAAO3L,MAAK2P,KAAO,IAAM3P,KAAKiM,KAAK0B,KAAK,MAAQ,KAOlDoV,EAAa3X,UAAUy9B,MAAQ,WAC7B,MAAOG,GAAMkB,OAAOlqC,OAGtBH,EAAOD,QAAUmjB,GAKZ,SAASljB,EAAQD,EAASM,GAE/B,YAOA,SAAS8iB,KACP,KAAMhjB,eAAgBgjB,IACpB,KAAM,IAAI3Z,aAAY,oDA2O1B,QAAS8gC,GAAgBlgB,GACvB,IAAK,GAAIgF,KAAUhF,GACjB,GAAIA,EAAM1jB,eAAe0oB,IACnBA,IAAU8Z,GACZ,KAAM,IAAIjoC,OAAM,sCAAwCmuB,EAAS,2BAazE,QAASmb,GAAWrpC,GAClB,GAAIspC,GAAcxpC,OAAOF,OAAOI,EAEhC,IAAIA,EAAKmC,YAAcnC,EAAKmC,WAAW2B,UACrC,IAAK,GAAI8K,KAAQ5O,GAAKmC,WAAW2B,UAC3B9D,EAAKmC,WAAW2B,UAAU0B,eAAeoJ,KAC3C06B,EAAY16B,GAAQ5O,EAAKmC,WAAW2B,UAAU8K,GAKpD,OAAO06B,GA9QT,GAAItB,GAAW7oC,EAAoB,IAgBnC8iB,GAAK5X,UAAU8U,KAAO,WACpB,KAAM,IAAIpf,OAAM,2EAIlBkiB,EAAK5X,UAAU5J,KAAO,OAUtBwhB,EAAK5X,UAAU+e,QAAU,SAAUppB,GACjC,KAAMA,YAAgBF,SACpB,KAAM,IAAIkC,WAAU,qCAItB,IAAI4lC,IACF5nC,KAAMqpC,EAAWrpC,GACjBopC,eAAgBA,GAGdjJ,EAAOlhC,KAAK0oC,SAASC,GAErB2B,EAAWzpC,OAAOy9B,KAAKqK,GAAMzjC,IAAI,SAAUyK,GAC7C,MAAO,WAAaA,EAAO,YAAcA,EAAO,QAG9C46B,EACAD,EAAS38B,KAAK,KACV,+GAIgBuzB,EAAO,SAI3BvhC,EAAU,GAAI6qC,UAAU,OAAQD,EACpC,OAAO5qC,GAAQgpC,IAWjB3lB,EAAK5X,UAAUs9B,SAAW,WAExB,KAAM,IAAI5nC,OAAM,oCAOlBkiB,EAAK5X,UAAUpG,QAAU,WAEvB,KAAM,IAAIlE,OAAM,2CASlBkiB,EAAK5X,UAAUlG,IAAM,WAEnB,KAAM,IAAIpE,OAAM,uCASlBkiB,EAAK5X,UAAUw9B,QAAU,SAAUzlC,GACjC,KAAMA,YAAgB6f,IACpB,KAAM,IAAIjgB,WAAU,uCAGtB,OAAOI,IAST6f,EAAK5X,UAAUq/B,SAAW,SAAU/9B,GAKlC,QAASg+B,GAAWvnC,EAAMuJ,GACxBvJ,EAAK6B,QAAQ,SAASsJ,EAAOwxB,EAAM6K,GACjCj+B,EAAS4B,EAAOwxB,EAAM6K,GACtBD,EAAUp8B,EAAO5B,KANrBA,EAAS1M,KAAM,KAAM,MASrB0qC,EAAU1qC,KAAM0M,IAwBlBsW,EAAK5X,UAAUvG,UAAY,SAAU6H,GAQnC,QAAS09B,GAAYjnC,EAAMuJ,GACzB,MAAOvJ,GAAK+B,IAAI,SAASoJ,EAAOwxB,EAAM6K,GACpC,GAAIp7B,GAAc7C,EAAS4B,EAAOwxB,EAAM6K,EACxC,OAAQp7B,KAAgBjB,EAASiB,EAAc66B,EAAW97B,EAAO5B,KATrE,GAAI6C,GAAc7C,EAAS1M,KAAM,KAAM,KACvC,OAAIuP,KAAgBvP,KACXuP,EAUF66B,EAAWpqC,KAAM0M,IAiB1BsW,EAAK5X,UAAUrG,OAAS,SAAU2H,GAChC,GAAI4W,KAQJ,OANAtjB,MAAKyqC,SAAS,SAAUtnC,EAAM28B,EAAM6K,GAC9Bj+B,EAASvJ,EAAM28B,EAAM6K,IACvBrnB,EAAMtW,KAAK7J,KAIRmgB,GAITN,EAAK5X,UAAUw/B,KAAO,WACpB,KAAM,IAAI9pC,OAAM,+DAIlBkiB,EAAK5X,UAAUq+B,MAAQ,WACrB,KAAM,IAAI3oC,OAAM,iGAOlBkiB,EAAK5X,UAAUxJ,MAAQ,WAErB,KAAM,IAAId,OAAM,kCAOlBkiB,EAAK5X,UAAUO,SAAW,WACxB,MAAO,IAOTqX,EAAK5X,UAAUy9B,MAAQ,WACrB,MAAO,IAQT7lB,EAAKylB,OAAS,SAASnnC,GACrB,MAAOA,aAAkB0hB,IAuC3BnjB,EAAOD,QAAUojB,GAKZ,SAASnjB,EAAQD,EAASM,GAE/B,YAiBA,SAAS+iB,GAAc4nB,EAAIzjC,EAAI6E,GAC7B,KAAMjM,eAAgBijB,IACpB,KAAM,IAAI5Z,aAAY,mDAIxBrJ,MAAK6qC,GAAKA,EACV7qC,KAAKoH,GAAKA,EACVpH,KAAKiM,KAAOA,MAvBd,GAAI+W,GAAO9iB,EAAoB,KAC3B0iB,EAAe1iB,EAAoB,KACnCijB,EAAajjB,EAAoB,KACjC6iB,EAAe7iB,EAAoB,KACnC8oC,EAAQ9oC,EAAoB,IAsBhC+iB,GAAa7X,UAAY,GAAI4X,GAE7BC,EAAa7X,UAAU5J,KAAO,eAU9ByhB,EAAa7X,UAAUs9B,SAAW,SAAUC,GAC1C,KAAM3oC,KAAKoH,KAAMuhC,GAAK5nC,MACpB,KAAM,IAAID,OAAM,YAAcd,KAAKoH,GAAK,wCAG1C,IAAI6E,GAAOjM,KAAKiM,KAAK/G,IAAI,SAAUoE,GACjC,MAAOA,GAAIo/B,SAASC,IAEtB,OAAO,QAAU3oC,KAAKoH,GAAK,IAAM6E,EAAK0B,KAAK,MAAQ,KAOrDsV,EAAa7X,UAAUpG,QAAU,SAAU0H,GACzC,IAAK,GAAI7F,GAAI,EAAGA,EAAI7G,KAAKiM,KAAKlF,OAAQF,IACpC6F,EAAS1M,KAAKiM,KAAKpF,GAAI,QAAUA,EAAI,IAAK7G,OAU9CijB,EAAa7X,UAAUlG,IAAM,SAAUwH,GAErC,IAAK,GADDT,MACKpF,EAAI,EAAGA,EAAI7G,KAAKiM,KAAKlF,OAAQF,IACpCoF,EAAKpF,GAAK7G,KAAK4oC,QAAQl8B,EAAS1M,KAAKiM,KAAKpF,GAAI,QAAUA,EAAI,IAAK7G,MAEnE,OAAO,IAAIijB,GAAajjB,KAAK6qC,GAAI7qC,KAAKoH,GAAI6E,IAO5CgX,EAAa7X,UAAUxJ,MAAQ,WAC7B,MAAO,IAAIqhB,GAAajjB,KAAK6qC,GAAI7qC,KAAKoH,GAAIpH,KAAKiM,KAAKyjB,MAAM,KAO5DzM,EAAa7X,UAAUO,SAAW,WAChC,GAAIM,GAAOjM,KAAKiM,IAEhB,QAAQA,EAAKlF,QACX,IAAK,GACH,MAAe,KAAX/G,KAAK6qC,GAEA,IAAM5+B,EAAK,GAAGN,WAIdM,EAAK,GAAGN,WAAa3L,KAAK6qC,EAGrC,KAAK,GACH,GAAIC,GAAM7+B,EAAK,GAAGN,UACdM,GAAK,YAAcgX,KACrB6nB,EAAM,IAAMA,EAAM,IAEpB,IAAIC,GAAM9+B,EAAK,GAAGN,UAIlB,OAHIM,GAAK,YAAcgX,KACrB8nB,EAAM,IAAMA,EAAM,KAEbD,EAAM,IAAM9qC,KAAK6qC,GAAK,IAAME,CAErC;QACE,MAAO/qC,MAAK6qC,GAAK,IAAM7qC,KAAKiM,KAAK0B,KAAK,MAAQ,MAQpDsV,EAAa7X,UAAUy9B,MAAQ,WAC7B,GAAI58B,GAAOjM,KAAKiM,KACZ++B,EAAMhC,EAAMiC,WAAWjrC,KAAK6qC,IAC5BK,EAAKj/B,EAAK,GACVk/B,EAAKl/B,EAAK,EAEd,QAAQA,EAAKlF,QACX,IAAK,GACH,GAAIqkC,GAAUF,EAAGrC,OACjB,QAAQ7oC,KAAK6qC,IACX,IAAK,IACH,GAAIK,YAAcjoB,KAA2B,MAAVioB,EAAGL,IAAwB,MAAVK,EAAGL,IACrD,MAAO7qC,MAAK6qC,GAAK7B,EAAME,UAAUkC,GAAS,EAE9C,KAAK,IACH,MAAOprC,MAAK6qC,GAAKO,CAEnB,SACE,MAAIF,aAAcjoB,GACT+lB,EAAME,UAAUkC,GAAS,GAAQprC,KAAK6qC,GAExCO,EAAUprC,KAAK6qC,GAG5B,IAAK,GACH,GAAIC,GAAMI,EAAGrC,QACTwC,GAAM,EACNN,EAAMI,EAAGtC,QACTyC,GAAM,EACNC,EAAM,GACNC,EAAM,EAEV,QAAQxrC,KAAK6qC,IACX,IAAK,IACHU,EAAMP,EACNA,EAAM,EAEN,MAEF,KAAK,IACCE,YAAcjoB,KACF,MAAVioB,EAAGL,IAAwB,MAAVK,EAAGL,MACtBQ,GAAM,GAINF,YAAcloB,KACF,MAAVkoB,EAAGN,IAAwB,MAAVM,EAAGN,IAAwB,MAAVM,EAAGN,MACvCS,GAAM,GAMRN,GAFGE,YAActoB,IAAgBsoB,YAAcjoB,MAC5CkoB,YAAcvoB,IAAgBuoB,YAAcloB,IACzC,WAGA,OAGR,MAEF,KAAK,IACCkoB,YAAcloB,IACF,MAAVkoB,EAAGN,GAAuB,MAAVM,EAAGN,KACrBS,GAAM,EAGV,MAEF,KAAK,IACCJ,YAAcjoB,IAAgBioB,YAAcnoB,GAC9CsoB,GAAM,EAECH,YAAc/nB,KACrBkoB,EAAM,KAGR,MAEF,KAAK,KACHN,EAAM/B,EAAMyC,OAAOV,GAAK,GAO5B,MAHAD,GAAM9B,EAAME,UAAU4B,EAAKO,GAC3BN,EAAM/B,EAAME,UAAU6B,EAAKO,GAEpBC,EAAMT,EAAME,EAAMD,EAAMS,CAEjC,SACE,MAAOR,GAAM,IAAMhrC,KAAKiM,KAAK/G,IAAI8jC,EAAMG,UAAUx7B,KAAK,MAAQ,MAIpE9N,EAAOD,QAAUqjB,GAKZ,SAASpjB,EAAQD,EAASM,GAE/B,YAcA,SAASgjB,GAAWpX,EAAOC,EAAKC,GAC9B,KAAMhM,eAAgBkjB,IACpB,KAAM,IAAI7Z,aAAY,mDAIxB,KAAKo/B,EAAO38B,GAAQ,KAAM,IAAI/I,WAAU,gBACxC,KAAK0lC,EAAO18B,GAAM,KAAM,IAAIhJ,WAAU,gBACtC,IAAIiJ,IAASy8B,EAAOz8B,GAAO,KAAM,IAAIjJ,WAAU,gBAC/C,IAAI6F,UAAU7B,OAAS,EAAG,KAAM,IAAIjG,OAAM,qBAE1Cd,MAAK8L,MAAQA,EACb9L,KAAK+L,IAAQA,EACb/L,KAAKgM,KAAQA,GAAQ,KAzBvB,GAAIgX,GAAO9iB,EAAoB,KAE3BuoC,EAASzlB,EAAKylB,MA0BlBvlB,GAAU9X,UAAY,GAAI4X,GAE1BE,EAAU9X,UAAU5J,KAAO,YAU3B0hB,EAAU9X,UAAUs9B,SAAW,SAAUC,GACvC,MAAO,cACH3oC,KAAK8L,MAAM48B,SAASC,GAAQ,KAC5B3oC,KAAK+L,IAAI28B,SAASC,IACjB3oC,KAAKgM,KAAQ,KAAOhM,KAAKgM,KAAK08B,SAASC,GAAS,IACjD,KAONzlB,EAAU9X,UAAUpG,QAAU,SAAU0H,GACtCA,EAAS1M,KAAK8L,MAAO,QAAS9L,MAC9B0M,EAAS1M,KAAK+L,IAAK,MAAO/L,MACtBA,KAAKgM,MACPU,EAAS1M,KAAKgM,KAAM,OAAQhM,OAUhCkjB,EAAU9X,UAAUlG,IAAM,SAAUwH,GAClC,MAAO,IAAIwW,GACPljB,KAAK4oC,QAAQl8B,EAAS1M,KAAK8L,MAAO,QAAS9L,OAC3CA,KAAK4oC,QAAQl8B,EAAS1M,KAAK+L,IAAK,MAAO/L,OACvCA,KAAKgM,MAAQhM,KAAK4oC,QAAQl8B,EAAS1M,KAAKgM,KAAM,OAAQhM,SAQ5DkjB,EAAU9X,UAAUxJ,MAAQ,WAC1B,MAAO,IAAIshB,GAAUljB,KAAK8L,MAAO9L,KAAK+L,IAAK/L,KAAKgM,MAAQhM,KAAKgM,OAO/DkX,EAAU9X,UAAUO,SAAW,WAE7B,GAAIpD,GAAMvI,KAAK8L,MAAMH,UAMrB,OALI3L,MAAKgM,OACPzD,GAAO,IAAMvI,KAAKgM,KAAKL,YAEzBpD,GAAO,IAAMvI,KAAK+L,IAAIJ,YASxBuX,EAAU9X,UAAUy9B,MAAQ,WAC1B,GAAItgC,GAAMvI,KAAK8L,MAAM+8B,OAMrB,OALI7oC,MAAKgM,OACPzD,GAAO,IAAMvI,KAAKgM,KAAK68B,SAEzBtgC,GAAO,IAAMvI,KAAK+L,IAAI88B,SAKxBhpC,EAAOD,QAAUsjB,GAKZ,SAASrjB,EAAQD,EAASM,GAE/B,YAeA,SAASijB,GAAWxT,GAClB,KAAM3P,eAAgBmjB,IACpB,KAAM,IAAI9Z,aAAY,mDAIxB,KAAKmB,EAASmF,GAAQ,KAAM,IAAI5M,WAAU,uCAE1C/C,MAAK2P,KAAOA,EAuDd,QAAS+7B,GAAO/7B,GACd,KAAM,IAAI7O,OAAM,oBAAsB6O,GA7ExC,GAAIqT,GAAO9iB,EAAoB,KAC3BmC,EAAOnC,EAAoB,GAE3B8oC,EAAQ9oC,EAAoB,KAC5BsK,EAAWtK,EAAoB,KAAKsK,QAoBxC2Y,GAAW/X,UAAY,GAAI4X,GAE3BG,EAAW/X,UAAU5J,KAAO,aAU5B2hB,EAAW/X,UAAUs9B,SAAW,SAAUC,GAKxC,MAHAA,GAAY,MAAI+C,EAChB/C,EAAW,KAAItmC,EAEXrC,KAAK2P,OAAQg5B,GAAK5nC,KACb,KAAOf,KAAK2P,KAAO,uBAAyB3P,KAAK2P,KAAO,cAAgB3P,KAAK2P,KAAO,MAGpF,KACG3P,KAAK2P,KAAO,uBAAyB3P,KAAK2P,KAAO,SACtDtN,EAAK0O,gBAAgB/Q,KAAK2P,MACvB,mBAAqB3P,KAAK2P,KAAO,KACjC,UAAY3P,KAAK2P,KAAO,MAC5B,KAQRwT,EAAW/X,UAAUpG,QAAU,aAU/Bme,EAAW/X,UAAUlG,IAAM,WACzB,MAAOlF,MAAK4B,SAeduhB,EAAW/X,UAAUxJ,MAAQ,WAC3B,MAAO,IAAIuhB,GAAWnjB,KAAK2P,OAQ7BwT,EAAW/X,UAAUO,SAAW,WAC9B,MAAO3L,MAAK2P,MAQdwT,EAAW/X,UAAUy9B,MAAQ,WAC3B,MAAOG,GAAMG,SAASnpC,KAAK2P,OAG7B9P,EAAOD,QAAUujB,GAKZ,SAAStjB,EAAQD,EAASM,GAE/B,YAaA,SAASkjB,GAAWne,EAAOgb,GACzB,KAAMjgB,eAAgBojB,IACpB,KAAM,IAAI/Z,aAAY,mDAGxB,MAAMpE,YAAiB4d,IACrB,KAAM,IAAI9f,WAAU,2CAEtB,MAAMkd,YAAgB+C,IACpB,KAAM,IAAIjgB,WAAU,qCAGtB/C,MAAKiF,MAAQA,EACbjF,KAAKigB,KAAOA,EAxBd,GAAI+C,GAAO9iB,EAAoB,KAC3B2iB,EAAY3iB,EAAoB,IA0BpCkjB,GAAWhY,UAAY,GAAI4X,GAE3BI,EAAWhY,UAAU5J,KAAO,aAU5B4hB,EAAWhY,UAAUs9B,SAAW,SAAUC,GACxC,MAAO,UAAY3oC,KAAKiF,MAAM6kC,aAAe,QACzC9pC,KAAKiF,MAAMykC,cAAcf,EAAO3oC,KAAKigB,KAAKyoB,SAASC,KAOzDvlB,EAAWhY,UAAUpG,QAAU,SAAU0H,GACvCA,EAAS1M,KAAKiF,MAAO,QAASjF,MAC9B0M,EAAS1M,KAAKigB,KAAM,OAAQjgB,OAS9BojB,EAAWhY,UAAUlG,IAAM,SAAUwH,GACnC,MAAO,IAAI0W,GACPpjB,KAAK4oC,QAAQl8B,EAAS1M,KAAKiF,MAAO,QAASjF,OAC3CA,KAAK4oC,QAAQl8B,EAAS1M,KAAKigB,KAAM,OAAQjgB,SAQ/CojB,EAAWhY,UAAUxJ,MAAQ,WAC3B,MAAO,IAAIwhB,GAAWpjB,KAAKiF,MAAOjF,KAAKigB,OAOzCmD,EAAWhY,UAAUO,SAAW,WAC9B,MAAO3L,MAAKiF,MAAM0G,WAAa,MAAQ3L,KAAKigB,KAAKtU,YAOnDyX,EAAWhY,UAAUy9B,MAAQ,WAC3B,MAAO7oC,MAAKiF,MAAM4jC,QAAU,MAAQ7oC,KAAKigB,KAAK4oB,SAGhDhpC,EAAOD,QAAUwjB,GAKZ,SAASvjB,GAEdA,EAAOD,SACL+P,KAAQ,IACRiQ,SAAY,YACZE,QACE,KAEFD,YAAe,oFACfE,UACE,IACA,QACA,SACA,UAEFI,SAAY,SAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,YACZE,QACE,SAEFD,YAAe,sBACfE,UACE,SAEFI,SAAY,UAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,IACRiQ,SAAY,YACZE,QACE,KAEFD,YAAe,sIACfE,UACE,IACA,QACA,YAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,WACRiQ,SAAY,YACZE,QACE,YAEFD,YAAe,6GACfE,UACE,WACA,SAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,OAEFD,YAAe,mEACfE,UACE,MACA,UAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,YACZE,QACE,QAEFD,YAAe,oEACfE,UACE,OACA,WAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,YACZE,QACE,SAEFD,YAAe,kEACfE,UACE,QACA,aAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,YACZE,QACE,UAEFD,YAAe,mEACfE,UACE,SACA,cAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,OAEFD,YAAe,eACfE,UACE,MACA,SAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,YACZE,QACE,QAEFD,YAAe,aACfE,UACE,QAEFI,SAAY,OAAQ,WAMjB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,KACRiQ,SAAY,YACZE,QACE,MAEFD,YAAe,gJACfE,UACE,KACA,aAEFI,SAAY,SAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,OAEFD,YAAe,mOACfE,UACE,OAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,YACZE,QACE,WAEFD,YAAe,+DACfE,UACE,UACA,aAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,YACZE,QACE,SAEFD,YAAe,6DACfE,UACE,QACA,WAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,OAEFD,YAAe,0GACfE,UACE,MACA,UAEFI,SAAY,QAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,YACZE,QACE,QAEFD,YAAe,qBACfE,UACE,QAEFI,SAAY,WAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,YACZE,QACE,WAEFD,YAAe,8CACfE,UACE,WAEFI,aAMG,SAAStgB,EAAQD,EAASM,GAsB/B,QAASyrC,GAAeC,GACvB,MAAO1rC,GAAoB2rC,EAAsBD,IAElD,QAASC,GAAsBD,GAC9B,MAAO1mC,GAAI0mC,IAAS,WAAa,KAAM,IAAI9qC,OAAM,uBAAyB8qC,EAAM,SAxBjF,GAAI1mC,IACH4mC,UAAW,IACXC,aAAc,IACdC,WAAY,IACZC,cAAe,IACfC,YAAa,IACbC,eAAgB,IAChBC,WAAY,IACZC,cAAe,IACfC,WAAY,IACZC,cAAe,IACfC,QAAS,IACTC,WAAY,IACZC,UAAW,IACXC,aAAc,IACdC,SAAU,IACVC,YAAa,IACbC,WAAY,IACZC,cAAe,IAQhBpB,GAAerN,KAAO,WACrB,MAAOz9B,QAAOy9B,KAAKp5B,IAEpBymC,EAAeqB,QAAUnB,EACzBhsC,EAAOD,QAAU+rC,EACjBA,EAAetrC,GAAK,KAKf,SAASR,EAAQD,EAASM,GAE/B,GACIkhB,IADiBlhB,EAAoB,KACxBA,EAAoB,KAOrCN,GAAQiF,UAAY,SAAU8L,GAC5B,MAAIA,aAAeyQ,GACV,GAAIA,GAAWzQ,EAAI1L,MAAQ,EAAG0L,EAAIjM,IAAM,EAAGiM,EAAIxL,IAAM,GAGvDwL,IAMJ,SAAS9Q,EAAQD,GAEtB,YAOAA,GAAQivB,UAAY,SAAS9oB,GAC3B,MAAQA,aAAiBI,UAA6B,iBAATJ,KAM1C,SAASlG,EAAQD,EAASM,GAE/B,YA4FA,SAAS+sC,GAAajqC,EAAO3B,GAC3B,GAAIwE,MAAMC,QAAQ9C,GAAQ,CAGxB,IAAK,GAFDuF,GAAM,IACNzB,EAAM9D,EAAM+D,OACPF,EAAI,EAAOC,EAAJD,EAASA,IACd,GAALA,IACF0B,GAAO,MAETA,GAAO0kC,EAAYjqC,EAAM6D,GAAIxF,EAG/B,OADAkH,IAAO,IAIP,MAAO3I,GAAQkI,OAAO9E,EAAO3B,GAxGjC,GAAIH,GAAShB,EAAoB,GAC7BmgB,EAAYngB,EAAoB,KAChCuB,EAAYvB,EAAoB,GAOpCN,GAAQ4K,SAAW,SAASzE,GAC1B,MAAQA,aAAiBG,SAA4B,gBAATH,IAQ9CnG,EAAQ2Q,SAAW,SAASxG,EAAM6lB,GAChC,GAAI9jB,GAAQ/B,EAAKhD,OAAS6oB,EAAO7oB,OAC7BgF,EAAMhC,EAAKhD,MACf,OAAQgD,GAAKe,UAAUgB,EAAOC,KAAS6jB,GA0BzChwB,EAAQkI,OAAS,SAAS/B,EAAO1E,GAC/B,MAAIH,GAAOuG,SAAS1B,GACX7E,EAAO4G,OAAO/B,EAAO1E,GAG1B0E,YAAiBtE,GACZ4e,EAAUvY,OAAO/B,EAAO1E,GAG7BwE,MAAMC,QAAQC,GACTknC,EAAYlnC,EAAO1E,GAGxBzB,EAAQ4K,SAASzE,GACZ,IAAMA,EAAQ,IAGF,kBAAVA,GACFA,EAAM+Z,OAAS/Z,EAAM+Z,OAAS,GAAK,WAGxC/Z,YAAiBlF,QACS,kBAAjBkF,GAAM+B,OACR/B,EAAM+B,OAAOzG,GAGb0E,EAAM4F,WAIVzF,OAAOH,KAkCX,SAASlG,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,UAEFD,YAAe,8BACfE,UACE,WACA,aAEFI,SAAY,UAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,QACA,aAEFD,YAAe,kBACfE,UACE,gBACA,UACA,SACA,qBACA,iBAEFI,SACE,cAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,WAEFD,YACI,wHACJE,UACE,YACA,YACA,cAEFI,SAAY,QAAS,MAAO,WAMzB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,WAEFD,YAAe,2DACfE,UACE,UACA,MACA,aAEFI,SACE,WACA,SACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,YACZE,QACE,QACA,gBAEFD,YAAe,qBACfE,UACE,YACA,QACA,UACA,YACA,cACA,eAEFI,SACE,cAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,YACZE,QACE,SACA,mBAEFD,YAAe,kCACfE,UACE,yBACA,yBACA,UAEFI,SACE,WACA,cACA,YAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,cACRiQ,SAAY,YACZE,QACE,SACA,qBAEFD,YAAe,oCACfE,UACE,yBACA,yBACA,UAEFI,SACE,WACA,SACA,eAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,YACZE,QACE,SACA,gBAEFD,YACI,+CACJE,UACE,yBACA,UAEFI,SACE,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,UAEFD,YAAe,qCACfE,UACE,WACA,UACA,gBACA,UACA,uDAEFI,SACE,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,UAEFD,YACI,sGACJE,UACE,WACA,WACA,YACA,aAEFI,SAAY,OAAQ,QAAS,WAM1B,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,aACZE,QACE,YAEFD,YACI,yHACJE,UACE,aACA,aACA,eAEFI,SAAY,OAAQ,MAAO,WAMxB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,YACA,qBAEFD,YAAe,uCACfE,UACE,aACA,aACA,oBAEFI,SAAa,MAAO,UAMjB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,aAEFD,YAAe,qCACfE,UACE,YACA,aACA,iBAEFI,SAAa,SAMV,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,SACA,gBAEFD,YAAe,8NACfE,UACE,WACA,eACA,SACA,SACA,iBACA,uBACA,mBACA,SAEFI,SACE,MACA,WAMC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,aACZE,QACE,YAEFD,YAAe,4CACfE,UACE,iBACA,eACA,SACA,uBACA,kBAEFI,SACE,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,QACA,UACA,aAEFD,YACI,gEACJE,UACE,QACA,SACA,WACA,4BACA,WACA,YAEFI,SAAY,YAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,WACRiQ,SAAY,YACZE,QACE,QACA,kBAEFD,YAAe,uBACfE,UACE,gBACA,UACA,YACA,cACA,cAEFI,SACE,YAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,UACA,cAEFD,YAAe,oDACfE,UACE,YACA,aACA,gBACA,6BACA,8BACA,kBACA,4BACA,gCACA,mCAOC,SAASlgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,aACZE,QACE,aACA,oBAEFD,YAAe,qJAGfE,UACE,QACA,iBACA,gBACA,WAEFI,SACE,OACA,SAMC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,YACZE,QACE,QACA,aAEFD,YACI,uCACJE,UACE,UACA,QACA,oBAEFI,SAAa,cAMV,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,aACZE,QACE,WACA,eAEFD,YACI,4LACJE,UACE,aACA,aACA,cACA,cACA,eACA,uBAEFI,SAAY,OAAQ,QAAS,SAM1B,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,WAEFD,YACI,iGACJE,UACE,YACA,aACA,WAEFI,SACE,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,WAEFD,YACI,+EACJE,UACE,WACA,QACA,YAEFI,SACE,SACA,cAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,aACZE,QACE,aAEFD,YACI,2DACJE,UACE,YACA,UACA,MACA,SAEFI,SACE,WACA,MACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,WACRiQ,SAAY,YACZE,QACE,QACA,kBAEFD,YAAe,uBACfE,UACE,cACA,QACA,YACA,YACA,iBAEFI,SACE,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,aACRiQ,SAAY,YACZE,QACE,KACA,iBAEFD,YACI,yEACJE,UACE,OACA,UACA,SAEFI,SACE,MAAO,WAAY,eAOlB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,YACZE,QACE,KACA,gBAEFD,YACI,4CACJE,UACE,QACA,QAEFI,SACE,MAAO,WAAY,gBAOlB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,cAEFD,YAAe,gEACfE,UACE,cACA,aACA,sBAEFI,SAAa,MAAO,SAMjB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,UACZE,QACE,QACA,gBAEFD,YAAe,6QACfE,UACE,QACA,kBACA,oBAEFI,SACE,SAAU,QAAS,SAAU,YAAa,kBAAmB,mBAO5D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,UACZE,QACE,KACA,aAEFD,YAAe,8IACfE,UACE,KACA,KACA,sBAEFI,SACE,SAAU,QAAS,SAAU,YAAa,kBAAmB,mBAO5D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,UACZE,QACE,QACA,eAEFD,YAAe,8PACfE,UACE,QACA,uBAEFI,SACE,SAAU,SAAU,SAAU,YAAa,kBAAmB,mBAO7D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,UACZE,QACE,gBAEFD,YAAe,mRACfE,UACE,cACA,wBAEFI,SACE,SAAU,SAAU,QAAS,YAAa,kBAAmB,mBAO5D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,+DACfE,UACE,SACA,UAEFI,SACE,SAAU,SAAU,QAAS,SAAU,kBAAmB,mBAOzD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,kBACRiQ,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,mEACfE,UACE,SACA,SACA,YAEFI,SACE,SAAU,SAAU,QAAS,SAAU,YAAa,mBAOnD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,gBACRiQ,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,gEACfE,UACE,UACA,SACA,aAEFI,SACE,SAAU,SAAU,QAAS,SAAU,YAAa,qBAOnD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,UACZE,QACE,UAEFD,YACI,iGACJE,UACE,cACA,cACA,eAEFI,SACE,KACA,KACA,OACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,UACZE,QACE,WAEFD,YACI,gGACJE,UACE,eACA,eACA,eAEFI,SACE,KACA,KACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,KACRiQ,SAAY,UACZE,QACE,SAEFD,YAAe,yCACfE,UACE,aACA,aACA,YACA,WAEFI,SACE,KACA,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,KACRiQ,SAAY,UACZE,QACE,SAEFD,YAAe,8CACfE,UACE,aACA,aACA,YACA,WAEFI,SACE,KACA,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,OACZE,QACE,gBAEFD,YACI,+CACJE,UACE,YACA,kCACA,mBACA,uBACA,8BAEFI,SACE,UAAW,UAAW,QAAS,SAAU,SAAU,UAOlD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,OACZE,QACE,IACA,cAEFD,YACI,6CACJE,UACE,aACA,aACA,aACA,kBACA,mBACA,yBAEFI,SACE,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,UAO9D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,OACZE,QACE,YACA,kBACA,mBAEFD,YACI,2BACJE,UACE,YACA,gBACA,qBAEFI,SACE,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,UAO9D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,OACZE,QACE,UACA,cACA,mBACA,yBACA,kCACA,+CAEFD,YACI,yDACJE,UACE,KACA,YACA,yBACA,UACA,eACA,4BAEFI,SACE,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,UAO1E,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,OACZE,QACE,KACA,6BACA,WACA,iBAEFD,YACI,mBACJE,UACE,KACA,YACA,qBACA,WACA,kBAEFI,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,OACZE,QACE,IACA,aAEFD,YACI,gEACJE,UACE,IACA,MACA,OACA,YACA,gBACA,eACA,oCACA,uBAEFI,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,OACZE,QACE,SACA,aAEFD,YACI,iDACJE,UACE,iBACA,cACA,kBAEFI,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,OACZE,QACE,aACA,oBACA,gBAEFD,YACI,iBACJE,UACE,SACA,SACA,wBACA,kBAEFI,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,YAO/D,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,mBACA,oCAEFD,YAAe,uDACfE,UACE,gBACA,2BAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,eACA,gBAEFD,YAAe,oDACfE,UACE,aACA,mBAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,UACZE,QACE,UACA,aAEFD,YAAe,uFACfE,UACE,iBACA,gBACA,WAEFI,SACE,MAAO,KAAM,SAOZ,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,UACZE,QACE,KACA,QACA,UAEFD,YAAe,0DACfE,UACE,QACA,YACA,KACA,MAEFI,SACE,MAAO,KAAM,SAOZ,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,KACRiQ,SAAY,UACZE,QACE,SACA,YAEFD,YAAe,mFACfE,UACE,gBACA,iBACA,UAEFI,SACE,MAAO,MAAO,SAOb,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,UACZE,QACE,SACA,YAEFD,YAAe,2GACfE,UACE,iBACA,kBACA,gBACA,UAEFI,SACE,MAAO,MAAO,QAOb,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,SACZE,QACE,uBACA,6BAEFD,YAAe,iKACfE,UACE,mBACA,mBACA,eACA,kBACA,mBAEFI,SACE,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOhG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,SACZE,QACE,eAEFD,YAAe,0EACfE,UACE,+BACA,+BACA,gCAEFI,SACE,WACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,SACZE,QACE,UAEFD,YAAe,wCACfE,UACE,oBACA,uCAEFI,SACE,SAAU,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,SACZE,QACE,UACA,cAEFD,YAAe,4aACfE,UACE,YACA,eACA,kCACA,WAEFI,SACE,SAAU,MAAO,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOlG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,SACZE,QACE,aAEFD,YAAe,6LAGfE,UACE,4BACA,yBAEFI,SACE,WACA,WAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,SACZE,QACE,SACA,YACA,cACA,OAEFD,YAAe,yGACfE,UACE,SACA,YACA,yBACA,gBAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,SACZE,QACE,cAEFD,YAAe,uEACfE,UACE,yBACA,UACA,iBACA,WAEFI,SACE,SAAU,SAAU,OAAQ,aAO3B,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,SACZE,QACE,UAEFD,YAAe,oCACfE,UACE,oBACA,SACA,SAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,SACZE,QACE,UACA,aACA,qBACA,YACA,eACA,uBACA,QAEFD,YAAe,mCACfE,UACE,UACA,aACA,oBACA,yBACA,iBAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOlG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,OACZE,QACE,YACA,iBACA,oBACA,0BACA,iBAEFD,YACI,iFACJE,UACE,MACA,UACA,cACA,kBACA,gBACA,+BACA,eAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOjG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,SACZE,QACE,kBACA,iCAEFD,YAAe,mBACfE,UACE,2BACA,uBACA,2BACA,oBACA,6BAEFI,SACE,OAAQ,SAAU,aAOjB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,SACZE,QACE,WAEFD,YAAe,kCACfE,UACE,YACA,sBACA,yBACA,UACA,aAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,WAOlG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,SACZE,QACE,cAEFD,YAAe,6DACfE,UACE,mBACA,mBACA,mBACA,oBAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,WAO/F,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,SACZE,QACE,eACA,6BACA,yBACA,uCAEFD,YAAe,8HAGfE,UACE,mBACA,SACA,qBACA,mBACA,YACA,UACA,WAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,WAOhG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,SACZE,QACE,YAEFD,YAAe,oGACfE,UACE,mCACA,YAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,WAOjG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,SACZE,QACE,KACA,gBAEFD,YAAe,qBACfE,UACE,yBACA,KACA,gBAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,WAO7F,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,SACZE,QACE,WACA,cACA,sBACA,aACA,gBACA,wBACA,SAEFD,YAAe,oCACfE,UACE,WACA,cACA,yBACA,kBAEFI,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,eAO7F,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,eACRiQ,SAAY,cACZE,QACE,sBAEFD,YAAe,kEACfE,UACE,sBAEFI,SAAY,eAAgB,eAMzB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,cACZE,QACE,KACA,gBAEFD,YAAe,mCACfE,UACE,KACA,oBACA,MAEFI,SAAY,eAAgB,eAAgB,WAMzC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,cACZE,QACE,YAEFD,YAAe,6IACfE,UACE,WACA,KACA,aACA,YAEFI,SAAY,eAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,eACRiQ,SAAY,cACZE,QACE,kBACA,sBAEFD,YAAe,kEACfE,UACE,kBACA,sBAEFI,SAAY,eAAgB,eAMzB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,aACRiQ,SAAY,cACZE,QACE,qBAEFD,YACI,0CACJE,UACE,mBACA,4BAEFI,SAAY,SAAU;EAMnB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,cACZE,QACE,WACA,cACA,mBACA,eACA,oBACA,0BAEFD,YACI,0BACJE,UACE,WACA,iBACA,kBAEFI,SAAY,aAAc,eAMvB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,cACZE,QACE,YACA,eACA,oBACA,gBACA,qBACA,2BAEFD,YACI,iCACJE,UACE,YACA,kBACA,uBAEFI,SAAY,aAAc,YAKvB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,aACZE,QACE,iBAEFD,YACI,8GACJE,UACE,gBACA,gBACA,gBACA,qBACA,yBAEFI,SACE,QAAS,UAAW,UAAW,YAAa,cAO3C,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,aACZE,QACE,mBAEFD,YACI,+IACJE,UACE,qBACA,oBAEFI,SACE,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,aAOjE,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,aACZE,QACE,SACA,eAEFD,YACI,wFACJE,UACE,WACA,WACA,UACA,YACA,SACA,gBAEFI,SACE,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,eAOnE,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,aACZE,QACE,QACA,gBAEFD,YACI,2FACJE,UACE,QACA,UACA,UACA,YACA,UACA,UACA,iBAEFI,SACE,QAAS,UAAW,UAAW,YAAa,WAAY,aAOvD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,WACRiQ,SAAY,aACZE,QACE,SACA,kBAEFD,YACI,yGACJE,UACE,UACA,WACA,UACA,YACA,WAEFI,SACE,QAAS,UAAW,YAAa,UAAW,WAAY,aAOvD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,aACZE,QACE,QACA,iBAEFD,YACI,mGACJE,UACE,QACA,UACA,UACA,YACA,UACA,iBAEFI,SACE,QAAS,UAAW,SAAU,YAAa,WAAY,aAOtD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,YACRiQ,SAAY,aACZE,QACE,SACA,mBAEFD,YACI,0GACJE,UACE,UACA,WACA,UACA,YACA,WAEFI,SACE,QAAS,UAAW,SAAU,UAAW,WAAY,aAOpD,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,aACZE,QACE,SACA,iBAEFD,YACI,uGACJE,UACE,WACA,WACA,UACA,YACA,SACA,eACA,kBAEFI,SACE,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,eAOjE,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,oBACA,SACA,eAEFD,YAAe,iDACfE,UACE,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFI,SACE,OACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,qBACA,UACA,gBAEFD,YAAe,mDACfE,UACE,mBACA,qBACA,qBACA,wBACA,wBACA,8BAEFI,SACE,MACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,aACZE,QACE,uBACA,aAEFD,YAAe,mLACfE,UACE,kBACA,yBAEFI,SACE,MACA,OACA,MACA,OACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,oBACA,SACA,eAEFD,YAAe,iDACfE,UACE,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFI,SACE,MACA,OACA,SACA,OACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,aACZE,QACE,qBACA,WAEFD,YAAe,qCACfE,UACE,gBACA,kBACA,sBAEFI,SACE,MACA,OACA,MACA,SACA,MACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,oBACA,SACA,yBAEFD,YAAe,4KACfE,UACE,eACA,oBACA,mCACA,8BACA,2BAEFI,SACE,MACA,OACA,MACA,SACA,MACA,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,oBACA,UAEFD,YAAe,iCACfE,UACE,kBACA,oBACA,qBAEFI,SACE,MACA,OACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,aACZE,QACE,oBACA,SACA,yBAEFD,YAAe,gIACfE,UACE,eACA,oBACA,mCACA,8BACA,2BAEFI,SACE,MACA,OACA,MACA,SACA,MACA,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,oDACfE,UACE,YACA,kBAEFI,SACE,MACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,6FACfE,UACE,cAEFI,SACE,OACA,QACA,WAMC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,8CACfE,UACE,YACA,iBACA,WAEFI,SACE,MACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,6GACfE,UACE,cAEFI,SACE,QACA,WAMC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,8CACfE,UACE,YACA,iBACA,WAEFI,SACE,MACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,sGACfE,UACE,cAEFI,SACE,QACA,WAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,2CACfE,UACE,YACA,iBACA,WAEFI,SACE,OACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,2CACfE,UACE,cAEFI,SACE,QACA,WAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,kDACfE,UACE,YACA,kBAEFI,SACE,MACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,8FACfE,UACE,cAEFI,SACE,QACA,WAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,qDACfE,UACE,YACA,kBAEFI,SACE,MACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,YAEFD,YAAe,mGACfE,UACE,cAEFI,SACE,QACA,WAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,eACZE,QACE,eAEFD,YACI,qEACJE,UACE,mBACA,wBACA,iBACA,iBACA,eAEFI,SACE,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,sCACfE,UACE,SACA,kBACA,eACA,cACA,2BAEFI,SACE,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,iDACfE,UACE,aAEFI,SACE,OACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,6DACfE,UACE,SACA,cAEFI,SACE,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,oDACfE,UACE,UACA,eAEFI,SACE,OACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,4DACfE,UACE,SACA,cAEFI,SACE,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,wEACfE,UACE,UACA,eAEFI,SACE,OACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,0DACfE,UACE,SACA,cAEFI,SACE,MACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,sEACfE,UACE,UACA,eAEFI,SACE,OACA,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,oCACfE,UACE,SACA,kBACA,cACA,cACA,2BAEFI,SACE,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,+CACfE,UACE,aAEFI,SACE,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,eACZE,QACE,UAEFD,YAAe,uCACfE,UACE,WACA,sBACA,cACA,eAEFI,SACE,OACA,MACA,SAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,eACZE,QACE,WAEFD,YAAe,kDACfE,UACE,YACA,yBAEFI,SACE,OACA,UAOC,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,KACRiQ,SAAY,QACZE,QACE,YACA,eAEFD,YAAe,8BACfE,UACE,eACA,aACA,oBAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,QACRiQ,SAAY,QACZE,QACE,YAEFD,YAAe,sFACfE,UACE,aACA,gBACA,gBACA,sBACA,wBAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,MACRiQ,SAAY,QACZE,QACE,oBAEFD,YAAe,qHACfE,UACE,0DAEFI,SAAY,SAAU,aAMnB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,QACZE,QACE,mBAEFD,YAAe,4BACfE,UACE,wBACA,wCACA,oCAEFI,SAAY,OAAQ,MAAO,aAMxB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,UACRiQ,SAAY,QACZE,QACE,wBAEFD,YAAe,0FACfE,UACE,0DAEFI,SAAY,MAAO,OAAQ,YAMxB,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,QACZE,QACE,gBACA,4BAEFD,YAAe,wCACfE,UACE,cACA,iBACA,aACA,iBAEFI,SAAY,WAMT,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,QACZE,QACE,kBAEFD,YAAe,gCACfE,UACE,oBACA,wBAEFI,aAMG,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,OACRiQ,SAAY,QACZE,QACE,UACA,oBAEFD,YAAe,kGACfE,UACE,mBACA,6BACA,+CACA,kDAEFI,SAAY,MAAO,SAAU,aAM1B,SAAStgB,GAEdA,EAAOD,SACL+P,KAAQ,SACRiQ,SAAY,QACZE,QACE,aAEFD,YAAe,8BACfE,UACE,cACA,iBACA,iBACA,yBAEFI,aAMG,SAAStgB,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,WA0Cf,QAASstC,GAAgBxqC,EAAGsG,GAC1B,GAAIiwB,GAAMjwB,EAAEG,GAAKH,EAAEG,GAAKH,EAAEI,GAAKJ,EAAEI,EACjC,OAAW,IAAP6vB,EACK,GAAIh3B,IACNS,EAAEyG,GAAKH,EAAEG,GAAKzG,EAAE0G,GAAKJ,EAAEI,IAAM6vB,GAC7Bv2B,EAAE0G,GAAKJ,EAAEG,GAAKzG,EAAEyG,GAAKH,EAAEI,IAAM6vB,GAK3B,GAAIh3B,GACE,GAARS,EAAEyG,GAAYzG,EAAEyG,GAAK,EAAK,EAClB,GAARzG,EAAE0G,GAAY1G,EAAE0G,GAAK,EAAK,GArDnC,GAAI5G,GAAQtC,EAAoB,KAC5B+B,EAAU/B,EAAoB,GAe9BswB,EAAehuB,EAAM,gBACvButB,iBAAkB,SAAUrtB,EAAGsG,GAC7B,MAAOtG,GAAIsG,GAGbknB,mBAAoBgd,EAEpBld,uBAAwB,SAAUttB,EAAGsG,GACnC,MAAOtG,GAAEie,IAAI3X,IAGfkpB,eAAgB,SAAUxvB,EAAGsG,GAC3B,GAAI4G,GAAMlN,EAAEd,OAEZ,OADAgO,GAAI7J,OAAwB,OAAd6J,EAAI7J,MAAkB6J,EAAIM,WAAW,GAAKN,EAAI7J,OAASiD,EAC9D4G,IA4BX,OAAO4gB,KAMJ,SAAS3wB,EAAQD,EAASM,GAE/B,YAKAL,GAAOD,QAAU,SAAUmB,GA6BzB,QAASo4B,GAAaxpB,GACpB,IAAKw9B,EAAc5mC,eAAeoJ,GAChC,KAAM,IAAI7O,OAAM,wBAA0B6O,EAE5C,IAAI1D,GAAOpG,MAAMuF,UAAUskB,MAAMnvB,KAAKqI,UAAW,GAC7CuwB,EAAegU,EAAcx9B,GAAMtC,MAAMrN,KAAMiM,EAEnD,OAAO,UAAUktB,GAGf,GAAIiU,IAEFzgB,OAAQ,SAAS0gB,EAAMC,EAAMC,GAC3B,GAAI/gC,GAAM9H,EAAKS,CACf,IAAIyD,UAAU7B,OAAS,EACrB,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,SAAUvY,UAAU7B,OAAQ,EAAG,EA+BrE,IA5BgC,IAArB6B,UAAU7B,OACfkb,EAAaorB,GACf7gC,EAAO6gC,EAGPloC,EAAMkoC,EAGsB,IAArBzkC,UAAU7B,OACfkb,EAAaorB,IACf7gC,EAAO6gC,EACPloC,EAAMmoC,IAGN5oC,EAAM2oC,EACNloC,EAAMmoC,IAIR9gC,EAAO6gC,EACP3oC,EAAM4oC,EACNnoC,EAAMooC,GAKI3nC,SAART,IAAmBA,EAAM,GACjBS,SAARlB,IAAmBA,EAAM,GAChBkB,SAAT4G,EAAoB,CACtB,GAAIoD,GAAM49B,EAAqBhhC,EAAKvG,UAAWvB,EAAKS,EAAKsoC,EACzD,OAAQjhC,aAAgBpK,GAAU,GAAIA,GAAOwN,GAAOA,EAEjD,MAAO69B,GAAQ/oC,EAAKS,IAG3BynB,UAAW,SAASygB,EAAMC,EAAMC,GAC9B,GAAI/gC,GAAM9H,EAAKS,CACf,IAAIyD,UAAU7B,OAAS,GAAK6B,UAAU7B,OAAS,EAC7C,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,YAAavY,UAAU7B,OAAQ,EAAG,EA8BxE,IA3B8B,IAArB6B,UAAU7B,OACbkb,EAAaorB,GACf7gC,EAAO6gC,EAGPloC,EAAMkoC,EAGoB,IAArBzkC,UAAU7B,OACbkb,EAAaorB,IACf7gC,EAAO6gC,EACPloC,EAAMmoC,IAGN5oC,EAAM2oC,EACNloC,EAAMmoC,IAIR9gC,EAAO6gC,EACP3oC,EAAM4oC,EACNnoC,EAAMooC,GAKI3nC,SAARlB,IAAmBA,EAAM,GAChBkB,SAAT4G,EAAoB,CACtB,GAAIoD,GAAM49B,EAAqBhhC,EAAKvG,UAAWvB,EAAKS,EAAKuoC,EACzD,OAAQlhC,aAAgBpK,GAAU,GAAIA,GAAOwN,GAAOA,EAEjD,MAAO89B,GAAWhpC,EAAKS,IAG9BunB,WAAY,SAASihB,GACnB,GAAyB,IAArB/kC,UAAU7B,OACZ,KAAM,IAAIhG,GAAKiB,MAAMmf,eAAe,aAAcvY,UAAU7B,OAAQ,EAEtE,IAAI4mC,YAAqBvrC,GACvBurC,EAAYA,EAAU1nC,cAEnB,KAAKJ,MAAMC,QAAQ6nC,GACtB,KAAM,IAAI5sC,GAAKiB,MAAMqf,qBAAqB,aAActgB,EAAK,UAAU4sC,GAGzE,IAAI3qC,EAAMwJ,KAAKmhC,GAAW5mC,OAAS,EACjC,KAAM,IAAIjG,OAAM,yCAIlB,OAAO6sC,GAAUhmC,KAAKgjB,MAAMhjB,KAAKglB,SAAWghB,EAAU5mC,WAKtD0mC,EAAU,SAAS/oC,EAAKS,GAC1B,MAAOT,GAAMy0B,KAAkBh0B,EAAMT,IAGnCgpC,EAAa,SAAShpC,EAAKS,GAC7B,MAAOwC,MAAKgjB,MAAMjmB,EAAMy0B,KAAkBh0B,EAAMT,KAI9C8oC,EAAuB,SAAShhC,EAAM9H,EAAKS,EAAKyoC,GAClD,GAAe7mC,GAAQF,EAAnB+G,IAGJ,IAFApB,EAAOA,EAAKkjB,MAAM,GAEdljB,EAAKzF,OAAS,EAChB,IAAKF,EAAI,EAAGE,EAASyF,EAAK8oB,QAAavuB,EAAJF,EAAYA,IAC7C+G,EAAKZ,KAAKwgC,EAAqBhhC,EAAM9H,EAAKS,EAAKyoC,QAEjD,KAAK/mC,EAAI,EAAGE,EAASyF,EAAK8oB,QAAavuB,EAAJF,EAAYA,IAC7C+G,EAAKZ,KAAK4gC,EAASlpC,EAAKS,GAG5B,OAAOyI,GAGT,OAAOw/B,IAENjU,GAxKL,GAAI/2B,GAASlC,EAAoB,GAC7B8C,EAAQ9C,EAAoB,KAC5B+C,EAAa/C,EAAoB,IACjC+hB,EAAehf,EAAWgf,aA0K1BkrB,GAEFU,QAAS,WACP,MAAOlmC,MAAKglB,QAOdmhB,OAAQ,WACN,MAAO,YAKL,IAJA,GAAIC,GAAIC,EACJC,EAAS,GAGG,EAATA,GAAcA,EAAS,GAC5BF,EAAKpmC,KAAKglB,SACVqhB,EAAKrmC,KAAKglB,SACVshB,EAAS,EAAE,EAAItmC,KAAK5D,IAAI,GAAK4D,KAAK9D,IAAIkqC,GAAK,IAAOpmC,KAAKuD,IAAI,EAAIvD,KAAKiZ,GAAKotB,GAAM,EAEjF,OAAOC,KAKb,OAAO9U,KAMJ,SAASt5B,EAAQD,GAEtB,YAWAA,GAAQ4B,KAAO,SAASkB,GACtB,GAAIlB,SAAckB,EAElB,IAAa,WAATlB,EAAmB,CACrB,GAAU,OAANkB,EAAsB,MAAO,MACjC,IAAIA,YAAayD,SAAS,MAAO,SACjC,IAAIzD,YAAasD,QAAS,MAAO,QACjC,IAAItD,YAAawD,QAAS,MAAO,QACjC,IAAIL,MAAMC,QAAQpD,GAAQ,MAAO,OACjC,IAAIA,YAAa0D,MAAS,MAAO,MACjC,IAAI1D,YAAa8nC,UAAS,MAAO,UACjC,IAAI9nC,YAAa2D,QAAS,MAAO,SAGnC,MAAO7E,KAMJ,SAAS3B,EAAQD,EAASM,GAE/B,GAAIw+B,IACH,SAAWwP,GACR,YAu0DA,SAASC,GAAoB1nC,GAMzB,IALA,GAAI+T,GAAG9H,EACH7L,EAAI,EACJ+a,EAAInb,EAAEM,OACN0C,EAAIhD,EAAE,GAAK,GAEHmb,EAAJ/a,EAAOA,IAAM,CAGjB,IAFA2T,EAAI/T,EAAEI,GAAK,GAEL6L,EAAI07B,EAAU5zB,EAAEzT,OAAQ2L,KAC1B8H,EAAI,IAAMA,CAGd/Q,IAAK+Q,EAIT,IAAMoH,EAAInY,EAAE1C,OAA8B,KAAtB0C,EAAE4kC,aAAazsB,KAEnC,MAAOnY,GAAEimB,MAAO,EAAG9N,EAAI,GAAK,GAmBhC,QAAS0sB,GAAqB7tC,EAAGoG,EAAG0nC,EAAIC,GACpC,GAAIC,GAAI38B,EAAGU,EAAG/I,EAAGqN,CAGjB,KAAMhF,EAAI,EAAGU,EAAI/R,EAAE,GAAI+R,GAAK,GAAIA,GAAK,GAAIV,KAoDzC,MAlDAU,GAAI3L,EAAIiL,EAGC,EAAJU,GACDA,GAAK47B,EACLK,EAAK,IAELA,EAAK9mC,KAAK8E,MAAQ+F,EAAI,GAAM47B,GAC5B57B,GAAK47B,GAGTt8B,EAAI48B,EAAS,GAAIN,EAAU57B,GAC3BsE,EAAKrW,EAAEguC,GAAM38B,EAAI,EAEC,MAAb08B,EAEQ,EAAJh8B,GAES,GAALA,EACDsE,EAAKA,EAAK,IAAM,EACH,GAALtE,IACRsE,EAAKA,EAAK,GAAK,GAGnBrN,EAAS,EAAL8kC,GAAgB,OAANz3B,GAAey3B,EAAK,GAAW,OAANz3B,GAAqB,KAANA,GAAqB,GAANA,GAErErN,GAAW,EAAL8kC,GAAUz3B,EAAK,GAAKhF,GAAKy8B,EAAK,GAAKz3B,EAAK,GAAKhF,EAAI,KACjDrR,EAAEguC,EAAK,GAAK38B,EAAI,IAAM,IAAO48B,EAAS,GAAIl8B,EAAI,GAAM,IAChDsE,GAAMhF,EAAI,GAAW,GAANgF,IAA4C,IAA7BrW,EAAEguC,EAAK,GAAK38B,EAAI,IAAM,GAIzD,EAAJU,GAES,GAALA,EACDsE,EAAKA,EAAK,IAAO,EACJ,GAALtE,EACRsE,EAAKA,EAAK,IAAM,EACH,GAALtE,IACRsE,EAAKA,EAAK,GAAK,GAGnBrN,GAAM+kC,GAAkB,EAALD,IAAkB,MAANz3B,IAAe03B,GAAaD,EAAK,GAAW,MAANz3B,GAErErN,IAAQ+kC,GAAkB,EAALD,IAAYz3B,EAAK,GAAKhF,IACxC08B,GAAaD,EAAK,GAAOz3B,EAAK,GAAKhF,EAAI,KACpCrR,EAAEguC,EAAK,GAAK38B,EAAI,IAAO,IAAO48B,EAAS,GAAIl8B,EAAI,GAAM,EAI5D/I,EAOX,QAASklC,GAASjsC,EAAG6rC,EAAIK,GACrB,GAAIC,GAAUnsC,EAAe,WAE7B,OAAa,OAAN6rC,KAAkBO,EAAkB,EAALP,GAAUA,EAAK,IAC5C,IAAPA,IAAcM,EAAgB,OAAIE,SAAWrmC,YAAa6lC,IAAOA,KAC9DS,EAAmBH,EAAS,gBAAiBN,EAAIK,EAAQ,GACtDC,EAAkB,SAAS,EAALN,EAOlC,QAASU,GAAUvsC,EAAG8P,EAAGo8B,EAAQlqC,GAC7B,GAAImqC,GAAUnsC,EAAe,WAE7B,SAAUosC,GAAmBpqC,GAAO,GAAb8N,GAAoBA,GAAK08B,EAAa,KAMnD,IAAN18B,IAAaq8B,EAAgB,OAAIE,SAAWrmC,YAAa8J,IAAMA,IAC/Dw8B,EAAmBH,EAAS,WAAYr8B,EAAGo8B,EAAQ,GA0d3D,QAAShrC,GAAKlB,EAAGysC,GACb,GAAIC,GAAOC,EAAOztB,EAAG7d,EAAKurC,EAAI3qC,EAAK0sB,EAC/Bke,EAAM,EACN1oC,EAAI,EACJiL,EAAI,EACJ+8B,EAAUnsC,EAAe,YACzBswB,EAAM6b,EAAa,IACnBN,EAAKM,EAAkB,SACvB1tC,EAAY0tC,EAAmB,SAGnC,KAAMnsC,EAAK,IAAMA,EAAK,EAAE,IAAMA,EAAK,EAAI,GAEnC,MAAO,IAAImsC,GAASnsC,EAAK,EACpBA,EAAK,EAAE,GAAWA,EAAK,EAAI,EAAI,EAAI,EAAI,EAA3BswB,EACbtwB,EAAK,EAAIA,EAAK,EAAI,EAAI,EAAIA,EAAI6d,IA4BtC,KAzBW,MAAN4uB,GAgBDK,GAAW,EACXF,EAAKnuC,GAELmuC,EAAKH,EAGT9d,EAAI,GAAIwd,GAAQ,QAGRnsC,EAAK,EAAI,IAGbA,EAAIA,EAAS,MAAE2uB,GACfvf,GAAK,CAaT,KANAu9B,EAAQ1nC,KAAK9D,IAAK6qC,EAAS,EAAG58B,IAAQnK,KAAK4J,KAAO,EAAI,EAAI,EAC1D+9B,GAAMD,EAEND,EAAQrrC,EAAMY,EAAM,GAAIkqC,GAAQ7b,GAChC6b,EAAmB,UAAIS,IAEX,CAKR,GAJAvrC,EAAM0rC,EAAK1rC,EAAW,MAAErB,GAAI4sC,EAAI,GAChCF,EAAQA,EAAa,QAAIvoC,GACzBwqB,EAAI1sB,EAAU,KAAGgc,EAAK5c,EAAKqrC,EAAOE,EAAI,IAEjCnB,EAAqB9c,EAAK,GAAI3B,MAAO,EAAG4f,KACxCnB,EAAqBxpC,EAAO,GAAI+qB,MAAO,EAAG4f,GAAO,CAGlD,IAFA1tB,EAAI9P,EAEI8P,KACJjd,EAAM8qC,EAAK9qC,EAAW,MAAEA,GAAM2qC,EAAI,EAYtC,IAAW,MAANH,EAcD,MAFAN,GAAmB,UAAI1tC,EAEhBwD,CAZP,MAAW,EAAN4qC,GAAWjB,EAAqB3pC,EAAO,EAAG2qC,EAAKD,EAAOd,EAAIgB,IAO3D,MAAOE,GAAK9qC,EAAKkqC,EAAmB,UAAI1tC,EAAWotC,EAAIiB,GAAW,EANlEX,GAAmB,UAAIS,GAAM,GAC7BF,EAAQrrC,EAAMstB,EAAI,GAAIwd,GAAQ7b,GAC9BnsB,EAAI,EACJ0oC,IAWZ5qC,EAAM0sB,GAad,QAASvpB,GAAQ0K,EAAG3L,EAAG+a,EAAG9P,GACtB,GAAI0I,GAAG9H,EACHm8B,EAAUr8B,EAAe,YACzBtL,GAAMsL,EAAI,GAAIq8B,GAAQr8B,IAAQ,CAsBlC,IAnBU,MAAL3L,EACD+a,EAAI,GAEJ6tB,EAAKj9B,IAAK3L,EAAG+a,GAGbA,EAAI9P,EAAIjL,EAAIA,EAAI2L,EAAK,EAAItL,GAG7BA,EAAIsL,EAAK,EACTgI,EAAI2zB,EAAqB37B,EAAK,GASpB,GAALV,GAAe,GAALA,IAAiB5K,GAALL,GAAUK,GAAK2nC,EAAkB,UAAM,CAG9D,KAAQr0B,EAAEzT,OAAS6a,EAAGpH,GAAK,KAEtBA,EAAEzT,OAAS,IACZyT,EAAIA,EAAExQ,OAAO,GAAK,IAAMwQ,EAAEkV,MAAM,IAGpClV,IAAW,EAAJtT,EAAQ,IAAM,MAASA,MAG3B,CAIH,GAHA4K,EAAI0I,EAAEzT,OAGG,EAAJG,EAAQ,CAIT,IAHAwL,EAAIkP,EAAI9P,IAGE5K,EAAGsT,EAAI,IAAMA,GACvBA,EAAI,KAAOA,MAKX,MAAOtT,EAAI4K,EAAI,CAIX,IAHAY,EAAIkP,EAAI1a,EAGFA,GAAK4K,EAAG5K,IAAMsT,GAAK,KAEpB9H,EAAI,IACL8H,GAAK,SAIT9H,GAAIkP,EAAI9P,EAECA,EAAJ5K,EACDsT,EAAIA,EAAEkV,MAAO,EAAGxoB,GAAM,IAAMsT,EAAEkV,MAAMxoB,GAC5BwL,EAAI,IACZ8H,GAAK,IAMjB,IAAK9H,EAAI,EAEL,KAAQA,IAAK8H,GAAK,MAI1B,MAAOhI,GAAK,EAAI,GAAKA,EAAK,EAAE,GAAK,IAAMgI,EAAIA,EAI/C,QAASk1B,GAAejvC,GACpB,GAAI+xB,GAAI/xB,EAAEsG,OAAS,EACfyL,EAAIggB,EAAI4b,EAAU,CAEtB,IAAK5b,EAAI/xB,EAAE+xB,GAAK,CAGZ,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAIhgB,KAG9B,IAAMggB,EAAI/xB,EAAE,GAAI+xB,GAAK,GAAIA,GAAK,GAAIhgB,MAGtC,MAAOA,GAOX,QAASw8B,GAAmBH,EAAS/lB,EAASxf,EAAKslC,EAAQe,GAEvD,GAAKd,EAAgB,OAAI,CACrB,GAAI7sC,GAAQ,GAAIlB,QAAS8tC,IACvB,cAAe,MAAO,MAAO,KAAM,KAAM,MAAO,KAAM,MAAO,QAAS,MACtE,OAAQ,QAAS,aAAc,MAAO,SAAU,MAAO,OAAQ,YAAa,YACzEvuC,EAAU,EAALA,GAAUA,EAAKA,EAAc,EAAT,EAAIA,EAAS,EAAI,IAAQ,QACrD,kDAAmD,sBAAuByoB,IACvEA,IAAcgmB,EAAa,gBAAkB,kBAChD,kCAAmCa,IAAS,KAAS,KAAOrmC,EAK9D,MAHAtH,GAAY,KAAI,gBAChB8sC,EAAazuC,EAAK,EAEZ2B,GAQd,QAAS4tC,GAAQf,EAASnsC,EAAGmE,GACzB,GAAI4C,GAAI,GAAIolC,GAASA,EAAa,IAElC,KAAMW,GAAW,EAEJ,EAAJ3oC,IACD4C,EAAIA,EAAS,MAAE/G,IAEnBmE,IAAM,EAEAA,GAINnE,EAAIA,EAAS,MAAEA,EAInB,OAFA8sC,IAAW,EAEJ/lC,EAgBX,QAASiX,GAAI1X,EAAGmmC,GACZ,GAAI1uC,GAAGovC,EAAIT,EAAOloC,EAAGoF,EAAKijC,EAAKD,EAAI3qC,EAAK0sB,EAAGye,EAAIvK,EAC3C/yB,EAAI,EACJ68B,EAAQ,GACR3sC,EAAIsG,EACJ+mC,EAAKrtC,EAAK,EACVmsC,EAAUnsC,EAAe,YACzBswB,EAAM6b,EAAa,IACnBN,EAAKM,EAAkB,SACvB1tC,EAAY0tC,EAAmB,SAGnC,IAAKnsC,EAAK,EAAI,IAAMqtC,IAAOA,EAAG,KAAOrtC,EAAK,GAAc,GAATqtC,EAAG,IAAwB,GAAbA,EAAGhpC,OAE5D,MAAO,IAAI8nC,GAASkB,IAAOA,EAAG,GAAK,GAAK,EAAc,GAAVrtC,EAAK,EAAS6d,IAAMwvB,EAAK,EAAIrtC,EAe7E,IAZW,MAANysC,GACDK,GAAW,EACXF,EAAKnuC,GAELmuC,EAAKH,EAGTN,EAAmB,UAAIS,GAAMD,EAE7B5uC,EAAI0tC,EAAoB4B,GACxBF,EAAKpvC,EAAEuJ,OAAO,KAETrC,KAAKlE,IAAKyD,EAAIxE,EAAK,GAAM,OAiD1B,MAZAA,GAAI,GAAImsC,GAASgB,EAAK,IAAMpvC,EAAEivB,MAAM,IAE/B4f,EAAK,EAAI/9B,EAAKxK,QACfioC,EAAmBH,EAAS,EAAGS,EAAK,EAAG,MAG3C5sC,EAAIge,EAAIhe,EAAG4sC,EAAKD,GAAc,KAC1B,GAAIR,GAASt9B,EAAKme,MAAO,EAAG4f,EAAK,IAAa,MAAGpoC,EAAI,KAGzD2nC,EAAmB,UAAI1tC,EAEV,MAANguC,EAAaM,EAAK/sC,EAAGvB,EAAWotC,EAAIiB,GAAW,GAAS9sC,CAlC/D,MAAa,EAALmtC,GAAgB,GAANA,GAAiB,GAANA,GAAWpvC,EAAEuJ,OAAO,GAAK,GAClDtH,EAAIA,EAAS,MAAEsG,GACfvI,EAAI0tC,EAAqBzrC,EAAK,GAC9BmtC,EAAKpvC,EAAEuJ,OAAO,GACdwI,GA8CR,KA3CItL,EAAIxE,EAAK,EAEJmtC,EAAK,GACNntC,EAAI,GAAImsC,GAAS,KAAOpuC,GACxByG,KAEAxE,EAAI,GAAImsC,GAASgB,EAAK,IAAMpvC,EAAEivB,MAAM,IAyB5CogB,EAAKptC,EAQLiC,EAAM2H,EAAM5J,EAAIie,EAAKje,EAAS,MAAEswB,GAAMtwB,EAAQ,KAAEswB,GAAMsc,EAAI,GAC1D/J,EAAKkK,EAAK/sC,EAAS,MAAEA,GAAI4sC,EAAI,GAC7BF,EAAQ,IAEI,CAIR,GAHA9iC,EAAMmjC,EAAKnjC,EAAW,MAAEi5B,GAAK+J,EAAI,GACjCje,EAAI1sB,EAAU,KAAGgc,EAAKrU,EAAK,GAAIuiC,GAAQO,GAAQE,EAAI,IAE9CnB,EAAqB9c,EAAK,GAAI3B,MAAO,EAAG4f,KACxCnB,EAAqBxpC,EAAO,GAAI+qB,MAAO,EAAG4f,GAAO,CA+BlD,GA9BA3qC,EAAMA,EAAW,MAAE,GAOR,IAANuC,IAEIooC,EAAK,EAAI/9B,EAAKxK,QACfioC,EAAmBH,EAAS,EAAGS,EAAK,EAAG,MAG3C3qC,EAAMA,EAAU,KACZ,GAAIkqC,GAASt9B,EAAKme,MAAO,EAAG4f,EAAK,IAAa,MAAGpoC,EAAI,MAI7DvC,EAAMgc,EAAKhc,EAAK,GAAIkqC,GAAQr8B,GAAI88B,EAAI,GAYzB,MAANH,EAcD,MAFAN,GAAmB,UAAI1tC,EAEhBwD,CAZP,KAAK2pC,EAAqB3pC,EAAO,EAAG2qC,EAAKD,EAAOd,EAAIgB,GAOhD,MAAOE,GAAK9qC,EAAKkqC,EAAmB,UAAI1tC,EAAWotC,EAAIiB,GAAW,EANlEX,GAAmB,UAAIS,GAAMD,EAC7Bhe,EAAI/kB,EAAM5J,EAAIie,EAAKmvB,EAAU,MAAE9c,GAAM8c,EAAS,KAAE9c,GAAMsc,EAAI,GAC1D/J,EAAKkK,EAAK/sC,EAAS,MAAEA,GAAI4sC,EAAI,GAC7BF,EAAQG,EAAM,EAY1B5qC,EAAM0sB,EACN+d,GAAS,GAQhB,QAASK,GAAK/sC,EAAG4sC,EAAIf,EAAI9kC,GACtB,GAAI1H,GAAQ8E,EAAG+a,EAAG9P,EAAGU,EAAGsE,EAAIi5B,EAAIC,EAC5BnB,EAAUnsC,EAAe,WAG7ButC,GAAK,GAAW,MAANX,EAAa,CAGnB,KAAQS,EAAKrtC,EAAK,GAEd,MAAOA,EAcX,KAAMX,EAAS,EAAG+P,EAAIi+B,EAAG,GAAIj+B,GAAK,GAAIA,GAAK,GAAI/P,KAK/C,GAHA8E,EAAIyoC,EAAKvtC,EAGA,EAAJ8E,EACDA,GAAKunC,EACLxsB,EAAI0tB,EACJ98B,EAAIu9B,EAAIC,EAAM,GAGdl5B,EAAKtE,EAAIk8B,EAAS,GAAI3sC,EAAS6f,EAAI,GAAM,GAAK,MAI9C,IAFAouB,EAAMroC,KAAK8E,MAAQ5F,EAAI,GAAMunC,GAExB4B,GAAOD,EAAGhpC,OAAS,CAEpB,IAAI0C,EAWF,KAAMwmC,EARJ,MAAQF,EAAGhpC,QAAUipC,EAAKD,EAAG/iC,KAAK,IAElCwF,EAAIsE,EAAK,EACT/U,EAAS,EACT8E,GAAKunC,EACLxsB,EAAI/a,EAAIunC,EAAU,MAKnB,CAIH,IAHA57B,EAAIV,EAAIi+B,EAAGC,GAGLjuC,EAAS,EAAG+P,GAAK,GAAIA,GAAK,GAAI/P,KAGpC8E,GAAKunC,EAILxsB,EAAI/a,EAAIunC,EAAUrsC,EAIlB+U,EAAS,EAAJ8K,EAAQ,EAAIsuB,EAAW19B,EAAIk8B,EAAS,GAAI3sC,EAAS6f,EAAI,GAAM,IAqBxE,GAjBAnY,EAAIA,GAAU,EAAL6lC,GAEQ,MAAfS,EAAGC,EAAM,KAAoB,EAAJpuB,EAAQpP,EAAIA,EAAIk8B,EAAS,GAAI3sC,EAAS6f,EAAI,IAQrEnY,EAAS,EAAL8kC,GACEz3B,GAAMrN,KAAe,GAAN8kC,GAAWA,IAAQ7rC,EAAK,EAAI,EAAI,EAAI,IACrDoU,EAAK,GAAW,GAANA,IAAmB,GAANy3B,GAAW9kC,GAE5B,GAAN8kC,IAAe1nC,EAAI,EAAI+a,EAAI,EAAIpP,EAAIk8B,EAAS,GAAI3sC,EAAS6f,GAAM,EAAImuB,EAAGC,EAAM,IAAO,GAAO,GACxFzB,IAAQ7rC,EAAK,EAAI,EAAI,EAAI,IAErB,EAAL4sC,IAAWS,EAAG,GAiBf,MAhBAA,GAAGhpC,OAAS,EAER0C,GAGA6lC,GAAM5sC,EAAK,EAAI,EAGfqtC,EAAG,GAAKrB,EAAS,GAAIY,EAAKlB,GAC1B1rC,EAAK,GAAK4sC,GAAM,GAIhBS,EAAG,GAAKrtC,EAAK,EAAI,EAGdA,CAmBX,IAdU,GAALmE,GACDkpC,EAAGhpC,OAASipC,EACZl+B,EAAI,EACJk+B,MAEAD,EAAGhpC,OAASipC,EAAM,EAClBl+B,EAAI48B,EAAS,GAAIN,EAAUvnC,GAI3BkpC,EAAGC,GAAOpuB,EAAI,GAAMpP,EAAIk8B,EAAS,GAAI3sC,EAAS6f,GAAM8sB,EAAS,GAAI9sB,GAAM,GAAM9P,EAAI,GAIjFrI,EAEA,OAAY,CAGR,GAAY,GAAPumC,EAAW,CAGZ,IAAMnpC,EAAI,EAAG+a,EAAImuB,EAAG,GAAInuB,GAAK,GAAIA,GAAK,GAAI/a,KAI1C,IAFA+a,EAAImuB,EAAG,IAAMj+B,EAEPA,EAAI,EAAG8P,GAAK,GAAIA,GAAK,GAAI9P,KAG1BjL,GAAKiL,IACNpP,EAAK,IAEAqtC,EAAG,IAAMI,IACVJ,EAAG,GAAK,GAIhB,OAIA,GAFAA,EAAGC,IAAQl+B,EAENi+B,EAAGC,IAAQG,EAEZ,KAGJJ,GAAGC,KAAS,EACZl+B,EAAI,EAMhB,IAAMjL,EAAIkpC,EAAGhpC,OAAoB,IAAZgpC,IAAKlpC,GAAUkpC,EAAGrY,QAmB3C,MAhBI8X,KAGK9sC,EAAK,EAAImsC,EAAc,KAGxBnsC,EAAK,EAAIA,EAAK,EAAI,KAGVA,EAAK,EAAImsC,EAAc,OAG/BnsC,EAAK,GAAMA,EAAK,EAAI,KAIrBA,EAr/FX,GAAI0tC,GAAaC,EAMbvB,EALAwB,EAASpC,EAAe,OACxBsB,GAAW,EACXnvC,EAAK,EACL6vC,EAAYvoC,KAAKgjB,MACjB+jB,EAAU/mC,KAAK5D,IAEf4H,EAAW9K,OAAOuK,UAAUO,SAC5BwkC,EAAO,IACP/B,EAAU,EACVmC,EAAW,mEACXr+B,KAMAs+B,EAAY,KAMZtB,EAAa,IAObuB,EAAgB,IAGhBl/B,EAAO,ogCAUXW,GAAiB,cAAIA,EAAO,IAAI,WAC5B,GAAIxP,GAAI,GAAI1C,MAAkB,YAAEA,KAMhC,OAJK0C,GAAK,EAAI,IACVA,EAAK,EAAI,GAGN+sC,EAAI/sC,IASfwP,EAAQ,KAAI,WAER,MAAOu9B,GAAK,GAAIzvC,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAY9DkS,EAAc,WAAIA,EAAO,IAAI,SAAWlJ,EAAGtC,GACvC,GAAID,GACA/D,EAAI1C,KACJ+vC,EAAKrtC,EAAK,EACVguC,GAAOrwC,GAAMA,EAAI2I,EAAI,GAAItG,GAAe,YAAGsG,EAAGtC,GAAKsC,EAAK,GACxDnC,EAAInE,EAAK,EACTkf,EAAI5Y,EAAK,EACT8I,EAAIpP,EAAK,EACTiV,EAAI3O,EAAK,CAGb,KAAMnC,IAAM+a,EACR,MAAO,KAOX,IAJAnb,EAAIspC,IAAOA,EAAG,GACdrpC,EAAIgqC,IAAOA,EAAG,GAGTjqC,GAAKC,EACN,MAAOD,GAAIC,EAAI,GAAKkb,EAAI/a,CAI5B,IAAKA,GAAK+a,EACN,MAAO/a,EAMX,IAHAJ,EAAQ,EAAJI,GAGEkpC,IAAOW,EACT,MAAO5+B,IAAK6F,EAAI,GAAKo4B,EAAKtpC,EAAI,EAAI,EAItC,IAAKqL,GAAK6F,EACN,MAAO7F,GAAI6F,EAAIlR,EAAI,EAAI,EAI3B,KAAMI,EAAI,GACJ+a,GAAM9P,EAAIi+B,EAAGhpC,SAAa4Q,EAAI+4B,EAAG3pC,QAAW+K,EAAI6F,IAC9C9Q,EAAI+a,GAER,GAAKmuB,EAAGlpC,IAAM6pC,EAAG7pC,GACb,MAAOkpC,GAAGlpC,GAAK6pC,EAAG7pC,GAAKJ,EAAI,EAAI,EAKvC,OAAOqL,IAAK6F,EAAI,EAAI7F,EAAI6F,EAAIlR,EAAI,EAAI,IAQvCyL,EAAiB,cAAIA,EAAM,GAAI,WAC5B,GAAIzR,GAAG+xB,EACHhgB,EAAI,IAER,IAAK/R,EAAIT,KAAQ,EAAI,CAGjB,GAFAwS,IAAQggB,EAAI/xB,EAAEsG,OAAS,GAAMmpC,EAAWlwC,KAAQ,EAAIouC,IAAcA,EAE7D5b,EAAI/xB,EAAE+xB,GAGP,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAIhgB,KAGzB,EAAJA,IACDA,EAAI,GAIZ,MAAOA,IAyBXN,EAAa,UAAIA,EAAO,IAAI,SAAWlJ,EAAGtC,GAGtC,MAFArG,GAAK,EAEEsgB,EAAK3gB,KAAM,GAAIA,MAAkB,YAAGgJ,EAAGtC,KAUlDwL,EAAsB,mBAAIA,EAAY,SAAI,SAAWlJ,EAAGtC,GACpD,GAAIhE,GAAI1C,KACJ6uC,EAAUnsC,EAAe,WAG7B,OAFArC,GAAK,GAEEovC,EACL9uB,EAAKje,EAAG,GAAImsC,GAAS7lC,EAAGtC,GAAK,EAAG,EAAG,GAAKmoC,EAAmB,UAAGA,EAAkB,WAUtF38B,EAAU,OAAIA,EAAM,GAAI,SAAWM,EAAG9L,GAGlC,MAFArG,GAAK,EAE0B,IAAxBL,KAAU,IAAGwS,EAAG9L,IAU3BwL,EAAe,YAAIA,EAAO,IAAI,WAE1B,MAAOtO,GAAI5D,OASfkS,EAAS,MAAI,WAET,MAAOu9B,GAAK,GAAIzvC,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAS9DkS,EAAe,YAAIA,EAAM,GAAI,SAAWM,EAAG9L,GAGvC,MAFArG,GAAK,EAEEL,KAAU,IAAGwS,EAAG9L,GAAM,GASjCwL,EAAwB,qBAAIA,EAAO,IAAI,SAAWM,EAAG9L,GAIjD,MAHArG,GAAK,EACLqG,EAAI1G,KAAU,IAAGwS,EAAG9L,GAER,GAALA,GAAgB,IAANA,GAQrBwL,EAAY,SAAI,WAEZ,QAASlS,KAAQ,GAQrBkS,EAAa,UAAIA,EAAS,MAAI,WAE1B,QAASlS,KAAQ,GAAKkwC,EAAWlwC,KAAQ,EAAIouC,GAAYpuC,KAAQ,EAAE+G,OAAS,GAQhFmL,EAAS,MAAI,WAET,OAAQlS,KAAQ,GAQpBkS,EAAc,WAAIA,EAAS,MAAI,WAE3B,MAAOlS,MAAQ,EAAI,GAQvBkS,EAAU,OAAI,WAEV,QAASlS,KAAQ,GAAqB,GAAhBA,KAAQ,EAAE,IAQpCkS,EAAY,SAAIA,EAAM,GAAI,SAAWM,EAAG9L,GAGpC,MAFArG,GAAK,EAEEL,KAAU,IAAGwS,EAAG9L,GAAM,GASjCwL,EAAqB,kBAAIA,EAAO,IAAI,SAAWM,EAAG9L,GAI9C,MAHArG,GAAK,EACLqG,EAAI1G,KAAU,IAAGwS,EAAG9L,GAER,IAALA,GAAiB,IAANA,GAmCtBwL,EAAa,UAAIA,EAAO,IAAI,SAAWlB,EAAMtK,GACzC,GAAIiqC,GAAQlwC,EAAG2uC,EAAOvoC,EAAG+pC,EAAKtkC,EAAKgjC,EAAIuB,EAAMpnC,EACzCH,EAAMtJ,KACN6uC,EAAUvlC,EAAiB,YAC3B6lC,EAAKN,EAAmB,UACxBN,EAAKM,EAAkB,SACvBQ,EAAQ,CAGZ,IAAa,MAARr+B,EACDA,EAAO,GAAI69B,GAAQ,IACnB8B,GAAS,MACN,CAMH,GALAtwC,EAAK,GACL2Q,EAAO,GAAI69B,GAAS79B,EAAMtK,GAC1BjG,EAAIuQ,EAAQ,EAGPA,EAAQ,EAAI,IAAMvQ,IAAMA,EAAE,KAAOuQ,EAAQ,GAAa,GAARvQ,EAAE,IAAuB,GAAZA,EAAEsG,OAE9D,MAAO,IAAI8nC,GAAQtuB,IAEvBowB,GAAS3/B,EAAS,GAAE,IAKxB,GAHAvQ,EAAI6I,EAAO,EAGNA,EAAO,EAAI,IAAM7I,IAAMA,EAAE,KAAO6I,EAAO,GAAa,GAAR7I,EAAE,IAAuB,GAAZA,EAAEsG,OAE5D,MAAO,IAAI8nC,GAASpuC,IAAMA,EAAE,GAAK,GAAK,EAAgB,GAAZ6I,EAAO,EAASiX,IAAM9f,EAAI,EAAI,EAAI,EAqDhF,IA9CAmwC,EAAMD,IAAY9pC,EAAIpG,EAAE,GAAIA,EAAEsG,OAAS,GAAU,GAALF,GAAe,IAALA,GAC/C,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAUlD2oC,GAAW,EACXF,EAAKH,EAAKE,EACVwB,EAAOvB,EAAK,GAEZhjC,EAAMoU,EAAIpX,EAAKgmC,GAEXqB,GAEKE,EAAOt/B,EAAKxK,QACbioC,EAAmBH,EAAS,EAAGgC,EAAM,OAEzCzB,EAAQ,GAAIP,GAASt9B,EAAKme,MAAO,EAAGmhB,KAEpCzB,EAAQ1uB,EAAI1P,EAAMs+B,GAItB7lC,EAAIkX,EAAKrU,EAAK8iC,EAAOE,EAAI,GAkBpBhB,EAAqB7kC,EAAK,EAAG5C,EAAIsoC,EAAIZ,GAEtC,EAiBI,IAhBAe,GAAM,GACNhjC,EAAMoU,EAAIpX,EAAKgmC,GAEXqB,GACAE,EAAOvB,EAAK,GAEPuB,EAAOt/B,EAAKxK,QACbioC,EAAmBH,EAAS,EAAGgC,EAAM,OAEzCzB,EAAQ,GAAIP,GAASt9B,EAAKme,MAAO,EAAGmhB,KAEpCzB,EAAQ1uB,EAAI1P,EAAMs+B,GAGtB7lC,EAAIkX,EAAKrU,EAAK8iC,EAAOE,EAAI,IAEnBsB,EAAM,EAGFzC,EAAqB1kC,EAAK,GAAIimB,MAAO7oB,EAAI,EAAGA,EAAI,IAAO,GAAK,OAC9D4C,EAAIgmC,EAAKhmC,EAAG0lC,EAAK,EAAG,GAGxB,aAEEb,EAAqB7kC,EAAK,EAAG5C,GAAK,GAAI0nC,GAIpD,OAFAiB,IAAW,EAEJC,EAAKhmC,EAAG0lC,EAAIZ,IAyBvBr8B,EAAS,MAAI,SAAWlJ,EAAGtC,GACvB,GAAI2qB,GAAGxqB,EAAG+a,EAAGkvB,EACTpuC,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzB+D,EAAI/D,EAAK,CAOb,IALArC,EAAK,EACL2I,EAAI,GAAI6lC,GAAS7lC,EAAGtC,GACpBA,EAAIsC,EAAK,GAGHvC,IAAMC,EAER,MAAO,IAAImoC,GAAQtuB,IAIvB,IAAK9Z,GAAKC,EAGN,MAFAsC,GAAK,GAAKtC,EAEHhE,EAAQ,KAAEsG,EAGrB,IAAI+mC,GAAKrtC,EAAK,EACVguC,EAAK1nC,EAAK,EACV9B,EAAIgpC,EAAWlnC,EAAK,EAAIolC,GACxBt8B,EAAIo+B,EAAWxtC,EAAK,EAAI0rC,GACxBe,EAAKN,EAAmB,UACxBN,EAAKM,EAAkB,QAE3B,KAAM/8B,IAAM5K,EAAI,CAGZ,IAAM6oC,IAAOW,EAET,MAAOX,IAAO/mC,EAAK,GAAKtC,EAAGsC,GAAM,GAAI6lC,GAAS6B,EAAKhuC,EAAI6d,IAI3D,KAAMwvB,EAAG,KAAOW,EAAG,GAQf,MALAhuC,GAAIguC,EAAG,IAAO1nC,EAAK,GAAKtC,EAAGsC,GAAM,GAAI6lC,GAASkB,EAAG,GAAKrtC,EAG9C,GAAN6rC,GAAW,EAAI,GAEViB,EAAWC,EAAK/sC,EAAGysC,EAAIZ,GAAO7rC,EAQ7C,GAJAqtC,EAAKA,EAAGrgB,QACR7oB,EAAIkpC,EAAGhpC,OAGFN,EAAIqL,EAAI5K,EAAI,CA2Bb,KAzBK4pC,EAAW,EAAJrqC,IACRA,GAAKA,EACL4qB,EAAI0e,EACJlpC,EAAI6pC,EAAG3pC,SAEPG,EAAI4K,EACJuf,EAAIqf,IAGD5+B,EAAInK,KAAK8E,KAAM0iC,EAAKf,IAAcvnC,IACrCA,EAAIiL,GASHrL,GAAMI,GAAK,KACZJ,EAAII,EACJwqB,EAAEtqB,OAAS,GAGfsqB,EAAEmT,UACI99B,EAAID,EAAGC,IAAK2qB,EAAErkB,KAAK,IACzBqkB,EAAEmT,cAQF,MAJKsM,EAAOjqC,GAAM+a,EAAI8uB,EAAG3pC,WACrB6a,EAAI/a,GAGFJ,EAAIC,EAAI,EAAOkb,EAAJlb,EAAOA,IAEpB,GAAKqpC,EAAGrpC,IAAMgqC,EAAGhqC,GAAK,CAClBoqC,EAAOf,EAAGrpC,GAAKgqC,EAAGhqC,EAElB,OAeZ,GATKoqC,IACDzf,EAAI0e,EAAIA,EAAKW,EAAIA,EAAKrf,EACtBroB,EAAK,GAAKA,EAAK,IAOZtC,KAASkb,EAAImuB,EAAGhpC,QAAW2pC,EAAG3pC,SAAa,EAE9C,KAAQL,IAAKqpC,EAAGnuB,KAAO,GAI3B,IAAM9P,EAAIq+B,EAAO,EAAGzpC,EAAIgqC,EAAG3pC,OAAQL,EAAID,GAAK,CAExC,GAAKspC,IAAKrpC,GAAKgqC,EAAGhqC,GAAK,CAEnB,IAAMG,EAAIH,EAAGG,IAAMkpC,IAAKlpC,GAAIkpC,EAAGlpC,GAAKiL,KAClCi+B,EAAGlpC,GACLkpC,EAAGrpC,IAAMypC,EAEbJ,EAAGrpC,IAAMgqC,EAAGhqC,GAIhB,KAAmB,GAAXqpC,IAAKnuB,GAASmuB,EAAGrY,OAGzB,KAAiB,GAATqY,EAAG,GAASA,EAAGza,UAAWpuB,GAclC,IAZM6oC,EAAG,KAGLA,GAAO7oC,EAAI,GAGX8B,EAAK,EAAU,GAANulC,EAAU,GAAK,GAG5BvlC,EAAK,EAAI+mC,EAGHtpC,EAAI,EAAGC,EAAIqpC,EAAG,GAAIrpC,GAAK,GAAIA,GAAK,GAAID,KAG1C,MAFAuC,GAAK,EAAIvC,EAAIS,EAAIknC,EAAU,EAEpBoB,EAAWC,EAAKzmC,EAAGmmC,EAAIZ,GAAOvlC,GA4BzCkJ,EAAU,OAAIA,EAAO,IAAI,SAAWlJ,EAAGtC,GACnC,GAAI8L,GAAGyhB,EACHvxB,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzBlC,EAAIquC,EAAgB,MAWxB,OATAxuC,GAAK,EACL2I,EAAI,GAAI6lC,GAAS7lC,EAAGtC,GACpBA,EAAIsC,EAAK,EACTwJ,GAAK9P,EAAK,IAAMgE,GAAKsC,EAAK,IAAMA,EAAK,EAAE,GAMlCwJ,IAAMxJ,EAAK,GAAKtG,EAAK,IAAMA,EAAK,EAAE,GAE5B8P,EACH,GAAIq8B,GAAQtuB,KACZkvB,EAAK,GAAIZ,GAAQnsC,GAAImsC,EAAmB,UAAGA,EAAkB,WAGrEW,GAAW,EAED,GAALhvC,GAIDwI,EAAK,EAAI,EACTirB,EAAItT,EAAKje,EAAGsG,EAAG,EAAG,EAAG,GACrBA,EAAK,EAAItC,EACTutB,EAAK,GAAKvtB,GAEVutB,EAAItT,EAAKje,EAAGsG,EAAG,EAAGxI,EAAG,GAGzByzB,EAAIA,EAAS,MAAEjrB,GACfwmC,GAAW,EAEJ9sC,EAAS,MAAEuxB,KAStB/hB,EAAoB,iBAAIA,EAAM,GAAI,WAE9B,MAAOwO,GAAG1gB,OASdkS,EAAW,QAAIA,EAAO,IAAI,WACtB,GAAIxP,GAAI,GAAI1C,MAAkB,YAAEA,KAGhC,OAFA0C,GAAK,GAAKA,EAAK,GAAK,KAEb+sC,EAAI/sC,IAyBfwP,EAAQ,KAAI,SAAWlJ,EAAGtC,GACtB,GAAI2qB,GACA3uB,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzB+D,EAAI/D,EAAK,CAOb,IALArC,EAAK,GACL2I,EAAI,GAAI6lC,GAAS7lC,EAAGtC,GACpBA,EAAIsC,EAAK,GAGHvC,IAAMC,EAER,MAAO,IAAImoC,GAAQtuB,IAIvB,IAAK9Z,GAAKC,EAGN,MAFAsC,GAAK,GAAKtC,EAEHhE,EAAS,MAAEsG,EAGtB,IAAI+mC,GAAKrtC,EAAK,EACVguC,EAAK1nC,EAAK,EACV9B,EAAIgpC,EAAWlnC,EAAK,EAAIolC,GACxBt8B,EAAIo+B,EAAWxtC,EAAK,EAAI0rC,GACxBe,EAAKN,EAAmB,UACxBN,EAAKM,EAAkB,QAE3B,KAAM/8B,IAAM5K,EAAI,CAGZ,IAAM6oC,IAAOW,EAGT,MAAO,IAAI7B,GAASpoC,EAAI,EAI5B,KAAMspC,EAAG,KAAOW,EAAG,GAKf,MAFAhuC,GAAIguC,EAAG,GAAK1nC,EAAI,GAAI6lC,GAASkB,EAAG,GAAKrtC,EAAQ,EAAJ+D,GAElC+oC,EAAWC,EAAK/sC,EAAGysC,EAAIZ,GAAO7rC,EAO7C,GAHAqtC,EAAKA,EAAGrgB,QAGHjpB,EAAIqL,EAAI5K,EAAI,CAsBb,IApBS,EAAJT,GACDA,GAAKA,EACL4qB,EAAI0e,EACJrpC,EAAIgqC,EAAG3pC,SAEPG,EAAI4K,EACJuf,EAAIqf,EACJhqC,EAAIqpC,EAAGhpC,SAGJ+K,EAAInK,KAAK8E,KAAM0iC,EAAKf,IAAc1nC,IACrCA,EAAIoL,GAIHrL,IAAMC,IACPD,EAAIC,EACJ2qB,EAAEtqB,OAAS,GAGTsqB,EAAEmT,UAAW/9B,IAAK4qB,EAAErkB,KAAK,IAC/BqkB,EAAEmT,UASN,IALKuL,EAAGhpC,OAAS2pC,EAAG3pC,OAAS,IACzBsqB,EAAIqf,EAAIA,EAAKX,EAAIA,EAAK1e,GAIpB5qB,EAAIiqC,EAAG3pC,OAAQL,EAAI,EAAGoL,EAAIq+B,EAAM1pC,EAAGspC,EAAGtpC,IAAMqL,EAC9CpL,GAAMqpC,IAAKtpC,GAAKspC,EAAGtpC,GAAKiqC,EAAGjqC,GAAKC,GAAMoL,EAAI,CAS9C,KANIpL,IACAqpC,EAAGxH,QAAQ7hC,KACTQ,GAIAT,EAAIspC,EAAGhpC,OAAmB,GAAXgpC,IAAKtpC,GAASspC,EAAGrY,OAOtC,IAHA1uB,EAAK,EAAI+mC,EAGHtpC,EAAI,EAAGC,EAAIqpC,EAAG,GAAIrpC,GAAK,GAAIA,GAAK,GAAID,KAG1C,MAFAuC,GAAK,EAAIvC,EAAIS,EAAIknC,EAAU,EAEpBoB,EAAWC,EAAKzmC,EAAGmmC,EAAIZ,GAAOvlC,GAUzCkJ,EAAa,UAAIA,EAAM,GAAI,SAAUQ,GACjC,GAAIF,GAAI,KACJ9P,EAAI1C,IAgBR,OAdK0S,IAAKF,GAAKE,MAAQA,GAAW,IAANA,GAAiB,IAANA,GAGnCs8B,EAAmBtsC,EAAe,YAAG,WAAYgQ,EAAG,YAAa,GAGhEhQ,EAAK,IACN8P,EAAIk9B,EAAgBhtC,EAAK,GAEpBgQ,GAAKhQ,EAAK,EAAI,EAAI8P,IACnBA,EAAI9P,EAAK,EAAI,IAId8P,GASXN,EAAS,MAAI,WACT,GAAIxP,GAAI1C,KACJ6uC,EAAUnsC,EAAe,WAE7B,OAAO+sC,GAAK,GAAIZ,GAAQnsC,GAAIA,EAAK,EAAI,EAAGmsC,EAAkB,WAgB9D38B,EAAc,WAAIA,EAAQ,KAAI,WAC1B,GAAI1R,GAAGgS,EAAG88B,EAAI7lC,EAAG8lC,EAAKle,EAClB3uB,EAAI1C,KACJS,EAAIiC,EAAK,EACT8X,EAAI9X,EAAK,EACTwE,EAAIxE,EAAK,EACTmsC,EAAUnsC,EAAe,YACzBquC,EAAO,GAAIlC,GAAQ,GAGvB,IAAW,IAANr0B,IAAY/Z,IAAMA,EAAE,GAErB,MAAO,IAAIouC,IAAUr0B,GAAS,EAAJA,KAAY/Z,GAAKA,EAAE,IAAO8f,IAAM9f,EAAIiC,EAAI,EAAI,EAqC1E,KAlCA8sC,GAAW,EAGXh1B,EAAI7S,KAAK3D,MAAOtB,GAMN,GAAL8X,GAAUA,GAAK,EAAI,GACpBhI,EAAI27B,EAAoB1tC,IAEjB+R,EAAEzL,OAASG,GAAM,GAAK,IACzBsL,GAAK,KAGTgI,EAAI7S,KAAK3D,KAAKwO,GACdtL,EAAIgpC,GAAahpC,EAAI,GAAM,IAAY,EAAJA,GAASA,EAAI,GAE3CsT,GAAK,EAAI,EACVhI,EAAI,KAAOtL,GAEXsL,EAAIgI,EAAErS,gBACNqK,EAAIA,EAAEkd,MAAO,EAAGld,EAAE+uB,QAAQ,KAAO,GAAMr6B,GAG3CuC,EAAI,GAAIolC,GAAQr8B,IAEhB/I,EAAI,GAAIolC,GAASr0B,EAAE7O,YAGvB2jC,GAAOpoC,EAAI2nC,EAAmB,WAAM,IAOhC,GAHAxd,EAAI5nB,EACJA,EAAIsnC,EAAY,MAAG1f,EAAQ,KAAG1Q,EAAKje,EAAG2uB,EAAGie,EAAK,EAAG,KAE5CnB,EAAqB9c,EAAK,GAAI3B,MAAO,EAAG4f,MACvC98B,EAAI27B,EAAqB1kC,EAAK,IAAMimB,MAAO,EAAG4f,GAAO,CAOvD,GANA98B,EAAIA,EAAEkd,MAAO4f,EAAK,EAAGA,EAAK,GAMhB,QAAL98B,IAAgB+8B,GAAY,QAAL/8B,GAiBrB,IAMIA,KAAOA,EAAEkd,MAAM,IAAqB,KAAfld,EAAExI,OAAO,MAGjCylC,EAAKhmC,EAAGvC,EAAI,EAAG,GACf1G,GAAKiJ,EAAS,MAAEA,GAAO,GAAE/G,GAG7B,OAxBA,IAAM6sC,IACFE,EAAKpe,EAAGnqB,EAAI,EAAG,GAEVmqB,EAAS,MAAEA,GAAO,GAAE3uB,IAAK,CAC1B+G,EAAI4nB,CAEJ,OAGRie,GAAM,EACNC,EAAM,EAoBlB,MAFAC,IAAW,EAEJC,EAAKhmC,EAAGvC,EAAG2nC,EAAkB,SAAGruC,IAyB3C0R,EAAS,MAAI,SAAWlJ,EAAGtC,GACvB,GAAIjG,GAAGyG,EACHxE,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzBqtC,EAAKrtC,EAAK,EACVguC,GAAOrwC,EAAK,GAAI2I,EAAI,GAAI6lC,GAAS7lC,EAAGtC,GAAKsC,EAAK,GAC9CnC,EAAIqpC,EAAWxtC,EAAK,EAAI0rC,GACxBxsB,EAAIsuB,EAAWlnC,EAAK,EAAIolC,GACxB3nC,EAAI/D,EAAK,CAOb,IALAgE,EAAIsC,EAAK,EAETA,EAAK,EAAIvC,GAAKC,EAAI,EAAI,MAGhBG,GAAQkpC,GAAOA,EAAG,MAASnuB,GAAQ8uB,GAAOA,EAAG,KAG/C,MAAO,IAAI7B,IAAUpoC,IAAMC,GAGzBqpC,IAAOA,EAAG,KAAOW,GAAMA,IAAOA,EAAG,KAAOX,EAGpCxvB,IAGCwvB,GAAOW,EAMG,EAAT1nC,EAAK,EAHLA,EAAK,EAAI,EAiBrB,KAXA9B,EAAIL,EAAI+a,EACRnb,EAAIspC,EAAGhpC,OACPL,EAAIgqC,EAAG3pC,OAEEL,EAAJD,IAGDhG,EAAIsvC,EAAIA,EAAKW,EAAIA,EAAKjwC,EACtBmhB,EAAInb,EAAGA,EAAIC,EAAGA,EAAIkb,GAGhBA,EAAInb,EAAIC,EAAGjG,KAAQmhB,IAAKnhB,EAAEuM,KAAK,IAGrC,IAAMnG,EAAIH,EAAI,EAAGG,EAAI,GAAIA,IAAM,CAG3B,IAFAH,EAAI,EAEEkb,EAAInb,EAAII,EAAG+a,EAAI/a,GACfH,EAAIjG,EAAEmhB,GAAK8uB,EAAG7pC,GAAKkpC,EAAGnuB,EAAI/a,EAAI,GAAKH,EACnCjG,EAAEmhB,KAAOlb,EAAIypC,EAAO,EACpBzpC,EAAIA,EAAIypC,EAAO,CAErB1vC,GAAEmhB,IAAOnhB,EAAEmhB,GAAKlb,GAAMypC,EAAO,EAYjC,IATIzpC,IACEQ,EACOzG,EAAE,IAGXA,EAAE60B,QAIA1T,EAAInhB,EAAEsG,QAAStG,IAAImhB,GAAInhB,EAAEi3B,OAI/B,IAHA1uB,EAAK,EAAIvI,EAGHgG,EAAI,EAAGC,EAAIjG,EAAE,GAAIiG,GAAK,GAAIA,GAAK,GAAID,KAGzC,MAFAuC,GAAK,EAAIvC,EAAIS,EAAIknC,EAAU,EAEpBoB,EAAWC,EAAKzmC,EAAG6lC,EAAmB,UAAGA,EAAkB,UAAM7lC,GAmB5EkJ,EAAmB,gBAAIA,EAAQ,KAAI,SAAW8zB,EAAIuI,GAC9C,GAAI7rC,GAAI1C,IAGR,OAFA0C,GAAI,GAAIA,GAAe,YAAEA,GAEZ,MAANsjC,GAAeiJ,EAAUvsC,EAAGsjC,EAAI,QAEnCyJ,EAAK/sC,GAAU,EAALsjC,GAAWtjC,EAAK,EAAI,EAAGisC,EAASjsC,EAAG6rC,EAAI,SADjD7rC,GAqBRwP,EAAiB,cAAI,SAAW8zB,EAAIuI,GAChC,GAAI7rC,GAAI1C,IAER,OAAO0C,GAAK,EACRoF,EAAQpF,EAAS,MAANsjC,GAAciJ,EAAUvsC,EAAGsjC,EAAI,iBAAyB,EAALA,EAAS,KACjE,MAANA,GAAc2I,EAASjsC,EAAG6rC,EAAI,iBAAmB,GACjD7rC,EAAEiJ,YAsBVuG,EAAW,QAAI,SAAW8zB,EAAIuI,GAC1B,GAAIhmC,GACA7F,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzByuB,EAAM0d,EAAkB,SACxBmC,EAAMnC,EAAkB,QAgC5B,OA9BW,OAAN7I,IACDA,EAAKiJ,EAAUvsC,EAAGsjC,EAAIz9B,EAAM,WAAc7F,EAAK,GAAW,EAALsjC,GAAW,KAChEuI,EAAKI,EAASjsC,EAAG6rC,EAAIhmC,IAIzBsmC,EAAkB,WAAOA,EAAkB,SAAI,EAAI,GAExC,MAAN7I,GAAetjC,EAAK,GAGrB6F,EAAMT,EAAQpF,EAAGsjC,EAAIuI,GAIhB7rC,EAAK,EAAI,GAAKA,EAAK,IAGdA,EAAK,EAAE,GAID6F,EAAIg5B,QAAQ,KAAO,IAC3Bh5B,EAAM,IAAMA,GAJZA,EAAMA,EAAII,QAAS,IAAK,MAVhCJ,EAAM7F,EAAEiJ,WAkBZkjC,EAAkB,SAAI1d,EACtB0d,EAAkB,SAAImC,EAEfzoC,GAwBX2J,EAAY,SAAI,SAAU8zB,EAAIuI,GAC1B,GAAI7rC,GAAI1C,IAER,KAAM0C,EAAK,EACP,MAAOA,GAAEiJ,UAGb,IAAI9E,GACA+/B,EAAQlkC,EAAK,EAAI,EACjB+P,EAAI/P,EAAe,YAAU,OAC7BuuC,EAAiBx+B,EAAkB,eACnCy+B,GAAMz+B,EAAa,UACnB0+B,GAAM1+B,EAAsB,mBAC5B4tB,EAAM39B,EAAEwF,QAAS89B,EAAIuI,GAAKriC,MAAM,KAChCklC,EAAU/Q,EAAI,GACdgR,EAAehR,EAAI,GACnBiR,EAAY1K,EAAQwK,EAAQ1hB,MAAM,GAAK0hB,EACvCtqC,EAAMwqC,EAAUvqC,MAMpB,IAJIoqC,IACStqC,EAAIqqC,EAAIA,EAAKC,EAAtBrqC,GAA0BqqC,EAAKtqC,GAG9BqqC,EAAK,GAAKpqC,EAAM,EAAI,CAIrB,IAHAD,EAAIC,EAAMoqC,GAAMA,EAChBE,EAAUE,EAAUtZ,OAAQ,EAAGnxB,GAEnBC,EAAJD,EAASA,GAAKqqC,EAClBE,GAAWH,EAAiBK,EAAUtZ,OAAQnxB,EAAGqqC,EAGhDC,GAAK,IACNC,GAAWH,EAAiBK,EAAU5hB,MAAM7oB,IAG5C+/B,IACAwK,EAAU,IAAMA,GAIxB,MAAOC,GACHD,EAAU3+B,EAAoB,mBAAQ0+B,GAAM1+B,EAAqB,mBAC/D4+B,EAAa1oC,QAAS,GAAItC,QAAQ,OAAS8qC,EAAK,OAAQ,KACxD,KAAO1+B,EAA0B,wBACjC4+B,GACFD,GAeRl/B,EAAc,WAAI,SAAUq/B,GACxB,GAAIC,GAAIC,EAAIvqC,EAAGwqC,EAAMl/B,EAAGm/B,EAAIjxC,EAAGuzB,EAC3BvxB,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzBkvC,EAAKJ,EAAK,GAAI3C,GAASA,EAAa,KACpCgD,EAAKF,EAAK,GAAI9C,GAAQ,GACtBkB,EAAKrtC,EAAK,EACV4P,EAAI,GAAIu8B,GAAQgD,EAGpB,KAAM9B,EAEF,MAAOrtC,GAAEiJ,UAkCb,KA/BAzE,EAAIoL,EAAK,EAAIo9B,EAAeK,GAAMrtC,EAAK,EAAI,EAC3C4P,EAAK,EAAE,GAAKo8B,EAAS,IAAMhuC,EAAIwG,EAAIknC,GAAY,EAAIA,EAAU1tC,EAAIA,IAGpD,MAAR6wC,MAGKlxC,EAAK,GAAImS,EAAI,GAAIq8B,GAAQ0C,IAAW,IAGrCzC,EAAat8B,EAAO,IAAEo/B,GAAM,IAAMp/B,EAAK,IAGrCq8B,EAAgB,QAAKqB,EAAW19B,EAAK,EAAI47B,GAAY57B,EAAK,EAAEzL,OAAS,KAIpEioC,EAAmBH,EAAS,kBAAmB0C,EAAM,aAAc,KAGhEA,EAAO/+B,GAAS,IAAEF,GAAK,KAGlCi/B,EAAOrqC,EAAI,EAAIoL,EAAIs/B,GAGvBpC,GAAW,EACXh9B,EAAI,GAAIq8B,GAASV,EAAoB4B,IACrCrvC,EAAImuC,EAAmB,UACvBA,EAAmB,UAAI3nC,EAAI6oC,EAAGhpC,OAASqnC,EAAU,EAG7Cna,EAAItT,EAAKnO,EAAGF,EAAG,EAAG,EAAG,GACrBm/B,EAAKD,EAAS,KAAGvd,EAAS,MAAE4d,IAEJ,GAAnBJ,EAAQ,IAAEF,IAIfC,EAAKK,EACLA,EAAKJ,EAELG,EAAKD,EAAS,KAAG1d,EAAS,MAAGwd,EAAKG,IAClCD,EAAKF,EAELn/B,EAAIE,EAAS,MAAGyhB,EAAS,MAAGwd,EAAKn/B,IACjCE,EAAIi/B,CAiBR,OAdAA,GAAK9wB,EAAK4wB,EAAY,MAAEC,GAAKK,EAAI,EAAG,EAAG,GACvCF,EAAKA,EAAS,KAAGF,EAAU,MAAEG,IAC7BJ,EAAKA,EAAS,KAAGC,EAAU,MAAEI,IAC7BF,EAAM,EAAIC,EAAM,EAAIlvC,EAAK,EAGzBgvC,EAAO/wB,EAAKixB,EAAIC,EAAI3qC,EAAG,GAAW,MAAExE,GAAQ,MAAS,IAC9Cie,EAAKgxB,EAAIH,EAAItqC,EAAG,GAAW,MAAExE,GAAQ,OAAQ,GAC9CkvC,EAAK,GAAIC,EAAK,KACdF,EAAK,GAAIH,EAAK,IAEpBhC,GAAW,EACXX,EAAmB,UAAInuC,EAEhBgxC,GA2BXx/B,EAAa,UAAI,SAAWM,EAAG+7B,GAC3B,GAAI7rC,GAAI1C,KACJ6uC,EAAUnsC,EAAe,WAuC7B,OArCAA,GAAI,GAAImsC,GAAQnsC,GAEN,MAAL8P,GACDA,EAAI,GAAIq8B,GAASA,EAAa,KAC9BN,EAAKM,EAAkB,WAEvBxuC,EAAK,GACLmS,EAAI,GAAIq8B,GAAQr8B,GAChB+7B,EAAKI,EAASjsC,EAAG6rC,EAAI,cAIpB/7B,EAAK,EAGD9P,EAAK,IAED8P,EAAK,EAAE,IACRg9B,GAAW,EACX9sC,EAAIie,EAAKje,EAAG8P,EAAG,EAAQ,EAAL+7B,GAAU,EAAG,EAAG,EAAG,GAAGA,GAAMA,EAAI,GAAW,MAAE/7B,GAC/Dg9B,GAAW,EACXC,EAAI/sC,IAEJA,EAAK,GAAMA,EAAK,EAAI,IAKpBA,EAAK,IAGR8P,EAAK,IACNA,EAAK,EAAI9P,EAAK,GAElBA,EAAI8P,GAGD9P,GAQXwP,EAAY,SAAI,WACZ,GAAIxP,GAAI1C,IAGR,QAAQ0C,IAAOA,EAAK,EAAI,EAAIA,EAAK,EAAI6d,MAmDzCrO,EAAW,QAAIA,EAAO,IAAI,SAAWlJ,EAAGtC,GACpC,GAAID,GAAGS,EAAGsL,EAAG/I,EACT/G,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzB8X,EAAI9X,EAAK,EACTovC,GAAQzxC,EAAK,KAAI2I,EAAI,GAAI6lC,GAAS7lC,EAAGtC,KACrCG,EAAS,EAALirC,GAAUA,EAAKA,EACnB3C,EAAKN,EAAmB,UACxBN,EAAKM,EAAkB,QAG3B,KAAMnsC,EAAK,IAAMsG,EAAK,IAAOwJ,GAAK9P,EAAK,EAAE,MAASsG,EAAK,EAAE,GAGrD,MAAO,IAAI6lC,GAASH,EAASl8B,EAAQ,EAAJgI,GAAS9X,EAAGovC,GAOjD,IAJApvC,EAAI,GAAImsC,GAAQnsC,GAChB+D,EAAI/D,EAAK,EAAEqE,QAGLrE,EAAK,GAAKA,EAAK,EAAE,IAAMA,EAAK,GAAU,GAAL+D,EAEnC,MAAO/D,EAMX,IAHAgE,EAAIsC,EAAK,EAAEjC,OAAS,EAGdiC,EAAK,GAAKA,EAAK,EAAE,IAAMA,EAAK,GAAMtC,EAOpC,GAJAQ,EAAIgpC,EAAWlnC,EAAK,EAAIolC,GACxB57B,EAAItL,GAAKR,GAGH8L,GAAS,EAAJgI,EACP/Q,EAAI,GAAIolC,GAAQtuB,SACb,CAMH,GAAK/N,GAAuBi+B,EAAlBhqC,EAAI2nC,EAAUvnC,GAGpB,GAFA4C,EAAImmC,EAAQf,EAASnsC,EAAGmE,GAEnBmC,EAAK,EAAI,EAEV,MAAO6lC,GAAa,IAAO,IAAEplC,OAE9B,CAqBH,GAlBA+Q,EAAQ,EAAJA,GAAsC,EAA7BxR,EAAK,EAAGrB,KAAKxC,IAAK+B,EAAGR,IAAY,GAAK,EAEnDA,EAAIgoC,GAAUhsC,EAAGovC,GAQjB5qC,EAAS,GAALR,GAAWuC,SAASvC,GAGpB,GAAImoC,GAASnoC,EAAI,IAAQ,EAFzBwpC,EAAW4B,GAAOnqC,KAAK9D,IAAK,KAAOsqC,EAAqBzrC,EAAK,IAC7DiF,KAAK4J,KAAO7O,EAAK,EAAI,IAMpBwE,EAAI2nC,EAAc,KAAI,GAAK3nC,EAAI2nC,EAAc,KAAI,EAElD,MAAO,IAAIA,GAAS3nC,EAAI,EAAIsT,EAAI,EAAI,EAGxCg1B,IAAW,EACXX,EAAkB,SAAInsC,EAAK,EAAI,EAS/BmE,EAAIc,KAAKjD,IAAK,IAAMwC,EAAI,IAAKH,QAG7B0C,EAAI7F,EAAKoF,EAAS,MAAG0X,EAAIhe,EAAGysC,EAAKtoC,IAAOsoC,GAGxC1lC,EAAIgmC,EAAKhmC,EAAG0lC,EAAK,EAAG,GAMfb,EAAqB7kC,EAAK,EAAG0lC,EAAIZ,KAClCrnC,EAAIioC,EAAK,GAGT1lC,EAAIgmC,EAAK7rC,EAAKoF,EAAS,MAAG0X,EAAIhe,EAAGwE,EAAIL,IAAOK,GAAKA,EAAI,EAAG,IAMlDinC,EAAqB1kC,EAAK,GAAIimB,MAAOyf,EAAK,EAAGA,EAAK,IAAO,GAAK,OAChE1lC,EAAIgmC,EAAKhmC,EAAG0lC,EAAK,EAAG,KAI5B1lC,EAAK,EAAI+Q,EACTg1B,GAAW,EACXX,EAAkB,SAAIN;CAG1B9kC,EAAIgmC,EAAKhmC,EAAG0lC,EAAIZ,OAzFpB9kC,GAAIgmC,EAAK/sC,EAAGysC,EAAIZ,EA6FpB,OAAO9kC,IAuBXyI,EAAe,YAAI,SAAWo9B,EAAIf,GAC9B,GAAI7rC,GAAI1C,IAER,OAAa,OAANsvC,GAAcL,EAAUvsC,EAAG4sC,EAAI,cAAe,IAAO5sC,EAAK,EAC7DoF,EAAQpF,EAAU,IAAL4sC,EAAQX,EAASjsC,EAAG6rC,EAAI,eAAiB,GACtD7rC,EAAEiJ,YAiBVuG,EAAuB,oBAAIA,EAAQ,KAAI,SAAWI,EAAGi8B,GACjD,GAAI7rC,GAAI1C,KACJ6uC,EAAUnsC,EAAe,WAI7B,OAFAA,GAAI,GAAImsC,GAAQnsC,GAEJ,MAAL4P,GAAc28B,EAAUvsC,EAAG4P,EAAG,OAAQ,GAEzCm9B,EAAK/sC,EAAO,EAAJ4P,EAAOq8B,EAASjsC,EAAG6rC,EAAI,SAD/BkB,EAAK/sC,EAAGmsC,EAAmB,UAAGA,EAAkB,WAiBvD38B,EAAY,SAAI,SAAUxL,GACvB,GAAI6L,GAAGhK,EAAK+7B,EACR5hC,EAAI1C,KACJ6uC,EAAUnsC,EAAe,YACzB2hC,EAAK3hC,EAAK,CAGd,IAAY,OAAP2hC,EACD97B,EAAM7F,EAAK,EAAI,WAAa,UAGzB,CAAA,GAAKgE,IAAM6L,IAAO8xB,GAAMwK,EAAkB,UAAKxK,GAAMwK,EAAkB,UAE1E,MAAO/mC,GAAQpF,EAAG,KAAMmsC,EAAkB,SAAG,EAK7C,IAHAtmC,EAAM4lC,EAAqBzrC,EAAK,GAGtB,EAAL2hC,EAAS,CAGV,OAAUA,EAAI97B,EAAM,IAAMA,GAC1BA,EAAM,KAAOA,MAGV,IAAK+7B,EAAO/7B,EAAIxB,OAAQs9B,EAAK,EAEhC,KAAOA,EAAKC,EAGR,IAAMD,GAAMC,EAAMD,IAAO97B,GAAO,SAEnB+7B,GAALD,IACR97B,EAAMA,EAAImnB,MAAO,EAAG2U,GAAO,IAAM97B,EAAImnB,MAAM2U,QAO/C,IAFA9xB,EAAIhK,EAAIyB,OAAO,GAEVs6B,EAAO,EACR/7B,EAAMgK,EAAI,IAAMhK,EAAImnB,MAAM,OAGvB,IAAU,KAALnd,EAER,MAAOA,EAIf,IAAU,MAAL7L,EAED,IAAQooC,IAAgBpoC,GAAK,GAAS,GAAJA,KAC9BA,IAAU,EAAJA,IAAWmoC,EAAgB,OAYjCG,EAAmBH,EAAS,OAAQnoC,EAAG,WAAY,OARnD,IAHA6B,EAAM6nC,EAAavB,EAAStmC,EAAS,EAAJ7B,EAAO,GAAIhE,EAAK,GAGrC,KAAP6F,EAED,MAAOA,GAWvB,MAAO7F,GAAK,EAAI,EAAI,IAAM6F,EAAMA,GAQpC2J,EAAa,UAAIA,EAAS,MAAI,WAE1B,MAAOu9B,GAAK,GAAIzvC,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAU9DkS,EAAW,QAAIA,EAAU,OAAI,WAEzB,MAAOlS,MAAK2L,YAuKhBykC,EAAc,WAOV,QAAS2B,GAAWxpC,EAAKypC,EAAQC,GAO7B,IANA,GAAIrwB,GAEA2iB,EADAlE,GAAO,GAEPx5B,EAAI,EACJy9B,EAAO/7B,EAAIxB,OAEHu9B,EAAJz9B,GAAY,CAChB,IAAM09B,EAAOlE,EAAIt5B,OAAQw9B,IAAQlE,EAAIkE,IAASyN,GAG9C,IAFA3R,EAAKze,EAAI,IAAO2uB,EAAShP,QAASh5B,EAAIyB,OAAQnD,MAEtC+a,EAAIye,EAAIt5B,OAAQ6a,IAEfye,EAAIze,GAAKqwB,EAAU,IAED,MAAd5R,EAAIze,EAAI,KACTye,EAAIze,EAAI,GAAK,GAEjBye,EAAIze,EAAI,IAAMye,EAAIze,GAAKqwB,EAAU,EACjC5R,EAAIze,IAAMqwB,GAKtB,MAAO5R,GAAImE,UAGf,MAAO,UAAWqK,EAAStmC,EAAK0pC,EAASD,EAAQnqC,GAC7C,GAAIX,GAAG0a,EAAGnY,EAAG/G,EAAGqtC,EAAI/mC,EAChBnC,EAAI0B,EAAIg5B,QAAS,KACjB4N,EAAKN,EAAmB,UACxBN,EAAKM,EAAkB,QA0B3B,KAxBc,GAATmD,IACDzpC,EAAMA,EAAIusB,eAITjuB,GAAK,IACN0B,EAAMA,EAAII,QAAS,IAAK,IACxBK,EAAI,GAAI6lC,GAAQmD,GAChBtvC,EAAIktC,EAAQf,EAAS7lC,EAAGT,EAAIxB,OAASF,GAOrCmC,EAAK,EAAI+oC,EAAWrvC,EAAEwF,UAAW,GAAI+pC,GACrCjpC,EAAK,EAAIA,EAAK,EAAEjC,QAIpBgpC,EAAKgC,EAAWxpC,EAAKypC,EAAQC,GAC7B/qC,EAAI0a,EAAImuB,EAAGhpC,OAGQ,GAAXgpC,IAAKnuB,GAASmuB,EAAGrY,OAEzB,IAAMqY,EAAG,GAEL,MAAO,GAsBX,IAnBS,EAAJlpC,EACDK,KAEAxE,EAAK,EAAIqtC,EACTrtC,EAAK,EAAIwE,EAGTxE,EAAK,EAAImF,EACTnF,EAAIie,EAAKje,EAAGsG,EAAGmmC,EAAIZ,EAAI,EAAG0D,GAC1BlC,EAAKrtC,EAAK,EACV+G,EAAI/G,EAAK,EACTwE,EAAIxE,EAAK,GAIbmE,EAAIkpC,EAAGZ,GACPvtB,EAAIqwB,EAAU,EACdxoC,EAAIA,GAAmB,MAAdsmC,EAAGZ,EAAK,GAEP,EAALZ,GACM,MAAL1nC,GAAa4C,KAAe,GAAN8kC,GAAWA,IAAQ7rC,EAAK,EAAI,EAAI,EAAI,IAC5DmE,EAAI+a,GAAK/a,GAAK+a,IAAa,GAAN2sB,GAAW9kC,GAAW,GAAN8kC,GAAwB,EAAbwB,EAAGZ,EAAK,IACxDZ,IAAQ7rC,EAAK,EAAI,EAAI,EAAI,IAKzB,IAHAqtC,EAAGhpC,OAASooC,IAGJ8C,IAAWlC,IAAKZ,GAAM8C,GAC1BlC,EAAGZ,GAAM,EAEHA,MACAjoC,EACF6oC,EAAGxH,QAAQ,QAInBwH,GAAGhpC,OAASooC,CAIhB,KAAMvtB,EAAImuB,EAAGhpC,QAASgpC,IAAKnuB,KAG3B,IAAM/a,EAAI,EAAG0B,EAAM,GAASqZ,GAAL/a,EAAQ0B,GAAOgoC,EAASvmC,OAAQ+lC,EAAGlpC,OAG1D,GAAS,EAAJK,EAAQ,CAGT,OAAUA,EAAGqB,EAAM,IAAMA,GAEzBA,EAAM,KAAOA,MAMb,IAFA1B,EAAI0B,EAAIxB,SAEDG,EAAIL,EAGP,IAAMK,GAAKL,EAAGK,IAAMqB,GAAO,SAEf1B,GAAJK,IACRqB,EAAMA,EAAImnB,MAAO,EAAGxoB,GAAM,IAAMqB,EAAImnB,MAAMxoB,GAKlD,OAAOqB,MAQf,IAAIoY,GAAM,WAGN,QAASuxB,GAAiBxvC,EAAGoP,EAAGd,GAC5B,GAAI4lB,GACAub,EAAQ,EACRtrC,EAAInE,EAAEqE,MAEV,KAAMrE,EAAIA,EAAEgtB,QAAS7oB,KACjB+vB,EAAOl0B,EAAEmE,GAAKiL,EAAIqgC,EAClBzvC,EAAEmE,GAAK+vB,EAAO5lB,EAAO,EACrBmhC,EAAQvb,EAAO5lB,EAAO,CAO1B,OAJImhC,IACAzvC,EAAE6lC,QAAQ4J,GAGPzvC,EAGX,QAASmqB,GAASpmB,EAAGC,EAAG0rC,EAAIC,GACxB,GAAIxrC,GAAGgtB,CAEP,IAAKue,GAAMC,EACPxe,EAAMue,EAAKC,EAAK,EAAI,OAGpB,KAAMxrC,EAAIgtB,EAAM,EAAOue,EAAJvrC,EAAQA,IAEvB,GAAKJ,EAAEI,IAAMH,EAAEG,GAAK,CAChBgtB,EAAMptB,EAAEI,GAAKH,EAAEG,GAAK,EAAI,EAExB,OAKZ,MAAOgtB,GAGX,QAAS5vB,GAAUwC,EAAGC,EAAG0rC,EAAIphC,GAIzB,IAHA,GAAInK,GAAI,EAGAurC,KACJ3rC,EAAE2rC,IAAOvrC,EACTA,EAAIJ,EAAE2rC,GAAM1rC,EAAE0rC,GAAM,EAAI,EACxB3rC,EAAE2rC,GAAMvrC,EAAImK,EAAOvK,EAAE2rC,GAAM1rC,EAAE0rC,EAIjC,OAAS3rC,EAAE,IAAMA,EAAEM,OAAS,EAAGN,EAAE6uB,UAIrC,MAAO,UAAW5yB,EAAGsG,EAAGmmC,EAAIZ,EAAIvI,EAAIh1B,GAChC,GAAI6iB,GAAK3sB,EAAGL,EAAGyrC,EAAS3C,EAAMn9B,EAAG0a,EAAMqlB,EAAOte,EAAGue,EAAIC,EAAKC,EAAMC,EAAMthB,EAAGuhB,EAAIC,EAAIC,EAC7EC,EAAIC,EACJnE,EAAUnsC,EAAe,YACzB8X,EAAI9X,EAAK,GAAKsG,EAAK,EAAI,EAAI,GAC3B+mC,EAAKrtC,EAAK,EACVguC,EAAK1nC,EAAK,CAGd,MAAM+mC,GAAOA,EAAG,IAAOW,GAAOA,EAAG,IAE7B,MAAO,IAAI7B,GAGRnsC,EAAK,GAAMsG,EAAK,IAAO+mC,GAAKW,GAAMX,EAAG,IAAMW,EAAG,GAAMA,GAGnDX,GAAe,GAATA,EAAG,KAAYW,EAAS,EAAJl2B,EAAQA,EAAI,EAHoB+F,IAuBlE,KAhBIvP,GACAshC,EAAU,EACVprC,EAAIxE,EAAK,EAAIsG,EAAK,IAElBgI,EAAOm/B,EACPmC,EAAUlE,EACVlnC,EAAIgpC,EAAWxtC,EAAK,EAAI4vC,GAAYpC,EAAWlnC,EAAK,EAAIspC,IAG5DS,EAAKrC,EAAG3pC,OACR8rC,EAAK9C,EAAGhpC,OACRktB,EAAI,GAAI4a,GAAQr0B,GAChBg4B,EAAKve,EAAK,KAIJptB,EAAI,EAAG6pC,EAAG7pC,KAAQkpC,EAAGlpC,IAAM,GAAKA,KAetC,GAbK6pC,EAAG7pC,IAAOkpC,EAAGlpC,IAAM,IACpBK,IAGO,MAANioC,GACD30B,EAAI20B,EAAKN,EAAmB,UAC5BN,EAAKM,EAAkB,UAEvBr0B,EADOwrB,EACHmJ,GAAOzsC,EAAK,EAAIsG,EAAK,GAAM,EAE3BmmC,EAGC,EAAJ30B,EACDg4B,EAAGxlC,KAAK,GACR2iC,GAAO,MACJ,CAOH,GAJAn1B,EAAIA,EAAI83B,EAAU,EAAI,EACtBzrC,EAAI,EAGO,GAANksC,EAAU,CAMX,IALAvgC,EAAI,EACJk+B,EAAKA,EAAG,GACRl2B,KAGcq4B,EAAJhsC,GAAU2L,IAAOgI,IAAK3T,IAC5BwqB,EAAI7e,EAAIxB,GAAS++B,EAAGlpC,IAAM,GAC1B2rC,EAAG3rC,GAAKwqB,EAAIqf,EAAK,EACjBl+B,EAAI6e,EAAIqf,EAAK,CAGjBf,GAAOn9B,GAASqgC,EAAJhsC,MAGT,CAiBH,IAdA2L,EAAIxB,GAAS0/B,EAAG,GAAK,GAAM,EAEtBl+B,EAAI,IACLk+B,EAAKwB,EAAiBxB,EAAIl+B,EAAGxB,GAC7B++B,EAAKmC,EAAiBnC,EAAIv9B,EAAGxB,GAC7B+hC,EAAKrC,EAAG3pC,OACR8rC,EAAK9C,EAAGhpC,QAGZ6rC,EAAKG,EACLN,EAAM1C,EAAGrgB,MAAO,EAAGqjB,GACnBL,EAAOD,EAAI1rC,OAGIgsC,EAAPL,EAAWD,EAAIC,KAAU,GAEjCM,EAAKtC,EAAGhhB,QACRsjB,EAAGzK,QAAQ,GACXuK,EAAMpC,EAAG,GAEJA,EAAG,IAAM1/B,EAAO,GACjB8hC,GAGJ,GACItgC,GAAI,EAGJqhB,EAAMhH,EAAS6jB,EAAI+B,EAAKM,EAAIL,GAGjB,EAAN7e,GAGD8e,EAAOF,EAAI,GAENM,GAAML,IACPC,EAAOA,EAAO3hC,GAASyhC,EAAI,IAAM,IAIrCjgC,EAAImgC,EAAOG,EAAM,EAYZtgC,EAAI,GAEAA,GAAKxB,IACNwB,EAAIxB,EAAO,GAIfkc,EAAOglB,EAAiBxB,EAAIl+B,EAAGxB,GAC/BuhC,EAAQrlB,EAAKnmB,OACb2rC,EAAOD,EAAI1rC,OAGX8sB,EAAMhH,EAASK,EAAMulB,EAAKF,EAAOG,GAGrB,GAAP7e,IACDrhB,IAGAvO,EAAUipB,EAAWqlB,EAALQ,EAAaC,EAAKtC,EAAI6B,EAAOvhC,MAOvC,GAALwB,IACDqhB,EAAMrhB,EAAI,GAEd0a,EAAOwjB,EAAGhhB,SAEd6iB,EAAQrlB,EAAKnmB,OAEA2rC,EAARH,GACDrlB,EAAKqb,QAAQ,GAIjBtkC,EAAUwuC,EAAKvlB,EAAMwlB,EAAM1hC,GAGf,IAAP6iB,IACD6e,EAAOD,EAAI1rC,OAGX8sB,EAAMhH,EAAS6jB,EAAI+B,EAAKM,EAAIL,GAGjB,EAAN7e,IACDrhB,IAGAvO,EAAUwuC,EAAUC,EAALK,EAAYC,EAAKtC,EAAIgC,EAAM1hC,KAIlD0hC,EAAOD,EAAI1rC,QAEK,IAAR8sB,IACRrhB,IACAigC,GAAO,IAIXD,EAAG3rC,KAAO2L,EAGLqhB,GAAO4e,EAAI,GACZA,EAAIC,KAAU3C,EAAG6C,IAAO,GAExBH,GAAQ1C,EAAG6C,IACXF,EAAO,UAGHE,IAAOC,GAAgB,MAAVJ,EAAI,KAAgBj4B,IAE7Cm1B,GAAiB,MAAV8C,EAAI,GAITD,EAAG,IACLA,EAAGld,QAKX,GAAgB,GAAXgd,EACDre,EAAK,EAAI/sB,EACT+sB,EAAK,GAAK0b,MACP,CAGH,IAAM9oC,EAAI,EAAG2T,EAAIg4B,EAAG,GAAIh4B,GAAK,GAAIA,GAAK,GAAI3T,KAC1CotB,EAAK,EAAIptB,EAAIK,EAAIorC,EAAU,EAE3B7C,EAAKxb,EAAG+R,EAAKmJ,EAAKlb,EAAK,EAAI,EAAIkb,EAAIZ,EAAIoB,GAG3C,MAAO1b,MAyoBfoc,GAAU,WA+GN,QAASzvC,GAAO+L,GACZ,GAAIjM,GAAG6R,EAAGigB,EACNqc,EAAU7uC,KACVS,EAAI,SACJ2C,EAAQyrC,EAAgB,OAAIE,SAAWrmC,UAE3C,OAAKiE,IAAO4F,GAAmB,gBAAP5F,KAErBqiC,EAAmBH,EAAS,kBAAmBliC,EAAKlM,GAE5CouC,IAIJrc,EAAI7lB,EAAKjM,EAAI,eAAmB6R,KAE3Bu8B,EAAiB,EAAJtc,GAASA,EAAI0c,IAAgB9rC,EAAMovB,IAAMA,EAM1Dwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAS,EAAJ8xB,IAUdA,EAAI7lB,EAAKjM,EAAI,cAAkB6R,KAE1Bu8B,EAAiB,EAAJtc,GAASA,EAAI,IAAOpvB,EAAMovB,IAAMA,EAMjDwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAS,EAAJ8xB,IAUdA,EAAI7lB,EAAKjM,EAAI,cAAkB6R,KAE1Bu8B,GAAkB0B,EAALhe,GAAkBA,EAAI,IAAOpvB,EAAMovB,IAAMA,EAM1Dwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAKwvC,EAAU1d,KAUxBA,EAAI7lB,EAAKjM,EAAI,cAAkB6R,KAE1Bu8B,EAAiB,EAAJtc,GAASA,EAAIge,IAAeptC,EAAMovB,IAAMA,EAMzDwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAKwvC,EAAU1d,KAUxBA,EAAI7lB,EAAKjM,EAAI,UAAc6R,KAEtBu8B,GAAkB0B,EAALhe,GAAkBA,EAAI,IAAOpvB,EAAMovB,IAAMA,EAM1Dwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAKwvC,EAAU1d,KAUxBA,EAAI7lB,EAAKjM,EAAI,UAAc6R,KAEtBu8B,EAAiB,EAAJtc,GAASA,EAAIge,IAAeptC,EAAMovB,IAAMA,EAMzDwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAKwvC,EAAU1d,KAUxBA,EAAI7lB,EAAKjM,EAAI,YAAgB6R,IAE3BigB,MAAQA,GAAW,IAANA,GAAiB,IAANA,GACzBsc,EAAazuC,EAAK,EAClBwuC,EAAQnuC,KAAO8xB,GAIfwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,KAKtC+xB,EAAI7lB,EAAKjM,EAAI,YAAgB6R,IAE3BigB,MAAQA,GAAW,IAANA,GAAiB,IAANA,EACzBqc,EAAQnuC,MAAS8xB,IAAK8d,GAA2B,gBAAVA,IAIvCtB,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,KAKtC+xB,EAAI7lB,EAAKjM,EAAI,YAAgB6R,KAExBu8B,EAAiB,EAAJtc,GAASA,EAAI,IAAOpvB,EAAMovB,IAAMA,EAMjDwc,EAAmBH,EAASnuC,EAAG8xB,EAAG/xB,EAAG,GALrCouC,EAAQnuC,GAAS,EAAJ8xB,IAUd7lB,EAAMA,EAAKjM,EAAI,YAAgB6R,IAEf,gBAAP5F,GACRkiC,EAAQnuC,GAAKiM,EAIbqiC,EAAmBH,EAAS,yBAA0BliC,EAAKlM,IAI5DouC,GAmBX,QAASjrC,GAAI4O,GAAK,MAAO,IAAIxS,MAAKwS,GAAQ,MAkB1C,QAASkO,GAAGlO,GAAK,MAAO,IAAIxS,MAAKwS,GAAO,KAaxC,QAAS3O,GAAKnB,EAAGsG,GAAM,MAAO,IAAIhJ,MAAK0C,GAAQ,IAAEsG,GAMjD,QAASiqC,GAAUpE,EAAS5iC,EAAMinC,GAC9B,GAAI1yC,GAAGgS,EACH3L,EAAI,CAQR,KANiC,kBAA5B8E,EAASpL,KAAM0L,EAAK,MACrBA,EAAOA,EAAK,IAGhBzL,EAAI,GAAIquC,GAAS5iC,EAAK,MAEZpF,EAAIoF,EAAKlF,QAAU,CAGzB,GAFAyL,EAAI,GAAIq8B,GAAS5iC,EAAKpF,KAEhB2L,EAAK,EAAI,CACXhS,EAAIgS,CAEJ,OACQhS,EAAE0yC,GAAM1gC,KAChBhS,EAAIgS,GAIZ,MAAOhS,GAUX,QAAS2E,KAAQ,MAAO8tC,GAAUjzC,KAAM4I,UAAW,MASnD,QAASlE,KAAQ,MAAOuuC,GAAUjzC,KAAM4I,UAAW,MAyNnD,QAAS7E,GAAKrB,EAAGsG,GAAM,MAAO,IAAIhJ,MAAK0C,GAAQ,IAAEsG,GAWjD,QAAS2jB,GAAOqZ,GACZ,GAAIv/B,GAAG+L,EAAGggB,EACN3rB,EAAI,EACJ4C,KACAolC,EAAU7uC,KACVmzC,EAAO,GAAItE,GAASA,EAAa,IAUrC,IARW,MAAN7I,GAAeiJ,EAAUkE,EAAMnN,EAAI,UAGpCA,GAAM,EAFNA,EAAK6I,EAAmB,UAK5Br8B,EAAI7K,KAAK8E,KAAMu5B,EAAKoI,GAEfS,EAAgB,OAGjB,GAAKyB,GAAUA,EAAwB,gBAInC,IAFA7pC,EAAI6pC,EAAwB,gBAAG,GAAI8C,aAAY5gC,IAEnCA,EAAJ3L,GACJ2rB,EAAI/rB,EAAEI,GAID2rB,GAAK,MAEN/rB,EAAEI,GAAKypC,EAAwB,gBAAG,GAAI8C,aAAY,IAAK,GAKvD3pC,EAAE5C,KAAO2rB,EAAI,QAKlB,IAAK8d,GAAUA,EAAoB,YAAI,CAK1C,IAFA7pC,EAAI6pC,EAAoB,YAAG99B,GAAK,GAEpBA,EAAJ3L,GAGJ2rB,EAAI/rB,EAAEI,IAAOJ,EAAEI,EAAI,IAAM,IAAQJ,EAAEI,EAAI,IAAM,MAC1B,IAAXJ,EAAEI,EAAI,KAAe,IAGxB2rB,GAAK,MACN8d,EAAoB,YAAE,GAAG+C,KAAM5sC,EAAGI,IAKlC4C,EAAEuD,KAAMwlB,EAAI,KACZ3rB,GAAK,EAGbA,GAAI2L,EAAI,MAGRw8B,GAAmBH,EAAS,qBAAsByB,EAAQ,SAKlE,KAAKzpC,EAED,KAAY2L,EAAJ3L,GACJ4C,EAAE5C,KAAuB,IAAhBc,KAAKglB,SAAiB,CAcvC,KAVAna,EAAI/I,IAAI5C,GACRm/B,GAAMoI,EAGD57B,GAAKwzB,IACNxT,EAAIkc,EAAS,GAAIN,EAAUpI,GAC3Bv8B,EAAE5C,IAAO2L,EAAIggB,EAAI,GAAMA,GAIV,IAAT/oB,EAAE5C,GAAUA,IAChB4C,EAAEiuB,KAIN,IAAS,EAAJ7wB,EACD4C,GAAM+I,EAAI,OACP,CAIH,IAHAA,EAAI,GAGa,IAAT/I,EAAE,IACNA,EAAE6rB,QACF9iB,GAAK47B,CAIT,KAAMvnC,EAAI,EAAG2rB,EAAI/oB,EAAE,GAAI+oB,GAAK,IACxBA,GAAK,GACL3rB,GAIKunC,GAAJvnC,IACD2L,GAAK47B,EAAUvnC,GAOvB,MAHAssC,GAAQ,EAAI3gC,EACZ2gC,EAAQ,EAAI1pC,EAEL0pC,EAkCX,QAASnvC,GAAKwO,GAAK,MAAO,IAAIxS,MAAKwS,GAAS,OAyB5C,QAAS8gC,GAAe3mC,GAUpB,QAASkiC,GAASr8B,EAAG9L,GACjB,GAAIhE,GAAI1C,IAGR,MAAQ0C,YAAamsC,IAGjB,MAFAG,GAAmBH,EAAS,6BAA8Br8B,GAEnD,GAAIq8B,GAASr8B,EAAG9L,EAQ3B,IAHAhE,EAAe,YAAImsC,EAGdr8B,YAAaq8B,GAAU,CAExB,GAAU,MAALnoC,EAMD,MALArG,GAAK,EACLqC,EAAK,EAAI8P,EAAK,EACd9P,EAAK,EAAI8P,EAAK,EACd9P,EAAK,GAAM8P,EAAIA,EAAK,GAAMA,EAAEkd,QAAUld,EAE/B9P,CACJ,IAAU,IAALgE,EAER,MAAO+oC,GAAK,GAAIZ,GAAQr8B,GAAIq8B,EAAmB,UAAGA,EAAkB,SAEpEr8B,IAAK,GAIb,MAAO+gC,GAAc1E,EAASnsC,EAAG8P,EAAG9L,GAiJxC,MAjIAmoC,GAAmB,UAAI,GAmBvBA,EAAkB,SAAI,EAoBtBA,EAAgB,OAAI,EAIpBA,EAAkB,SAAI,GAItBA,EAAkB,SAAI,GAItBA,EAAc,MAAK2B,EAInB3B,EAAc,KAAI2B,EAGlB3B,EAAgB,QAAI,EAGpBA,EAAgB,QAAI,EAGpBA,EAAQ/mC,QACJ0rC,iBAAkB,IAClBvC,eAAgB,IAChBwC,UAAW,EACXC,mBAAoB,EACpBC,uBAAwB,IACxBC,kBAAmB,GAOvB/E,EAAQzjC,UAAY8G,EAEpB28B,EAAa,IAAI,GAAIA,GAAQ,GAS7BA,EAAkB,SAAI,EACtBA,EAAoB,WAAI,EACxBA,EAAoB,WAAI,EACxBA,EAAqB,YAAI,EACzBA,EAAuB,cAAI,EAC3BA,EAAyB,gBAAI,EAC7BA,EAAyB,gBAAI,EAC7BA,EAAyB,gBAAI,EAC7BA,EAA0B,iBAAI,EAG9BA,EAAgB,OAAI,EAepBA,EAAgB,OAAIjuC,EACpBiuC,EAAqB,YAAIyE,EACzBzE,EAAa,IAAIjrC,EACjBirC,EAAY,GAAInuB,EAChBmuB,EAAa,IAAIhrC,EACjBgrC,EAAa,IAAI1pC,EACjB0pC,EAAa,IAAInqC,EACjBmqC,EAAa,IAAI9qC,EACjB8qC,EAAc,KAAI7qC,EAClB6qC,EAAgB,OAAIliB,EAER,MAAPhgB,GACDkiC,EAAgB,OAAEliC,GAGfkiC,EAzkBX,GAAI0E,GAAe,WACf,GAAIM,GAAU,uCACVpU,EAAOv5B,OAAOkF,UAAUq0B,MACtB,WAAc,MAAOz/B,MAAK2I,QAAQ,aAAc,IAEtD,OAAO,UAAWkmC,EAASnsC,EAAG8P,EAAG9L,GAC7B,GAAI4L,GAAGpL,EAAGL,EAAGitC,EAAOC,EAAM3uB,CAU1B,IARiB,gBAAL5S,KAGRA,GAAMshC,EAAoB,gBAALthC,IAAqC,mBAApB7G,EAASpL,KAAKiS,KAC1C,IAANA,GAAmB,EAAR,EAAIA,EAAQ,KAAOA,EAAI,IAE1CuhC,EAAOvhC,EAEG,MAAL9L,GAAamtC,EAAQ9kB,KAAKvc,GAG3B9P,EAAK,EAAwB,KAApB8P,EAAE67B,WAAW,IAAc77B,EAAIA,EAAEkd,MAAM,GAAI,IAAO,MAGxD,CAMH,GAAU,IAALhpB,EAED,MAAO+oC,GAAK,GAAIZ,GAAQr8B,GAAIq8B,EAAmB,UAAGA,EAAkB,SAoDxE,IAjDAr8B,EAAIitB,EAAKl/B,KAAKiS,GAAG7J,QAAS,WAAY,IAEtCjG,EAAK,EAAwB,KAApB8P,EAAE67B,WAAW,IAAc77B,EAAIA,EAAE7J,QAAS,UAAW,IAAM,IAAO,EAEjE,MAALjC,EAEMA,IAAU,EAAJA,IAAWmoC,EAAgB,SACnCC,IAAgBpoC,GAAK,GAAS,GAAJA,KAiC3BsoC,EAAmBH,EAAS,OAAQnoC,EAAG,EAAG,GAG1C0e,EAAQyuB,EAAQ9kB,KAAKvc,KAnCrBF,EAAI,IAAMi+B,EAAS7gB,MAAO,EAAGhpB,EAAQ,EAAJA,GAAU,KAG3C8L,EAAIA,EAAE7J,QAAS,MAAO,IAAKA,QAAS,MAAO,OAGtCyc,EAAQ,GAAI/e,QACf,IAAMiM,EAAI,SAAWA,EAAI,MAAW,GAAJ5L,EAAS,IAAM,IAAKqoB,KAAKvc,KAEnDshC,IAEKthC,EAAE7J,QAAS,YAAa,IAAK5B,OAAS,IAGvCioC,EAAmBH,EAAS,EAAGkF,GAInCD,GAASA,GAEbthC,EAAI49B,EAAavB,EAASr8B,EAAG,GAAI9L,EAAGhE,EAAK,IAE5B,YAAL8P,GAAwB,OAALA,IAG3Bw8B,EAAmBH,EAAS,cAAgBnoC,EAAI,UAAWqtC,GAC3DvhC,EAAI,QAYZ4S,EAAQyuB,EAAQ9kB,KAAKvc,IAGnB4S,EAkBF,MAfA1iB,GAAK,EAAIA,EAAK,EAAI,KAGR,YAAL8P,IAGS,OAALA,GAGDw8B,EAAmBH,EAAS,eAAgBkF,GAEhDrxC,EAAK,EAAI,MAEbrC,EAAK,EAEEqC,EA0Bf,KArBOwE,EAAIsL,EAAE+uB,QAAQ,MAAS,KAC1B/uB,EAAIA,EAAE7J,QAAS,IAAK,MAIjB9B,EAAI2L,EAAEod,OAAO,OAAU,GAGjB,EAAJ1oB,IACDA,EAAIL,GAERK,IAAMsL,EAAEkd,MAAO7oB,EAAI,GACnB2L,EAAIA,EAAE1H,UAAW,EAAGjE,IAER,EAAJK,IAGRA,EAAIsL,EAAEzL,QAIJF,EAAI,EAAuB,KAApB2L,EAAE67B,WAAWxnC,GAAWA,KAGrC,IAAMH,EAAI8L,EAAEzL,OAA8B,KAAtByL,EAAE67B,aAAa3nC,KAInC,GAFA8L,EAAIA,EAAEkd,MAAO7oB,EAAGH,EAAI,GAEb,CAwBH,GAvBAA,EAAI8L,EAAEzL,OAGD+sC,GAASptC,EAAI,IAGdsoC,EAAmBH,EAAS,EAAGkF,GAGnCrxC,EAAK,EAAIwE,EAAIA,EAAIL,EAAI,EACrBnE,EAAK,KAMLmE,GAAMK,EAAI,GAAMknC,EAEP,EAAJlnC,IACDL,GAAKunC,GAIA1nC,EAAJG,EAAQ,CAMT,IAJIA,GACAnE,EAAK,EAAEsK,MAAOwF,EAAEkd,MAAO,EAAG7oB,IAGxBH,GAAK0nC,EAAa1nC,EAAJG,GAChBnE,EAAK,EAAEsK,MAAOwF,EAAEkd,MAAO7oB,EAAGA,GAAKunC,GAGnC57B,GAAIA,EAAEkd,MAAM7oB,GACZA,EAAIunC,EAAU57B,EAAEzL,WAEhBF,IAAKH,CAGT,MAAQG,IAAK2L,GAAK,KAElB9P,EAAK,EAAEsK,MAAOwF,GAEVg9B,IAGK9sC,EAAK,EAAImsC,EAAc,KAGxBnsC,EAAK,EAAIA,EAAK,EAAI,KAGVA,EAAK,EAAImsC,EAAc,OAG/BnsC,EAAK,GAAMA,EAAK,EAAI,SAM5BA,GAAK,GAAMA,EAAK,EAAI,EAIxB,OAFArC,GAAK,EAEEqC,KAqYf,OAAO4wC,QAUL5U,EAAgC,WAC9B,MAAO2R,IACT9vC,KAAKX,EAASM,EAAqBN,EAASC,KAA2C+F,SAAlC84B,IAAgD7+B,EAAOD,QAAU8+B,KAyB7H1+B,OAKE,SAASH,EAAQD,GAYtBA,EAAQsmC,QAAU,SAAS9+B,GACzB,MAAO,SAAS8+B,KACe,gBAAlBA,GAAQ8N,QACjB9N,EAAQ8N,SAGV,IAAIC,GAAOC,KAAKC,UAAUvrC,UAC1B,OAAMqrC,KAAQ/N,GAAQ8N,MAGf9N,EAAQ8N,MAAMC,GAFZ/N,EAAQ8N,MAAMC,GAAQ7sC,EAAGiG,MAAMjG,EAAIwB,cAS3C,SAAS/I,GAEd,YAGAA,GAAOD,SACLmM,KAAK,IAMF,SAASlM,EAAQD,EAASM,GAE/B,YAyKA,SAASk0C,KAGP,IAAK,GADDznC,GADAV,EAAOpG,MAAMuF,UAAUskB,MAAMnvB,KAAKqI,WAE7B/B,EAAI,EAAGC,EAAMmF,EAAKlF,OAAYD,EAAJD,EAASA,IAAK,CAC/C8F,EAAMV,EAAKpF,EACX,KAAK,GAAIP,KAAOqG,GACVA,EAAIpG,eAAeD,KACrB+tC,EAAQ/tC,GAAOqG,EAAIrG,KAe3B,QAASguC,GAAQjU,EAAKt6B,GACpB,MAA6B,mBAAfs6B,GAAIt6B,GAGpB,QAASwuC,GAAUlU,GACjB,MAAO,UAASt6B,GACd,MAAOuuC,GAAQjU,EAAKt6B,IAIxB,QAASyuC,GAAUnU,GACjB,MAAO,UAASt6B,GACd,GAA0B,iBAAfs6B,GAAIt6B,GAEXA,EADEs6B,EAAIt6B,MAAW,EACT,KAAOA,EAGP,YAAcA,EAAQ,QAG7B,IAA0B,gBAAfs6B,GAAIt6B,GAClBA,EAAQs6B,EAAIt6B,OAET,IAAqB,gBAAVA,GAAoB,CAClC,GAAId,GAAQc,EAAMw7B,QAAQ,IACZ,MAAVt8B,IACFc,EAAQnG,EAAQupC,SAASpjC,EAAM+E,UAAU,EAAG7F,IAAU,KAClDrF,EAAQupC,SAASpjC,EAAM+E,UAAU7F,EAAM,IAAM,KAIrD,MAAOc,IA3NX,GAAIyc,GAAYtiB,EAAoB,KAChC+iB,EAAe/iB,EAAoB,KACnCijB,EAAajjB,EAAoB,KACjC0iB,EAAe1iB,EAAoB,KAGnCu0C,GACFC,MAAO,IAASC,OAAO,EACvBC,KAAM,IAAUC,MAAM,EACtBC,OAAO,EAAStoB,OAAO,EACvBuoB,OAAO,EAASjiB,OAAO,EACvBkiB,QAAS,IAAO5zC,SAAS,EAAO6zC,YAAY,EAC5CC,KAAM,IAAUC,MAAM,EACtBC,IAAK,IAAWC,KAAK,EACrBC,OAAO,EAASC,OAAO,EAASC,UAAU,EAC1CC,KAAM,IAAUC,MAAM,EACtBC,MAAO,IAASC,OAAO,EAASC,UAAU,EAC1CC,QAAQ,EAAQC,QAAQ,EACxBC,GAAI,IAAYpgB,IAAI,EACpBqgB,GAAI,IAAYC,IAAI,EACpBC,IAAI,EAAYvD,IAAI,EACpBwD,QAAS,IAAOC,SAAS,EACzB9hC,IAAI,EAAYiM,IAAI,EAAY81B,OAAO,EACvCC,IAAK,IAAWC,KAAK,EAAWC,QAAQ,EACxCC,OAAO,EAASC,OAAO,EAASC,UAAU,EAC1CC,IAAK,IAAWp2B,KAAK,EACrBq2B,SAAS,EAAOC,SAAS,EACzBC,KAAK,EAAWttC,KAAK,EAAWutC,QAAQ,EACxCC,IAAK,IAAWC,KAAK,EACrBC,KAAK,EAAWC,KAAK,EACrBC,OAAO,EAASC,OAAO,GAGrBC,GACFA,MAAM,EACNC,OAAO,EACPC,OAAO,EACPC,OAAO,EACPC,OAAO,EACPC,OAAO,GAGLC,GACFC,OAAQ,iBACRC,QAAS,mBAGPxsC,GACFolC,IAAK,UACLqH,IAAK,UACLC,SAAU,UACVnwC,SAAU,UACVowC,GAAI,UACJC,KAAK,EACLxyC,UAAa,eAIXyyC,GACFjrB,KAAM,aACNkrB,OAAQ,aACRptC,KAAK,EACLijB,KAAK,EACLC,MAAM,EACNxqB,KAAK,EACL20C,KAAK,EACLC,QAAQ,EACR9zC,KAAK,EACL4pB,MAAM,EACNV,KAAM,aACN6qB,OAAQ,aACRzqB,MAAM,EACNlT,KAAK,EACL8P,KAAK,EACL8tB,IAAI,EACJh4B,IAAI,EACJi4B,IAAI,EACJC,KAAK,EACL9qB,KAAM,aACNxiB,MAAO,cACPutC,OAAQ,aACR5qB,KAAK,EACL7pB,KAAK,EACL00C,KAAK,EACLj1C,KAAK,EACLinB,MAAO,aACPrQ,KAAK,EACL4T,MAAM,EACNE,KAAK,EACLjlB,KAAK,EACL4kB,MAAM,EACN3gB,KAAK,EACLqjC,KAAK,EACLzrC,KAAK,EACLgG,KAAK,EACLqjB,MAAM,EAEN9D,KAAK,EACLG,KAAK,EACLhjB,MAAM,EACNsjB,MAAM,EACNjnB,YAAY,EACZgnB,WAAW,EAGXS,SAAS,EACTD,MAAM,EACNtiB,IAAI,EACJD,IAAI,EAGJ2iB,MAAM,EACN1c,QAAQ,EACR5C,MAAM,EACN0f,SAAS,EACT5mB,QAAQ,EACRL,OAAO,EACPgnB,MAAM,EACNI,OAAO,EACPhnB,OAAO,EAGPsnB,QAAQ,EAGRvnB,KAAM,OACN6nB,QAAQ,EACRC,MAAM,EACNC,IAAK,UACL4rB,MAAO,aAKLC,GACFh1C,MAAM,EACNM,KAAK,EACL20C,MAAK,QACLC,IAAK,QACLC,UAAW,QACXC,YAAa,WACbC,QAAQ,EACRjB,KAAK,EACLx0C,IAAK,KACLe,KAAK,EAELN,IAAK,eAGH4hB,GACFO,KAAM,QACNC,KAAM,QACNJ,KAAM,QACN5P,MAAM,EACN2Q,IAAK,SACLE,IAAK,SACLG,IAAO,SACP5kB,GAAM,gBAGJy2C,GACFx+B,IAAK,aAGHu5B,IAeJD,GACEiE,EACAW,EACAvE,EACA+C,EACAM,EACAtsC,GAsCF5L,EAAQ25C,SAAWhF,EAAUF,GAC7Bz0C,EAAQupC,SAAWqL,EAAUH,GAE7Bz0C,EAAQ45C,WAAajF,EAAU8D,GAC/Bz4C,EAAQ65C,WAAajF,EAAU6D,GAE/Bz4C,EAAQ85C,gBAAkBnF,EAAUyE,GACpCp5C,EAAQ+5C,gBAAkBnF,EAAUwE,GAEpCp5C,EAAQg6C,WAAarF,EAAUtuB,GAC/BrmB,EAAQqrC,WAAauJ,EAAUvuB,GAE/BrmB,EAAQ2K,OAASgqC,EAAU+E,GAC3B15C,EAAQ6rC,OAAU,WAChB,GAAIoO,GAAUrF,EAAU8E,EAExB,OAAO,UAASvzC,EAAO+zC,GACrB,MAAIl6C,GAAQ2K,OAAOxE,GACV8zC,EAAQ9zC,IAGT+zC,EAAY,GAAK,OAAS,YAAc/zC,EAAQ,QAI5DnG,EAAQspC,UAAY,SAAS1uB,EAAGyuB,EAAOznC,GACrC,GAAc,OAAVynC,EACF,MAAOzuB,EAGT,IAAIu/B,IAAU,GAAI,GAiBlB,QAhBAv4C,EAAOA,GAAQ,SAEM,mBAAVynC,IAAyBA,KAAU,EAC5C8Q,GAAU,IAAK,KAER9Q,KAAU,GACjB8Q,GAAU,IAAK,KACfv4C,EAAO,MAGPu4C,EADOl0C,MAAMC,QAAQmjC,IAA2B,IAAjBA,EAAMliC,OAC5BkiC,GAGCA,EAAOA,GAGXznC,GACN,IAAK,SACL,KAAK,EACH,MAAOu4C,GAAO,GAAKv/B,EAAIu/B,EAAO,EAEhC,KAAK,KACH,MAAO,SAAWA,EAAO,GAAK,IAAMv/B,EAAI,WAAkBu/B,EAAO,EAEnE,KAAK,KACH,MAAO,WAAaA,EAAO,GAAK,IAAMv/B,EAAI,SAAWu/B,EAAO,GAAK,IAGrE,MAAOA,GAAO,GAAKv/B,EAAIu/B,EAAO,IAGhCn6C,EAAQsqC,OAAS,SAAS8P,GACxB,GAAIrqC,GAAOqqC,EAAKrqC,KACZ1D,EAAO+tC,EAAK/tC,KACZm3B,EAAOxjC,EAAQupC,SAAS6Q,EAAKrqC,MAC7BsqC,EAAY,KACZhR,EAAQ,KACRznC,GAAO,EACP04C,GAAW,EACXnqC,EAAS,GACToqC,EAAS,GACTtP,EAAK,IAET,QAAQl7B,GAEN,IAAK,MACHk7B,EAAK,GACL,MAEF,KAAK,WACHA,EAAK,GACL,MAEF,KAAK,SACHA,EAAK,GACL,MAEF,KAAK,WACHA,EAAK,IACL,MAEF,KAAK,UACHA,EAAK,GACL,MAEF,KAAK,YACHA,EAAK,IACL,MAEF,KAAK,UACHA,EAAK,IACL,MAEF,KAAK,QACHA,EAAK,GACL,MAEF,KAAK,MACHA,EAAK,KACL,MAEF,KAAK,WACHA,EAAK,GACL,MAEF,KAAK,MACHA,EAAK,GACL,MAEF,KAAK,SACHA,EAAK,IACL,MAEF,KAAK,YACHA,EAAK,GACL,MAEF,KAAK,eACH,GAAoB,IAAhB5+B,EAAKlF,OAQJ,CAEH,GAAIyL,GAAIvG,EAAK,GAAG48B,QACZ/2B,EAAI7F,EAAK,GAAG48B,OAChB,OAAO,UAAYr2B,EAAI,aAAeA,EAAI,MAAQV,EAAI,aAXtD,KAAI7F,EAAK,YAAckX,IAAclX,EAAK,YAAc2W,IAItD,MAAO,WAAa3W,EAAK,GAAG48B,QAAU,YAHtCgC,GAAK,GAYT,MAGF,KAAK,eACHA,EAAK,UACL,MAGF,KAAK,MACH5B,EAAQ,IACRznC,EAAO,IACP,MAEF,KAAK,OAIH,GAHAynC,EAAQ,MACRznC,EAAO,KAEa,IAAhByK,EAAKlF,OAAc,CACrB,GAAIgb,GAAM9V,EAAK,GAAG48B,OAEN,iBAAR9mB,EACFA,EAAM,UAES,iBAARA,EACPA,EAAM,cAES,gBAARA,IACPA,EAAM,KAGRo4B,EAAS,KAAOp4B,EAAM,IACtB9V,GAAQA,EAAK,IAEf,KAEF,KAAK,OACHg9B,GAAS,UAAW,WACpBznC,EAAO,IACP,MAEF,KAAK,QACHynC,GAAS,WAAY,YACrBznC,EAAO,IACP,MAEF,KAAK,QACHynC,GAAS,WAAY,WACrBznC,EAAO,KAEa,IAAhByK,EAAKlF,SACPozC,EAAS,IAAMv6C,EAAQspC,UAAUj9B,EAAK,GAAG48B,SACzC58B,GAAQA,EAAK,IAEf,MAIF,KAAK,MACHkuC,EAAS,OACT,MAEF,KAAK,YACHA,EAAS,OACTlR,GAAQ,CACR,MAGF,KAAK,MACH,GAAIj4B,GAAO,GACS,KAAhB/E,EAAKlF,SACPiK,EAAO/E,EAAK,GAAG48B,QACfzF,EAAO,UAAYpyB,EAAO,IAC1B/E,GAAQA,EAAK,KAEF,MAAT+E,IACFoyB,EAAO,QAGT8W,GAAW,CACX,MAEF,KAAK,SACHC,EAAS,MACT,MAEF,KAAK,OACHA,EAAS,MACT,MAIF,KAAK,MACHD,GAAW,EACXjR,GAAQ,EACR7F,GAAQ,GACR,MAEF,KAAK,MACH,GAAI4W,EAAK/tC,KAAK,YAAcuW,GAC1B,MAAOw3B,GAAK/tC,KAAK,GAAG48B,MAAM,UAG5BI,GAAQ,UACRznC,EAAO,IACP,MAEF,SACE04C,GAAW,EAoBf,MAhBW,QAAPrP,GACF5B,EAAgB,MAAP4B,GAAqB,MAAPA,EACvBoP,EAAY,GAAKh3B,GAAa4nB,EAAIl7B,EAAM1D,GAAO48B,SAG/CgC,EAAK,KAGO,OAAV5B,GAAmBrpC,EAAQ85C,gBAAgB/pC,KAC7Cs5B,GAAQ,GAGVgR,EAAYA,GAAahuC,EAAK/G,IAAI,SAAS26B,GACzC,MAAO,IAAMA,EAAMgJ,QAAU,MAC5Bl7B,KAAKk9B,GAED96B,GAAUmqC,EAAW9W,EAAO,IAC/BxjC,EAAQspC,UAAU+Q,EAAWhR,EAAOznC,GACpC24C"} \ No newline at end of file +{"version":3,"file":"math.map","sources":["math.js"],"names":["root","factory","exports","module","define","amd","this","modules","__webpack_require__","moduleId","installedModules","id","loaded","call","m","c","p","create","config","math","loader","_config","expression","node","docs","type","Complex","Range","Index","Unit","Help","ResultSet","transform","concat","filter","forEach","index","map","max","mean","min","range","subset","Chain","createProxy","isFactory","load","Error","instance","factories","indexOf","typed","push","instances","Object","matrix","number","precision","epsilon","error","_reduce","mat","dim","callback","i","ret","val","tran","Array","isArray","_switch","length","j","I","J","tmp","collection","argsToArray","args","array","Matrix","valueOf","util","isCollection","x","deepMap","skipZeros","deepMap2","array1","array2","res","len","DimensionError","reduce","size","arraySize","IndexError","deepForEach","ii","value","name","re","im","SyntaxError","arguments","arg","construct","fromPolar","r","phi","isNumber","TypeError","skipWhitespace","next","isDigitDot","isDigit","text","charAt","revert","oldIndex","parseNumber","parseComplex","cnext","isUnit","isString","string","isComplex","parse","str","first","Number","separator","second","substring","hasBase","BASE_UNITS","ANGLE","toNumber","Math","cos","sin","prototype","toPolar","sqrt","atan2","clone","equals","other","format","options","strRe","strIm","pow","abs","toString","toJSON","mathjs","fromJSON","json","start","end","step","parseFloat","split","nums","invalid","some","num","isNaN","isRange","object","diff","sign","ceil","undefined","obj","toArray","ranges","_ranges","_isScalar","_createRange","primitive","isInteger","isIndex","apply","values","isScalar","row","strings","join","isMatrix","storage","constructor","_storage","replacement","defaultValue","get","set","resize","path","_findUnit","unit","prefix","UNIT_NONE","PREFIX_NONE","_normalize","fixPrefix","parseUnit","unitName","UNITS","hasOwnProperty","endsWith","prefixLen","prefixName","prefixes","err","offset","_denormalize","prefixValue","isValuelessUnit","base","equalBase","to","valuelessUnit","bestPrefix","_bestPrefix","absValue","bestDiff","log","LN10","scientific","PREFIXES","NONE","SHORT","da","h","k","M","G","T","P","E","Z","Y","d","u","n","f","a","z","y","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","SQUARED","CUBIC","BINARY_SHORT","Ki","Mi","Gi","Ti","Pi","Ei","Zi","Yi","BINARY_LONG","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","LENGTH","MASS","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","BIT","BASE_UNIT_NONE","meter","inch","foot","yard","mile","link","rod","chain","angstrom","in","ft","yd","mi","li","rd","ch","mil","m2","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","m3","L","l","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","fldr","floz","gi","cp","pt","qt","gal","bbl","obl","g","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","s","sec","minute","hour","day","rad","deg","grad","cycle","A","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","N","newton","lbf","poundforce","b","bits","B","bytes","PLURALS","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","teaspoons","tablespoons","minims","fluiddrams","fluidounces","gills","cups","pints","quarts","gallons","beerbarrels","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","seconds","minutes","hours","days","radians","degrees","gradients","cycles","amperes","moles","plural","lt","liter","liters","lb","lbs","doc","isHelp","toText","desc","category","description","syntax","examples","parser","expr","eval","e","seealso","prop","entries","BigNumber","Decimal","convert","digits","FibonacciHeap","_minimum","_size","smaller","larger","oneOverLogPhi","insert","key","degree","minimum","left","right","clear","isEmpty","extractMinimum","numberOfChildren","child","tempRight","parent","_findMinimumNode","remove","_decreaseKey","_cut","_cascadingCut","mark","_linkNodes","floor","numRoots","temp","slice","done","arg0","arg1","ArgumentsError","extra_nodes","nodes","parseStart","elem","nesting_level","conditional_level","nextPreview","nextNextPreview","getToken","token_type","TOKENTYPE","NULL","token","DELIMITER","c2","c3","DELIMITERS","isAlpha","NAMED_DELIMITERS","SYMBOL","UNKNOWN","createSyntaxError","NUMBER","getTokenSkipNewline","openParams","closeParams","parseBlock","createError","visible","blocks","ConstantNode","parseFunctionAssignment","BlockNode","parseAssignment","valid","parseConditional","SymbolNode","AssignmentNode","IndexNode","UpdateNode","FunctionNode","FunctionAssignmentNode","parseLogicalOr","prev","condition","trueExpr","falseExpr","ConditionalNode","parseLogicalXor","OperatorNode","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","operators","fn","params","parseShift","==","!=","<",">","<=",">=","parseConversion","<<",">>",">>>","parseRange","parseAddSubtract","RangeNode","parseMultiplyDivide","+","-","parseUnary","*",".*","/","./","%","mod","~","not","parsePow","parseLeftHandOperators","parseCustomNodes","!","'","handler","parseSymbol","parseFunctions","parseIndex","parseString","tPrev","parseMatrix","rows","cols","parseRow","ArrayNode","parseParentheses","parseEnd","col","message",",","(",")","[","]","\"",";","^",".^","&","|","^|","=",":","?","and","xor","or","Parser","scope","_parse","compile","Node","LN2","LOG2E","LOG10E","NaN","pi","PI","SQRT1_2","SQRT2","tau","version","add","cube","divide","dotDivide","dotMultiply","dotPow","exp","fix","gcd","lcm","log10","multiply","norm","nthRoot","round","square","subtract","unaryMinus","unaryPlus","xgcd","bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift","conj","bignumber","complex","help","cross","det","diag","dot","eye","flatten","inv","ones","squeeze","trace","transpose","zeros","combinations","factorial","gamma","permutations","pickRandom","random","randomInt","compare","deepEqual","largerEq","smallerEq","unequal","median","prod","std","sum","acos","acosh","acot","acoth","acsc","acsch","asec","asech","asin","asinh","atan","atanh","cosh","cot","coth","csc","csch","sech","sinh","tan","tanh","sort","SparseMatrix","data","_createFromMatrix","ptr","_values","_index","_ptr","_createFromArray","types","equal","source","columns","v","_getsubset","_setsubset","validateIndex","_map","submatrix","sSize","iSize","outer","unsqueeze","x0","y0","_getValueIndex","_resize","_remove","_insert","top","bottom","splice","copy","ins","k0","k1","me","invoke","minRow","maxRow","minColumn","maxColumn","_toArray","diagonal","kSuper","kSub","_value","ms","swapRows","_swapRows","_forEachRow","kx","ky","vx","vy","sparse","DenseMatrix","_data","preprocess","_get","_getSubmatrix","dims","last","_set","_fit","_setSubmatrix","dataIndex","subIndex","newSize","changed","index_i","recurse","vi","dense","Spa","_heap","accumulate","from","heap","swap","nodei","nodej","errorTransform","lastIndex","minus","isBoolean","_filter","test","_scope","symbol","sub","eq","rawArgs","_forEachArray","arrayOrig","UnsupportedTypeError","_mapArray","arrayIn","Array | Matrix","sparseScatter","addScalar","any, any","Matrix, Matrix","xsize","ysize","_addSparseMatrixSparseMatrix","_addSparseMatrixMatrix","_addMatrixSparseMatrix","_addMatrixMatrix","Array, Array","Array, Matrix","Matrix, Array","Matrix, any","_addSparseMatrixScalar","any, Matrix","Array, any","any, Array","asize","avalues","aindex","aptr","cvalues","cindex","cptr","bsize","RangeError","bvalues","w","p0","p1","bindex","bptr","cdata","complexMultiply","signatures","times","divideScalar","Array | Matrix, Array | Matrix","Array | Matrix, any","any, Array | Matrix","isNegative","_gcdBigNumber","isInt","zero","isZero","neg","number, number","_gcd","BigNumber, BigNumber","Array | Matrix, Array | Matrix | number | BigNumber","number | BigNumber, Array | Matrix","Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber","_lcmBigNumber","t","div","_lcm","_logNumber","ln","_log10Complex","_mod","multiplyScalar","_validateMatrixDimensions","_multiplyVectorVector","_multiplyVectorMatrix","_multiplyMatrixVector","_multiplyMatrixMatrix","size1","size2","adata","bdata","_multiplyVectorDenseMatrix","alength","bcolumns","_multiplyDenseMatrixVector","_multiplySparseMatrixVector","_multiplyDenseMatrixDenseMatrix","_multiplyDenseMatrixSparseMatrix","_multiplySparseMatrixDenseMatrix","_multiplySparseMatrixSparseMatrix","arows","acolumns","brows","spa","ib","vbi","ka0","ka1","ka","ia","processColumn","jb","vbij","kb0","kb1","kb","_norm","sizeX","POSITIVE_INFINITY","pinf","NEGATIVE_INFINITY","ninf","maxc","cj","maxr","ri","complexAbs","boolean | null","number | Complex | BigNumber | boolean | null, number | BigNumber | string","Array, number | BigNumber | string","Matrix, number | BigNumber | string","_bigNthRoot","one","negated","isFinite","iMax","xPrev","delta","plus","_nthRoot","_powComplex","_powArray","px","_powMatrix","Complex, Complex","Array, number","Array, BigNumber","Matrix, number","Matrix, BigNumber","_round","Complex, number","Complex, BigNumber","_n","toDecimalPlaces","Array | Matrix, number | BigNumber","number | Complex | BigNumber, Array | Matrix","decimals","toFixed","cmp","_sqrtNumber","_sqrtComplex","Unit, Unit","_subtractSparseMatrixSparseMatrix","_subtractSparseMatrixMatrix","_subtractMatrixSparseMatrix","_subtractMatrixMatrix","_subtractSparseMatrixScalar","_subtractScalarSparseMatrix","boolean | string | null","_xgcd","q","lastx","lasty","_xgcdBigNumber","bigBitAnd","bigBitNot","bigBitOr","bigBitXor","bigLeftShift","bigRightArithShift","bool","boolean","lcase","toLowerCase","any","...number | BigNumber | Range | Array","_create","Array | Matrix, string","Unit, string | Unit","null","String","number, string","BigNumber, string","entry","string, Object","Array | Matrix, Object","search","string | Array | Matrix","string | Array | Matrix, Object","...Array | Matrix | number | BigNumber","prevDim","asMatrix","matrices","shift","_concat","concatDim","_cross","xSize","ySize","_det","compute_mu","mu","fa","_diag","_createDiagonalMatrix","_getDiagonal","F","dm","vector","Array, string","Array, number, string","Array, BigNumber, string","Matrix, string","Matrix, number, string","Matrix, BigNumber, string","_dot","_eyeVector","_eye","Big","number | BigNumber","number | BigNumber, string","number | BigNumber, number | BigNumber","number | BigNumber, number | BigNumber, string","_flatten","flat","_inv","Ac","Bc","Ar","Br","asBigNumber","_range","_rangeInc","_bigRange","gt","_bigRangeInc","lte","gte","includeEnd","pop","_resizeString","defaultChar","number | Complex | BigNumber | Unit | boolean | null","_getSubset","_getSubstring","strLen","substr","_setSubset","_setSubstring","chars","_denseTrace","_sparseTrace","_denseTranspose","_sparseTranspose","transposedRow","transposed","result","isPositiveInteger","dividedBy","bigFactorial","preciseFacs","smallBigFacs","toSD","bigBigFacs","toPrecision","Infinity","twoN","threeN","fourN","fiveN","real","den","twoPiSqrt","distribution","boolean, boolean","nearlyEqual","string, string","_deepEqual","_equal","_unequal","_largest","_max","...","_nmean","_mean","_median","middle2","middle","_smallest","_min","_prod","_std","normalization","variance","_sum","_var","DEFAULT_NORMALIZATION","_complexAcos","temp1","temp2","complexSqrt","temp3","temp4","complexLog","bigArcCos","arccos_arcsec","_complexAcosh","complexAcos","bigAcosh","acosh_asinh_asech_acsch","complexAtan","HALF_PI","bigArcCot","arctan_arccot","_complexAcoth","bigAcoth","atanh_acoth","_complexAcsc","complexAsin","bigArcCsc","arcsin_arccsc","bigAcsch","_complexAsec","bigArcSec","_complexAsech","bigAsech","_complexAsin","bigArcSin","bigAsinh","bigArcTan","bigAtan2","arctan2","_complexAtanh","noIM","oneMinus","onePlus","bigAtanh","bigCos","cos_sin_sec_csc","_cosh","ep","en","bigCosh","cosh_sinh_csch_sech","bigCot","tan_cot","_coth","bigCoth","tanh_coth","bigCsc","_csch","bigCsch","bigSec","_sech","bigSech","bigSin","_sinh","cim","sim","bigSinh","bigTan","_tanh","bigTanh","Unit, Unit | string","deepExtend","Array, function","_filterCallback","Array, RegExp","_filterRegExp","Matrix, function","Matrix, RegExp","regexp","any, Object | function | number","_print","string, Object, number","template","replace","original","keys","_comparator","order","asc","_arrayIsVector","_matrixIsVector","_forEach","lup","_denseLUP","_sparseLUP","U","ldata","lsize","udata","usize","pabsv","vjj","absv","vij","lvalues","lindex","lptr","uvalues","uindex","uptr","pvalues","pindex","pptr","psize","pv_co","pv_oc","swapIndeces","vkj","vik","backwardSubstitution","forwardSubstitution","lusolve","Array, Array | Matrix","_lusolve","Matrix, Array | Matrix","Object, Array | Matrix","_toMatrix","Boolean","Date","RegExp","extend","canDefineProperty","defineProperty","lazy","_uninitialized","configurable","traverse","names","conversions","math_import","opts","override","wrap","_module","_importFactory","imported","isSupportedType","_import","namespace","UNINITIALIZED","_validate","dimNext","oldLen","newLen","minLen","_squeeze","_unsqueeze","validate","_defaultValue","unshift","stack","actual","expected","relation","NumberFormatter","notation","toExponential","exponential","DBL_EPSILON","EPSILON","formatArray","count","every","isNode","_compile","defs","_ifNode","_toTex","callbacks","latexType","childNode","toTex","keywords","latex","precedence","getPrecedence","exprPrecedence","toSymbol","block","param","js","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","valueType","SUPPORTED_TYPES","match","variable","compileSubset","someUseEnd","rangesUseEnd","useEnd","objectName","op","calculateNecessaryParentheses","associativity","getAssociativity","operandPrecedence","operandIdentifier","getIdentifier","rootIdentifier","properties","latexLeftParens","latexParens","lhsParens","lhsPrecedence","assocWithLhs","isAssociativeWith","rhsParens","rhsPrecedence","assocWithRhs","lhsIdentifier","rhsIdentifier","latexRightParens","parens","assoc","operand","lhs","rhs","lhsTex","rhsTex","isRaw","paramsName","toFunction","startPrecedence","stepPrecedence","endPrecedence","undef","_validateScope","_transform","transformed","code","defsCode","factoryCode","Function","_traverse","find","customTex","number, Unit","Unit, number","_divideComplex","bitwise","func","xBits","yBits","xSign","ySign","decCoefficientToBinaryString","minBits","maxBits","minSign","shortLen","longLen","expFuncVal","outVal","twoPower","ONE","two","prevPrec","xe","strL","arr","arrL","reverse","arcsin_newton","oldPrecision","tolerance","maxp","localPrecision","maxIter","curr","tmp0","tmp1","sinToCos","tmp2","toDP","arcsin_taylor","yPrev","x2","polyNum","constNum","constDen","bigK","arctan_taylor","cos_sin_taylor","mode","reduceToPeriod","dp","sinVal","memoize","isBigNumber","toBigNumber","pi4th","negOne","reciprocal","absX","halfPi","wasReduced","x2PlusOrMinus","isNeg","precPlusGuardDigits","five","sixteen","twenty","ret2","ret3","ret5","div_factor","loops","eight","ret4","posExp","negExp","lower","upper","toExpNeg","toExpPos","toSignificantDigits","distributions","randFunctions","arg2","arg3","_randomDataForMatrix","_random","_randomInt","possibles","randFunc","uniform","normal","u1","u2","picked","substitutionValidation","_denseBackwardSubstitution","_sparseBackwardSubstitution","xj","bj","xvalues","xindex","xptr","_denseForwardSubstitution","_sparseForwardSubstitution","webpackContext","req","webpackContextResolve","./clone","./clone.js","./config","./config.js","./filter","./filter.js","./forEach","./forEach.js","./format","./format.js","./import","./import.js","./map","./map.js","./print","./print.js","./sort","./sort.js","./typeof","./typeof.js","resolve","cache","hash","JSON","stringify","__WEBPACK_AMD_DEFINE_RESULT__","global","coefficientToString","LOGBASE","charCodeAt","checkRoundingDigits","rm","repeating","ci","mathpow","checkRM","method","outOfRange","parseInt","ifExceptionsThrow","checkArg","MAX_DIGITS","pr","denom","guard","sd","rep","external","rnd","getCoeffLength","more","intPow","c0","x1","xc","xci","out","mathfloor","BASE","convertBase","decimal","crypto","NUMERALS","EXP_LIMIT","INT_POW_LIMIT","yc","base10","inf","sd10","xLTy","half","pos","groupSeparator","g1","g2","intPart","fractionPart","intDigits","maxD","d0","d2","frac","n0","n1","d1","yN","toBaseOut","baseIn","baseOut","multiplyInteger","carry","aL","bL","logbase","prodL","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","maxOrMin","ltgt","rand","Uint32Array","decimalFactory","parseDecimal","decimalSeparator","groupSize","secondaryGroupSize","fractionGroupSeparator","fractionGroupSize","isValid","trim","isNum","orig","coefficients","exponent","rounded","roundDigits","pp","removed","identifier","property","nodeA","nodeB","identifierA","identifierB","associativeWith","OperatorNode:or","OperatorNode:xor","OperatorNode:and","OperatorNode:bitOr","OperatorNode:bitXor","OperatorNode:bitAnd","OperatorNode:equal","OperatorNode:unequal","OperatorNode:smaller","OperatorNode:larger","OperatorNode:smallerEq","OperatorNode:largerEq","OperatorNode:leftShift","OperatorNode:rightArithShift","OperatorNode:rightLogShift","OperatorNode:to","OperatorNode:add","OperatorNode:subtract","OperatorNode:multiply","OperatorNode:divide","OperatorNode:dotMultiply","OperatorNode:dotDivide","OperatorNode:mod","OperatorNode:unaryPlus","OperatorNode:unaryMinus","OperatorNode:bitNot","OperatorNode:not","OperatorNode:pow","OperatorNode:dotPow","OperatorNode:factorial","OperatorNode:transpose","expandTemplate","symbols","Alpha","alpha","Beta","beta","Gamma","Delta","Epsilon","varepsilon","Zeta","zeta","Eta","eta","Theta","theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","Nu","nu","Xi","Omicron","omicron","varpi","Rho","rho","varrho","Sigma","sigma","varsigma","Tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","psi","Omega","omega","true","false","Inf","infinity","oo","lim","defaultTemplate","functions",1,2,"var","import","print","typeof","units","latexConverter","msize","__WEBPACK_AMD_DEFINE_FACTORY__","__WEBPACK_AMD_DEFINE_ARRAY__","getTypeTest","hint","argCount","actualType","getTypeOf","_expected","anyType","contains","Refs","categories","Param","varArgs","_types","_varArgs","Signature","_params","signature","childs","parseSignatures","rawSignatures","expanded","expand","signature_i","existing","mapSignatures","normalized","parseTree","nodeSignature","filtered","overlapping","getArgs","_typed","refs","_signatures","_name","_args","maxParams","toCode","body","cat","hasConversions","ac","bc","toConversion","conversion","newParam","ref","comment","getTests","tests","bind","allTypes","exactTypes","conversion_i","_innerCode","nextAnyType","exceptions","_exceptions","function","string, function","string, string, function","...function","fns"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;CA2BA,SAA2CA,EAAMC,GAC1B,gBAAZC,UAA0C,gBAAXC,QACxCA,OAAOD,QAAUD,IACQ,kBAAXG,SAAyBA,OAAOC,IAC9CD,OAAOH,GACmB,gBAAZC,SACdA,QAAc,KAAID,IAElBD,EAAW,KAAIC,KACdK,KAAM,WACT,MAAgB,UAAUC,GAKhB,QAASC,GAAoBC,GAG5B,GAAGC,EAAiBD,GACnB,MAAOC,GAAiBD,GAAUP,OAGnC,IAAIC,GAASO,EAAiBD,IAC7BP,WACAS,GAAIF,EACJG,QAAQ,EAUT,OANAL,GAAQE,GAAUI,KAAKV,EAAOD,QAASC,EAAQA,EAAOD,QAASM,GAG/DL,EAAOS,QAAS,EAGTT,EAAOD,QAvBf,GAAIQ,KAqCJ,OATAF,GAAoBM,EAAIP,EAGxBC,EAAoBO,EAAIL,EAGxBF,EAAoBQ,EAAI,GAGjBR,EAAoB,KAK/B,SAASL,EAAQD,EAASM,GAgB/B,QAASS,GAAQC,GAEf,GAAIC,GAAOC,EAAOH,QAClBE,GAAKF,OAASA,CAEd,IAAII,GAAUF,EAAKE,OA+NnB,OA5NAF,GAAAA,UAAYX,EAAoB,IAGhCW,EAAKG,cACLH,EAAKG,WAAWC,KAAOf,EAAoB,IAC3CW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAKG,WAAWE,KAAOhB,EAAoB,IAG3CW,EAAKM,KAAKC,QAAUlB,EAAoB,GACxCW,EAAKM,KAAKE,MAAQnB,EAAoB,GACtCW,EAAKM,KAAKG,MAAQpB,EAAoB,GACtCW,EAAAA,UAAYX,EAAoB,IAChCW,EAAKM,KAAKI,KAAOrB,EAAoB,GACrCW,EAAKM,KAAKK,KAAOtB,EAAoB,GACrCW,EAAKM,KAAKM,UAAYvB,EAAoB,GAC1CW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAIhCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAGhCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCW,EAAAA,UAAYX,EAAoB,KAChCA,EAAoB,IAAIW,EAAME,GAC9Bb,EAAoB,IAAIW,EAAME,GAC9Bb,EAAoB,IAAIW,EAAME,GAC9BF,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCA,EAAoB,KAAKW,EAAME,GAC/BF,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCA,EAAoB,KAAKW,EAAME,GAI/BF,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAEhCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAChCW,EAAAA,UAAYX,EAAoB,MAGhCW,EAAKG,WAAWU,WACdC,OAAQzB,EAAoB,IAAIW,EAAME,GACtCa,OAAQ1B,EAAoB,IAAIW,EAAME,GACtCc,QAAQ3B,EAAoB,IAAIW,EAAME,GACtCe,MAAQ5B,EAAoB,IAAIW,EAAME,GACtCgB,IAAQ7B,EAAoB,IAAIW,EAAME,GACtCiB,IAAQ9B,EAAoB,IAAIW,EAAME,GACtCkB,KAAQ/B,EAAoB,IAAIW,EAAME,GACtCmB,IAAQhC,EAAoB,IAAIW,EAAME,GACtCoB,MAAQjC,EAAoB,IAAIW,EAAME,GACtCqB,OAAQlC,EAAoB,IAAIW,EAAME,IAKxCF,EAAKM,KAAKkB,MAAQnC,EAAoB,MACtCW,EAAKM,KAAKkB,MAAMC,YAAYzB,GAG5BA,EAAKD,OAAOA,GAELC,EAlPT,GAAIC,GAASZ,EAAoB,EAsPjCL,GAAOD,QAAUe,KAKZ,SAASd,EAAQD,EAASM,GAE/B,GAAIqC,GAAYrC,EAAoB,KAAKqC,SAOzC3C,GAAQe,OAAS,WA0Cf,QAAS6B,GAAM7C,GACb,IAAK4C,EAAU5C,GACb,KAAM,IAAI8C,OAAM,wEAGlB,IACIC,GADAZ,EAAQa,EAAUC,QAAQjD,EAqB9B,OAnBc,KAAVmC,GAIAY,EAFE/C,EAAQkB,KAEClB,EAAQA,QAAQkB,EAAKM,KAAMJ,EAASyB,EAAMK,EAAOhC,GAGjDlB,EAAQA,QAAQkB,EAAKM,KAAMJ,EAASyB,EAAMK,GAIvDF,EAAUG,KAAKnD,GACfoD,EAAUD,KAAKJ,IAIfA,EAAWK,EAAUjB,GAGhBY,EAlET,GAA6B,kBAAlBM,QAAOrC,OAChB,KAAM,IAAI8B,OAAM,gHAKlB,IAAIE,MACAI,KAGAlC,GACFM,SAIE0B,EAAQ3C,EAAoB,KAAKS,OAAOE,GAGxCE,GAEFkC,OAAQ,SAGRC,OAAQ,SAGRC,UAAW,GAIXC,QAAS,MAqDX,OAZAvC,GAAK,UAAY2B,EAAKtC,EAAoB,MAI1CA,EAAoB,KAAKW,EAAME,GAE/BF,EAAKE,QAAUA,EAIfF,EAAKwC,MAAQnD,EAAoB,KAE1BW,IAMJ,SAAShB,EAAQD,EAASM,GAG/B,YAOA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAuLpC,QAASS,GAAQC,EAAKC,EAAKC,GACzB,GAAIC,GAAGC,EAAKC,EAAKC,CAEf,IAAQ,GAALL,EAAO,CACN,GAAKM,MAAMC,QAAQR,EAAI,IAMlB,CAGD,IAFAM,EAAOG,EAAQT,GACfI,KACID,EAAE,EAAGA,EAAEG,EAAKI,OAAQP,IACpBC,EAAID,GAAKJ,EAAQO,EAAKH,GAAIF,EAAI,EAAGC,EAErC,OAAOE,GAVP,IADAC,EAAML,EAAI,GACNG,EAAE,EAAGA,EAAEH,EAAIU,OAAQP,IACnBE,EAAMH,EAASG,EAAKL,EAAIG,GAE5B,OAAOE,GAWX,IADAD,KACID,EAAE,EAAGA,EAAEH,EAAIU,OAAQP,IACnBC,EAAID,GAAKJ,EAAQC,EAAIG,GAAIF,EAAI,EAAGC,EAEpC,OAAOE,GAUf,QAASK,GAAQT,GACf,GAEIG,GAAGQ,EAFHC,EAAIZ,EAAIU,OACRG,EAAIb,EAAI,GAAGU,OAEXN,IACJ,KAAKO,EAAE,EAAKE,EAAFF,EAAKA,IAAK,CAClB,GAAIG,KACJ,KAAKX,EAAE,EAAKS,EAAFT,EAAKA,IACbW,EAAIvB,KAAKS,EAAIG,GAAGQ,GAElBP,GAAIb,KAAKuB,GAEX,MAAOV,GAnOT,GAAIV,GAAST,EAAKtC,EAAoB,KAElCoE,IA4PJ,OAhPAA,GAAWC,YAAc,SAASC,GAChC,GAAoB,IAAhBA,EAAKP,OAEP,QAEG,IAAmB,GAAfO,EAAKP,OAAa,CAGzB,GAAIQ,GAAQD,EAAK,EAOjB,OANIC,aAAiBtD,GAAKuD,SACxBD,EAAQA,EAAME,WAEXb,MAAMC,QAAQU,KACjBA,GAASA,IAEJA,EAIP,MAAOG,GAAKH,MAAMF,YAAYC,IAUlCF,EAAWO,aAAe,SAASC,GACjC,MAAQhB,OAAMC,QAAQe,IAAOA,YAAa3D,GAAKuD,QAejDJ,EAAWS,QAAU,QAASA,GAAQN,EAAOhB,EAAUuB,GACrD,MAAIP,IAA+B,kBAAdA,GAAM1C,IAClB0C,EAAM1C,IAAI,SAAU+C,GACzB,MAAOC,GAAQD,EAAGrB,EAAUuB,KAIvBvB,EAASgB,IAepBH,EAAWW,SAAW,QAASA,GAASC,EAAQC,EAAQ1B,GACtD,GAAI2B,GAAKC,EAAK3B,CAEd,IAAII,MAAMC,QAAQmB,GAChB,GAAIpB,MAAMC,QAAQoB,GAAS,CAEzB,GAAID,EAAOjB,QAAUkB,EAAOlB,OAC1B,KAAM,IAAIqB,GAAeJ,EAAOjB,OAAQkB,EAAOlB,OAKjD,KAFAmB,KACAC,EAAMH,EAAOjB,OACRP,EAAI,EAAO2B,EAAJ3B,EAASA,IACnB0B,EAAI1B,GAAKuB,EAASC,EAAOxB,GAAIyB,EAAOzB,GAAID,OAGvC,CAAA,GAAI0B,YAAkBhE,GAAKuD,OAG9B,MADAU,GAAMH,EAASC,EAAQC,EAAOR,UAAWlB,GAClCR,EAAOmC,EAMd,KAFAA,KACAC,EAAMH,EAAOjB,OACRP,EAAI,EAAO2B,EAAJ3B,EAASA,IACnB0B,EAAI1B,GAAKuB,EAASC,EAAOxB,GAAIyB,EAAQ1B,OAItC,CAAA,GAAIyB,YAAkB/D,GAAKuD,OAC9B,MAAIS,aAAkBhE,GAAKuD,QAEzBU,EAAMH,EAASC,EAAOP,UAAWQ,EAAOR,UAAWlB,GAC5CR,EAAOmC,KAKdA,EAAMH,EAASC,EAAOP,UAAWQ,EAAQ1B,GAClCR,EAAOmC,GAIhB,IAAItB,MAAMC,QAAQoB,GAIhB,IAFAC,KACAC,EAAMF,EAAOlB,OACRP,EAAI,EAAO2B,EAAJ3B,EAASA,IACnB0B,EAAI1B,GAAKuB,EAASC,EAAQC,EAAOzB,GAAID,OAGpC,CAAA,GAAI0B,YAAkBhE,GAAKuD,OAG9B,MADAU,GAAMH,EAASC,EAAQC,EAAOR,UAAWlB,GAClCR,EAAOmC,EAIdA,GAAM3B,EAASyB,EAAQC,IAI3B,MAAOC,IAYTd,EAAWiB,OAAS,SAAShC,EAAKC,EAAKC,GACrC,GAAI+B,GAAO1B,MAAMC,QAAQR,GAAOkC,EAAUlC,GAAOA,EAAIiC,MACrD,IAAU,EAANhC,EAEF,KAAM,IAAIkC,GAAWlC,EAEvB,IAAIA,GAAOgC,EAAKvB,OAEd,KAAM,IAAIyB,GAAWlC,EAAKgC,EAAKvB,OAG/B,OAAIV,aAAepC,GAAKuD,OACbzB,EAAOK,EAAQC,EAAIoB,UAAWnB,EAAKC,IAEnCH,EAAQC,EAAKC,EAAKC,IAmEjCa,EAAWqB,YAAc,QAASA,GAAalB,EAAOhB,GAChDgB,YAAiBtD,GAAKuD,SACxBD,EAAQA,EAAME,UAGhB,KAAK,GAAIjB,GAAI,EAAGkC,EAAKnB,EAAMR,OAAY2B,EAAJlC,EAAQA,IAAK,CAC9C,GAAImC,GAAQpB,EAAMf,EAEdI,OAAMC,QAAQ8B,GAChBF,EAAYE,EAAOpC,GAGnBA,EAASoC,KAKRvB,EApQT,GAAIM,GAAO1E,EAAoB,KAC3BuF,EAAYvF,EAAoB,KAAKsF,KACrCE,EAAaxF,EAAoB,KACjCoF,EAAiBpF,EAAoB,IAoQzCN,GAAQkG,KAAO,aACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YA6BA,SAASkB,GAAQ2E,EAAIC,GACnB,KAAMhG,eAAgBoB,IACpB,KAAM,IAAI6E,aAAY,mDAGxB,QAAQC,UAAUjC,QAChB,IAAK,GACHjE,KAAK+F,GAAK,EACV/F,KAAKgG,GAAK,CACV,MAEF,KAAK,GACH,GAAIG,GAAMD,UAAU,EACpB,IAAmB,gBAARC,GAAkB,CAC3B,GAAG,MAAQA,IAAO,MAAQA,GAAK,CAC7B,GAAIC,GAAY,GAAIhF,GAAQ+E,EAAIJ,GAAII,EAAIH,GACxChG,MAAK+F,GAAKK,EAAUL,GACpB/F,KAAKgG,GAAKI,EAAUJ,EACpB,OACK,GAAI,KAAOG,IAAO,OAASA,GAAK,CACrC,GAAIC,GAAYhF,EAAQiF,UAAUF,EAAIG,EAAGH,EAAII,IAC7CvG,MAAK+F,GAAKK,EAAUL,GACpB/F,KAAKgG,GAAKI,EAAUJ,EACpB,QAGJ,KAAM,IAAIC,aAAY,8DAExB,KAAK,GACH,IAAKO,EAAST,KAAQS,EAASR,GAC7B,KAAM,IAAIS,WAAU,8CAEtBzG,MAAK+F,GAAKA,EACV/F,KAAKgG,GAAKA,CACV,MAEF,SACE,KAAM,IAAIC,aAAY,gEAgB5B,QAASS,KACP,KAAY,KAALjG,GAAiB,KAALA,GACjBkG,IAIJ,QAASC,GAAYnG,GACnB,MAASA,IAAK,KAAY,KAALA,GAAkB,KAALA,EAGpC,QAASoG,GAASpG,GAChB,MAASA,IAAK,KAAY,KAALA,EAGvB,QAASkG,KACP7E,IACArB,EAAIqG,EAAKC,OAAOjF,GAGlB,QAASkF,GAAOC,GACdnF,EAAQmF,EACRxG,EAAIqG,EAAKC,OAAOjF,GAGlB,QAASoF,KACP,GACID,GADA/D,EAAS,EAYb,IAVA+D,EAAWnF,EAEF,KAALrB,EACFkG,IAEY,KAALlG,IACPyC,GAAUzC,EACVkG,MAGGC,EAAWnG,GAGd,MADAuG,GAAOC,GACA,IAIT,IAAS,KAALxG,GAGF,GAFAyC,GAAUzC,EACVkG,KACKE,EAAQpG,GAGX,MADAuG,GAAOC,GACA,SAGN,CACH,KAAOJ,EAAQpG,IACbyC,GAAUzC,EACVkG,GAEO,MAALlG,IACFyC,GAAUzC,EACVkG,KAGJ,KAAOE,EAAQpG,IACbyC,GAAUzC,EACVkG,GAIF,IAAS,KAALlG,GAAiB,KAALA,EAAU,CAUxB,GATAyC,GAAUzC,EACVkG,KAES,KAALlG,GAAiB,KAALA,KACdyC,GAAUzC,EACVkG,MAIGE,EAAQpG,GAGX,MADAuG,GAAOC,GACA,IAGT,MAAOJ,EAAQpG,IACbyC,GAAUzC,EACVkG,IAIJ,MAAOzD,GAGT,QAASiE,KAEP,GAAIC,GAAQN,EAAKC,OAAOjF,EAAQ,EAChC,IAAS,KAALrB,GAAiB,KAALA,EAEd,MADAkG,KACO,GAEJ,MAAU,KAALlG,GAAiB,KAALA,GAAuB,KAAT2G,GAAyB,KAATA,GAAe,CACjE,GAAIlE,GAAe,KAALzC,EAAY,IAAM,IAGhC,OAFAkG,KACAA,IACOzD,EAGT,MAAO,MA5LT,GAAI0B,GAAO1E,EAAoB,KAC3BqB,EAAOrB,EAAoB,GAC3BgD,EAAS0B,EAAK1B,OAEdsD,EAAW5B,EAAK1B,OAAOsD,SACvBa,EAAS9F,EAAK8F,OACdC,EAAW1C,EAAK2C,OAAOD,QAmE3BlG,GAAQoG,UAAY,SAAU3B,GAC5B,MAAQA,aAAiBzE,GAI3B,IAAI0F,GAAMhF,EAAOrB,CAwHjBW,GAAQqG,MAAQ,SAAUC,GAKxB,GAJAZ,EAAOY,EACP5F,EAAQ,GACRrB,EAAI,IAEC6G,EAASR,GACZ,MAAO,KAGTH,KACAD,GACA,IAAIiB,GAAQT,GACZ,IAAIS,EAAO,CACT,GAAS,KAALlH,GAAiB,KAALA,EAId,MAFAkG,KACAD,IACIjG,EAEK,KAGF,GAAIW,GAAQ,EAAGwG,OAAOD,GAI7BjB,IACA,IAAImB,GAAYpH,CAChB,IAAiB,KAAboH,GAAiC,KAAbA,EAGtB,MADAnB,KACIjG,EAEK,KAGF,GAAIW,GAAQwG,OAAOD,GAAQ,EAIlChB,KACAD,GACA,IAAIoB,GAASZ,GACb,IAAIY,EAAQ,CACV,GAAS,KAALrH,GAAiB,KAALA,EAEd,MAAO,KAETkG,SAIA,IADAmB,EAASX,KACJW,EAEH,MAAO,KAeX,OAXiB,KAAbD,IAEAC,EADe,KAAbA,EAAO,GACC,IAAMA,EAAOC,UAAU,GAGxB,IAAMD,GAInBnB,IACAD,IACIjG,EAEK,KAGF,GAAIW,GAAQwG,OAAOD,GAAQC,OAAOE,IAO7C,OADAH,EAAQR,MAENT,IACIjG,EAEK,KAGF,GAAIW,GAAQ,EAAGwG,OAAOD,KAI1B,MAcTvG,EAAQiF,UAAY,SAAU7B,GAC5B,OAAQ0B,UAAUjC,QAChB,IAAK,GACH,GAAIkC,GAAMD,UAAU,EACpB,IAAkB,gBAARC,GACR,MAAO/E,GAAQiF,UAAUF,EAAIG,EAAGH,EAAII,IAEtC,MAAM,IAAIE,WAAU,iDAEtB,KAAK,GACH,GAAIH,GAAIJ,UAAU,GAChBK,EAAML,UAAU,EAClB,IAAGM,EAASF,GAAI,CAMd,GALIe,EAAOd,IAAQA,EAAIyB,QAAQzG,EAAK0G,WAAWC,SAE7C3B,EAAMA,EAAI4B,SAAS,QAGlB3B,EAASD,GACV,MAAO,IAAInF,GAAQkF,EAAI8B,KAAKC,IAAI9B,GAAMD,EAAI8B,KAAKE,IAAI/B,GAGrD,MAAM,IAAIE,WAAU,0CAEpB,KAAM,IAAIA,WAAU,4BAGxB,SACE,KAAM,IAAIR,aAAY,qDAS5B7E,EAAQmH,UAAUC,QAAU,WAC1B,OACElC,EAAG8B,KAAKK,KAAKzI,KAAK+F,GAAK/F,KAAK+F,GAAK/F,KAAKgG,GAAKhG,KAAKgG,IAChDO,IAAK6B,KAAKM,MAAM1I,KAAKgG,GAAIhG,KAAK+F,MAQlC3E,EAAQmH,UAAUI,MAAQ,WACxB,MAAO,IAAIvH,GAAQpB,KAAK+F,GAAI/F,KAAKgG,KAUnC5E,EAAQmH,UAAUK,OAAS,SAAUC,GACnC,MAAQ7I,MAAK+F,KAAO8C,EAAM9C,IAAQ/F,KAAKgG,KAAO6C,EAAM7C,IAYtD5E,EAAQmH,UAAUO,OAAS,SAAUC,GACnC,GAAIrB,GAAM,GACN1B,EAAKhG,KAAKgG,GACVD,EAAK/F,KAAK+F,GACViD,EAAQ9F,EAAO4F,OAAO9I,KAAK+F,GAAIgD,GAC/BE,EAAQ/F,EAAO4F,OAAO9I,KAAKgG,GAAI+C,GAG/B5F,EAAYqD,EAASuC,GAAWA,EAAUA,EAAUA,EAAQ5F,UAAY,IAC5E,IAAkB,OAAdA,EAAoB,CACtB,GAAIC,GAAUgF,KAAKc,IAAI,IAAK/F,EACxBiF,MAAKe,IAAIpD,EAAKC,GAAM5C,IAAU2C,EAAK,GACnCqC,KAAKe,IAAInD,EAAKD,GAAM3C,IAAU4C,EAAK,GAuCzC,MAlCE0B,GAFQ,GAAN1B,EAEIgD,EAEO,GAANjD,EAEG,GAANC,EACI,IAEO,IAANA,EACD,KAGAiD,EAAQ,IAKZjD,EAAK,EACG,GAANA,EACIgD,EAAQ,OAGRA,EAAQ,MAAQC,EAAQ,IAItB,IAANjD,EACIgD,EAAQ,OAGRA,EAAQ,MAAQC,EAAMlB,UAAU,GAAK,KAYnD3G,EAAQmH,UAAUa,SAAW,WAC3B,MAAOpJ,MAAK8I,UAQd1H,EAAQmH,UAAUc,OAAS,WACzB,OACEC,OAAQ,UACRvD,GAAI/F,KAAK+F,GACTC,GAAIhG,KAAKgG,KAYb5E,EAAQmI,SAAW,SAAUC,GAC3B,MAAO,IAAIpI,GAAQoI,IAOrBpI,EAAQmH,UAAU5D,QAAUvD,EAAQmH,UAAUa,SAG9CvJ,EAAOD,QAAUwB,GAKZ,SAASvB,EAAQD,EAASM,GAE/B,YAoCA,SAASmB,GAAMoI,EAAOC,EAAKC,GACzB,KAAM3J,eAAgBqB,IACpB,KAAM,IAAI4E,aAAY,mDAGxB,IAAa,MAATwD,IAAkBvG,EAAOsD,SAASiD,GACpC,KAAM,IAAIhD,WAAU,mCAEtB,IAAW,MAAPiD,IAAgBxG,EAAOsD,SAASkD,GAClC,KAAM,IAAIjD,WAAU,iCAEtB,IAAY,MAARkD,IAAiBzG,EAAOsD,SAASmD,GACnC,KAAM,IAAIlD,WAAU,kCAGtBzG,MAAKyJ,MAAkB,MAATA,EAAiBG,WAAWH,GAAS,EACnDzJ,KAAK0J,IAAgB,MAAPA,EAAeE,WAAWF,GAAO,EAC/C1J,KAAK2J,KAAiB,MAARA,EAAgBC,WAAWD,GAAQ,EAnDnD,CAAA,GAAI/E,GAAO1E,EAAoB,KAE3BgD,EAAS0B,EAAK1B,OACdqE,EAAS3C,EAAK2C,MACN3C,GAAKH,MA0DjBpD,EAAMoG,MAAQ,SAAUC,GACtB,IAAKH,EAAOD,SAASI,GACnB,MAAO,KAGT,IAAIlD,GAAOkD,EAAImC,MAAM,KACjBC,EAAOtF,EAAKzC,IAAI,SAAUoE,GAC5B,MAAOyD,YAAWzD,KAGhB4D,EAAUD,EAAKE,KAAK,SAAUC,GAChC,MAAOC,OAAMD,IAEf,IAAGF,EACD,MAAO,KAGT,QAAQD,EAAK7F,QACX,IAAK,GAAG,MAAO,IAAI5C,GAAMyI,EAAK,GAAIA,EAAK,GACvC,KAAK,GAAG,MAAO,IAAIzI,GAAMyI,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAChD,SAAS,MAAO,QAQpBzI,EAAMkH,UAAUI,MAAQ,WACtB,MAAO,IAAItH,GAAMrB,KAAKyJ,MAAOzJ,KAAK0J,IAAK1J,KAAK2J,OAQ9CtI,EAAM8I,QAAU,SAAUC,GACxB,MAAQA,aAAkB/I,IAQ5BA,EAAMkH,UAAU/C,KAAO,WACrB,GAAIH,GAAM,EACNoE,EAAQzJ,KAAKyJ,MACbE,EAAO3J,KAAK2J,KACZD,EAAM1J,KAAK0J,IACXW,EAAOX,EAAMD,CAYjB,OAVIvG,GAAOoH,KAAKX,IAASzG,EAAOoH,KAAKD,GACnChF,EAAM+C,KAAKmC,KAAK,EAASZ,GAEV,GAARU,IACPhF,EAAM,GAGJ6E,MAAM7E,KACRA,EAAM,IAEAA,IAOVhE,EAAMkH,UAAUrG,IAAM,WACpB,GAAIsD,GAAOxF,KAAKwF,OAAO,EAEvB,OAAIA,GAAO,EACLxF,KAAK2J,KAAO,EAEP3J,KAAKyJ,MAILzJ,KAAKyJ,OAASjE,EAAO,GAAKxF,KAAK2J,KAIjCa,QAQXnJ,EAAMkH,UAAUvG,IAAM,WACpB,GAAIwD,GAAOxF,KAAKwF,OAAO,EAEvB,OAAIA,GAAO,EACLxF,KAAK2J,KAAO,EAEP3J,KAAKyJ,OAASjE,EAAO,GAAKxF,KAAK2J,KAI/B3J,KAAKyJ,MAIPe,QAWXnJ,EAAMkH,UAAU1G,QAAU,SAAU4B,GAClC,GAAIqB,GAAI9E,KAAKyJ,MACTE,EAAO3J,KAAK2J,KACZD,EAAM1J,KAAK0J,IACXhG,EAAI,CAER,IAAIiG,EAAO,EACT,KAAWD,EAAJ5E,GACLrB,EAASqB,EAAGpB,EAAG1D,MACf8E,GAAK6E,EACLjG,QAGC,IAAW,EAAPiG,EACP,KAAO7E,EAAI4E,GACTjG,EAASqB,EAAGpB,EAAG1D,MACf8E,GAAK6E,EACLjG,KAaNrC,EAAMkH,UAAUxG,IAAM,SAAU0B,GAC9B,GAAIgB,KAIJ,OAHAzE,MAAK6B,QAAQ,SAAUgE,EAAO/D,EAAO2I,GACnChG,EAAM3C,GAAS2B,EAASoC,EAAO/D,EAAO2I,KAEjChG,GAOTpD,EAAMkH,UAAUmC,QAAU,WACxB,GAAIjG,KAIJ,OAHAzE,MAAK6B,QAAQ,SAAUgE,EAAO/D,GAC5B2C,EAAM3C,GAAS+D,IAEVpB,GAOTpD,EAAMkH,UAAU5D,QAAU,WAExB,MAAO3E,MAAK0K,WAYdrJ,EAAMkH,UAAUO,OAAS,SAAUC,GACjC,GAAIrB,GAAMxE,EAAO4F,OAAO9I,KAAKyJ,MAAOV,EAMpC,OAJiB,IAAb/I,KAAK2J,OACPjC,GAAO,IAAMxE,EAAO4F,OAAO9I,KAAK2J,KAAMZ,IAExCrB,GAAO,IAAMxE,EAAO4F,OAAO9I,KAAK0J,IAAKX,IAQvC1H,EAAMkH,UAAUa,SAAW,WACzB,MAAOpJ,MAAK8I,UAQdzH,EAAMkH,UAAUc,OAAS,WACvB,OACEC,OAAQ,QACRG,MAAOzJ,KAAKyJ,MACZC,IAAK1J,KAAK0J,IACVC,KAAM3J,KAAK2J,OAUftI,EAAMkI,SAAW,SAAUC,GACzB,MAAO,IAAInI,GAAMmI,EAAKC,MAAOD,EAAKE,IAAKF,EAAKG,OAI9C9J,EAAOD,QAAUyB,GAKZ,SAASxB,EAAQD,EAASM,GAE/B,YA+BA,SAASoB,GAAMqJ,GACb,KAAM3K,eAAgBsB,IACpB,KAAM,IAAI2E,aAAY,mDAGxBjG,MAAK4K,WACL5K,KAAK6K,WAAY,CAEjB,KAAK,GAAInH,GAAI,EAAGkC,EAAKM,UAAUjC,OAAY2B,EAAJlC,EAAQA,IAAK,CAClD,GAAIyC,GAAMD,UAAUxC,EAEpB,IAAIyC,YAAe9E,GACjBrB,KAAK4K,QAAQ9H,KAAKqD,GAClBnG,KAAK6K,WAAY,MAEd,IAAI9G,EAAQoC,GACfnG,KAAK4K,QAAQ9H,KAAKgI,EAAa3E,IAC/BnG,KAAK6K,WAAY,MAEd,IAAIrE,EAASL,GAChBnG,KAAK4K,QAAQ9H,KAAKgI,GAAc3E,EAAKA,EAAM,SAGxC,CACH,GAAI4E,GAAY5E,EAAIxB,SACpB,KAAIZ,EAAQgH,GAKV,KAAM,IAAItE,WAAU,4CAJpBzG,MAAK4K,QAAQ9H,KAAKgI,EAAaC,IAC/B/K,KAAK6K,WAAY,IAgBzB,QAASC,GAAa3E,GAKpB,IAAK,GADD8D,GAAM9D,EAAIlC,OACLP,EAAI,EAAOuG,EAAJvG,EAASA,IACvB,IAAK8C,EAASL,EAAIzC,MAAQsH,EAAU7E,EAAIzC,IACtC,KAAM,IAAI+C,WAAU,2CAIxB,QAAQN,EAAIlC,QACV,IAAK,GACH,MAAO,IAAI5C,GAAM8E,EAAI,GAAIA,EAAI,GAC/B,KAAK,GACH,MAAO,IAAI9E,GAAM8E,EAAI,GAAIA,EAAI,GAAIA,EAAI,GACvC,SAEE,KAAM,IAAIF,aAAY,yDA1F5B,GAAIrB,GAAO1E,EAAoB,KAE3BmB,EAAQnB,EAAoB,GAE5BgD,EAAS0B,EAAK1B,OAEdsD,EAAWtD,EAAOsD,SAClBwE,EAAY9H,EAAO8H,UACnBjH,EAAUD,MAAMC,OA0FpBzC,GAAMiH,UAAUI,MAAQ,WACtB,GAAI7G,GAAQ,GAAIR,EAGhB,OAFAQ,GAAM8I,QAAUhG,EAAKwF,OAAOzB,MAAM3I,KAAK4K,SACvC9I,EAAM+I,UAAY7K,KAAK6K,UAChB/I,GAQTR,EAAM2J,QAAU,SAAUb,GACxB,MAAQA,aAAkB9I,IAS5BA,EAAMX,OAAS,SAAUgK,GACvB,GAAI7I,GAAQ,GAAIR,EAEhB,OADAA,GAAM4J,MAAMpJ,EAAO6I,GACZ7I,GAOTR,EAAMiH,UAAU/C,KAAO,WAGrB,IAAK,GAFDA,MAEK9B,EAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAAK,CACrD,GAAIvB,GAAQnC,KAAK4K,QAAQlH,EAEzB8B,GAAK9B,GAAKvB,EAAMqD,OAAO,GAGzB,MAAOA,IAOTlE,EAAMiH,UAAUvG,IAAM,WAGpB,IAAK,GAFDmJ,MAEKzH,EAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAAK,CACrD,GAAIvB,GAAQnC,KAAK4K,QAAQlH,EACzByH,GAAOzH,GAAKvB,EAAMH,MAGpB,MAAOmJ,IAOT7J,EAAMiH,UAAUrG,IAAM,WAGpB,IAAK,GAFDiJ,MAEKzH,EAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAAK,CACrD,GAAIvB,GAAQnC,KAAK4K,QAAQlH,EAEzByH,GAAOzH,GAAKvB,EAAMD,MAGpB,MAAOiJ,IAST7J,EAAMiH,UAAU1G,QAAU,SAAU4B,GAClC,IAAK,GAAIC,GAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAChDD,EAASzD,KAAK4K,QAAQlH,GAAIA,EAAG1D,OASjCsB,EAAMiH,UAAUpG,MAAQ,SAASqB,GAC/B,MAAOxD,MAAK4K,QAAQpH,IAAQ,MAU9BlC,EAAMiH,UAAU6C,SAAW,WACzB,MAAOpL,MAAK6K,WAQdvJ,EAAMiH,UAAUmC,QAAU,WAExB,IAAK,GADDjG,MACKf,EAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAAK,CACrD,GAAIvB,GAAQnC,KAAK4K,QAAQlH,GACrB2H,KACAvG,EAAI3C,EAAMsH,MACVC,EAAMvH,EAAMuH,IACZC,EAAOxH,EAAMwH,IAEjB,IAAIA,EAAO,EACT,KAAWD,EAAJ5E,GACLuG,EAAIvI,KAAKgC,GACTA,GAAK6E,MAGJ,IAAW,EAAPA,EACP,KAAO7E,EAAI4E,GACT2B,EAAIvI,KAAKgC,GACTA,GAAK6E,CAITlF,GAAM3B,KAAKuI,GAGb,MAAO5G,IAQTnD,EAAMiH,UAAU5D,QAAUrD,EAAMiH,UAAUmC,QAM1CpJ,EAAMiH,UAAUa,SAAW,WAGzB,IAAK,GAFDkC,MAEK5H,EAAI,EAAGkC,EAAK5F,KAAK4K,QAAQ3G,OAAY2B,EAAJlC,EAAQA,IAAK,CACrD,GAAIvB,GAAQnC,KAAK4K,QAAQlH,GACrBgE,EAAMxE,EAAO4F,OAAO3G,EAAMsH,MACZ,IAAdtH,EAAMwH,OACRjC,GAAO,IAAMxE,EAAO4F,OAAO3G,EAAMwH,OAEnCjC,GAAO,IAAMxE,EAAO4F,OAAO3G,EAAMuH,KACjC4B,EAAQxI,KAAK4E,GAGf,MAAO,IAAM4D,EAAQC,KAAK,MAAQ,KAQpCjK,EAAMiH,UAAUc,OAAS,WACvB,OACEC,OAAQ,QACRqB,OAAQ3K,KAAK4K,UAUjBtJ,EAAMiI,SAAW,SAAUC,GACzB,MAAOlI,GAAMX,OAAO6I,EAAKmB,SAI3B9K,EAAOD,QAAU0B,GAKZ,SAASzB,EAAQD,EAASM,GAE/B,YAQA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAqBpC,QAAS6B,KACP,KAAM1E,eAAgB0E,IACpB,KAAM,IAAIuB,aAAY,oDAoM1B,MA3LAvB,GAAO8G,SAAW,SAAUpB,GAC1B,MAAQA,aAAkB1F,IAU5BA,EAAO+G,QAAU,SAAU3C,GAEzB,IAAKxB,EAASwB,GACZ,KAAM,IAAIrC,WAAU,gCAItB,IAAIiF,GAAchH,EAAOiH,SAAS7C,EAClC,KAAK4C,EACH,KAAM,IAAIzF,aAAY,sCAAwC6C,EAIhE,OAAO4C,IAIThH,EAAOiH,YAUPjH,EAAO6D,UAAUkD,QAAU,WAEzB,KAAM,IAAIhJ,OAAM,gDAgBlBiC,EAAO6D,UAAUnG,OAAS,SAAUN,EAAO8J,EAAaC,GAEtD,KAAM,IAAIpJ,OAAM,+CAQlBiC,EAAO6D,UAAUuD,IAAM,SAAUhK,GAE/B,KAAM,IAAIW,OAAM,4CAYlBiC,EAAO6D,UAAUwD,IAAM,SAAUjK,EAAO+D,EAAOgG,GAE7C,KAAM,IAAIpJ,OAAM,4CAelBiC,EAAO6D,UAAUyD,OAAS,SAAUxG,EAAMqG,GAExC,KAAM,IAAIpJ,OAAM,+CAOlBiC,EAAO6D,UAAUI,MAAQ,WAEvB,KAAM,IAAIlG,OAAM,8CAOlBiC,EAAO6D,UAAU/C,KAAO,WAEtB,KAAM,IAAI/C,OAAM,6CAalBiC,EAAO6D,UAAUxG,IAAM,SAAU0B,EAAUuB,GAEzC,KAAM,IAAIvC,OAAM,4CASlBiC,EAAO6D,UAAU1G,QAAU,SAAU4B,GAEnC,KAAM,IAAIhB,OAAM,gDAOlBiC,EAAO6D,UAAUmC,QAAU,WAEzB,KAAM,IAAIjI,OAAM,gDAOlBiC,EAAO6D,UAAU5D,QAAU,WAEzB,KAAM,IAAIlC,OAAM,gDAWlBiC,EAAO6D,UAAUO,OAAS,SAAUC,GAElC,KAAM,IAAItG,OAAM,+CAOlBiC,EAAO6D,UAAUa,SAAW,WAE1B,KAAM,IAAI3G,OAAM,iDAIXiC,EAjOT,GAAIE,GAAO1E,EAAoB,KAE3BqH,EAAS3C,EAAK2C,OAEdD,EAAWC,EAAOD,QAgOtB1H,GAAQkG,KAAO,SACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAyBA,SAASqB,GAAKsE,EAAOC,GACnB,KAAM9F,eAAgBuB,IACpB,KAAM,IAAIkB,OAAM,mDAGlB,IAAa+H,QAAT3E,IAAuBW,EAASX,GAClC,KAAM,IAAIY,WAAU,uDAEtB,IAAY+D,QAAR1E,KAAuBwB,EAASxB,IAAiB,IAARA,GAC3C,KAAM,IAAIW,WAAU,wDAGtB,IAAY+D,QAAR1E,EAAmB,CAErB,GAAIV,GAAM8G,EAAUpG,EACpB,KAAKV,EACH,KAAM,IAAIa,aAAY,iBAAmBH,EAAO,IAElD9F,MAAKmM,KAAO/G,EAAI+G,KAChBnM,KAAKoM,OAAShH,EAAIgH,WAGlBpM,MAAKmM,KAAOE,EACZrM,KAAKoM,OAASE,CAGhBtM,MAAK6F,MAAkB2E,QAAT3E,EAAsB7F,KAAKuM,WAAW1G,GAAS,KAC7D7F,KAAKwM,WAAY,EAQnB,QAAS9F,KACP,KAAY,KAALjG,GAAiB,KAALA,GACjBkG,IAIJ,QAASC,GAAYnG,GACnB,MAASA,IAAK,KAAY,KAALA,GAAkB,KAALA,EAGpC,QAASoG,GAASpG,GAChB,MAASA,IAAK,KAAY,KAALA,EAGvB,QAASkG,KACP7E,IACArB,EAAIqG,EAAKC,OAAOjF,GAGlB,QAASkF,GAAOC,GACdnF,EAAQmF,EACRxG,EAAIqG,EAAKC,OAAOjF,GAGlB,QAASoF,KACP,GACID,GADA/D,EAAS,EAYb,IAVA+D,EAAWnF,EAEF,KAALrB,EACFkG,IAEY,KAALlG,IACPyC,GAAUzC,EACVkG,MAGGC,EAAWnG,GAGd,MADAuG,GAAOC,GACA,IAIT,IAAS,KAALxG,GAGF,GAFAyC,GAAUzC,EACVkG,KACKE,EAAQpG,GAGX,MADAuG,GAAOC,GACA,SAGN,CACH,KAAOJ,EAAQpG,IACbyC,GAAUzC,EACVkG,GAEO,MAALlG,IACFyC,GAAUzC,EACVkG,KAGJ,KAAOE,EAAQpG,IACbyC,GAAUzC,EACVkG,GAIF,IAAS,KAALlG,GAAiB,KAALA,EAAU,CAUxB,GATAyC,GAAUzC,EACVkG,KAES,KAALlG,GAAiB,KAALA,KACdyC,GAAUzC,EACVkG,MAIGE,EAAQpG,GAGX,MADAuG,GAAOC,GACA,IAGT,MAAOJ,EAAQpG,IACbyC,GAAUzC,EACVkG,IAIJ,MAAOzD,GAGT,QAASuJ,KACP,GAAIC,GAAW,EAGf,KADAhG,IACOjG,GAAU,KAALA,GAAiB,KAALA,GACtBiM,GAAYjM,EACZkG,GAGF,OAAO+F,IAAY,KAwHrB,QAASR,GAAUxE,GACjB,IAAK,GAAI5B,KAAQ6G,GACf,GAAIA,EAAMC,eAAe9G,IACnByB,EAAOsF,SAASnF,EAAK5B,GAAQ,CAC/B,GAAIqG,GAAOQ,EAAM7G,GACbgH,EAAapF,EAAIzD,OAAS6B,EAAK7B,OAC/B8I,EAAarF,EAAIK,UAAU,EAAG+E,GAC9BV,EAASD,EAAKa,SAASD,EAC3B,IAAevC,SAAX4B,EAEF,OACED,KAAMA,EACNC,OAAQA,GAOlB,MAAO,MA5ST,GAwDItF,GAAMhF,EAAOrB,EAxDbmE,EAAO1E,EAAoB,KAE3BgD,EAAS0B,EAAK1B,OACdqE,EAAS3C,EAAK2C,OACdf,EAAW5B,EAAK1B,OAAOsD,SACvBc,EAAW1C,EAAK2C,OAAOD,QAqK3B/F,GAAKkG,MAAQ,SAASC,GAKpB,GAJAZ,EAAOY,EACP5F,EAAQ,GACRrB,EAAI,IAEC6G,EAASR,GACZ,MAAO,KAGTH,KACAD,GACA,IACIZ,GADAD,EAAQqB,GAEZ,IAAIrB,EAAO,CAKT,GAJAC,EAAO2G,IAEP9F,IACAD,IACIjG,EAEF,MAAO,KAGT,IAAIoF,GAASC,EACX,IAEE,MAAO,IAAIvE,GAAKqG,OAAO/B,GAAQC,GAEjC,MAAOmH,SAGN,CAKH,GAJAnH,EAAO2G,IAEP9F,IACAD,IACIjG,EAEF,MAAO,KAGT,IAAIqF,EACF,IAEE,MAAO,IAAIvE,GAAK,KAAMuE,GAExB,MAAOmH,KAIX,MAAO,OAQT1L,EAAK8F,OAAS,SAASxB,GACrB,MAAQA,aAAiBtE,IAO3BA,EAAKgH,UAAUI,MAAQ,WACrB,GAAIA,GAAQ,GAAIpH,EAEhB,KAAK,GAAIb,KAAKV,MACRA,KAAK4M,eAAelM,KACtBiI,EAAMjI,GAAKV,KAAKU,GAIpB,OAAOiI,IASTpH,EAAKgH,UAAUgE,WAAa,SAAS1G,GACnC,OAAQA,EAAQ7F,KAAKmM,KAAKe,QAAUlN,KAAKmM,KAAKtG,MAAQ7F,KAAKoM,OAAOvG,OAUpEtE,EAAKgH,UAAU4E,aAAe,SAAUtH,EAAOuH,GAC7C,MAAmB5C,SAAf4C,EACKvH,EAAQ7F,KAAKmM,KAAKtG,MAAQ7F,KAAKoM,OAAOvG,MAAQ7F,KAAKmM,KAAKe,OAGxDrH,EAAQ7F,KAAKmM,KAAKtG,MAAQuH,EAAcpN,KAAKmM,KAAKe,QAwC7D3L,EAAK8L,gBAAkB,SAAUvH,GAC/B,MAA2B,OAAnBoG,EAAUpG,IAOpBvE,EAAKgH,UAAUP,QAAU,SAASsF,GAChC,MAAQtN,MAAKmM,KAAKmB,OAASA,GAQ7B/L,EAAKgH,UAAUgF,UAAY,SAAS1E,GAClC,MAAQ7I,MAAKmM,KAAKmB,OAASzE,EAAMsD,KAAKmB,MAQxC/L,EAAKgH,UAAUK,OAAS,SAASC,GAC/B,MAAQ7I,MAAKuN,UAAU1E,IAAU7I,KAAK6F,OAASgD,EAAMhD,OAQvDtE,EAAKgH,UAAUiF,GAAK,SAAUC,GAC5B,GAAI5E,GACAhD,EAAsB,MAAd7F,KAAK6F,MAAgB7F,KAAKuM,WAAW,GAAKvM,KAAK6F,KAC3D,IAAIyB,EAASmG,GAAgB,CAG3B,GAFA5E,EAAQ,GAAItH,GAAK,KAAMkM,IAElBzN,KAAKuN,UAAU1E,GAClB,KAAM,IAAIpG,OAAM,qBAKlB,OAFAoG,GAAMhD,MAAQA,EACdgD,EAAM2D,WAAY,EACX3D,EAEJ,GAAI4E,YAAyBlM,GAAM,CACtC,IAAKvB,KAAKuN,UAAUE,GAClB,KAAM,IAAIhL,OAAM,qBAElB,IAA4B,OAAxBgL,EAAc5H,MAChB,KAAM,IAAIpD,OAAM,wCAMlB,OAHAoG,GAAQ4E,EAAc9E,QACtBE,EAAMhD,MAAQA,EACdgD,EAAM2D,WAAY,EACX3D,EAGP,KAAM,IAAIpG,OAAM,yCASpBlB,EAAKgH,UAAUJ,SAAW,SAAUsF,GAClC,GAAI5E,GAAQ7I,KAAKwN,GAAGC,EACpB,OAAO5E,GAAMsE,aAAatE,EAAMhD,MAAOgD,EAAMuD,OAAOvG,QAQtDtE,EAAKgH,UAAUa,SAAW,WACxB,MAAOpJ,MAAK8I,UAQdvH,EAAKgH,UAAUc,OAAS,WACtB,OACEC,OAAQ,OACRzD,MAAO7F,KAAKmN,aAAanN,KAAK6F,OAC9BsG,KAAMnM,KAAKoM,OAAOtG,KAAO9F,KAAKmM,KAAKrG,KACnC0G,UAAWxM,KAAKwM,YAUpBjL,EAAKgI,SAAW,SAAUC,GACxB,GAAI2C,GAAO,GAAI5K,GAAKiI,EAAK3D,MAAO2D,EAAK2C,KAErC,OADAA,GAAKK,UAAYhD,EAAKgD,YAAa,EAC5BL,GAOT5K,EAAKgH,UAAU5D,QAAUpD,EAAKgH,UAAUa,SAUxC7H,EAAKgH,UAAUO,OAAS,SAASC,GAC/B,GAAIlD,GACA6B,CAEJ,IAAmB,OAAf1H,KAAK6F,OAAmB7F,KAAKwM,UAO/B3G,EAAQ7F,KAAKmN,aAAanN,KAAK6F,OAC/B6B,EAAsB,OAAf1H,KAAK6F,MAAmB3C,EAAO4F,OAAOjD,EAAOkD,GAAW,IAAO,GACtErB,GAAO1H,KAAKoM,OAAOtG,KAAO9F,KAAKmM,KAAKrG,SATM,CAC1C,GAAI4H,GAAa1N,KAAK2N,aACtB9H,GAAQ7F,KAAKmN,aAAanN,KAAK6F,MAAO6H,EAAW7H,OACjD6B,EAAMxE,EAAO4F,OAAOjD,EAAOkD,GAAW,IACtCrB,GAAOgG,EAAW5H,KAAO9F,KAAKmM,KAAKrG,KAQrC,MAAO4B,IAQTnG,EAAKgH,UAAUoF,YAAc,WAK3B,GAAIC,GAAWxF,KAAKe,IAAInJ,KAAK6F,MAAQ7F,KAAKmM,KAAKtG,OAC3C6H,EAAapB,EACbuB,EAAWzF,KAAKe,IAChBf,KAAK0F,IAAIF,EAAWF,EAAW7H,OAASuC,KAAK2F,KAAO,KAEpDf,EAAWhN,KAAKmM,KAAKa,QACzB,KAAK,GAAItM,KAAKsM,GACZ,GAAIA,EAASJ,eAAelM,GAAI,CAC9B,GAAI0L,GAASY,EAAStM,EACtB,IAAI0L,EAAO4B,WAAY,CACrB,GAAI3D,GAAOjC,KAAKe,IACZf,KAAK0F,IAAIF,EAAWxB,EAAOvG,OAASuC,KAAK2F,KAAO,IAEzCF,GAAPxD,IACFqD,EAAatB,EACbyB,EAAWxD,IAMnB,MAAOqD,GAGT,IAAIO,IACFC,MACE,IAAKpI,KAAM,GAAID,MAAO,EAAGmI,YAAY,IAEvCG,OACE,IAAKrI,KAAM,GAAID,MAAO,EAAGmI,YAAY,GAErCI,IAAOtI,KAAM,KAAMD,MAAO,GAAKmI,YAAY,GAC3CK,GAAMvI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCM,GAAMxI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCO,GAAMzI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCQ,GAAM1I,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCS,GAAM3I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CU,GAAM5I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CW,GAAM7I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CY,GAAM9I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ca,GAAM/I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAE1Cc,GAAMhJ,KAAM,IAAKD,MAAO,GAAMmI,YAAY,GAC1CvN,GAAMqF,KAAM,IAAKD,MAAO,IAAMmI,YAAY,GAC1CxN,GAAMsF,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ce,GAAMjJ,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CgB,GAAMlJ,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CtN,GAAMoF,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CiB,GAAMnJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CkB,GAAMpJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CmB,GAAMrJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CoB,GAAMtJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,IAE7CqB,MACE,IAAKvJ,KAAM,GAAID,MAAO,EAAGmI,YAAY,GAErCsB,MAASxJ,KAAM,OAAQD,MAAO,GAAKmI,YAAY,GAC/CuB,OAAUzJ,KAAM,QAASD,MAAO,IAAKmI,YAAY,GACjDwB,MAAS1J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/CyB,MAAS3J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/C0B,MAAS5J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/C2B,MAAS7J,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChD4B,MAAS9J,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChD6B,KAAQ/J,KAAM,MAAOD,MAAO,KAAMmI,YAAY,GAC9C8B,OAAUhK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAClD+B,OAAUjK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAElDgC,MAASlK,KAAM,OAAQD,MAAO,GAAMmI,YAAY,GAChDiC,OAAUnK,KAAM,QAASD,MAAO,IAAMmI,YAAY,GAClDkC,OAAUpK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAClDmC,OAAUrK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAClDoC,MAAStK,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChDqC,MAASvK,KAAM,OAAQD,MAAO,MAAOmI,YAAY,GACjDsC,OAAUxK,KAAM,QAASD,MAAO,MAAOmI,YAAY,GACnDuC,MAASzK,KAAM,OAAQD,MAAO,MAAOmI,YAAY,GACjDwC,OAAU1K,KAAM,QAASD,MAAO,MAAOmI,YAAY,GACnDyC,OAAU3K,KAAM,QAASD,MAAO,MAAOmI,YAAY,IAErD0C,SACE,IAAK5K,KAAM,GAAID,MAAO,EAAGmI,YAAY,GAErCI,IAAOtI,KAAM,KAAMD,MAAO,IAAKmI,YAAY,GAC3CK,GAAMvI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCM,GAAMxI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCO,GAAMzI,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CQ,GAAM1I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CS,GAAM3I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CU,GAAM5I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CW,GAAM7I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CY,GAAM9I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ca,GAAM/I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAE1Cc,GAAMhJ,KAAM,IAAKD,MAAO,IAAMmI,YAAY,GAC1CvN,GAAMqF,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CxN,GAAMsF,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ce,GAAMjJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CgB,GAAMlJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CtN,GAAMoF,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CiB,GAAMnJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CkB,GAAMpJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CmB,GAAMrJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CoB,GAAMtJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,IAE7C2C,OACE,IAAK7K,KAAM,GAAID,MAAO,EAAGmI,YAAY,GAErCI,IAAOtI,KAAM,KAAMD,MAAO,IAAKmI,YAAY,GAC3CK,GAAMvI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCM,GAAMxI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCO,GAAMzI,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CQ,GAAM1I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CS,GAAM3I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CU,GAAM5I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CW,GAAM7I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CY,GAAM9I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ca,GAAM/I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAE1Cc,GAAMhJ,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CvN,GAAMqF,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CxN,GAAMsF,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ce,GAAMjJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CgB,GAAMlJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CtN,GAAMoF,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CiB,GAAMnJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CkB,GAAMpJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CmB,GAAMrJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,GAC3CoB,GAAMtJ,KAAM,IAAKD,MAAO,MAAOmI,YAAY,IAE7C4C,cACE,IAAK9K,KAAM,GAAID,MAAO,EAAGmI,YAAY,GACrCM,GAAMxI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCO,GAAMzI,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCQ,GAAM1I,KAAM,IAAKD,MAAO,IAAKmI,YAAY,GACzCS,GAAM3I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CU,GAAM5I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CW,GAAM7I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1CY,GAAM9I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAC1Ca,GAAM/I,KAAM,IAAKD,MAAO,KAAMmI,YAAY,GAE1C6C,IAAO/K,KAAM,KAAMD,MAAO,KAAMmI,YAAY,GAC5C8C,IAAOhL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzD+C,IAAOjL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzDgD,IAAOlL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzDiD,IAAOnL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzDkD,IAAOpL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzDmD,IAAOrL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GACzDoD,IAAOtL,KAAM,KAAMD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,IAE3DqD,aACE,IAAKvL,KAAM,GAAID,MAAO,EAAGmI,YAAY,GACrCwB,MAAS1J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/CyB,MAAS3J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/C0B,MAAS5J,KAAM,OAAQD,MAAO,IAAKmI,YAAY,GAC/C2B,MAAS7J,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChD4B,MAAS9J,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChD6B,KAAS/J,KAAM,MAAOD,MAAO,KAAMmI,YAAY,GAC/C8B,OAAUhK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAClD+B,OAAUjK,KAAM,QAASD,MAAO,KAAMmI,YAAY,GAElDsD,MAASxL,KAAM,OAAQD,MAAO,KAAMmI,YAAY,GAChDuD,MAASzL,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC7DwD,MAAS1L,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC7DyD,MAAS3L,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC7D0D,MAAS5L,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC7D2D,KAAS7L,KAAM,MAAOD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC5D4D,MAAS9L,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,GAC7D6D,MAAS/L,KAAM,OAAQD,MAAOuC,KAAKc,IAAI,KAAM,GAAI8E,YAAY,KAI7D1B,GAAexG,KAAM,GAAID,MAAO,EAAGmI,YAAY,GAE/C/F,GACFiG,QAEA4D,UACAC,QACAC,QACAC,WACAC,eACAC,sBACAC,uBAEAC,SACAC,WACAC,UACArK,SACAsK,QAGEC,KAEApG,GAAavG,KAAM,GAAIwH,KAAMmF,EAAgB5M,MAAO,EAAGqH,OAAQ,GAE/DP,GAEF+F,OAAQ5M,KAAM,QAASwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASoB,KAAMxJ,MAAO,EAAGqH,OAAQ,GAC3FyF,MAAO7M,KAAM,OAAQwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC9F0F,MAAO9M,KAAM,OAAQwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC9F2F,MAAO/M,KAAM,OAAQwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC9F4F,MAAOhN,KAAM,OAAQwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,SAAUqH,OAAQ,GAChG6F,MAAOjN,KAAM,OAAQwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAAUqH,OAAQ,GAChG8F,KAAMlN,KAAM,MAAOwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAAUqH,OAAQ,GAC9F+F,OAAQnN,KAAM,QAASwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAASqH,OAAQ,GACjGgG,UAAWpN,KAAM,WAAYwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAOqH,OAAQ,GAErG1M,GAAIsF,KAAM,IAAKwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASE,MAAOtI,MAAO,EAAGqH,OAAQ,GACpFiG,MAAOrN,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC5FkG,IAAKtN,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC1FmG,IAAKvN,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,MAAQqH,OAAQ,GAC1FoG,IAAKxN,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,SAAUqH,OAAQ,GAC5FqG,IAAKzN,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAAUqH,OAAQ,GAC5FsG,IAAK1N,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAAUqH,OAAQ,GAC5FuG,IAAK3N,KAAM,KAAMwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,QAASqH,OAAQ,GAC3FwG,KAAM5N,KAAM,MAAOwH,KAAMrF,EAAW6J,OAAQ9E,SAAUiB,EAASC,KAAMrI,MAAO,OAAWqH,OAAQ,GAG/FyG,IAAK7N,KAAM,KAAMwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASyC,QAAS7K,MAAO,EAAGqH,OAAQ,GACzF0G,MAAO9N,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,SAAYqH,OAAQ,GACnG2G,MAAO/N,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,UAAYqH,OAAQ,GACnG4G,MAAOhO,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,UAAYqH,OAAQ,GACnG6G,MAAOjO,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,eAAgBqH,OAAQ,GACvG8G,MAAOlO,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,SAAUqH,OAAQ,GACjG+G,MAAOnO,KAAM,OAAQwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,SAAUqH,OAAQ,GACjGgH,OAAQpO,KAAM,QAASwH,KAAMrF,EAAWqK,QAAStF,SAAUiB,EAASC,KAAMrI,MAAO,WAAYqH,OAAQ,GAGrGiH,IAAKrO,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAAS0C,MAAO9K,MAAO,EAAGqH,OAAQ,GACtFkH,GAAItO,KAAM,IAAKwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASE,MAAOtI,MAAO,KAAOqH,OAAQ,GACxFmH,GAAIvO,KAAM,IAAKwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASE,MAAOtI,MAAO,KAAOqH,OAAQ,GACxFoH,OAAQxO,KAAM,QAASwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASoB,KAAMxJ,MAAO,KAAOqH,OAAQ,GAC/FqH,MAAOzO,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,aAAcqH,OAAQ,GACpGsH,MAAO1O,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,cAAgBqH,OAAQ,GACtGuH,MAAO3O,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,cAAgBqH,OAAQ,GACtGwH,UAAW5O,KAAM,WAAYwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,KAAUqH,OAAQ,GACxGyH,YAAa7O,KAAM,aAAcwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,MAAUqH,OAAQ,GAE5G0H,MAAO9O,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GAC5F2H,KAAM/O,KAAM,MAAOwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GAG1F4H,OAAQhP,KAAM,QAASwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAkBqH,OAAQ,GAC1G6H,WAAYjP,KAAM,YAAawH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,aAAiBqH,OAAQ,GACjH8H,YAAalP,KAAM,aAAcwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAeqH,OAAQ,GACjH+H,MAAOnP,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GACpGgI,IAAKpP,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GACxFiI,KAAMrP,KAAM,MAAOwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GAClGkI,MAAOtP,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GACpGmI,OAAQvP,KAAM,QAASwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GACtGoI,QAASxP,KAAM,SAAUwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,WAAaqH,OAAQ,GACvGqI,YAAazP,KAAM,aAAcwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,SAAWqH,OAAQ,GAC7GsI,WAAY1P,KAAM,YAAawH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,SAAWqH,OAAQ,GAC3GuI,UAAW3P,KAAM,WAAYwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,QAAWqH,OAAQ,GAGzGwI,MAAO5P,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,aAAiBqH,OAAQ,GACvGyI,MAAO7P,KAAM,OAAQwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAeqH,OAAQ,GACrG0I,IAAK9P,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GAChG2I,IAAK/P,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GAChG4I,IAAKhQ,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GAChG6I,IAAKjQ,KAAM,KAAMwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,YAAcqH,OAAQ,GAChG8I,KAAMlQ,KAAM,MAAOwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,WAAaqH,OAAQ,GACjG+I,KAAMnQ,KAAM,MAAOwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,SAAWqH,OAAQ,GAC/FgJ,KAAMpQ,KAAM,MAAOwH,KAAMrF,EAAWsK,OAAQvF,SAAUiB,EAASC,KAAMrI,MAAO,SAAWqH,OAAQ,GAI/FiJ,GAAIrQ,KAAM,IAAKwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASE,MAAOtI,MAAO,KAAOqH,OAAQ,GACtFkJ,MAAOtQ,KAAM,OAAQwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASoB,KAAMxJ,MAAO,KAAOqH,OAAQ,GAE3FmJ,KAAMvQ,KAAM,MAAOwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASE,MAAOtI,MAAO,UAAWqH,OAAQ,GAC9FoJ,OAAQxQ,KAAM,QAASwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASE,MAAOtI,MAAO,IAAMqH,OAAQ,GAE7FqJ,OAAQzQ,KAAM,QAASwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,YAAaqH,OAAQ,GACnGsJ,MAAO1Q,KAAM,OAAQwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,kBAAoBqH,OAAQ,GACxGuJ,OAAQ3Q,KAAM,QAASwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,cAAiBqH,OAAQ,GACvGwJ,WAAY5Q,KAAM,YAAawH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,UAAcqH,OAAQ,GAC5GyJ,eAAgB7Q,KAAM,gBAAiBwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,UAAWqH,OAAQ,GACjH0J,OAAQ9Q,KAAM,QAASwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,KAAQqH,OAAQ,GAC9F2J,OAAQ/Q,KAAM,QAASwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GAE5F4J,IAAKhR,KAAM,KAAMwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,YAAaqH,OAAQ,GAC7F6J,IAAKjR,KAAM,KAAMwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,kBAAoBqH,OAAQ,GACpG8J,IAAKlR,KAAM,KAAMwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,cAAiBqH,OAAQ,GACjG+J,KAAMnR,KAAM,MAAOwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,UAAcqH,OAAQ,GAChGgK,KAAMpR,KAAM,MAAOwH,KAAMrF,EAAW8J,KAAM/E,SAAUiB,EAASC,KAAMrI,MAAO,UAAWqH,OAAQ,GAG7FiK,GAAIrR,KAAM,IAAKwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASE,MAAOtI,MAAO,EAAGqH,OAAQ,GAClFhL,KAAM4D,KAAM,MAAOwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASC,KAAMrI,MAAO,GAAIqH,OAAQ,GACtFmB,GAAIvI,KAAM,IAAKwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GACpFpF,QAAShC,KAAM,SAAUwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASoB,KAAMxJ,MAAO,EAAGqH,OAAQ,GAC3FkK,KAAMtR,KAAM,MAAOwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASoB,KAAMxJ,MAAO,EAAGqH,OAAQ,GACrFmK,QAASvR,KAAM,SAAUwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASC,KAAMrI,MAAO,GAAIqH,OAAQ,GAC5FoK,MAAOxR,KAAM,OAAQwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASC,KAAMrI,MAAO,KAAMqH,OAAQ,GAC1FqK,KAAMzR,KAAM,MAAOwH,KAAMrF,EAAW+J,KAAMhF,SAAUiB,EAASC,KAAMrI,MAAO,MAAOqH,OAAQ,GAGzFsK,KAAM1R,KAAM,MAAOwH,KAAMrF,EAAWC,MAAO8E,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GAEtFuK,KAAM3R,KAAM,MAAOwH,KAAMrF,EAAWC,MAAO8E,SAAUiB,EAASC,KAAMrI,MAAO,oBAAqCqH,OAAQ,GAExHwK,MAAO5R,KAAM,OAAQwH,KAAMrF,EAAWC,MAAO8E,SAAUiB,EAASC,KAAMrI,MAAO,oBAAqCqH,OAAQ,GAE1HyK,OAAQ7R,KAAM,QAASwH,KAAMrF,EAAWC,MAAO8E,SAAUiB,EAASC,KAAMrI,MAAO,kBAAmCqH,OAAQ,GAG1H0K,GAAI9R,KAAM,IAAKwH,KAAMrF,EAAWgK,QAASjF,SAAUiB,EAASE,MAAOtI,MAAO,EAAGqH,OAAQ,GACrF2K,QAAS/R,KAAM,SAAUwH,KAAMrF,EAAWgK,QAASjF,SAAUiB,EAASoB,KAAMxJ,MAAO,EAAGqH,OAAQ,GAM9F4K,GAAIhS,KAAM,IAAKwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GACxF6K,MAAOjS,KAAM,OAAQwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,QAC9F8K,MAAOlS,KAAM,OAAQwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAE,IAAKqH,OAAQ,QAClG+K,MAAOnS,KAAM,OAAQwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAE,IAAKqH,OAAQ,GAClGgL,QAASpS,KAAM,SAAUwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GAClGiL,SAAUrS,KAAM,UAAWwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,QACpGkL,YAAatS,KAAM,aAAcwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAE,IAAKqH,OAAQ,QAC9GmL,SAAUvS,KAAM,UAAWwH,KAAMrF,EAAWiK,YAAalF,SAAUiB,EAASC,KAAMrI,MAAO,EAAE,IAAKqH,OAAQ,GAGxGoL,KAAMxS,KAAM,MAAOwH,KAAMrF,EAAWmK,oBAAqBpF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GACpGqL,MAAOzS,KAAM,OAAQwH,KAAMrF,EAAWmK,oBAAqBpF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GAGtGsL,IAAK1S,KAAM,KAAMwH,KAAMrF,EAAWkK,mBAAoBnF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GACjGuL,SAAU3S,KAAM,UAAWwH,KAAMrF,EAAWkK,mBAAoBnF,SAAUiB,EAASC,KAAMrI,MAAO,EAAGqH,OAAQ,GAM3GwL,GAAI5S,KAAM,IAAKwH,KAAMrF,EAAWoK,MAAOrF,SAAUiB,EAASE,MAAOtI,MAAO,EAAGqH,OAAQ,GACnFyL,QAAS7S,KAAM,SAAUwH,KAAMrF,EAAWoK,MAAOrF,SAAUiB,EAASoB,KAAMxJ,MAAO,EAAGqH,OAAQ,GAC5F0L,KAAM9S,KAAM,MAAOwH,KAAMrF,EAAWoK;AAAOrF,SAAUiB,EAASC,KAAMrI,MAAO,gBAAiBqH,OAAQ,GACpG2L,YAAa/S,KAAM,aAAcwH,KAAMrF,EAAWoK,MAAOrF,SAAUiB,EAASC,KAAMrI,MAAO,gBAAiBqH,OAAQ,GAGlH4L,GAAIhT,KAAM,IAAKwH,KAAMrF,EAAWuK,IAAKxF,SAAUiB,EAAS2C,aAAc/K,MAAO,EAAGqH,OAAQ,GACxF6L,MAAOjT,KAAM,OAAQwH,KAAMrF,EAAWuK,IAAKxF,SAAUiB,EAASoD,YAAaxL,MAAO,EAAGqH,OAAQ,GAC7F8L,GAAIlT,KAAM,IAAKwH,KAAMrF,EAAWuK,IAAKxF,SAAUiB,EAAS2C,aAAc/K,MAAO,EAAGqH,OAAQ,GACxF+L,OAAQnT,KAAM,QAASwH,KAAMrF,EAAWuK,IAAKxF,SAAUiB,EAASoD,YAAaxL,MAAO,EAAGqH,OAAQ,IAI7FgM,GACFC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WAEXC,OAAQ,QACRC,UAAW,WACXC,YAAa,aACbC,OAAQ,QACRC,WAAY,YACZC,YAAa,aACbC,MAAO,OACPC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,QAAS,SACTC,YAAa,aACbC,WAAY,YACZC,UAAW,WACXC,KAAM,MAENC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QAERC,QAAS,SACTC,QAAS,SACTC,MAAO,OACPC,KAAM,MAENC,QAAS,MACTC,QAAS,MACTC,UAAW,OACXC,OAAQ,QAERC,QAAS,SACTC,MAAO,OAGT,KAAK,GAAI/V,KAAQoT,GAEf,GAAIA,EAAQtM,eAAe9G,GAAO,CAChC,GAAIqG,GAAOQ,EAAMuM,EAAQpT,IACrBgW,EAAS9Y,OAAOrC,OAAOwL,EAC3B2P,GAAOhW,KAAOA,EACd6G,EAAM7G,GAAQgW,EAKlBnP,EAAMoP,GAAKpP,EAAM0H,EACjB1H,EAAMqP,MAAQrP,EAAM2H,MACpB3H,EAAMsP,OAAStP,EAAMiN,OACrBjN,EAAMuP,GAAKvP,EAAMsK,IACjBtK,EAAMwP,IAAMxP,EAAMsK,IAGlB1V,EAAK0M,SAAWA,EAChB1M,EAAK0G,WAAaA,EAClB1G,EAAKoL,MAAQA,EAMb9M,EAAOD,QAAU2B,GAKZ,SAAS1B,EAAQD,EAASM,GAE/B,YAiBA,SAASsB,GAAM4a,GACb,KAAMpc,eAAgBwB,IACpB,KAAM,IAAIyE,aAAY,mDAGxB,KAAKmW,EAAM,KAAM,IAAI3Z,OAAM,yBAE3BzC,MAAKoc,IAAMA,EAtBb,GAAIxX,GAAO1E,EAAoB,KAC3BkK,EAASxF,EAAKwF,OACd7C,EAAS3C,EAAK2C,MA4BlB/F,GAAK6a,OAAS,SAAUxW,GACtB,MAAQA,aAAiBrE,IAS3BA,EAAK+G,UAAU+T,OAAS,SAAUzb,GAChC,GAAIub,GAAMpc,KAAKoc,QACXG,EAAO,IAcX,IAZIH,EAAItW,OACNyW,GAAQ,SAAWH,EAAItW,KAAO,QAE5BsW,EAAII,WACND,GAAQ,aAAeH,EAAII,SAAW,QAEpCJ,EAAIK,cACNF,GAAQ,qBAAuBH,EAAIK,YAAc,QAE/CL,EAAIM,SACNH,GAAQ,gBAAkBH,EAAIM,OAAOnR,KAAK,UAAY,QAEpD6Q,EAAIO,SAAU,CAChB,GAAIC,GAAS/b,GAAQA,EAAK+b,QAC1BL,IAAQ,aACR,KAAK,GAAI7Y,GAAI,EAAGA,EAAI0Y,EAAIO,SAAS1Y,OAAQP,IAAK,CAC5C,GAAImZ,GAAOT,EAAIO,SAASjZ,EAGxB,IAFA6Y,GAAQ,OAASM,EAAO,KAEpBD,EAAQ,CACV,GAAIxX,EACJ,KACEA,EAAMwX,EAAOE,KAAKD,GAEpB,MAAOE,GACL3X,EAAM2X,EAEIvS,SAARpF,GAAuBA,YAAe5D,KACxC+a,GAAQ,WAAahV,EAAOuB,OAAO1D,GAAMjC,UAAW,KAAO,OAIjEoZ,GAAQ,KAMV,MAJIH,GAAIY,UACNT,GAAQ,aAAeH,EAAIY,QAAQzR,KAAK,MAAQ,MAG3CgR,GAQT/a,EAAK+G,UAAUa,SAAW,WACxB,MAAOpJ,MAAKsc,UAMd9a,EAAK+G,UAAUc,OAAS,WACtB,GAAIoB,GAAML,EAAOzB,MAAM3I,KAAKoc,IAE5B,OADA3R,GAAInB,OAAS,OACNmB,GAQTjJ,EAAK+H,SAAW,SAAUC,GACxB,GAAI4S,KACJ,KAAK,GAAIa,KAAQzT,GACF,WAATyT,IACFb,EAAIa,GAAQzT,EAAKyT,GAGrB,OAAO,IAAIzb,GAAK4a,IAMlB5a,EAAK+G,UAAU5D,QAAUnD,EAAK+G,UAAUa,SAGxCvJ,EAAOD,QAAU4B,GAKZ,SAAS3B,EAAQD,EAASM,GAE/B,YAOA,SAASuB,GAAUyb,GACjB,KAAMld,eAAgByB,IACpB,KAAM,IAAIwE,aAAY,mDAGxBjG,MAAKkd,QAAUA,MAOjBzb,EAAU8G,UAAU5D,QAAU,WAC5B,MAAO3E,MAAKkd,SAOdzb,EAAU8G,UAAUa,SAAW,WAC7B,MAAO,IAAMpJ,KAAKkd,QAAQ3R,KAAK,MAAQ,KAQzC9J,EAAU8G,UAAUc,OAAS,WAC3B,OACEC,OAAQ,YACR4T,QAASld,KAAKkd,UAUlBzb,EAAU8H,SAAW,SAAUC,GAC7B,MAAO,IAAI/H,GAAU+H,EAAK0T,UAG5Brd,EAAOD,QAAU6B,GAKZ,SAAS5B,EAAQD,EAASM,GAK/B,QAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIsa,GAAYC,EAAQ1R,YAAY9K,EA2BpC,IAnBAuc,EAAU5U,UAAUc,OAAS,WAC3B,OACEC,OAAQ,YACRzD,MAAO7F,KAAKoJ,aAUhB+T,EAAU5T,SAAW,SAAUC,GAC7B,MAAO,IAAI2T,GAAU3T,EAAK3D,QAKK,kBAAtBsX,GAAUE,QAkBnB,KAAM,IAAI5a,OAAM,oEAGlB,OAbE0a,GAAUE,QAAU,SAASna,GAC3B,MAAIoa,GAAOpa,GAAU,GACZA,EAGA,GAAIia,GAAUja,IAQpBia,EApDT,GAAIC,GAAUld,EAAoB,KAC9Bod,EAASpd,EAAoB,KAAKod,MAsDtC1d,GAAQkG,KAAO,YACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAOpC,QAAS0a,KACP,KAAMvd,eAAgBud,IACpB,KAAM,IAAItX,aAAY,mDAGxBjG,MAAKwd,SAAW,KAChBxd,KAAKyd,MAAQ,EAXf,GAAIC,GAAUlb,EAAKtC,EAAoB,MACnCyd,EAASnb,EAAKtC,EAAoB,MAElC0d,EAAgB,EAAMxV,KAAK0F,KAAK,EAAM1F,KAAKK,KAAK,IAAQ,EAgB5D8U,GAAchV,UAAUsV,OAAS,SAAUC,EAAKjY,GAE9C,GAAI5E,IACF6c,IAAKA,EACLjY,MAAOA,EACPkY,OAAQ,EAGV,IAAI/d,KAAKwd,SAAU,CAEjB,GAAIQ,GAAUhe,KAAKwd,QAEnBvc,GAAKgd,KAAOD,EACZ/c,EAAKid,MAAQF,EAAQE,MACrBF,EAAQE,MAAQjd,EAChBA,EAAKid,MAAMD,KAAOhd,EAEdyc,EAAQI,EAAKE,EAAQF,OAEvB9d,KAAKwd,SAAWvc,OAKlBA,GAAKgd,KAAOhd,EACZA,EAAKid,MAAQjd,EAEbjB,KAAKwd,SAAWvc,CAKlB,OAFAjB,MAAKyd,QAEExc,GAMTsc,EAAchV,UAAU/C,KAAO,WAC7B,MAAOxF,MAAKyd,OAMdF,EAAchV,UAAU4V,MAAQ,WAC9Bne,KAAKwd,SAAW,KAChBxd,KAAKyd,MAAQ,GAMfF,EAAchV,UAAU6V,QAAU,WAChC,QAASpe,KAAKwd,UAOhBD,EAAchV,UAAU8V,eAAiB,WAEvC,GAAIpd,GAAOjB,KAAKwd,QAEhB,IAAa,OAATvc,EACF,MAAOA,EAQT,KANA,GAAI+c,GAAUhe,KAAKwd,SAEfc,EAAmBrd,EAAK8c,OAExBjZ,EAAI7D,EAAKsd,MAEND,EAAmB,GAAG,CAE3B,GAAIE,GAAY1Z,EAAEoZ,KAElBpZ,GAAEmZ,KAAKC,MAAQpZ,EAAEoZ,MACjBpZ,EAAEoZ,MAAMD,KAAOnZ,EAAEmZ,KAEjBnZ,EAAEmZ,KAAOD,EACTlZ,EAAEoZ,MAAQF,EAAQE,MAClBF,EAAQE,MAAQpZ,EAChBA,EAAEoZ,MAAMD,KAAOnZ,EAEfA,EAAE2Z,OAAS,KACX3Z,EAAI0Z,EACJF,IAqBF,MAlBArd,GAAKgd,KAAKC,MAAQjd,EAAKid,MACvBjd,EAAKid,MAAMD,KAAOhd,EAAKgd,KAEnBhd,GAAQA,EAAKid,MAEfF,EAAU,MAIVA,EAAU/c,EAAKid,MAEfF,EAAUU,EAAiBV,EAAShe,KAAKyd,QAG3Czd,KAAKyd,QAELzd,KAAKwd,SAAWQ,EAET/c,GASTsc,EAAchV,UAAUoW,OAAS,SAAU1d,GAEzCjB,KAAKwd,SAAWoB,EAAa5e,KAAKwd,SAAUvc,EAAM,MAElDjB,KAAKqe,iBAQP,IAAIO,GAAe,SAAUZ,EAAS/c,EAAM6c,GAE1C7c,EAAK6c,IAAMA,CAEX,IAAIW,GAASxd,EAAKwd,MAWlB,OAVIA,IAAUf,EAAQzc,EAAK6c,IAAKW,EAAOX,OAErCe,EAAKb,EAAS/c,EAAMwd,GAEpBK,EAAcd,EAASS,IAGrBf,EAAQzc,EAAK6c,IAAKE,EAAQF,OAC5BE,EAAU/c,GAEL+c,GAOLa,EAAO,SAAUb,EAAS/c,EAAMwd,GAElCxd,EAAKgd,KAAKC,MAAQjd,EAAKid,MACvBjd,EAAKid,MAAMD,KAAOhd,EAAKgd,KACvBQ,EAAOV,SAEHU,EAAOF,OAAStd,IAClBwd,EAAOF,MAAQtd,EAAKid,OAEA,IAAlBO,EAAOV,SACTU,EAAOF,MAAQ,MAEjBtd,EAAKgd,KAAOD,EACZ/c,EAAKid,MAAQF,EAAQE,MACrBF,EAAQE,MAAQjd,EAChBA,EAAKid,MAAMD,KAAOhd,EAElBA,EAAKwd,OAAS,KAEdxd,EAAK8d,MAAO,GAQVD,EAAe,SAAUd,EAAS/c,GAEpC,GAAIwd,GAASxd,EAAKwd,MAEbA,KAGAxd,EAAK8d,MAKRF,EAAKb,EAAS/c,EAAMwd,GAEpBK,EAAcL,IANdxd,EAAK8d,MAAO,IAaZC,EAAa,SAAU/d,EAAMwd,GAE/Bxd,EAAKgd,KAAKC,MAAQjd,EAAKid,MACvBjd,EAAKid,MAAMD,KAAOhd,EAAKgd,KAEvBhd,EAAKwd,OAASA,EACTA,EAAOF,OAMVtd,EAAKgd,KAAOQ,EAAOF,MACnBtd,EAAKid,MAAQO,EAAOF,MAAML,MAC1BO,EAAOF,MAAML,MAAQjd,EACrBA,EAAKid,MAAMD,KAAOhd,IARlBwd,EAAOF,MAAQtd,EACfA,EAAKid,MAAQjd,EACbA,EAAKgd,KAAOhd,GASdwd,EAAOV,SAEP9c,EAAK8d,MAAO,GAGVL,EAAmB,SAAUV,EAASxY,GAExC,GAAIC,GAAY2C,KAAK6W,MAAM7W,KAAK0F,IAAItI,GAAQoY,GAAiB,EAEzDnZ,EAAQ,GAAIX,OAAM2B,GAElByZ,EAAW,EACXpa,EAAIkZ,CACR,IAAIlZ,EAGF,IAFAoa,IACApa,EAAIA,EAAEoZ,MACCpZ,IAAMkZ,GACXkB,IACApa,EAAIA,EAAEoZ,KAMV,KAFA,GAAI9O,GAEG8P,EAAW,GAAG,CAMnB,IAJA,GAAIpQ,GAAIhK,EAAEiZ,OAENpX,EAAO7B,EAAEoZ,QAEA,CAGX,GADA9O,EAAI3K,EAAMqK,IACLM,EACH,KAEF,IAAIuO,EAAO7Y,EAAEgZ,IAAK1O,EAAE0O,KAAM,CACxB,GAAIqB,GAAO/P,CACXA,GAAItK,EACJA,EAAIqa,EAGNH,EAAW5P,EAAGtK,GAEdL,EAAMqK,GAAK,KACXA,IAGFrK,EAAMqK,GAAKhK,EAEXA,EAAI6B,EACJuY,IAGFlB,EAAU,IAEV,KAAK,GAAIta,GAAI,EAAO+B,EAAJ/B,EAAeA,IAE7B0L,EAAI3K,EAAMf,GACL0L,IAGD4O,GAEF5O,EAAE6O,KAAKC,MAAQ9O,EAAE8O,MACjB9O,EAAE8O,MAAMD,KAAO7O,EAAE6O,KAEjB7O,EAAE6O,KAAOD,EACT5O,EAAE8O,MAAQF,EAAQE,MAClBF,EAAQE,MAAQ9O,EAChBA,EAAE8O,MAAMD,KAAO7O,EAEXsO,EAAQtO,EAAE0O,IAAKE,EAAQF,OACzBE,EAAU5O,IAGZ4O,EAAU5O,EAEd,OAAO4O,GAGT,OAAOT,GAGT3d,EAAQkG,KAAO,gBACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAGAL,GAAOD,QAAU,WAqBf,QAASyC,GAAOwD,GACd,KAAM7F,eAAgBqC,IACpB,KAAM,IAAI4D,aAAY,mDAGpBJ,aAAiBxD,GACnBrC,KAAK6F,MAAQA,EAAMA,MAGnB7F,KAAK6F,MAAQA,EAmCjB,QAASvD,GAAYwD,EAAMD,GACzB,GAAIuZ,GAAQtb,MAAMyE,UAAU6W,KACP,mBAAVvZ,GAETxD,EAAMkG,UAAUzC,GAAQ,WACtB,GAAItB,IAAQxE,KAAK6F,OAAOlE,OAAOyd,EAAM7e,KAAK2F,UAAW,GACrD,OAAO,IAAI7D,GAAMwD,EAAMqF,MAAMlL,KAAMwE,KAKrCnC,EAAMkG,UAAUzC,GAAQ,GAAIzD,GAAMwD,GA3EtC,GAAI0B,GAASrH,EAAoB,IA6GjC,OAvEAmC,GAAMkG,UAAU8W,KAAO,WACrB,MAAOrf,MAAK6F,OAQdxD,EAAMkG,UAAU5D,QAAU,WACxB,MAAO3E,MAAK6F,OAOdxD,EAAMkG,UAAUa,SAAW,WACzB,MAAO7B,GAAOuB,OAAO9I,KAAK6F,QAsC5BxD,EAAMC,YAAc,SAAUgd,EAAMC,GAClC,GAAoB,gBAATD,GAEThd,EAAYgd,EAAMC,OAIlB,KAAK,GAAItC,KAAQqC,GACXA,EAAK1S,eAAeqQ,IACtB3a,EAAY2a,EAAMqC,EAAKrC,KAMxB5a,IAMJ,SAASxC,EAAQD,EAASM,GAE/B,YAqBA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAmCpC,QAAS4E,GAAOoV,EAAM9T,GACpB,GAAwB,GAApB7C,UAAUjC,QAAmC,GAApBiC,UAAUjC,OACrC,KAAM,IAAIub,GAAe,QAAStZ,UAAUjC,OAAQ,EAAG,EAMzD,IAFAwb,GAAe1W,GAAWA,EAAQ2W,MAAS3W,EAAQ2W,SAE/CpY,EAASuV,GAGX,MADA7b,IAAa6b,EACN8C,GAEJ,IAAI7b,MAAMC,QAAQ8Y,IAASA,YAAgB1b,GAAKuD,OAEnD,MAAOJ,IAAWS,QAAQ8X,EAAM,SAAU+C,GACxC,IAAKtY,EAASsY,GAAO,KAAM,IAAInZ,WAAU,kBAGzC,OADAzF,IAAa4e,EACND,KAKT,MAAM,IAAIlZ,WAAU,6BAgFxB,QAASkB,KACP7F,GAAQ,EACRrB,GAAIO,GAAW+F,OAAO,GACtB8Y,GAAgB,EAChBC,GAAoB,KAStB,QAASnZ,KACP7E,KACArB,GAAIO,GAAW+F,OAAOjF,IAQxB,QAASie,KACP,MAAO/e,IAAW+F,OAAOjF,GAAQ,GAQnC,QAASke,KACP,MAAOhf,IAAW+F,OAAOjF,GAAQ,GAQnC,QAASme,KAMP,IALAC,GAAaC,GAAUC,KACvBC,GAAQ,GAII,KAAL5f,IAAiB,KAALA,IAAmB,MAALA,IAAaof,IAE5ClZ,GAIF,IAAS,KAALlG,GACF,KAAY,MAALA,IAAkB,IAALA,IAClBkG,GAKJ,IAAS,IAALlG,GAGF,YADAyf,GAAaC,GAAUG,UAKzB,IAAS,MAAL7f,KAAcof,GAIhB,MAHAK,IAAaC,GAAUG,UACvBD,GAAQ5f,OACRkG,IAKF,IAAI4Z,GAAK9f,GAAIsf,IACTS,EAAKD,EAAKP,GACd,IAAiB,GAAbQ,EAAGvc,QAAewc,GAAWD,GAM/B,MALAN,IAAaC,GAAUG,UACvBD,GAAQG,EACR7Z,IACAA,QACAA,IAKF,IAAiB,GAAb4Z,EAAGtc,QAAewc,GAAWF,GAK/B,MAJAL,IAAaC,GAAUG,UACvBD,GAAQE,EACR5Z,QACAA,IAKF,IAAI8Z,GAAWhgB,IAIb,MAHAyf,IAAaC,GAAUG,UACvBD,GAAQ5f,OACRkG,IAKF,KAAIC,EAAWnG,IAAf,CAuDA,GAAIigB,EAAQjgB,IAAI,CACd,KAAOigB,EAAQjgB,KAAMoG,EAAQpG,KAC3B4f,IAAS5f,GACTkG,GAUF,aANEuZ,GADES,GAAiBN,IACNF,GAAUG,UAGVH,GAAUS,QAQ3B,IADAV,GAAaC,GAAUU,QACX,IAALpgB,IACL4f,IAAS5f,GACTkG,GAEF,MAAMma,IAAkB,yBAA2BT,GAAQ,KAzEzD,GAHAH,GAAaC,GAAUY,OAGd,KAALtgB,GACF4f,IAAS5f,GACTkG,IAEKE,EAAQpG,MAEXyf,GAAaC,GAAUU,aAGtB,CACH,KAAOha,EAAQpG,KACb4f,IAAS5f,GACTkG,GAEO,MAALlG,KACF4f,IAAS5f,GACTkG,KAGJ,KAAOE,EAAQpG,KACb4f,IAAS5f,GACTkG,GAKF,IADA4Z,EAAKR,KACK,KAALtf,IAAiB,KAALA,MAAcoG,EAAQ0Z,IAAa,KAANA,GAAmB,KAANA,GAezD,IAdAF,IAAS5f,GACTkG,KAES,KAALlG,IAAiB,KAALA,MACd4f,IAAS5f,GACTkG,KAIGE,EAAQpG,MAEXyf,GAAaC,GAAUU,SAGlBha,EAAQpG,KACb4f,IAAS5f,GACTkG,IAoCR,QAASqa,KACP,EACEf,WAEc,MAATI,IAOT,QAASY,KACPpB,KAOF,QAASqB,KACPrB,KAUF,QAASa,GAASjgB,GAChB,MAASA,IAAK,KAAY,KAALA,GAChBA,GAAK,KAAY,KAALA,GACR,KAALA,EASN,QAASmG,GAAYnG,GACnB,MAASA,IAAK,KAAY,KAALA,GACZ,KAALA,EASN,QAASoG,GAASpG,GAChB,MAASA,IAAK,KAAY,KAALA,EAQvB,QAASkf,KAEPhY,IAEAsY,GAEA,IAAIhf,GAAOkgB,GAIX,IAAa,IAATd,GACF,KAAIH,KAAcC,GAAUG,UAIpBc,GAAY,uBAAyBf,IAGrCS,GAAkB,oBAAsBT,GAAQ,IAI1D,OAAOpf,GAUT,QAASkgB,KACP,GAAIlgB,GAEAogB,EADAC,IAGJ,IAAa,IAATjB,GAEF,MAAO,IAAIkB,GAAa,YAAa,YAQvC,KALa,MAATlB,IAA0B,KAATA,KACnBpf,EAAOugB,KAIO,MAATnB,IAA0B,KAATA,IACD,GAAjBiB,EAAOrd,QAAehD,IACxBogB,EAAoB,KAAThB,GACXiB,EAAOxe,MACL7B,KAAMA,EACNogB,QAASA,KAIbpB,IACa,MAATI,IAA0B,KAATA,IAAyB,IAATA,KACnCpf,EAAOugB,IAEPH,EAAoB,KAAThB,GACXiB,EAAOxe,MACL7B,KAAMA,EACNogB,QAASA,IAKf,OAAIC,GAAOrd,OAAS,EACX,GAAIwd,GAAUH,GAGdrgB,EASX,QAASugB,KAEP,GAAItB,IAAcC,GAAUS,QAAmB,YAATP,GACpC,KAAMS,IAAkB,8FAI1B,OAAOY,KAST,QAASA,KACP,GAAI5b,GAAMtB,EAAMqY,EAAM8E,EAElB1gB,EAAO2gB,GAEX,IAAa,KAATvB,GAAc,CAChB,GAAIpf,YAAgB4gB,GAKlB,MAHA/b,GAAO7E,EAAK6E,KACZkb,IACAnE,EAAO6E,IACA,GAAII,GAAehc,EAAM+W,EAE7B,IAAI5b,YAAgB8gB,GAIvB,MAFAf,KACAnE,EAAO6E,IACA,GAAIM,GAAW/gB,EAAM4b,EAEzB,IAAI5b,YAAgBghB,KAEvBN,GAAQ,EACRnd,KAEAsB,EAAO7E,EAAK6E,KACZ7E,EAAKuD,KAAK3C,QAAQ,SAAUsE,EAAKrE,GAC3BqE,YAAe0b,GACjBrd,EAAK1C,GAASqE,EAAIL,KAGlB6b,GAAQ,IAIRA,GAGF,MAFAX,KACAnE,EAAO6E,IACA,GAAIQ,GAAuBpc,EAAMtB,EAAMqY,EAIlD,MAAMiE,IAAkB,mDAG1B,MAAO7f,GAaT,QAAS2gB,KAGP,IAFA,GAAI3gB,GAAOkhB,IAEK,KAAT9B,IAAc,CAGnB,GAAI+B,GAAOtC,EACXA,IAAoBD,GACpBmB,GAEA,IAAIqB,GAAYphB,EACZqhB,EAAWH,GAEf,IAAa,KAAT9B,GAAc,KAAMS,IAAkB,gDAE1ChB,IAAoB,KACpBkB,GAEA,IAAIuB,GAAYX,GAEhB3gB,GAAO,GAAIuhB,GAAgBH,EAAWC,EAAUC,GAGhDzC,GAAoBsC,EAGtB,MAAOnhB,GAQT,QAASkhB,KAGP,IAFA,GAAIlhB,GAAOwhB,IAEK,MAATpC,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,KAAM,MAAOzhB,EAAMwhB,KAG7C,OAAOxhB,GAQT,QAASwhB,KAGP,IAFA,GAAIxhB,GAAO0hB,IAEK,OAATtC,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,MAAO,OAAQzhB,EAAM0hB,KAG/C,OAAO1hB,GAQT,QAAS0hB,KAGP,IAFA,GAAI1hB,GAAO2hB,IAEK,OAATvC,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,MAAO,OAAQzhB,EAAM2hB,KAG/C,OAAO3hB,GAQT,QAAS2hB,KAGP,IAFA,GAAI3hB,GAAO4hB,IAEK,KAATxC,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,IAAK,SAAUzhB,EAAM4hB,KAG/C,OAAO5hB,GAQT,QAAS4hB,KAGP,IAFA,GAAI5hB,GAAO6hB,IAEK,MAATzC,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,KAAM,UAAWzhB,EAAM6hB,KAGjD,OAAO7hB,GAQT,QAAS6hB,KAGP,IAFA,GAAI7hB,GAAO8hB,IAEK,KAAT1C,IACLW,IACA/f,EAAO,GAAIyhB,GAAa,IAAK,UAAWzhB,EAAM8hB,KAGhD,OAAO9hB,GAQT,QAAS8hB,KACP,GAAI9hB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAY/B,KAVAjiB,EAAOkiB,IAEPH,GACEI,KAAM,QACNC,KAAM,UACNC,IAAK,UACLC,IAAK,SACLC,KAAM,YACNC,KAAM,YAEDpD,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfkb,IACAkC,GAAUjiB,EAAMkiB,KAChBliB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAGpC,OAAOjiB,GAQT,QAASkiB,KACP,GAAIliB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAU/B,KARAjiB,EAAOyiB,IAEPV,GACEW,KAAO,YACPC,KAAO,kBACPC,MAAQ,iBAGHxD,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfkb,IACAkC,GAAUjiB,EAAMyiB,KAChBziB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAGpC,OAAOjiB,GAQT,QAASyiB,KACP,GAAIziB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAS/B,KAPAjiB,EAAO6iB,IAEPd,GACExV,GAAO,KACP2F,KAAO,MAGFkN,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfkb,IACAkC,GAAUjiB,EAAM6iB,KAChB7iB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAGpC,OAAOjiB,GAQT,QAAS6iB,KACP,GAAI7iB,GAAMiiB,IAWV,IAPEjiB,EAFW,KAATof,GAEK,GAAIkB,GAAa,IAAK,UAItBwC,IAGI,KAAT1D,IAAiBP,KAAsBD,GAAgB,CAKzD,IAHAqD,EAAOpgB,KAAK7B,GAGI,KAATof,IAAgB6C,EAAOjf,OAAS,GACrC+c,IAIEkC,EAAOpgB,KAFI,KAATud,IAAyB,KAATA,IAAyB,KAATA,IAAyB,IAATA,GAEtC,GAAIwB,GAAW,OAIfkC,IAMd9iB,GAFmB,GAAjBiiB,EAAOjf,OAEF,GAAI+f,GAAUd,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAI3C,GAAIc,GAAUd,EAAO,GAAIA,EAAO,IAI3C,MAAOjiB,GAQT,QAAS8iB,KACP,GAAI9iB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAQ/B,KANAjiB,EAAOgjB,IAEPjB,GACEkB,IAAK,MACLC,IAAK,YAEA9D,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfkb,IACAkC,GAAUjiB,EAAMgjB,KAChBhjB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAGpC,OAAOjiB,GAQT,QAASgjB,KACP,GAAIhjB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAa/B,IAXAjiB,EAAOmjB,IAEPpB,GACEqB,IAAK,WACLC,KAAM,cACNC,IAAK,SACLC,KAAM,YACNC,IAAK,MACLC,IAAO,OAGLrE,KAAS2C,GACX,KAAO3C,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfkb,IACAkC,GAAUjiB,EAAMmjB,KAChBnjB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAiBtC,QAZKhD,IAAcC,GAAUS,QACf,MAATP,IAAkBpf,YAAgBsgB,IAClCrB,IAAcC,GAAUY,UAAY9f,YAAgBsgB,KAC3C,KAATlB,IAAyB,KAATA,MAMnBpf,EAAO,GAAIyhB,GAAa,IAAK,YAAazhB,EAAMgjB,OAG3ChjB,EAQT,QAASmjB,KACP,GAAIte,GAAMod,EACND,GACFkB,IAAK,aACLD,IAAK,YACLS,IAAK,SACLC,IAAO,OACPvE,GAEF,OAAI4C,IACFnd,EAAOua,GAEPW,IACAkC,GAAUkB,KAEH,GAAI1B,GAAa5c,EAAMmd,EAAIC,IAG7B2B,IAST,QAASA,KACP,GAAI5jB,GAAM6E,EAAMmd,EAAIC,CAapB,OAXAjiB,GAAO6jB,KAEM,KAATzE,IAAyB,MAATA,MAClBva,EAAOua,GACP4C,EAAc,KAARnd,EAAe,MAAQ,SAE7Bkb,IACAkC,GAAUjiB,EAAMmjB,KAChBnjB,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,IAG7BjiB,EAQT,QAAS6jB,KACP,GAAI7jB,GAAM+hB,EAAWld,EAAMmd,EAAIC,CAS/B,KAPAjiB,EAAO8jB,IAEP/B,GACEgC,IAAK,YACLC,IAAM,aAGD5E,KAAS2C,IACdld,EAAOua,GACP4C,EAAKD,EAAUld,GAEfma,IACAiD,GAAUjiB,GAEVA,EAAO,GAAIyhB,GAAa5c,EAAMmd,EAAIC,EAGpC,OAAOjiB,GA+BT,QAAS8jB,KACP,GAAiBG,GAAbhC,IAEJ,IAAIhD,IAAcC,GAAUS,QAAUnB,GAAYY,IAAQ,CAMxD,GALA6E,EAAUzF,GAAYY,IAEtBJ,IAGa,KAATI,GAAc,CAMhB,GALA6C,KAEAjC,IACAhB,IAEa,KAATI,GAIF,IAHA6C,EAAOpgB,KAAK8e,KAGI,KAATvB,IACLJ,IACAiD,EAAOpgB,KAAK8e,IAIhB,IAAa,KAATvB,GACF,KAAMS,IAAkB,yBAE1BI,KACAjB,IAKF,MAAO,IAAIiF,GAAQhC,GAGrB,MAAOiC,KAQT,QAASA,KACP,GAAIlkB,GAAM6E,CAEV,OAAIoa,KAAcC,GAAUS,QACvBV,IAAcC,GAAUG,WAAaD,KAASM,KACjD7a,EAAOua,GAEPJ,IAGAhf,EAAOmkB,EAAetf,GACtB7E,EAAOokB,GAAWpkB,IAIbqkB,KAST,QAASF,GAAgBtf,GACvB,GAAIod,EAEJ,IAAa,KAAT7C,GAAc,CAMhB,GALA6C,KAEAjC,IACAhB,IAEa,KAATI,GAIF,IAHA6C,EAAOpgB,KAAK8e,KAGI,KAATvB,IACLJ,IACAiD,EAAOpgB,KAAK8e,IAIhB,IAAa,KAATvB,GACF,KAAMS,IAAkB,yBAK1B,OAHAI,KACAjB,IAEO,GAAIgC,GAAanc,EAAMod,GAGhC,MAAO,IAAIrB,GAAW/b,GAWxB,QAASuf,IAAYpkB,GAGnB,IAFA,GAAIiiB,GAEY,KAAT7C,IAAc,CAMnB,GALA6C,KAEAjC,IACAhB,IAEa,KAATI,GAIF,IAHA6C,EAAOpgB,KAAK8e,KAGI,KAATvB,IACLJ,IACAiD,EAAOpgB,KAAK8e,IAIhB,IAAa,KAATvB,GACF,KAAMS,IAAkB,yBAE1BI,KACAjB,IAEAhf,EAAO,GAAI8gB,GAAU9gB,EAAMiiB,GAG7B,MAAOjiB,GAST,QAASqkB,MACP,GAAIrkB,GAAMyG,EAAK6d,CAEf,IAAa,KAATlF,GAAc,CAIhB,IAFA3Y,EAAM,GACN6d,EAAQ,GACI,IAAL9kB,KAAiB,KAALA,IAAsB,MAAT8kB,IAC9B7d,GAAOjH,GACP8kB,EAAQ9kB,GACRkG,GAIF,IADAsZ,IACa,KAATI,GACF,KAAMS,IAAkB,2BAU1B,OARAb,KAGAhf,EAAO,GAAIsgB,GAAa7Z,EAAK,UAG7BzG,EAAOokB,GAAWpkB,GAKpB,MAAOukB,MAQT,QAASA,MACP,GAAI/gB,GAAOye,EAAQuC,EAAMC,CAEzB,IAAa,KAATrF,GAAc,CAKhB,GAHAY,IACAhB,IAEa,KAATI,GAAc,CAEhB,GAAIhV,GAAMsa,IAEV,IAAa,KAATtF,GAAc,CAMhB,IAJAoF,EAAO,EACPvC,GAAU7X,GAGM,KAATgV,IACLJ,IAEAiD,EAAOuC,GAAQE,KACfF,GAGF,IAAa,KAATpF,GACF,KAAMS,IAAkB,2BAE1BI,KACAjB,IAGAyF,EAAOxC,EAAO,GAAGxD,MAAMzb,MACvB,KAAK,GAAIqC,GAAI,EAAOmf,EAAJnf,EAAUA,IACxB,GAAI4c,EAAO5c,GAAGoZ,MAAMzb,QAAUyhB,EAC5B,KAAMtE,IAAY,+BACR8B,EAAO5c,GAAGoZ,MAAMzb,OAAS,OAASyhB,EAAO,IAIvDjhB,GAAQ,GAAImhB,GAAU1C,OAEnB,CAEH,GAAa,KAAT7C,GACF,KAAMS,IAAkB,2BAE1BI,KACAjB,IAEAxb,EAAQ4G,OAKV6V,KACAjB,IACAxb,EAAQ,GAAImhB,MAGd,OAAOnhB,GAGT,MAAOyC,MAOT,QAASye,MAIP,IAHA,GAAIzC,IAAUxB,KACVrc,EAAM,EAEM,KAATgb,IACLJ,IAGAiD,EAAO7d,GAAOqc,IACdrc,GAGF,OAAO,IAAIugB,GAAU1C,GAQvB,QAAShc,MACP,GAAIhE,EAEJ,OAAIgd,KAAcC,GAAUY,QAE1B7d,EAASmd,GACTJ,IAEO,GAAIsB,GAAare,EAAQ,WAG3B2iB,KAQT,QAASA,MACP,GAAI5kB,EAGJ,IAAa,KAATof,GAAc,CAOhB,GALAY,IACAhB,IAEAhf,EAAOygB,IAEM,KAATrB,GACF,KAAMS,IAAkB,yBAK1B,OAHAI,KACAjB,IAEOhf,EAGT,MAAO6kB,MAQT,QAASA,MACP,KAEQhF,IAFK,IAATT,GAEsB,+BAEA,kBAoB5B,QAAS0F,MACP,MAAOjkB,IAAQue,GAAMpc,OAAS,EAShC,QAAS6c,IAAmBkF,GAC1B,GAAIvlB,GAAIslB,KACJ1iB,EAAQ,GAAI4C,aAAY+f,EAAU,UAAYvlB,EAAI,IAGtD,OAFA4C,GAAM,QAAU5C,EAET4C,EAST,QAAS+d,IAAa4E,GACpB,GAAIvlB,GAAIslB,KACJ1iB,EAAQ,GAAIZ,OAAMujB,EAAU,UAAYvlB,EAAI,IAGhD,OAFA4C,GAAM,QAAU5C,EAET4C,EAp0CT,GAAIiB,IAAa9B,EAAKtC,EAAoB,IA+DtCigB,IACFC,KAAO,EACPE,UAAY,EACZS,OAAS,EACTH,OAAS,EACTC,QAAU,GAIRJ,IACFwF,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAK,EACLC,KAAM,EACNC,KAAK,EAELrC,KAAK,EACLC,KAAK,EACLE,KAAK,EACLC,MAAM,EACNC,KAAK,EACLC,MAAM,EACNC,KAAK,EACL+B,KAAK,EACLC,MAAM,EACN9B,KAAK,EACLK,KAAK,EACL0B,KAAK,EACLC,KAAK,EACLC,MAAM,EACN3B,KAAM,EACN4B,KAAK,EACLC,KAAK,EACLC,KAAK,EAEL3D,MAAM,EACNC,MAAM,EACNC,KAAK,EACLC,KAAK,EACLC,MAAM,EACNC,MAAM,EAENE,MAAM,EACNC,MAAM,EACNC,OAAO,GAILlD,IACF+D,KAAO,EACPlX,IAAM,EACN2F,MAAM,EACN6T,KAAO,EACPC,KAAO,EACPC,IAAM,EACNtC,KAAO,GAGLnF,MACAze,GAAa,GACbc,GAAQ,EACRrB,GAAI,GACJ4f,GAAQ,GACRH,GAAaC,GAAUC,KACvBP,GAAgB,EAChBC,GAAoB,IAqsCxB,OAAOrY,GA31CT,GAAI7C,GAAO1E,EAAoB,KAE3Bsf,EAAiBtf,EAAoB,KAErCoH,EAAW1C,EAAK2C,OAAOD,SAEvBse,EAAY1lB,EAAoB,KAChC4hB,EAAiB5hB,EAAoB,KACrCuhB,EAAYvhB,EAAoB,KAChCsiB,EAAkBtiB,EAAoB,KACtCqhB,EAAerhB,EAAoB,KACnCgiB,EAAyBhiB,EAAoB,KAC7C6hB,EAAY7hB,EAAoB,KAChCwiB,EAAexiB,EAAoB,KACnC+hB,EAAe/hB,EAAoB,KACnC8jB,EAAY9jB,EAAoB,KAChC2hB,EAAa3hB,EAAoB,KACjC8hB,EAAa9hB,EAAoB,IA60CrCN,GAAQkG,KAAO,QACflG,EAAQqM,KAAO,aACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAkD3C,QAASsmB,KACP,KAAMnnB,eAAgBmnB,IACpB,KAAM,IAAIlhB,aACN,mDAENjG,MAAKonB,SAtDP,GAAIC,GAAS7kB,EAAKtC,EAAoB,IAsItC,OArEAinB,GAAO5e,UAAUd,MAAQ,SAAUoV,GACjC,KAAM,IAAIpa,OAAM,wDAUlB0kB,EAAO5e,UAAU+e,QAAU,SAAUzK,GACnC,KAAM,IAAIpa,OAAM,4DASlB0kB,EAAO5e,UAAUuU,KAAO,SAAUD,GAEhC,MAAOwK,GAAOxK,GACTyK,QAAQzmB,GACRic,KAAK9c,KAAKonB,QASjBD,EAAO5e,UAAUuD,IAAM,SAAUhG,GAE/B,MAAO9F,MAAKonB,MAAMthB,IAQpBqhB,EAAO5e,UAAUwD,IAAM,SAAUjG,EAAMD,GAErC,MAAO7F,MAAKonB,MAAMthB,GAAQD,GAO5BshB,EAAO5e,UAAUoW,OAAS,SAAU7Y,SAE3B9F,MAAKonB,MAAMthB,IAMpBqhB,EAAO5e,UAAU4V,MAAQ,WACvB,IAAK,GAAIrY,KAAQ9F,MAAKonB,MAChBpnB,KAAKonB,MAAMxa,eAAe9G,UACrB9F,MAAKonB,MAAMthB,IAKjBqhB,EAGTvnB,EAAQkG,KAAO,SACflG,EAAQqM,KAAO,aACfrM,EAAQD,QAAUA,EAClBC,EAAQiB,MAAO,GAKV,SAAShB,EAAQD,EAASM,GAE/B,YAEAN,GAAQgmB,UAAY1lB,EAAoB,KACxCN,EAAQkiB,eAAiB5hB,EAAoB,KAC7CN,EAAQ6hB,UAAYvhB,EAAoB,KACxCN,EAAQ4iB,gBAAkBtiB,EAAoB,KAC9CN,EAAQ2hB,aAAerhB,EAAoB,KAC3CN,EAAQmiB,UAAY7hB,EAAoB,KACxCN,EAAQsiB,uBAAyBhiB,EAAoB,KACrDN,EAAQqiB,aAAe/hB,EAAoB,KAC3CN,EAAQ2nB,KAAOrnB,EAAoB,KACnCN,EAAQ8iB,aAAexiB,EAAoB,KAC3CN,EAAQokB,UAAY9jB,EAAoB,KACxCN,EAAQiiB,WAAa3hB,EAAoB,KACzCN,EAAQoiB,WAAa9hB,EAAoB,MAKpC,SAASL,EAAQD,EAASM,GAG/BN,EAAQmd,EAAI7c,EAAoB,KAChCN,EAAQ+O,EAAIzO,EAAoB,KAChCN,EAAQ,SAAWM,EAAoB,KACvCN,EAAQ8D,EAAIxD,EAAoB,KAChCN,EAAkB,SAAIM,EAAoB,KAC1CN,EAAQ4nB,IAAMtnB,EAAoB,KAClCN,EAAQmO,KAAO7N,EAAoB,KACnCN,EAAQ6nB,MAAQvnB,EAAoB,KACpCN,EAAQ8nB,OAASxnB,EAAoB,KACrCN,EAAQ+nB,IAAMznB,EAAoB,KAClCN,EAAQ,QAAUM,EAAoB,KACtCN,EAAQgoB,GAAK1nB,EAAoB,KACjCN,EAAQioB,GAAK3nB,EAAoB,KACjCN,EAAQ2G,IAAMrG,EAAoB,KAClCN,EAAQkoB,QAAU5nB,EAAoB,KACtCN,EAAQmoB,MAAQ7nB,EAAoB,KACpCN,EAAQooB,IAAM9nB,EAAoB,KAClCN,EAAQ,QAAUM,EAAoB,KACtCN,EAAQqoB,QAAU/nB,EAAoB,KAGtCN,EAAQuJ,IAAMjJ,EAAoB,KAClCN,EAAQsoB,IAAMhoB,EAAoB,KAClCN,EAAQ2K,KAAOrK,EAAoB,KACnCN,EAAQuoB,KAAOjoB,EAAoB,KACnCN,EAAQwoB,OAASloB,EAAoB,KACrCN,EAAQyoB,UAAYnoB,EAAoB,KACxCN,EAAQ0oB,YAAcpoB,EAAoB,KAC1CN,EAAQ2oB,OAASroB,EAAoB,KACrCN,EAAQ4oB,IAAMtoB,EAAoB,KAClCN,EAAQ6oB,IAAMvoB,EAAoB,KAClCN,EAAQqf,MAAQ/e,EAAoB,KACpCN,EAAQ8oB,IAAMxoB,EAAoB,KAClCN,EAAQ+oB,IAAMzoB,EAAoB,KAClCN,EAAQkO,IAAM5N,EAAoB,KAClCN,EAAQgpB,MAAQ1oB,EAAoB,KACpCN,EAAQ8kB,IAAMxkB,EAAoB,KAClCN,EAAQipB,SAAW3oB,EAAoB,KACvCN,EAAQkpB,KAAO5oB,EAAoB,KACnCN,EAAQmpB,QAAU7oB,EAAoB,KACtCN,EAAQsJ,IAAMhJ,EAAoB,KAClCN,EAAQopB,MAAQ9oB,EAAoB,KACpCN,EAAQ0K,KAAOpK,EAAoB,KACnCN,EAAQ6I,KAAOvI,EAAoB,KACnCN,EAAQqpB,OAAS/oB,EAAoB,KACrCN,EAAQspB,SAAWhpB,EAAoB,KACvCN,EAAQupB,WAAajpB,EAAoB,KACzCN,EAAQwpB,UAAYlpB,EAAoB,KACxCN,EAAQypB,KAAOnpB,EAAoB,KAGnCN,EAAQ0pB,OAASppB,EAAoB,KACrCN,EAAQ2pB,OAASrpB,EAAoB,KACrCN,EAAQ4pB,MAAQtpB,EAAoB,KACpCN,EAAQ6pB,OAASvpB,EAAoB,KACrCN,EAAQ8pB,UAAYxpB,EAAoB,KACxCN,EAAQ+pB,gBAAkBzpB,EAAoB,KAC9CN,EAAQgqB,cAAgB1pB,EAAoB,KAG5CN,EAAQuG,IAAMjG,EAAoB,KAClCN,EAAQiqB,KAAO3pB,EAAoB,KACnCN,EAAQmG,GAAK7F,EAAoB,KACjCN,EAAQoG,GAAK9F,EAAoB,KAGjCN,EAAQkqB,UAAY5pB,EAAoB,KACxCN,EAAQ,WAAaM,EAAoB,KACzCN,EAAQmqB,QAAU7pB,EAAoB,KACtCN,EAAQkC,MAAQ5B,EAAoB,KACpCN,EAAQqD,OAAS/C,EAAoB,KACrCN,EAAQsD,OAAShD,EAAoB,KACrCN,EAAQ2H,OAASrH,EAAoB,KACrCN,EAAQuM,KAAOjM,EAAoB,KAGnCN,EAAc,KAAKM,EAAoB,KACvCN,EAAQoqB,KAAQ9pB,EAAoB,KAGpCN,EAAa,IAAIM,EAAoB,KACrCN,EAAa,IAAIM,EAAoB,KACrCN,EAAY,GAAIM,EAAoB,KACpCN,EAAa,IAAIM,EAAoB,KAGrCN,EAAgB,OAAIM,EAAoB,KACxCN,EAAQqqB,MAAQ/pB,EAAoB,KACpCN,EAAQsqB,IAAMhqB,EAAoB,KAClCN,EAAQuqB,KAAOjqB,EAAoB,KACnCN,EAAQwqB,IAAMlqB,EAAoB,KAClCN,EAAQyqB,IAAMnqB,EAAoB,KAClCN,EAAQ0qB,QAAUpqB,EAAoB,KACtCN,EAAQ2qB,IAAMrqB,EAAoB,KAClCN,EAAQ4qB,KAAOtqB,EAAoB,KACnCN,EAAQuC,MAAQjC,EAAoB,KACpCN,EAAQoM,OAAS9L,EAAoB,KACrCN,EAAQ4F,KAAOtF,EAAoB,KACnCN,EAAQ6qB,QAAUvqB,EAAoB,KACtCN,EAAQwC,OAASlC,EAAoB,KACrCN,EAAQ8qB,MAAQxqB,EAAoB,KACpCN,EAAQ+qB,UAAYzqB,EAAoB,KACxCN,EAAQgrB,MAAQ1qB,EAAoB,KAGpCN,EAAQirB,aAAe3qB,EAAoB,KAE3CN,EAAQkrB,UAAY5qB,EAAoB,KACxCN,EAAQmrB,MAAQ7qB,EAAoB,KACpCN,EAAQorB,aAAe9qB,EAAoB,KAC3CN,EAAQqrB,WAAa/qB,EAAoB,KACzCN,EAAQsrB,OAAShrB,EAAoB,KACrCN,EAAQurB,UAAYjrB,EAAoB,KAGxCN,EAAQwrB,QAAUlrB,EAAoB,KACtCN,EAAQyrB,UAAYnrB,EAAoB,KACxCN,EAAe,MAAIM,EAAoB,KACvCN,EAAQ+d,OAASzd,EAAoB,KACrCN,EAAQ0rB,SAAWprB,EAAoB,KACvCN,EAAQ8d,QAAUxd,EAAoB,KACtCN,EAAQ2rB,UAAYrrB,EAAoB,KACxCN,EAAQ4rB,QAAUtrB,EAAoB,KAGtCN,EAAQoC,IAAM9B,EAAoB,KAClCN,EAAQqC,KAAO/B,EAAoB,KACnCN,EAAQ6rB,OAASvrB,EAAoB,KACrCN,EAAQsC,IAAMhC,EAAoB,KAClCN,EAAQ8rB,KAAOxrB,EAAoB,KACnCN,EAAQ+rB,IAAMzrB,EAAoB,KAClCN,EAAQgsB,IAAM1rB,EAAoB,KAClCN,EAAQ,OAASM,EAAoB,KAGrCN,EAAQisB,KAAO3rB,EAAoB,KACnCN,EAAQksB,MAAQ5rB,EAAoB,KACpCN,EAAQmsB,KAAO7rB,EAAoB,KACnCN,EAAQosB,MAAQ9rB,EAAoB,KACpCN,EAAQqsB,KAAO/rB,EAAoB,KACnCN,EAAQssB,MAAQhsB,EAAoB,KACpCN,EAAQusB,KAAOjsB,EAAoB,KACnCN,EAAQwsB,MAAQlsB,EAAoB,KACpCN,EAAQysB,KAAOnsB,EAAoB,KACnCN,EAAQ0sB,MAAQpsB,EAAoB,KACpCN,EAAQ2sB,KAAOrsB,EAAoB,KACnCN,EAAQ4sB,MAAQtsB,EAAoB,KACpCN,EAAQ8I,MAAQxI,EAAoB,KACpCN,EAAQyI,IAAMnI,EAAoB,KAClCN,EAAQ6sB,KAAOvsB,EAAoB,KACnCN,EAAQ8sB,IAAMxsB,EAAoB,KAClCN,EAAQ+sB,KAAOzsB,EAAoB,KACnCN,EAAQgtB,IAAM1sB,EAAoB,KAClCN,EAAQitB,KAAO3sB,EAAoB,KACnCN,EAAQwX,IAAMlX,EAAoB,KAClCN,EAAQktB,KAAO5sB,EAAoB,KACnCN,EAAQ0I,IAAMpI,EAAoB,KAClCN,EAAQmtB,KAAO7sB,EAAoB,KACnCN,EAAQotB,IAAM9sB,EAAoB,KAClCN,EAAQqtB,KAAO/sB,EAAoB,KAGnCN,EAAQ4N,GAAKtN,EAAoB,KAGjCN,EAAQ+I,MAASzI,EAAoB,KACrCN,EAAQmC,IAAO7B,EAAoB,KACnCN,EAAQgC,OAAU1B,EAAoB,KACtCN,EAAQiC,QAAW3B,EAAoB,KACvCN,EAAQkJ,OAAU5I,EAAoB,KAEtCN,EAAQ,UAAaM,EAAoB,KACzCN,EAAQstB,KAAQhtB,EAAoB,KACpCN,EAAQ,UAAaM,EAAoB,MAKpC,SAASL,EAAQD,EAASM,GAE/B,YAgBA,SAASP,GAASwB,EAAMP,EAAQ4B,GAY9B,QAAS2qB,GAAaC,GACpB,KAAMptB,eAAgBmtB,IACpB,KAAM,IAAIlnB,aAAY,mDAExB,IAAImnB,YAAgB1oB,GAElB2oB,EAAkBrtB,KAAMotB,OAErB,IAAIA,GAAQrpB,EAAQqpB,EAAKtrB,QAAUiC,EAAQqpB,EAAKE,MAAQvpB,EAAQqpB,EAAK5nB,MAExExF,KAAKutB,QAAUH,EAAKjiB,OACpBnL,KAAKwtB,OAASJ,EAAKtrB,MACnB9B,KAAKytB,KAAOL,EAAKE,IACjBttB,KAAKyd,MAAQ2P,EAAK5nB,SAEf,IAAIzB,EAAQqpB,GAEfM,EAAiB1tB,KAAMotB,OAEpB,CAAA,GAAIA,EAEP,KAAM,IAAI3mB,WAAU,6BAA+B7B,EAAK+oB,MAAMxsB,KAAKisB,GAAQ,IAI3EptB,MAAKutB,WACLvtB,KAAKwtB,UACLxtB,KAAKytB,MAAQ,GACbztB,KAAKyd,OAAS,IAtClB,GAAImQ,GAAQprB,EAAKtC,EAAoB,MAEjCoB,EAAQH,EAAKG,MACb6b,EAAYhc,EAAKgc,UACjBzY,EAASvD,EAAKuD,OAsCd2oB,EAAoB,SAAUpqB,EAAQ4qB,GAEpB,iBAAhBA,EAAO1sB,MAET8B,EAAOsqB,QAAUM,EAAON,QAAUnjB,EAAOzB,MAAMklB,EAAON,SAAW/iB,OACjEvH,EAAOuqB,OAASpjB,EAAOzB,MAAMklB,EAAOL,QACpCvqB,EAAOwqB,KAAOrjB,EAAOzB,MAAMklB,EAAOJ,MAClCxqB,EAAOwa,MAAQrT,EAAOzB,MAAMklB,EAAOpQ,QAInCiQ,EAAiBzqB,EAAQ4qB,EAAOlpB,YAIhC+oB,EAAmB,SAAUzqB,EAAQmqB,GAEvCnqB,EAAOsqB,WACPtqB,EAAOuqB,UACPvqB,EAAOwqB,OAEP,IAAIhI,GAAO2H,EAAKnpB,OACZ6pB,EAAU,CAGd,IAAIrI,EAAO,EAAG,CAEZ,GAAIvhB,GAAI,CACR,GAAG,CAEDjB,EAAOwqB,KAAK3qB,KAAKG,EAAOsqB,QAAQtpB,OAEhC,KAAK,GAAIP,GAAI,EAAO+hB,EAAJ/hB,EAAUA,IAAK,CAE7B,GAAI2H,GAAM+hB,EAAK1pB,EAEf,IAAIK,EAAQsH,IAKV,GAHS,IAALnH,GAAU4pB,EAAUziB,EAAIpH,SAC1B6pB,EAAUziB,EAAIpH,QAEZC,EAAImH,EAAIpH,OAAQ,CAElB,GAAI8pB,GAAI1iB,EAAInH,EAEP0pB,GAAMG,EAAG,KAEZ9qB,EAAOsqB,QAAQzqB,KAAKirB,GAEpB9qB,EAAOuqB,OAAO1qB,KAAKY,SAMb,KAANQ,GAAqB,EAAV4pB,IACbA,EAAU,GAEPF,EAAMviB,EAAK,KAEdpI,EAAOsqB,QAAQzqB,KAAKuI,GAEpBpI,EAAOuqB,OAAO1qB,KAAKY,IAKzBQ,UAES4pB,EAAJ5pB,GAGTjB,EAAOwqB,KAAK3qB,KAAKG,EAAOsqB,QAAQtpB,QAEhChB,EAAOwa,OAASgI,EAAMqI,GAGxBX,GAAa5kB,UAAY,GAAI7D,GAE7ByoB,EAAa5kB,UAAUpH,KAAO,eAU9BgsB,EAAa5kB,UAAUkD,QAAU,WAC/B,MAAO,UAgBT0hB,EAAa5kB,UAAUnG,OAAS,SAAUN,EAAO8J,EAAaC,GAE5D,IAAK7L,KAAKutB,QACR,KAAM,IAAI9qB,OAAM,gDAGlB,QAAQyD,UAAUjC,QAChB,IAAK,GACH,MAAO+pB,GAAWhuB,KAAM8B,EAG1B,KAAK,GACL,IAAK,GACH,MAAOmsB,GAAWjuB,KAAM8B,EAAO8J,EAAaC,EAE9C,SACE,KAAM,IAAI5F,aAAY,8BAI5B,IAAI+nB,GAAa,SAAU/qB,EAAQnB,GAEjC,KAAMA,YAAiBR,IACrB,KAAM,IAAImF,WAAU,gBAGtB,IAAI2E,GAAWtJ,EAAMsJ,UACrB,IAAIA,EAEF,MAAOnI,GAAO6I,IAAIhK,EAAMI,MAG1B,IAAIsD,GAAO1D,EAAM0D,MACjB,IAAIA,EAAKvB,QAAUhB,EAAOwa,MAAMxZ,OAC9B,KAAM,IAAIqB,GAAeE,EAAKvB,OAAQhB,EAAOwa,MAAMxZ,OAMrD,KAAK,GAFD/B,GAAMJ,EAAMI,MACZF,EAAMF,EAAME,MACP0B,EAAI,EAAGkC,EAAK3C,EAAOwa,MAAMxZ,OAAY2B,EAAJlC,EAAQA,IAChDwqB,EAAchsB,EAAIwB,GAAIT,EAAOwa,MAAM/Z,IACnCwqB,EAAclsB,EAAI0B,GAAIT,EAAOwa,MAAM/Z,GAIrC,IAAID,GAAW,SAAUsqB,GAEvB,MAAOA,GAGT,OAAOI,GAAKlrB,EAAQf,EAAI,GAAIF,EAAI,GAAIE,EAAI,GAAIF,EAAI,GAAIyB,GAAU,IAG5DwqB,EAAa,SAAUhrB,EAAQnB,EAAOssB,EAAWviB,GAEnD,KAAM/J,YAAiBR,IACrB,KAAM,IAAImF,WAAU,gBAItB,IAII4nB,GAJAC,EAAQxsB,EAAM0D,OACd4F,EAAWtJ,EAAMsJ,UAgBrB,IAZIgjB,YAAqB1pB,IAEvB2pB,EAAQD,EAAU5oB,OAElB4oB,EAAYA,EAAU1jB,WAItB2jB,EAAQ5pB,EAAMe,KAAK4oB,GAIjBhjB,EAAU,CAEZ,GAAqB,IAAjBijB,EAAMpqB,OACR,KAAM,IAAIwC,WAAU,kBAGtBxD,GAAO8I,IAAIjK,EAAMI,MAAOksB,EAAWviB,OAEhC,CAEH,GAAqB,IAAjByiB,EAAMrqB,QAAiC,IAAjBqqB,EAAMrqB,OAC9B,KAAM,IAAIqB,GAAegpB,EAAMrqB,OAAQhB,EAAOwa,MAAMxZ,OAAQ,IAI9D,IAAIoqB,EAAMpqB,OAASqqB,EAAMrqB,OAAQ,CAI/B,IAFA,GAAIP,GAAI,EACJ6qB,EAAQ,EACQ,IAAbD,EAAM5qB,IAAyB,IAAb2qB,EAAM3qB,IAC7BA,GAEF,MAAoB,IAAb4qB,EAAM5qB,IACX6qB,IACA7qB,GAGF0qB,GAAY3pB,EAAM+pB,UAAUJ,EAAWE,EAAMrqB,OAAQsqB,EAAOF,GAI9D,IAAKjkB,EAAOihB,UAAUiD,EAAOD,GAC3B,KAAM,IAAI/oB,GAAegpB,EAAOD,EAAO,IAYzC,KAAK,GARDI,GAAK3sB,EAAMI,MAAM,GACjBwsB,EAAK5sB,EAAMI,MAAM,GAGjB1B,EAAI6tB,EAAM,GACVrf,EAAIqf,EAAM,GAGLvpB,EAAI,EAAOtE,EAAJsE,EAAOA,IAErB,IAAK,GAAIsK,GAAI,EAAOJ,EAAJI,EAAOA,IAAK,CAE1B,GAAI2e,GAAIK,EAAUtpB,GAAGsK,EAErBnM,GAAO8I,KAAKjH,EAAI2pB,EAAIrf,EAAIsf,GAAKX,EAAGliB,IAItC,MAAO5I,GAQTkqB,GAAa5kB,UAAUuD,IAAM,SAAUhK,GACrC,IAAKiC,EAAQjC,GACX,KAAM,IAAI2E,WAAU,iBACtB,IAAI3E,EAAMmC,QAAUjE,KAAKyd,MAAMxZ,OAC7B,KAAM,IAAIqB,GAAexD,EAAMmC,OAAQjE,KAAKyd,MAAMxZ,OAGpD,KAAKjE,KAAKutB,QACR,KAAM,IAAI9qB,OAAM,6CAGlB,IAAIiB,GAAI5B,EAAM,GACVoC,EAAIpC,EAAM,EAGdosB,GAAcxqB,EAAG1D,KAAKyd,MAAM,IAC5ByQ,EAAchqB,EAAGlE,KAAKyd,MAAM,GAG5B,IAAInP,GAAIqgB,EAAejrB,EAAG1D,KAAKytB,KAAKvpB,GAAIlE,KAAKytB,KAAKvpB,EAAI,GAAIlE,KAAKwtB,OAE/D,OAAIlf,GAAItO,KAAKytB,KAAKvpB,EAAI,IAAMlE,KAAKwtB,OAAOlf,KAAO5K,EACtC0G,EAAOzB,MAAM3I,KAAKutB,QAAQjf,IAE5B,GAYT6e,EAAa5kB,UAAUwD,IAAM,SAAUjK,EAAOisB,EAAGliB,GAC/C,IAAK9H,EAAQjC,GACX,KAAM,IAAI2E,WAAU,iBACtB,IAAI3E,EAAMmC,QAAUjE,KAAKyd,MAAMxZ,OAC7B,KAAM,IAAIqB,GAAexD,EAAMmC,OAAQjE,KAAKyd,MAAMxZ,OAGpD,KAAKjE,KAAKutB,QACR,KAAM,IAAI9qB,OAAM,6CAGlB,IAAIiB,GAAI5B,EAAM,GACVoC,EAAIpC,EAAM,GAGV2jB,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,IAGrB/Z,EAAI+hB,EAAO,GAAKvhB,EAAI4pB,EAAU,KAEhCc,EAAQ5uB,KAAMoI,KAAKpG,IAAI0B,EAAI,EAAG+hB,GAAOrd,KAAKpG,IAAIkC,EAAI,EAAG4pB,GAAUjiB,GAE/D4Z,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,IAIvByQ,EAAcxqB,EAAG+hB,GACjByI,EAAchqB,EAAG4pB,EAGjB,IAAIxf,GAAIqgB,EAAejrB,EAAG1D,KAAKytB,KAAKvpB,GAAIlE,KAAKytB,KAAKvpB,EAAI,GAAIlE,KAAKwtB,OAkB/D,OAhBIlf,GAAItO,KAAKytB,KAAKvpB,EAAI,IAAMlE,KAAKwtB,OAAOlf,KAAO5K,EAExCkqB,EAAMG,EAAG,GAMZc,EAAQvgB,EAAGpK,EAAGlE,KAAKutB,QAASvtB,KAAKwtB,OAAQxtB,KAAKytB,MAJ9CztB,KAAKutB,QAAQjf,GAAKyf,EASpBe,EAAQxgB,EAAG5K,EAAGQ,EAAG6pB,EAAG/tB,KAAKutB,QAASvtB,KAAKwtB,OAAQxtB,KAAKytB,MAG/CztB,KAGT,IAAI2uB,GAAiB,SAASjrB,EAAGqrB,EAAKC,EAAQltB,GAE5C,GAAIktB,EAASD,IAAQ,GAAKrrB,EAAI5B,EAAMktB,EAAS,GAC3C,MAAOA,EAET,MAAaA,EAAND,GAAc,CAEnB,GAAIruB,OAAQquB,EAAMC,GAAU,GAExB1oB,EAAIxE,EAAMpB,EAEd,IAAQ4F,EAAJ5C,EACFsrB,EAAStuB,MACN,CAAA,KAAIgD,EAAI4C,GAGX,MAAO5F,EAFPquB,GAAMruB,EAAI,GAId,MAAOquB,IAGLF,EAAU,SAAUvgB,EAAGpK,EAAGiH,EAAQrJ,EAAOwrB,GAE3CniB,EAAO8jB,OAAO3gB,EAAG,GACjBxM,EAAMmtB,OAAO3gB,EAAG,EAEhB,KAAK,GAAIxJ,GAAIZ,EAAI,EAAGY,EAAIwoB,EAAIrpB,OAAQa,IAClCwoB,EAAIxoB,MAGJgqB,EAAU,SAAUxgB,EAAG5K,EAAGQ,EAAG6pB,EAAG5iB,EAAQrJ,EAAOwrB,GAEjDniB,EAAO8jB,OAAO3gB,EAAG,EAAGyf,GAEpBjsB,EAAMmtB,OAAO3gB,EAAG,EAAG5K,EAEnB,KAAK,GAAIoB,GAAIZ,EAAI,EAAGY,EAAIwoB,EAAIrpB,OAAQa,IAClCwoB,EAAIxoB,KAeRqoB,GAAa5kB,UAAUyD,OAAS,SAAUxG,EAAMqG,EAAcqjB,GAE5D,IAAKnrB,EAAQyB,GACX,KAAM,IAAIiB,WAAU,iBACtB,IAAoB,IAAhBjB,EAAKvB,OACP,KAAM,IAAIxB,OAAM,2CAGlB+C,GAAK3D,QAAQ,SAAUgE,GACrB,IAAK3C,EAAOsD,SAASX,KAAW3C,EAAO8H,UAAUnF,IAAkB,EAARA,EACzD,KAAM,IAAIY,WAAU,uDACYc,EAAOuB,OAAOtD,GAAQ,MAK1D,IAAIhF,GAAI0uB,EAAOlvB,KAAK2I,QAAU3I,IAE9B,OAAO4uB,GAAQpuB,EAAGgF,EAAK,GAAIA,EAAK,GAAIqG,GAGtC,IAAI+iB,GAAU,SAAU3rB,EAAQwiB,EAAMqI,EAASjiB,GAE7C,GAQInI,GAAGQ,EAAGoK,EARNzI,EAAQgG,GAAgB,EAExBsjB,GAAOvB,EAAM/nB,EAAO,GAGpBS,EAAIrD,EAAOwa,MAAM,GACjBhd,EAAIwC,EAAOwa,MAAM,EAKrB,IAAIqQ,EAAUrtB,EAAG,CAEf,IAAKyD,EAAIzD,EAAOqtB,EAAJ5pB,EAAaA,IAIvB,GAFAjB,EAAOwqB,KAAKvpB,GAAKjB,EAAOsqB,QAAQtpB,OAE5BkrB,EAEF,IAAKzrB,EAAI,EAAO4C,EAAJ5C,EAAOA,IAEjBT,EAAOsqB,QAAQzqB,KAAK+C,GAEpB5C,EAAOuqB,OAAO1qB,KAAKY,EAKzBT,GAAOwqB,KAAKK,GAAW7qB,EAAOsqB,QAAQtpB,WAErBxD,GAAVqtB,IAEP7qB,EAAOwqB,KAAKwB,OAAOnB,EAAU,EAAGrtB,EAAIqtB,GAEpC7qB,EAAOsqB,QAAQ0B,OAAOhsB,EAAOwqB,KAAKK,GAAU7qB,EAAOsqB,QAAQtpB,QAC3DhB,EAAOuqB,OAAOyB,OAAOhsB,EAAOwqB,KAAKK,GAAU7qB,EAAOuqB,OAAOvpB,QAM3D,IAHAxD,EAAIqtB,EAGArI,EAAOnf,GAET,GAAI6oB,EAAK,CAEP,GAAIngB,GAAI,CAER,KAAK9K,EAAI,EAAOzD,EAAJyD,EAAOA,IAAK,CAEtBjB,EAAOwqB,KAAKvpB,GAAKjB,EAAOwqB,KAAKvpB,GAAK8K,EAElCV,EAAIrL,EAAOwqB,KAAKvpB,EAAI,GAAK8K,CAEzB,IAAItO,GAAI,CAER,KAAKgD,EAAI4C,EAAOmf,EAAJ/hB,EAAUA,IAAKhD,IAEzBuC,EAAOsqB,QAAQ0B,OAAO3gB,EAAI5N,EAAG,EAAGmF,GAEhC5C,EAAOuqB,OAAOyB,OAAO3gB,EAAI5N,EAAG,EAAGgD,GAE/BsL,IAIJ/L,EAAOwqB,KAAKhtB,GAAKwC,EAAOsqB,QAAQtpB,YAG/B,IAAWqC,EAAPmf,EAAU,CAEjB,GAAI3W,GAAI,CAER,KAAK5K,EAAI,EAAOzD,EAAJyD,EAAOA,IAAK,CAEtBjB,EAAOwqB,KAAKvpB,GAAKjB,EAAOwqB,KAAKvpB,GAAK4K,CAElC,IAAIsgB,GAAKnsB,EAAOwqB,KAAKvpB,GACjBmrB,EAAKpsB,EAAOwqB,KAAKvpB,EAAI,GAAK4K,CAE9B,KAAKR,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAEnB5K,EAAIT,EAAOuqB,OAAOlf,GAEd5K,EAAI+hB,EAAO,IAEbxiB,EAAOsqB,QAAQ0B,OAAO3gB,EAAG,GAEzBrL,EAAOuqB,OAAOyB,OAAO3gB,EAAG,GAExBQ,KAKN7L,EAAOwqB,KAAKvpB,GAAKjB,EAAOsqB,QAAQtpB,OAMlC,MAHAhB,GAAOwa,MAAM,GAAKgI,EAClBxiB,EAAOwa,MAAM,GAAKqQ,EAEX7qB,EAOTkqB,GAAa5kB,UAAUI,MAAQ,WAC7B,GAAInI,GAAI,GAAI2sB,IACVhiB,OAAQnL,KAAKutB,QAAUnjB,EAAOzB,MAAM3I,KAAKutB,SAAW/iB,OACpD1I,MAAOsI,EAAOzB,MAAM3I,KAAKwtB,QACzBF,IAAKljB,EAAOzB,MAAM3I,KAAKytB,MACvBjoB,KAAM4E,EAAOzB,MAAM3I,KAAKyd,QAE1B,OAAOjd,IAOT2sB,EAAa5kB,UAAU/C,KAAO,WAC5B,MAAO4E,GAAOzB,MAAM3I,KAAKyd,QAa3B0P,EAAa5kB,UAAUxG,IAAM,SAAU0B,EAAUuB,GAE/C,IAAKhF,KAAKutB,QACR,KAAM,IAAI9qB,OAAM,6CAElB,IAAI6sB,GAAKtvB,KAELylB,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,GAErB8R,EAAS,SAAUxB,EAAGrqB,EAAGQ,GAE3B,MAAOT,GAASsqB,GAAIrqB,EAAGQ,GAAIorB,GAG7B,OAAOnB,GAAKnuB,KAAM,EAAGylB,EAAO,EAAG,EAAGqI,EAAU,EAAGyB,EAAQvqB,GAOzD,IAAImpB,GAAO,SAAUlrB,EAAQusB,EAAQC,EAAQC,EAAWC,EAAWlsB,EAAUuB,GAkB3E,IAAK,GAhBDmG,MACArJ,KACAwrB,KAEAiC,EAAS,SAAUxB,EAAGjpB,EAAGsK,GAE3B2e,EAAItqB,EAASsqB,EAAGjpB,EAAGsK,GAEdwe,EAAMG,EAAG,KAEZ5iB,EAAOrI,KAAKirB,GAEZjsB,EAAMgB,KAAKgC,KAINZ,EAAIwrB,EAAgBC,GAALzrB,EAAgBA,IAAK,CAE3CopB,EAAIxqB,KAAKqI,EAAOlH,OAOhB,KAAK,GALDmrB,GAAKnsB,EAAOwqB,KAAKvpB,GACjBmrB,EAAKpsB,EAAOwqB,KAAKvpB,EAAI,GAErBxD,EAAI8uB,EAEClhB,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5B,GAAI5K,GAAIT,EAAOuqB,OAAOlf,EAEtB,IAAI5K,GAAK8rB,GAAeC,GAAL/rB,EAAa,CAE9B,IAAKsB,EACJ,IAAK,GAAIF,GAAIpE,EAAOgD,EAAJoB,EAAOA,IACrByqB,EAAO,EAAGzqB,EAAI0qB,EAAQtrB,EAAIwrB,EAG7BH,GAAOtsB,EAAOsqB,QAAQjf,GAAI5K,EAAI8rB,EAAQtrB,EAAIwrB,GAG5ChvB,EAAIgD,EAAI,EAGV,IAAKsB,EACH,IAAK,GAAIoK,GAAI1O,EAAQ+uB,GAALrgB,EAAaA,IAC3BmgB,EAAO,EAAGngB,EAAIogB,EAAQtrB,EAAIwrB,GAMhC,MAFApC,GAAIxqB,KAAKqI,EAAOlH,QAET,GAAIkpB,IACThiB,OAAQA,EACRrJ,MAAOA,EACPwrB,IAAKA,EACL9nB,MAAOiqB,EAASD,EAAS,EAAGG,EAAYD,EAAY,KAWxDvC,GAAa5kB,UAAU1G,QAAU,SAAU4B,EAAUuB,GAEnD,IAAKhF,KAAKutB,QACR,KAAM,IAAI9qB,OAAM,iDAOlB,KAAK,GALD6sB,GAAKtvB,KAELylB,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,GAEhBvZ,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAOhC,IAAK,GALDkrB,GAAKpvB,KAAKytB,KAAKvpB,GACfmrB,EAAKrvB,KAAKytB,KAAKvpB,EAAI,GAEnBxD,EAAI,EAEC4N,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5B,GAAI5K,GAAI1D,KAAKwtB,OAAOlf,EAEpB,KAAKtJ,EAEH,IAAK,GAAIF,GAAIpE,EAAOgD,EAAJoB,EAAOA,IACrBrB,EAAS,GAAIqB,EAAGZ,GAAIorB,EAGxB7rB,GAASzD,KAAKutB,QAAQjf,IAAK5K,EAAGQ,GAAIorB,GAElC5uB,EAAIgD,EAAI,EAGV,IAAKsB,EAEH,IAAK,GAAIoK,GAAI1O,EAAO+kB,EAAJrW,EAAUA,IACxB3L,EAAS,GAAI2L,EAAGlL,GAAIorB,KAS5BnC,EAAa5kB,UAAUmC,QAAU,WAC/B,MAAOklB,GAAS5vB,KAAKutB,QAASvtB,KAAKwtB,OAAQxtB,KAAKytB,KAAMztB,KAAKyd,OAAO,IAOpE0P,EAAa5kB,UAAU5D,QAAU,WAC/B,MAAOirB,GAAS5vB,KAAKutB,QAASvtB,KAAKwtB,OAAQxtB,KAAKytB,KAAMztB,KAAKyd,OAAO,GAGpE,IAAImS,GAAW,SAAUzkB,EAAQrJ,EAAOwrB,EAAK9nB,EAAM0pB,GAEjD,GAKIxrB,GAAGQ,EALHuhB,EAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,GAEf0J,EAAI,GAAIpL,OAAM2hB,EAIlB,KAAK/hB,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IAEpB,IADAwL,EAAExL,GAAK,GAAII,OAAMgqB,GACZ5pB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IACvBgL,EAAExL,GAAGQ,GAAK,CAId,KAAKA,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAKvB,IAAK,GAHDkrB,GAAK9B,EAAIppB,GACTmrB,EAAK/B,EAAIppB,EAAI,GAERoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAEvB5K,EAAI5B,EAAMwM,GAEVY,EAAExL,GAAGQ,GAAKiH,EAAU+jB,EAAO9kB,EAAOzB,MAAMwC,EAAOmD,IAAMnD,EAAOmD,GAAM,CAGtE,OAAOY,GAuXT,OA5WAie,GAAa5kB,UAAUO,OAAS,SAAUC,GAOxC,IAAK,GALD0c,GAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,GAErB/V,EAAM,kBAAoBH,EAAOuB,OAAO2c,EAAM1c,GAAW,MAAQxB,EAAOuB,OAAOglB,EAAS/kB,GAAW,cAAgBxB,EAAOuB,OAAO9I,KAAKwtB,OAAOvpB,QAAUwhB,EAAOqI,GAAU/kB,GAAW,KAE9K7E,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAK3B,IAAK,GAHDkrB,GAAKpvB,KAAKytB,KAAKvpB,GACfmrB,EAAKrvB,KAAKytB,KAAKvpB,EAAI,GAEdoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5B,GAAI5K,GAAI1D,KAAKwtB,OAAOlf,EAEpB5G,IAAO,UAAYH,EAAOuB,OAAOpF,EAAGqF,GAAW,KAAOxB,EAAOuB,OAAO5E,EAAG6E,GAAW,UAAY/I,KAAKutB,QAAUhmB,EAAOuB,OAAO9I,KAAKutB,QAAQjf,GAAIvF,GAAW,KAG3J,MAAOrB,IAOTylB,EAAa5kB,UAAUa,SAAW,WAChC,MAAO7B,GAAOuB,OAAO9I,KAAK0K,YAO5ByiB,EAAa5kB,UAAUc,OAAS,WAC9B,OACEC,OAAQ,eACR6B,OAAQnL,KAAKutB,QACbzrB,MAAO9B,KAAKwtB,OACZF,IAAKttB,KAAKytB,KACVjoB,KAAMxF,KAAKyd,QAWf0P,EAAa5kB,UAAUsnB,SAAW,SAASvhB,GAEzC,GAAIA,GAKF,GAHIA,YAAa6O,KACf7O,EAAIA,EAAEnG,aAEH3B,EAAS8H,KAAOtD,EAAUsD,GAC7B,KAAM,IAAI7H,WAAW,iDAKvB6H,GAAI,CAGN,IAAIwhB,GAASxhB,EAAI,EAAIA,EAAI,EACrByhB,EAAW,EAAJzhB,GAASA,EAAI,EAGpBmX,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,GAGrBzO,EAAI5G,KAAKlG,IAAIujB,EAAOsK,EAAMjC,EAAWgC,GAGrC3kB,KACArJ,KACAwrB,IAEJA,GAAI,GAAK,CAET,KAAK,GAAIppB,GAAI4rB,EAAYhC,EAAJ5pB,GAAeiH,EAAOlH,OAAS+K,EAAG9K,IAKrD,IAAK,GAHDkrB,GAAKpvB,KAAKytB,KAAKvpB,GACfmrB,EAAKrvB,KAAKytB,KAAKvpB,EAAI,GAEdY,EAAIsqB,EAAQC,EAAJvqB,EAAQA,IAAK,CAE5B,GAAIpB,GAAI1D,KAAKwtB,OAAO1oB,EAEpB,IAAIpB,IAAMQ,EAAI4rB,EAASC,EAAM,CAE3B5kB,EAAOrI,KAAKsH,EAAOzB,MAAM3I,KAAKutB,QAAQzoB,KAEtChD,EAAMqJ,EAAOlH,OAAS,GAAKP,EAAIqsB,CAE/B,QAON,MAFAzC,GAAIxqB,KAAKqI,EAAOlH,QAET,GAAIkpB,IACThiB,OAAQA,EACRrJ,MAAOA,EACPwrB,IAAKA,EACL9nB,MAAOwJ,EAAG,MAWdme,EAAa5jB,SAAW,SAAUC,GAChC,MAAO,IAAI2jB,GAAa3jB,IAY1B2jB,EAAa0C,SAAW,SAAUrqB,EAAMK,EAAOyI,GAC7C,IAAKvK,EAAQyB,GACX,KAAM,IAAIiB,WAAU,iCACtB,IAAoB,IAAhBjB,EAAKvB,OACP,KAAM,IAAIxB,OAAM,2CAiBlB,IAdA+C,EAAOA,EAAKzD,IAAI,SAAUoV,GAOxB,GALIA,YAAagG,KAEfhG,EAAIA,EAAEhP,aAGH3B,EAAS2Q,KAAOnM,EAAUmM,IAAU,EAAJA,EACnC,KAAM,IAAI1U,OAAM,wCAElB,OAAO0U,KAIL7I,GAKF,GAHIA,YAAa6O,KACf7O,EAAIA,EAAEnG,aAEH3B,EAAS8H,KAAOtD,EAAUsD,GAC7B,KAAM,IAAI7H,WAAW,iDAKvB6H,GAAI,CAGN,IAWI0hB,GAXAF,EAASxhB,EAAI,EAAIA,EAAI,EACrByhB,EAAW,EAAJzhB,GAASA,EAAI,EAGpBmX,EAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,GAGfwJ,EAAI5G,KAAKlG,IAAIujB,EAAOsK,EAAMjC,EAAWgC,EAMzC,IAAI/rB,EAAQ8B,GAAQ,CAElB,GAAIA,EAAM5B,SAAW+K,EAEnB,KAAM,IAAIvM,OAAM,6BAGlButB,GAAS,SAAUtsB,GAEjB,MAAOmC,GAAMnC,QAGZ,IAAImC,YAAiBnB,GAAQ,CAEhC,GAAIurB,GAAKpqB,EAAML,MAEf,IAAkB,IAAdyqB,EAAGhsB,QAAgBgsB,EAAG,KAAOjhB,EAE/B,KAAM,IAAIvM,OAAM,wBAGlButB,GAAS,SAAUtsB,GAEjB,MAAOmC,GAAMiG,KAAKpI,SAKpBssB,GAAS,WAEP,MAAOnqB,GAUX,KAAK,GALDsF,MACArJ,KACAwrB,KAGKppB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAEhCopB,EAAIxqB,KAAKqI,EAAOlH,OAEhB,IAAIP,GAAIQ,EAAI4rB,CAEZ,IAAIpsB,GAAK,GAASsL,EAAJtL,EAAO,CAEnB,GAAIqqB,GAAIiC,EAAOtsB,EAEVkqB,GAAMG,EAAG,KAEZjsB,EAAMgB,KAAKY,EAAIqsB,GAEf5kB,EAAOrI,KAAKirB,KAOlB,MAFAT,GAAIxqB,KAAKqI,EAAOlH,QAET,GAAIkpB,IACThiB,OAAQA,EACRrJ,MAAOA,EACPwrB,IAAKA,EACL9nB,MAAOigB,EAAMqI,MAYjBX,EAAa5kB,UAAU2nB,SAAW,SAAUxsB,EAAGQ,GAE7C,KAAKsC,EAAS9C,IAAOsH,EAAUtH,IAAO8C,EAAStC,IAAO8G,EAAU9G,IAC9D,KAAM,IAAIzB,OAAM,sCAGlB,IAA0B,IAAtBzC,KAAKyd,MAAMxZ,OACb,KAAM,IAAIxB,OAAM,2CASlB,OANAyrB,GAAcxqB,EAAG1D,KAAKyd,MAAM,IAC5ByQ,EAAchqB,EAAGlE,KAAKyd,MAAM,IAG5B0P,EAAagD,UAAUzsB,EAAGQ,EAAGlE,KAAKyd,MAAM,GAAIzd,KAAKutB,QAASvtB,KAAKwtB,OAAQxtB,KAAKytB,MAErEztB,MAYTmtB,EAAaiD,YAAc,SAAUlsB,EAAGiH,EAAQrJ,EAAOwrB,EAAK7pB,GAK1D,IAAK,GAHD2rB,GAAK9B,EAAIppB,GACTmrB,EAAK/B,EAAIppB,EAAI,GAERoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAEvB7K,EAAS3B,EAAMwM,GAAInD,EAAOmD,KAc9B6e,EAAagD,UAAY,SAAUrrB,EAAGsK,EAAG0e,EAAS3iB,EAAQrJ,EAAOwrB,GAE/D,IAAK,GAAIppB,GAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAEhC,GAAIkrB,GAAK9B,EAAIppB,GACTmrB,EAAK/B,EAAIppB,EAAI,GAEbmsB,EAAK1B,EAAe7pB,EAAGsqB,EAAIC,EAAIvtB,GAE/BwuB,EAAK3B,EAAevf,EAAGggB,EAAIC,EAAIvtB,EAEnC,IAASutB,EAALgB,GAAgBhB,EAALiB,GAAWxuB,EAAMuuB,KAAQvrB,GAAKhD,EAAMwuB,KAAQlhB,GAEzD,GAAIjE,EAAQ,CACV,GAAI4iB,GAAI5iB,EAAOklB,EACfllB,GAAOklB,GAAMllB,EAAOmlB,GACpBnlB,EAAOmlB,GAAMvC,OAMjB,IAASsB,EAALgB,GAAWvuB,EAAMuuB,KAAQvrB,IAAMwrB,GAAMjB,GAAMvtB,EAAMwuB,KAAQlhB,GAA7D,CAEE,GAAImhB,GAAKplB,EAASA,EAAOklB,GAAM7lB,MAE/B1I,GAAMmtB,OAAOqB,EAAI,EAAGlhB,GAChBjE,GACFA,EAAO8jB,OAAOqB,EAAI,EAAGC,GAEvBzuB,EAAMmtB,OAAaoB,GAANC,EAAWD,EAAK,EAAIA,EAAI,GACjCllB,GACFA,EAAO8jB,OAAaoB,GAANC,EAAWD,EAAK,EAAIA,EAAI,OAK1C,IAAShB,EAALiB,GAAWxuB,EAAMwuB,KAAQlhB,IAAMihB,GAAMhB,GAAMvtB,EAAMuuB,KAAQvrB,GAAI,CAE/D,GAAI0rB,GAAKrlB,EAASA,EAAOmlB,GAAM9lB,MAE/B1I,GAAMmtB,OAAOoB,EAAI,EAAGvrB,GAChBqG,GACFA,EAAO8jB,OAAOoB,EAAI,EAAGG,GAEvB1uB,EAAMmtB,OAAaqB,GAAND,EAAWC,EAAK,EAAIA,EAAI,GACjCnlB,GACFA,EAAO8jB,OAAaqB,GAAND,EAAWC,EAAK,EAAIA,EAAI,MAM9C5rB,EAAOiH,SAAS8kB,OAAStD,EAElBA,EA/nCT,GAAIvoB,GAAO1E,EAAoB,KAC3BoF,EAAiBpF,EAAoB,KAErCuE,EAAQG,EAAKH,MACb2F,EAASxF,EAAKwF,OACd7C,EAAS3C,EAAK2C,OACdrE,EAAS0B,EAAK1B,OAEda,EAAUD,MAAMC,QAChByC,EAAW5B,EAAK1B,OAAOsD,SACvBwE,EAAYpG,EAAK1B,OAAO8H,UAExBkjB,EAAgBzpB,EAAMypB,aAsnC1BtuB,GAAQkG,KAAO,eACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAeA,SAASP,GAASwB,EAAMP,EAAQ4B,GAM9B,QAASkuB,GAAYtD,GACnB,KAAMptB,eAAgB0wB,IACpB,KAAM,IAAIzqB,aAAY,mDAExB,IAAImnB,YAAgB1oB,GAEA,gBAAd0oB,EAAKjsB,MAEPnB,KAAK2wB,MAAQvmB,EAAOzB,MAAMykB,EAAKuD,OAC/B3wB,KAAKyd,MAAQrT,EAAOzB,MAAMykB,EAAK3P,SAI/Bzd,KAAK2wB,MAAQvD,EAAK1iB,UAClB1K,KAAKyd,MAAQ2P,EAAK5nB,YAGjB,IAAI4nB,GAAQrpB,EAAQqpB,EAAKA,OAASrpB,EAAQqpB,EAAK5nB,MAElDxF,KAAK2wB,MAAQvD,EAAKA,KAClBptB,KAAKyd,MAAQ2P,EAAK5nB,SAEf,IAAIzB,EAAQqpB,GAEfptB,KAAK2wB,MAAQC,EAAWxD,GAExBptB,KAAKyd,MAAQhZ,EAAMe,KAAKxF,KAAK2wB,WAE1B,CAAA,GAAIvD,EAEP,KAAM,IAAI3mB,WAAU,6BAA+B7B,EAAK+oB,MAAMxsB,KAAKisB,GAAQ,IAI3EptB,MAAK2wB,SACL3wB,KAAKyd,OAAS,IAsHlB,QAASoT,GAAM5tB,EAAQnB,GACrB,KAAMA,YAAiBR,IACrB,KAAM,IAAImF,WAAU,gBAGtB,IAAI2E,GAAWtJ,EAAMsJ,UACrB,IAAIA,EAEF,MAAOnI,GAAO6I,IAAIhK,EAAMI,MAIxB,IAAIsD,GAAO1D,EAAM0D,MACjB,IAAIA,EAAKvB,QAAUhB,EAAOwa,MAAMxZ,OAC9B,KAAM,IAAIqB,GAAeE,EAAKvB,OAAQhB,EAAOwa,MAAMxZ,OAMrD,KAAK,GAFD/B,GAAMJ,EAAMI,MACZF,EAAMF,EAAME,MACP0B,EAAI,EAAGkC,EAAK3C,EAAOwa,MAAMxZ,OAAY2B,EAAJlC,EAAQA,IAChDwqB,EAAchsB,EAAIwB,GAAIT,EAAOwa,MAAM/Z,IACnCwqB,EAAclsB,EAAI0B,GAAIT,EAAOwa,MAAM/Z,GAKrC,OAAO,IAAIgtB,GAAYI,EAAc7tB,EAAO0tB,MAAO7uB,EAAO0D,EAAKvB,OAAQ,IAc3E,QAAS6sB,GAAe1D,EAAMtrB,EAAOivB,EAAMvtB,GACzC,GAAIwtB,GAAQxtB,GAAOutB,EAAO,EACtB5uB,EAAQL,EAAMK,MAAMqB,EAExB,OACSrB,GAAMJ,IADXivB,EACe,SAAUttB,GACzB,MAAO0pB,GAAK1pB,IAIG,SAAUA,GACzB,GAAI6a,GAAQ6O,EAAK1pB,EACjB,OAAOotB,GAAcvS,EAAOzc,EAAOivB,EAAMvtB,EAAM,KAgBrD,QAASytB,GAAMhuB,EAAQnB,EAAOssB,EAAWviB,GACvC,KAAM/J,YAAiBR,IACrB,KAAM,IAAImF,WAAU,gBAItB,IAII4nB,GAJAC,EAAQxsB,EAAM0D,OACd4F,EAAWtJ,EAAMsJ,UAYrB,IARIgjB,YAAqB1pB,IACvB2pB,EAAQD,EAAU5oB,OAClB4oB,EAAYA,EAAUzpB,WAGtB0pB,EAAQ5pB,EAAMe,KAAK4oB,GAGjBhjB,EAAU,CAIZ,GAAqB,IAAjBijB,EAAMpqB,OACR,KAAM,IAAIwC,WAAU,kBAGtBxD,GAAO8I,IAAIjK,EAAMI,MAAOksB,EAAWviB,OAEhC,CAIH,GAAIyiB,EAAMrqB,OAAShB,EAAOwa,MAAMxZ,OAC9B,KAAM,IAAIqB,GAAegpB,EAAMrqB,OAAQhB,EAAOwa,MAAMxZ,OAAQ,IAG9D,IAAIoqB,EAAMpqB,OAASqqB,EAAMrqB,OAAQ,CAI/B,IAFA,GAAIP,GAAI,EACJ6qB,EAAQ,EACQ,IAAbD,EAAM5qB,IAAyB,IAAb2qB,EAAM3qB,IAC7BA,GAEF,MAAoB,IAAb4qB,EAAM5qB,IACX6qB,IACA7qB,GAIF0qB,GAAY3pB,EAAM+pB,UAAUJ,EAAWE,EAAMrqB,OAAQsqB,EAAOF,GAI9D,IAAKjkB,EAAOihB,UAAUiD,EAAOD,GAC3B,KAAM,IAAI/oB,GAAegpB,EAAOD,EAAO,IAIzC,IAAI7oB,GAAO1D,EAAME,MAAMD,IAAI,SAAU2B,GACnC,MAAOA,GAAI,GAEbwtB,GAAKjuB,EAAQuC,EAAMqG,EAGnB,IAAIklB,GAAOzC,EAAMrqB,OACbT,EAAM,CACV2tB,GAAeluB,EAAO0tB,MAAO7uB,EAAOssB,EAAW2C,EAAMvtB,GAGvD,MAAOP,GAYT,QAASkuB,GAAe/D,EAAMtrB,EAAOssB,EAAW2C,EAAMvtB,GACpD,GAAIwtB,GAAQxtB,GAAOutB,EAAO,EACtB5uB,EAAQL,EAAMK,MAAMqB,EAGtBrB,GAAMN,QADJmvB,EACY,SAAUI,EAAWC,GACjCnD,EAAckD,GACdhE,EAAKgE,GAAahD,EAAUiD,IAIhB,SAAUD,EAAWC,GACjCnD,EAAckD,GACdD,EAAc/D,EAAKgE,GAAYtvB,EAAOssB,EAAUiD,GAAWN,EAAMvtB,EAAM,KAsD7E,QAAS0tB,GAAKjuB,EAAQuC,EAAMqG,GAK1B,IAJA,GAAIylB,GAAUlnB,EAAOzB,MAAM1F,EAAOwa,OAC9B8T,GAAU,EAGPD,EAAQrtB,OAASuB,EAAKvB,QAC3BqtB,EAAQxuB,KAAK,GACbyuB,GAAU,CAIZ,KAAK,GAAI7tB,GAAI,EAAGkC,EAAKJ,EAAKvB,OAAY2B,EAAJlC,EAAQA,IACpC8B,EAAK9B,GAAK4tB,EAAQ5tB,KACpB4tB,EAAQ5tB,GAAK8B,EAAK9B,GAClB6tB,GAAU,EAIVA,IAEF3C,EAAQ3rB,EAAQquB,EAASzlB,GA2V7B,QAAS+kB,GAAWxD,GAClB,IAAK,GAAI1pB,GAAI,EAAGkC,EAAKwnB,EAAKnpB,OAAY2B,EAAJlC,EAAQA,IAAK,CAC7C,GAAIkc,GAAOwN,EAAK1pB,EACZK,GAAQ6b,GACVwN,EAAK1pB,GAAKktB,EAAWhR,GAEdA,YAAgBlb,KACvB0oB,EAAK1pB,GAAKktB,EAAWhR,EAAKjb,YAI9B,MAAOyoB,GAjvBT,GAAI9rB,GAAQH,EAAKG,MACb6b,EAAYhc,EAAKgc,UACjBzY,EAASvD,EAAKuD,MAyClBgsB,GAAYnoB,UAAY,GAAI7D,GAE5BgsB,EAAYnoB,UAAUpH,KAAO,cAU7BuvB,EAAYnoB,UAAUkD,QAAU,WAC9B,MAAO,SAgBTilB,EAAYnoB,UAAUnG,OAAS,SAAUN,EAAO8J,EAAaC,GAC3D,OAAQ3F,UAAUjC,QAChB,IAAK,GACH,MAAO4sB,GAAK7wB,KAAM8B,EAGpB,KAAK,GACL,IAAK,GACH,MAAOmvB,GAAKjxB,KAAM8B,EAAO8J,EAAaC,EAExC,SACE,KAAM,IAAI5F,aAAY,+BAS5ByqB,EAAYnoB,UAAUuD,IAAM,SAAUhK,GACpC,IAAKiC,EAAQjC,GACX,KAAM,IAAI2E,WAAU,iBACtB,IAAI3E,EAAMmC,QAAUjE,KAAKyd,MAAMxZ,OAC7B,KAAM,IAAIqB,GAAexD,EAAMmC,OAAQjE,KAAKyd,MAAMxZ,OAGpD,KAAK,GAAIa,GAAI,EAAGA,EAAIhD,EAAMmC,OAAQa,IAChCopB,EAAcpsB,EAAMgD,GAAI9E,KAAKyd,MAAM3Y,GAGrC,KAAK,GADDsoB,GAAOptB,KAAK2wB,MACPjtB,EAAI,EAAGkC,EAAK9D,EAAMmC,OAAY2B,EAAJlC,EAAQA,IAAK,CAC9C,GAAI8tB,GAAU1vB,EAAM4B,EACpBwqB,GAAcsD,EAASpE,EAAKnpB,QAC5BmpB,EAAOA,EAAKoE,GAGd,MAAOpnB,GAAOzB,MAAMykB,IAYtBsD,EAAYnoB,UAAUwD,IAAM,SAAUjK,EAAO+D,EAAOgG,GAClD,IAAK9H,EAAQjC,GACX,KAAM,IAAI2E,WAAU,iBACtB,IAAI3E,EAAMmC,OAASjE,KAAKyd,MAAMxZ,OAC5B,KAAM,IAAIqB,GAAexD,EAAMmC,OAAQjE,KAAKyd,MAAMxZ,OAAQ,IAE5D,IAAIP,GAAGkC,EAAI4rB,EAGPhsB,EAAO1D,EAAMC,IAAI,SAAU2B,GAC7B,MAAOA,GAAI,GAEbwtB,GAAKlxB,KAAMwF,EAAMqG,EAGjB,IAAIuhB,GAAOptB,KAAK2wB,KAChB,KAAKjtB,EAAI,EAAGkC,EAAK9D,EAAMmC,OAAS,EAAO2B,EAAJlC,EAAQA,IACzC8tB,EAAU1vB,EAAM4B,GAChBwqB,EAAcsD,EAASpE,EAAKnpB,QAC5BmpB,EAAOA,EAAKoE,EAQd,OAJAA,GAAU1vB,EAAMA,EAAMmC,OAAS,GAC/BiqB,EAAcsD,EAASpE,EAAKnpB,QAC5BmpB,EAAKoE,GAAW3rB,EAET7F,MA8LT0wB,EAAYnoB,UAAUyD,OAAS,SAAUxG,EAAMqG,EAAcqjB,GAE3D,IAAKnrB,EAAQyB,GACX,KAAM,IAAIiB,WAAU,iBAGtB,IAAIjG,GAAI0uB,EAAOlvB,KAAK2I,QAAU3I,IAE9B,OAAO4uB,GAAQpuB,EAAGgF,EAAMqG,GAG1B,IAAI+iB,GAAU,SAAU3rB,EAAQuC,EAAMqG,GAEpC,GAAoB,IAAhBrG,EAAKvB,OAAc,CAIrB,IAFA,GAAI8pB,GAAI9qB,EAAO0tB,MAER5sB,EAAQgqB,IACbA,EAAIA,EAAE,EAER,OAAO3jB,GAAOzB,MAAMolB,GAMtB,MAHA9qB,GAAOwa,MAAQrT,EAAOzB,MAAMnD,GAC5BvC,EAAO0tB,MAAQlsB,EAAMuH,OAAO/I,EAAO0tB,MAAO1tB,EAAOwa,MAAO5R,GAEjD5I,EA4YT,OArWAytB,GAAYnoB,UAAUI,MAAQ,WAC5B,GAAInI,GAAI,GAAIkwB,IACVtD,KAAMhjB,EAAOzB,MAAM3I,KAAK2wB,OACxBnrB,KAAM4E,EAAOzB,MAAM3I,KAAKyd,QAE1B,OAAOjd,IAOTkwB,EAAYnoB,UAAU/C,KAAO,WAC3B,MAAOxF,MAAKyd,OAYdiT,EAAYnoB,UAAUxG,IAAM,SAAU0B,GAEpC,GAAI6rB,GAAKtvB,KACLyxB,EAAU,SAAU5rB,EAAO/D,GAC7B,MAAIiC,GAAQ8B,GACHA,EAAM9D,IAAI,SAAUwc,EAAO7a,GAChC,MAAO+tB,GAAQlT,EAAOzc,EAAMH,OAAO+B,MAI9BD,EAASoC,EAAO/D,EAAOwtB,GAIlC,OAAO,IAAIoB,IACTtD,KAAMqE,EAAQzxB,KAAK2wB,UACnBnrB,KAAM4E,EAAOzB,MAAM3I,KAAKyd,UAU5BiT,EAAYnoB,UAAU1G,QAAU,SAAU4B,GAExC,GAAI6rB,GAAKtvB,KACLyxB,EAAU,SAAU5rB,EAAO/D,GACzBiC,EAAQ8B,GACVA,EAAMhE,QAAQ,SAAU0c,EAAO7a,GAC7B+tB,EAAQlT,EAAOzc,EAAMH,OAAO+B,MAI9BD,EAASoC,EAAO/D,EAAOwtB,GAG3BmC,GAAQzxB,KAAK2wB,WAOfD,EAAYnoB,UAAUmC,QAAU,WAC9B,MAAON,GAAOzB,MAAM3I,KAAK2wB,QAO3BD,EAAYnoB,UAAU5D,QAAU,WAC9B,MAAO3E,MAAK2wB,OAWdD,EAAYnoB,UAAUO,OAAS,SAAUC,GACvC,MAAOxB,GAAOuB,OAAO9I,KAAK2wB,MAAO5nB,IAOnC2nB,EAAYnoB,UAAUa,SAAW,WAC/B,MAAO7B,GAAOuB,OAAO9I,KAAK2wB,QAO5BD,EAAYnoB,UAAUc,OAAS,WAC7B,OACEC,OAAQ,cACR8jB,KAAMptB,KAAK2wB,MACXnrB,KAAMxF,KAAKyd,QAWfiT,EAAYnoB,UAAUsnB,SAAW,SAASvhB,GAExC,GAAIA,GAKF,GAHIA,YAAa6O,KACf7O,EAAIA,EAAEnG,aAEH3B,EAAS8H,KAAOtD,EAAUsD,GAC7B,KAAM,IAAI7H,WAAW,iDAKvB6H,GAAI,CAiBN,KAAK,GAdDwhB,GAASxhB,EAAI,EAAIA,EAAI,EACrByhB,EAAW,EAAJzhB,GAASA,EAAI,EAGpBmX,EAAOzlB,KAAKyd,MAAM,GAClBqQ,EAAU9tB,KAAKyd,MAAM,GAGrBzO,EAAI5G,KAAKlG,IAAIujB,EAAOsK,EAAMjC,EAAWgC,GAGrC1C,KAGK1pB,EAAI,EAAOsL,EAAJtL,EAAOA,IACrB0pB,EAAK1pB,GAAK0G,EAAOzB,MAAM3I,KAAK2wB,MAAMjtB,EAAIqsB,GAAMrsB,EAAIosB,GAIlD,OAAO,IAAIY,IACTtD,KAAMA,EACN5nB,MAAOwJ,MAcX0hB,EAAYb,SAAW,SAAUrqB,EAAMK,EAAOyI,EAAGzC,GAC/C,IAAK9H,EAAQyB,GACX,KAAM,IAAIiB,WAAU,iCACtB,IAAoB,IAAhBjB,EAAKvB,OACP,KAAM,IAAIxB,OAAM,2CAiBlB,IAdA+C,EAAOA,EAAKzD,IAAI,SAAUoV,GAOxB,GALIA,YAAagG,KAEfhG,EAAIA,EAAEhP,aAGH3B,EAAS2Q,KAAOnM,EAAUmM,IAAU,EAAJA,EACnC,KAAM,IAAI1U,OAAM,wCAElB,OAAO0U,KAIL7I,GAKF,GAHIA,YAAa6O,KACf7O,EAAIA,EAAEnG,aAEH3B,EAAS8H,KAAOtD,EAAUsD,GAC7B,KAAM,IAAI7H,WAAW,iDAKvB6H,GAAI,CAGN,IAWI0hB,GAXAF,EAASxhB,EAAI,EAAIA,EAAI,EACrByhB,EAAW,EAAJzhB,GAASA,EAAI,EAGpBmX,EAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,GAGfwJ,EAAI5G,KAAKlG,IAAIujB,EAAOsK,EAAMjC,EAAWgC,EAMzC,IAAI/rB,EAAQ8B,GAAQ,CAElB,GAAIA,EAAM5B,SAAW+K,EAEnB,KAAM,IAAIvM,OAAM,6BAGlButB,GAAS,SAAUtsB,GAEjB,MAAOmC,GAAMnC,QAGZ,IAAImC,YAAiBnB,GAAQ,CAEhC,GAAIurB,GAAKpqB,EAAML,MAEf,IAAkB,IAAdyqB,EAAGhsB,QAAgBgsB,EAAG,KAAOjhB,EAE/B,KAAM,IAAIvM,OAAM,wBAGlButB,GAAS,SAAUtsB,GAEjB,MAAOmC,GAAMiG,KAAKpI,SAKpBssB,GAAS,WAEP,MAAOnqB,GAKNgG,KAEHA,EAAgBmkB,EAAO,YAAc7uB,GAAKgc,UAAa,GAAIhc,GAAKgc,UAAU,GAAK,EAIjF,IAAIiQ,KAGJ,IAAI5nB,EAAKvB,OAAS,EAAG,CAEnBmpB,EAAO3oB,EAAMuH,OAAOohB,EAAM5nB,EAAMqG,EAEhC,KAAK,GAAIiD,GAAI,EAAOE,EAAJF,EAAOA,IACrBse,EAAKte,EAAIihB,GAAMjhB,EAAIghB,GAAUE,EAAOlhB,GAKxC,MAAO,IAAI4hB,IACTtD,KAAMA,EACN5nB,MAAOigB,EAAMqI,MAWjB4C,EAAYnnB,SAAW,SAAUC,GAC/B,MAAO,IAAIknB,GAAYlnB,IAWzBknB,EAAYnoB,UAAU2nB,SAAW,SAAUxsB,EAAGQ,GAE5C,KAAKsC,EAAS9C,IAAOsH,EAAUtH,IAAO8C,EAAStC,IAAO8G,EAAU9G,IAC9D,KAAM,IAAIzB,OAAM,sCAGlB,IAA0B,IAAtBzC,KAAKyd,MAAMxZ,OACb,KAAM,IAAIxB,OAAM,2CASlB,OANAyrB,GAAcxqB,EAAG1D,KAAKyd,MAAM;AAC5ByQ,EAAchqB,EAAGlE,KAAKyd,MAAM,IAG5BiT,EAAYP,UAAUzsB,EAAGQ,EAAGlE,KAAK2wB,OAE1B3wB,MAST0wB,EAAYP,UAAY,SAAUzsB,EAAGQ,EAAGkpB,GAEtC,GAAIsE,GAAKtE,EAAK1pB,EACd0pB,GAAK1pB,GAAK0pB,EAAKlpB,GACfkpB,EAAKlpB,GAAKwtB,GAuBZhtB,EAAOiH,SAASgmB,MAAQjB,EACxBhsB,EAAOiH,SAAS,WAAa+kB,EAGtBA,EAvwBT,GAAI9rB,GAAO1E,EAAoB,KAC3BoF,EAAiBpF,EAAoB,KAErCqH,EAAS3C,EAAK2C,OACd9C,EAAQG,EAAKH,MACb2F,EAASxF,EAAKwF,OAEdrG,EAAUD,MAAMC,QAChByC,EAAW5B,EAAK1B,OAAOsD,SACvBwE,EAAYpG,EAAK1B,OAAO8H,UAExBkjB,EAAgBzpB,EAAMypB,aA+vB1BtuB,GAAQkG,KAAO,cACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAWpC,QAAS+uB,GAAI3tB,GACX,KAAMjE,eAAgB4xB,IACpB,KAAM,IAAI3rB,aAAY,mDAGxBjG,MAAKutB,QAAU,GAAIzpB,OAAMG,GACzBjE,KAAK6xB,MAAQ,GAAI1wB,GAAKoc,cAfxB,GAAI2K,GAAM1lB,EAAKtC,EAAoB,KAC/B0tB,EAAQprB,EAAKtC,EAAoB,KA8HrC,OAvGA0xB,GAAIrpB,UAAUwD,IAAM,SAAUrI,EAAGqqB,GAE/B,GAAK/tB,KAAKutB,QAAQ7pB,GAQhB1D,KAAKutB,QAAQ7pB,GAAGmC,MAAQkoB,MARJ,CAEpB,GAAI9sB,GAAOjB,KAAK6xB,MAAMhU,OAAOna,EAAGqqB,EAEhC/tB,MAAKutB,QAAQ7pB,GAAKzC,IAQtB2wB,EAAIrpB,UAAUuD,IAAM,SAAUpI,GAC5B,GAAIzC,GAAOjB,KAAKutB,QAAQ7pB,EACxB,OAAIzC,GACKA,EAAK4E,MACP,GAGT+rB,EAAIrpB,UAAUupB,WAAa,SAAUpuB,EAAGqqB,GAEtC,GAAI9sB,GAAOjB,KAAKutB,QAAQ7pB,EACnBzC,GAQHA,EAAK4E,MAAQqiB,EAAIjnB,EAAK4E,MAAOkoB,IAN7B9sB,EAAOjB,KAAK6xB,MAAMhU,OAAOna,EAAGqqB,GAE5B/tB,KAAKutB,QAAQ7pB,GAAKzC,IAQtB2wB,EAAIrpB,UAAU1G,QAAU,SAAUkwB,EAAMvkB,EAAI/J,GAE1C,GAAIuuB,GAAOhyB,KAAK6xB,MACZ1mB,EAASnL,KAAKutB,QAEd7N,KAEAze,EAAO+wB,EAAK3T,gBAIhB,KAHIpd,GACFye,EAAM5c,KAAK7B,GAENA,GAAQA,EAAK6c,KAAOtQ,GAErBvM,EAAK6c,KAAOiU,IAETnE,EAAM3sB,EAAK4E,MAAO,IAErBpC,EAASxC,EAAK6c,IAAK7c,EAAK4E,MAAO7F,OAInCiB,EAAO+wB,EAAK3T,iBACRpd,GACFye,EAAM5c,KAAK7B,EAGf,KAAK,GAAIyC,GAAI,EAAGA,EAAIgc,EAAMzb,OAAQP,IAAK,CAErC,GAAIsL,GAAI0Q,EAAMhc,EAEdzC,GAAO+wB,EAAKnU,OAAO7O,EAAE8O,IAAK9O,EAAEnJ,OAE5BsF,EAAOlK,EAAK6c,KAAO7c,IAIvB2wB,EAAIrpB,UAAU0pB,KAAO,SAAUvuB,EAAGQ,GAEhC,GAAIguB,GAAQlyB,KAAKutB,QAAQ7pB,GACrByuB,EAAQnyB,KAAKutB,QAAQrpB,EAEzB,KAAKguB,GAASC,EAEZD,EAAQlyB,KAAK6xB,MAAMhU,OAAOna,EAAGyuB,EAAMtsB,OAEnC7F,KAAK6xB,MAAMlT,OAAOwT,GAElBnyB,KAAKutB,QAAQ7pB,GAAKwuB,EAClBlyB,KAAKutB,QAAQrpB,GAAKsG,WAEf,IAAI0nB,IAAUC,EAEjBA,EAAQnyB,KAAK6xB,MAAMhU,OAAO3Z,EAAGguB,EAAMrsB,OAEnC7F,KAAK6xB,MAAMlT,OAAOuT,GAElBlyB,KAAKutB,QAAQrpB,GAAKiuB,EAClBnyB,KAAKutB,QAAQ7pB,GAAK8G,WAEf,IAAI0nB,GAASC,EAAO,CAEvB,GAAIpE,GAAImE,EAAMrsB,KACdqsB,GAAMrsB,MAAQssB,EAAMtsB,MACpBssB,EAAMtsB,MAAQkoB,IAIX6D,EAGThyB,EAAQkG,KAAO,MACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAOpC,MAAO,UAAiBib,EAAKjY,GAC3B,GAAI6F,GAAcvK,EAAK0E,GAASA,EAAMyD,OACtC,OAAIoC,IAA+C,kBAAzBA,GAAYnC,SAC7BmC,EAAYnC,SAAS1D,GAGvBA,GAIXjG,EAAQkG,KAAO,UACflG,EAAQqM,KAAO,OACfrM,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,KAChCkyB,EAAiBlyB,EAAoB,KAAKwB,UAC1C8E,EAAWtG,EAAoB,KAAKsG,SACpCjC,EAAcrE,EAAoB,KAAKqE,WAU3C1E,GAAOD,QAAU,SAAUiB,GACzB,GAAIa,GAAY,WAEd,GAAI8C,GAAOD,EAAY2B,WAGnBmsB,EAAY7tB,EAAKP,OAAS,EAC1B+sB,EAAOxsB,EAAK6tB,EACZ7rB,GAASwqB,GACXxsB,EAAK6tB,GAAarB,EAAO,EAElBA,YAAgB7T,KACvB3Y,EAAK6tB,GAAarB,EAAKsB,MAAM,GAG/B,KACE,MAAOzxB,GAAKc,OAAOuJ,MAAMrK,EAAM2D,GAEjC,MAAOyI,GACL,KAAMmlB,GAAenlB,IAMzB,OAFApM,GAAKc,OAAOD,UAAYA,EAEjBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAI2hB,GAAa3hB,EAAoB,KAGjCsf,GAFYtf,EAAoB,KAAKqyB,UACvBryB,EAAoB,KAAKqE,YACtBrE,EAAoB,KAUzCL,GAAOD,QAAU,SAAUiB,GACzB,GAAI2xB,GAAU3xB,EAAKe,OAEfF,EAAY,SAAU8C,EAAM3D,EAAMumB,GACpC,GAAoB,IAAhB5iB,EAAKP,OACP,KAAM,IAAIub,GAAe,SAAUtZ,UAAUjC,OAAQ,EAGvD,IACIwuB,GADA3tB,EAAIN,EAAK,GAAG8iB,QAAQzmB,GAAMic,KAAKsK,EAEnC,IAAI5iB,EAAK,YAAcqd,GAErB4Q,EAAOjuB,EAAK,GAAG8iB,QAAQzmB,GAAMic,KAAKsK,OAE/B,CAIH,GAAIsL,GAAStL,MACTuL,EAASnuB,EAAK,GACb5C,OAAO,SAAUX,GAChB,MAAQA,aAAgB4gB,MAClB5gB,EAAK6E,OAAQjF,OACbI,EAAK6E,OAAQ4sB,MAClB,GAGHE,EAAM5vB,OAAOrC,OAAO+xB,GACpBG,EAAKruB,EAAK,GAAG8iB,QAAQzmB,EACzB,KAAI8xB,EAQF,KAAM,IAAIlwB,OAAM,iDAPhB,IAAIqD,GAAO6sB,EAAO7sB,IAClB2sB,GAAO,SAAU3tB,GAEf,MADA8tB,GAAI9sB,GAAQhB,EACL+tB,EAAG/V,KAAK8V,IAQrB,MAAOJ,GAAQ1tB,EAAG2tB,GAMpB,OAHA/wB,GAAUoxB,SAAU,EACpBjyB,EAAKe,OAAOF,UAAYA,EAEjBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YASAL,GAAOD,QAAU,SAAUiB,GAkBzB,QAASkyB,GAAetuB,EAAOhB,EAAUuvB,GACvC,GAAIvB,GAAU,SAAU5rB,EAAO/D,GACzBgC,MAAMC,QAAQ8B,GAChBA,EAAMhE,QAAQ,SAAU0c,EAAO7a,GAE7B+tB,EAAQlT,EAAOzc,EAAMH,OAAO+B,EAAI,MAIlCD,EAASoC,EAAO/D,EAAOkxB,GAG3BvB,GAAQhtB,MA5BV,GAAIC,GAAS7D,EAAKM,KAAKuD,OAEnBhD,EAAY,SAAUoD,EAAGrB,GAC3B,GAAwB,GAApByC,UAAUjC,OACZ,KAAM,IAAIpD,GAAKwC,MAAMmc,eAAe,UAAWtZ,UAAUjC,OAAQ,EAGnE,IAAIH,MAAMC,QAAQe,GAChBiuB,EAAcjuB,EAAGrB,EAAUqB,OACtB,CAAA,KAAIA,YAAaJ,IAGtB,KAAM,IAAI7D,GAAKwC,MAAM4vB,qBAAqB,UAAWpyB,EAAK,UAAUiE,GAFpEiuB,GAAcjuB,EAAEH,UAAWlB,EAAUqB,IAuBzC,OAFAjE,GAAKgB,QAAQH,UAAYA,EAElBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YASAL,GAAOD,QAAU,SAAUiB,GAkBzB,QAASqyB,GAAWC,EAAS1vB,EAAUuvB,GACrC,GAAIvB,GAAU,SAAU5rB,EAAO/D,GAC7B,MAAIgC,OAAMC,QAAQ8B,GACTA,EAAM9D,IAAI,SAAUwc,EAAO7a,GAEhC,MAAO+tB,GAAQlT,EAAOzc,EAAMH,OAAO+B,EAAI,MAIlCD,EAASoC,EAAO/D,EAAOkxB,GAIlC,OAAOvB,GAAQ0B,MA7BjB,GAAIzuB,GAAS7D,EAAKM,KAAKuD,OAEnBhD,EAAY,SAAUoD,EAAGrB,GAC3B,GAAwB,GAApByC,UAAUjC,OACZ,KAAM,IAAIpD,GAAKwC,MAAMmc,eAAe,MAAOtZ,UAAUjC,OAAQ,EAG/D,IAAIH,MAAMC,QAAQe,GAChB,MAAOouB,GAAUpuB,EAAGrB,EAAUqB,EACzB,IAAIA,YAAaJ,GACtB,MAAO7D,GAAKoC,OAAOiwB,EAAUpuB,EAAEH,UAAWlB,EAAUqB,GAEpD,MAAM,IAAIjE,GAAKwC,MAAM4vB,qBAAqB,MAAOpyB,EAAK,UAAUiE,IAsBpE,OAFAjE,GAAKkB,IAAIL,UAAYA,EAEdA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,KAChCkyB,EAAiBlyB,EAAoB,KAAKwB,UAC1C8E,EAAWtG,EAAoB,KAAKsG,SACpCjC,EAAcrE,EAAoB,KAAKqE,WAU3C1E,GAAOD,QAAU,SAAUiB,GAEzB,GAAIgE,GAAehE,EAAKyD,WAAWO,aAE/BnD,EAAY,WACd,GAAI8C,GAAOD,EAAY2B,UAGvB,IAAmB,GAAf1B,EAAKP,QAAeY,EAAaL,EAAK,IAAK,CAC7C,GAAIhB,GAAMgB,EAAK,EACXgC,GAAShD,GACXgB,EAAK,GAAKhB,EAAM,EAETA,YAAe2Z,KACtB3Y,EAAK,GAAKhB,EAAI8uB,MAAM,IAIxB,IACE,MAAOzxB,GAAKmB,IAAIkJ,MAAMrK,EAAM2D,GAE9B,MAAOyI,GACL,KAAMmlB,GAAenlB,IAMzB,OAFApM,GAAKmB,IAAIN,UAAYA,EAEdA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,KAChCkyB,EAAiBlyB,EAAoB,KAAKwB,UAC1C8E,EAAWtG,EAAoB,KAAKsG,SACpCjC,EAAcrE,EAAoB,KAAKqE,WAU3C1E,GAAOD,QAAU,SAAUiB,GAEzB,GAAIgE,GAAehE,EAAKyD,WAAWO,aAE/BnD,EAAY,WACd,GAAI8C,GAAOD,EAAY2B,UAGvB,IAAmB,GAAf1B,EAAKP,QAAeY,EAAaL,EAAK,IAAK,CAC7C,GAAIhB,GAAMgB,EAAK,EACXgC,GAAShD,GACXgB,EAAK,GAAKhB,EAAM,EAETA,YAAe2Z,KACtB3Y,EAAK,GAAKhB,EAAI8uB,MAAM,IAIxB,IACE,MAAOzxB,GAAKoB,KAAKiJ,MAAMrK,EAAM2D,GAE/B,MAAOyI,GACL,KAAMmlB,GAAenlB,IAMzB,OAFApM,GAAKoB,KAAKP,UAAYA,EAEfA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,KAChCkyB,EAAiBlyB,EAAoB,KAAKwB,UAC1C8E,EAAWtG,EAAoB,KAAKsG,SACpCjC,EAAcrE,EAAoB,KAAKqE,WAU3C1E,GAAOD,QAAU,SAAUiB,GAEzB,GAAIgE,GAAehE,EAAKyD,WAAWO,aAE/BnD,EAAY,WACd,GAAI8C,GAAOD,EAAY2B,UAGvB,IAAmB,GAAf1B,EAAKP,QAAeY,EAAaL,EAAK,IAAK,CAC7C,GAAIhB,GAAMgB,EAAK,EACXgC,GAAShD,GACXgB,EAAK,GAAKhB,EAAM,EAETA,YAAe2Z,KACtB3Y,EAAK,GAAKhB,EAAI8uB,MAAM,IAIxB,IACE,MAAOzxB,GAAKqB,IAAIgJ,MAAMrK,EAAM2D,GAE9B,MAAOyI,GACL,KAAMmlB,GAAenlB,IAMzB,OAFApM,GAAKqB,IAAIR,UAAYA,EAEdA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIqyB,GAAYryB,EAAoB,KAAKqyB,UACrChuB,EAAcrE,EAAoB,KAAKqE,WAS3C1E,GAAOD,QAAU,SAAUiB,GACzB,GAAIa,GAAY,WACd,GAAI8C,GAAOD,EAAY2B,WAEnBmsB,EAAY7tB,EAAKP,OAAS,EAC1B+sB,EAAOxsB,EAAK6tB,EAKhB,OAJKE,GAAUvB,IACbxsB,EAAK1B,MAAK,GAGLjC,EAAKsB,MAAM+I,MAAMrK,EAAM2D,GAKhC,OAFA3D,GAAKsB,MAAMT,UAAYA,EAEhBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIkyB,GAAiBlyB,EAAoB,KAAKwB,UAE1C6C,GADYrE,EAAoB,KAAKqyB,UACvBryB,EAAoB,KAAKqE,YAS3C1E,GAAOD,QAAU,SAAUiB,GACzB,GAAIa,GAAY,WACd,IACE,MAAOb,GAAKuB,OAAO8I,MAAMrK,EAAM0D,EAAY2B,YAE7C,MAAO+G,GACL,KAAMmlB,GAAenlB,IAMzB,OAFApM,GAAKuB,OAAOV,UAAYA,EAEjBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,KAChCmB,EAAQnB,EAAoB,GAC5BoB,EAAQpB,EAAoB,GAC5BsG,EAAWtG,EAAoB,KAAKsG,QASxC3G,GAAOD,QAAU,SAAUiB,GACzB,GAAIa,GAAY,WAEd,IAAK,GADD8C,MACKd,EAAI,EAAGkC,EAAKM,UAAUjC,OAAY2B,EAAJlC,EAAQA,IAAK,CAClD,GAAIyC,GAAMD,UAAUxC,EAGpB,IAAIyC,YAAe9E,GACjB8E,EAAIsD,QACJtD,EAAIuD,KAAQvD,EAAIwD,KAAO,EAAI,EAAI,MAE5B,IAAInD,EAASL,GAChBA,QAEG,CAAA,KAAIA,YAAegX,IAItB,KAAM,IAAI1W,WAAU,mCAHpBN,GAAMA,EAAIgC,WAAa,EAMzB3D,EAAKd,GAAKyC,EAGZ,GAAIf,GAAM,GAAI9D,EAEd,OADAA,GAAM4J,MAAM9F,EAAKZ,GACVY,EAKT,OAFAvE,GAAKiB,MAAMJ,UAAYA,EAEhBA,IAMJ,SAAS7B,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtCiJ,EAAMtG,EAAM,OACdK,OAAUkF,KAAKe,IAEf/H,QAAW,SAAU0D,GACnB,GAAIiB,GAAKqC,KAAKe,IAAIrE,EAAEiB,IAChBC,EAAKoC,KAAKe,IAAIrE,EAAEkB,GACpB,IAAS,IAALD,GAAkB,IAALC,EACf,MAAOoC,MAAKK,KAAK1C,EAAKA,EAAKC,EAAKA,EAIhC,IAAID,GAAMC,EAAI,CACZ,GAAItC,GAAIsC,EAAKD,CACb,OAAOA,GAAKqC,KAAKK,KAAK,EAAI/E,EAAIA,GAG9B,GAAIQ,GAAI6B,EAAKC,CACb,OAAOA,GAAKoC,KAAKK,KAAK,EAAIvE,EAAIA,IAKpCiZ,UAAa,SAAUrY,GACrB,MAAOA,GAAEqE,OAGXiqB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGqE,GAAK,KAItC,OAAOA,GAGTvJ,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtC+C,EAAST,EAAKtC,EAAoB,KAClC0tB,EAAQprB,EAAKtC,EAAoB,MACjCmzB,EAAgB7wB,EAAKtC,EAAoB,MACzCozB,EAAY9wB,EAAKtC,EAAoB,MAErCwwB,EAAcvvB,EAAKuvB,YACnBvD,EAAehsB,EAAKgsB,aAgCpBjF,EAAMrlB,EAAM,OAEd0wB,WAAYD,EAEZE,iBAAkB,SAAU1uB,EAAGsK,GAE7B,GAAIqkB,GAAQ3uB,EAAEU,OACVkuB,EAAQtkB,EAAE5J,MAGd,IAAIiuB,EAAMxvB,SAAWyvB,EAAMzvB,OACzB,KAAM,IAAIqB,GAAemuB,EAAMxvB,OAAQyvB,EAAMzvB,OAG/C,IAAIxD,EAGJ,QAAQqE,EAAE2G,WACR,IAAK,SACH,OAAQ2D,EAAE3D,WACR,IAAK,SAEHhL,EAAIkzB,EAA6B7uB,EAAGsK,EAAGqkB,EAAOC,EAC9C,MACF,SACEjzB,EAAImzB,EAAuB9uB,EAAGsK,EAAEzK,UAAW8uB,EAAOC,GAGtD,KACF,SACE,OAAQtkB,EAAE3D,WACR,IAAK,SAEHhL,EAAIozB,EAAuB/uB,EAAEH,UAAWyK,EAAGqkB,EAAOC,EAClD,MACF,SACEjzB,EAAIqzB,EAAiBhvB,EAAEH,UAAWyK,EAAEzK,UAAWG,EAAE2G,YAKzD,MAAOhL,IAGTszB,eAAgB,SAAUjvB,EAAGsK,GAE3B,MAAO8Y,GAAIjlB,EAAO6B,GAAI7B,EAAOmM,IAAIzK,WAGnCqvB,gBAAiB,SAAUlvB,EAAGsK,GAE5B,MAAO8Y,GAAIjlB,EAAO6B,GAAIsK,IAGxB6kB,gBAAiB,SAAUnvB,EAAGsK,GAE5B,MAAO8Y,GAAIpjB,EAAG7B,EAAOmM,KAGvB8kB,cAAe,SAAUpvB,EAAGsK,GAE1B,GAAI3O,EAEJ,QAAQqE,EAAE2G,WACR,IAAK,SACHhL,EAAI0zB,EAAuBrvB,EAAGsK,EAAGtK,EAAEU,OACnC,MACF,SACE/E,EAAI6D,EAAWW,SAASH,EAAGsK,EAAG8Y,GAGlC,MAAOznB,IAGT2zB,cAAe,SAAUtvB,EAAGsK,GAE1B,GAAI3O,EAEJ,QAAQ2O,EAAE3D,WACR,IAAK,SACHhL,EAAI0zB,EAAuB/kB,EAAGtK,EAAGsK,EAAE5J,OACnC,MACF,SACE/E,EAAI6D,EAAWW,SAASH,EAAGsK,EAAG8Y,GAGlC,MAAOznB,IAGT4zB,aAAc,SAAUvvB,EAAGsK,GACzB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8Y,IAGnCoM,aAAc,SAAUxvB,EAAGsK,GACzB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8Y,MAYjCiM,EAAyB,SAAUjlB,EAAG4J,EAAGyb,GAE3C,GAAI/zB,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVC,EAAUtlB,EAAEqe,QACZkH,EAASvlB,EAAEse,OACXkH,EAAOxlB,EAAEue,IAEb,KAAKG,EAAM9U,EAAG,GAAI,CAahB,IAAK,GAXD6b,MACAC,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGH9K,EAAI,EAAO8K,EAAJ9K,EAAOA,IAAK,CAE1B2wB,EAAK3wB,GAAK0wB,EAAO3wB,MAEjB,KAAK,GAAImrB,GAAKsF,EAAKxwB,GAAImrB,EAAKqF,EAAKxwB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAIyf,GAAIuF,EAAUkB,EAAQlmB,GAAIwK,EAEzB8U,GAAMG,EAAG,KAEZ6G,EAAO9xB,KAAK2xB,EAAOnmB,IACnBqmB,EAAQ7xB,KAAKirB,KAOnB,MAFA8G,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,EAGT,MAAOyO,GAAEvG,SAWPgrB,EAA+B,SAAUzkB,EAAG4J,EAAGyb,EAAOO,GAExD,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IA0B7G,KAAK,GAxBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVC,EAAUtlB,EAAEqe,QAEZyH,EAAUlc,EAAEyU,QAEZpiB,EAASqpB,GAAWQ,EAEpBL,EAAUxpB,KAAcX,OACxBoqB,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGRlK,EAAIqG,EAAS,GAAIrH,OAAMtD,GAAKgK,OAE5ByqB,EAAI,GAAInxB,OAAMtD,GAET0D,EAAI,EAAO8K,EAAJ9K,EAAOA,IAQrB,GANA2wB,EAAK3wB,GAAK0wB,EAAO3wB,OAEjBovB,EAAcnkB,EAAGhL,EAAG,EAAG+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,GAEpC4yB,EAAcva,EAAG5U,EAAG,EAAG+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,GAEhC0K,EAEF,IAAK,GAAI+pB,GAAKL,EAAK3wB,GAAIixB,EAAKP,EAAO3wB,OAAQvD,EAAIw0B,EAAQC,EAAJz0B,EAAQA,IAEzDi0B,EAAQ7xB,KAAKgC,EAAE8vB,EAAOl0B,IAO5B,OAFAm0B,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,GAWLmzB,EAAyB,SAAU1kB,EAAG4J,EAAGyb,EAAOO,GAElD,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IAsB7G,KAAK,GApBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVnH,EAAOtU,EAEP6b,KACAC,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGRlK,EAAI,GAAIhB,OAAMtD,GAEdy0B,EAAI,GAAInxB,OAAMtD,GAET0D,EAAI,EAAO8K,EAAJ9K,EAAOA,IAAK,CAE1B2wB,EAAK3wB,GAAK0wB,EAAO3wB,MAEjB,KAAK,GAAIP,GAAI,EAAOlD,EAAJkD,EAAOA,IAAK,CAE1B,GAAIqqB,GAAIX,EAAK1pB,GAAGQ,EAEX0pB,GAAMG,EAAG,KACZjpB,EAAEpB,GAAKqqB,EACPkH,EAAEvxB,GAAKQ,EAAI,EACX0wB,EAAO9xB,KAAKY,IAIhB2vB,EAAcnkB,EAAGhL,EAAG,EAAG+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,EAEpC,KAAK,GAAIy0B,GAAKL,EAAK3wB,GAAIixB,EAAKP,EAAO3wB,OAAQvD,EAAIw0B,EAAQC,EAAJz0B,EAAQA,IAEzDi0B,EAAQ7xB,KAAKgC,EAAE8vB,EAAOl0B,KAM1B,MAFAm0B,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,GAWLozB,EAAyB,SAAU3kB,EAAG4J,EAAGyb,EAAOO,GAElD,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IAkB7G,KAAK,GAhBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVnH,EAAOle,EAEP8lB,EAAUlc,EAAEyU,QACZ6H,EAAStc,EAAE0U,OACX6H,EAAOvc,EAAE2U,KAET6H,EAAQ3sB,EAAMykB,GAEd3sB,EAAI,GAAIiwB,IACVtD,KAAMkI,EACN9vB,MAAOhF,EAAGwO,KAGH9K,EAAI,EAAO8K,EAAJ9K,EAAOA,IAErB,IAAK,GAAIkrB,GAAKiG,EAAKnxB,GAAImrB,EAAKgG,EAAKnxB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAI5K,GAAI0xB,EAAO9mB,EAEfgnB,GAAM5xB,GAAGQ,GAAKovB,EAAUgC,EAAM5xB,GAAGQ,GAAI8wB,EAAQ1mB,IAIjD,MAAO7N,IAWLqzB,EAAmB,SAAU5kB,EAAG4J,EAAGhQ,GAErC,MAAO7F,GAAOqB,EAAWW,SAASiK,EAAG4J,EAAGoP,GAAMpf,GAGhD,OAAOof,GAnXT,GAAIvf,GAAQzI,EAAoB,KAAKyI,MACjCrD,EAAiBpF,EAAoB,IAqXzCN,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA8BtCqK,EAAO1H,EAAM,QACfK,OAAUkF,KAAKmC,KAEfnJ,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,YACTtD,KAAKmC,KAAKzF,EAAEiB,IACZqC,KAAKmC,KAAKzF,EAAEkB,MAIlBmX,UAAa,SAAUrY,GACrB,MAAOA,GAAEyF,QAGX6oB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGyF,GAAM,KAIvC,OAAOA,GAGT3K,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCq1B,EAAkB/yB,EAAKtC,EAAoB,MAAMs1B,WAAW,mBA0B5DrN,EAAOtlB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAOA,GAAIA,EAAIA,GAGjB1D,QAAW,SAAU0D,GACnB,MAAOywB,GAAgBA,EAAgBzwB,EAAGA,GAAIA,IAGhDqY,UAAa,SAAUrY,GACrB,MAAOA,GAAE2wB,MAAM3wB,GAAG2wB,MAAM3wB,IAG1BsuB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGqjB,GAAM,KAIvC,OAAOA,GAGTvoB,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAe9B,EAAKtC,EAAoB,IACxCw1B,EAAelzB,EAAKtC,EAAoB,MACxC2oB,EAAermB,EAAKtC,EAAoB,KACxCqqB,EAAe/nB,EAAKtC,EAAoB,IAiC5C,OAAO2C,GAAM,UACX0wB,WAAYmC,EAEZC,iCAAkC,SAAU7wB,EAAGsK,GAK7C,MAAOyZ,GAAS/jB,EAAGylB,EAAInb,KAGzBwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsmB,IAGnCG,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAOyZ,GAAS/jB,EAAGylB,EAAInb,OAK7BxP,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCw1B,EAAelzB,EAAKtC,EAAoB,KA4B5C,OAAO2C,GAAM,aACX0wB,WAAY,SAAUzuB,EAAGsK,GACvB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsmB,MAKvC91B,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtC2oB,EAAWrmB,EAAKtC,EAAoB,IA4BxC,OAAO2C,GAAM,eACX0wB,WAAY,SAAUzuB,EAAGsK,GACvB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGyZ,MAlC5B3oB,EAAoB,KAAKsF,IAuCpC5F,GAAQkG,KAAO,cACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCgJ,EAAM1G,EAAKtC,EAAoB,IAyBnC,OAAO2C,GAAM,eACX0wB,WAAY,SAAUzuB,EAAGsK,GACvB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGlG,MAKvCtJ,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA8BtCsoB,EAAM3lB,EAAM,OACdK,OAAUkF,KAAKogB,IAEfpnB,QAAW,SAAU0D,GACnB,GAAIwB,GAAI8B,KAAKogB,IAAI1jB,EAAEiB,GACnB,OAAO,IAAI5E,GAAKC,QACZkF,EAAI8B,KAAKC,IAAIvD,EAAEkB,IACfM,EAAI8B,KAAKE,IAAIxD,EAAEkB,MAIrBmX,UAAa,SAAUrY,GACrB,MAAOA,GAAE0jB,OAGX4K,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG0jB,KAIjC,OAAOA,GAGT5oB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtCuoB,EAAM5lB,EAAM,OACdK,OAAU,SAAU4B,GAClB,MAAQA,GAAI,EAAKsD,KAAK6W,MAAMna,GAAKsD,KAAKmC,KAAKzF,IAG7C1D,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,YACR5G,EAAEiB,GAAK,EAAKqC,KAAK6W,MAAMna,EAAEiB,IAAMqC,KAAKmC,KAAKzF,EAAEiB,IAC3CjB,EAAEkB,GAAK,EAAKoC,KAAK6W,MAAMna,EAAEkB,IAAMoC,KAAKmC,KAAKzF,EAAEkB,MAIlDmX,UAAa,SAAUrY,GACrB,MAAOA,GAAEgxB,aAAehxB,EAAEyF,OAASzF,EAAEma,SAGvCmU,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAG2jB,GAAK,KAItC,OAAOA,GAGT7oB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtC+e,EAAQpc,EAAM,SAChBK,OAAUkF,KAAK6W,MAEf7d,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,YACTtD,KAAK6W,MAAMna,EAAEiB,IACbqC,KAAK6W,MAAMna,EAAEkB,MAInBmX,UAAa,SAAUrY,GACrB,MAAOA,GAAEma,SAGXmU,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGma,GAAO,KAIxC,OAAOA,GAGTrf,EAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA4DpC,QAASkzB,GAAc7mB,EAAG4J,GACxB,IAAK5J,EAAE8mB,UAAYld,EAAEkd,QACnB,KAAM,IAAIvzB,OAAM,qDAKlB,KADA,GAAIwzB,GAAO,GAAI90B,GAAKgc,UAAU,IACtBrE,EAAEod,UAAU,CAClB,GAAI5vB,GAAI4I,EAAEwV,IAAI5L,EACd5J,GAAI4J,EACJA,EAAIxS,EAEN,MAAO4I,GAAE6M,GAAGka,GAAQ/mB,EAAEinB,MAAQjnB,EAvEhC,GAAI5K,GAAa9B,EAAKtC,EAAoB,IA2BtCwoB,EAAM7lB,EAAM,OACduzB,iBAAkBC,EAElBC,uBAAwBP,EAExBQ,sDAAuD,SAAUrnB,EAAG4J,GAClE,MAAOxU,GAAWW,SAASiK,EAAG4J,EAAG4P,IAGnC8N,qCAAsC,SAAUtnB,EAAG4J,GACjD,MAAOxU,GAAWW,SAASiK,EAAG4J,EAAG4P,IAInC+N,mHAAoH,SAAUvnB,EAAG4J,EAAGtU,GAElI,IAAK,GADDY,GAAMsjB,EAAIxZ,EAAG4J,GACRpV,EAAI,EAAGA,EAAIc,EAAKP,OAAQP,IAC/B0B,EAAMsjB,EAAItjB,EAAKZ,EAAKd,GAEtB,OAAO0B,KAIX,OAAOsjB,GAgCT,QAAS2N,GAAKnnB,EAAG4J,GACf,IAAK9N,EAAUkE,KAAOlE,EAAU8N,GAC9B,KAAM,IAAIrW,OAAM,qDAKlB,KADA,GAAI6D,GACQ,GAALwS,GACLxS,EAAI4I,EAAI4J,EACR5J,EAAI4J,EACJA,EAAIxS,CAEN,OAAY,GAAJ4I,GAAUA,EAAIA,EAjGxB,GAAIlE,GAAY9K,EAAoB,KAAK8K,SAoGzCpL,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAgEpC,QAAS6zB,GAAcxnB,EAAG4J,GACxB,IAAK5J,EAAE8mB,UAAYld,EAAEkd,QACnB,KAAM,IAAIvzB,OAAM,qDAGlB,IAAIyM,EAAEgnB,UAAYpd,EAAEod,SAClB,MAAO,IAAI/0B,GAAKgc,UAAU,EAM5B,KADA,GAAIuO,GAAOxc,EAAEumB,MAAM3c,IACXA,EAAEod,UAAU,CAClB,GAAIS,GAAI7d,CACRA,GAAI5J,EAAEwV,IAAIiS,GACVznB,EAAIynB,EAEN,MAAOjL,GAAKkL,IAAI1nB,GAAG/F,MAhFrB,GAAI7E,GAAa9B,EAAKtC,EAAoB,IA+BtCyoB,EAAM9lB,EAAM,OACduzB,iBAAkBS,EAElBP,uBAAwBI,EAExBH,sDAAuD,SAAUrnB,EAAG4J,GAClE,MAAOxU,GAAWW,SAASiK,EAAG4J,EAAG6P,IAGnC6N,qCAAsC,SAAUtnB,EAAG4J,GACjD,MAAOxU,GAAWW,SAASiK,EAAG4J,EAAG6P,IAInC8N,mHAAoH,SAAUvnB,EAAG4J,EAAGtU,GAElI,IAAK,GADDY,GAAMujB,EAAIzZ,EAAG4J,GACRpV,EAAI,EAAGA,EAAIc,EAAKP,OAAQP,IAC/B0B,EAAMujB,EAAIvjB,EAAKZ,EAAKd,GAEtB,OAAO0B,KAIX,OAAOujB,GAqCT,QAASkO,GAAM3nB,EAAG4J,GAChB,IAAK9N,EAAUkE,KAAOlE,EAAU8N,GAC9B,KAAM,IAAIrW,OAAM,qDAGlB,IAAS,GAALyM,GAAe,GAAL4J,EACZ,MAAO,EAOT,KAFA,GAAI6d,GACAjL,EAAOxc,EAAI4J,EACH,GAALA,GACL6d,EAAI7d,EACJA,EAAI5J,EAAIynB,EACRznB,EAAIynB,CAEN,OAAOvuB,MAAKe,IAAIuiB,EAAOxc,GAhHzB,GAAIlE,GAAY9K,EAAoB,KAAK8K,SAmHzCpL,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoEpC,QAASi0B,GAAWhyB,GAClB,MAAIA,IAAK,EACAsD,KAAK0F,IAAIhJ,GAITgJ,EAAI,GAAI3M,GAAKC,QAAQ0D,EAAG,IAzEnC,GAAIR,GAAa9B,EAAKtC,EAAoB,IACtCw1B,EAAelzB,EAAKtC,EAAoB,MAoCxC4N,EAAMjL,EAAM,OACdK,OAAU4zB,EAEV11B,QAAW,SAAU0D,GACnB,MAAO,IAAI3D,GAAKC,QACZgH,KAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEiB,GAAKjB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,KAC1CoC,KAAKM,MAAM5D,EAAEkB,GAAIlB,EAAEiB,MAIzBoX,UAAa,SAAUrY,GACrB,MAAOA,GAAEiyB,MAGX3D,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGgJ,IAG/BylB,WAAY,SAAUzuB,EAAGwI,GAEvB,MAAOooB,GAAa5nB,EAAIhJ,GAAIgJ,EAAIR,MAoBpC,OAAOQ,GAGTlO,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAGA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAgEpC,QAASm0B,GAAclyB,GACrB,MAAO,IAAI3D,GAAKC,QACZgH,KAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEiB,GAAKjB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,KAAOoC,KAAK2F,KACtD3F,KAAKM,MAAM5D,EAAEkB,GAAIlB,EAAEiB,IAAMqC,KAAK2F,MAlEpC,GAAIzJ,GAAa9B,EAAKtC,EAAoB,IA2BtC0oB,EAAQ/lB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,MAAIA,IAAK,EACAsD,KAAK0F,IAAIhJ,GAAKsD,KAAK2F,KAInB6a,EAAM,GAAIznB,GAAKC,QAAQ0D,EAAG,KAIrC1D,QAAW41B,EAEX7Z,UAAa,SAAUrY,GACrB,MAAIA,GAAEgxB,aAEGkB,EAAc,GAAI71B,GAAKC,QAAQ0D,EAAEqD,WAAY,IAG7CrD,EAAEgJ,OAIbslB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG8jB,KAIjC,OAAOA,GAgBThpB,EAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAMb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA+DpC,QAASo0B,GAAKnyB,EAAGsK,GACf,GAAIA,EAAI,EAIN,MAAOtK,GAAIsK,EAAIhH,KAAK6W,MAAMna,EAAIsK,EAE3B,IAAU,IAANA,EACP,MAAOtK,EAIP,MAAM,IAAIrC,OAAM,+CA1EpB,GAAI6B,GAAa9B,EAAKtC,EAAoB,IAqCtCwkB,EAAM7hB,EAAM,OACduzB,iBAAkBa,EAElBX,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOA,GAAE8mB,SAAWpxB,EAAIA,EAAE4f,IAAItV,IAGhCwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsV,IAGnCmR,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsV,KAIrC,OAAOA,GA0BT9kB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClCgoB,EAAM1lB,EAAKtC,EAAoB,KAC/Bg3B,EAAiB10B,EAAKtC,EAAoB,MAC1C0tB,EAAQprB,EAAKtC,EAAoB,MACjCmzB,EAAgB7wB,EAAKtC,EAAoB,MAEzCoE,EAAa9B,EAAKtC,EAAoB,IAEtCwwB,EAAcvvB,EAAKuvB,YACnBvD,EAAehsB,EAAKgsB,aACpByE,EAAMzwB,EAAKywB,IAiCX/I,EAAWhmB,EAAM,YAEnB0wB,WAAY2D,EAEZnD,eAAgB,SAAUjvB,EAAGsK,GAE3B+nB,EAA0B1yB,EAAMe,KAAKV,GAAIL,EAAMe,KAAK4J,GAGpD,IAAI5O,GAAIqoB,EAAS5lB,EAAO6B,GAAI7B,EAAOmM,GAEnC,OAAO5O,aAAaW,GAAKuD,OAASlE,EAAEmE,UAAYnE,GAGlDgzB,iBAAkB,SAAU1uB,EAAGsK,GAE7B,GAAIqkB,GAAQ3uB,EAAEU,OACVkuB,EAAQtkB,EAAE5J,MAMd,OAHA2xB,GAA0B1D,EAAOC,GAGZ,IAAjBD,EAAMxvB,OAEa,IAAjByvB,EAAMzvB,OAEDmzB,EAAsBtyB,EAAGsK,EAAGqkB,EAAM,IAGpC4D,EAAsBvyB,EAAGsK,GAGb,IAAjBskB,EAAMzvB,OAEDqzB,EAAsBxyB,EAAGsK,GAG3BmoB,EAAsBzyB,EAAGsK,IAGlC6kB,gBAAiB,SAAUnvB,EAAGsK,GAE5B,MAAOyZ,GAAS/jB,EAAG7B,EAAOmM,KAG5B4kB,gBAAiB,SAAUlvB,EAAGsK,GAE5B,MAAOyZ,GAAS5lB,EAAO6B,EAAGsK,EAAE3D,WAAY2D,IAG1CilB,aAAc,SAAUvvB,EAAGsK,GACzB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGyZ,IAGnCqL,cAAe,SAAUpvB,EAAGsK,GAE1B,MAAOtK,GAAE/C,IAAI,SAAUgsB,GACrB,MAAOlF,GAASkF,EAAG3e,KAClB,IAGLymB,sBAAuB,SAAU/wB,EAAGsK,GAElC,MAAOA,GAAErN,IAAI,SAAUgsB,GACrB,MAAOlF,GAASkF,EAAGjpB,KAClB,MAIHqyB,EAA4B,SAAUK,EAAOC,GAE/C,OAAQD,EAAMvzB,QACZ,IAAK,GAEH,OAAQwzB,EAAMxzB,QACZ,IAAK,GAEH,GAAIuzB,EAAM,KAAOC,EAAM,GAErB,KAAM,IAAI1C,YAAW,0EAEvB,MACF,KAAK,GAEH,GAAIyC,EAAM,KAAOC,EAAM,GAErB,KAAM,IAAI1C,YAAW,wDAA0DyC,EAAM,GAAK,6BAA+BC,EAAM,GAAK,IAEtI,MACF,SACE,KAAM,IAAIh1B,OAAM,+DAAiEg1B,EAAMxzB,OAAS,gBAEpG,KACF,KAAK,GAEH,OAAQwzB,EAAMxzB,QACZ,IAAK,GAEH,GAAIuzB,EAAM,KAAOC,EAAM,GAErB,KAAM,IAAI1C,YAAW,yDAA2DyC,EAAM,GAAK,+BAAiCC,EAAM,GAAK,IAEzI,MACF,KAAK,GAEH,GAAID,EAAM,KAAOC,EAAM,GAErB,KAAM,IAAI1C,YAAW,2DAA6DyC,EAAM,GAAK,+BAAiCC,EAAM,GAAK,IAE3I,MACF,SACE,KAAM,IAAIh1B,OAAM,+DAAiEg1B,EAAMxzB,OAAS,gBAEpG,KACF,SACE,KAAM,IAAIxB,OAAM,+DAAiE+0B,EAAMvzB,OAAS,kBAYlGmzB,EAAwB,SAAUloB,EAAG4J,EAAG9J,GAE1C,GAAU,IAANA,EACF,KAAM,IAAIvM,OAAM,oCAUlB,KAAK,GAPDi1B,GAAQxoB,EAAEyhB,MAEVgH,EAAQ7e,EAAE6X,MAGVlwB,EAAI,EAECiD,EAAI,EAAOsL,EAAJtL,EAAOA,IAErBjD,EAAIynB,EAAIznB,EAAGooB,EAAS6O,EAAMh0B,GAAIi0B,EAAMj0B,IAEtC,OAAOjD,IAWL42B,EAAwB,SAAUnoB,EAAG4J,GAEvC,OAAQA,EAAErN,WACR,IAAK,QACH,MAAOmsB,GAA2B1oB,EAAG4J,GAEzC,KAAM,IAAIrW,OAAM,oBAWdm1B,EAA6B,SAAU1oB,EAAG4J,GAe5C,IAAK,GAbD4e,GAAQxoB,EAAEyhB,MACV4D,EAAQrlB,EAAEuO,MAEVka,EAAQ7e,EAAE6X,MACVmE,EAAQhc,EAAE2E,MAEVoa,EAAUtD,EAAM,GAChBuD,EAAWhD,EAAM,GAGjBr0B,EAAI,GAAIqD,OAAMg0B,GAGT5zB,EAAI,EAAO4zB,EAAJ5zB,EAAcA,IAAK,CAIjC,IAAK,GAFD0nB,GAAM,EAEDloB,EAAI,EAAOm0B,EAAJn0B,EAAaA,IAE3BkoB,EAAM1D,EAAI0D,EAAK/C,EAAS6O,EAAMh0B,GAAIi0B,EAAMj0B,GAAGQ,IAE7CzD,GAAEyD,GAAK0nB,EAIT,MAAiB,KAAbkM,EACKr3B,EAAE,GAGJ,GAAIiwB,IACTtD,KAAM3sB,EACN+E,MAAOsyB,MAYPR,EAAwB,SAAUpoB,EAAG4J,GAEvC,OAAQ5J,EAAEzD,WACR,IAAK,QACH,MAAOssB,GAA2B7oB,EAAG4J,EACvC,KAAK,SACH,MAAOkf,GAA4B9oB,EAAG4J,KAYxCye,EAAwB,SAAUroB,EAAG4J,GAEvC,OAAQ5J,EAAEzD,WACR,IAAK,QAEH,OAAQqN,EAAErN,WACR,IAAK,QACH,MAAOwsB,GAAgC/oB,EAAG4J,EAC5C,KAAK,SACH,MAAOof,GAAiChpB,EAAG4J,GAE/C,KACF,KAAK,SAEH,OAAQA,EAAErN,WACR,IAAK,QACH,MAAO0sB,GAAiCjpB,EAAG4J,EAC7C,KAAK,SACH,MAAOsf,GAAkClpB,EAAG4J,MAclDif,EAA6B,SAAU7oB,EAAG4J,GAc5C,IAAK,GAZD4e,GAAQxoB,EAAEyhB,MACV4D,EAAQrlB,EAAEuO,MAEVka,EAAQ7e,EAAE6X,MAEV0H,EAAQ9D,EAAM,GACd+D,EAAW/D,EAAM,GAGjB9zB,EAAI,GAAIqD,OAAMu0B,GAGT30B,EAAI,EAAO20B,EAAJ30B,EAAWA,IAAK,CAM9B,IAAK,GAJD2H,GAAMqsB,EAAMh0B,GAEZkoB,EAAM,EAED1nB,EAAI,EAAOo0B,EAAJp0B,EAAcA,IAE5B0nB,EAAM1D,EAAI0D,EAAK/C,EAASxd,EAAInH,GAAIyzB,EAAMzzB,IAExCzD,GAAEiD,GAAKkoB,EAGT,MAAc,KAAVyM,EACK53B,EAAE,GAGJ,GAAIiwB,IACTtD,KAAM3sB,EACN+E,MAAO6yB,MAYPJ,EAAkC,SAAU/oB,EAAG4J,GAgBjD,IAAK,GAdD4e,GAAQxoB,EAAEyhB,MACV4D,EAAQrlB,EAAEuO,MAEVka,EAAQ7e,EAAE6X,MACVmE,EAAQhc,EAAE2E,MAEV4a,EAAQ9D,EAAM,GACd+D,EAAW/D,EAAM,GACjBuD,EAAWhD,EAAM,GAGjBr0B,EAAI,GAAIqD,OAAMu0B,GAGT30B,EAAI,EAAO20B,EAAJ30B,EAAWA,IAAK,CAE9B,GAAI2H,GAAMqsB,EAAMh0B,EAEhBjD,GAAEiD,GAAK,GAAII,OAAMg0B,EAEjB,KAAK,GAAI5zB,GAAI,EAAO4zB,EAAJ5zB,EAAcA,IAAK,CAIjC,IAAK,GAFD0nB,GAAM,EAED9mB,EAAI,EAAOwzB,EAAJxzB,EAAcA,IAE5B8mB,EAAM1D,EAAI0D,EAAK/C,EAASxd,EAAIvG,GAAI6yB,EAAM7yB,GAAGZ,IAE3CzD,GAAEiD,GAAGQ,GAAK0nB,GAId,MAAc,KAAVyM,GAA4B,IAAbP,EACVr3B,EAAE,GAAG,GAGP,GAAIiwB,IACTtD,KAAM3sB,EACN+E,MAAO6yB,EAAOP,MAYdI,EAAmC,SAAUhpB,EAAG4J,GAiBlD,IAAK,GAfD4e,GAAQxoB,EAAEyhB,MACV4D,EAAQrlB,EAAEuO,MAEVuX,EAAUlc,EAAEyU,QACZ6H,EAAStc,EAAE0U,OACX6H,EAAOvc,EAAE2U,KACTqH,EAAQhc,EAAE2E,MAEV4a,EAAQ9D,EAAM,GACduD,EAAWhD,EAAM,GAGjBr0B,EAAI,GAAIqD,OAAMu0B,GAGT30B,EAAI,EAAO20B,EAAJ30B,EAAWA,IAAK,CAE9BjD,EAAEiD,GAAK,GAAII,OAAMg0B,EAIjB,KAAK,GAFDzsB,GAAMqsB,EAAMh0B,GAEPQ,EAAI,EAAO4zB,EAAJ5zB,EAAcA,IAAK,CAIjC,IAAK,GAFD0nB,GAAM,EAEDwD,EAAKiG,EAAKnxB,GAAImrB,EAAKgG,EAAKnxB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAIxJ,GAAIswB,EAAO9mB,EAEfsd,GAAM1D,EAAI0D,EAAK/C,EAASxd,EAAIvG,GAAIkwB,EAAQ1mB,KAE1C7N,EAAEiD,GAAGQ,GAAK0nB,GAKd,MAAc,KAAVyM,GAA4B,IAAbP,EACVr3B,EAAE,GAAG,GAGP,GAAIiwB,IACTtD,KAAM3sB,EACN+E,MAAO6yB,EAAOP,MAYdE,EAA8B,SAAU9oB,EAAG4J,GAE7C,GAAI0b,GAAUtlB,EAAEqe,QACZkH,EAASvlB,EAAEse,OACXkH,EAAOxlB,EAAEue,KAETkK,EAAQ7e,EAAE6X,MAEV0H,EAAQnpB,EAAEuO,MAAM,GAChB8a,EAAQzf,EAAE2E,MAAM,GAEhBkX,KACAC,KACAC,KAGA2D,EAAM,GAAI5G,GAAIyG,EAGlBxD,GAAK/xB,KAAK,EAEV,KAAK,GAAI21B,GAAK,EAAQF,EAALE,EAAYA,IAAM,CAEjC,GAAIC,GAAMf,EAAMc,EAEhB,KAAK7K,EAAM8K,EAAK,GAEd,IAAK,GAAIC,GAAMjE,EAAK+D,GAAKG,EAAMlE,EAAK+D,EAAK,GAAII,EAAKF,EAAUC,EAALC,EAAUA,IAAM,CAErE,GAAIC,GAAKrE,EAAOoE,EAEhBL,GAAI1G,WAAWgH,EAAIjQ,EAAS6P,EAAKlE,EAAQqE,MAa/C,MARAL,GAAI32B,QAAQ,EAAGw2B,EAAQ,EAAG,SAAUvzB,EAAGipB,GACrC6G,EAAO9xB,KAAKgC,GACZ6vB,EAAQ7xB,KAAKirB,KAGf8G,EAAK/xB,KAAK6xB,EAAQ1wB,QAGJ,IAAVo0B,EACwB,IAAnB1D,EAAQ1wB,OAAe0wB,EAAQ,GAAK,EAGtC,GAAIxH,IACThiB,OAASwpB,EACT7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAO6yB,EAAO,MAYdF,EAAmC,SAAUjpB,EAAG4J,GAuBlD,IAAK,GArBD0b,GAAUtlB,EAAEqe,QACZkH,EAASvlB,EAAEse,OACXkH,EAAOxlB,EAAEue,KAETkK,EAAQ7e,EAAE6X,MAEV0H,EAAQnpB,EAAEuO,MAAM,GAChB8a,EAAQzf,EAAE2E,MAAM,GAChBqa,EAAWhf,EAAE2E,MAAM,GAEnBkX,KACAC,KACAC,KAGAkE,EAAgB,SAAU70B,EAAG6pB,GAC/B6G,EAAO9xB,KAAKoB,GACZywB,EAAQ7xB,KAAKirB,IAINiL,EAAK,EAAQlB,EAALkB,EAAeA,IAAM,CAEpCnE,EAAK/xB,KAAK6xB,EAAQ1wB,OAIlB,KAAK,GAFDu0B,GAAM,GAAI5G,GAAIyG,GAETI,EAAK,EAAQF,EAALE,EAAYA,IAAM,CAEjC,GAAIQ,GAAOtB,EAAMc,GAAIO,EAErB,KAAKpL,EAAMqL,EAAM,GAEf,IAAK,GAAIN,GAAMjE,EAAK+D,GAAKG,EAAMlE,EAAK+D,EAAK,GAAII,EAAKF,EAAUC,EAALC,EAAUA,IAAM,CAErE,GAAIC,GAAKrE,EAAOoE,EAEhBL,GAAI1G,WAAWgH,EAAIjQ,EAASoQ,EAAMzE,EAAQqE,MAKhDL,EAAI32B,QAAQ,EAAGw2B,EAAQ,EAAGU,GAM5B,MAHAlE,GAAK/xB,KAAK6xB,EAAQ1wB,QAGJ,IAAVo0B,GAA4B,IAAbP,EACS,IAAnBnD,EAAQ1wB,OAAe0wB,EAAQ,GAAK,EAGtC,GAAIxH,IACThiB,OAASwpB,EACT7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAO6yB,EAAOP,MAYdM,EAAoC,SAAUlpB,EAAG4J,GA6BnD,IAAK,GA3BD0b,GAAUtlB,EAAEqe,QAEZyH,EAAUlc,EAAEyU,QACZ6H,EAAStc,EAAE0U,OACX6H,EAAOvc,EAAE2U,KAET4K,EAAQnpB,EAAEuO,MAAM,GAChBqa,EAAWhf,EAAE2E,MAAM,GAEnBtS,EAASqpB,GAAWQ,EAEpBL,EAAUxpB,KAAcX,OACxBoqB,KACAC,KAEAp0B,EAAI,GAAI0sB,IACVhiB,OAASwpB,EACT7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAO6yB,EAAOP,KAGZhzB,EAAIqG,EAAS,GAAIrH,OAAMu0B,GAAS7tB,OAEhCyqB,EAAI,GAAInxB,OAAMu0B,GAGTW,EAAK,EAAQlB,EAALkB,EAAeA,IAAM,CAEpCnE,EAAK/xB,KAAK8xB,EAAO3wB,OAEjB,KAAK,GAAIi1B,GAAM7D,EAAK2D,GAAKG,EAAM9D,EAAK2D,EAAK,GAAII,EAAKF,EAAUC,EAALC,EAAUA,IAAM,CAErE,GAAIX,GAAKrD,EAAOgE,EAEhB/F,GAAcnkB,EAAGupB,EAAIzD,EAAUA,EAAQoE,GAAM,EAAGnE,EAAGnwB,EAAGk0B,EAAK,EAAGv4B,GAGhE,GAAI0K,EAEF,IAAK,GAAI+pB,GAAKL,EAAKmE,GAAK7D,EAAKP,EAAO3wB,OAAQvD,EAAIw0B,EAAQC,EAAJz0B,EAAQA,IAC1Di0B,EAAQj0B,GAAKoE,EAAE8vB,EAAOl0B,IAO5B,MAHAm0B,GAAK/xB,KAAK8xB,EAAO3wB,QAGH,IAAVo0B,GAA4B,IAAbP,GAAkB3sB,EACT,IAAnBwpB,EAAQ1wB,OAAe0wB,EAAQ,GAAK,EAGtCl0B,EAGT,OAAOooB,GArpBT,GAAIjkB,GAAO1E,EAAoB,KAE3BuE,EAAQG,EAAKH,KAspBjB7E,GAAQkG,KAAO,WACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAkGpC,QAASw2B,GAAOv0B,EAAGpE,GAEjB,GAAI44B,GAAQx0B,EAAEU,MAGd,IAAoB,GAAhB8zB,EAAMr1B,OAAa,CAErB,GAAIvD,IAAMkH,OAAO2xB,mBAA2B,QAAN74B,EAAa,CAEjD,GAAI84B,GAAO,CASX,OAPA10B,GAAEjD,QACA,SAAUgE,GACR,GAAIkoB,GAAI5kB,EAAItD,EACR8X,GAAOoQ,EAAGyL,KACZA,EAAOzL,KAEX,GACKyL,EAET,GAAI94B,IAAMkH,OAAO6xB,mBAA2B,SAAN/4B,EAAc,CAElD,GAAIg5B,EASJ,OAPA50B,GAAEjD,QACA,SAAUgE,GACR,GAAIkoB,GAAI5kB,EAAItD,KACP6zB,GAAQhc,EAAQqQ,EAAG2L,MACtBA,EAAO3L,KAEX,GACK2L,GAAQ,EAEjB,GAAU,QAANh5B,EACF,MAAO24B,GAAMv0B,EAAG,EAElB,IAAiB,gBAANpE,KAAmBwJ,MAAMxJ,GAAI,CAEtC,IAAKktB,EAAMltB,EAAG,GAAI,CAEhB,GAAIsO,GAAI,CAOR,OALAlK,GAAEjD,QACA,SAAUgE,GACRmJ,EAAIkZ,EAAIhf,EAAIC,EAAItD,GAAQnF,GAAIsO,KAE9B,GACK9F,EAAI8F,EAAG,EAAItO,GAEpB,MAAOkH,QAAO2xB,kBAGhB,KAAM,IAAI92B,OAAM,+BAGlB,GAAoB,GAAhB62B,EAAMr1B,OAAa,CAErB,GAAU,IAANvD,EAAS,CAEX,GAAID,MAEAk5B,EAAO,CAWX,OATA70B,GAAEjD,QACA,SAAUgE,EAAO/D,GACf,GAAIoC,GAAIpC,EAAM,GACV83B,EAAK1R,EAAIznB,EAAEyD,IAAM,EAAGiF,EAAItD,GACxB8X,GAAOic,EAAID,KACbA,EAAOC,GACTn5B,EAAEyD,GAAK01B,IAET,GACKD,EAET,GAAIj5B,IAAMkH,OAAO2xB,mBAA2B,QAAN74B,EAAa,CAEjD,GAAI4F,MAEAuzB,EAAO,CAWX,OATA/0B,GAAEjD,QACA,SAAUgE,EAAO/D,GACf,GAAI4B,GAAI5B,EAAM,GACVg4B,EAAK5R,EAAI5hB,EAAE5C,IAAM,EAAGyF,EAAItD,GACxB8X,GAAOmc,EAAID,KACbA,EAAOC,GACTxzB,EAAE5C,GAAKo2B,IAET,GACKD,EAET,GAAU,QAANn5B,EAEF,MAAO+H,GAAKiiB,EAAM7B,EAAS8B,EAAU7lB,GAAIA,IAE3C,IAAU,IAANpE,EAEF,KAAM,IAAI+B,OAAM,6FAGlB,MAAM,IAAIA,OAAM,gCApMpB,GAAI0G,GAAY3G,EAAKtC,EAAoB,KACrCgoB,EAAY1lB,EAAKtC,EAAoB,KACrCgJ,EAAY1G,EAAKtC,EAAoB,KACrCuI,EAAYjG,EAAKtC,EAAoB,KACrC2oB,EAAYrmB,EAAKtC,EAAoB,KACrC0tB,EAAYprB,EAAKtC,EAAoB,MACrCyd,EAAYnb,EAAKtC,EAAoB,MACrCwd,EAAYlb,EAAKtC,EAAoB,MACrC+C,EAAYT,EAAKtC,EAAoB,KACrCwqB,EAAYloB,EAAKtC,EAAoB,MACrCyqB,EAAYnoB,EAAKtC,EAAoB,MAErC65B,EAAa5wB,EAAIqsB,WAAoB,QAwCrC1M,EAAOjmB,EAAM,QACfK,OAAUkF,KAAKe,IAEf/H,QAAW24B,EAEX5c,UAAa,SAAUrY,GAErB,MAAOA,GAAEqE,OAGX6wB,iBAAmB,SAAUl1B,GAE3B,MAAOsD,MAAKe,IAAIrE,IAGlBhB,MAAS,SAAUgB,GACjB,MAAOu0B,GAAMp2B,EAAO6B,GAAI,IAG1BJ,OAAU,SAAUI,GAClB,MAAOu0B,GAAMv0B,EAAG,IAGlBm1B,6EAA8E,SAAUn1B,GAEtF,MAAOgkB,GAAKhkB,IAGdo1B,qCAAsC,SAAUp1B,EAAGpE,GACjD,MAAO24B,GAAMp2B,EAAO6B,GAAIpE,IAG1By5B,sCAAuC,SAAUr1B,EAAGpE,GAClD,MAAO24B,GAAMv0B,EAAGpE,KAmHpB,OAAOooB,GAGTlpB,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAiEpC,QAASu3B,GAAYlrB,EAAGxP,GACtB,GAAIu2B,GAAO,GAAI90B,GAAKgc,UAAU,GAC1Bkd,EAAM,GAAIl5B,GAAKgc,UAAU,GACzBoN,EAAM7qB,EAAKo2B,YAGf,IAFIvL,IAAK7qB,EAAOA,EAAK46B,WAEjB56B,EAAKw2B,SAAU,KAAM,IAAIzzB,OAAM,wBACnC,IAAIyM,EAAE4mB,eAAiBp2B,EAAKyJ,MAAMub,IAAI,GAAG9b,OAAO,GAAI,KAAM,IAAInG,OAAM,uCAGpE,IAAIyM,EAAEgnB,SAAU,MAAOD,EACvB,KAAK/mB,EAAEqrB,WAEL,MAAOhQ,GAAM0L,EAAO/mB,CAGtB,IAAIpK,GAAIu1B,EACJ32B,EAAI,EACJ82B,EAAO,GACX,GAAG,CACD,GAAIC,GAAQ31B,EACR41B,EAAQxrB,EAAE0nB,IAAI9xB,EAAEoE,IAAIxJ,EAAK4yB,MAAM,KAAKA,MAAMxtB,GAAG8xB,IAAIl3B,EACrDoF,GAAIA,EAAE61B,KAAKD,GACXh3B,WAEMoB,EAAE8D,OAAO6xB,IAAcD,EAAJ92B,EAE3B,OAAO6mB,GAAM8P,EAAIzD,IAAI9xB,GAAKA,EA3F5B,GAAIR,GAAa9B,EAAKtC,EAAoB,IA+BtC6oB,EAAUlmB,EAAM,WAClBK,OAAU,SAAU4B,GAClB,MAAO81B,GAAS91B,EAAG,IAErBsxB,iBAAkBwE,EAElBzd,UAAa,SAAUrY,GACrB,MAAOs1B,GAAYt1B,EAAG,GAAI3D,GAAKgc,UAAU,KAE3CmZ,uBAAwB8D,EAExBhH,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGikB,IAG/B6M,sBAAuB,SAAU9wB,EAAGpF,GAClC,MAAO4E,GAAWW,SAASH,EAAGpF,EAAMqpB,IAGtC8M,sBAAuB,SAAU/wB,EAAGpF,GAClC,MAAO4E,GAAWW,SAASH,EAAGpF,EAAMqpB,KAIxC,OAAOA,GA+CT,QAAS6R,GAAS1rB,EAAGxP,GACnB,GAAI6qB,GAAa,EAAP7qB,CAGV,IAFI6qB,IAAK7qB,GAAQA,GAEJ,IAATA,EAAY,KAAM,IAAI+C,OAAM,wBAChC,IAAQ,EAAJyM,GAAU9G,KAAKe,IAAIzJ,GAAQ,GAAK,EAAI,KAAM,IAAI+C,OAAM,uCAGxD,IAAS,GAALyM,EAAQ,MAAO,EACnB,KAAKtH,OAAO2yB,SAASrrB,GACnB,MAAOqb,GAAM,EAAIrb,CAGnB,IAAI9L,GAAU,MACV0B,EAAI,EACJpB,EAAI,EACJ82B,EAAO,GACX,GAAG,CACD,GAAIE,IAASxrB,EAAI9G,KAAKc,IAAIpE,EAAGpF,EAAO,GAAKoF,GAAKpF,CAC9CoF,IAAQ41B,EACRh3B,UAEK0E,KAAKe,IAAIuxB,GAASt3B,GAAeo3B,EAAJ92B,EAEpC,OAAO6mB,GAAM,EAAIzlB,EAAIA,EAGvBlF,EAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA4EpC,QAASg4B,GAAa/1B,EAAGsK,GAQvB,MAAOoZ,GAAIK,EAAS/a,EAAIhJ,GAAIsK,IAU9B,QAAS0rB,GAAUh2B,EAAGsK,GACpB,IAAKpE,EAAUoE,IAAU,EAAJA,EACnB,KAAM,IAAI3I,WAAU,mDAAqD2I,EAAI,IAG/E,IAAI+H,GAAI3R,EAAKV,EACb,IAAgB,GAAZqS,EAAElT,OACJ,KAAM,IAAIxB,OAAM,2CAA6C0U,EAAElT,OAAS,eAE1E,IAAIkT,EAAE,IAAMA,EAAE,GACZ,KAAM,IAAI1U,OAAM,sCAAwC0U,EAAE,GAAK,IAAMA,EAAE,GAAK,IAK9E,KAFA,GAAI/R,GAAMilB,EAAIlT,EAAE,IAAIxS,UAChBo2B,EAAKj2B,EACFsK,GAAK,GACK,IAAN,EAAJA,KACHhK,EAAMyjB,EAASkS,EAAI31B,IAErBgK,IAAM,EACN2rB,EAAKlS,EAASkS,EAAIA,EAEpB,OAAO31B,GAUT,QAAS41B,GAAYl2B,EAAGsK,GACtB,MAAOnM,GAAO63B,EAAUh2B,EAAEH,UAAWyK,IA9HvC,GACIoZ,IADahmB,EAAKtC,EAAoB,IAChCsC,EAAKtC,EAAoB,MAC/BmqB,EAAM7nB,EAAKtC,EAAoB,KAC/B4N,EAAMtL,EAAKtC,EAAoB,KAC/B2oB,EAAWrmB,EAAKtC,EAAoB,KACpC+C,EAAST,EAAKtC,EAAoB,KA6BlCgJ,EAAMrG,EAAM,OACduzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAIpE,GAAUoE,IAAMtK,GAAK,EAChBsD,KAAKc,IAAIpE,EAAGsK,GAGZyrB,EAAY,GAAI15B,GAAKC,QAAQ0D,EAAG,GAAI,GAAI3D,GAAKC,QAAQgO,EAAG,KAInEknB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAIpE,GAAUoE,IAAMtK,GAAK,EAChBA,EAAEoE,IAAIkG,GAGNyrB,EAAY,GAAI15B,GAAKC,QAAQ0D,EAAEqD,WAAY,GAAI,GAAIhH,GAAKC,QAAQgO,EAAEjH,WAAY,KAIzF8yB,mBAAoBJ,EAEpBK,gBAAiBJ,EAEjBK,mBAAoB,SAAUr2B,EAAGsK,GAC/B,MAAO0rB,GAAUh2B,EAAGsK,EAAEjH,aAGxBizB,iBAAkBJ,EAElBK,oBAAqB,SAAUv2B,EAAGsK,GAChC,MAAO4rB,GAAWl2B,EAAGsK,EAAEjH,cAiE3B,OAAOe,GArIT,GAAI8B,GAAY9K,EAAoB,KAAK8K,UACrCxF,EAAOtF,EAAoB,KAAKsF,IAuIpC5F,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAiCtC8oB,EAAQnmB,EAAM,SAChBK,OAAUkF,KAAK4gB,MAEfoN,iBAAkB,SAAUtxB,EAAGkK,GAC7B,IAAKhE,EAAUgE,GAAO,KAAM,IAAIvI,WAAU,0DAC1C,IAAQ,EAAJuI,GAASA,EAAI,GAAK,KAAM,IAAIvM,OAAM,mEAEtC,OAAO64B,GAAOx2B,EAAGkK,IAGnB5N,QAAW,SAAU0D,GACnB,MAAO,IAAI3D,GAAKC,QACZgH,KAAK4gB,MAAMlkB,EAAEiB,IACbqC,KAAK4gB,MAAMlkB,EAAEkB,MAInBu1B,kBAAmB,SAAUz2B,EAAGkK,GAC9B,MAAO,IAAI7N,GAAKC,QACZk6B,EAAOx2B,EAAEiB,GAAIiJ,GACbssB,EAAOx2B,EAAEkB,GAAIgJ,KAInBwsB,qBAAsB,SAAU12B,EAAGkK,GACjC,GAAIysB,GAAKzsB,EAAE7G,UACX,OAAO,IAAIhH,GAAKC,QACZk6B,EAAOx2B,EAAEiB,GAAI01B,GACbH,EAAOx2B,EAAEkB,GAAIy1B,KAInBte,UAAa,SAAUrY,GACrB,MAAOA,GAAE42B,gBAAgB,IAG3BpF,uBAAwB,SAAUxxB,EAAGkK,GACnC,IAAKA,EAAEhE,YAAc,KAAM,IAAIvE,WAAU,0DAEzC,OAAO3B,GAAE42B,gBAAgB1sB,EAAE7G,aAG7BirB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGkkB,GAAO,IAGtC2S,qCAAsC,SAAU72B,EAAGkK,GACjD,MAAO1K,GAAWW,SAASH,EAAGkK,EAAGga,IAGnC4S,+CAAgD,SAAU92B,EAAGkK,GAC3D,MAAO1K,GAAWW,SAASH,EAAGkK,EAAGga,KAIrC,OAAOA,GAWT,QAASsS,GAAQz1B,EAAOg2B,GACtB,MAAOjyB,YAAWkyB,EAAQj2B,EAAOg2B,IAzGnC,GAAI7wB,GAAY9K,EAAoB,KAAK8K,UACrC8wB,EAAU57B,EAAoB,KAAK47B,OA2GvCl8B,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAgCtCoK,EAAOzH,EAAM,QACfK,OAAUA,EAAOoH,KAEjBlJ,QAAW,SAAU0D,GACnB,GAAIqE,GAAMf,KAAKK,KAAK3D,EAAEiB,GAAKjB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,GAC3C,OAAO,IAAIlB,GAAE4G,YAAY5G,EAAEiB,GAAKoD,EAAKrE,EAAEkB,GAAKmD,IAG9CgU,UAAa,SAAUrY,GACrB,MAAO,IAAIA,GAAE4G,YAAY5G,EAAEi3B,IAAI,KAGjC3I,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGwF,GAAM,KAIvC,OAAOA,GArDT,GAAIpH,GAAShD,EAAoB,IAwDjCN,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAMb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAsDpC,QAASm5B,GAAYl3B,GACnB,MAAIA,IAAK,EACAsD,KAAKK,KAAK3D,GAGVm3B,EAAa,GAAI96B,GAAKC,QAAQ0D,EAAG,IAU5C,QAASm3B,GAAan3B,GACpB,GAEIiB,GAAIC,EAFJM,EAAI8B,KAAKK,KAAK3D,EAAEiB,GAAKjB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,GAkBzC,OAbED,GADEjB,EAAEiB,IAAM,EACL,GAAMqC,KAAKK,KAAK,GAAOnC,EAAIxB,EAAEiB,KAG7BqC,KAAKe,IAAIrE,EAAEkB,IAAMoC,KAAKK,KAAK,GAAKnC,EAAIxB,EAAEiB,KAI3CC,EADElB,EAAEiB,IAAM,EACL,GAAMqC,KAAKK,KAAK,GAAOnC,EAAIxB,EAAEiB,KAG7BqC,KAAKe,IAAIrE,EAAEkB,IAAMoC,KAAKK,KAAK,GAAKnC,EAAIxB,EAAEiB,KAGzCjB,EAAEkB,IAAM,EACH,GAAI7E,GAAKC,QAAQ2E,EAAIC,GAGrB,GAAI7E,GAAKC,QAAQ2E,GAAKC,GA3FjC,GAAI1B,GAAa9B,EAAKtC,EAAoB,IA0BtCuI,EAAO5F,EAAM,QACfK,OAAU84B,EAEV56B,QAAW66B,EAEX9e,UAAa,SAAUrY,GACrB,MAAIA,GAAEgxB,aAEGkG,EAAYl3B,EAAEqD,YAGdrD,EAAE2D,QAIb2qB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAG2D,GAAM,KAoDvC,OAAOA,GAGT7I,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA4BtC+oB,EAASpmB,EAAM,UACjBK,OAAU,SAAU4B,GAClB,MAAOA,GAAIA,GAGb1D,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,YACT5G,EAAEiB,GAAKjB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,GACvBlB,EAAEiB,GAAKjB,EAAEkB,GAAKlB,EAAEkB,GAAKlB,EAAEiB,KAI7BoX,UAAa,SAAUrY,GACrB,MAAOA,GAAE2wB,MAAM3wB,IAGjBsuB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGmkB,GAAQ,KAIzC,OAAOA,GAGTrpB,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAIsmB,GAAa3mB,EAAKtC,EAAoB,KACtC+C,EAAST,EAAKtC,EAAoB,KAClC0tB,EAAQprB,EAAKtC,EAAoB,MACjCmzB,EAAgB7wB,EAAKtC,EAAoB,MAEzCoE,EAAa9B,EAAKtC,EAAoB,IAEtCwwB,EAAcvvB,EAAKuvB,YACnBvD,EAAehsB,EAAKgsB,aAmCpBjE,EAAWrmB,EAAM,YAEnBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,GAAIsK,GAGb6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,MAAO,IAAIjO,GAAKC,QACZ0D,EAAEiB,GAAKqJ,EAAErJ,GACTjB,EAAEkB,GAAKoJ,EAAEpJ,KAIfswB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAEwtB,MAAMljB,IAGjB8sB,aAAc,SAAUp3B,EAAGsK,GACzB,GAAe,MAAXtK,EAAEe,MACJ,KAAM,IAAIpD,OAAM,mDAGlB,IAAe,MAAX2M,EAAEvJ,MACJ,KAAM,IAAIpD,OAAM,mDAGlB,KAAKqC,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,qBAGlB,IAAI2C,GAAMN,EAAE6D,OAIZ,OAHAvD,GAAIS,OAASuJ,EAAEvJ,MACfT,EAAIoH,WAAY,EAETpH,GAGTouB,iBAAkB,SAAU1uB,EAAGsK,GAE7B,GAAIqkB,GAAQ3uB,EAAEU,OACVkuB,EAAQtkB,EAAE5J,MAGd,IAAIiuB,EAAMxvB,SAAWyvB,EAAMzvB,OACzB,KAAM,IAAIqB,GAAemuB,EAAMxvB,OAAQyvB,EAAMzvB,OAG/C,IAAIxD,EAGJ,QAAQqE,EAAE2G,WACR,IAAK,SACH,OAAQ2D,EAAE3D,WACR,IAAK,SAEHhL,EAAI07B,EAAkCr3B,EAAGsK,EAAGqkB,EAAOC,EACnD,MACF,SACEjzB,EAAI27B,EAA4Bt3B,EAAGsK,EAAEzK,UAAW8uB,EAAOC,GAG3D,KACF,SACE,OAAQtkB,EAAE3D,WACR,IAAK,SAEHhL,EAAI47B,EAA4Bv3B,EAAEH,UAAWyK,EAAGqkB,EAAOC,EACvD,MACF,SACEjzB,EAAI67B,EAAsBx3B,EAAEH,UAAWyK,EAAEzK,UAAWG,EAAE2G,YAK9D,MAAOhL,IAGTszB,eAAgB,SAAUjvB,EAAGsK,GAE3B,MAAO8Z,GAASjmB,EAAO6B,GAAI7B,EAAOmM,IAAIzK,WAGxCqvB,gBAAiB,SAAUlvB,EAAGsK,GAE5B,MAAO8Z,GAASjmB,EAAO6B,GAAIsK,IAG7B6kB,gBAAiB,SAAUnvB,EAAGsK,GAE5B,MAAO8Z,GAASpkB,EAAG7B,EAAOmM,KAG5B8kB,cAAe,SAAUpvB,EAAGsK,GAE1B,GAAI3O,EAEJ,QAAQqE,EAAE2G,WACR,IAAK,SACHhL,EAAI87B,EAA4Bz3B,EAAGsK,EAAGtK,EAAEU,OACxC,MACF,SACE/E,EAAI6D,EAAWW,SAASH,EAAGsK,EAAG8Z,GAGlC,MAAOzoB,IAGT2zB,cAAe,SAAUtvB,EAAGsK,GAE1B,GAAI3O,EAEJ,QAAQ2O,EAAE3D,WACR,IAAK,SACHhL,EAAI+7B,EAA4B13B,EAAGsK,EAAGA,EAAE5J,OACxC,MACF,SACE/E,EAAI6D,EAAWW,SAASH,EAAGsK,EAAG8Z,GAGlC,MAAOzoB,IAGT4zB,aAAc,SAAUvvB,EAAGsK,GACzB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8Z,IAGnCoL,aAAc,SAAUxvB,EAAGsK,GACzB,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8Z,MAYjCqT,EAA8B,SAAUrtB,EAAG4J,EAAGyb,GAEhD,GAAI/zB,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVC,EAAUtlB,EAAEqe,QACZkH,EAASvlB,EAAEse,OACXkH,EAAOxlB,EAAEue,IAEb,KAAKG,EAAM9U,EAAG,GAAI,CAahB,IAAK,GAXD6b,MACAC,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGH9K,EAAI,EAAO8K,EAAJ9K,EAAOA,IAAK,CAE1B2wB,EAAK3wB,GAAK0wB,EAAO3wB,MAEjB,KAAK,GAAImrB,GAAKsF,EAAKxwB,GAAImrB,EAAKqF,EAAKxwB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAIyf,GAAI7E,EAASsL,EAAQlmB,GAAIwK,EAExB8U,GAAMG,EAAG,KAEZ6G,EAAO9xB,KAAK2xB,EAAOnmB,IACnBqmB,EAAQ7xB,KAAKirB,KAOnB,MAFA8G,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,EAGT,MAAOyO,GAAEvG,SAWP6zB,EAA8B,SAAUttB,EAAG4J,EAAGyb,GAEhD,GAAI/zB,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVS,EAAUlc,EAAEyU,QACZ6H,EAAStc,EAAE0U,OACX6H,EAAOvc,EAAE2U,IAEb,KAAKG,EAAM1e,EAAG,GAAI,CAahB,IAAK,GAXDylB,MACAC,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGH9K,EAAI,EAAO8K,EAAJ9K,EAAOA,IAAK,CAE1B2wB,EAAK3wB,GAAK0wB,EAAO3wB,MAEjB,KAAK,GAAImrB,GAAKiG,EAAKnxB,GAAImrB,EAAKgG,EAAKnxB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAIyf,GAAI7E,EAASha,EAAG8lB,EAAQ1mB,GAEvBsf,GAAMG,EAAG,KAEZ6G,EAAO9xB,KAAKsyB,EAAO9mB,IACnBqmB,EAAQ7xB,KAAKirB,KAOnB,MAFA8G,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,EAGT,MAAOqY,GAAEnQ,SAWPwzB,EAAoC,SAAUjtB,EAAG4J,EAAGyb,EAAOO,GAE7D,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IA0B7G,KAAK,GAxBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVC,EAAUtlB,EAAEqe,QAEZyH,EAAUlc,EAAEyU,QAEZpiB,EAASqpB,GAAWQ,EAEpBL,EAAUxpB,KAAcX,OACxBoqB,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGRlK,EAAIqG,EAAS,GAAIrH,OAAMtD,GAAKgK,OAE5ByqB,EAAI,GAAInxB,OAAMtD,GAET0D,EAAI,EAAO8K,EAAJ9K,EAAOA,IAQrB,GANA2wB,EAAK3wB,GAAK0wB,EAAO3wB,OAEjBovB,EAAcnkB,EAAGhL,EAAG,EAAG+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,GAEpC4yB,EAAcva,EAAG5U,EAAG,GAAI+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,GAEjC0K,EAEF,IAAK,GAAI+pB,GAAKL,EAAK3wB,GAAIixB,EAAKP,EAAO3wB,OAAQvD,EAAIw0B,EAAQC,EAAJz0B,EAAQA,IAEzDi0B,EAAQ7xB,KAAKgC,EAAE8vB,EAAOl0B,IAO5B,OAFAm0B,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,GAWL27B,EAA8B,SAAUltB,EAAG4J,EAAGyb,EAAOO,GAEvD,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IAsB7G,KAAK,GApBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVnH,EAAOtU,EAEP6b,KACAC,KACAC,EAAO,GAAI/wB,OAAMkL,GAEjBvO,EAAI,GAAI0sB,IACVhiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOhF,EAAGwO,KAGRlK,EAAI,GAAIhB,OAAMtD,GAEdy0B,EAAI,GAAInxB,OAAMtD,GAET0D,EAAI,EAAO8K,EAAJ9K,EAAOA,IAAK,CAE1B2wB,EAAK3wB,GAAK0wB,EAAO3wB,MAEjB,KAAK,GAAIP,GAAI,EAAOlD,EAAJkD,EAAOA,IAAK,CAE1B,GAAIqqB,GAAI5E,EAAWiE,EAAK1pB,GAAGQ,GAEtB0pB,GAAMG,EAAG,KACZjpB,EAAEpB,GAAKqqB,EACPkH,EAAEvxB,GAAKQ,EAAI,EACX0wB,EAAO9xB,KAAKY,IAIhB2vB,EAAcnkB,EAAGhL,EAAG,EAAG+wB,EAAGnwB,EAAGZ,EAAI,EAAGzD,EAEpC,KAAK,GAAIy0B,GAAKL,EAAK3wB,GAAIixB,EAAKP,EAAO3wB,OAAQvD,EAAIw0B,EAAQC,EAAJz0B,EAAQA,IAEzDi0B,EAAQ7xB,KAAKgC,EAAE8vB,EAAOl0B,KAM1B,MAFAm0B,GAAK7lB,GAAK4lB,EAAO3wB,OAEVxD,GAWL47B,EAA8B,SAAUntB,EAAG4J,EAAGyb,EAAOO,GAEvD,GAAIP,EAAM,KAAOO,EAAM,IAAMP,EAAM,KAAOO,EAAM,GAC9C,KAAM,IAAIC,YAAW,wCAA0CR,EAAQ,0BAA4BO,EAAQ,IAkB7G,KAAK,GAhBDt0B,GAAI+zB,EAAM,GACVvlB,EAAIulB,EAAM,GAEVnH,EAAOle,EAEP8lB,EAAUlc,EAAEyU,QACZ6H,EAAStc,EAAE0U,OACX6H,EAAOvc,EAAE2U,KAET6H,EAAQ3sB,EAAMykB,GAEd3sB,EAAI,GAAIiwB,IACVtD,KAAMkI,EACN9vB,MAAOhF,EAAGwO,KAGH9K,EAAI,EAAO8K,EAAJ9K,EAAOA,IAErB,IAAK,GAAIkrB,GAAKiG,EAAKnxB,GAAImrB,EAAKgG,EAAKnxB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAI5K,GAAI0xB,EAAO9mB,EAEfgnB,GAAM5xB,GAAGQ,GAAKglB,EAASoM,EAAM5xB,GAAGQ,GAAI8wB,EAAQ1mB,IAIhD,MAAO7N,IAWL67B,EAAwB,SAAUptB,EAAG4J,EAAGhQ,GAE1C,MAAO7F,GAAOqB,EAAWW,SAASiK,EAAG4J,EAAGoQ,GAAWpgB,GAGrD,OAAOogB,GA9cT,GAAIvgB,GAAQzI,EAAoB,KAAKyI,MACjCrD,EAAiBpF,EAAoB,IAgdzCN,GAAQkG,KAAO,WACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtCipB,EAAatmB,EAAM,cACrBK,OAAU,SAAU4B,GAClB,OAAQA,GAGV1D,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,aAAa5G,EAAEiB,IAAKjB,EAAEkB,KAGrCmX,UAAa,SAAUrY,GACrB,MAAOA,GAAEqxB,OAGX50B,KAAQ,SAAUuD,GAChB,GAAIM,GAAMN,EAAE6D,OAEZ,OADAvD,GAAIS,OAASf,EAAEe,MACRT,GAGTguB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGqkB,GAAY,KAM7C,OAAOA,GAGTvpB,EAAQkG,KAAO,aACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtCkpB,EAAYvmB,EAAM,aACpBK,OAAU,SAAU4B,GAClB,MAAOA,IAGT1D,QAAW,SAAU0D,GACnB,MAAOA,GAAE6D,SAGXwU,UAAa,SAAUrY,GACrB,MAAOA,IAGTvD,KAAQ,SAAUuD,GAChB,MAAOA,GAAE6D,SAGXyqB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGskB,GAAW,IAG1CqT,0BAA2B,SAAU33B,GAEnC,MAAyB,aAAjBlE,EAAOsC,OAAyB,GAAI/B,GAAKgc,WAAWrY,IAAKA,IAIrE,OAAOskB,GAGTxpB,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAuCpC,QAAS65B,GAAOxtB,EAAG4J,GAEjB,GAAI6d,GACAgG,EACAr2B,EACAxB,EAAI,EAAG83B,EAAQ,EACfxtB,EAAI,EAAGytB,EAAQ,CAEnB,KAAK7xB,EAAUkE,KAAOlE,EAAU8N,GAC9B,KAAM,IAAIrW,OAAM,sDAGlB,MAAOqW,GACL6jB,EAAIv0B,KAAK6W,MAAM/P,EAAI4J,GACnBxS,EAAI4I,EAAI4J,EAER6d,EAAI7xB,EACJA,EAAI83B,EAAQD,EAAI73B,EAChB83B,EAAQjG,EAERA,EAAIvnB,EACJA,EAAIytB,EAAQF,EAAIvtB,EAChBytB,EAAQlG,EAERznB,EAAI4J,EACJA,EAAIxS,CAGN,IAAIlB,EAOJ,OALEA,GADM,EAAJ8J,IACMA,GAAI0tB,GAAQC,IAGb3tB,EAAGA,EAAI0tB,EAAQ,EAAGC,GAED,UAAlBj8B,EAAOqC,OAAsBmC,EAAMnC,EAAOmC,GAUpD,QAAS03B,GAAe5tB,EAAG4J,GAEzB,GAAI6d,GACAgG,EACAr2B,EACA2vB,EAAO,GAAI90B,GAAKgc,UAAU,GAC1BrY,EAAI,GAAI3D,GAAKgc,UAAU,GAAIyf,EAAQ,GAAIz7B,GAAKgc,UAAU,GACtD/N,EAAI,GAAIjO,GAAKgc,UAAU,GAAI0f,EAAQ,GAAI17B,GAAKgc,UAAU,EAE1D,KAAKjO,EAAE8mB,UAAYld,EAAEkd,QACnB,KAAM,IAAIvzB,OAAM,sDAGlB,OAAQqW,EAAEod,UACRyG,EAAIztB,EAAE0nB,IAAI9d,GAAGmG,QACb3Y,EAAI4I,EAAEwV,IAAI5L,GAEV6d,EAAI7xB,EACJA,EAAI83B,EAAMtK,MAAMqK,EAAElH,MAAM3wB,IACxB83B,EAAQjG,EAERA,EAAIvnB,EACJA,EAAIytB,EAAMvK,MAAMqK,EAAElH,MAAMrmB,IACxBytB,EAAQlG,EAERznB,EAAI4J,EACJA,EAAIxS,CAGN,IAAIlB,EAOJ,OALEA,GADE8J,EAAE6M,GAAGka,IACA/mB,EAAEinB,MAAOyG,EAAMzG,MAAO0G,EAAM1G,QAG5BjnB,EAAIA,EAAEgnB,SAAmB,EAAR0G,EAAWC,GAEX,UAAlBj8B,EAAOqC,OAAsBmC,EAAMnC,EAAOmC,GAvHpD,GACInC,IADaT,EAAKtC,EAAoB,IAC7BsC,EAAKtC,EAAoB,KAyBtC,OAAO2C,GAAM,QACXuzB,iBAAkBsG,EAClBpG,uBAAwBwG,IA/B5B,GAAI9xB,GAAY9K,EAAoB,KAAK8K,SA8HzCpL,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAwBtCopB,EAASzmB,EAAM,UACjBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,uCAGlB,OAAOqC,GAAIsK,GAGbknB,uBAAwByG,EAExBnH,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGka,IAGnCuM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGka,KAIrC,OAAOA,GAhDT,GAAIte,GAAY9K,EAAoB,KAAK8K,UACrC+xB,EAAY78B,EAAoB,KAAK8mB,GAkDzCpnB,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAwBtCqpB,EAAS1mB,EAAM,UACjBK,OAAU,SAAU4B,GAClB,IAAKkG,EAAUlG,GACb,KAAM,IAAIrC,OAAM,sCAGlB,QAAQqC,GAGVqY,UAAa6f,EAEb5J,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGykB,KAIjC,OAAOA,GA5CT,GAAIve,GAAY9K,EAAoB,KAAK8K,UACrCgyB,EAAY98B,EAAoB,KAAK0kB,GA8CzChlB,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtCspB,EAAQ3mB,EAAM,SAChBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,sCAGlB,OAAOqC,GAAIsK,GAGbknB,uBAAwB2G,EAExBrH,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGoa,IAGnCqM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGoa,KAIrC,OAAOA,GAjDT,GAAIxe,GAAY9K,EAAoB,KAAK8K,UACrCiyB,EAAW/8B,EAAoB,KAAKgnB,EAmDxCtnB,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAwBtCupB,EAAS5mB,EAAM,UACjBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,uCAGlB,OAAOqC,GAAIsK,GAGbknB,uBAAwB4G,EAExBtH,sBAAuB,SAAU9wB,EAAGsK;AAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGqa,IAGnCoM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGqa,KAIrC,OAAOA,GAhDT,GAAIze,GAAY9K,EAAoB,KAAK8K,UACrCkyB,EAAYh9B,EAAoB,KAAK+mB,GAkDzCrnB,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtCwpB,EAAY7mB,EAAM,aACpBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,0CAGlB,OAAOqC,IAAKsK,GAGdknB,uBAAwB6G,EAExBvH,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsa,IAGnCmM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsa,KAIrC,OAAOA,GAjDT,GAAI1e,GAAY9K,EAAoB,KAAK8K,UACrCmyB,EAAej9B,EAAoB,KAAKwpB,SAmD5C9pB,GAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtCypB,EAAkB9mB,EAAM,mBAC1BuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,gDAGlB,OAAOqC,IAAKsK,GAGdknB,uBAAwB8G,EAExBxH,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGua,IAGnCkM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGua,KAIrC,OAAOA,GAjDT,GAAI3e,GAAY9K,EAAoB,KAAK8K,UACrCoyB,EAAqBl9B,EAAoB,KAAKypB,eAmDlD/pB,GAAQkG,KAAO,kBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtC0pB,EAAgB/mB,EAAM,iBACxBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,IAAKpE,EAAUlG,KAAOkG,EAAUoE,GAC9B,KAAM,IAAI3M,OAAM,8CAGlB,OAAOqC,KAAMsK,GAKfwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGwa,IAGnCiM,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGwa,KAIrC,OAAOA,GAjDT,GAAI5e,GAAY9K,EAAoB,KAAK8K,SAoDzCpL,GAAQkG,KAAO,gBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtCiG,EAAMtD,EAAM,OACdK,OAAU,SAAU4B,GAClB,MAAOsD,MAAKM,MAAM,EAAG5D,IAIvB1D,QAAW,SAAU0D,GACnB,MAAOsD,MAAKM,MAAM5D,EAAEkB,GAAIlB,EAAEiB,KAK5BqtB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGqB,KAIjC,OAAOA,GAGTvG,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtC2pB,EAAOhnB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAOA,IAGTqY,UAAa,SAAUrY,GACrB,MAAOA,IAGT1D,QAAW,SAAU0D,GACnB,MAAO,IAAIA,GAAE4G,YAAY5G,EAAEiB,IAAKjB,EAAEkB,KAGpCotB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG+kB,KAIjC,OAAOA,GAGTjqB,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtC6F,EAAKlD,EAAM,MACbK,OAAU,SAAU4B,GAClB,MAAOA,IAGTqY,UAAa,SAAUrY,GACrB,MAAOA,IAGT1D,QAAW,SAAU0D,GACnB,MAAOA,GAAEiB,IAGXqtB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGiB,KAIjC,OAAOA,GAGTnG,EAAQkG,KAAO,KACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtC8F,EAAKnD,EAAM,MACbK,OAAU,SAAU4B,GAClB,MAAO,IAGTqY,UAAa,SAAUrY,GACrB,MAAO,IAAIA,GAAE4G,YAAY,IAG3BtK,QAAW,SAAU0D,GACnB,MAAOA,GAAEkB,IAGXotB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGkB,KAIjC,OAAOA,GAGTpG,EAAQkG,KAAO,KACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtC4pB,EAAYjnB,EAAM,aACpB,GAAI,WACF,MAAO,IAAI1B,GAAKgc,UAAU,IAG5Bja,OAAU,SAAU4B,GAElB,MAAO,IAAI3D,GAAKgc,UAAUrY,EAAI,KAGhCyC,OAAU,SAAUzC,GAClB,MAAO,IAAI3D,GAAKgc,UAAUrY,IAG5BqY,UAAa,SAAUrY,GAErB,MAAOA,IAGTsuB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGglB,KAIjC,OAAOA,GAGTlqB,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA6BtCm9B,EAAOx6B,EAAM,QACf,GAAI,WACF,OAAO,GAGTy6B,UAAW,SAAUx4B,GACnB,MAAOA,IAGT5B,OAAU,SAAU4B,GAClB,QAASA,GAGXqY,UAAa,SAAUrY,GACrB,OAAQA,EAAEoxB,UAGZ3uB,OAAU,SAAUzC,GAElB,GAAIy4B,GAAQz4B,EAAE04B,aACd,IAAc,SAAVD,EACF,OAAO,CAEJ,IAAc,UAAVA,EACP,OAAO,CAIT,IAAItzB,GAAMrC,OAAO9C,EACjB,IAAS,IAALA,IAAYoF,MAAMD,GACpB,QAASA,CAGX,MAAM,IAAIxH,OAAM,mBAAqBqC,EAAI,mBAG3CsuB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGu4B,KAIjC,OAAOA,GAGTz9B,EAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoCpC,MAAOA,GAAM,SACX,GAAI,WACF,MAAO,IAAI1B,GAAKkB,OAGlBo7B,IAAO,SAAS53B,GACd,MAAO,IAAI1E,GAAKkB,MAAMwD,MAK5BjG,EAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAwCtC6pB,EAAUlnB,EAAM,WAClB,GAAI,WACF,MAAO,IAAI1B,GAAKC,QAAQ,EAAG,IAG7B8B,OAAU,SAAU4B,GAClB,MAAO,IAAI3D,GAAKC,QAAQ0D,EAAG,IAG7BsxB,iBAAkB,SAAUrwB,EAAIC,GAC9B,MAAO,IAAI7E,GAAKC,QAAQ2E,EAAIC,IAI9BswB,uBAAwB,SAAUvwB,EAAIC,GACpC,MAAO,IAAI7E,GAAKC,QAAQ2E,EAAGoC,WAAYnC,EAAGmC,aAG5C/G,QAAW,SAAU0D,GACnB,MAAOA,GAAE6D,SAGXpB,OAAU,SAAUzC,GAClB,GAAIrE,GAAIU,EAAKC,QAAQqG,MAAM3C,EAC3B,IAAIrE,EACF,MAAOA,EAGT,MAAM,IAAIwF,aAAY,WAAanB,EAAI,iCAGzC9B,OAAU,SAAU8B,GAClB,GAAG,MAAQA,IAAK,MAAQA,GACtB,MAAO,IAAI3D,GAAKC,QAAQ0D,EAAEiB,GAAIjB,EAAEkB,GAGlC,IAAI,KAAOlB,IAAK,OAASA,GACvB,MAAO3D,GAAKC,QAAQiF,UAAUvB,EAAEwB,EAAGxB,EAAEyB,IAGvC,MAAM,IAAI9D,OAAM,+EAGlB2wB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGilB,KAIjC,OAAOA,GAGTnqB,EAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAwCpC,MAAOA,GAAM,SACX66B,wCAAyC,SAAUl5B,GACjD,GAAImG,GAASnG,EAAKzC,IAAI,SAAUoE,GAC9B,MAAIA,aAAehF,GAAKgc,UACfhX,EAAIgC,WAEJrE,MAAMC,QAAQoC,GACdA,EAAIpE,IAAI,SAAU6d,GAEvB,MAAQA,aAAgBze,GAAKgc,UAAayC,EAAKzX,WAAayX,IAIvDzZ,IAIPf,EAAM,GAAIjE,GAAKG,KAEnB,OADAH,GAAKG,MAAM4J,MAAM9F,EAAKuF,GACfvF,KAKbxF,EAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA2DpC,QAAS86B,GAAQvQ,EAAMtkB,GAErB,GAAIyF,GAAIpN,EAAKuD,OAAO+G,QAAQ3C,GAAU,UAGtC,OAAO,IAAIyF,GAAE6e,GAhCf,MAAOvqB,GAAM,UACX,GAAI,WACF,MAAO86B,QAGTp2B,OAAU,SAAUuB,GAClB,MAAO60B,MAAY70B,IAGrBhF,MAAS,SAAUspB,GACjB,MAAOuQ,GAAQvQ,IAGjB1oB,OAAU,SAAU0oB,GAClB,MAAOuQ,GAAQvQ,EAAMA,EAAK3hB,YAG5BmyB,yBAA0BD,IAmB9B/9B,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtCgD,EAASL,EAAM,UACjB,GAAI,WACF,MAAO,IAGTK,OAAU,SAAU4B,GAClB,MAAOA,IAGTyC,OAAU,SAAUzC,GAClB,GAAImF,GAAMrC,OAAO9C,EACjB,IAAIoF,MAAMD,GACR,KAAM,IAAIhE,aAAY,WAAanB,EAAI,uBAEzC,OAAOmF,IAGTkT,UAAa,SAAUrY,GACrB,MAAOA,GAAEqD,YAGX5G,KAAQ,SAAUuD,GAChB,KAAM,IAAIrC,OAAM,iDAGlBo7B,sBAAuB,SAAU1xB,EAAMsB,GACrC,MAAOtB,GAAKhE,SAASsF,IAGvB2lB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG5B,KAIjC,OAAOA,GAGTtD,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAC3C,GAAIsmB,GAAS3kB,EAAKtC,EAAoB,IA6CtC,OAAO2C,GAAM,UACX,GAAI,WACF,MAAO,IAAIskB,GAAOtmB,MAKxBjB,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,EAClBC,EAAQiB,MAAO,GAKV,SAAShB,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAIsqB,GAAehsB,EAAKgsB,YA4BxB,OAAOtqB,GAAM,UACX,GAAI,WACF,MAAO,IAAIsqB,QAGbiG,iBAAkB,SAAUhG,GAC1B,MAAO,IAAID,GAAaC,MAK9BxtB,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtCqH,EAAS1E,EAAM,UACjB,GAAI,WACF,MAAO,IAGTK,OAAUA,EAAO4F,OAEjBg1B,OAAQ,SAAUh5B,GAChB,MAAO,QAGTw4B,UAAW,SAAUx4B,GACnB,MAAOA,GAAI,IAGbsuB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGyC,IAG/Bk2B,IAAO,SAAU34B,GACf,MAAOi5B,QAAOj5B,KAIlB,OAAOyC,GAtDT,GAAIrE,GAAShD,EAAoB,IAyDjCN,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtCiM,EAAOtJ,EAAM,QACftB,KAAQ,SAAUuD,GAChB,MAAOA,GAAE6D,SAGXpB,OAAU,SAAUzC,GAClB,GAAI3D,EAAKI,KAAK8L,gBAAgBvI,GAC5B,MAAO,IAAI3D,GAAKI,KAAK,KAAMuD,EAG7B,IAAIiK,GAAI5N,EAAKI,KAAKkG,MAAM3C,EACxB,IAAIiK,EACF,MAAOA,EAGT,MAAM,IAAI9I,aAAY,WAAanB,EAAI,uBAGzCk5B,iBAAkB,SAAUn4B,EAAOsG,GACjC,MAAO,IAAIhL,GAAKI,KAAKsE,EAAOsG,IAG9B8xB,oBAAqB,SAAUp4B,EAAOsG,GACpC,MAAO,IAAIhL,GAAKI,KAAKsE,EAAMsC,WAAYgE,IAGzCinB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGqH,KAIjC,OAAOA,GAGTvM,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAC3C,GAAIyD,GAAa9B,EAAKtC,EAAoB,IACtCuH,EAAQjF,EAAKtC,EAAoB,IAoCrC,OAAO2C,GAAM,WACX0E,OAAU,SAAUsV,GAClB,MAAOpV,GAAMoV,GAAMyK,QAAQzmB,IAG7BuyB,iBAAkB,SAAUvW,GAC1B,MAAOvY,GAAWS,QAAQ8X,EAAM,SAAUqhB,GACxC,MAAOz2B,GAAMy2B,GAAO5W,QAAQzmB,QAMpCjB,EAAQiB,MAAO,EACfjB,EAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAC3C,GAAIyD,GAAa9B,EAAKtC,EAAoB,IACtCuH,EAAQjF,EAAKtC,EAAoB,IA+BrC,OAAO2C,GAAM,WACX0E,OAAU,SAAUsV,GAClB,GAAIuK,KACJ,OAAO3f,GAAMoV,GAAMyK,QAAQzmB,GAAMic,KAAKsK,IAGxC+W,iBAAkB,SAAUthB,EAAMuK,GAChC,MAAO3f,GAAMoV,GAAMyK,QAAQzmB,GAAMic,KAAKsK,IAGxCgM,iBAAkB,SAAUvW,GAC1B,GAAIuK,KACJ,OAAO9iB,GAAWS,QAAQ8X,EAAM,SAAUqhB,GACxC,MAAOz2B,GAAMy2B,GAAO5W,QAAQzmB,GAAMic,KAAKsK,MAI3CgX,yBAA0B,SAAUvhB,EAAMuK,GACxC,MAAO9iB,GAAWS,QAAQ8X,EAAM,SAAUqhB,GACxC,MAAOz2B,GAAMy2B,GAAO5W,QAAQzmB,GAAMic,KAAKsK,QAM/CxnB,EAAQiB,MAAO,EACfjB,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAmB3C,MAAOgC,GAAM,QACX46B,IAAO,SAAUY,GACf,GAAIphB,GACAnX,EAAOu4B,CAEX,IAAsB,gBAAXA,GACT,IAAKphB,IAAQpc,GAEX,GAAIA,EAAK+L,eAAeqQ,IAAUohB,IAAWx9B,EAAKoc,GAAQ,CACxDnX,EAAOmX,CACP,OAmBN,GAAIb,GAAMlb,EAAK4E,EACf,KAAKsW,EACH,KAAM,IAAI3Z,OAAM,8BAAgCqD,EAAO,IAEzD,OAAO,IAAI3E,GAAKK,KAAK4a,MAtD3B,GAAIlb,GAAOhB,EAAoB,GA2D/BN,GAAQiB,MAAO,EACfjB,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAI4E,GAAQjF,EAAKtC,EAAoB,IAkCrC,OAAO2C,GAAM,SACXy7B,0BAA2B72B,EAC3B82B,kCAAmC92B,IAIvC7H,EAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA8BtC8mB,EAAMnkB,EAAM,OACduzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,SAAUtK,IAAKsK,IAGjB6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,QAAiB,IAATtK,EAAEiB,IAAqB,IAATjB,EAAEkB,IAAuB,IAAToJ,EAAErJ,IAAqB,IAATqJ,EAAEpJ,KAGxDswB,uBAAwB,SAAUxxB,EAAGsK,GACnC,QAAQtK,EAAEoxB,UAAa9mB,EAAE8mB,UAAapxB,EAAEoF,SAAYkF,EAAElF,UAGxDgyB,aAAc,SAAUp3B,EAAGsK,GACzB,MAAoB,KAAZtK,EAAEe,OAA2B,OAAZf,EAAEe,OAAgC,IAAZuJ,EAAEvJ,OAA2B,OAAZuJ,EAAEvJ,OAGpE+vB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG4X,IAGnC6O,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG4X,KAIrC,OAAOA,GAGTpnB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtC0kB,EAAM/hB,EAAM,OACdK,OAAU,SAAU4B,GAClB,OAAQA,GAGV1D,QAAW,SAAU0D,GACnB,MAAgB,KAATA,EAAEiB,IAAqB,IAATjB,EAAEkB,IAGzBmX,UAAa,SAAUrY,GACrB,MAAOA,GAAEoxB,UAAYpxB,EAAEoF,SAGzB3I,KAAQ,SAAUuD,GAChB,MAAmB,QAAZA,EAAEe,OAA6B,GAAXf,EAAEe,OAG/ButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG8f,KAIjC,OAAOA,GAGThlB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA8BtCgnB,EAAKrkB,EAAM,MACbuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,SAAUtK,IAAKsK,IAGjB6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,MAAiB,KAATtK,EAAEiB,IAAqB,IAATjB,EAAEkB,IAAuB,IAAToJ,EAAErJ,IAAqB,IAATqJ,EAAEpJ,IAGxDswB,uBAAwB,SAAUxxB,EAAGsK,GACnC,OAAStK,EAAEoxB,WAAapxB,EAAEoF,UAAckF,EAAE8mB,WAAa9mB,EAAElF,SAG3DgyB,aAAc,SAAUp3B,EAAGsK,GACzB,MAAoB,KAAZtK,EAAEe,OAA2B,OAAZf,EAAEe,OAAgC,IAAZuJ,EAAEvJ,OAA2B,OAAZuJ,EAAEvJ,OAGpE+vB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8X,IAGnC2O,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG8X,KAIrC,OAAOA,GAGTtnB,EAAQkG,KAAO,KACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA8BtC+mB,EAAMpkB,EAAM,OACduzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,WAAYtK,IAAMsK,IAGpB6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,UAAoB,IAATtK,EAAEiB,IAAqB,IAATjB,EAAEkB,KAAsB,IAAToJ,EAAErJ,IAAqB,IAATqJ,EAAEpJ,MAG1DswB,uBAAwB,SAAUxxB,EAAGsK,GACnC,WAAYtK,EAAEoxB,WAAapxB,EAAEoF,WAAakF,EAAE8mB,WAAa9mB,EAAElF,WAG7DgyB,aAAc,SAAUp3B,EAAGsK,GACzB,UAAuB,IAAZtK,EAAEe,OAA2B,OAAZf,EAAEe,QAA+B,IAAZuJ,EAAEvJ,OAA2B,OAAZuJ,EAAEvJ,SAGtE+vB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG6X,IAGnC4O,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG6X,KAIrC,OAAOA,GAGTrnB,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAQA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAII,GAAST,EAAKtC,EAAoB,IA8BtC,OAAO2C,GAAM,UAEX27B,yCAA0C,SAAUh6B,GAClD,GAAId,GAGA+6B,EAFAp5B,EAAMb,EAAKP,OACXT,EAAM,GAENk7B,GAAW,EACXC,IAEJ,KAAKj7B,EAAI,EAAO2B,EAAJ3B,EAASA,IAAK,CACxB,GAAIyC,GAAM3B,EAAKd,EAOf,IAJIyC,YAAehF,GAAKuD,SACtBg6B,GAAW,GAGM,gBAARv4B,IAAoBA,YAAehF,GAAKgc,UAAW,CAC5D,GAAIzZ,IAAM2B,EAAM,EACd,KAAM,IAAI5C,OAAM,+CAOlB,IAHAg8B,EAAUj7B,EACVA,EAAM2C,EAAIxB,WAELqG,EAAUxH,GACb,KAAM,IAAIiD,WAAU,wCAGtB,IAAU,EAANjD,EAEF,KAAM,IAAIkC,GAAWlC,EAEvB,IAAIE,EAAI,GAAKF,EAAMi7B,EAEjB,KAAM,IAAI/4B,GAAWlC,EAAKi7B,EAAU,OAGnC,CAEH,GAAIj+B,GAAImI,EAAMxC,GAAKxB,UACfa,EAAOf,EAAMe,KAAKhF,EAMtB,IALAm+B,EAASj7B,GAAKlD,EACdi+B,EAAUj7B,EACVA,EAAMgC,EAAKvB,OAAS,EAGhBP,EAAI,GAAKF,GAAOi7B,EAClB,KAAM,IAAIn5B,GAAem5B,EAAU,EAAGj7B,EAAM,IAKlD,GAAuB,GAAnBm7B,EAAS16B,OACX,KAAM,IAAIgC,aAAY,+BAIxB,KADA,GAAIb,GAAMu5B,EAASC,QACZD,EAAS16B,QACdmB,EAAMy5B,EAAQz5B,EAAKu5B,EAASC,QAASp7B,EAAK,EAG5C,OAAOk7B,GAAWz7B,EAAOmC,GAAOA,KAetC,QAASy5B,GAAQ3vB,EAAG4J,EAAGgmB,EAAWt7B,GAChC,GAAUs7B,EAANt7B,EAAiB,CAEnB,GAAI0L,EAAEjL,QAAU6U,EAAE7U,OAChB,KAAM,IAAIqB,GAAe4J,EAAEjL,OAAQ6U,EAAE7U,OAIvC,KAAK,GADDxD,MACKiD,EAAI,EAAGA,EAAIwL,EAAEjL,OAAQP,IAC5BjD,EAAEiD,GAAKm7B,EAAQ3vB,EAAExL,GAAIoV,EAAEpV,GAAIo7B,EAAWt7B,EAAM,EAE9C,OAAO/C,GAIP,MAAOyO,GAAEvN,OAAOmX,GAnIpB,GAAInQ,GAAQzI,EAAoB,KAAKyI,MACjCqC,EAAY9K,EAAoB,KAAK8K,UACrCvG,EAAQvE,EAAoB,KAC5BwF,EAAaxF,EAAoB,KACjCoF,EAAiBpF,EAAoB,IAmIzCN,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAyDpC,QAASk8B,GAAOj6B,EAAGsK,GACjB,GAAI4vB,GAAOx5B,EAAKV,GACZm6B,EAAQz5B,EAAK4J,EAEjB,IAAoB,GAAhB4vB,EAAM/6B,QAA+B,GAAhBg7B,EAAMh7B,QAA2B,GAAZ+6B,EAAM,IAAuB,GAAZC,EAAM,GACnE,KAAM,IAAIlK,YAAW,6CACLiK,EAAMzzB,KAAK,MAAQ,WAAa0zB,EAAM1zB,KAAK,MAAQ,KAGrE,QACE2d,EAASL,EAAS/jB,EAAE,GAAIsK,EAAE,IAAKyZ,EAAS/jB,EAAE,GAAIsK,EAAE,KAChD8Z,EAASL,EAAS/jB,EAAE,GAAIsK,EAAE,IAAKyZ,EAAS/jB,EAAE,GAAIsK,EAAE,KAChD8Z,EAASL,EAAS/jB,EAAE,GAAIsK,EAAE,IAAKyZ,EAAS/jB,EAAE,GAAIsK,EAAE,MApEpD,GAAInM,GAAWT,EAAKtC,EAAoB,KACpCgpB,EAAW1mB,EAAKtC,EAAoB,KACpC2oB,EAAWrmB,EAAKtC,EAAoB,IA+BxC,OAAO2C,GAAM,SACX2wB,iBAAkB,SAAU1uB,EAAGsK,GAC7B,MAAOnM,GAAO87B,EAAOj6B,EAAE4F,UAAW0E,EAAE1E,aAGtCupB,gBAAiB,SAAUnvB,EAAGsK,GAC5B,MAAOnM,GAAO87B,EAAOj6B,EAAE4F,UAAW0E,KAGpC4kB,gBAAiB,SAAUlvB,EAAGsK,GAC5B,MAAOnM,GAAO87B,EAAOj6B,EAAGsK,EAAE1E,aAG5BqpB,eAAgBgL,IAjDpB,GAAIv5B,GAAOtF,EAAoB,KAAKsF,IA4EpC5F,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA+FpC,QAASq8B,GAAMj8B,EAAQwiB,EAAMC,GAC3B,GAAY,GAARD,EAEF,MAAOrb,GAAOzB,MAAM1F,EAAO,GAAG,GAE3B,IAAY,GAARwiB,EAGP,MAAOyD,GACHL,EAAS5lB,EAAO,GAAG,GAAIA,EAAO,GAAG,IACjC4lB,EAAS5lB,EAAO,GAAG,GAAIA,EAAO,GAAG,IAsCrC,KAAK,GAjCDk8B,GAAa,SAAUl8B,GACzB,GAAIS,GAAGQ,EAKHk7B,EAAK,GAAIt7B,OAAMb,EAAOgB,QACtB2nB,EAAM,CACV,KAAKloB,EAAI,EAAGA,EAAIT,EAAOgB,OAAQP,IAC7BkoB,EAAM1D,EAAI0D,EAAK3oB,EAAOS,GAAGA,GAG3B,KAAKA,EAAI,EAAGA,EAAIT,EAAOgB,OAAQP,IAAK,CAIlC,IAHA07B,EAAG17B,GAAK,GAAII,OAAMb,EAAOgB,QACzBm7B,EAAG17B,GAAGA,GAAKylB,EAAWyC,GAEjB1nB,EAAI,EAAOR,EAAJQ,EAAOA,IACjBk7B,EAAG17B,GAAGQ,GAAK,CAGb,KAAKA,EAAIR,EAAI,EAAGQ,EAAIjB,EAAOgB,OAAQC,IACjCk7B,EAAG17B,GAAGQ,GAAKjB,EAAOS,GAAGQ,EAGnBR,GAAE,EAAIT,EAAOgB,SACf2nB,EAAM1C,EAAS0C,EAAK3oB,EAAOS,EAAI,GAAGA,EAAI,KAI1C,MAAO07B,IAGLC,EAAKp8B,EACAS,EAAI,EAAO+hB,EAAO,EAAX/hB,EAAcA,IAC5B27B,EAAKxW,EAASsW,EAAWE,GAAKp8B,EAGhC,OAAIwiB,GAAO,GAAK,EACP0D,EAAWkW,EAAG,GAAG,IAEjBA,EAAG,GAAG,GArJnB,GACIp8B,IADaT,EAAKtC,EAAoB,IAC7BsC,EAAKtC,EAAoB,MAClCgoB,EAAM1lB,EAAKtC,EAAoB,KAC/BgpB,EAAW1mB,EAAKtC,EAAoB,KACpC2oB,EAAWrmB,EAAKtC,EAAoB,KACpCipB,EAAa3mB,EAAKtC,EAAoB,IA2B1C,OAAO2C,GAAM,OACX46B,IAAO,SAAU34B,GACf,MAAOsF,GAAOzB,MAAM7D,IAGtBsuB,iBAAkB,SAActuB,GAC9B,GAAIU,EAaJ,QAZIV,YAAa3D,GAAKuD,OACpBc,EAAOV,EAAEU,OAEFV,YAAahB,QACpBgB,EAAI7B,EAAO6B,GACXU,EAAOV,EAAEU,QAITA,KAGMA,EAAKvB,QACX,IAAK,GAEH,MAAOmG,GAAOzB,MAAM7D,EAEtB,KAAK,GAEH,GAAe,GAAXU,EAAK,GACP,MAAO4E,GAAOzB,MAAM7D,EAAEH,UAAU,GAGhC,MAAM,IAAIowB,YAAW,gCACTxtB,EAAOuB,OAAOtD,GAAQ,IAGtC,KAAK,GAEH,GAAIigB,GAAOjgB,EAAK,GACZkgB,EAAOlgB,EAAK,EAChB,IAAIigB,GAAQC,EACV,MAAOwZ,GAAKp6B,EAAE6D,QAAQhE,UAAW8gB,EAAMC,EAGvC,MAAM,IAAIqP,YAAW,gCACTxtB,EAAOuB,OAAOtD,GAAQ,IAGtC,SAEE,KAAM,IAAIuvB,YAAW,yCACTxtB,EAAOuB,OAAOtD,GAAQ,SAtF5C,GAAIZ,GAAO1E,EAAoB,KAC3BkK,EAASxF,EAAKwF,OACd7C,EAAS3C,EAAK2C,MA8JlB3H,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAMb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAsGpC,QAASy8B,GAAOx6B,EAAGwJ,EAAG9I,EAAMsD,GAC1B,IAAKkC,EAAUsD,GACb,KAAM,IAAI7H,WAAW,uDAGvB,IAAIqpB,GAASxhB,EAAI,EAAIA,EAAI,EACrByhB,EAAW,EAAJzhB,GAASA,EAAI,CAGxB,QAAQ9I,EAAKvB,QACX,IAAK,GACH,MAAOs7B,GAAsBz6B,EAAGwJ,EAAGxF,EAAQtD,EAAK,GAAIuqB,EAAMD,EAC5D,KAAK,GACH,MAAO0P,GAAa16B,EAAGwJ,EAAGxF,EAAQtD,EAAMuqB,EAAMD,GAElD,KAAM,IAAIiF,YAAW,kDAGvB,QAASwK,GAAsBz6B,EAAGwJ,EAAGxF,EAAQuL,EAAG0b,EAAMD,GAEpD,GAAIG,IAAM5b,EAAI0b,EAAM1b,EAAIyb,GAEpB2P,EAAIt+B,EAAKuD,OAAO+G,QAAQ3C,GAAU,SAElCtI,EAAIi/B,EAAE5P,SAASI,EAAInrB,EAAGwJ,EAE1B,OAAkB,QAAXxF,EAAkBtI,EAAIA,EAAEmE,UAGjC,QAAS66B,GAAa16B,EAAGwJ,EAAGxF,EAAQqO,EAAG4Y,EAAMD,GAE3C,GAAIhrB,YAAa3D,GAAKuD,OAAQ,CAE5B,GAAIg7B,GAAK56B,EAAE+qB,SAASvhB,EAEpB,OAAe,QAAXxF,EAEEA,IAAW42B,EAAGj0B,UACTxI,EAAOy8B,EAAI52B,GACb42B,EAEFA,EAAG/6B,UAOZ,IAAK,GAJDqK,GAAI5G,KAAKlG,IAAIiV,EAAE,GAAK4Y,EAAM5Y,EAAE,GAAK2Y,GAEjC6P,EAAS,GAAI77B,OAAMkL,GAEdtL,EAAI,EAAOsL,EAAJtL,EAAOA,IACrBi8B,EAAOj8B,GAAKiF,EAAM7D,EAAEpB,EAAIqsB,GAAMrsB,EAAIosB,GAGpC,OAAkB,QAAXhnB,EAAkB7F,EAAO08B,GAAUA,EAxJ5C,GAAI18B,GAAST,EAAKtC,EAAoB,IAuCtC,OAAO2C,GAAM,QAGXiB,MAAS,SAAUgB,GACjB,MAAOw6B,GAAMx6B,EAAG,EAAGL,EAAMe,KAAKV,GAAI,OAGpCo2B,gBAAiB,SAAUp2B,EAAGwJ,GAC5B,MAAOgxB,GAAMx6B,EAAGwJ,EAAG7J,EAAMe,KAAKV,GAAI,OAGpCq2B,mBAAoB,SAAUr2B,EAAGwJ,GAC/B,MAAOgxB,GAAMx6B,EAAGwJ,EAAEnG,WAAY1D,EAAMe,KAAKV,GAAI,OAG/C86B,gBAAiB,SAAU96B,EAAGgE,GAC5B,MAAOw2B,GAAMx6B,EAAG,EAAGL,EAAMe,KAAKV,GAAIgE,IAGpC+2B,wBAAyB,SAAU/6B,EAAGwJ,EAAGxF,GACvC,MAAOw2B,GAAMx6B,EAAGwJ,EAAG7J,EAAMe,KAAKV,GAAIgE,IAGpCg3B,2BAA4B,SAAUh7B,EAAGwJ,EAAGxF,GAC1C,MAAOw2B,GAAMx6B,EAAGwJ,EAAEnG,WAAY1D,EAAMe,KAAKV,GAAIgE,IAG/CpE,OAAU,SAAUI,GAClB,MAAOw6B,GAAMx6B,EAAG,EAAGA,EAAEU,OAAQV,EAAE2G,YAGjC2vB,iBAAkB,SAAUt2B,EAAGwJ,GAC7B,MAAOgxB,GAAMx6B,EAAGwJ,EAAGxJ,EAAEU,OAAQV,EAAE2G,YAGjC4vB,oBAAqB,SAAUv2B,EAAGwJ,GAChC,MAAOgxB,GAAMx6B,EAAGwJ,EAAEnG,WAAYrD,EAAEU,OAAQV,EAAE2G,YAG5Cs0B,iBAAkB,SAAUj7B,EAAGgE,GAC7B,MAAOw2B,GAAMx6B,EAAG,EAAGA,EAAEU,OAAQsD,IAG/Bk3B,yBAA0B,SAAUl7B,EAAGwJ,EAAGxF,GACxC,MAAOw2B,GAAMx6B,EAAGwJ,EAAGxJ,EAAEU,OAAQsD,IAG/Bm3B,4BAA6B,SAAUn7B,EAAGwJ,EAAGxF,GAC3C,MAAOw2B,GAAMx6B,EAAGwJ,EAAEnG,WAAYrD,EAAEU,OAAQsD,MA7F9C,GAAIrE,GAAYvE,EAAoB,KAChCyI,EAAYzI,EAAoB,KAAKyI,MACrCqC,EAAY9K,EAAoB,KAAK8K,SAgKzCpL,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAmDpC,QAASq9B,GAAKp7B,EAAGsK,GACf,GAAI4vB,GAAOx5B,EAAKV,GACZm6B,EAAQz5B,EAAK4J,GACb/J,EAAM25B,EAAM,EAEhB,IAAqB,IAAjBA,EAAM/6B,QAAiC,IAAjBg7B,EAAMh7B,OAAc,KAAM,IAAI8wB,YAAW,kBACnE,IAAIiK,EAAM,IAAMC,EAAM,GAAI,KAAM,IAAIlK,YAAW,mCAAqCiK,EAAM,GAAK,OAASC,EAAM,GAAK,IACnH,IAAW,GAAP55B,EAAU,KAAM,IAAI0vB,YAAW,oDAGnC,KAAK,GADDrJ,GAAO,EACFhoB,EAAI,EAAO2B,EAAJ3B,EAASA,IACvBgoB,EAAOxD,EAAIwD,EAAM7C,EAAS/jB,EAAEpB,GAAI0L,EAAE1L,IAGpC,OAAOgoB,GAhET,GAAIxD,GAAW1lB,EAAKtC,EAAoB,KACpC2oB,EAAWrmB,EAAKtC,EAAoB,IAyBxC,OAAO2C,GAAM,OACX2wB,iBAAkB,SAAU1uB,EAAGsK,GAC7B,MAAO8wB,GAAKp7B,EAAE4F,UAAW0E,EAAE1E,YAG7BupB,gBAAiB,SAAUnvB,EAAGsK,GAC5B,MAAO8wB,GAAKp7B,EAAE4F,UAAW0E,IAG3B4kB,gBAAiB,SAAUlvB,EAAGsK,GAC5B,MAAO8wB,GAAKp7B,EAAGsK,EAAE1E,YAGnBqpB,eAAgBmM,IA1CpB,GAAI16B,GAAOtF,EAAoB,KAAKsF,IAuEpC5F,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA4EpC,QAASs9B,GAAY36B,EAAMsD,GACzB,OAAQtD,EAAKvB,QACX,IAAK,GAAG,MAAO6E,GAAS7F,EAAO6F,KAC/B,KAAK,GAAG,MAAOs3B,GAAK56B,EAAK,GAAIA,EAAK,GAAIsD,EACtC,KAAK,GAAG,MAAOs3B,GAAK56B,EAAK,GAAIA,EAAK,GAAIsD,EACtC,SAAS,KAAM,IAAIrG,OAAM,0CAY7B,QAAS29B,GAAM3a,EAAMC,EAAM5c,GAEzB,GAAIu3B,GAAM5a,YAAgBtkB,GAAKgc,UAAYsI,EAAK/Z,YAC5Cga,YAAgBvkB,GAAKgc,UAAYuI,EAAKha,YAAc,IAKxD,IAHI+Z,YAAgBtkB,GAAKgc,YAAWsI,EAAOA,EAAKtd,YAC5Cud,YAAgBvkB,GAAKgc,YAAWuI,EAAOA,EAAKvd,aAE3C6C,EAAUya,IAAgB,EAAPA,EACtB,KAAM,IAAIhjB,OAAM,uDAElB,KAAKuI,EAAU0a,IAAgB,EAAPA,EACtB,KAAM,IAAIjjB,OAAM,uDAGlB,IAAI43B,GAAMgG,EAAM,GAAIl/B,GAAKgc,UAAU,GAAK,EACpCtR,EAAew0B,EAAM,GAAIA,GAAI,GAAK,EAClC76B,GAAQigB,EAAMC,EAGlB,IAAI5c,EAAQ,CAEV,GAAI22B,GAAIt+B,EAAKuD,OAAO+G,QAAQ3C,EAE5B,OAAO22B,GAAE5P,SAASrqB,EAAM60B,EAAK,EAAGxuB,GAQlC,IAAK,GAJDzG,GAAMX,EAAMuH,UAAWxG,EAAMqG,GAE7BmS,EAAiB0H,EAAPD,EAAcA,EAAOC,EAE1B5W,EAAI,EAAOkP,EAAJlP,EAAaA,IAC3B1J,EAAI0J,GAAGA,GAAKurB,CAEd,OAAOj1B,GA9HT,GAAInC,GAAST,EAAKtC,EAAoB,IAgCtC,OAAO2C,GAAM,OACX,GAAI,WACF,MAA0B,WAAlBjC,EAAOqC,OAAuBA,UAGxCsE,OAAU,SAAUuB,GAClB,MAAO7F,GAAO6F,IAGhBw3B,qBAAsB,SAAU7a,GAC9B,MAAO2a,GAAK3a,EAAMA,EAAwB,WAAlB7kB,EAAOqC,OAAsB,UAAYuH,SAGnE+1B,6BAA8B,SAAU9a,EAAM3c,GAC5C,MAAOs3B,GAAK3a,EAAMA,EAAM3c,IAG1B03B,yCAA0C,SAAU/a,EAAMC,GACxD,MAAO0a,GAAK3a,EAAMC,EAAwB,WAAlB9kB,EAAOqC,OAAsB,UAAYuH,SAGnEi2B,iDAAkD,SAAUhb,EAAMC,EAAM5c,GACtE,MAAOs3B,GAAK3a,EAAMC,EAAM5c,IAG1BhF,MAAU,SAAU0B,GAClB,MAAO26B,GAAW36B,IAGpBo6B,gBAAkB,SAAUp6B,EAAMsD,GAChC,MAAOq3B,GAAW36B,EAAMsD,IAG1BpE,OAAU,SAAUc,GAClB,MAAO26B,GAAW36B,EAAKb,UAAWa,EAAKiG,YAGzCs0B,iBAAkB,SAAUv6B,EAAMsD,GAChC,MAAOq3B,GAAW36B,EAAKb,UAAWmE,MA3ExC,GAAIrE,GAAQvE,EAAoB,KAC5B8K,EAAY9K,EAAoB,KAAK8K,SAsIzCpL,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAII,GAAST,EAAKtC,EAAoB,IAoBtC,OAAO2C,GAAM,WACXiB,MAAS,SAAUgB,GACjB,MAAO47B,GAAS/3B,EAAM7D,KAGxBJ,OAAU,SAAUI,GAClB,GAAI67B,GAAOD,EAAS/3B,EAAM7D,EAAE4F,WAE5B,OAAOzH,GAAO09B,MAhCpB,GAAIh4B,GAAQzI,EAAoB,KAAKyI,MACjC+3B,EAAWxgC,EAAoB,KAAKoqB,OAoCxC1qB,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA+FpC,QAAS+9B,GAAMr9B,EAAKkiB,EAAMC,GACxB,GAAIpf,GAAG6Q,EAAGlI,EAAGpJ,EAAOsZ,CAEpB,IAAY,GAARsG,EAAW,CAGb,GADA5f,EAAQtC,EAAI,GAAG,GACF,GAATsC,EACF,KAAMpD,OAAM,gDAEd,SACEizB,EAAa,EAAG7vB,KAGf,GAAY,GAAR4f,EAAW,CAElB,GAAI3W,GAAIob,EAAI3mB,EACZ,IAAS,GAALuL,EACF,KAAMrM,OAAM,gDAEd,SAEIizB,EAAanyB,EAAI,GAAG,GAAIuL,GACxB4mB,EAAavM,EAAW5lB,EAAI,GAAG,IAAKuL,KAGpC4mB,EAAavM,EAAW5lB,EAAI,GAAG,IAAKuL,GACpC4mB,EAAanyB,EAAI,GAAG,GAAIuL,KAY5B,GAAI8I,GAAIrU,EAAI5B,QACZ,KAAK2E,EAAI,EAAOmf,EAAJnf,EAAUA,IACpBsR,EAAEtR,GAAKsR,EAAEtR,GAAG3E,QAQd,KAAK,GAHDqX,GAAIqR,EAAI5E,GAAM9gB,UAGTlE,EAAI,EAAOilB,EAAJjlB,EAAUA,IAAK,CAI7B,IADA6F,EAAI7F,EACOglB,EAAJnf,GAAuB,GAAXsR,EAAEtR,GAAG7F,IACtB6F,GAEF,IAAIA,GAAKmf,GAAmB,GAAX7N,EAAEtR,GAAG7F,GAEpB,KAAMgC,OAAM,gDAEV6D,IAAK7F,IACP0e,EAAOvH,EAAEnX,GAAImX,EAAEnX,GAAKmX,EAAEtR,GAAIsR,EAAEtR,GAAK6Y,EACjCA,EAAOnG,EAAEvY,GAAIuY,EAAEvY,GAAKuY,EAAE1S,GAAI0S,EAAE1S,GAAK6Y,EAInC,IAAI0hB,GAAKjpB,EAAEnX,GACPqgC,EAAK9nB,EAAEvY,EACX,KAAK6F,EAAI,EAAOmf,EAAJnf,EAAUA,IAAK,CACzB,GAAIy6B,GAAKnpB,EAAEtR,GACP06B,EAAKhoB,EAAE1S,EACX,IAAGA,GAAK7F,GAEN,GAAa,GAATsgC,EAAGtgC,GAAS,CAKd,IAJAwO,EAAIymB,EAAavM,EAAW4X,EAAGtgC,IAAKogC,EAAGpgC,IAIlC0W,EAAI1W,EAAOilB,EAAJvO,EAAUA,IACpB4pB,EAAG5pB,GAAK+Q,EAAI6Y,EAAG5pB,GAAI0R,EAAS5Z,EAAG4xB,EAAG1pB,IAEpC,KAAKA,EAAI,EAAOuO,EAAJvO,EAAUA,IACpB6pB,EAAG7pB,GAAK+Q,EAAI8Y,EAAG7pB,GAAK0R,EAAS5Z,EAAG6xB,EAAG3pB,UAIpC,CAIH,IADAlI,EAAI4xB,EAAGpgC,GACF0W,EAAI1W,EAAOilB,EAAJvO,EAAUA,IACpB4pB,EAAG5pB,GAAKue,EAAaqL,EAAG5pB,GAAIlI,EAE9B,KAAKkI,EAAI,EAAOuO,EAAJvO,EAAUA,IACpB6pB,EAAG7pB,GAAKue,EAAasL,EAAG7pB,GAAIlI,KAKpC,MAAO+J,GAhMX,GACI/V,IADeT,EAAKtC,EAAoB,IACzBsC,EAAKtC,EAAoB,MACxCw1B,EAAelzB,EAAKtC,EAAoB,MACxCgoB,EAAe1lB,EAAKtC,EAAoB,KACxC2oB,EAAermB,EAAKtC,EAAoB,KACxCipB,EAAe3mB,EAAKtC,EAAoB,KACxCgqB,EAAe1nB,EAAKtC,EAAoB,KACxCmqB,EAAe7nB,EAAKtC,EAAoB,KAsBxCqqB,EAAM1nB,EAAM,OACduwB,iBAAkB,SAAUtuB,GAC1B,GAAIU,GAAOV,YAAa3D,GAAKuD,OAASI,EAAEU,OAASZ,EAAKH,MAAMe,KAAKV,EACjE,QAAQU,EAAKvB,QACX,IAAK,GAEH,GAAe,GAAXuB,EAAK,GACP,MAAIV,aAAa3D,GAAKuD,OACbzB,GACLyyB,EAAa,EAAG5wB,EAAEH,UAAU,OAK5B+wB,EAAa,EAAG5wB,EAAE,IAKtB,MAAM,IAAIiwB,YAAW,gCACTnwB,EAAK2C,OAAOuB,OAAOtD,GAAQ,IAG3C,KAAK,GAEH,GAAIigB,GAAOjgB,EAAK,GACZkgB,EAAOlgB,EAAK,EAChB,IAAIigB,GAAQC,EACV,MAAI5gB,aAAa3D,GAAKuD,OACbzB,EACH29B,EAAK97B,EAAEH,UAAW8gB,EAAMC,GACxB5gB,EAAE2G,WAKCm1B,EAAK97B,EAAG2gB,EAAMC,EAIvB,MAAM,IAAIqP,YAAW,gCACTnwB,EAAK2C,OAAOuB,OAAOtD,GAAQ,IAG3C,SAEE,KAAM,IAAIuvB,YAAW,yCACTnwB,EAAK2C,OAAOuB,OAAOtD,GAAQ,OAI7Ci4B,IAAO,SAAU34B,GAEf,MAAO4wB,GAAa,EAAG5wB,KAkH3B,OAAOylB,GAvMT,GAAI3lB,GAAO1E,EAAoB,IA0M/BN,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GAC/B,GAAIgE,GAAO1E,EAAoB,KAE3Bid,EAAYtc,EAAKM,KAAKgc,UACtBzY,EAAS7D,EAAKM,KAAKuD,OACnBJ,EAAazD,EAAKyD,WAElBG,EAAQG,EAAKH,MACb+B,EAAW5B,EAAK1B,OAAOsD,SACvBwE,EAAYpG,EAAK1B,OAAO8H,UACxB1D,EAAW1C,EAAK2C,OAAOD,SACvBvD,EAAUD,MAAMC,OAmCpBlD,GAAK2pB,KAAO,SAAehlB,EAAMsD,GAE/B,GAEImG,GAFAzK,EAAOF,EAAWC,YAAY2B,UAI9B1B,GAAKP,OAAS,GAAKqD,EAAS9C,EAAKA,EAAKP,OAAS,KAEjDgL,EAAIzK,EAAKA,EAAKP,OAAS,GAEvBO,EAAOF,EAAWC,YAAYC,EAAK4a,MAAM,EAAG5a,EAAKP,OAAS,KAEnDuB,YAAgBd,GAEvBuK,EAAIzJ,EAAKiG,UAED1H,EAAQyB,IAA2B,WAAlB5E,EAAOqC,SAEhCgM,EAAI,UAIN,IAAIgyB,IAAc,CAElBz8B,GAAOA,EAAKzC,IAAI,SAAU8D,GASxB,GAPIA,YAAiBsX,KAEnB8jB,GAAc,EAEdp7B,EAAQA,EAAMsC,aAGX3B,EAASX,KAAWmF,EAAUnF,IAAkB,EAARA,EAC3C,KAAM,IAAIpD,OAAM,uDAElB,OAAOoD,IAIT,IAAIgG,GAAeo1B,EAAc,GAAI9jB,GAAU,GAAK,CAGpD,IAAIlO,EAAG,CAEL,GAAIzO,GAAIK,EAAKoC,OAAOgM,EAEpB,OAAIzK,GAAKP,OAAS,EAETzD,EAAEwL,OAAOxH,EAAMqH,GAEjBrL,EAGT,GAAI4E,KAEJ,OAAIZ,GAAKP,OAAS,EAETQ,EAAMuH,OAAO5G,EAAKZ,EAAMqH,GAE1BzG,KAON,SAASvF,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GA4J/B,QAASsgC,GAAQz3B,EAAOC,EAAKC,GAC3B,GAAIlF,MACAK,EAAI2E,CACR,IAAIE,EAAO,EACT,KAAWD,EAAJ5E,GACLL,EAAM3B,KAAKgC,GACXA,GAAK6E,MAGJ,IAAW,EAAPA,EACP,KAAO7E,EAAI4E,GACTjF,EAAM3B,KAAKgC,GACXA,GAAK6E,CAIT,OAAOlF,GAWT,QAAS08B,GAAW13B,EAAOC,EAAKC,GAC9B,GAAIlF,MACAK,EAAI2E,CACR,IAAIE,EAAO,EACT,KAAYD,GAAL5E,GACLL,EAAM3B,KAAKgC,GACXA,GAAK6E,MAGJ,IAAW,EAAPA,EACP,KAAO7E,GAAK4E,GACVjF,EAAM3B,KAAKgC,GACXA,GAAK6E,CAIT,OAAOlF,GAWT,QAAS28B,GAAW33B,EAAOC,EAAKC,GAC9B,GAAIlF,MACAK,EAAI2E,EACJwsB,EAAO,GAAI9Y,GAAU,EACzB,IAAIxT,EAAK03B,GAAGpL,GACV,KAAOnxB,EAAEiX,GAAGrS,IACVjF,EAAM3B,KAAKgC,GACXA,EAAIA,EAAE61B,KAAKhxB,OAGV,IAAIA,EAAKoS,GAAGka,GACf,KAAOnxB,EAAEu8B,GAAG33B,IACVjF,EAAM3B,KAAKgC,GACXA,EAAIA,EAAE61B,KAAKhxB,EAIf,OAAOlF,GAWT,QAAS68B,GAAc73B,EAAOC,EAAKC,GACjC,GAAIlF,MACAK,EAAI2E,EACJwsB,EAAO,GAAI9Y,GAAU,EACzB,IAAIxT,EAAK03B,GAAGpL,GACV,KAAOnxB,EAAEy8B,IAAI73B,IACXjF,EAAM3B,KAAKgC,GACXA,EAAIA,EAAE61B,KAAKhxB,OAGV,IAAIA,EAAKoS,GAAGka,GACf,KAAOnxB,EAAE08B,IAAI93B,IACXjF,EAAM3B,KAAKgC,GACXA,EAAIA,EAAE61B,KAAKhxB,EAIf,OAAOlF,GAYT,QAAS4iB,GAAQ3f,GACf,GAAIlD,GAAOkD,EAAImC,MAAM,KACjBC,EAAO,IAEX,IAAsB,cAAlBlJ,EAAOsC,OAET,IACE4G,EAAOtF,EAAKzC,IAAI,SAAUoE,GACxB,MAAO,IAAIgX,GAAUhX,KAGzB,MAAO8G,GACL,MAAO,UAGN,CAEHnD,EAAOtF,EAAKzC,IAAI,SAAUoE,GAExB,MAAOyB,QAAOzB,IAGhB,IAAI4D,GAAUD,EAAKE,KAAK,SAAUC,GAChC,MAAOC,OAAMD,IAEf,IAAGF,EACD,MAAO,MAIX,OAAQD,EAAK7F,QACX,IAAK,GACH,OACEwF,MAAOK,EAAK,GACZJ,IAAKI,EAAK,GACVH,KAAM,EAGV,KAAK,GACH,OACEF,MAAOK,EAAK,GACZJ,IAAKI,EAAK,GACVH,KAAMG,EAAK,GAGf,SACE,MAAO,OAxTb,GAAIlF,GAAO1E,EAAoB,KAE3Bid,EAAYtc,EAAKM,KAAKgc,UAItBoV,GAHS1xB,EAAKM,KAAKuD,OACN7D,EAAKyD,WAENM,EAAK,WAAW2tB,WAC5BjrB,EAAW1C,EAAK2C,OAAOD,SACvBd,EAAW5B,EAAK1B,OAAOsD,QA6C3B3F,GAAKsB,MAAQ,SAAeqC,GAC1B,GACIiF,GACAC,EACAC,EAHAuZ,EAASpf,MAAMyE,UAAU6W,MAAM7e,KAAK2F,WAIpCu7B,GAAa,CAOjB,QAJIlP,EAAUrP,EAAOA,EAAOjf,OAAS,MACnCw9B,EAAave,EAAOwe,OAAQ,GAAO,GAG7Bxe,EAAOjf,QACb,IAAK,GAGH,IAAIqD,EAAS4b,EAAO,IAWlB,KAAM,IAAIzc,WAAU,qEAVpB,IAAIH,GAAI+gB,EAAOnE,EAAO,GACtB,KAAK5c,EACH,KAAM,IAAIL,aAAY,WAAaid,EAAO,GAAK,sBAGjDzZ,GAAQnD,EAAEmD,MACVC,EAAMpD,EAAEoD,IACRC,EAAOrD,EAAEqD,IAKX,MAEF,KAAK,GAGHF,EAAQyZ,EAAO,GACfxZ,EAAMwZ,EAAO,GACbvZ,EAAO,CACP,MAEF,KAAK,GAEHF,EAAQyZ,EAAO,GACfxZ,EAAMwZ,EAAO,GACbvZ,EAAOuZ,EAAO,EACd,MAEF,KAAK,GACH,KAAM,IAAIzc,WAAU,yCAEtB,SACE,KAAM,IAAI5F,GAAKwC,MAAMmc,eAAe,QAAStZ,UAAUjC,OAAQ,EAAG,GAItE,KAAKuC,EAASiD,IAAYA,YAAiB0T,IACzC,KAAM,IAAI1W,WAAU,mCAEtB,MAAKD,EAASkD,IAAUA,YAAeyT,IACrC,KAAM,IAAI1W,WAAU,iCAEtB,MAAKD,EAASmD,IAAWA,YAAgBwT,IACvC,KAAM,IAAI1W,WAAU,kCAItB,IAAIgD,YAAiB0T,IAAazT,YAAeyT,IAAaxT,YAAgBwT,GAAW,CAEvF,GAAI8jB,IAAc,CAGZx3B,aAAiB0T,KAAY1T,EAAQ0T,EAAUE,QAAQ5T,IACvDC,YAAeyT,KAAczT,EAAQyT,EAAUE,QAAQ3T,IACvDC,YAAgBwT,KAAaxT,EAAQwT,EAAUE,QAAQ1T,IAEvDF,YAAiB0T,IAAgBzT,YAAeyT,IAAgBxT,YAAgBwT,KAGpF8jB,GAAc,EACVx3B,YAAiB0T,KAAW1T,EAAQA,EAAMtB,YAC1CuB,YAAeyT,KAAazT,EAAQA,EAAIvB,YACxCwB,YAAgBwT,KAAYxT,EAAQA,EAAKxB,aAKjD,GAAI8a,GAAKge,EACJQ,EAAaH,EAAeF,EAC5BK,EAAaN,EAAeD,EAC7Bz8B,EAAQwe,EAAGxZ,EAAOC,EAAKC,EAG3B,OAA0B,UAAlB/I,EAAOqC,OAAsBwB,EAAQ5D,EAAKoC,OAAOwB,MAiLxD,SAAS5E,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GAiG/B,QAAS+gC,GAAcj6B,EAAKlC,EAAMo8B,GAChC,GAAoBp3B,SAAhBo3B,GACF,IAAKt6B,EAASs6B,IAAuC,IAAvBA,EAAY39B,OACxC,KAAM,IAAIwC,WAAU,iDAItBm7B,GAAc,GAGhB,IAAoB,IAAhBp8B,EAAKvB,OACP,KAAM,IAAIpD,GAAKwC,MAAMiC,eAAeE,EAAKvB,OAAQ,EAEnD,IAAIoB,GAAMG,EAAK,EACf,KAAKgB,EAASnB,KAAS2F,EAAU3F,GAC/B,KAAM,IAAIoB,WAAU,uDACJc,EAAOuB,OAAOtD,GAAQ,IAGxC,IAAIkC,EAAIzD,OAASoB,EACf,MAAOqC,GAAIK,UAAU,EAAG1C,EAErB,IAAIqC,EAAIzD,OAASoB,EAAK,CAEzB,IAAK,GADDD,GAAMsC,EACDhE,EAAI,EAAGkC,EAAKP,EAAMqC,EAAIzD,OAAY2B,EAAJlC,EAAQA,IAC7C0B,GAAOw8B,CAET,OAAOx8B,GAGP,MAAOsC,GA9HX,GAAI9C,GAAO1E,EAAoB,KAE3Bid,EAAYtc,EAAKM,KAAKgc,UACtBzY,EAAS7D,EAAKM,KAAKuD,OAEnBD,EAAQG,EAAKH,MACbkE,EAAQ/D,EAAKwF,OAAOzB,MACpBpB,EAAS3C,EAAK2C,OACdD,EAAW1C,EAAK2C,OAAOD,SACvBd,EAAW5B,EAAK1B,OAAOsD,SACvBwE,EAAYpG,EAAK1B,OAAO8H,UACxBjH,EAAUU,EAAMV,OA4BpBlD,GAAKmL,OAAS,SAAiBlH,EAAGU,EAAMqG,GACtC,GAAwB,GAApB3F,UAAUjC,QAAmC,GAApBiC,UAAUjC,OACrC,KAAM,IAAIpD,GAAKwC,MAAMmc,eAAe,SAAUtZ,UAAUjC,OAAQ,EAAG,EAerE,IAZIuB,YAAgBd,KAClBc,EAAOA,EAAKb,WAGVa,EAAKvB,QAAUuB,EAAK,YAAc2X,KAEpC3X,EAAOA,EAAKzD,IAAI,SAAU8D,GACxB,MAAQA,aAAiBsX,GAAatX,EAAMsC,WAAatC,KAKzDf,YAAaJ,GAEf,MAAOI,GAAEkH,OAAOxG,EAAMqG,GAAc,EAGtC,IAAIvE,EAASxC,GAEX,MAAO68B,GAAc78B,EAAGU,EAAMqG,EAIhC,IAAI6yB,GAAW36B,EAAQe,IAAK,EAA2B,UAAlBlE,EAAOqC,MAE5C,IAAmB,GAAfuC,EAAKvB,OAAa,CAEpB,KAAOF,EAAQe,IACbA,EAAIA,EAAE,EAGR,OAAO6D,GAAM7D,GAIRf,EAAQe,KACXA,GAAKA,IAEPA,EAAI6D,EAAM7D,EAEV,IAAIM,GAAMX,EAAMuH,OAAOlH,EAAGU,EAAMqG,EAChC,OAAO6yB,GAAW79B,EAAKoC,OAAOmC,GAAOA,KAiDtC,SAASvF,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAII,GAAST,EAAKtC,EAAoB,IAyBtC,OAAO2C,GAAM,QACX6B,OAAU,SAAUI,GAElB,MAAO7B,GAAO6B,EAAEU,SAGlB1B,MAASW,EAAMe,KAEf+B,OAAU,SAAUzC,GAClB,MAA0B,UAAlBlE,EAAOqC,QAAuB6B,EAAEb,QAAUhB,GAAQ6B,EAAEb,UAG9D49B,uDAAwD,SAAU/8B,GAEhE,MAA0B,UAAlBlE,EAAOqC,UAA2BA,SA1ChD,GAAIwB,GAAQvE,EAAoB,IA+ChCN,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAII,GAAST,EAAKtC,EAAoB,IA+BtC,OAAO2C,GAAM,WACXiB,MAAS,SAAUgB,GACjB,MAAOL,GAAMgmB,QAAQrgB,EAAOzB,MAAM7D,KAGpCJ,OAAU,SAAUI,GAClB,GAAIM,GAAMX,EAAMgmB,QAAQ3lB,EAAE4F,UAE1B,OAAO5G,OAAMC,QAAQqB,GAAOnC,EAAOmC,GAAOA,GAG5Cq4B,IAAO,SAAU34B,GAEf,MAAOsF,GAAOzB,MAAM7D,MAhD1B,GAAIsF,GAASlK,EAAoB,KAC7BuE,EAAQvE,EAAoB,IAoDhCN,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GAoE/B,QAASkhC,GAAWj8B,EAAO/D,GACzB,GAAItB,GAAG4B,CAEP,IAAI2B,EAAQ8B,GAGV,MAFArF,GAAIK,EAAKoC,OAAO4C,GAChBzD,EAAS5B,EAAE4B,OAAON,GACXM,GAAUA,EAAOuC,SAErB,IAAIkB,YAAiBnB,GACxB,MAAOmB,GAAMzD,OAAON,EAEjB,IAAIwF,EAASzB,GAChB,MAAOk8B,GAAcl8B,EAAO/D,EAG5B,MAAM,IAAIjB,GAAKwC,MAAM4vB,qBAAqB,SAAUpyB,EAAK,UAAUgF,IAWvE,QAASk8B,GAAcr6B,EAAK5F,GAC1B,KAAMA,YAAiBR,IAErB,KAAM,IAAImF,WAAU,iBAEtB,IAA2B,GAAvB3E,EAAM0D,OAAOvB,OACf,KAAM,IAAIpD,GAAKwC,MAAMiC,eAAexD,EAAM0D,OAAOvB,OAAQ,EAI3D,IAAI+9B,GAASt6B,EAAIzD,MACjBQ,GAAMypB,cAAcpsB,EAAMI,MAAM,GAAI8/B,GACpCv9B,EAAMypB,cAAcpsB,EAAME,MAAM,GAAIggC,EAEpC,IAAI7/B,GAAQL,EAAMK,MAAM,GAEpB8/B,EAAS,EAKb,OAJA9/B,GAAMN,QAAQ,SAAUksB,GACtBkU,GAAUv6B,EAAIX,OAAOgnB,KAGhBkU,EAeT,QAASC,GAAWr8B,EAAO/D,EAAO8J,EAAaC,GAC7C,GAAIrL,EAEJ,IAAIuD,EAAQ8B,GAGV,MAFArF,GAAIK,EAAKoC,OAAOpC,EAAK8H,MAAM9C,IAC3BrF,EAAE4B,OAAON,EAAO8J,EAAaC,GACtBrL,EAAEmE,SAEN,IAAIkB,YAAiBnB,GACxB,MAAOmB,GAAM8C,QAAQvG,OAAON,EAAO8J,EAAaC,EAE7C,IAAIvE,EAASzB,GAChB,MAAOs8B,GAAct8B,EAAO/D,EAAO8J,EAAaC,EAGhD,MAAM,IAAIhL,GAAKwC,MAAM4vB,qBAAqB,SAAUpyB,EAAK,UAAUgF,IAcvE,QAASs8B,GAAcz6B,EAAK5F,EAAO8J,EAAaC,GAC9C,KAAM/J,YAAiBR,IAErB,KAAM,IAAImF,WAAU,iBAEtB,IAA2B,GAAvB3E,EAAM0D,OAAOvB,OACf,KAAM,IAAIpD,GAAKwC,MAAMiC,eAAexD,EAAM0D,OAAOvB,OAAQ,EAE3D,IAAqBuG,SAAjBqB,GACF,IAAKvE,EAASuE,IAAyC,IAAxBA,EAAa5H,OAC1C,KAAM,IAAIwC,WAAU,iDAItBoF,GAAe,GAGjB,IAAI1J,GAAQL,EAAMK,MAAM,GACpBkD,EAAMlD,EAAMqD,OAAO,EAEvB,IAAIH,GAAOuG,EAAY3H,OACrB,KAAM,IAAIpD,GAAKwC,MAAMiC,eAAenD,EAAMqD,OAAO,GAAIoG,EAAY3H,OAInE,IAAI+9B,GAASt6B,EAAIzD,MACjBQ,GAAMypB,cAAcpsB,EAAMI,MAAM,IAChCuC,EAAMypB,cAAcpsB,EAAME,MAAM,GAIhC,KAAK,GADDogC,MACK1+B,EAAI,EAAOs+B,EAAJt+B,EAAYA,IAC1B0+B,EAAM1+B,GAAKgE,EAAIX,OAAOrD,EAQxB,IALAvB,EAAMN,QAAQ,SAAUksB,EAAGrqB,GACzB0+B,EAAMrU,GAAKniB,EAAY7E,OAAOrD,KAI5B0+B,EAAMn+B,OAAS+9B,EACjB,IAAKt+B,EAAIs+B,EAAS,EAAG38B,EAAM+8B,EAAMn+B,OAAYoB,EAAJ3B,EAASA,IAC3C0+B,EAAM1+B,KACT0+B,EAAM1+B,GAAKmI,EAKjB,OAAOu2B,GAAM72B,KAAK,IA7MpB,GAAI3G,GAAO1E,EAAoB,KAE3BwE,EAAS7D,EAAKM,KAAKuD,OACnBpD,EAAQpB,EAAoB,GAE5BuE,EAAQG,EAAKH,MACb6C,EAAW1C,EAAK2C,OAAOD,SACvBvD,EAAUD,MAAMC,OAoCpBlD,GAAKuB,OAAS,SAAiBa,EAAQnB,EAAO8J,EAAaC,GACzD,OAAQ3F,UAAUjC,QAChB,IAAK,GACH,MAAO69B,GAAW57B,UAAU,GAAIA,UAAU,GAG5C,KAAK,GACL,IAAK,GACH,MAAOg8B,GAAWh8B,UAAU,GAAIA,UAAU,GAAIA,UAAU,GAAIA,UAAU,GAExE,SACE,KAAM,IAAIrF,GAAKwC,MAAMmc,eAAe,SAAUtZ,UAAUjC,OAAQ,EAAG,OA8JtE,SAASpE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClCgoB,EAAM1lB,EAAKtC,EAAoB,KA6B/BwqB,EAAQ7nB,EAAM,SAEhBiB,MAAS,SAAUgB,GAEjB,MAAO4lB,GAAMznB,EAAO6B,KAGtBJ,OAAU,SAAUI,GAElB,GAAIrE,EAEJ,QAAQqE,EAAE2G,WACR,IAAK,QACHhL,EAAI4hC,EAAYv9B,EAChB,MACF,KAAK,SACHrE,EAAI6hC,EAAax9B,GAGrB,MAAOrE,IAGTg9B,IAAO90B,IAGL05B,EAAc,SAAU7hC,GAE1B,GAAIgF,GAAOhF,EAAEid,MACT2P,EAAO5sB,EAAEmwB,KAGb,QAAQnrB,EAAKvB,QACX,IAAK,GAEH,GAAe,GAAXuB,EAAK,GAEP,MAAOmD,GAAMykB,EAAK,GAEpB,MAAM,IAAI2H,YAAW,gCAAkCjsB,EAAOtD,GAAQ,IACxE,KAAK,GAEH,GAAIigB,GAAOjgB,EAAK,GACZkgB,EAAOlgB,EAAK,EAChB,IAAIigB,IAASC,EAAM,CAIjB,IAAK,GAFDkG,GAAM,EAEDloB,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IACxBkoB,EAAM1D,EAAI0D,EAAKwB,EAAK1pB,GAAGA,GAEzB,OAAOkoB,GAET,KAAM,IAAImJ,YAAW,gCAAkCjsB,EAAOtD,GAAQ,IACxE,SAEE,KAAM,IAAIuvB,YAAW,yCAA2CjsB,EAAOtD,GAAQ,OAIjF88B,EAAe,SAAU9hC,GAE3B,GAAI2K,GAAS3K,EAAE+sB,QACXzrB,EAAQtB,EAAEgtB,OACVF,EAAM9sB,EAAEitB,KACRjoB,EAAOhF,EAAEid,MAETgI,EAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,EAEnB,IAAIigB,IAASqI,EAAS,CAEpB,GAAIlC,GAAM,CAEV,IAAIzgB,EAAOlH,OAAS,EAElB,IAAK,GAAIC,GAAI,EAAO4pB,EAAJ5pB,EAAaA,IAK3B,IAAK,GAHDkrB,GAAK9B,EAAIppB,GACTmrB,EAAK/B,EAAIppB,EAAI,GAERoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5B,GAAI5K,GAAI5B,EAAMwM,EAEd,IAAI5K,IAAMQ,EAAG,CAEX0nB,EAAM1D,EAAI0D,EAAKzgB,EAAOmD,GAEtB,OAEF,GAAI5K,EAAIQ,EAEN,MAMR,MAAO0nB,GAET,KAAM,IAAImJ,YAAW,gCAAkCjsB,EAAOtD,GAAQ,KAGxE,OAAOklB,GA1IT,GAAI/hB,GAAQzI,EAAoB,KAAKyI,MACjCG,EAAS5I,EAAoB,KAAK4I,MA4ItClJ,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAElCwwB,EAAcvvB,EAAKuvB,YACnBvD,EAAehsB,EAAKgsB,aAsBpBxC,EAAY9nB,EAAM,aAEpBiB,MAAS,SAAUgB,GAEjB,MAAO6lB,GAAU1nB,EAAO6B,IAAIH,WAG9BD,OAAU,SAAUI,GAElB,GAGIrE,GAHA+E,EAAOV,EAAEU,MAMb,QAAQA,EAAKvB,QACX,IAAK,GAEHxD,EAAIqE,EAAE6D,OACN,MAEF,KAAK,GAEH,GAAI8c,GAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,EAGnB,IAAgB,IAAZsoB,EAEF,KAAM,IAAIiH,YAAW,uDAAyDjsB,EAAOtD,GAAQ,IAI/F,QAAQV,EAAE2G,WACR,IAAK,QACHhL,EAAI8hC,EAAgBz9B,EAAG2gB,EAAMqI,EAC7B,MACF,KAAK,SACHrtB,EAAI+hC,EAAiB19B,EAAG2gB,EAAMqI,GAGlC,KAEF,SAEE,KAAM,IAAIiH,YAAW,qDAAuDjsB,EAAO9I,KAAKyd,OAAS,KAErG,MAAOhd,IAITg9B,IAAO,SAAU34B,GACf,MAAO6D,GAAM7D,MAIby9B,EAAkB,SAAU/hC,EAAGilB,EAAMqI,GAOvC,IAAK,GAFD2U,GAHArV,EAAO5sB,EAAEmwB,MAET+R,KAGKx+B,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAEhCu+B,EAAgBC,EAAWx+B,KAE3B,KAAK,GAAIR,GAAI,EAAO+hB,EAAJ/hB,EAAUA,IAExB++B,EAAc/+B,GAAKiF,EAAMykB,EAAK1pB,GAAGQ,IAIrC,MAAO,IAAIwsB,IACTtD,KAAMsV,EACNl9B,MAAOsoB,EAASrI,MAIhB+c,EAAmB,SAAUhiC,EAAGilB,EAAMqI,GAWxC,IAAK,GATD3iB,GAAS3K,EAAE+sB,QACXzrB,EAAQtB,EAAEgtB,OACVF,EAAM9sB,EAAEitB,KAERkH,KACAC,KACAC,KAEAI,EAAI,GAAInxB,OAAM2hB,GACT3gB,EAAI,EAAO2gB,EAAJ3gB,EAAUA,IACxBmwB,EAAEnwB,GAAK,CAET,IAAIpE,GAAG2T,EAAGnQ,CAEV,KAAKxD,EAAI,EAAG2T,EAAIvS,EAAMmC,OAAYoQ,EAAJ3T,EAAOA,IAEnCu0B,EAAEnzB,EAAMpB,KAKV,KAAK,GAFDkrB,GAAM,EAEDloB,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IAExBmxB,EAAK/xB,KAAK8oB,GAEVA,GAAOqJ,EAAEvxB,GAETuxB,EAAEvxB,GAAKmxB,EAAKnxB,EAKd,KAFAmxB,EAAK/xB,KAAK8oB,GAEL1nB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAEvB,IAAK,GAAIkrB,GAAK9B,EAAIppB,GAAImrB,EAAK/B,EAAIppB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE1D,GAAIquB,GAAI1H,EAAEnzB,EAAMwM,KAEhBsmB,GAAO+H,GAAKz4B,EACZywB,EAAQgI,GAAKh0B,EAAMwC,EAAOmD,IAI9B,MAAO,IAAI6e,IACThiB,OAAQwpB,EACR7yB,MAAO8yB,EACPtH,IAAKuH,EACLrvB,MAAOsoB,EAASrI,KAIpB,OAAOkF,GAlKT,GAAIhiB,GAAQzI,EAAoB,KAAKyI,MACjCG,EAAS5I,EAAoB,KAAK4I,MAoKtClJ,GAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GAC/B,GAAIgE,GAAO1E,EAAoB,KAE3Bid,EAAYtc,EAAKM,KAAKgc,UACtBzY,EAAS7D,EAAKM,KAAKuD,OACnBJ,EAAazD,EAAKyD,WAElBG,EAAQG,EAAKH,MACb+B,EAAW5B,EAAK1B,OAAOsD,SACvBwE,EAAYpG,EAAK1B,OAAO8H,UACxB1D,EAAW1C,EAAK2C,OAAOD,SACvBvD,EAAUD,MAAMC,OAiCpBlD,GAAK+pB,MAAQ,SAAgBplB,GAE3B,GAEIyJ,GAFAzK,EAAOF,EAAWC,YAAY2B,UAI9B1B,GAAKP,OAAS,GAAKqD,EAAS9C,EAAKA,EAAKP,OAAS,KAEjDgL,EAAIzK,EAAKA,EAAKP,OAAS,GAEvBO,EAAOF,EAAWC,YAAYC,EAAK4a,MAAM,EAAG5a,EAAKP,OAAS,KAEnDuB,YAAgBd,GAEvBuK,EAAIzJ,EAAKiG,UAED1H,EAAQyB,IAA2B,WAAlB5E,EAAOqC,SAEhCgM,EAAI,UAIN,IAAIgyB,IAAc,CAElBz8B,GAAOA,EAAKzC,IAAI,SAAU8D,GASxB,GAPIA,YAAiBsX,KAEnB8jB,GAAc,EAEdp7B,EAAQA,EAAMsC,aAGX3B,EAASX,KAAWmF,EAAUnF,IAAkB,EAARA,EAC3C,KAAM,IAAIpD,OAAM,uDAElB,OAAOoD,IAIT,IAAIgG,GAAeo1B,EAAc,GAAI9jB,GAAU,GAAK,CAGpD,IAAIlO,EAAG,CAEL,GAAIzO,GAAIK,EAAKoC,OAAOgM,EAEpB,OAAIzK,GAAKP,OAAS,EAETzD,EAAEwL,OAAOxH,EAAMqH,GAEjBrL,EAGT,GAAI4E,KAEJ,OAAIZ,GAAKP,OAAS,EAETQ,EAAMuH,OAAO5G,EAAKZ,EAAMqH,GAE1BzG,KAON,SAASvF,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAwBpC,MAAOA,GAAM,gBACXuzB,iBAAkB,SAAUpnB,EAAGV,GAC7B,GAAItM,GAAK2gC,EAAQj/B,CAEjB,KAAKsH,EAAUgE,IAAU,EAAJA,EACnB,KAAM,IAAIvI,WAAU,2DAEtB,IAAI6H,EAAIU,EACN,KAAM,IAAIvI,WAAU,oCAKtB,KAFAzE,EAAMoG,KAAKpG,IAAIsM,EAAGU,EAAIV,GACtBq0B,EAAS,EACJj/B,EAAI,EAAQsL,EAAIhN,GAAT0B,EAAcA,IACxBi/B,EAASA,GAAU3gC,EAAM0B,GAAKA,CAGhC,OAAOi/B,IAGTrM,uBAAwB,SAAUtnB,EAAGV,GACnC,GAAItM,GAAK2gC,EAAQj/B,EAAGkC,EAChBy0B,EAAM,GAAIl5B,GAAKgc,UAAU,EAE7B,KAAKylB,EAAkB5zB,KAAO4zB,EAAkBt0B,GAC9C,KAAM,IAAI7H,WAAU,2DAEtB,IAAI6H,EAAE+yB,GAAGryB,GACP,KAAM,IAAIvI,WAAU,iDAMtB,KAHAzE,EAAMgN,EAAEsjB,MAAMhkB,GACVA,EAAEyN,GAAG/Z,KAAMA,EAAMsM,GACrBq0B,EAAStI,EACJ32B,EAAI22B,EAAKz0B,EAAKoJ,EAAEsjB,MAAMtwB,GAAM0B,EAAE69B,IAAI37B,GAAKlC,EAAIA,EAAEi3B,KAAK,GACrDgI,EAASA,EAAOlN,MAAMzzB,EAAI24B,KAAKj3B,IAAIm/B,UAAUn/B,EAG/C,OAAOi/B,MAYb,QAASC,GAAkB5zB,GACzB,MAAOA,GAAEhE,aAAegE,EAAEwyB,IAAI,GA7EhC,GAAIx2B,GAAY9K,EAAoB,KAAK8K,SAgFzCpL,GAAQkG,KAAO,eACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtC6qB,EAAQvoB,EAAKtC,EAAoB,MAwBjC4qB,EAAYjoB,EAAM,aACpBK,OAAU,SAAU8L,GAClB,MAAIA,KAAMpH,OAAO2xB,kBACTnxB,KAAKK,KAAK,EAAIL,KAAKyf,IAGpBkD,EAAM/b,EAAI,IAGnBmO,UAAa,SAAUnO,GACrB,MAAKA,GAAEurB,YAAevrB,EAAE8mB,aAIjB/K,EAAM/b,EAAE2rB,KAAK,IAHX7Q,EAAU9B,IAAIpnB,EAAOuC,WAAWsF,QAM3C2qB,iBAAkB,SAAUpkB,GAC1B,MAAO1K,GAAWS,QAAQiK,EAAG8b,KAIjC,OAAOA,GAlDT,GAAIhB,GAAY5pB,EAAoB,IAqDpCN,GAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAuJpC,QAASigC,GAAa9zB,GACpB,GAAInJ,GAAOT,EAAK29B,EAEZ94B,EAAM+E,EAAE7G,UACZ,IAAI8B,EAAM+4B,EAAa/+B,OACrB,MAAO,IAAI9C,GAAKgc,UAAU6lB,EAAa/4B,IAAMg5B,KAAKriC,EAAOuC,UAI3D,IAAIA,GAAYvC,EAAOuC,WAA6B,EAAhBiF,KAAK0F,IAAI7D,IACzCo2B,EAAMl/B,EAAKgc,UAAUzR,aAAavI,UAAWA,GAIjD,IADA8G,GAAO+4B,EAAa/+B,OAChB8+B,EAAcG,EAAW//B,GAAY,CACvC,GAAI4/B,EAAY94B,GACd,MAAO,IAAI9I,GAAKgc,UAAU4lB,EAAY94B,GAAKk5B,YAAYviC,EAAOuC,WAEhEiC,GAAM29B,EAAYA,EAAY9+B,OAAO,OAErC8+B,GAAcG,EAAW//B,MACzBiC,EAAM,GAAIi7B,GAAI2C,EAAaA,EAAa/+B,OAAO,IAC1Cg/B,KAAK9/B,EAGZ,IAAIk3B,GAAM,GAAIgG,GAAI,EAClBx6B,GAAQ,GAAIw6B,GAAI0C,EAAY9+B,OAAS++B,EAAa/+B,OAClD,KAAK,GAAIP,GAAIq/B,EAAY9+B,OAAYgG,EAAJvG,IAAWA,EAC1Cq/B,EAAYr/B,GAAK0B,EAAMA,EAAIqwB,MAAM5vB,GACjCA,EAAQA,EAAM80B,KAAKN,EAIrB,OADA0I,GAAY94B,GAAO7E,EAAIqwB,MAAM5vB,GACtB,GAAI1E,GAAKgc,UAAU4lB,EAAY94B,GAAKk5B,YAAYviC,EAAOuC,YAvLhE,GAAImB,GAAa9B,EAAKtC,EAAoB,IACtC2oB,EAAarmB,EAAKtC,EAAoB,KACtCgJ,EAAa1G,EAAKtC,EAAoB,KAyBtC6qB,EAAQloB,EAAM,SAChBK,OAAU,SAAU8L,GAClB,GAAI2nB,GAAG7xB,CAEP,IAAIkG,EAAUgE,GAAI,CAChB,GAAS,GAALA,EACF,MAAOurB,UAASvrB,GAAKo0B,EAAAA,EAAWzb,EAAAA,CAGlC,IAAI3Y,EAAI,IACN,MAAOo0B,GAAAA,CAKT,KAFA,GAAIv9B,GAAQmJ,EAAI,EACZ5J,EAAM4J,EAAI,EACPnJ,EAAQ,GACbT,GAAOS,EACPA,GAOF,OAJW,IAAPT,IACFA,EAAM,GAGDA,EAGT,GAAQ,GAAJ4J,EACF,MAAO5G,MAAKyf,IAAMzf,KAAKE,IAAIF,KAAKyf,GAAK7Y,GAAK+b,EAAM,EAAE/b,GAGpD,IAAIA,GAAK,OACP,MAAOo0B,GAAAA,CAGT,IAAIp0B,EAAI,GAAM,CACZ,GAAIq0B,GAAOr0B,EAAEA,EACTs0B,EAASD,EAAKr0B,EACdu0B,EAAQD,EAAOt0B,EACfw0B,EAAQD,EAAMv0B,CAClB,OAAO5G,MAAKK,KAAK,EAAEL,KAAKyf,GAAG7Y,GAAK5G,KAAKc,IAAK8F,EAAE5G,KAAKuG,EAAIK,IAChD,EAAI,GAAG,GAAGA,GAAK,GAAG,IAAIq0B,GAAQ,KAAK,MAAMC,GAC1C,KAAK,QAAQC,GAAS,QAAQ,UAAUC,GACxC,SAAS,YAAYA,EAAMx0B,MAG/BA,EACFlK,EAAIpE,EAAE,EACN,KAAK,GAAIgD,GAAI,EAAGA,EAAIhD,EAAEuD,SAAUP,EAC9BoB,GAAKpE,EAAEgD,IAAMsL,EAAEtL,EAIjB,OADAizB,GAAI3nB,EAAImH,EAAI,GACL/N,KAAKK,KAAK,EAAEL,KAAKyf,IAAMzf,KAAKc,IAAIytB,EAAG3nB,EAAE,IAAO5G,KAAKogB,KAAKmO,GAAK7xB,GAGpE1D,QAAW,SAAU4N,GACnB,GAAI2nB,GAAG7xB,CAEP,IAAY,GAARkK,EAAEhJ,GACJ,MAAO+kB,GAAM/b,EAAEjJ,GAGjBiJ,GAAI,GAAI7N,GAAKC,QAAQ4N,EAAEjJ,GAAK,EAAGiJ,EAAEhJ,IACjClB,EAAI,GAAI3D,GAAKC,QAAQV,EAAE,GAAI,EAC3B,KAAK,GAAIgD,GAAI,EAAGA,EAAIhD,EAAEuD,SAAUP,EAAG,CACjC,GAAI+/B,GAAOz0B,EAAEjJ,GAAKrC,EACdggC,EAAMD,EAAKA,EAAOz0B,EAAEhJ,GAAGgJ,EAAEhJ,EAClB,IAAP09B,GACF5+B,EAAEiB,IAAMrF,EAAEgD,GAAK+/B,EAAOC,EACtB5+B,EAAEkB,MAAQtF,EAAEgD,GAAKsL,EAAEhJ,IAAM09B,GAEzB5+B,EAAEiB,GAAKrF,EAAEgD,GAAK,IACP0/B,EAAAA,GACAA,EAAAA,EAIXzM,EAAI,GAAIx1B,GAAKC,QAAQ4N,EAAEjJ,GAAKoQ,EAAI,GAAKnH,EAAEhJ,GACvC,IAAI29B,GAAYv7B,KAAKK,KAAK,EAAEL,KAAKyf,GAEjC7Y,GAAEjJ,IAAM,EACR,IAAI48B,GAASz5B,EAAIytB,EAAG3nB,EACH,IAAb2zB,EAAO38B,GACT28B,EAAO58B,IAAM49B,EACS,GAAbhB,EAAO58B,GAChB48B,EAAO38B,IAAM29B,GAEbhB,EAAO58B,IAAM49B,EACbhB,EAAO38B,IAAM29B,EAGf,IAAIr9B,GAAI8B,KAAKogB,KAAKmO,EAAE5wB,GAIpB,OAHA4wB,GAAE5wB,GAAKO,EAAI8B,KAAKC,KAAKsuB,EAAE3wB,IACvB2wB,EAAE3wB,GAAKM,EAAI8B,KAAKE,KAAKquB,EAAE3wB,IAEhB6iB,EAASA,EAAS8Z,EAAQhM,GAAI7xB,IAGvCqY,UAAa,SAAUnO,GACrB,GAAIA,EAAEhE,YACJ,MAAQgE,GAAE8mB,cAAgB9mB,EAAEknB,SACtB,GAAI/0B,GAAKgc,UAAUimB,EAAAA,GACnBN,EAAa9zB,EAAEsjB,MAAM,GAG7B,KAAKtjB,EAAEurB,WACL,MAAO,IAAIp5B,GAAKgc,UAAUnO,EAAE8mB,aAAenO,EAAAA,EAAMyb,EAAAA,EAGnD,MAAM,IAAI3gC,OAAM,+BAGlB2wB,iBAAkB,SAAUpkB,GAC1B,MAAO1K,GAAWS,QAAQiK,EAAG+b,KA6CjC,OAAOA,GA7LT,GAAI/f,GAAY9K,EAAoB,KAAK8K,UAkMrCmL,EAAI,UAEJzV,GACF,kBACA,kBACA,mBACA,oBACC,kBACD,qBACA,sBACC,qBACD,sBACC,sBACD,uBACC,qBACD,sBACC,sBACD,uBAIEwiC,KAGAF,GACF,EACA,EACA,EACA,EACA,GACA,IACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,kBACA,kBAGFpjC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIioB,GAAYtoB,EAAKtC,EAAoB,KA2BzC,OAAO2C,GAAM,gBACXy9B,qBAAsBxV,EAEtBsL,iBAAkB,SAAUpnB,EAAGV,GAC7B,GAAIq0B,GAAQj/B,CAEZ,KAAKsH,EAAUgE,IAAU,EAAJA,EACnB,KAAM,IAAIvI,WAAU,2DAEtB,KAAKuE,EAAUsD,IAAU,EAAJA,EACnB,KAAM,IAAI7H,WAAU,2DAEtB,IAAI6H,EAAIU,EACN,KAAM,IAAIvI,WAAU,mEAKtB,KADAk8B,EAAS,EACJj/B,EAAIsL,EAAIV,EAAI,EAAQU,GAALtL,EAAQA,IAC1Bi/B,GAAkBj/B,CAGpB,OAAOi/B,IAGTrM,uBAAwB,SAAUtnB,EAAGV,GACnC,GAAIq0B,GAAQj/B,CAEZ,KAAKk/B,EAAkB5zB,KAAO4zB,EAAkBt0B,GAC9C,KAAM,IAAI7H,WAAU,2DAEtB,IAAI6H,EAAE+yB,GAAGryB,GACP,KAAM,IAAIvI,WAAU,mEAItB,KADAk8B,EAAS,GAAIxhC,GAAKgc,UAAU,GACvBzZ,EAAIsL,EAAEsjB,MAAMhkB,GAAGqsB,KAAK,GAAIj3B,EAAE69B,IAAIvyB,GAAItL,EAAIA,EAAEi3B,KAAK,GAChDgI,EAASA,EAAOlN,MAAM/xB,EAGxB,OAAOi/B,MAYb,QAASC,GAAkB5zB,GACzB,MAAOA,GAAEhE,aAAegE,EAAEwyB,IAAI,GAnFhC,GAAIx2B,GAAY9K,EAAoB,KAAK8K,SAsFzCpL,GAAQkG,KAAO,eACflG,EAAQD,QAAUA;;EAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAI+gC,GAAephC,EAAKtC,EAAoB,KAsB5C,OAAO0jC,GAAa,WAAW3Y,WAGjCrrB,EAAQkG,KAAO,aACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAI+gC,GAAephC,EAAKtC,EAAoB,KAiC5C,OAAO0jC,GAAa,WAAW1Y,OAGjCtrB,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAI+gC,GAAephC,EAAKtC,EAAoB,KAiC5C,OAAO0jC,GAAa,WAAWzY,UAGjCvrB,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAmCtCkrB,EAAUvoB,EAAM,WAClBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAOtK,KAAMsK,EAAI,EAAKtK,EAAIsK,EAAI,EAAI,IAGpCgnB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAQtK,KAAMsK,GAAK00B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,SAAY,EAAK0B,EAAIsK,EAAI,EAAI,IAG3EknB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAO,IAAItK,GAAE4G,YAAY5G,EAAEi3B,IAAI3sB,KAGjC6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,KAAM,IAAI3I,WAAU,wDAGtBy1B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAQqC,GAAEe,QAAUuJ,EAAEvJ,OAASi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,SAAY,EAAK0B,EAAEe,MAAQuJ,EAAEvJ,MAAQ,EAAI,IAG/Gk+B,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,KAAMsK,EAAI,EAAKtK,EAAIsK,EAAI,EAAI,IAGpCwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGgc,IAGnCyK,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGgc,KAIrC,OAAOA,GA3ET,GAAI0Y,GAAc5jC,EAAoB,KAAK4jC,WA8E3ClkC,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA2CpC,QAASmhC,GAAWl/B,EAAGsK,GACrB,GAAItL,MAAMC,QAAQe,GAAI,CACpB,GAAIhB,MAAMC,QAAQqL,GAAI,CACpB,GAAI/J,GAAMP,EAAEb,MACZ,IAAIoB,IAAQ+J,EAAEnL,OACZ,OAAO,CAGT,KAAK,GAAIP,GAAI,EAAO2B,EAAJ3B,EAASA,IACvB,IAAKsgC,EAAWl/B,EAAEpB,GAAI0L,EAAE1L,IACtB,OAAO,CAIX,QAAO,EAGP,OAAO,EAIT,MAAII,OAAMC,QAAQqL,IACT,EAGAwe,EAAM9oB,EAAGsK,GAnEtB,GACIwe,IADaprB,EAAKtC,EAAoB,IAC9BsC,EAAKtC,EAAoB,MA6BrC,OAAO2C,GAAM,aACX0wB,WAAY,SAAUzuB,EAAGsK,GACvB,MAAO40B,GAAWl/B,EAAEH,UAAWyK,EAAEzK,cAyCvC/E,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA4CtC0tB,EAAQ/qB,EAAM,SAChB0wB,WAAY,SAAUzuB,EAAGsK,GAEvB,MAAU,QAANtK,EAA2B,OAANsK,EACf,OAANA,EAA2B,OAANtK,EACf0F,SAAN1F,EAAgC0F,SAAN4E,EACpB5E,SAAN4E,EAAgC5E,SAAN1F,EAEvBm/B,EAAOn/B,EAAGsK,IAGnBwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG60B,IAGnCpO,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG60B,MAIjCA,EAASphC,EAAM,UACjBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAOtK,KAAMsK,GAGfgnB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,KAAMsK,GAAK00B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAG7CkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAE+tB,GAAGzjB,IAGd6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,OAAQtK,EAAEiB,KAAOqJ,EAAErJ,IAAM+9B,EAAYh/B,EAAEiB,GAAIqJ,EAAErJ,GAAInF,EAAOwC,YACnD0B,EAAEkB,KAAOoJ,EAAEpJ,IAAM89B,EAAYh/B,EAAEkB,GAAIoJ,EAAEpJ,GAAIpF,EAAOwC,WAGvD84B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAOqC,GAAEe,QAAUuJ,EAAEvJ,OAASi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAGrE2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,KAAMsK,IAIjB,OAAOwe,GAjGT,GAAIkW,GAAc5jC,EAAoB,KAAK4jC,WAoG3ClkC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAgCtCyd,EAAS9a,EAAM,UACjBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAOtK,GAAIsK,GAGbgnB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,GAAIsK,IAAM00B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAG5CkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAEu8B,GAAGjyB,IAGd6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,KAAM,IAAI3I,WAAU,wDAGtBy1B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAOqC,GAAEe,MAAQuJ,EAAEvJ,QAAUi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAGpE2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,GAAIsK,GAGbwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGuO,IAGnCkY,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGuO,KAIrC,OAAOA,GAxET,GAAImmB,GAAc5jC,EAAoB,KAAK4jC,WA2E3ClkC,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA4BtCorB,EAAWzoB,EAAM,YACnBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAOtK,IAAKsK,GAGdgnB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,IAAKsK,GAAK00B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAG5CkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAE08B,IAAIpyB,IAGf6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,KAAM,IAAI3I,WAAU,wDAGtBy1B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAOqC,GAAEe,OAASuJ,EAAEvJ,OAASi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAGpE2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,IAAKsK,GAGdwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGkc,IAGnCuK,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGkc,KAIrC,OAAOA,GApET,GAAIwY,GAAc5jC,EAAoB,KAAK4jC,WAuE3ClkC,GAAQkG,KAAO,WACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAgCtCwd,EAAU7a,EAAM,WAClBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAWA,GAAJtK,GAGTsxB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAWA,GAAJtK,IAAUg/B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAG5CkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAEiX,GAAG3M,IAGd6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,KAAM,IAAI3I,WAAU,wDAGtBy1B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAOqC,GAAEe,MAAQuJ,EAAEvJ,QAAUi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAGpE2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAWA,GAAJtK,GAGT8wB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsO,IAGnCmY,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGsO,KAIrC,OAAOA,GAxET,GAAIomB,GAAc5jC,EAAoB,KAAK4jC,WA2E3ClkC,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA2BtCqrB,EAAY1oB,EAAM,aACpBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAYA,IAALtK,GAGTsxB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAYA,IAALtK,GAAUg/B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAG5CkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAEy8B,IAAInyB,IAGf6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,KAAM,IAAI3I,WAAU,wDAGtBy1B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,OAAOqC,GAAEe,OAASuJ,EAAEvJ,OAASi+B,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAGpE2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAYA,IAALtK,GAGT8wB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGmc,IAGnCsK,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAGmc,KAIrC,OAAOA,GAnET,GAAIuY,GAAc5jC,EAAoB,KAAK4jC,WAsE3ClkC,GAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA4CtCsrB,EAAU3oB,EAAM,WAClB0wB,WAAY,SAAUzuB,EAAGsK,GAEvB,MAAU,QAANtK,EAA2B,OAANsK,EACf,OAANA,EAA2B,OAANtK,EACf0F,SAAN1F,EAAgC0F,SAAN4E,EACpB5E,SAAN4E,EAAgC5E,SAAN1F,EAEvBo/B,EAASp/B,EAAGsK,IAGrBwmB,sBAAuB,SAAU9wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG80B,IAGnCrO,sBAAuB,SAAU/wB,EAAGsK,GAClC,MAAO9K,GAAWW,SAASH,EAAGsK,EAAG80B,MAIjCA,EAAWrhC,EAAM,YACnBghC,mBAAoB,SAAU/+B,EAAGsK,GAC/B,MAAOtK,KAAMsK,GAGfgnB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,OAAQ00B,EAAYh/B,EAAGsK,EAAGxO,EAAOwC,UAGnCkzB,uBAAwB,SAAUxxB,EAAGsK,GACnC,OAAQtK,EAAE+tB,GAAGzjB,IAGf6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,OAAQ00B,EAAYh/B,EAAEiB,GAAIqJ,EAAErJ,GAAInF,EAAOwC,WAClC0gC,EAAYh/B,EAAEkB,GAAIoJ,EAAEpJ,GAAIpF,EAAOwC,UAGtC84B,aAAc,SAAUp3B,EAAGsK,GACzB,IAAKtK,EAAEyI,UAAU6B,GACf,KAAM,IAAI3M,OAAM,2CAElB,QAAQqhC,EAAYh/B,EAAEe,MAAOuJ,EAAEvJ,MAAOjF,EAAOwC,UAG/C2gC,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,KAAMsK,IAIjB,OAAOoc,GAjGT,GAAIsY,GAAc5jC,EAAoB,KAAK4jC,WAoG3ClkC,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAyDpC,QAASshC,GAASr/B,EAAGsK,GACnB,MAAOuO,GAAO7Y,EAAGsK,GAAKtK,EAAIsK,EAS5B,QAASg1B,GAAK3/B,GACZ,GAAIzC,GAAMwI,MAQV,IANAlG,EAAWqB,YAAYlB,EAAO,SAAUoB,IAC1B2E,SAARxI,GAAqB2b,EAAO9X,EAAO7D,MACrCA,EAAM6D,KAIE2E,SAARxI,EACF,KAAM,IAAIS,OAAM,yCAGlB,OAAOT,GA/ET,GAAIsC,GAAa9B,EAAKtC,EAAoB,IACtCyd,EAASnb,EAAKtC,EAAoB,KAiCtC,OAAO2C,GAAM,OAEXuwB,iBAAkBgR,EAGlBzI,qCAAsC,SAAUl3B,EAAOjB,GACrD,MAAOc,GAAWiB,OAAOd,EAAOjB,EAAImB,UAAWw/B,IAIjDE,MAAO,WACL,MAAOD,GAAKl+B,cAsClBtG,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAqDpC,QAASyhC,GAAO7/B,EAAOjB,GACtB,GAAIooB,GAAMtnB,EAAWiB,OAAOd,EAAOjB,EAAK0kB,GACnC/Q,EAAIrT,MAAMC,QAAQU,GAASe,EAAKf,GAASA,EAAMe,MACnD,OAAO4iB,GAAOwD,EAAKzU,EAAE3T,IASvB,QAAS+gC,GAAM9/B,GACb,GAAImnB,GAAM,EACN3hB,EAAM,CAOV,IALA3F,EAAWqB,YAAYlB,EAAO,SAAUoB,GACtC+lB,EAAM1D,EAAI0D,EAAK/lB,GACfoE,MAGU,IAARA,EACF,KAAM,IAAIxH,OAAM,0CAGlB,OAAO2lB,GAAOwD,EAAK3hB,GA7ErB,GAAI3F,GAAa9B,EAAKtC,EAAoB,IACtCgoB,EAAM1lB,EAAKtC,EAAoB,KAC/BkoB,EAAS5lB,EAAKtC,EAAoB,IA6BtC,OAAO2C,GAAM,QAEXuwB,iBAAkBmR,EAGlB5I,qCAAsC2I,EAGtCD,MAAO,WACL,MAAOE,GAAMr+B,cA3CnB,GAAIV,GAAOtF,EAAoB,KAAKsF,IAoFpC5F,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAsDpC,QAAS2hC,GAAQ//B,GACf,GAAIk8B,GAAOrW,EAAQ7lB,EAAME,UAEzBg8B,GAAKzT,KAAK9B,EAEV,IAAInhB,GAAM02B,EAAK18B,MAEf,IAAW,GAAPgG,EACF,KAAM,IAAIxH,OAAM,4CAGlB,OAAIwH,GAAM,GAAK,EAENw6B,EAAQ9D,EAAK12B,EAAM,EAAI,GAAI02B,EAAK12B,EAAM,IAItCy6B,EAAO/D,GAAM12B,EAAM,GAAK,IAtEnC,GAAIie,GAAa1lB,EAAKtC,EAAoB,KACtCkoB,EAAa5lB,EAAKtC,EAAoB,KACtCkrB,EAAa5oB,EAAKtC,EAAoB,MA4BtCurB,EAAS5oB,EAAM,UAEjBuwB,iBAAkBoR,EAGlB7I,qCAAsC,SAAUl3B,EAAOjB,GAErD,KAAM,IAAIf,OAAM,wCAKlB4hC,MAAO,WACL,MAAOG,GAAQ1gC,MAAMyE,UAAU6W,MAAM7e,KAAK2F,eAgC1Cw+B,EAAS7hC,EAAM,4BAA6B,SAAUgD,GACxD,MAAOA,KAIL4+B,EAAU5hC,EAAM,uDAAwD,SAAUob,EAAMC,GAC1F,MAAOkK,GAAOF,EAAIjK,EAAMC,GAAQ,IAGlC,OAAOuN,GAvFT,GAAInB,GAAUpqB,EAAoB,KAAKoqB,OA0FvC1qB,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAyDpC,QAAS8hC,GAAU7/B,EAAGsK,GACpB,MAAOsO,GAAQ5Y,EAAGsK,GAAKtK,EAAIsK,EAS7B,QAASw1B,GAAKngC,GACZ,GAAIvC,GAAMsI,MAQV,IANAlG,EAAWqB,YAAYlB,EAAO,SAAUoB,IAC1B2E,SAARtI,GAAqBwb,EAAQ7X,EAAO3D,MACtCA,EAAM2D,KAIE2E,SAARtI,EACF,KAAM,IAAIO,OAAM,yCAGlB,OAAOP,GA/ET,GAAIoC,GAAa9B,EAAKtC,EAAoB,IACtCwd,EAAUlb,EAAKtC,EAAoB,KAiCvC,OAAO2C,GAAM,OAEXuwB,iBAAkBwR,EAGlBjJ,qCAAsC,SAAUl3B,EAAOjB,GACrD,MAAOc,GAAWiB,OAAOd,EAAOjB,EAAImB,UAAWggC,IAIjDN,MAAO,WACL,MAAOO,GAAK1+B,cAsClBtG,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoDpC,QAASgiC,GAAMpgC,GACb,GAAIinB,GAAOlhB,MAMX,IAJAlG,EAAWqB,YAAYlB,EAAO,SAAUoB,GACtC6lB,EAAiBlhB,SAATkhB,EAAsB7lB,EAAQgjB,EAAS6C,EAAM7lB,KAG1C2E,SAATkhB,EACF,KAAM,IAAIjpB,OAAM,0CAGlB,OAAOipB,GA9DT,GAAIpnB,GAAa9B,EAAKtC,EAAoB,IACtC2oB,EAAWrmB,EAAKtC,EAAoB,IA2BxC,OAAO2C,GAAM,QAEXuwB,iBAAkByR,EAGlBlJ,qCAAsC,SAAUl3B,EAAOjB,GAErD,KAAM,IAAIf,OAAM,sCAKlB4hC,MAAO,WACL,MAAOQ,GAAM3+B,cAyBnBtG,EAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA0DpC,QAASiiC,GAAKrgC,EAAOsgC,GACnB,GAAoB,GAAhBtgC,EAAMR,OACR,KAAM,IAAIgC,aAAY,4DAGxB,OAAOwC,GAAKu8B,EAAS95B,MAAM,KAAMhF,YA9DnC,GACIuC,IADajG,EAAKtC,EAAoB,IACzBsC,EAAKtC,EAAoB,MACtC8kC,EAAaxiC,EAAKtC,EAAoB,KA0C1C,OAAO2C,GAAM,OAEXuwB,iBAAkB0R,EAGlBlH,yBAA0BkH,EAG1BT,MAAO,WACL,MAAOS,GAAKhhC,MAAMyE,UAAU6W,MAAM7e,KAAK2F,eAa7CtG,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAmDpC,QAASoiC,GAAKxgC,GACZ,GAAImnB,GAAMphB,MAMV,IAJAlG,EAAWqB,YAAYlB,EAAO,SAAUoB,GACtC+lB,EAAephB,SAARohB,EAAqB/lB,EAAQqiB,EAAI0D,EAAK/lB,KAGnC2E,SAARohB,EACF,KAAM,IAAInpB,OAAM,yCAElB,OAAOmpB,GA5DT,GAAItnB,GAAa9B,EAAKtC,EAAoB,IACtCgoB,EAAM1lB,EAAKtC,EAAoB,IAyBnC,OAAO2C,GAAM,OACXuwB,iBAAkB,SAAU5uB,GAE1B,MAAOygC,GAAKzgC,IAGdm3B,qCAAsC,WAGpC,KAAM,IAAIl5B,OAAM,qCAGlB4hC,MAAO,WAEL,MAAOY,GAAK/+B,cAwBlBtG,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA2EpC,QAASqiC,GAAKzgC,EAAOsgC,GACnB,GAAInZ,GAAM,EACN3hB,EAAM,CAEV,IAAoB,GAAhBxF,EAAMR,OACR,KAAM,IAAIgC,aAAY,4DAQxB,IAJA3B,EAAWqB,YAAYlB,EAAO,SAAUoB,GACtC+lB,EAAM1D,EAAI0D,EAAK/lB,GACfoE,MAEU,IAARA,EAAW,KAAM,IAAIxH,OAAM,yCAE/B,IAAIR,GAAOmmB,EAAOwD,EAAK3hB,EASvB,QANA2hB,EAAM,EACNtnB,EAAWqB,YAAYlB,EAAO,SAAUoB,GACtC,GAAIwE,GAAO6e,EAASrjB,EAAO5D,EAC3B2pB,GAAM1D,EAAI0D,EAAK/C,EAASxe,EAAMA,MAGxB06B,GACN,IAAK,cACH,MAAO3c,GAAOwD,EAAK3hB,EAErB,KAAK,SACH,MAAOme,GAAOwD,EAAK3hB,EAAM,EAE3B,KAAK,WACH,GAAIgsB,GAAQrK,YAAezqB,GAAKgc,UAAa,GAAIhc,GAAKgc,UAAU,GAAK,CACrE,OAAe,IAAPlT,EAAYgsB,EAAO7N,EAAOwD,EAAK3hB,EAAM,EAE/C,SACE,KAAM,IAAIxH,OAAM,0BAA4BsiC,EAAgB,gEA9GlE,GAAIzgC,GAAa9B,EAAKtC,EAAoB,IACtCgoB,EAAM1lB,EAAKtC,EAAoB,KAC/BgpB,EAAW1mB,EAAKtC,EAAoB,KACpC2oB,EAAWrmB,EAAKtC,EAAoB,KACpCkoB,EAAS5lB,EAAKtC,EAAoB,IA4CtC,OAAO2C,GAAM,YAEXuwB,iBAAkB,SAAU3uB,GAC1B,MAAOygC,GAAKzgC,EAAO0gC,IAIrBvH,yBAA0BsH,EAG1Bb,MAAO,WACL,MAAOa,GAAKh/B,UAAWi/B,MA9D7B,GAAIA,GAAwB,UAuH5BvlC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAuDpC,QAASuiC,GAAatgC,GAEpB,GAAIugC,GAAQ,GAAIlkC,GAAKC,QACjB0D,EAAEkB,GAAKlB,EAAEkB,GAAKlB,EAAEiB,GAAKjB,EAAEiB,GAAK,EAC5B,GAAOjB,EAAEiB,GAAKjB,EAAEkB,IAEhBs/B,EAAQC,EAAYF,GACpBG,EAAQ,GAAIrkC,GAAKC,QACjBkkC,EAAMv/B,GAAKjB,EAAEkB,GACbs/B,EAAMt/B,GAAKlB,EAAEiB,IAEb0/B,EAAQC,EAAWF,EAGvB,OAAO,IAAIrkC,GAAKC,QACZ,mBAAyBqkC,EAAMz/B,GAC/By/B,EAAM1/B,IAtEZ,GAAIzB,GAAa9B,EAAKtC,EAAoB,IACtCqlC,EAAc/iC,EAAKtC,EAAoB,KAAKs1B,WAAoB,QAChEkQ,EAAaljC,EAAKtC,EAAoB,KAAKs1B,WAAoB,QAyB/D3J,EAAOhpB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAIA,IAAK,IAAW,GAALA,EACNsD,KAAKyjB,KAAK/mB,GAGVsgC,EAAa,GAAIjkC,GAAKC,QAAQ0D,EAAG,KAI5C1D,QAAWgkC,EAEXjoB,UAAa,SAAUrY,GACrB,MAAO6gC,GAAU7gC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG+mB,KA8BjC,OAAOA,GA7ET,GAAI8Z,GAAYzlC,EAAoB,KAAK0lC,aAgFzChmC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAqDpC,QAASgjC,GAAc/gC,GAGrB,GAAIqa,GACA/Z,EAAM0gC,EAAYhhC,EAWtB,OAVIM,GAAIY,IAAM,GACZmZ,EAAO/Z,EAAIW,GACXX,EAAIW,IAAMX,EAAIY,GACdZ,EAAIY,GAAKmZ,IAETA,EAAO/Z,EAAIY,GACXZ,EAAIY,IAAMZ,EAAIW,GACdX,EAAIW,GAAKoZ,GAGJ/Z,EAnET,GAAId,GAAa9B,EAAKtC,EAAoB,IACtC4lC,EAActjC,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAuBjE1J,EAAQjpB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,MAAIA,IAAK,EACAsD,KAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEA,EAAI,GAAKA,GAE9B,IAALA,EACK,GAAI3D,GAAKC,QAAQgH,KAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEA,EAAI,GAAKA,GAAIsD,KAAKyf,IAE1Dge,EAAc,GAAI1kC,GAAKC,QAAQ0D,EAAG,KAG3C1D,QAAWykC,EAEX1oB,UAAa,SAAUrY,GACrB,MAAOihC,GAASjhC,EAAG3D,EAAKgc,WAAW,GAAO,IAG5CiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGgnB,KA4BjC,OAAOA,GAzET,GAAIia,GAAW7lC,EAAoB,KAAK8lC,uBA4ExCpmC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtC+lC,EAAczjC,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAyBjEzJ,EAAOlpB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAO,GAAMsD,KAAKmkB,KAAK,EAAIznB,GAAKohC,GAGlC9kC,QAAW,SAAU0D,GACnB,GAAY,GAARA,EAAEkB,GACJ,MAAO,IAAI7E,GAAKC,QAAQ0D,EAAEiB,GAAKqC,KAAKmkB,KAAK,EAAIznB,EAAEiB,IAAMmgC,EAAS,EAGhE,IAAIxC,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAS7B,OARAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACX0D,EAAEiB,GAAMjB,EAAEiB,GAAK29B,EACf5+B,EAAEkB,IAAMlB,EAAEkB,GAAK09B,GACb,GAAIviC,GAAKC,QACF,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAEzBigC,EAAYnhC,IAGrBqY,UAAa,SAAUrY,GACrB,MAAOqhC,GAAUrhC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGinB,KAIjC,OAAOA,GA9DT,GAAIoa,GAAYjmC,EAAoB,KAAKkmC,cAErCF,EAAU,kBA+DdtmC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAkDpC,QAASwjC,GAAevhC,GACtB,GAAY,GAARA,EAAEiB,IAAmB,GAARjB,EAAEkB,GACjB,MAAO,IAAI7E,GAAKC,QAAQ,EAAG8kC,EAI7B,IAAIxC,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAW7B,OAVAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACP0D,EAAEiB,GAAK29B,GACP5+B,EAAEkB,GAAK09B,GAET,GAAIviC,GAAKC,QACE,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAG7BwmB,EAAM1nB,GAlEf,GAAI0nB,GAAQhqB,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAC3DlxB,EAAa9B,EAAKtC,EAAoB,IAuBtC8rB,EAAQnpB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,MAAIA,IAAK,GAAU,IAALA,EACLy1B,SAASz1B,IAAMsD,KAAK0F,KAAKhJ,EAAE,GAAGA,GAAKsD,KAAK0F,IAAIhJ,GAAGA,EAAE,KAAO,EAAI,EAExD,IAANA,EAAUuhC,EAAc,GAAIllC,GAAKC,QAAQ0D,EAAG,IAAM,GAAI3D,GAAKC,QAAQ,EAAG8kC,IAG/E9kC,QAAWilC,EAEXlpB,UAAa,SAAUrY,GACrB,MAAOwhC,GAASxhC,EAAG3D,EAAKgc,WAAW,IAGrCiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGknB,KA8BjC,OAAOA,GA1ET,GAAIsa,GAAWpmC,EAAoB,KAAKqmC,YAEpCL,EAAU,kBA2EdtmC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoDpC,QAAS2jC,GAAc1hC,GACrB,GAAY,GAARA,EAAEiB,IAAmB,GAARjB,EAAEkB,GACjB,MAAO,IAAI7E,GAAKC,QAAQ8kC,EAAS9C,EAAAA,EAGnC,IAAIM,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAS7B,OARAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACX0D,EAAEiB,GAAMjB,EAAEiB,GAAK29B,EACf5+B,EAAEkB,IAAMlB,EAAEkB,GAAK09B,GACb,GAAIviC,GAAKC,QACF,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAEzBygC,EAAY3hC,GAjErB,GAAIR,GAAa9B,EAAKtC,EAAoB,IACtCumC,EAAcjkC,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAyBjEvJ,EAAOppB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAS,IAALA,GAAWA,GAAK,EACXsD,KAAKikB,KAAK,EAAIvnB,GAEhB0hC,EAAa,GAAIrlC,GAAKC,QAAQ0D,EAAG,KAG1C1D,QAAWolC,EAEXrpB,UAAa,SAAUrY,GACrB,MAAO4hC,GAAU5hC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGmnB,KA2BjC,OAAOA,GAzET,GAAIya,GAAYxmC,EAAoB,KAAKymC,cAErCT,EAAU,kBA0EdtmC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCosB,EAAQ9pB,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAuB3DtJ,EAAQrpB,EAAM,SAChBK,OAAU,SAAU4B,GAElB,MADAA,GAAI,EAAIA,EACDsD,KAAK0F,IAAIhJ,EAAIsD,KAAKK,KAAK3D,EAAEA,EAAI,KAGtC1D,QAAW,SAAU0D,GACnB,GAAY,GAARA,EAAEkB,GAIJ,MAHAlB,GAAa,GAARA,EAAEiB,GACDqC,KAAK0F,IAAIhJ,EAAEiB,GAAKqC,KAAKK,KAAK3D,EAAEiB,GAAGjB,EAAEiB,GAAK,IACtCq9B,EAAAA,EACC,GAAIjiC,GAAKC,QAAQ0D,EAAG,EAI7B,IAAI4+B,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAW7B,OAVAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACX0D,EAAEiB,GAAK29B,GACN5+B,EAAEkB,GAAK09B,GAEN,GAAIviC,GAAKC,QACF,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAGzBsmB,EAAMxnB,IAGfqY,UAAa,SAAUrY,GACrB,MAAO8hC,GAAS9hC,EAAG3D,EAAKgc,WAAW,GAAM,IAG3CiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGonB,KAIjC,OAAOA,GAjET,GAAI0a,GAAW1mC,EAAoB,KAAK8lC,uBAoExCpmC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoDpC,QAASgkC,GAAc/hC,GACrB,GAAY,GAARA,EAAEiB,IAAmB,GAARjB,EAAEkB,GACjB,MAAO,IAAI7E,GAAKC,QAAQ,EAAGgiC,EAAAA,EAG7B,IAAIM,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAS7B,OARAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACX0D,EAAEiB,GAAMjB,EAAEiB,GAAK29B,EACf5+B,EAAEkB,IAAMlB,EAAEkB,GAAK09B,GACb,GAAIviC,GAAKC,QACF,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAEzB8/B,EAAYhhC,GAjErB,GAAIR,GAAa9B,EAAKtC,EAAoB,IACtC4lC,EAActjC,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAyBjErJ,EAAOtpB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAS,IAALA,GAAWA,GAAK,EACXsD,KAAKyjB,KAAK,EAAI/mB,GAEhB+hC,EAAa,GAAI1lC,GAAKC,QAAQ0D,EAAG,KAG1C1D,QAAWylC,EAEX1pB,UAAa,SAAUrY,GACrB,MAAOgiC,GAAUhiC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGqnB,KA2BjC,OAAOA,GAvET,GAAI2a,GAAY5mC,EAAoB,KAAK0lC,aA0EzChmC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA0DpC,QAASkkC,GAAejiC,GACtB,GAAY,GAARA,EAAEiB,IAAmB,GAARjB,EAAEkB,GACjB,MAAO,IAAI7E,GAAKC,QAAQgiC,EAAAA,EAAU,EAIpC,IAAIM,GAAM5+B,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,EAW7B,OAVAlB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,QACX0D,EAAEiB,GAAK29B,GACN5+B,EAAEkB,GAAK09B,GAEN,GAAIviC,GAAKC,QACF,GAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,KAAalB,EAAEkB,GAAK,GAAK,GAGzB8lB,EAAMhnB,GA1Ef,GAAIR,GAAa9B,EAAKtC,EAAoB,IACtC4rB,EAAQtpB,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAuB3DpJ,EAAQvpB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,GAAS,GAALA,GAAUA,GAAK,GAAI,CACrBA,EAAI,EAAIA,CAER,IAAInB,GAAMyE,KAAKK,KAAK3D,EAAEA,EAAI,EAC1B,OAAIA,GAAI,EACCsD,KAAK0F,IAAInK,EAAMmB,GAGjB,GAAI3D,GAAKC,QAAQgH,KAAK0F,IAAInK,EAAMmB,GAAIsD,KAAKyf,IAGlD,MAAOkf,GAAc,GAAI5lC,GAAKC,QAAQ0D,EAAG,KAG3C1D,QAAW2lC,EAEX5pB,UAAa,SAAUrY,GACrB,MAAOkiC,GAASliC,EAAG3D,EAAKgc,WAAW,GAAO,IAG5CiW,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGsnB,KA8BjC,OAAOA,GAhFT,GAAI4a,GAAW9mC,EAAoB,KAAK8lC,uBAmFxCpmC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAwDpC,QAASokC,GAAaniC,GAEpB,GAAIiB,GAAKjB,EAAEiB,GACPC,EAAKlB,EAAEkB,GACPq/B,EAAQ,GAAIlkC,GAAKC,QACjB4E,EAAKA,EAAKD,EAAKA,EAAK,EACpB,GAAOA,EAAKC,GAEZs/B,EAAQC,EAAYF,GACpBG,EAAQ,GAAIrkC,GAAKC,QACjBkkC,EAAMv/B,GAAKC,EACXs/B,EAAMt/B,GAAKD,GAEX0/B,EAAQC,EAAWF,EAEvB,OAAO,IAAIrkC,GAAKC,QAAQqkC,EAAMz/B,IAAKy/B,EAAM1/B,IAtE3C,GAAIzB,GAAa9B,EAAKtC,EAAoB,IACtCqlC,EAAc/iC,EAAKtC,EAAoB,KAAKs1B,WAAoB,QAChEkQ,EAAaljC,EAAKtC,EAAoB,KAAKs1B,WAAoB,QAyB/DnJ,EAAOxpB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAIA,IAAK,IAAW,GAALA,EACNsD,KAAKikB,KAAKvnB,GAGVmiC,EAAa,GAAI9lC,GAAKC,QAAQ0D,EAAG,KAI5C1D,QAAW6lC,EAEX9pB,UAAa,SAAUrY,GACrB,MAAOoiC,GAAUpiC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGunB,GAAM,KA4BvC,OAAOA,GA5ET,GAAI6a,GAAYhnC,EAAoB,KAAKymC,aA+EzC/mC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCumC,EAAcjkC,EAAKtC,EAAoB,MAAMs1B,WAAoB,QAuBjElJ,EAAQzpB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,MAAOsD,MAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEA,EAAI,GAAKA,IAGvC1D,QAAW,SAAU0D,GAEnB,GAAIqa,GAAOra,EAAEkB,EACblB,GAAEkB,IAAMlB,EAAEiB,GACVjB,EAAEiB,GAAKoZ,CAEP,IAAI/Z,GAAMqhC,EAAY3hC,EAUtB,OAPAA,GAAEiB,IAAMjB,EAAEkB,GACVlB,EAAEkB,GAAKmZ,EAEPA,EAAO/Z,EAAIW,GACXX,EAAIW,IAAMX,EAAIY,GACdZ,EAAIY,GAAKmZ,EAEF/Z,GAGT+X,UAAa,SAAUrY,GACrB,MAAOqiC,GAASriC,EAAG3D,EAAKgc,WAAW,GAAM,IAG3CiW,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGwnB,GAAO,KAIxC,OAAOA,GA7DT,GAAI6a,GAAWjnC,EAAoB,KAAK8lC,uBAgExCpmC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCwlC,EAAaljC,EAAKtC,EAAoB,KAAKs1B,WAAoB,QAyB/DjJ,EAAO1pB,EAAM,QACfK,OAAU,SAAU4B,GAClB,MAAOsD,MAAKmkB,KAAKznB,IAGnB1D,QAAW,SAAU0D,GACnB,GAAY,GAARA,EAAEiB,GAAS,CACb,GAAY,GAARjB,EAAEkB,GACJ,MAAO,IAAI7E,GAAKC,QAAQ,EAAGgiC,EAAAA,EAE7B,IAAY,IAARt+B,EAAEkB,GACJ,MAAO,IAAI7E,GAAKC,QAAQ,IAAIgiC,EAAAA,IAKhC,GAAIr9B,GAAKjB,EAAEiB,GACPC,EAAKlB,EAAEkB,GACP09B,EAAM39B,EAAKA,GAAM,EAAMC,IAAO,EAAMA,GAEpCq/B,EAAQ,GAAIlkC,GAAKC,SAChB,EAAM4E,EAAKA,EAAKD,EAAKA,GAAM29B,EAC3B,GAAO39B,EAAM29B,GAEd4B,EAAQI,EAAWL,EAEvB,OAAO,IAAIlkC,GAAKC,SACX,GAAMkkC,EAAMt/B,GACb,GAAMs/B,EAAMv/B,KAIlBoX,UAAa,SAAUrY,GACrB,MAAOsiC,GAAUtiC,EAAG3D,EAAKgc,WAAW,IAGtCiW,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGynB,GAAM,KAIvC,OAAOA,GAvET,GAAI6a,GAAYlnC,EAAoB,KAAKkmC,aA0EzCxmC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA+BtCwI,EAAQ7F,EAAM,SAChBuzB,iBAAkBhuB,KAAKM,MAIvB4tB,uBAAwB,SAAUlnB,EAAGtK,GACnC,MAAOuiC,GAASj4B,EAAGtK,EAAG3D,EAAKgc,YAG7ByY,sBAAuB,SAAUxmB,EAAGtK,GAClC,MAAOR,GAAWW,SAASmK,EAAGtK,EAAG4D,IAGnCmtB,sBAAuB,SAAUzmB,EAAGtK,GAClC,MAAOR,GAAWW,SAASmK,EAAGtK,EAAG4D,KAIrC,OAAOA,GApDT,GAAI2+B,GAAWnnC,EAAoB,KAAKonC,OAuDxC1nC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAkDpC,QAAS0kC,GAAeziC,GAEtB,GAAI0iC,GAAO1iC,EAAEiB,GAAK,GAAa,GAARjB,EAAEkB,GAErByhC,EAAW,EAAI3iC,EAAEiB,GACjB2hC,EAAU,EAAI5iC,EAAEiB,GAChB29B,EAAM+D,EAASA,EAAW3iC,EAAEkB,GAAGlB,EAAEkB,EACrClB,GAAY,GAAP4+B,EACC,GAAIviC,GAAKC,SACVsmC,EAAQD,EAAW3iC,EAAEkB,GAAGlB,EAAEkB,IAAM09B,GAChC5+B,EAAEkB,GAAGyhC,EAAWC,EAAQ5iC,EAAEkB,IAAM09B,GAE/B,GAAIviC,GAAKC,QACF,IAAR0D,EAAEiB,GAAajB,EAAEiB,GAAK,EAAK,EACnB,GAARjB,EAAEkB,GAAYlB,EAAEkB,GAAK,EAAK,EAG/B,IAAImZ,GAAOra,EAAEiB,EAOb,OANAjB,GAAEiB,GAAKqC,KAAK0F,IAAI1F,KAAKK,KAAK3D,EAAEiB,GAAGjB,EAAEiB,GAAKjB,EAAEkB,GAAGlB,EAAEkB,KAAO,EACpDlB,EAAEkB,GAAKoC,KAAKM,MAAM5D,EAAEkB,GAAImZ,GAAQ,EAE5BqoB,IACF1iC,EAAEkB,IAAMlB,EAAEkB,IAELlB,EAzET,GAAIR,GAAa9B,EAAKtC,EAAoB,IAuBtCssB,EAAQ3pB,EAAM,SAChBK,OAAU,SAAU4B,GAClB,MAAS,IAALA,GAAUA,GAAK,GACVsD,KAAK0F,KAAK,EAAIhJ,IAAI,EAAIA,IAAM,EAE9ByiC,EAAc,GAAIpmC,GAAKC,QAAQ0D,EAAG,KAG3C1D,QAAWmmC,EAEXpqB,UAAa,SAAUrY,GACrB,MAAO6iC,GAAS7iC,EAAG3D,EAAKgc,WAAW,IAGrCiW,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAG0nB,GAAO,KAqCxC,OAAOA,GA/ET,GAAImb,GAAWznC,EAAoB,KAAKqmC,WAkFxC3mC,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IACtCusB,EAAOjqB,EAAKtC,EAAoB,MAAMs1B,WAAmB,OACzDzI,EAAOvqB,EAAKtC,EAAoB,MAAMs1B,WAAmB,OA4BzDntB,EAAMxF,EAAM,OACdK,OAAUkF,KAAKC,IAEfjH,QAAW,SAAU0D,GAEnB,MAAO,IAAI3D,GAAKC,QACZgH,KAAKC,IAAIvD,EAAEiB,IAAM0mB,GAAM3nB,EAAEkB,IACzBoC,KAAKE,IAAIxD,EAAEiB,IAAMgnB,GAAMjoB,EAAEkB,MAI/BmX,UAAa,SAAUrY,GACrB,MAAO8iC,GAAO9iC,EAAG3D,EAAKgc,UAAW,GAAG,IAGtC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO2B,MAAKC,IAAIvD,EAAEe,QAGpButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGuD,KAIjC,OAAOA,GA5DT,GAAIu/B,GAAS1nC,EAAoB,KAAK2nC,eA+DtCjoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAuBtCusB,EAAO5pB,EAAM,QACfK,OAAU4kC,EAEV1mC,QAAW,SAAU0D,GACnB,GAAIijC,GAAK3/B,KAAKogB,IAAI1jB,EAAEiB,IAChBiiC,EAAK5/B,KAAKogB,KAAK1jB,EAAEiB,GACrB,OAAO,IAAI5E,GAAKC,QAAQgH,KAAKC,IAAIvD,EAAEkB,KAAO+hC,EAAKC,GAAM,EAAG5/B,KAAKE,IAAIxD,EAAEkB,KAAO+hC,EAAKC,GAAM,IAGvF7qB,UAAa,SAAUrY,GACrB,MAAOmjC,GAAQnjC,EAAG3D,EAAKgc,WAAW,GAAO,IAG3C5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAOqhC,GAAMhjC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG2nB,KAIjC,OAAOA,GAST,QAASqb,GAAMhjC,GACb,OAAQsD,KAAKogB,IAAI1jB,GAAKsD,KAAKogB,KAAK1jB,IAAM,EA7DxC,GAAImjC,GAAU/nC,EAAoB,KAAKgoC,mBAgEvCtoC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAuBtCwsB,EAAM7pB,EAAM,OACdK,OAAU,SAAU4B,GAClB,MAAO,GAAIsD,KAAK4kB,IAAIloB,IAGtB1D,QAAW,SAAU0D,GACnB,GAAI4+B,GACAt7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAChB,EAAIoC,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKC,IAAI,EAAIvD,EAAEiB,IAAM,CAEnD,OAAO,IAAI5E,GAAKC,QACZ,EAAIgH,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKE,IAAI,EAAIxD,EAAEiB,IAAM29B,GAC9Ct7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAM,GAAK09B,IAIlCvmB,UAAa,SAAUrY,GACrB,MAAOqjC,GAAOrjC,EAAG3D,EAAKgc,WAAW,IAGnC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO,GAAI2B,KAAK4kB,IAAIloB,EAAEe,QAGxButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG4nB,KAIjC,OAAOA,GA1DT,GAAIyb,GAASjoC,EAAoB,KAAKkoC,OA6DtCxoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtCysB,EAAO9pB,EAAM,QACfK,OAAUmlC,EAEVjnC,QAAW,SAAU0D,GACnB,GAAIwB,GAAI8B,KAAKogB,IAAI,EAAI1jB,EAAEiB,IACnBA,EAAKO,EAAI8B,KAAKC,IAAI,EAAIvD,EAAEkB,IACxBA,EAAKM,EAAI8B,KAAKE,IAAI,EAAIxD,EAAEkB,IACxB09B,GAAO39B,EAAK,IAAMA,EAAK,GAAKC,EAAKA,CACrC,OAAO,IAAI7E,GAAKC,UACV2E,EAAK,IAAMA,EAAK,GAAKC,EAAKA,GAAM09B,EAClC,GAAK19B,EAAK09B,IAIhBvmB,UAAa,SAAUrY,GACrB,MAAOwjC,GAAQxjC,EAAG3D,EAAKgc,WAAW,IAGpC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAO4hC,GAAMvjC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG6nB,KAIjC,OAAOA,GAST,QAAS0b,GAAMvjC,GACb,GAAIiY,GAAI3U,KAAKogB,IAAI,EAAI1jB,EACrB,QAAQiY,EAAI,IAAMA,EAAI,GArExB,GAAIurB,GAAUpoC,EAAoB,KAAKqoC,SAwEvC3oC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAuBtC0sB,EAAM/pB,EAAM,OACdK,OAAU,SAAU4B,GAClB,MAAO,GAAIsD,KAAKE,IAAIxD,IAGtB1D,QAAW,SAAU0D,GAEnB,GAAI4+B,GACA,KAAQt7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKogB,IAAI,EAAI1jB,EAAEkB,KAC7C,GAAMoC,KAAKC,IAAI,EAAIvD,EAAEiB,GAEzB,OAAO,IAAI5E,GAAKC,QACZ,GAAMgH,KAAKE,IAAIxD,EAAEiB,KAAOqC,KAAKogB,KAAK1jB,EAAEkB,IAAMoC,KAAKogB,IAAI1jB,EAAEkB,KAAO09B,EAC5D,GAAMt7B,KAAKC,IAAIvD,EAAEiB,KAAOqC,KAAKogB,KAAK1jB,EAAEkB,IAAMoC,KAAKogB,IAAI1jB,EAAEkB,KAAO09B,IAIlEvmB,UAAa,SAAUrY,GACrB,MAAO0jC,GAAO1jC,EAAG3D,EAAKgc,UAAW,GAAG,IAGtC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO,GAAI2B,KAAKE,IAAIxD,EAAEe,QAGxButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG8nB,KAIjC,OAAOA,GA3DT,GAAI4b,GAAStoC,EAAoB,KAAK2nC,eA8DtCjoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtC2sB,EAAOhqB,EAAM,QACfK,OAAUulC,EAEVrnC,QAAW,SAAU0D,GACnB,GAAIijC,GAAK3/B,KAAKogB,IAAI1jB,EAAEiB,IAChBiiC,EAAK5/B,KAAKogB,KAAK1jB,EAAEiB,IACjBA,EAAKqC,KAAKC,IAAIvD,EAAEkB,KAAO+hC,EAAKC,GAC5BhiC,EAAKoC,KAAKE,IAAIxD,EAAEkB,KAAO+hC,EAAKC,GAC5BtE,EAAM39B,EAAKA,EAAKC,EAAKA,CACzB,OAAO,IAAI7E,GAAKC,QAAQ,EAAI2E,EAAK29B,EAAK,GAAK19B,EAAI09B,IAGjDvmB,UAAa,SAAUrY,GACrB,MAAO4jC,GAAQ5jC,EAAG3D,EAAKgc,WAAW,GAAM,IAG1C5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAOgiC,GAAM3jC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAG+nB,KAIjC,OAAOA,GAST,QAAS4b,GAAM3jC,GAEb,MAAS,IAALA,EACK8C,OAAO2xB,kBAGPnxB,KAAKe,IAAI,GAAKf,KAAKogB,IAAI1jB,GAAKsD,KAAKogB,KAAK1jB,KAAOwF,EAAKxF,GAxE7D,GAAI4jC,GAAUxoC,EAAoB,KAAKgoC,oBACnC59B,EAAOpK,EAAoB,KAAKoK,IA2EpC1K,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAuBtCkX,EAAMvU,EAAM,OACdK,OAAU,SAAU4B,GAClB,MAAO,GAAIsD,KAAKC,IAAIvD,IAGtB1D,QAAW,SAAU0D,GAEnB,GAAI4+B,GACA,KAAQt7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKogB,IAAI,EAAI1jB,EAAEkB,KAC7C,GAAMoC,KAAKC,IAAI,EAAIvD,EAAEiB,GAEzB,OAAO,IAAI5E,GAAKC,QACZ,GAAMgH,KAAKC,IAAIvD,EAAEiB,KAAOqC,KAAKogB,KAAK1jB,EAAEkB,IAAMoC,KAAKogB,IAAK1jB,EAAEkB,KAAO09B,EAC7D,GAAMt7B,KAAKE,IAAIxD,EAAEiB,KAAOqC,KAAKogB,IAAK1jB,EAAEkB,IAAMoC,KAAKogB,KAAK1jB,EAAEkB,KAAO09B,IAInEvmB,UAAa,SAAUrY,GACrB,MAAO6jC,GAAO7jC,EAAG3D,EAAKgc,UAAW,GAAG,IAGtC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO,GAAI2B,KAAKC,IAAIvD,EAAEe,QAGxButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGsS,KAIjC,OAAOA,GA3DT,GAAIuxB,GAASzoC,EAAoB,KAAK2nC,eA8DtCjoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtC4sB,EAAOjqB,EAAM,QACfK,OAAU0lC,EAEVxnC,QAAW,SAAU0D,GACnB,GAAIijC,GAAK3/B,KAAKogB,IAAI1jB,EAAEiB,IAChBiiC,EAAK5/B,KAAKogB,KAAK1jB,EAAEiB,IACjBA,EAAKqC,KAAKC,IAAIvD,EAAEkB,KAAO+hC,EAAKC,GAC5BhiC,EAAKoC,KAAKE,IAAIxD,EAAEkB,KAAO+hC,EAAKC,GAC5BtE,EAAM39B,EAAKA,EAAKC,EAAKA,CACzB,OAAO,IAAI7E,GAAKC,QAAQ,EAAI2E,EAAK29B,EAAK,GAAK19B,EAAK09B,IAGlDvmB,UAAa,SAAUrY,GACrB,MAAO+jC,GAAQ/jC,EAAG3D,EAAKgc,WAAW,GAAO,IAG3C5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAOmiC,GAAM9jC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAC1B,MAAOR,GAAWS,QAAQD,EAAGgoB,KAIjC,OAAOA,GAST,QAAS8b,GAAM9jC,GACb,MAAO,IAAKsD,KAAKogB,IAAI1jB,GAAKsD,KAAKogB,KAAK1jB,IAlEtC,GAAI+jC,GAAU3oC,EAAoB,KAAKgoC,mBAqEvCtoC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAI4pB,GAAOjqB,EAAKtC,EAAoB,MAAMs1B,WAAmB,OACzDzI,EAAOvqB,EAAKtC,EAAoB,MAAMs1B,WAAmB,OACzDlxB,EAAa9B,EAAKtC,EAAoB,IA4BtCoI,EAAMzF,EAAM,OACdK,OAAUkF,KAAKE,IAEflH,QAAW,SAAU0D,GACnB,MAAO,IAAI3D,GAAKC,QACZgH,KAAKE,IAAIxD,EAAEiB,IAAM0mB,GAAM3nB,EAAEkB,IACzBoC,KAAKC,IAAIvD,EAAEiB,IAAMgnB,EAAKjoB,EAAEkB,MAI9BmX,UAAa,SAAUrY,GACrB,MAAOgkC,GAAOhkC,EAAG3D,EAAKgc,UAAW,GAAG,IAGtC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO2B,MAAKE,IAAIxD,EAAEe,QAGpButB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGwD,GAAK,KAItC,OAAOA,GA5DT,GAAIwgC,GAAS5oC,EAAoB,KAAK2nC,eA+DtCjoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAuBtC6sB,EAAOlqB,EAAM,QACfK,OAAU6lC,EAEV3nC,QAAW,SAAU0D,GACnB,GAAIkkC,GAAM5gC,KAAKC,IAAIvD,EAAEkB,IACjBijC,EAAM7gC,KAAKE,IAAIxD,EAAEkB,IACjB+hC,EAAK3/B,KAAKogB,IAAI1jB,EAAEiB,IAChBiiC,EAAK5/B,KAAKogB,KAAK1jB,EAAEiB,GACrB,OAAO,IAAI5E,GAAKC,QAAQ4nC,GAAOjB,EAAKC,GAAM,EAAGiB,GAAOlB,EAAKC,GAAM,IAGjE7qB,UAAa,SAAUrY,GACrB,MAAOokC,GAAQpkC,EAAG3D,EAAKgc,WAAW,GAAM,IAG1C5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAOsiC,GAAMjkC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGioB,GAAM,KAIvC,OAAOA,GAST,QAASgc,GAAOjkC,GACd,MAAIsD,MAAKe,IAAIrE,GAAK,EACTA,EAAKA,EAAIA,EAAIA,EAAK,EAAKA,EAAIA,EAAIA,EAAIA,EAAIA,EAAK,KAE3CsD,KAAKogB,IAAI1jB,GAAKsD,KAAKogB,KAAK1jB,IAAM,EAnE1C,GAAIokC,GAAUhpC,EAAoB,KAAKgoC,mBAuEvCtoC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IAyBtC8sB,EAAMnqB,EAAM,OACdK,OAAUkF,KAAK4kB,IAEf5rB,QAAW,SAAU0D,GACnB,GAAI4+B,GACAt7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAChB,EAAIoC,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKC,IAAI,EAAIvD,EAAEiB,IACzC,CAEJ,OAAO,IAAI5E,GAAKC,QACZ,EAAIgH,KAAKogB,IAAI,GAAK1jB,EAAEkB,IAAMoC,KAAKE,IAAI,EAAIxD,EAAEiB,IAAM29B,GAC9C,EAAIt7B,KAAKogB,IAAI,GAAK1jB,EAAEkB,KAAO09B,IAIlCvmB,UAAa,SAAUrY,GACrB,MAAOqkC,GAAOrkC,EAAG3D,EAAKgc,WAAW,IAGnC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,mCAEvB,OAAO2B,MAAK4kB,IAAIloB,EAAEe,QAGpButB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGkoB,GAAK,KAItC,OAAOA,GA5DT,GAAImc,GAASjpC,EAAoB,KAAKkoC,OA+DtCxoC,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtC+sB,EAAOpqB,EAAM,QACfK,OAAUkmC,EAEVhoC,QAAW,SAAU0D,GACnB,GAAIwB,GAAI8B,KAAKogB,IAAI,EAAI1jB,EAAEiB,IACnBA,EAAKO,EAAI8B,KAAKC,IAAI,EAAIvD,EAAEkB,IACxBA,EAAKM,EAAI8B,KAAKE,IAAI,EAAIxD,EAAEkB,IACxB09B,GAAO39B,EAAK,IAAMA,EAAK,GAAKC,EAAKA,CACrC,OAAO,IAAI7E,GAAKC,UACV2E,EAAK,IAAMA,EAAK,GAAKC,EAAKA,GAAM09B,EAC7B,EAAL19B,EAAS09B,IAIfvmB,UAAa,SAAUrY,GACrB,MAAOukC,GAAQvkC,EAAG3D,EAAKgc,WAAW,IAGpC5b,KAAQ,SAAUuD,GAChB,IAAKA,EAAEkD,QAAQ7G,EAAKI,KAAK0G,WAAWC,OAClC,KAAM,IAAIzB,WAAW,oCAEvB,OAAO2iC,GAAMtkC,EAAEe,QAGjButB,iBAAkB,SAAUtuB,GAE1B,MAAOR,GAAWS,QAAQD,EAAGmoB,GAAM,KAIvC,OAAOA,GAST,QAASmc,GAAOtkC,GACd,GAAIiY,GAAI3U,KAAKogB,IAAI,EAAI1jB,EACrB,QAAQiY,EAAI,IAAMA,EAAI,GAvExB,GAAIssB,GAAUnpC,EAAoB,KAAKqoC,SA0EvC3oC,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAIyB,GAAa9B,EAAKtC,EAAoB,IA0BtCsN,EAAK3K,EAAM,MACbymC,sBAAuB,SAAUxkC,EAAGqH,GAClC,MAAOrH,GAAE0I,GAAGrB,IAGdypB,sBAAuB,SAAU9wB,EAAGqH,GAClC,MAAO7H,GAAWW,SAASH,EAAGqH,EAAMqB,IAGtCqoB,sBAAuB,SAAU/wB,EAAGqH,GAClC,MAAO7H,GAAWW,SAASH,EAAGqH,EAAMqB,KAIxC,OAAOA,GAGT5N,EAAQkG,KAAO,KACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAmBpC,MAAOA,GAAM,SACX46B,IAAOrzB,EAAOzB,QAtBlB,GAAIyB,GAAQlK,EAAoB,IA0BhCN,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GAa3C,MAAO,UAAiBkI,GAkBtB,MAjBIA,KAEFqB,EAAOm/B,WAAW3oC,EAAQmI,GAEtBA,EAAQ5F,WAAahC,EAAKgc,WAC5Bhc,EAAKgc,UAAUvc,QACbuC,UAAW4F,EAAQ5F,YAOvBjD,EAAoB,KAAKW,EAAMD,IAI1BwJ,EAAOzB,MAAM/H,IAjCxB,GAAIwJ,GAASlK,EAAoB,IAqCjCN,GAAQkG,KAAO,SACflG,EAAQiB,MAAO,EACfjB,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GACpC,GAAII,GAAST,EAAKtC,EAAoB,IA6BtC,OAAO2C,GAAM,UACX2mC,kBAAmBC,EAEnBC,gBAAiBC,EAEjBC,mBAAoB,SAAU9kC,EAAG2tB,GAC/B,MAAOxvB,GAAOwmC,EAAgB3kC,EAAE4F,UAAW+nB,KAG7CoX,iBAAkB,SAAU/kC,EAAG2tB,GAC7B,MAAOxvB,GAAO0mC,EAAc7kC,EAAE4F,UAAW+nB,OAY/C,QAASgX,GAAiB3kC,EAAGrB,GAC3B,GAAuB,IAAnB+B,EAAKV,GAAGb,OACV,KAAM,IAAIxB,OAAM,0CAGlB,OAAOqC,GAAElD,OAAO,SAAUs8B,GACxB,MAAOz6B,GAASy6B,KAWpB,QAASyL,GAAe7kC,EAAGglC,GACzB,GAAuB,IAAnBtkC,EAAKV,GAAGb,OACV,KAAM,IAAIxB,OAAM,0CAGlB,OAAOqC,GAAElD,OAAO,SAAUs8B,GACxB,MAAO4L,GAAOrX,KAAKyL,KA7EvB,GAAI14B,GAAOtF,EAAoB,KAAKsF,IAiFpC5F,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAiEpC,MAAOA,GAAM,UACX46B,IAAOl2B,EAAOuB,OACdihC,kCAAmCxiC,EAAOuB,SArE9C,GAAIvB,GAASrH,EAAoB,IAyEjCN,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAyBpC,MAAOA,GAAM,OACX2mC,kBAAmBrb,EAEnByb,mBAAoB,SAAU9kC,EAAGrB,GAC/B,MAAOqB,GAAE/C,IAAI0B,MAYnB,QAAS0qB,GAAM1pB,EAAOhB,GACpB,GAAIguB,GAAU,SAAU5rB,EAAO/D,GAC7B,MAAIgC,OAAMC,QAAQ8B,GACTA,EAAM9D,IAAI,SAAUwc,EAAO7a,GAEhC,MAAO+tB,GAAQlT,EAAOzc,EAAMH,OAAO+B,MAI9BD,EAASoC,EAAO/D,EAAO2C,GAIlC,OAAOgtB,GAAQhtB,MAGjB7E,EAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAKA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAoCpC,MAAOA,GAAO,SACZs7B,iBAAkB6L,EAClBC,yBAA0BD,IAY9B,QAASA,GAAOE,EAAU/+B,EAAQhI,GAChC,MAAO+mC,GAASC,QAAQ,eAAgB,SAAUC,EAAUtsB,GAGtD,IAFA,GAAIusB,GAAOvsB,EAAIjU,MAAM,KACjBhE,EAAQsF,EAAOk/B,EAAKzL,SACjByL,EAAKpmC,QAAoBuG,SAAV3E,GAAqB,CACzC,GAAIyI,GAAI+7B,EAAKzL,OACb/4B,GAAQyI,EAAIzI,EAAMyI,GAAKzI,EAAQ,IAGjC,MAAc2E,UAAV3E,EACGyB,EAASzB,GAILA,EAHAiD,EAAOjD,EAAO1C,GAOlBinC,IAvEf,GAAI9iC,GAAWpH,EAAoB,KAAKoH,SACpCwB,EAAS5I,EAAoB,KAAK4I,MA2EtClJ,GAAQkG,KAAO,QACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAyEpC,QAASynC,GAAaC,GACpB,GAAc,QAAVA,EACF,MAAOC,EAEJ,IAAc,SAAVD,EACP,MAAOhuB,EAGP,MAAM,IAAI9Z,OAAM,mCAUpB,QAASgoC,GAAgBhmC,GACvB,GAA2B,IAAvBe,EAAKf,GAAOR,OACd,KAAM,IAAIxB,OAAM,kCAUpB,QAASioC,GAAiBznC,GACxB,GAA6B,IAAzBA,EAAOuC,OAAOvB,OAChB,KAAM,IAAIxB,OAAM,mCAxGpB,GAAIQ,GAAST,EAAKtC,EAAoB,KAClCsqC,EAAMhoC,EAAKtC,EAAoB,MAC/Bqc,EAAO,SAAUrN,EAAG4J,GACtB,OAAQ0xB,EAAIt7B,EAAG4J,GAgCjB,OAAOjW,GAAM,QACXiB,MAAS,SAAUgB,GAEjB,MADA2lC,GAAe3lC,GACRA,EAAEooB,KAAKsd,IAGhB9lC,OAAU,SAAUI,GAElB,MADA4lC,GAAgB5lC,GACT7B,EAAO6B,EAAE4F,UAAUwiB,KAAKsd,GAAM1lC,EAAE2G,YAGzC+9B,kBAAmB,SAAU1kC,EAAGwlC,GAE9B,MADAG,GAAe3lC,GACRA,EAAEooB,KAAKod,IAGhBV,mBAAoB,SAAU9kC,EAAGwlC,GAE/B,MADAI,GAAgB5lC,GACT7B,EAAO6B,EAAE4F,UAAUwiB,KAAKod,GAAcxlC,EAAE2G,YAGjDm0B,gBAAiB,SAAU96B,EAAGylC,GAE5B,MADAE,GAAe3lC,GACRA,EAAEooB,KAAKod,EAAYC,KAG5BxK,iBAAkB,SAAUj7B,EAAGylC,GAE7B,MADAG,GAAgB5lC,GACT7B,EAAO6B,EAAE4F,UAAUwiB,KAAKod,EAAYC,IAASzlC,EAAE2G,cAlE5D,GAAIjG,GAAOtF,EAAoB,KAAKsF,IAgHpC5F,GAAQkG,KAAO,OACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAwCpC,MAAOA,GAAM,WACX46B,IAAO,SAAU34B,GAEf,GAAI6xB,GAAIhJ,EAAMxsB,KAAK2D,EAGnB,IAAU,WAAN6xB,EAAgB,CAClB,GAAI7xB,YAAa3D,GAAKC,QAAS,MAAO,SACtC,IAAI0D,YAAa3D,GAAKuD,OAAQ,MAAO,QACrC,IAAII,YAAa3D,GAAKI,KAAM,MAAO,MACnC,IAAIuD,YAAa3D,GAAKG,MAAO,MAAO,OACpC,IAAIwD,YAAa3D,GAAKE,MAAO,MAAO,OACpC,IAAIyD,YAAa3D,GAAKK,KAAM,MAAO,MAGnC,IAAIsD,YAAa3D,GAAKgc,UAAW,MAAO,WACxC,IAAIrY,YAAa3D,GAAKkB,MAAO,MAAO,QAGtC,MAAOs0B,MA7Db,GAAIhJ,GAAQztB,EAAoB,IAkEhCN,GAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAwBpC,MAAOA,GAAM,WACX2mC,kBAAmBmB,EAEnBf,mBAAoB,SAAU9kC,EAAGrB,GAC/B,MAAOqB,GAAEjD,QAAQ4B,MAWvB,QAASknC,GAAUlmC,EAAOhB,GACxB,GAAIguB,GAAU,SAAU5rB,EAAO/D,GACzBgC,MAAMC,QAAQ8B,GAChBA,EAAMhE,QAAQ,SAAU0c,EAAO7a,GAE7B+tB,EAAQlT,EAAOzc,EAAMH,OAAO+B,MAI9BD,EAASoC,EAAO/D,EAAO2C,GAG3BgtB,GAAQhtB,MAGV7E,EAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClCiJ,EAAM3G,EAAKtC,EAAoB,KAC/BgoB,EAAM1lB,EAAKtC,EAAoB,KAC/Bw1B,EAAelzB,EAAKtC,EAAoB,MACxC2oB,EAAWrmB,EAAKtC,EAAoB,KACpCgpB,EAAW1mB,EAAKtC,EAAoB,KACpCyd,EAASnb,EAAKtC,EAAoB,MAClC0tB,EAAQprB,EAAKtC,EAAoB,MACjCipB,EAAa3mB,EAAKtC,EAAoB,KAEtCitB,EAAehsB,EAAKgsB,aACpBuD,EAAcvvB,EAAKuvB,YACnBkB,EAAMzwB,EAAKywB,IAUXgZ,EAAM/nC,EAAM,OACd6B,OAAU,SAAUlE,GAElB,OAAQA,EAAEiL,WACR,IAAK,QACH,MAAOo/B,GAAUrqC,EACnB,KAAK,SACH,MAAOsqC,GAAWtqC,KAGxBsD,MAAS,SAAUoL,GAEjB,GAAI1O,GAAIyC,EAAOiM,GAEX5I,EAAIskC,EAAIpqC,EAEZ,QACE4T,EAAG9N,EAAE8N,EAAEzP,UACPomC,EAAGzkC,EAAEykC,EAAEpmC,UACP+J,EAAGpI,EAAEoI,EAAE/J,cAKTkmC,EAAY,SAAUrqC,GAExB,GAeIkD,GAAGQ,EAAGoK,EAfNmX,EAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElBzO,EAAI5G,KAAKlG,IAAIujB,EAAMqI,GAEnBV,EAAOhjB,EAAOzB,MAAMnI,EAAEmwB,OAEtBqa,KACAC,GAASxlB,EAAMzW,GAEfk8B,KACAC,GAASn8B,EAAG8e,GAEZptB,EAAIgwB,EAAYb,UAAUpK,EAAMA,GAAO,EAAG,EAI9C,KAAKvhB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAKR,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IAAK,CAEzB,GAAIxB,GAAMkG,KAAKlG,IAAIwB,EAAGQ,GAElBiT,EAAI,CAER,KAAK7I,EAAI,EAAOpM,EAAJoM,EAASA,IAEnB6I,EAAI+Q,EAAI/Q,EAAG0R,EAASuE,EAAK1pB,GAAG4K,GAAI8e,EAAK9e,GAAGpK,IAE1CkpB,GAAK1pB,GAAGQ,GAAKglB,EAASkE,EAAK1pB,GAAGQ,GAAIiT,GAItC,GAAIyQ,GAAK1jB,EACLknC,EAAQ,EACRC,EAAM,CAEV,KAAK3nC,EAAIQ,EAAOuhB,EAAJ/hB,EAAUA,IAAK,CAEzB,GAAIqqB,GAAIX,EAAK1pB,GAAGQ,GAEZonC,EAAOniC,EAAI4kB,EAEXpQ,GAAO2tB,EAAMF,KAEfxjB,EAAKlkB,EAEL0nC,EAAQE,EAERD,EAAMtd,GAWV,GAPI7pB,IAAM0jB,IAER8I,EAAYP,UAAUjsB,EAAG0jB,EAAIlnB,EAAEiwB,OAE/BD,EAAYP,UAAUjsB,EAAG0jB,EAAIwF,IAGvB3H,EAAJvhB,EAEF,IAAKR,EAAIQ,EAAI,EAAOuhB,EAAJ/hB,EAAUA,IAAK,CAE7B,GAAI6nC,GAAMne,EAAK1pB,GAAGQ,EACb0pB,GAAM2d,EAAK,KAEdne,EAAK1pB,GAAGQ,GAAKwxB,EAAatI,EAAK1pB,GAAGQ,GAAImnC,KAM9C,IAAKnnC,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAEvB,IAAKR,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IAEV,IAANQ,IAEM4pB,EAAJpqB,IAEFwnC,EAAMxnC,OAGRsnC,EAAMtnC,OAGAQ,EAAJR,GAEMoqB,EAAJpqB,IAEFwnC,EAAMxnC,GAAGQ,GAAKkpB,EAAK1pB,GAAGQ,IAGhBuhB,EAAJvhB,IAEF8mC,EAAMtnC,GAAGQ,GAAK,IAKdR,IAAMQ,GAcF4pB,EAAJpqB,IAEFwnC,EAAMxnC,GAAGQ,GAAK,GAGRuhB,EAAJvhB,IAEF8mC,EAAMtnC,GAAGQ,GAAKkpB,EAAK1pB,GAAGQ,MAnBd4pB,EAAJpqB,IAEFwnC,EAAMxnC,GAAGQ,GAAKkpB,EAAK1pB,GAAGQ,IAGhBuhB,EAAJvhB,IAEF8mC,EAAMtnC,GAAGQ,GAAK,GAiBtB,IAAImQ,GAAK,GAAIqc,IACXtD,KAAM4d,EACNxlC,KAAMylC,IAGJl8B,EAAK,GAAI2hB,IACXtD,KAAM8d,EACN1lC,KAAM2lC,GAGR,QACE/2B,EAAGC,EACH02B,EAAGh8B,EACHL,EAAGhO,EACH0I,SAAU,WACR,MAAO,MAAQpJ,KAAKoU,EAAEhL,WAAa,QAAUpJ,KAAK+qC,EAAE3hC,WAAa,QAAUpJ,KAAK0O,EAAEtF,cAKpF0hC,EAAa,SAAUtqC,GAEzB,GAwBIkD,GAAGQ,EAAGoK,EAxBNmX,EAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElBzO,EAAI5G,KAAKlG,IAAIujB,EAAMqI,GAEnB3iB,EAAS3K,EAAE+sB,QACXzrB,EAAQtB,EAAEgtB,OACVF,EAAM9sB,EAAEitB,KAER+d,KACAC,KACAC,KACAT,GAASxlB,EAAMzW,GAEf28B,KACAC,KACAC,KACAV,GAASn8B,EAAG8e,GAEZge,KACAC,KACAC,KACAC,GAASxmB,EAAMA,GAIfymB,EAAQ,GAAIpoC,OAAM2hB,GAClB0mB,EAAQ,GAAIroC,OAAM2hB,EACtB,KAAK/hB,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IACpBwoC,EAAMxoC,GAAKA,EACXyoC,EAAMzoC,GAAKA,CAGb,IAAI0oC,GAAc,SAAUtnC,EAAGsK,GAE7B,GAAIihB,GAAK8b,EAAMrnC,GACXwrB,EAAK6b,EAAM/8B,EAEf88B,GAAM7b,GAAMjhB,EACZ88B,EAAM5b,GAAMxrB,EAEZqnC,EAAMrnC,GAAKwrB,EACX6b,EAAM/8B,GAAKihB,EAGb,KAAKnsB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAE5B,GAAIs0B,GAAM,GAAI5G,GAAInM,EAEVA,GAAJvhB,IAEFwnC,EAAK5oC,KAAK0oC,EAAQvnC,QAElBunC,EAAQ1oC,KAAK,GACb2oC,EAAO3oC,KAAKoB,IAGd2nC,EAAK/oC,KAAK6oC,EAAQ1nC,OAElB,IAAImrB,GAAK9B,EAAIppB,GACTmrB,EAAK/B,EAAIppB,EAAI,EAEjB,KAAKoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAEnB5K,EAAI5B,EAAMwM,GAEVkqB,EAAIzsB,IAAImgC,EAAMxoC,GAAIyH,EAAOmD,GAGvBpK,GAAI,GAENs0B,EAAI32B,QAAQ,EAAGqC,EAAI,EAAG,SAAUoK,EAAG+9B,GAEjClf,EAAaiD,YAAY9hB,EAAGk9B,EAASC,EAAQC,EAAM,SAAUhoC,EAAG4oC,GAE1D5oC,EAAI4K,GAENkqB,EAAI1G,WAAWpuB,EAAGylB,EAAWN,EAASyjB,EAAKD,QAMnD,IAAIzkB,GAAK1jB,EACLmnC,EAAM7S,EAAI1sB,IAAI5H,GACdknC,EAAQjiC,EAAIkiC,EAEhB7S,GAAI32B,QAAQqC,EAAI,EAAGuhB,EAAO,EAAG,SAAU3gB,EAAGipB,GAExC,GAAIud,GAAOniC,EAAI4kB,EAEXpQ,GAAO2tB,EAAMF,KAEfxjB,EAAK9iB,EAELsmC,EAAQE,EAERD,EAAMtd,KAIN7pB,IAAM0jB,IAERuF,EAAagD,UAAUjsB,EAAG0jB,EAAIqjB,EAAM,GAAIO,EAASC,EAAQC,GAEzDve,EAAagD,UAAUjsB,EAAG0jB,EAAIujB,EAAM,GAAIQ,EAASC,EAAQC,GAEzDrT,EAAIvG,KAAK/tB,EAAG0jB,GAEZwkB,EAAYloC,EAAG0jB,IAGjB4Q,EAAI32B,QAAQ,EAAG4jB,EAAO,EAAG,SAAU3gB,EAAGipB,GAE3B7pB,GAALY,GAEF6mC,EAAQ7oC,KAAKirB,GACb6d,EAAO9oC,KAAKgC,KAIZipB,EAAI2H,EAAa3H,EAAGsd,GAEfzd,EAAMG,EAAG,KAEZyd,EAAQ1oC,KAAKirB,GACb0d,EAAO3oC,KAAKgC,OASpB,IAHA4mC,EAAK5oC,KAAK0oC,EAAQvnC,QAClB4nC,EAAK/oC,KAAK6oC,EAAQ1nC,QAEbP,EAAI,EAAO+hB,EAAJ/hB,EAAUA,IAEpBsoC,EAAKlpC,KAAKgpC,EAAQ7nC,QAElB6nC,EAAQhpC,KAAK,GAEbipC,EAAOjpC,KAAKopC,EAAMxoC,GAKpB,OAFAsoC,GAAKlpC,KAAKgpC,EAAQ7nC,SAGhBmQ,EAAG,GAAI+Y,IACLhiB,OAAQqgC,EACR1pC,MAAO2pC,EACPne,IAAKoe,EACLlmC,KAAMylC,IAERF,EAAG,GAAI5d,IACLhiB,OAAQwgC,EACR7pC,MAAO8pC,EACPte,IAAKue,EACLrmC,KAAM2lC,IAERz8B,EAAG,GAAIye,IACLhiB,OAAQ2gC,EACRhqC,MAAOiqC,EACPze,IAAK0e,EACLxmC,KAAMymC,IAER7iC,SAAU,WACR,MAAO,MAAQpJ,KAAKoU,EAAEhL,WAAa,QAAUpJ,KAAK+qC,EAAE3hC,WAAa,QAAUpJ,KAAK0O,EAAEtF,aAKxF,OAAOwhC,GAxXT,GAAIhmC,GAAO1E,EAAoB,KAE3BkK,EAASxF,EAAKwF,MAyXlBxK,GAAQkG,KAAO,MACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAIA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClC0qC,EAAMpoC,EAAKtC,EAAoB,MAC/B2oB,EAAWrmB,EAAKtC,EAAoB,KAEpCqsC,EAAuB/pC,EAAKtC,EAAoB,MAChDssC,EAAsBhqC,EAAKtC,EAAoB,MA8B/CusC,EAAU5pC,EAAM,WAClB6pC,wBAAyB,SAAUx9B,EAAG4J,GAEpC5J,EAAIjM,EAAOiM,EAEX,IAAIJ,GAAI87B,EAAI17B,GAERpK,EAAI6nC,EAAS79B,EAAEsF,EAAGtF,EAAEi8B,EAAGj8B,EAAEJ,EAAGoK,EAEhC,OAAOhU,GAAEH,WAEXioC,yBAA0B,SAAU19B,EAAG4J,GAErC,GAAIhK,GAAI87B,EAAI17B,EAEZ,OAAOy9B,GAAS79B,EAAEsF,EAAGtF,EAAEi8B,EAAGj8B,EAAEJ,EAAGoK,IAEjC+zB,yBAA0B,SAAU/9B,EAAGgK,GAErC,MAAO6zB,GAAS79B,EAAEsF,EAAGtF,EAAEi8B,EAAGj8B,EAAEJ,EAAGoK,MAI/Bg0B,EAAY,SAAU59B,GAExB,GAAIA,YAAa/N,GAAKuD,OACpB,MAAOwK,EAET,IAAInL,EAAQmL,GACV,MAAOjM,GAAOiM,EAEhB,MAAM,IAAIzI,WAAU,qCAGlBkmC,EAAW,SAAUt4B,EAAGtF,EAAGrO,EAAGoY,GAEhCzE,EAAIy4B,EAAUz4B,GACdtF,EAAI+9B,EAAU/9B,GACdrO,EAAIosC,EAAUpsC,GAEdoY,EAAI+P,EAASnoB,EAAGoY,EAEhB,IAAI1J,GAAIo9B,EAAoBn4B,EAAGyE,EAE/B,OAAOyzB,GAAqBx9B,EAAGK,GAGjC,OAAOq9B,GAtFT,GAAI1oC,GAAUD,MAAMC,OAyFpBnE,GAAQkG,KAAO,UACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,IAAIid,GAAYjd,EAAoB,IAapCN,GAAQ+I,MAAQ,QAASA,GAAM7D,GAC7B,GAAI3D,SAAc2D,EAGlB,IAAa,WAAT3D,GAA8B,WAATA,GAA8B,YAATA,GACpC,OAAN2D,GAAoB0F,SAAN1F,EAChB,MAAOA,EAIT,IAAuB,kBAAZA,GAAE6D,MACX,MAAO7D,GAAE6D,OAIX,IAAI7E,MAAMC,QAAQe,GAChB,MAAOA,GAAE/C,IAAI,SAAU8D,GACrB,MAAO8C,GAAM9C,IAIjB,IAAIf,YAAa8C,QAAW,MAAO,IAAIA,QAAO9C,EAAEH,UAChD,IAAIG,YAAai5B,QAAW,MAAO,IAAIA,QAAOj5B,EAAEH,UAChD,IAAIG,YAAaioC,SAAW,MAAO,IAAIA,SAAQjoC,EAAEH;;AACjD,GAAIG,YAAakoC,MAAW,MAAO,IAAIA,MAAKloC,EAAEH,UAC9C,IAAIG,YAAaqY,GAAW,MAAOrY,EACnC,IAAIA,YAAamoC,QAAS,KAAM,IAAIxmC,WAAU,gBAAkB3B,EAGhE,IAAItE,KACJ,KAAK,GAAIsd,KAAOhZ,GACVA,EAAE8H,eAAekR,KACnBtd,EAAEsd,GAAOnV,EAAM7D,EAAEgZ,IAGrB,OAAOtd,IASTZ,EAAQstC,OAAS,SAASh+B,EAAG4J,GAC3B,IAAK,GAAImE,KAAQnE,GACXA,EAAElM,eAAeqQ,KACnB/N,EAAE+N,GAAQnE,EAAEmE,GAGhB,OAAO/N,IASTtP,EAAQ2pC,WAAa,QAASA,GAAYr6B,EAAG4J,GAE3C,GAAIhV,MAAMC,QAAQ+U,GAChB,KAAM,IAAIrS,WAAU,yCAGtB,KAAK,GAAIwW,KAAQnE,GACf,GAAIA,EAAElM,eAAeqQ,GACnB,GAAInE,EAAEmE,IAASnE,EAAEmE,GAAMvR,cAAgB1I,OACrBwH,SAAZ0E,EAAE+N,KACJ/N,EAAE+N,OAEA/N,EAAE+N,GAAMvR,cAAgB1I,OAC1BumC,EAAWr6B,EAAE+N,GAAOnE,EAAEmE,IAGtB/N,EAAE+N,GAAQnE,EAAEmE,OAET,CAAA,GAAInZ,MAAMC,QAAQ+U,EAAEmE,IACzB,KAAM,IAAIxW,WAAU,yCAEpByI,GAAE+N,GAAQnE,EAAEmE,GAIlB,MAAO/N,IASTtP,EAAQyrB,UAAY,SAAoBnc,EAAG4J,GACzC,GAAImE,GAAMvZ,EAAG2B,CACb,IAAIvB,MAAMC,QAAQmL,GAAI,CACpB,IAAKpL,MAAMC,QAAQ+U,GACjB,OAAO,CAGT,IAAI5J,EAAEjL,QAAU6U,EAAE7U,OAChB,OAAO,CAGT,KAAKP,EAAI,EAAG2B,EAAM6J,EAAEjL,OAAYoB,EAAJ3B,EAASA,IACnC,IAAK9D,EAAQyrB,UAAUnc,EAAExL,GAAIoV,EAAEpV,IAC7B,OAAO,CAGX,QAAO,EAEJ,GAAIwL,YAAalM,QAAQ,CAC5B,GAAIc,MAAMC,QAAQ+U,MAAQA,YAAa9V,SACrC,OAAO,CAGT,KAAKia,IAAQ/N,GAEX,IAAKtP,EAAQyrB,UAAUnc,EAAE+N,GAAOnE,EAAEmE,IAChC,OAAO,CAGX,KAAKA,IAAQnE,GAEX,IAAKlZ,EAAQyrB,UAAUnc,EAAE+N,GAAOnE,EAAEmE,IAChC,OAAO,CAGX,QAAO,EAGP,aAAe/N,UAAa4J,IAAO5J,GAAK4J,GAQ5ClZ,EAAQutC,kBAAoB,WAE1B,IACE,GAAInqC,OAAOoqC,eAET,MADApqC,QAAOoqC,kBAAmB,SACnB,EAET,MAAOrwB,IAET,OAAO,GAaTnd,EAAQytC,KAAO,SAAUjjC,EAAQ6S,EAAMgG,GACrC,GAAIrjB,EAAQutC,oBAAqB,CAC/B,GACInd,GADAsd,GAAiB,CAErBtqC,QAAOoqC,eAAehjC,EAAQ6S,GAC5BnR,IAAK,WAKH,MAJIwhC,KACFtd,EAAS/M,IACTqqB,GAAiB,GAEZtd,GAGTjkB,IAAK,SAAUlG,GACbmqB,EAASnqB,EACTynC,GAAiB,GAGnBC,cAAc,QAKhBnjC,GAAO6S,GAAQgG,KAWnBrjB,EAAQ4tC,SAAW,SAASpjC,EAAQ6B,GAClC,GAAIxB,GAAML,CAEV,IAAI6B,EAEF,IAAK,GADDwhC,GAAQxhC,EAAKpC,MAAM,KACdnG,EAAI,EAAGA,EAAI+pC,EAAMxpC,OAAQP,IAAK,CACrC,GAAIoC,GAAO2nC,EAAM/pC,EACXoC,KAAQ2E,KACZA,EAAI3E,OAEN2E,EAAMA,EAAI3E,GAId,MAAO2E,IAUT7K,EAAQ2C,UAAY,SAAU6H,GAC5B,MAA8B,gBAAhBA,GAAOtE,MAA+C,kBAAnBsE,GAAOzK,UAMrD,SAASE,EAAQD,EAASM,GAE/B,GAAI2C,GAAQ3C,EAAoB,KAC5Bod,EAASpd,EAAoB,KAAKod,MAOtC1d,GAAQe,OAAS,SAAgBE,GA0F/B,MArFAgC,GAAM8qB,MAAe,QAAO,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKC,SACzEyB,EAAM8qB,MAAa,MAAS,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKE,OACzEwB,EAAM8qB,MAAa,MAAS,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKG,OACzEuB,EAAM8qB,MAAc,OAAQ,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKuD,QACzE7B,EAAM8qB,MAAY,KAAU,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKI,MACzEsB,EAAM8qB,MAAY,KAAU,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKK,MACzEqB,EAAM8qB,MAAiB,UAAK,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKM,WACzEoB,EAAM8qB,MAAiB,UAAK,SAAU7oB,GAAK,MAAOA,aAAajE,GAAKM,KAAKgc,WAEzEta,EAAM6qC,cAEF3b,KAAM,SACNvkB,GAAI,YACJ6P,QAAS,SAAUvY,GAEjB,GAAIwY,EAAOxY,GAAK,GACd,KAAM,IAAI2B,WAAU,uFACP3B,EAAI,wDAGnB,OAAO,IAAIjE,GAAKM,KAAKgc,UAAUrY,MAGjCitB,KAAM,SACNvkB,GAAI,UACJ6P,QAAS,SAAUvY,GACjB,MAAO,IAAIjE,GAAKM,KAAKC,QAAQ0D,EAAG,MAGlCitB,KAAM,SACNvkB,GAAI,SACJ6P,QAAS,SAAUvY,GACjB,MAAOA,GAAI,MAGbitB,KAAM,YACNvkB,GAAI,UACJ6P,QAAS,SAAUvY,GACjB,MAAO,IAAIjE,GAAKM,KAAKC,QAAQ0D,EAAEqD,WAAY,MAG7C4pB,KAAM,UACNvkB,GAAI,SACJ6P,QAAS,SAAUvY,GACjB,OAAQA,KAGVitB,KAAM,UACNvkB,GAAI,YACJ6P,QAAS,SAAUvY,GACjB,MAAO,IAAIjE,GAAKM,KAAKgc,WAAWrY,MAGlCitB,KAAM,UACNvkB,GAAI,SACJ6P,QAAS,SAAUvY,GACjB,OAAQA,KAGVitB,KAAM,OACNvkB,GAAI,SACJ6P,QAAS,WACP,MAAO,MAGT0U,KAAM,OACNvkB,GAAI,SACJ6P,QAAS,WACP,MAAO,UAGT0U,KAAM,OACNvkB,GAAI,YACJ6P,QAAS,WACP,MAAO,IAAIxc,GAAKM,KAAKgc,UAAU,MAGjC4U,KAAM,QACNvkB,GAAI,SACJ6P,QAAS,SAAU5Y,GACjB,MAAO,IAAI5D,GAAKM,KAAKuD,OAAOD,MAK3B5B,IAMJ,SAAShD,EAAQD,EAASM,GAE/B,YAOA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,EAAOhC,GA8C3C,QAAS8sC,GAAYvjC,EAAQrB,GAC3B,GAAIkB,GAAM/D,UAAUjC,MACpB,IAAW,GAAPgG,GAAmB,GAAPA,EACd,KAAM,IAAIpJ,GAAKwC,MAAMmc,eAAe,SAAUvV,EAAK,EAAG,EAGxD,IAAInE,GACA8nC,GACFC,SAAU9kC,GAAWA,EAAQ8kC,WAAY,EACzCC,KAAU/kC,GAAWA,EAAQ+kC,OAAQ,EAGvC,IAAsB,gBAAX1jC,GAAqB,CAQ9B,GAAI2jC,GAAU7tC,EAAoB,KAAKkK,EACvC,OAAOujC,GAAYI,EAAShlC,GAEzB,GAAIxG,EAAU6H,GACjB,MAAO4jC,GAAe5jC,EAEnB,IAAsB,gBAAXA,GAAqB,CAEnC,GAAI6jC,KAEJ,KAAKnoC,IAAQsE,GACX,GAAIA,EAAOwC,eAAe9G,GAAO,CAC/B,GAAID,GAAQuE,EAAOtE,EACfooC,GAAgBroC,GAClBooC,EAASnoC,GAAQqoC,EAAQroC,EAAMD,EAAO+nC,GAE/BrrC,EAAU6H,GACjB6jC,EAASnoC,GAAQkoC,EAAe5jC,GAGhC6jC,EAASnoC,GAAQ6nC,EAAY9nC,EAAOkD,GAK1C,MAAOklC,GAGP,KAAM,IAAIxnC,WAAU,kCAYxB,QAAS0nC,GAAQroC,EAAMD,EAAOkD,GAE5B,MAAIA,GAAQ8kC,UAA2BrjC,SAAf3J,EAAKiF,IAEvBiD,EAAQ+kC,MAAyB,kBAAVjoC,IAEzBhF,EAAKiF,GAAQ,WAEX,IAAK,GADDtB,MACKd,EAAI,EAAG2B,EAAMa,UAAUjC,OAAYoB,EAAJ3B,EAASA,IAAK,CACpD,GAAIyC,GAAMD,UAAUxC,EACpBc,GAAKd,GAAKyC,GAAOA,EAAIxB,UAEvB,MAAOkB,GAAMqF,MAAMrK,EAAM2D,IAEvBqB,GAASA,EAAMnE,YACjBb,EAAKiF,GAAMpE,UAAYmE,EAAMnE,YAK/Bb,EAAKiF,GAAQD,EAIXA,GAASA,EAAMnE,YACjBb,EAAKG,WAAWU,UAAUoE,GAAQD,EAAMnE,WAI1Cb,EAAKM,KAAKkB,MAAMC,YAAYwD,EAAMD,GAE3BA,GA7BT,OAuCF,QAASmoC,GAAeruC,GACtB,GAAI+C,GAAWF,EAAK7C,GAChByuC,EAAYzuC,EAAQsM,KAAOuhC,EAAS3sC,EAAMlB,EAAQsM,MAAQpL,CAE9D,IAAIutC,EAAUzuC,EAAQmG,MAEpB,KAAM,IAAIrD,OAAM,IAAM9C,EAAQmG,KAAO,mBAIvC,OAFAsoC,GAAUzuC,EAAQmG,MAAQpD,EAEnBA,EAST,QAASwrC,GAAgB9jC,GACvB,MAAwB,kBAAVA,IACW,gBAAXA,IACW,gBAAXA,IACW,iBAAXA,IACI,OAAXA,GACAA,YAAkBjJ,GAAKI,MACvB6I,YAAkBjJ,GAAKC,QAGhC,MAAOusC,GArLT,GAAIprC,GAAYrC,EAAoB,KAAKqC,UACrCirC,EAAWttC,EAAoB,KAAKstC,QAuLxC5tC,GAAQiB,MAAO,EACfjB,EAAQkG,KAAO,SACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEAL,GAAOD,QAAU,SAAUiB,EAAMD,GAC/B,GAAIwJ,GAASlK,EAAoB,KAC7B4pB,EAAY5pB,EAAoB,KAChCkB,EAAUlB,EAAoB,GAC9Bid,EAAYtc,EAAKM,KAAKgc,SAE1Btc,GAAK,SAAc,EACnBA,EAAK,UAAc,EACnBA,EAAK,QAAc,KACnBA,EAAoB,cAAIX,EAAoB,KAAKmuC,cAE3B,cAAlBztC,EAAOsC,QACTrC,EAAe,SAAI,GAAIsc,GAAUimB,EAAAA,GACjCviC,EAAU,IAAS,GAAIsc,GAAUwK,EAAAA,GAEjCvd,EAAOijC,KAAKxsC,EAAM,KAAO,WAAa,MAAOipB,GAAUlC,GAAGhnB,EAAOuC,aACjEiH,EAAOijC,KAAKxsC,EAAM,MAAO,WAAa,MAAOipB,GAAU9B,IAAIpnB,EAAOuC,aAClEiH,EAAOijC,KAAKxsC,EAAM,IAAO,WAAa,MAAOipB,GAAU/M,EAAEnc,EAAOuC,aAChEiH,EAAOijC,KAAKxsC,EAAM,MAAO,WAAa,MAAOipB,GAAUvjB,IAAI3F,EAAOuC,aAGlEiH,EAAOijC,KAAKxsC,EAAM,IAAW,WAAa,MAAOA,GAAKkc,IACtD3S,EAAOijC,KAAKxsC,EAAM,MAAW,WAAa,MAAO,IAAIsc,GAAU,GAAG4Z,OAClE3sB,EAAOijC,KAAKxsC,EAAM,OAAW,WAAa,MAAO,IAAIsc,GAAU,IAAI4Z,OACnE3sB,EAAOijC,KAAKxsC,EAAM,QAAW,WAAa,MAAO,IAAIsc,GAAU,GAAGyZ,IAAI,GAAIzZ,GAAU,GAAG4Z,QACvF3sB,EAAOijC,KAAKxsC,EAAM,SAAW,WAAa,MAAO,IAAIsc,GAAU,GAAGyZ,IAAI,GAAIzZ,GAAU,IAAI4Z,QACxF3sB,EAAOijC,KAAKxsC,EAAM,KAAW,WAAa,MAAOA,GAAK+mB,KACtDxd,EAAOijC,KAAKxsC,EAAM,UAAW,WAAa,MAAO,IAAIsc,GAAU,OAAO1U,SACtE2B,EAAOijC,KAAKxsC,EAAM,QAAW,WAAa,MAAO,IAAIsc,GAAU,GAAG1U,WAGlE5H,EAAe,SAAIuiC,EAAAA,EACnBviC,EAAU,IAAS8mB,EAAAA,EAEnB9mB,EAAK+mB,GAAMxf,KAAKyf,GAChBhnB,EAAKmnB,IAAgB,EAAV5f,KAAKyf,GAChBhnB,EAAKkc,EAAM3U,KAAKuG,EAChB9N,EAAK0F,IAAM,kBAGX1F,EAAK8N,EAAc9N,EAAKkc,EACxBlc,EAAK2mB,IAAcpf,KAAKof,IACxB3mB,EAAKkN,KAAc3F,KAAK2F,KACxBlN,EAAK4mB,MAAcrf,KAAKqf,MACxB5mB,EAAK6mB,OAActf,KAAKsf,OACxB7mB,EAAKgnB,GAAchnB,EAAK+mB,GACxB/mB,EAAKinB,QAAc1f,KAAK0f,QACxBjnB,EAAKknB,MAAc3f,KAAK2f,OAI1BlnB,EAAK6C,EAAI,GAAItC,GAAQ,EAAG,GAGxBP,EAAKonB,QAAU/nB,EAAoB,OAMhC,SAASL,EAAQD,EAASM,GAE/B,YAEAN,GAAQ4f,eAAiBtf,EAAoB,KAC7CN,EAAQ0F,eAAiBpF,EAAoB,KAC7CN,EAAQ8F,WAAaxF,EAAoB,KACzCN,EAAQqzB,qBAAuB/yB,EAAoB,MAO9C,SAASL,EAAQD,EAASM,GAE/B,YAEAN,GAAQ6E,MAAQvE,EAAoB,KACpCN,EAAQ,WAAaM,EAAoB,KACzCN,EAAQ,YAAcM,EAAoB,KAC1CN,EAAQsD,OAAShD,EAAoB,KACrCN,EAAQkqB,UAAY5pB,EAAoB,KACxCN,EAAQwK,OAASlK,EAAoB,KACrCN,EAAQ2H,OAASrH,EAAoB,KACrCN,EAAQ+tB,MAAQztB,EAAoB,MAK/B,SAASL,EAAQD,EAASM,GAE/B,YAkBA,SAASud,GAAM3Y,GAGb,IAFA,GAAIU,MAEGzB,EAAQe,IACbU,EAAK1C,KAAKgC,EAAEb,QACZa,EAAIA,EAAE,EAGR,OAAOU,GA+BT,QAAS8oC,GAAU7pC,EAAOe,EAAMhC,GAC9B,GAAIE,GACA2B,EAAMZ,EAAMR,MAEhB,IAAIoB,GAAOG,EAAKhC,GACd,KAAM,IAAI8B,GAAeD,EAAKG,EAAKhC,GAGrC,IAAIA,EAAMgC,EAAKvB,OAAS,EAAG,CAEzB,GAAIsqC,GAAU/qC,EAAM,CACpB,KAAKE,EAAI,EAAO2B,EAAJ3B,EAASA,IAAK,CACxB,GAAI6a,GAAQ9Z,EAAMf,EAClB,KAAKK,EAAQwa,GACX,KAAM,IAAIjZ,GAAeE,EAAKvB,OAAS,EAAGuB,EAAKvB,OAAQ,IAEzDqqC,GAAU7pC,EAAMf,GAAI8B,EAAM+oC,QAK5B,KAAK7qC,EAAI,EAAO2B,EAAJ3B,EAASA,IACnB,GAAIK,EAAQU,EAAMf,IAChB,KAAM,IAAI4B,GAAeE,EAAKvB,OAAS,EAAGuB,EAAKvB,OAAQ,KA2F/D,QAAS2qB,GAASnqB,EAAOe,EAAMhC,EAAKqI,GAClC,GAAInI,GACAkc,EACA4uB,EAAS/pC,EAAMR,OACfwqC,EAASjpC,EAAKhC,GACdkrC,EAAStmC,KAAKlG,IAAIssC,EAAQC,EAK9B,IAFAhqC,EAAMR,OAASwqC,EAEXjrC,EAAMgC,EAAKvB,OAAS,EAAG,CAEzB,GAAIsqC,GAAU/qC,EAAM,CAGpB,KAAKE,EAAI,EAAOgrC,EAAJhrC,EAAYA,IAEtBkc,EAAOnb,EAAMf,GACRK,EAAQ6b,KACXA,GAAQA,GACRnb,EAAMf,GAAKkc,GAEbgP,EAAQhP,EAAMpa,EAAM+oC,EAAS1iC,EAI/B,KAAKnI,EAAIgrC,EAAYD,EAAJ/qC,EAAYA,IAE3Bkc,KACAnb,EAAMf,GAAKkc,EAGXgP,EAAQhP,EAAMpa,EAAM+oC,EAAS1iC,OAG5B,CAIH,IAAKnI,EAAI,EAAOgrC,EAAJhrC,EAAYA,IACtB,KAAOK,EAAQU,EAAMf,KACnBe,EAAMf,GAAKe,EAAMf,GAAG,EAIxB,IAAGmI,IAAiBjM,EAAQyuC,cAE1B,IAAK3qC,EAAIgrC,EAAYD,EAAJ/qC,EAAYA,IAC3Be,EAAMf,GAAK0G,EAAOzB,MAAMkD,IA4ChC,QAAS8iC,GAAUlqC,EAAOssB,EAAMvtB,GAC9B,GAAIE,GAAGkC,CAEP,IAAUmrB,EAANvtB,EAAY,CACd,GAAImD,GAAOnD,EAAM,CACjB,KAAKE,EAAI,EAAGkC,EAAKnB,EAAMR,OAAY2B,EAAJlC,EAAQA,IACrCe,EAAMf,GAAKirC,EAASlqC,EAAMf,GAAIqtB,EAAMpqB,OAItC,MAAO5C,EAAQU,IACbA,EAAQA,EAAM,EAIlB,OAAOA,GAwCT,QAASmqC,GAAYnqC,EAAOssB,EAAMvtB,GAChC,GAAIE,GAAGkC,CAEP,IAAI7B,EAAQU,GAAQ,CAClB,GAAIkC,GAAOnD,EAAM,CACjB,KAAKE,EAAI,EAAGkC,EAAKnB,EAAMR,OAAY2B,EAAJlC,EAAQA,IACrCe,EAAMf,GAAKkrC,EAAWnqC,EAAMf,GAAIqtB,EAAMpqB,OAIxC,KAAK,GAAImI,GAAItL,EAASutB,EAAJjiB,EAAUA,IAC1BrK,GAASA,EAIb,OAAOA,GA3UT,GAAIvB,GAAShD,EAAoB,KAC7BqH,EAASrH,EAAoB,KAC7BkK,EAASlK,EAAoB,KAG7BoF,GAFQpF,EAAoB,KAEXA,EAAoB,MACrCwF,EAAaxF,EAAoB,KAEjC6D,EAAUD,MAAMC,OA2BpBnE,GAAQ4F,KAAO,SAASV,GAEtB,GAAIqS,GAAIsG,EAAM3Y,EAMd,OAHAlF,GAAQivC,SAAS/pC,EAAGqS,GAGbA,GAgDTvX,EAAQivC,SAAW,SAASpqC,EAAOe,GACjC,GAAI4F,GAA2B,GAAf5F,EAAKvB,MACrB,IAAImH,GAEF,GAAIrH,EAAQU,GACV,KAAM,IAAIa,GAAeb,EAAMR,OAAQ,OAKzCqqC,GAAU7pC,EAAOe,EAAM,IAS3B5F,EAAQsuB,cAAgB,SAASpsB,EAAOmC,GACtC,IAAKf,EAAOsD,SAAS1E,KAAWoB,EAAO8H,UAAUlJ,GAC/C,KAAM,IAAI2E,WAAU,oCAAsC3E,EAAQ,IAEpE,IAAY,EAARA,EACF,KAAM,IAAI4D,GAAW5D,EAEvB,IAAe0I,SAAXvG,GAAwBnC,GAASmC,EACnC,KAAM,IAAIyB,GAAW5D,EAAOmC,IAKhCrE,EAAQyuC,iBAWRzuC,EAAQoM,OAAS,SAASvH,EAAOe,EAAMqG,GAIrC,IAAK9H,EAAQU,KAAWV,EAAQyB,GAC9B,KAAM,IAAIiB,WAAU,iBAEtB,IAAoB,IAAhBjB,EAAKvB,OACP,KAAM,IAAIxB,OAAM,sCAIlB+C,GAAK3D,QAAQ,SAAUgE,GACrB,IAAK3C,EAAOsD,SAASX,KAAW3C,EAAO8H,UAAUnF,IAAkB,EAARA,EACzD,KAAM,IAAIY,WAAU,uDACJc,EAAOuB,OAAOtD,GAAQ,MAK1C,IAAIspC,GAAkCtkC,SAAjBqB,EAA8BA,EAAe,CAGlE,OAFA+iB,GAAQnqB,EAAOe,EAAM,EAAGspC,GAEjBrqC,GAwET7E,EAAQ6qB,QAAU,SAAShmB,EAAOe,GAIhC,IAHA,GAAI2R,GAAI3R,GAAQ5F,EAAQ4F,KAAKf,GAGtBV,EAAQU,IAA2B,IAAjBA,EAAMR,QAC7BQ,EAAQA,EAAM,GACd0S,EAAEynB,OAKJ,KADA,GAAI7N,GAAO5Z,EAAElT,OACU,IAAhBkT,EAAE4Z,EAAO,IACdA,GASF,OALIA,GAAO5Z,EAAElT,SACXQ,EAAQkqC,EAASlqC,EAAOssB,EAAM,GAC9B5Z,EAAElT,OAAS8sB,GAGNtsB,GAsCT7E,EAAQ4uB,UAAY,SAAS/pB,EAAOssB,EAAMxC,EAAO/oB,GAC/C,GAAI2R,GAAI3R,GAAQ5F,EAAQ4F,KAAKf,EAG7B,IAAI8pB,EACF,IAAK,GAAI7qB,GAAI,EAAO6qB,EAAJ7qB,EAAWA,IACzBe,GAASA,GACT0S,EAAE43B,QAAQ,EAMd,KADAtqC,EAAQmqC,EAAWnqC,EAAOssB,EAAM,GACzB5Z,EAAElT,OAAS8sB,GAChB5Z,EAAErU,KAAK,EAGT,OAAO2B,IAmCT7E,EAAQ0qB,QAAU,SAAS7lB,GAIzB,IAHA,GAAIk8B,GAAOl8B,EACPV,EAAUD,MAAMC,QAEbA,EAAQ48B,EAAK,KAAK,CAEvB,IAAK,GADDh6B,MACKjD,EAAI,EAAGkC,EAAK+6B,EAAK18B,OAAY2B,EAAJlC,EAAQA,IACxCiD,EAAOA,EAAKhF,OAAOuJ,MAAMvE,EAAMg6B,EAAKj9B,GAEtCi9B,GAAOh6B,EAGT,MAAOg6B,IAQT/gC,EAAQ2E,YAAc,SAASC,GAE7B,IAAK,GADDC,MACKf,EAAI,EAAG2B,EAAMb,EAAKP,OAAYoB,EAAJ3B,EAASA,IAC1Ce,EAAMf,GAAKc,EAAKd,EAElB,OAAOe,IAQT7E,EAAQmE,QAAUA,GAIb,SAASlE,EAAQD,EAASM,GAE/B,YAYA,SAASwF,GAAW5D,EAAOI,EAAKF,GAC9B,KAAMhC,eAAgB0F,IACpB,KAAM,IAAIO,aAAY,mDAGxBjG,MAAK8B,MAAQA,EACToE,UAAUjC,OAAS,GACrBjE,KAAKkC,IAAM,EACXlC,KAAKgC,IAAME,IAGXlC,KAAKkC,IAAMA,EACXlC,KAAKgC,IAAMA,GAGIwI,SAAbxK,KAAKkC,KAAqBlC,KAAK8B,MAAQ9B,KAAKkC,IAC9ClC,KAAKgmB,QAAU,uBAAyBhmB,KAAK8B,MAAQ,MAAQ9B,KAAKkC,IAAM,IAEpDsI,SAAbxK,KAAKgC,KAAqBhC,KAAK8B,OAAS9B,KAAKgC,IACpDhC,KAAKgmB,QAAU,uBAAyBhmB,KAAK8B,MAAQ,OAAS9B,KAAKgC,IAAM,GAAK,IAG9EhC,KAAKgmB,QAAU,uBAAyBhmB,KAAK8B,MAAQ,IAGvD9B,KAAKgvC,OAAQ,GAAKvsC,QAASusC,MAG7BtpC,EAAW6C,UAAY,GAAIwsB,YAC3BrvB,EAAW6C,UAAUmD,YAAcqpB,WACnCrvB,EAAW6C,UAAUzC,KAAO,aAE5BjG,EAAOD,QAAU8F,GAKZ,SAAS7F,EAAQD,EAASM,GAE/B,YAWA,SAASoF,GAAe2pC,EAAQC,EAAUC,GACxC,KAAMnvC,eAAgBsF,IACpB,KAAM,IAAIW,aAAY,mDAGxBjG,MAAKivC,OAAWA,EAChBjvC,KAAKkvC,SAAWA,EAChBlvC,KAAKmvC,SAAWA,EAEhBnvC,KAAKgmB,QAAU,wBACVliB,MAAMC,QAAQkrC,GAAW,IAAMA,EAAO1jC,KAAK,MAAQ,IAAO0jC,GAC3D,KAAOjvC,KAAKmvC,UAAY,MAAQ,KAC/BrrC,MAAMC,QAAQmrC,GAAa,IAAMA,EAAS3jC,KAAK,MAAQ,IAAO2jC,GAC/D,IAEJlvC,KAAKgvC,OAAQ,GAAKvsC,QAASusC,MAG7B1pC,EAAeiD,UAAY,GAAIwsB,YAC/BzvB,EAAeiD,UAAUmD,YAAcqpB,WACvCzvB,EAAeiD,UAAUzC,KAAO,iBAEhCjG,EAAOD,QAAU0F,GAKZ,SAASzF,EAAQD,EAASM,GAE/B,YAEA,IAAIkvC,GAAkBlvC,EAAoB,IAO1CN,GAAQ4G,SAAW,SAASX,GAC1B,MAAQA,aAAiB+B,SAA4B,gBAAT/B,IAQ9CjG,EAAQoL,UAAY,SAASnF,GAC3B,MAAQA,IAASuC,KAAK4gB,MAAMnjB,IAS9BjG,EAAQ0K,KAAO,SAASxF,GACtB,MAAIA,GAAI,EACC,EAEI,EAAJA,EACA,GAGA,GAoEXlF,EAAQkJ,OAAS,SAASjD,EAAOkD,GAC/B,GAAuB,kBAAZA,GAET,MAAOA,GAAQlD,EAIjB,IAAIA,IAAUu9B,EAAAA,EACZ,MAAO,UAEJ,IAAIv9B,MAAWu9B,EAAAA,GAClB,MAAO,WAEJ,IAAIl5B,MAAMrE,GACb,MAAO,KAIT,IAAIwpC,GAAW,OACXlsC,EAAYqH,MAkBhB,QAhBIzB,IAEEA,EAAQsmC,WACVA,EAAWtmC,EAAQsmC,UAIjBzvC,EAAQ4G,SAASuC,GACnB5F,EAAY4F,EAELA,EAAQ5F,YACfA,EAAY4F,EAAQ5F,YAKhBksC,GACN,IAAK,QACH,MAAOzvC,GAAQk8B,QAAQj2B,EAAO1C,EAEhC,KAAK,cACH,MAAOvD,GAAQ0vC,cAAczpC,EAAO1C,EAEtC,KAAK,OACH,MAAOvD,GACFujC,YAAYt9B,EAAO1C,EAAW4F,GAAWA,EAAQwmC,aAGjDpF,QAAQ,sBAAuB,WAC9B,GAAI7sB,GAASpX,UAAU,GACnB6W,EAAI7W,UAAU,EAClB,OAAmB,MAAXoX,EAAkBA,EAASP,EAAIA,GAG/C,SACE,KAAM,IAAIta,OAAM,qBAAuB4sC,EAAW,kDAaxDzvC,EAAQ0vC,cAAgB,SAASzpC,EAAO1C,GACtC,MAAO,IAAIisC,GAAgBvpC,GAAOypC,cAAcnsC,IASlDvD,EAAQk8B,QAAU,SAASj2B,EAAO1C,GAChC,MAAO,IAAIisC,GAAgBvpC,GAAOi2B,QAAQ34B,IAY5CvD,EAAQujC,YAAc,SAASt9B,EAAO1C,EAAW4F,GAC/C,MAAO,IAAIqmC,GAAgBvpC,GAAOs9B,YAAYhgC,EAAW4F,IAc3DnJ,EAAQ0d,OAAS,SAASzX,GACxB,MAAOA,GACFypC,gBACAnF,QAAQ,OAAQ,IAChBA,QAAS,aAAc,IACvBlmC,QAMPrE,EAAQ4vC,YAAc5nC,OAAO6nC,SAAW,sBAWxC7vC,EAAQkkC,YAAc,SAASh/B,EAAGsK,EAAGhM,GAEnC,GAAe,MAAXA,EAAiB,MAAO0B,IAAKsK,CAGjC,IAAItK,GAAKsK,EAAG,OAAO,CAGnB,IAAIlF,MAAMpF,IAAMoF,MAAMkF,GAAI,OAAO,CAGjC,IAAGmrB,SAASz1B,IAAMy1B,SAASnrB,GAAI,CAE7B,GAAI/E,GAAOjC,KAAKe,IAAIrE,EAAIsK,EACxB,OAAI/E,GAAOzK,EAAQ4vC,aACV,EAIAnlC,GAAQjC,KAAKpG,IAAIoG,KAAKe,IAAIrE,GAAIsD,KAAKe,IAAIiG,IAAMhM,EAKxD,OAAO,IAMJ,SAASvD,EAAQD,EAASM,GAE/B,YA4FA,SAASwvC,GAAajrC,EAAOsE,GAC3B,GAAIjF,MAAMC,QAAQU,GAAQ,CAGxB,IAAK,GAFDiD,GAAM,IACNrC,EAAMZ,EAAMR,OACPP,EAAI,EAAO2B,EAAJ3B,EAASA,IACd,GAALA,IACFgE,GAAO,MAETA,GAAOgoC,EAAYjrC,EAAMf,GAAIqF,EAG/B,OADArB,IAAO,IAIP,MAAO9H,GAAQkJ,OAAOrE,EAAOsE,GAxGjC,GAAI7F,GAAShD,EAAoB,KAC7B4pB,EAAY5pB,EAAoB,KAChCid,EAAYjd,EAAoB,IAOpCN,GAAQ0H,SAAW,SAASzB,GAC1B,MAAQA,aAAiBk4B,SAA4B,gBAATl4B,IAQ9CjG,EAAQiN,SAAW,SAAS/F,EAAMu3B,GAChC,GAAI50B,GAAQ3C,EAAK7C,OAASo6B,EAAOp6B,OAC7ByF,EAAM5C,EAAK7C,MACf,OAAQ6C,GAAKiB,UAAU0B,EAAOC,KAAS20B,GA0BzCz+B,EAAQkJ,OAAS,SAASjD,EAAOkD,GAC/B,MAAI7F,GAAOsD,SAASX,GACX3C,EAAO4F,OAAOjD,EAAOkD,GAG1BlD,YAAiBsX,GACZ2M,EAAUhhB,OAAOjD,EAAOkD,GAG7BjF,MAAMC,QAAQ8B,GACT6pC,EAAY7pC,EAAOkD,GAGxBnJ,EAAQ0H,SAASzB,GACZ,IAAMA,EAAQ,IAGF,kBAAVA,GACFA,EAAM6W,OAAS7W,EAAM6W,OAAS,GAAK,WAGxC7W,YAAiB7C,QACS,kBAAjB6C,GAAMiD,OACRjD,EAAMiD,OAAOC,GAGblD,EAAMuD,WAIV20B,OAAOl4B,KAkCX,SAAShG,EAAQD,EAASM,GAE/B,YAWA,SAASsf,GAAeyD,EAAI0sB,EAAOztC,EAAKF,GACtC,KAAMhC,eAAgBwf,IACpB,KAAM,IAAIvZ,aAAY,mDAGxBjG,MAAKijB,GAAKA,EACVjjB,KAAK2vC,MAAQA,EACb3vC,KAAKkC,IAAMA,EACXlC,KAAKgC,IAAMA,EAEXhC,KAAKgmB,QAAU,yCAA2C/C,EACtD,KAAO0sB,EAAQ,cACfztC,GAAesI,QAAPxI,EAAqB,IAAMA,EAAO,IAAM,aAEpDhC,KAAKgvC,OAAQ,GAAKvsC,QAASusC,MAG7BxvB,EAAejX,UAAY,GAAI9F,OAC/B+c,EAAejX,UAAUmD,YAAcjJ,MACvC+c,EAAejX,UAAUzC,KAAO,iBAEhCjG,EAAOD,QAAU4f,GAKZ,SAAS3f,EAAQD,EAASM,GAE/B,YAcA,SAAS0lB,GAAUlG,GACjB,KAAM1f,eAAgB4lB,IACpB,KAAM,IAAI3f,aAAY,mDAMxB,IAHAjG,KAAK0f,MAAQA,OAGR3b,EAAQ/D,KAAK0f,SAAW1f,KAAK0f,MAAMkwB,MAAMC,GAC5C,KAAM,IAAIppC,WAAU,mCArBxB,GAAI8gB,GAAOrnB,EAAoB,KAC3BqH,EAASrH,EAAoB,KAE7B6D,EAAUD,MAAMC,QAChB8rC,EAAStoB,EAAKsoB,MAqBlBjqB,GAAUrd,UAAY,GAAIgf,GAE1B3B,EAAUrd,UAAUpH,KAAO,YAS3BykB,EAAUrd,UAAUunC,SAAW,SAAUC,GACvC,GAAIrR,GAA0C,UAA9BqR,EAAKlvC,KAAKD,SAASqC,OAE/Byc,EAAQ1f,KAAK0f,MAAM3d,IAAI,SAAUd,GACnC,MAAOA,GAAK6uC,SAASC,IAGvB,QAAQrR,EAAW,gBAAkB,KACjChf,EAAMnU,KAAK,MACVmzB,EAAW,KAAO,MAOzB9Y,EAAUrd,UAAU1G,QAAU,SAAU4B,GACtC,IAAK,GAAIC,GAAI,EAAGA,EAAI1D,KAAK0f,MAAMzb,OAAQP,IAAK,CAC1C,GAAIzC,GAAOjB,KAAK0f,MAAMhc,EACtBD,GAASxC,EAAM,SAAWyC,EAAI,IAAK1D,QAUvC4lB,EAAUrd,UAAUxG,IAAM,SAAU0B,GAElC,IAAK,GADDic,MACKhc,EAAI,EAAGA,EAAI1D,KAAK0f,MAAMzb,OAAQP,IACrCgc,EAAMhc,GAAK1D,KAAKgwC,QAAQvsC,EAASzD,KAAK0f,MAAMhc,GAAI,SAAWA,EAAI,IAAK1D,MAEtE,OAAO,IAAI4lB,GAAUlG,IAOvBkG,EAAUrd,UAAUI,MAAQ,WAC1B,MAAO,IAAIid,GAAU5lB,KAAK0f,MAAMN,MAAM,KAQxCwG,EAAUrd,UAAUa,SAAW,WAC7B,MAAO7B,GAAOuB,OAAO9I,KAAK0f,QAS5BkG,EAAUrd,UAAU0nC,OAAS,SAASC,GACpClwC,KAAKmwC,UAAYnwC,KAAKmwC,WAAa,SACnC,IAAIh5B,GAAI,WAAanX,KAAKmwC,UAAY,GAgBtC,OAdAnwC,MAAK0f,MAAM7d,QAAQ,SAASZ,GAExBkW,GADElW,EAAKye,MACFze,EAAKye,MAAM3d,IAAI,SAASquC,GAC3B,MAAOA,GAAUC,MAAMH,KACtB3kC,KAAK,KAGHtK,EAAKovC,MAAMH,GAIlB/4B,GAAK,SAEPA,GAAK,SAAWnX,KAAKmwC,UAAY,KAInCtwC,EAAOD,QAAUgmB,GAKZ,SAAS/lB,EAAQD,EAASM,GAE/B,YAmBA,SAAS4hB,GAAehc,EAAM+W,GAC5B,KAAM7c,eAAgB8hB,IACpB,KAAM,IAAI7b,aAAY,mDAIxB,KAAKqB,EAASxB,GAAgB,KAAM,IAAIW,WAAU,uCAClD,MAAMoW,YAAgB0K,IAAQ,KAAM,IAAI9gB,WAAU,qCAClD,IAAIX,IAAQwqC,GAAkB,KAAM,IAAI7tC,OAAM,yBAA4BqD,EAAQ,0BAElF9F,MAAK8F,KAAOA,EACZ9F,KAAK6c,KAAOA,EA5Bd,GAAI0K,GAAOrnB,EAAoB,KAG3BowC,GAFYpwC,EAAoB,KAErBA,EAAoB,MAC/B8iB,EAAY9iB,EAAoB,KAEhCqwC,EAAQrwC,EAAoB,KAC5BoH,EAAWpH,EAAoB,KAAKoH,QAwBxCwa,GAAevZ,UAAY,GAAIgf,GAE/BzF,EAAevZ,UAAUpH,KAAO,iBAShC2gB,EAAevZ,UAAUunC,SAAW,SAAUC,GAC5C,MAAO,UAAY/vC,KAAK8F,KAAO,QAAU9F,KAAK6c,KAAKizB,SAASC,IAQ9DjuB,EAAevZ,UAAU1G,QAAU,SAAU4B,GAC3CA,EAASzD,KAAK6c,KAAM,OAAQ7c,OAS9B8hB,EAAevZ,UAAUxG,IAAM,SAAU0B,GACvC,MAAO,IAAIqe,GAAe9hB,KAAK8F,KAAM9F,KAAKgwC,QAAQvsC,EAASzD,KAAK6c,KAAM,OAAQ7c,SAOhF8hB,EAAevZ,UAAUI,MAAQ,WAC/B,MAAO,IAAImZ,GAAe9hB,KAAK8F,KAAM9F,KAAK6c,OAO5CiF,EAAevZ,UAAUa,SAAW,WAClC,GAAIonC,GAAaxtB,EAAUytB,cAAczwC,MACrC0wC,EAAiB1tB,EAAUytB,cAAczwC,KAAK6c,MAC9CA,EAAO7c,KAAK6c,KAAKzT,UAIrB,OAHwB,QAAnBsnC,GAA+CF,GAAlBE,IAChC7zB,EAAO,IAAMA,EAAO,KAEf7c,KAAK8F,KAAO,MAAQ+W,GAQ7BiF,EAAevZ,UAAU0nC,OAAS,SAASC,GACzC,GAAIM,GAAaxtB,EAAUytB,cAAczwC,MACrC0wC,EAAiB1tB,EAAUytB,cAAczwC,KAAK6c,MAE9CA,EAAO7c,KAAK6c,KAAKwzB,MAAMH,EAK3B,OAJwB,QAAnBQ,GAA+CF,GAAlBE,IAChC7zB,EAAO,UAAYA,EAAO,YAGrB0zB,EAAMI,SAAS3wC,KAAK8F,MAAQ,KAAO+W,GAG5Chd,EAAOD,QAAUkiB,GAKZ,SAASjiB,EAAQD,EAASM,GAE/B,YAeA,SAASuhB,GAAUH,GACjB,KAAMthB,eAAgByhB,IACpB,KAAM,IAAIxb,aAAY,mDAIxB,KAAKnC,MAAMC,QAAQud,GAAS,KAAM,IAAI7e,OAAM,iBAC5CzC,MAAKshB,OAASA,EAAOvf,IAAI,SAAU6uC,GACjC,GAAI3vC,GAAU2vC,GAASA,EAAM3vC,KACzBogB,EAAUuvB,GAA2BpmC,SAAlBomC,EAAMvvB,QAAwBuvB,EAAMvvB,SAAU,CAErE,MAAMpgB,YAAgBsmB,IAAQ,KAAM,IAAI9gB,WAAU,iCAClD,KAAK8rB,EAAUlR,GAAe,KAAM,IAAI5a,WAAU,uCAElD,QACExF,KAAMA,EACNogB,QAASA,KA7Bf,GAAIkG,GAAOrnB,EAAoB,KAC3BuB,EAAYvB,EAAoB,GAChCqyB,EAAYryB,EAAoB,KAAKqyB,SAgCzC9Q,GAAUlZ,UAAY,GAAIgf,GAE1B9F,EAAUlZ,UAAUpH,KAAO,YAU3BsgB,EAAUlZ,UAAUunC,SAAW,SAAUC,GACvCA,EAAKtuC,UAAYA,CACjB,IAAI6f,GAASthB,KAAKshB,OAAOvf,IAAI,SAAU8uC,GACrC,GAAIC,GAAKD,EAAM5vC,KAAK6uC,SAASC,EAC7B,OAAIc,GAAMxvB,QACD,gBAAkByvB,EAAK,KAGvBA,EAAK,KAIhB,OAAO,kCAEHxvB,EAAO/V,KAAK,IACZ,sCAQNkW,EAAUlZ,UAAU1G,QAAU,SAAU4B,GACtC,IAAK,GAAIC,GAAI,EAAGA,EAAI1D,KAAKshB,OAAOrd,OAAQP,IACtCD,EAASzD,KAAKshB,OAAO5d,GAAGzC,KAAM,UAAYyC,EAAI,SAAU1D,OAU5DyhB,EAAUlZ,UAAUxG,IAAM,SAAU0B,GAElC,IAAK,GADD6d,MACK5d,EAAI,EAAGA,EAAI1D,KAAKshB,OAAOrd,OAAQP,IAAK,CAC3C,GAAIktC,GAAQ5wC,KAAKshB,OAAO5d,GACpBzC,EAAOjB,KAAKgwC,QAAQvsC,EAASmtC,EAAM3vC,KAAM,UAAYyC,EAAI,SAAU1D,MACvEshB,GAAO5d,IACLzC,KAAMA,EACNogB,QAASuvB,EAAMvvB,SAGnB,MAAO,IAAII,GAAUH,IAOvBG,EAAUlZ,UAAUI,MAAQ,WAC1B,GAAI2Y,GAASthB,KAAKshB,OAAOvf,IAAI,SAAS6uC,GACpC,OACE3vC,KAAM2vC,EAAM3vC,KACZogB,QAASuvB,EAAMvvB,UAInB,OAAO,IAAII,GAAUH,IAQvBG,EAAUlZ,UAAUa,SAAW,WAC7B,MAAOpJ,MAAKshB,OAAOvf,IAAI,SAAU8uC,GAC/B,MAAOA,GAAM5vC,KAAKmI,YAAcynC,EAAMxvB,QAAU,GAAK,OACpD9V,KAAK,OAQVkW,EAAUlZ,UAAU0nC,OAAS,SAASC,GACpC,MAAOlwC,MAAKshB,OAAOvf,IAAI,SAAU8uC,GAC/B,MAAOA,GAAM5vC,KAAKovC,MAAMH,IAAcW,EAAMxvB,QAAU,GAAK,OAC1D9V,KAAK,OAGV1L,EAAOD,QAAU6hB,GAKZ,SAAS5hB,EAAQD,EAASM,GAE/B,YAuBA,SAASsiB,GAAiBH,EAAWC,EAAUC,GAC7C,KAAMviB,eAAgBwiB,IACpB,KAAM,IAAIvc,aAAY,mDAExB,MAAMoc,YAAqBkF,IAAO,KAAM,IAAI9gB,WAAU,qCACtD,MAAM6b,YAAoBiF,IAAQ,KAAM,IAAI9gB,WAAU,oCACtD,MAAM8b,YAAqBgF,IAAO,KAAM,IAAI9gB,WAAU,qCAEtDzG,MAAKqiB,UAAYA,EACjBriB,KAAKsiB,SAAWA,EAChBtiB,KAAKuiB,UAAYA,EA/BnB,GAAIgF,GAAOrnB,EAAoB,KAE3Bid,GADQjd,EAAoB,KAChBA,EAAoB,MAChCkB,EAAUlB,EAAoB,GAC9BqB,EAAOrB,EAAoB,GAC3B0E,EAAO1E,EAAoB,KAC3B8iB,EAAY9iB,EAAoB,KAChCoH,EAAW1C,EAAK2C,OAAOD,SACvBd,EAAW5B,EAAK1B,OAAOsD,SACvB+rB,EAAY3tB,EAAK,WAAW2tB,SAyBhC/P,GAAgBja,UAAY,GAAIgf,GAEhC/E,EAAgBja,UAAUpH,KAAO,kBAUjCqhB,EAAgBja,UAAUunC,SAAW,SAASC,GA8B5C,MAxBAA,GAAKgB,cAAgB,SAAU1uB,GAC7B,GAAI7b,EAAS6b,IAAckQ,EAAUlQ,IAAc/a,EAAS+a,GAC1D,MAAOA,IAAY,GAAO,CAG5B,IAAIA,YAAqBlF,GACvB,MAAOkF,GAAU6T,UAAW,GAAQ,CAGtC,IAAI7T,YAAqBjhB,GACvB,MAAQihB,GAAUtc,IAAMsc,EAAUrc,IAAM,GAAO,CAGjD,IAAIqc,YAAqB9gB,GACvB,MAAO8gB,GAAUxc,OAAQ,GAAO,CAGlC,IAAkB,OAAdwc,GAAoC7X,SAAd6X,EACxB,OAAO,CAGT,MAAM,IAAI5b,WAAU,kCAAoCspC,EAAKlvC,KAAK,UAAUwhB,GAAa,MAIvF,iBAAmBriB,KAAKqiB,UAAUytB,SAASC,GAAQ,SAC5C/vC,KAAKsiB,SAASwtB,SAASC,GAAQ,SAC/B/vC,KAAKuiB,UAAUutB,SAASC,GAAQ,KAQ7CvtB,EAAgBja,UAAU1G,QAAU,SAAU4B,GAC5CA,EAASzD,KAAKqiB,UAAW,YAAariB,MACtCyD,EAASzD,KAAKsiB,SAAU,WAAYtiB,MACpCyD,EAASzD,KAAKuiB,UAAW,YAAaviB,OASxCwiB,EAAgBja,UAAUxG,IAAM,SAAU0B,GACxC,MAAO,IAAI+e,GACPxiB,KAAKgwC,QAAQvsC,EAASzD,KAAKqiB,UAAW,YAAariB,OACnDA,KAAKgwC,QAAQvsC,EAASzD,KAAKsiB,SAAU,WAAYtiB,OACjDA,KAAKgwC,QAAQvsC,EAASzD,KAAKuiB,UAAW,YAAaviB,SAQzDwiB,EAAgBja,UAAUI,MAAQ,WAChC,MAAO,IAAI6Z,GAAgBxiB,KAAKqiB,UAAWriB,KAAKsiB,SAAUtiB,KAAKuiB,YAOjEC,EAAgBja,UAAUa,SAAW,WACnC,GAAIonC,GAAaxtB,EAAUytB,cAAczwC,MAMrCqiB,EAAYriB,KAAKqiB,UAAUjZ,WAC3B4nC,EAAsBhuB,EAAUytB,cAAczwC,KAAKqiB,YAC1B,iBAAxBriB,KAAKqiB,UAAUlhB,MACa,OAAxB6vC,GAAyDR,GAAvBQ,KACzC3uB,EAAY,IAAMA,EAAY,IAGhC,IAAIC,GAAWtiB,KAAKsiB,SAASlZ,WACzB6nC,EAAiBjuB,EAAUytB,cAAczwC,KAAKsiB,WACtB,iBAAvBtiB,KAAKsiB,SAASnhB,MACS,OAAnB8vC,GAA+CT,GAAlBS,KACpC3uB,EAAW,IAAMA,EAAW,IAG9B,IAAIC,GAAYviB,KAAKuiB,UAAUnZ,WAC3B8nC,EAAkBluB,EAAUytB,cAAczwC,KAAKuiB,UAKnD,QAJ6B,iBAAxBviB,KAAKuiB,UAAUphB,MACS,OAApB+vC,GAAiDV,GAAnBU,KACrC3uB,EAAY,IAAMA,EAAY,KAEzBF,EAAY,MAAQC,EAAW,MAAQC,GAQhDC,EAAgBja,UAAU0nC,OAAS,SAASC,GAC1C,MAAO,gCACHlwC,KAAKsiB,SAAS+tB,MAAMH,GAAa,2BACjClwC,KAAKqiB,UAAUguB,MAAMH,GACrB,SAAWlwC,KAAKuiB,UAAU8tB,MAAMH,GAChC,qDAGNrwC,EAAOD,QAAU4iB,GAKZ,SAAS3iB,EAAQD,EAASM,GAE/B,YAqCA,SAASqhB,GAAa1b,EAAOsrC,GAC3B,KAAMnxC,eAAgBuhB,IACpB,KAAM,IAAItb,aAAY,mDAGxB,IAAIkrC,EAAW,CACb,IAAK7pC,EAAS6pC,GACZ,KAAM,IAAI1qC,WAAU,4CAEtB,KAAKa,EAASzB,GACZ,KAAM,IAAIY,WAAU,wCAGtBzG,MAAK6F,MAAQA,EACb7F,KAAKmxC,UAAYA,MAIjBnxC,MAAK6F,MAAQA,EAAQ,GACrB7F,KAAKmxC,UAAYhwC,EAAK0E,EAGxB,KAAKurC,EAAgBpxC,KAAKmxC,WACxB,KAAM,IAAI1qC,WAAU,8BAAgCzG,KAAKmxC,UAAY,KA1DzE,GAAI5pB,GAAOrnB,EAAoB,KAE3BiB,GADYjB,EAAoB,KACzBA,EAAoB,KAAKiB,MAChCmG,EAAWpH,EAAoB,KAAKoH,SA2DpC8pC,GACFluC,QAAU,EACVqE,QAAU,EACV+1B,WAAW,EACX9yB,WAAa,EACbszB,QAAQ,EAGVvc,GAAahZ,UAAY,GAAIgf,GAE7BhG,EAAahZ,UAAUpH,KAAO,eAU9BogB,EAAahZ,UAAUunC,SAAW,SAAUC,GAC1C,OAAQ/vC,KAAKmxC,WACX,IAAK,SACH,MAAkC,cAA9BpB,EAAKlvC,KAAKD,SAASsC,OACd,mBAAqBlD,KAAK6F,MAAQ,KAIlC7F,KAAK6F,MAAMskC,QAAQ,aAAc,SAAUkH,EAAOzmB,GACvD,MAAOymB,GAAMtpC,UAAU6iB,EAAM3mB,SAInC,KAAK,SACH,MAAO,IAAMjE,KAAK6F,MAAQ,GAE5B,KAAK,UACH,MAAO7F,MAAK6F,KAEd,KAAK,YACH,MAAO7F,MAAK6F,KAEd,KAAK,OACH,MAAO7F,MAAK6F,KAEd,SAEE,KAAM,IAAIY,WAAU,iCAAmCzG,KAAKmxC,UAAY,OAQ9E5vB,EAAahZ,UAAU1G,QAAU,SAAU4B,KAW3C8d,EAAahZ,UAAUxG,IAAM,SAAU0B,GACrC,MAAOzD,MAAK2I,SAOd4Y,EAAahZ,UAAUI,MAAQ,WAC7B,MAAO,IAAI4Y,GAAavhB,KAAK6F,MAAO7F,KAAKmxC,YAO3C5vB,EAAahZ,UAAUa,SAAW,WAChC,OAAQpJ,KAAKmxC,WACX,IAAK,SACH,MAAO,IAAMnxC,KAAK6F,MAAQ,GAE5B,SACE,MAAO7F,MAAK6F,QASlB0b,EAAahZ,UAAU0nC,OAAS,SAASC,GACvC,GACIpuC,GADA+D,EAAQ7F,KAAK6F,KAEjB,QAAQ7F,KAAKmxC,WACX,IAAK,SACH,MAAO,UAAYtrC,EAAQ,GAE7B,KAAK,SAEH,MADA/D,GAAQ+D,EAAM23B,cAAc56B,QAAQ,KACtB,KAAVd,EACK+D,EAAMkC,UAAU,EAAGjG,GAAS,aAC/B+D,EAAMkC,UAAUjG,EAAQ,GAAK,IAE5B+D,CAET,SACE,MAAOA,KAIbhG,EAAOD,QAAU2hB,GAKZ,SAAS1hB,EAAQD,EAASM,GAE/B,YAkBA,SAASgiB,GAAuBpc,EAAMod,EAAQrG,GAC5C,KAAM7c,eAAgBkiB,IACpB,KAAM,IAAIjc,aAAY,mDAIxB,KAAKqB,EAASxB,GAAO,KAAM,IAAIW,WAAU,uCACzC,KAAK1C,EAAQmf,KAAYA,EAAO0sB,MAAMtoC,GAAY,KAAM,IAAIb,WAAU,2DACtE,MAAMoW,YAAgB0K,IAAO,KAAM,IAAI9gB,WAAU,qCACjD,IAAIX,IAAQwqC,GAAU,KAAM,IAAI7tC,OAAM,2BAA8BqD,EAAQ,0BAE5E9F,MAAK8F,KAAOA,EACZ9F,KAAKkjB,OAASA,EACdljB,KAAK6c,KAAOA,EA7Bd,GAAI0K,GAAOrnB,EAAoB,KAC3BowC,EAAWpwC,EAAoB,KAC/BqwC,EAAQrwC,EAAoB,KAC5B8iB,EAAY9iB,EAAoB,KAChCoH,EAAWpH,EAAoB,KAAKoH,SACpCvD,EAAUD,MAAMC,OA2BpBme,GAAuB3Z,UAAY,GAAIgf,GAEvCrF,EAAuB3Z,UAAUpH,KAAO,yBAUxC+gB,EAAuB3Z,UAAUunC,SAAW,SAAUC,GAMpD,MAJA/vC,MAAKkjB,OAAOrhB,QAAQ,SAAUyvC,GAC5BvB,EAAKvrC,KAAK8sC,IAAY,IAGjB,UAAYtxC,KAAK8F,KAAO,8CAEA9F,KAAK8F,KAAO,IAAM9F,KAAKkjB,OAAO3X,KAAK,KAAO,oCAClCvL,KAAKkjB,OAAOjf,OAAS,2EAGkBjE,KAAK8F,KAAO,wCAA0C9F,KAAKkjB,OAAOjf,OAAS,oCAEnIjE,KAAK6c,KAAKizB,SAASC,GACrC,0BACsB/vC,KAAK8F,KAAO,IAAM9F,KAAKkjB,OAAO3X,KAAK,MAAQ,4BASvE2W,EAAuB3Z,UAAU1G,QAAU,SAAU4B,GACnDA,EAASzD,KAAK6c,KAAM,OAAQ7c,OAS9BkiB,EAAuB3Z,UAAUxG,IAAM,SAAU0B,GAC/C,GAAIoZ,GAAO7c,KAAKgwC,QAAQvsC,EAASzD,KAAK6c,KAAM,OAAQ7c,MAEpD,OAAO,IAAIkiB,GAAuBliB,KAAK8F,KAAM9F,KAAKkjB,OAAO9D,MAAM,GAAIvC,IAOrEqF,EAAuB3Z,UAAUI,MAAQ,WACvC,MAAO,IAAIuZ,GAAuBliB,KAAK8F,KAAM9F,KAAKkjB,OAAO9D,MAAM,GAAIpf,KAAK6c,OAO1EqF,EAAuB3Z,UAAUa,SAAW,WAC1C,GAAIonC,GAAaxtB,EAAUytB,cAAczwC,MACrC0wC,EAAiB1tB,EAAUytB,cAAczwC,KAAK6c,MAE9CA,EAAO7c,KAAK6c,KAAKzT,UAIrB,OAHwB,QAAnBsnC,GAA+CF,GAAlBE,IAChC7zB,EAAO,IAAMA,EAAO,KAEf,YAAc7c,KAAK8F,KACtB,IAAM9F,KAAKkjB,OAAO3X,KAAK,MAAQ,OAASsR,GAQ9CqF,EAAuB3Z,UAAU0nC,OAAS,SAASC,GACjD,GAAIM,GAAaxtB,EAAUytB,cAAczwC,MACrC0wC,EAAiB1tB,EAAUytB,cAAczwC,KAAK6c,MAE9CA,EAAO7c,KAAK6c,KAAKwzB,MAAMH,EAK3B,OAJwB,QAAnBQ,GAA+CF,GAAlBE,IAChC7zB,EAAO,UAAYA,EAAO,YAGrB0zB,EAAMI,SAAS3wC,KAAK8F,MACvB,UAAY9F,KAAKkjB,OAAOnhB,IAAIwuC,EAAMI,UAAUplC,KAAK,KAAO,aAAesR,GAG7Ehd,EAAOD,QAAUsiB,GAKZ,SAASriB,EAAQD,EAASM,GAE/B,YAqBA,SAAS6hB,GAAW3X,EAAQO,GAC1B,KAAM3K,eAAgB+hB,IACpB,KAAM,IAAI9b,aAAY,mDAIxB,MAAMmE,YAAkBmd,IAAO,KAAM,IAAI9gB,WAAU,uCACnD,KAAK1C,EAAQ4G,KAAYA,EAAOilC,MAAMC,GACpC,KAAM,IAAIppC,WAAU,yDAGtBzG,MAAKoK,OAASA,EACdpK,KAAK2K,OAASA,EA/BhB,GAAI4c,GAAOrnB,EAAoB,KAC3B8jB,EAAY9jB,EAAoB,KAChC2hB,EAAa3hB,EAAoB,KAEjCid,EAAYjd,EAAoB,KAChCmB,EAAQnB,EAAoB,GAE5B2vC,EAAStoB,EAAKsoB,OACd9rC,EAAUD,MAAMC,OA0BpBge,GAAUxZ,UAAY,GAAIgf,GAE1BxF,EAAUxZ,UAAUpH,KAAO,YAU3B4gB,EAAUxZ,UAAUunC,SAAW,SAAUC,GACvC,MAAO/vC,MAAKuxC,cAAcxB,IAe5BhuB,EAAUxZ,UAAUgpC,cAAgB,SAASxB,EAAMnkC,GAEjD,QAAS6mB,GAAKxxB,GACZ,MAAQA,aAAgB4gB,IAA6B,OAAb5gB,EAAK6E,KAG/C,GAAI0rC,IAAa,EACbC,EAAezxC,KAAK2K,OAAO5I,IAAI,SAAUI,GAC3C,GAAIuvC,GAASvvC,EAAMP,OAAO6wB,GAAMxuB,OAAS,CAEzC,OADAutC,GAAaE,EAASA,EAASF,EACxBE,GAIT3B,GAAK5tC,MAAQ,SAAUsH,EAAOC,EAAKC,GACjC,MAAO,IAAItI,GACHoI,YAAiB0T,GAAY1T,EAAMtB,WAAasB,EAChDC,YAAeyT,GAAYzT,EAAIvB,WAAauB,EAC5CC,YAAgBwT,GAAYxT,EAAKxB,WAAawB,GAUxD,IAAIgB,GAAS3K,KAAK2K,OAAO5I,IAAI,SAASI,EAAOuB,GAC3C,GAAIguC,GAASD,EAAa/tC,EAC1B,OAAIvB,aAAiB6hB,GACf0tB,GACF3B,EAAKvrC,KAAKkF,KAAM,EAGT,kCACmBhG,EAAI,wBAEjBvB,EAAMsH,MAAMqmC,SAASC,GAAQ,SAC7B5tC,EAAMuH,IAAIomC,SAASC,GAAQ,UAC1B5tC,EAAMwH,KAAOxH,EAAMwH,KAAKmmC,SAASC,GAAQ,KACnD,YAKG,SACH5tC,EAAMsH,MAAMqmC,SAASC,GAAQ,KAC7B5tC,EAAMuH,IAAIomC,SAASC,GAAQ,MAC1B5tC,EAAMwH,KAAOxH,EAAMwH,KAAKmmC,SAASC,GAAQ,KAC1C,IAIF2B,GACF3B,EAAKvrC,KAAKkF,KAAM,EAGT,kCACmBhG,EAAI,cACZvB,EAAM2tC,SAASC,GAAQ,SAKlC5tC,EAAM2tC,SAASC,IAM5B,OAAIyB,GACK,6BACcxxC,KAAKoK,OAAO0lC,SAASC,GAAQ,uFAI1BplC,EAAOY,KAAK,MAAQ,SAC9BK,EAAe,KAAOA,EAAe,IAC/C,WAIG,eACH5L,KAAKoK,OAAO0lC,SAASC,GAAQ,eACbplC,EAAOY,KAAK,MAAQ,KACnCK,EAAe,KAAOA,EAAe,IACtC,KAQRmW,EAAUxZ,UAAU1G,QAAU,SAAU4B,GAEtCA,EAASzD,KAAKoK,OAAQ,SAAUpK,KAGhC,KAAK,GAAI0D,GAAI,EAAGA,EAAI1D,KAAK2K,OAAO1G,OAAQP,IACtCD,EAASzD,KAAK2K,OAAOjH,GAAI,UAAYA,EAAI,IAAK1D,OAUlD+hB,EAAUxZ,UAAUxG,IAAM,SAAU0B,GAIlC,IAAK,GAHD2G,GAASpK,KAAKgwC,QAAQvsC,EAASzD,KAAKoK,OAAQ,SAAUpK,OAEtD2K,KACKjH,EAAI,EAAGA,EAAI1D,KAAK2K,OAAO1G,OAAQP,IACtCiH,EAAOjH,GAAK1D,KAAKgwC,QAAQvsC,EAASzD,KAAK2K,OAAOjH,GAAI,UAAYA,EAAI,IAAK1D,MAGzE,OAAO,IAAI+hB,GAAU3X,EAAQO,IAO/BoX,EAAUxZ,UAAUopC,WAAa,WAC/B,MAAO3xC,MAAKoK,OAAOtE,MAOrBic,EAAUxZ,UAAUI,MAAQ,WAC1B,MAAO,IAAIoZ,GAAU/hB,KAAKoK,OAAQpK,KAAK2K,OAAOyU,MAAM,KAOtD2C,EAAUxZ,UAAUa,SAAW,WAE7B,MAAOpJ,MAAKoK,OAAOhB,WAAa,IAAMpJ,KAAK2K,OAAOY,KAAK,MAAQ,KAQjEwW,EAAUxZ,UAAU0nC,OAAS,SAASC,GACpC,GAAIvlC,GAAS3K,KAAK2K,OAAO5I,IAAI,SAAUI,GACrC,MAAOA,GAAMkuC,MAAMH,IAErB,OAAOlwC,MAAKoK,OAAOimC,MAAMH,GAAa,YAAcvlC,EAAOY,KAAK,KAAO,aAGzE1L,EAAOD,QAAUmiB,GAKZ,SAASliB,EAAQD,EAASM,GAE/B,YAoBA,SAASwiB,GAAckvB,EAAI3uB,EAAIze,GAC7B,KAAMxE,eAAgB0iB,IACpB,KAAM,IAAIzc,aAAY,mDAIxB,IAAkB,gBAAP2rC,GACT,KAAM,IAAInrC,WAAU,qCAEtB,IAAkB,gBAAPwc,GACT,KAAM,IAAIxc,WAAU,qCAEtB,KAAK1C,EAAQS,KAAUA,EAAKorC,MAAMC,GAChC,KAAM,IAAIppC,WAAU,uDAGtBzG,MAAK4xC,GAAKA,EACV5xC,KAAKijB,GAAKA,EACVjjB,KAAKwE,KAAOA,MAsEd,QAASqtC,GAA+BnyC,EAAM8E,EAAM+rC,GAElD,GAAIC,GAAaxtB,EAAUytB,cAAc/wC,GACrCoyC,EAAgB9uB,EAAU+uB,iBAAiBryC,EAE/C,QAAQ8E,EAAKP,QACX,IAAK,GAEH,GAAI+tC,GAAoBhvB,EAAUytB,cAAcjsC,EAAK,GAGrD,IAAI+rC,GAAgC,OAAtByB,EAA6B,CACzC,GAAIC,GAAoBztC,EAAK,GAAG0tC,gBAC5BC,EAAiBzyC,EAAKwyC,eAC1B,IAAIlvB,EAAUovB,WAAW5B,GAAY2B,GAAgBE,mBAAoB,EACvE,QAAQ,EAGV,IAAIrvB,EAAUovB,WAAWJ,GAAmBC,GAAmBK,eAAgB,EAC7E,QAAQ,GAIZ,MAA0B,QAAtBN,IAEM,GAGexB,GAArBwB,IAEM,KAIF,EAEV,KAAK,GACH,GAAIO,GAEAC,EAAgBxvB,EAAUytB,cAAcjsC,EAAK,IAE7CiuC,EAAezvB,EAAU0vB,kBAAkBhzC,EAAM8E,EAAK,GAKxD+tC,GAHoB,OAAlBC,GAGU,EAEJA,IAAkBhC,GAAkC,UAAlBsB,GAA+BW,EAOlDjC,EAAhBgC,GACK,GAGA,GANA,CASd,IAAIG,GAEAC,EAAgB5vB,EAAUytB,cAAcjsC,EAAK,IAE7CquC,EAAe7vB,EAAU0vB,kBAAkBhzC,EAAM8E,EAAK,GAsB1D,IAjBEmuC,EAHoB,OAAlBC,GAGU,EAEJA,IAAkBpC,GAAkC,SAAlBsB,GAA8Be,EAOjDrC,EAAhBoC,GACK,GAGA,GANA,EAUVrC,EAAO,CACT,GAAI4B,GAAiBzyC,EAAKwyC,gBACtBY,EAAgBpzC,EAAK8E,KAAK,GAAG0tC,gBAC7Ba,EAAgBrzC,EAAK8E,KAAK,GAAG0tC,eAEX,QAAlBM,IACExvB,EAAUovB,WAAW5B,GAAY2B,GAAgBE,mBAAoB,IACvEE,GAAY,GAGVvvB,EAAUovB,WAAWI,GAAeM,GAAeR,eAAgB,IACrEC,GAAY,IAIM,OAAlBK,IACE5vB,EAAUovB,WAAW5B,GAAY2B,GAAgBa,oBAAqB,IACxEL,GAAY,GAGV3vB,EAAUovB,WAAWQ,GAAeG,GAAeT,eAAgB,IACrEK,GAAY,IAKlB,OAAQJ,EAAWI,EACrB,SAEE,GAAIM,KAIJ,OAHAzuC,GAAK3C,QAAQ,WACXoxC,EAAOnwC,MAAK,KAEPmwC,GAnOb,GAAI1rB,GAAOrnB,EAAoB,KAI3BqwC,GAHerwC,EAAoB,KACtBA,EAAoB,KAClBA,EAAoB,KAC3BA,EAAoB,MAC5B8iB,EAAY9iB,EAAoB,KAChC6D,EAAUD,MAAMC,QAChB8rC,EAAStoB,EAAKsoB,MAgClBntB,GAAana,UAAY,GAAIgf,GAE7B7E,EAAana,UAAUpH,KAAO,eAU9BuhB,EAAana,UAAUunC,SAAW,SAAUC,GAC1C,KAAM/vC,KAAKijB,KAAM8sB,GAAKlvC,MACpB,KAAM,IAAI4B,OAAM,YAAczC,KAAKijB,GAAK,wCAG1C,IAAIze,GAAOxE,KAAKwE,KAAKzC,IAAI,SAAUoE,GACjC,MAAOA,GAAI2pC,SAASC,IAEtB,OAAO,QAAU/vC,KAAKijB,GAAK,IAAMze,EAAK+G,KAAK,MAAQ,KAOrDmX,EAAana,UAAU1G,QAAU,SAAU4B,GACzC,IAAK,GAAIC,GAAI,EAAGA,EAAI1D,KAAKwE,KAAKP,OAAQP,IACpCD,EAASzD,KAAKwE,KAAKd,GAAI,QAAUA,EAAI,IAAK1D,OAU9C0iB,EAAana,UAAUxG,IAAM,SAAU0B,GAErC,IAAK,GADDe,MACKd,EAAI,EAAGA,EAAI1D,KAAKwE,KAAKP,OAAQP,IACpCc,EAAKd,GAAK1D,KAAKgwC,QAAQvsC,EAASzD,KAAKwE,KAAKd,GAAI,QAAUA,EAAI,IAAK1D,MAEnE,OAAO,IAAI0iB,GAAa1iB,KAAK4xC,GAAI5xC,KAAKijB,GAAIze,IAO5Cke,EAAana,UAAUI,MAAQ,WAC7B,MAAO,IAAI+Z,GAAa1iB,KAAK4xC,GAAI5xC,KAAKijB,GAAIjjB,KAAKwE,KAAK4a,MAAM,KAgJ5DsD,EAAana,UAAUa,SAAW,WAChC,GAAI5E,GAAOxE,KAAKwE,KACZyuC,EAASpB,EAA8B7xC,KAAMwE,GAAM,EAEvD,QAAQA,EAAKP,QACX,IAAK,GACH,GAAIivC,GAAQlwB,EAAU+uB,iBAAiB/xC,MAEnCmzC,EAAU3uC,EAAK,GAAG4E,UAKtB,OAJI6pC,GAAO,KACTE,EAAU,IAAMA,EAAU,KAGd,UAAVD,EACKlzC,KAAK4xC,GAAKuB,EAEA,SAAVD,EACAC,EAAUnzC,KAAK4xC,GAIjBuB,EAAUnzC,KAAK4xC,EAExB,KAAK,GACH,GAAIwB,GAAM5uC,EAAK,GAAG4E,WACdiqC,EAAM7uC,EAAK,GAAG4E,UAQlB,OAPI6pC,GAAO,KACTG,EAAM,IAAMA,EAAM,KAEhBH,EAAO,KACTI,EAAM,IAAMA,EAAM,KAGbD,EAAM,IAAMpzC,KAAK4xC,GAAK,IAAMyB,CAErC,SAEE,MAAOrzC,MAAKijB,GAAK,IAAMjjB,KAAKwE,KAAK+G,KAAK,MAAQ,MASpDmX,EAAana,UAAU0nC,OAAS,SAASC,GACxC,GAAI1rC,GAAOxE,KAAKwE,KACZyuC,EAASpB,EAA8B7xC,KAAMwE,GAAM,GACnDotC,EAAKrB,EAAMvtB,UAAUhjB,KAAKijB,GAG9B,QAFA2uB,EAAmB,mBAAPA,GAAqB5xC,KAAK4xC,GAAKA,EAEnCptC,EAAKP,QACX,IAAK,GACH,GAAIivC,GAAQlwB,EAAU+uB,iBAAiB/xC,MAEnCmzC,EAAU3uC,EAAK,GAAG6rC,MAAMH,EAK5B,OAJI+C,GAAO,KACTE,EAAU,UAAYA,EAAU,YAGpB,UAAVD,EACKtB,EAAKuB,EAEK,SAAVD,EACAC,EAAUvB,EAIZuB,EAAUvB,CAEnB,KAAK,GACH,GAAIwB,GAAM5uC,EAAK,GACX8uC,EAAUF,EAAI/C,MAAMH,EACpB+C,GAAO,KACTK,EAAS,UAAYA,EAAS,WAGhC,IAAID,GAAM7uC,EAAK,GACX+uC,EAASF,EAAIhD,MAAMH,EAMvB,QALI+C,EAAO,KACTM,EAAS,UAAYA,EAAS,YAIxBvzC,KAAKkyC,iBACX,IAAK,sBAEH,MAAON,GAAK,IAAM0B,EAAS,KAAYC,EAAS,GAClD,KAAK,mBAGH,OAFAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAChBH,EAAIlB,iBACV,IAAK,kBACL,IAAK,sBACHoB,EAAS,UAAYA,EAAS,YAGtC,MAAOA,GAAS1B,EAAK2B,CAEvB,SAIE,MAAO,YAAcvzC,KAAKijB,GAAK,WACrBze,EAAKzC,IAAI,SAAUoE,GACnB,MAAOA,GAAIkqC,MAAMH,KAChB3kC,KAAK,KAAO,aAQ5BmX,EAAana,UAAU2pC,cAAgB,WACrC,MAAOlyC,MAAKmB,KAAO,IAAMnB,KAAKijB,IAGhCpjB,EAAOD,QAAU8iB,GAKZ,SAAS7iB,EAAQD,EAASM,GAE/B,YAgBA,SAAS+hB,GAAcnc,EAAMtB,GAC3B,KAAMxE,eAAgBiiB,IACpB,KAAM,IAAIhc,aAAY,mDAIxB,IAAoB,gBAATH,GAAmB,KAAM,IAAIW,WAAU,uCAClD,KAAK1C,EAAQS,KAAUA,EAAKorC,MAAMC,GAChC,KAAM,IAAIppC,WAAU,uDAGtBzG,MAAK8F,KAAOA,EACZ9F,KAAKwE,KAAOA,MA1Bd,GAAI+iB,GAAOrnB,EAAoB,KAC3B2hB,EAAa3hB,EAAoB,KAEjCqwC,EAAQrwC,EAAoB,KAC5B2vC,EAAStoB,EAAKsoB,OACd9rC,EAAUD,MAAMC,OAwBpBke,GAAa1Z,UAAY,GAAIgf,GAE7BtF,EAAa1Z,UAAUpH,KAAO,eAU9B8gB,EAAa1Z,UAAUunC,SAAW,SAAUC,GAC1C,GAAI9sB,GAAK8sB,EAAKlvC,KAAKb,KAAK8F,MACpB0tC,EAAuB,kBAAPvwB,IAAqC,GAAdA,EAAG6P,QAG1CtuB,EAAOxE,KAAKwE,KAAKzC,IAAI,SAAUoE,GACjC,MAAOA,GAAI2pC,SAASC,IAGtB,IAAIyD,EAAO,CAET,GAAIC,EACJ,GACEA,GAAa,IAAMrrC,KAAK4gB,MAAsB,IAAhB5gB,KAAK8iB,gBAE9BuoB,IAAc1D,GAGrB,OAFAA,GAAK0D,GAAczzC,KAAKwE,KAEjB,KAAOxE,KAAK8F,KAAO,uBACV9F,KAAK8F,KAAO,MAAQtB,EAAK+G,KAAK,MAAQ,aACvCvL,KAAK8F,KAAO,MAAa2tC,EAAa,kBAIrD,GAAI9gB,GAAS,GAAI9Q,GAAW7hB,KAAK8F,KACjC,OAAO6sB,GAAOmd,SAASC,GAAQ,IAAMvrC,EAAK+G,KAAK,MAAQ,KAQ3D0W,EAAa1Z,UAAU1G,QAAU,SAAU4B,GACzC,IAAK,GAAIC,GAAI,EAAGA,EAAI1D,KAAKwE,KAAKP,OAAQP,IACpCD,EAASzD,KAAKwE,KAAKd,GAAI,QAAUA,EAAI,IAAK1D,OAU9CiiB,EAAa1Z,UAAUxG,IAAM,SAAU0B,GAErC,IAAK,GADDe,MACKd,EAAI,EAAGA,EAAI1D,KAAKwE,KAAKP,OAAQP,IACpCc,EAAKd,GAAK1D,KAAKgwC,QAAQvsC,EAASzD,KAAKwE,KAAKd,GAAI,QAAUA,EAAI,IAAK1D,MAEnE,OAAO,IAAIiiB,GAAajiB,KAAK8F,KAAMtB,IAOrCyd,EAAa1Z,UAAUI,MAAQ,WAC7B,MAAO,IAAIsZ,GAAajiB,KAAK8F,KAAM9F,KAAKwE,KAAK4a,MAAM,KAOrD6C,EAAa1Z,UAAUa,SAAW,WAEhC,MAAOpJ,MAAK8F,KAAO,IAAM9F,KAAKwE,KAAK+G,KAAK,MAAQ,KAQlD0W,EAAa1Z,UAAU0nC,OAAS,SAASC,GACvC,MAAOK,GAAMmD,WAAW1zC,KAAMkwC,EAAWlwC,KAAK8F,OAOhDmc,EAAa1Z,UAAU2pC,cAAgB,WACrC,MAAOlyC,MAAKmB,KAAO,IAAMnB,KAAK8F,MAGhCjG,EAAOD,QAAUqiB,GAKZ,SAASpiB,EAAQD,EAASM,GAE/B,YAeA,SAAS8jB,GAAWva,EAAOC,EAAKC,GAC9B,KAAM3J,eAAgBgkB,IACpB,KAAM,IAAI/d,aAAY,mDAIxB,KAAK4pC,EAAOpmC,GAAQ,KAAM,IAAIhD,WAAU,gBACxC,KAAKopC,EAAOnmC,GAAM,KAAM,IAAIjD,WAAU,gBACtC,IAAIkD,IAASkmC,EAAOlmC,GAAO,KAAM,IAAIlD,WAAU,gBAC/C,IAAIP,UAAUjC,OAAS,EAAG,KAAM,IAAIxB,OAAM,qBAE1CzC,MAAKyJ,MAAQA,EACbzJ,KAAK0J,IAAQA,EACb1J,KAAK2J,KAAQA,GAAQ,KA1BvB,GAAI4d,GAAOrnB,EAAoB,KAC3B8iB,EAAY9iB,EAAoB,KAEhC2vC,EAAStoB,EAAKsoB,MA0BlB7rB,GAAUzb,UAAY,GAAIgf,GAE1BvD,EAAUzb,UAAUpH,KAAO,YAU3B6iB,EAAUzb,UAAUunC,SAAW,SAAUC,GACvC,MAAO,cACH/vC,KAAKyJ,MAAMqmC,SAASC,GAAQ,KAC5B/vC,KAAK0J,IAAIomC,SAASC,IACjB/vC,KAAK2J,KAAQ,KAAO3J,KAAK2J,KAAKmmC,SAASC,GAAS,IACjD,KAON/rB,EAAUzb,UAAU1G,QAAU,SAAU4B,GACtCA,EAASzD,KAAKyJ,MAAO,QAASzJ,MAC9ByD,EAASzD,KAAK0J,IAAK,MAAO1J,MACtBA,KAAK2J,MACPlG,EAASzD,KAAK2J,KAAM,OAAQ3J,OAUhCgkB,EAAUzb,UAAUxG,IAAM,SAAU0B,GAClC,MAAO,IAAIugB,GACPhkB,KAAKgwC,QAAQvsC,EAASzD,KAAKyJ,MAAO,QAASzJ,OAC3CA,KAAKgwC,QAAQvsC,EAASzD,KAAK0J,IAAK,MAAO1J,OACvCA,KAAK2J,MAAQ3J,KAAKgwC,QAAQvsC,EAASzD,KAAK2J,KAAM,OAAQ3J,SAQ5DgkB,EAAUzb,UAAUI,MAAQ,WAC1B,MAAO,IAAIqb,GAAUhkB,KAAKyJ,MAAOzJ,KAAK0J,IAAK1J,KAAK2J,MAAQ3J,KAAK2J,OAO/Dqa,EAAUzb,UAAUa,SAAW,WAC7B,GAGI1B,GAHA8oC,EAAaxtB,EAAUytB,cAAczwC,MAKrCyJ,EAAQzJ,KAAKyJ,MAAML,WACnBuqC,EAAkB3wB,EAAUytB,cAAczwC,KAAKyJ,MAMnD,IALyB,OAApBkqC,GAAiDnD,GAAnBmD,IACjClqC,EAAQ,IAAMA,EAAQ,KAExB/B,EAAM+B,EAEFzJ,KAAK2J,KAAM,CACb,GAAIA,GAAO3J,KAAK2J,KAAKP,WACjBwqC,EAAiB5wB,EAAUytB,cAAczwC,KAAK2J,KAC1B,QAAnBiqC,GAA+CpD,GAAlBoD,IAChCjqC,EAAO,IAAMA,EAAO,KAEtBjC,GAAO,IAAMiC,EAGf,GAAID,GAAM1J,KAAK0J,IAAIN,WACfyqC,EAAgB7wB,EAAUytB,cAAczwC,KAAK0J,IAMjD,OALuB,QAAlBmqC,GAA6CrD,GAAjBqD,IAC/BnqC,EAAM,IAAMA,EAAM,KAEpBhC,GAAO,IAAMgC,GAUfsa,EAAUzb,UAAU0nC,OAAS,SAASC,GACpC,GAAIxoC,GAAM1H,KAAKyJ,MAAM4mC,MAAMH,EAM3B,OALIlwC,MAAK2J,OACPjC,GAAO,IAAM1H,KAAK2J,KAAK0mC,MAAMH,IAE/BxoC,GAAO,IAAM1H,KAAK0J,IAAI2mC,MAAMH,IAK9BrwC,EAAOD,QAAUokB,GAKZ,SAASnkB,EAAQD,EAASM,GAE/B,YAeA,SAAS2hB,GAAW/b,GAClB,KAAM9F,eAAgB6hB,IACpB,KAAM,IAAI5b,aAAY,mDAIxB,KAAKqB,EAASxB,GAAQ,KAAM,IAAIW,WAAU,uCAE1CzG,MAAK8F,KAAOA,EA4Dd,QAASguC,GAAOhuC,GACd,KAAM,IAAIrD,OAAM,oBAAsBqD,GAlFxC,GAAIyhB,GAAOrnB,EAAoB,KAC3BqB,EAAOrB,EAAoB,GAE3BqwC,EAAQrwC,EAAoB,KAC5BoH,EAAWpH,EAAoB,KAAKoH,QAoBxCua,GAAWtZ,UAAY,GAAIgf,GAE3B1F,EAAWtZ,UAAUpH,KAAO,aAU5B0gB,EAAWtZ,UAAUunC,SAAW,SAAUC,GAKxC,MAHAA,GAAY,MAAI+D,EAChB/D,EAAW,KAAIxuC,EAEXvB,KAAK8F,OAAQiqC,GAAKvrC,KAGbxE,KAAK8F,KAEL9F,KAAK8F,OAAQiqC,GAAKlvC,KAClB,KAAOb,KAAK8F,KAAO,uBAAyB9F,KAAK8F,KAAO,cAAgB9F,KAAK8F,KAAO,MAGpF,KACG9F,KAAK8F,KAAO,uBAAyB9F,KAAK8F,KAAO,SACtDvE,EAAK8L,gBAAgBrN,KAAK8F,MACvB,mBAAqB9F,KAAK8F,KAAO,KACjC,UAAY9F,KAAK8F,KAAO,MAC5B,KAQR+b,EAAWtZ,UAAU1G,QAAU,SAAU4B,KAUzCoe,EAAWtZ,UAAUxG,IAAM,SAAU0B,GACnC,MAAOzD,MAAK2I,SAedkZ,EAAWtZ,UAAUI,MAAQ,WAC3B,MAAO,IAAIkZ,GAAW7hB,KAAK8F,OAQ7B+b,EAAWtZ,UAAUa,SAAW,WAC9B,MAAOpJ,MAAK8F,MASd+b,EAAWtZ,UAAU0nC,OAAS,SAASC,GACrC,GAAIvd,GAAS4d,EAAMI,SAAS3wC,KAAK8F,KACjC,OAAkB,OAAd6sB,EAAO,GAEFA,EAGF,IAAMA,GAGf9yB,EAAOD,QAAUiiB,GAKZ,SAAShiB,EAAQD,EAASM,GAE/B,YAaA,SAAS8hB,GAAWlgB,EAAO+a,GACzB,KAAM7c,eAAgBgiB,IACpB,KAAM,IAAI/b,aAAY,mDAGxB,MAAMnE,YAAiBigB,IACrB,KAAM,IAAItb,WAAU,2CAEtB,MAAMoW,YAAgB0K,IACpB,KAAM,IAAI9gB,WAAU,qCAGtBzG,MAAK8B,MAAQA,EACb9B,KAAK6c,KAAOA,EAxBd,GAAI0K,GAAOrnB,EAAoB,KAC3B6hB,EAAY7hB,EAAoB,IA0BpC8hB,GAAWzZ,UAAY,GAAIgf,GAE3BvF,EAAWzZ,UAAUpH,KAAO,aAU5B6gB,EAAWzZ,UAAUunC,SAAW,SAAUC,GACxC,GAAIqD,GAAOpzC,KAAK8B,MAAM6vC,cAAgB5B,GAAKvrC,KACvCxE,KAAK8F,KAAO,MACZ,UAAY9F,KAAK8B,MAAM6vC,aAAe,KAEtC0B,EAAMrzC,KAAK8B,MAAMyvC,cAAcxB,EAAO/vC,KAAK6c,KAAKizB,SAASC,GAE7D,OAAOqD,GAAM,MAAQC,GAOvBrxB,EAAWzZ,UAAU1G,QAAU,SAAU4B,GACvCA,EAASzD,KAAK8B,MAAO,QAAS9B,MAC9ByD,EAASzD,KAAK6c,KAAM,OAAQ7c,OAS9BgiB,EAAWzZ,UAAUxG,IAAM,SAAU0B,GACnC,MAAO,IAAIue,GACPhiB,KAAKgwC,QAAQvsC,EAASzD,KAAK8B,MAAO,QAAS9B,OAC3CA,KAAKgwC,QAAQvsC,EAASzD,KAAK6c,KAAM,OAAQ7c,SAQ/CgiB,EAAWzZ,UAAUI,MAAQ,WAC3B,MAAO,IAAIqZ,GAAWhiB,KAAK8B,MAAO9B,KAAK6c,OAOzCmF,EAAWzZ,UAAUa,SAAW,WAC9B,MAAOpJ,MAAK8B,MAAMsH,WAAa,MAAQpJ,KAAK6c,KAAKzT,YAQnD4Y,EAAWzZ,UAAU0nC,OAAS,SAASC,GACrC,MAAOlwC,MAAK8B,MAAMuuC,MAAMH,GAAa,KAAOlwC,KAAK6c,KAAKwzB,MAAMH,IAG9DrwC,EAAOD,QAAUoiB,GAKZ,SAASniB,EAAQD,EAASM,GAE/B,YAOA,SAASqnB,KACP,KAAMvnB,eAAgBunB,IACpB,KAAM,IAAIthB,aAAY,oDAuS1B,QAAS8tC,GAAgB3sB,GACvB,IAAK,GAAIuL,KAAUvL,GACjB,GAAIA,EAAMxa,eAAe+lB,IACnBA,IAAU2d,GACZ,KAAM,IAAI7tC,OAAM,sCAAwCkwB,EAAS,2BAazE,QAASqhB,GAAWnzC,GAClB,GAAIozC,GAAcjxC,OAAOrC,OAAOE,EAEhC,IAAIA,EAAKG,YAAcH,EAAKG,WAAWU,UACrC,IAAK,GAAIoE,KAAQjF,GAAKG,WAAWU,UAC3Bb,EAAKG,WAAWU,UAAUkL,eAAe9G,KAC3CmuC,EAAYnuC,GAAQjF,EAAKG,WAAWU,UAAUoE;;AAKpD,MAAOmuC,GA1UT,GAAI3D,GAAWpwC,EAAoB,IAgBnCqnB,GAAKhf,UAAUuU,KAAO,WACpB,KAAM,IAAIra,OAAM,2EAIlB8kB,EAAKhf,UAAUpH,KAAO,OAUtBomB,EAAKhf,UAAU+e,QAAU,SAAUzmB,GACjC,KAAMA,YAAgBmC,SACpB,KAAM,IAAIyD,WAAU,qCAItB,IAAIspC,IACFlvC,KAAMmzC,EAAWnzC,GACjB2D,QACAuvC,eAAgBA,GAGdG,EAAOl0C,KAAK8vC,SAASC,GAErBoE,EAAWnxC,OAAOqnC,KAAK0F,GAAMhuC,IAAI,SAAU+D,GAC7C,MAAO,WAAaA,EAAO,YAAcA,EAAO,QAG9CsuC,EACAD,EAAS5oC,KAAK,KACV,+GAIgB2oC,EAAO,SAI3Bv0C,EAAU,GAAI00C,UAAU,OAAQD,EACpC,OAAOz0C,GAAQowC,IAWjBxoB,EAAKhf,UAAUunC,SAAW,SAAUC,GAElC,KAAM,IAAIttC,OAAM,oCAOlB8kB,EAAKhf,UAAU1G,QAAU,SAAU4B,GAEjC,KAAM,IAAIhB,OAAM,2CASlB8kB,EAAKhf,UAAUxG,IAAM,SAAU0B,GAE7B,KAAM,IAAIhB,OAAM,uCASlB8kB,EAAKhf,UAAUynC,QAAU,SAAU/uC,GACjC,KAAMA,YAAgBsmB,IACpB,KAAM,IAAI9gB,WAAU,uCAGtB,OAAOxF,IASTsmB,EAAKhf,UAAUilC,SAAW,SAAU/pC,GAKlC,QAAS6wC,GAAWrzC,EAAMwC,GACxBxC,EAAKY,QAAQ,SAAS0c,EAAOtS,EAAMwS,GACjChb,EAAS8a,EAAOtS,EAAMwS,GACtB61B,EAAU/1B,EAAO9a,KANrBA,EAASzD,KAAM,KAAM,MASrBs0C,EAAUt0C,KAAMyD,IAwBlB8jB,EAAKhf,UAAU7G,UAAY,SAAU+B,GAQnC,QAASuwC,GAAY/yC,EAAMwC,GACzB,MAAOxC,GAAKc,IAAI,SAASwc,EAAOtS,EAAMwS,GACpC,GAAI7S,GAAcnI,EAAS8a,EAAOtS,EAAMwS,EACxC,OAAQ7S,KAAgB2S,EAAS3S,EAAcooC,EAAWz1B,EAAO9a,KATrE,GAAImI,GAAcnI,EAASzD,KAAM,KAAM,KACvC,OAAI4L,KAAgB5L,KACX4L,EAUFooC,EAAWh0C,KAAMyD,IAiB1B8jB,EAAKhf,UAAU3G,OAAS,SAAU6B,GAChC,GAAIic,KAQJ,OANA1f,MAAKwtC,SAAS,SAAUvsC,EAAMgL,EAAMwS,GAC9Bhb,EAASxC,EAAMgL,EAAMwS,IACvBiB,EAAM5c,KAAK7B,KAIRye,GAIT6H,EAAKhf,UAAUgsC,KAAO,WACpB,KAAM,IAAI9xC,OAAM,+DAIlB8kB,EAAKhf,UAAU8oC,MAAQ,WACrB,KAAM,IAAI5uC,OAAM,iGAOlB8kB,EAAKhf,UAAUI,MAAQ,WAErB,KAAM,IAAIlG,OAAM,kCAOlB8kB,EAAKhf,UAAUa,SAAW,WACxB,MAAO,IAaTme,EAAKhf,UAAU8nC,MAAQ,SAAS5sC,GAC9B,GAAI+wC,EAMJ,IALkB,cAAdx0C,KAAKmB,YAGAnB,MAAKmwC,UAEU,gBAAb1sC,GACU,iBAAdzD,KAAKmB,MAA4BsC,EAASmJ,eAAe5M,KAAK8F,QAEjE0uC,EAAY/wC,EAASzD,KAAK8F,MAAM9F,KAAMyD,QAGrC,IAAwB,kBAAbA,GAEd+wC,EAAY/wC,EAASzD,KAAMyD,OAExB,IAAyB,gBAAbA,IAAyC,cAAdzD,KAAKmB,KAG/CnB,KAAKmwC,UAAY1sC,MAEd,IAAwB,mBAAbA,GACd,KAAM,IAAIgD,WAAU,0CAGtB,OAAyB,mBAAd+tC,GACFA,EAGFx0C,KAAKiwC,OAAOxsC,IAUrB8jB,EAAKhf,UAAU0nC,OAAS,WACtB,GAAkB,SAAdjwC,KAAKmB,KAEP,MAAO,EAGT,MAAM,IAAIsB,OAAM,yCAOlB8kB,EAAKhf,UAAU2pC,cAAgB,WAC9B,MAAOlyC,MAAKmB,MAQbomB,EAAKsoB,OAAS,SAASzlC,GACrB,MAAOA,aAAkBmd,IAuC3B1nB,EAAOD,QAAU2nB,GAKZ,SAAS1nB,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,IACR0W,SAAY,YACZE,QACE,KAEFD,YAAe,oFACfE,UACE,IACA,QACA,SACA,UAEFK,SAAY,SAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,YACZE,QACE,SAEFD,YAAe,sBACfE,UACE,SAEFK,SAAY,UAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,IACR0W,SAAY,YACZE,QACE,KAEFD,YAAe,sIACfE,UACE,IACA,QACA,YAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,WACR0W,SAAY,YACZE,QACE,YAEFD,YAAe,6GACfE,UACE,WACA,SAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,OAEFD,YAAe,mEACfE,UACE,MACA,UAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,YACZE,QACE,QAEFD,YAAe,oEACfE,UACE,OACA,WAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,YACZE,QACE,SAEFD,YAAe,kEACfE,UACE,QACA,aAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,YACZE,QACE,UAEFD,YAAe,mEACfE,UACE,SACA,cAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,OAEFD,YAAe,eACfE,UACE,MACA,SAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,YACZE,QACE,QAEFD,YAAe,aACfE,UACE,QAEFK,SAAY,OAAQ,WAMjB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,KACR0W,SAAY,YACZE,QACE,MAEFD,YAAe,gJACfE,UACE,KACA,aAEFK,SAAY,SAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,OAEFD,YAAe,mOACfE,UACE,OAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,YACZE,QACE,WAEFD,YAAe,+DACfE,UACE,UACA,aAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,YACZE,QACE,SAEFD,YAAe,6DACfE,UACE,QACA,WAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,OAEFD,YAAe,0GACfE,UACE,MACA,UAEFK,SAAY,QAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,YACZE,QACE,QAEFD,YAAe,qBACfE,UACE,QAEFK,SAAY,WAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,YACZE,QACE,WAEFD,YAAe,8CACfE,UACE,WAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/B,GACIwF,IADiBxF,EAAoB,KACxBA,EAAoB,KAOrCN,GAAQ8B,UAAY,SAAUuL,GAC5B,MAAIA,aAAevH,GACV,GAAIA,GAAWuH,EAAInL,MAAQ,EAAGmL,EAAI/K,IAAM,EAAG+K,EAAIjL,IAAM,GAGvDiL,IAMJ,SAASpN,EAAQD,EAASM,GAE/B,YAOAN,GAAQ2yB,UAAY,SAAS1sB,GAC3B,MAAQA,aAAiBknC,UAA6B,iBAATlnC,KAM1C,SAAShG,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAAQwB,EAAMP,EAAQ4B,GAE7B,GAAI8wB,GAAY9wB,EAAKtC,EAAoB,MACrCg3B,EAAiB10B,EAAKtC,EAAoB,MAgB1CmzB,EAAgB,SAAUnkB,EAAGhL,EAAG6pB,EAAGkH,EAAGnwB,EAAGia,EAAMte,GASjD,IAAK,GAPD+zB,GAAUtlB,EAAEqe,QACZkH,EAASvlB,EAAEse,OACXkH,EAAOxlB,EAAEue,KAETmH,EAASn0B,EAAE+sB,OAGN4B,EAAKsF,EAAKxwB,GAAImrB,EAAKqF,EAAKxwB,EAAI,GAAIoK,EAAI8gB,EAAQC,EAAJ/gB,EAAQA,IAAK,CAE5D,GAAI5K,GAAI+wB,EAAOnmB,IAEV2mB,EAAEvxB,IAAMuxB,EAAEvxB,GAAKqb,GAElBkW,EAAEvxB,GAAKqb,EAEP6V,EAAO9xB,KAAKY,GAERoB,IACFA,EAAEpB,GAAKwzB,EAAenJ,EAAGyG,EAAQlmB,MAE5BxJ,IAEPA,EAAEpB,GAAK4vB,EAAUxuB,EAAEpB,GAAIwzB,EAAenJ,EAAGyG,EAAQlmB,MAIrD,MAAOsmB,GAAO3wB,OAGhB,OAAOovB,GAGTzzB,EAAQkG,KAAO,gBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAAQwB,EAAMP,EAAQ4B,EAAMK,GAenC,GAAIywB,GAAYzwB,EAAM,aAEpBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,GAAIsK,GAGb6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,MAAO,IAAIjO,GAAKC,QACd0D,EAAEiB,GAAKqJ,EAAErJ,GACTjB,EAAEkB,GAAKoJ,EAAEpJ,KAIbswB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAE61B,KAAKvrB,IAGhB8sB,aAAc,SAAUp3B,EAAGsK,GACzB,GAAe,MAAXtK,EAAEe,MAAe,KAAM,IAAIpD,OAAM,mDACrC,IAAe,MAAX2M,EAAEvJ,MAAe,KAAM,IAAIpD,OAAM,mDACrC,KAAKqC,EAAEyI,UAAU6B,GAAI,KAAM,IAAI3M,OAAM,qBAErC,IAAI2C,GAAMN,EAAE6D,OAGZ,OAFAvD,GAAIS,OAASuJ,EAAEvJ,MACfT,EAAIoH,WAAY,EACTpH,GAGT2+B,iBAAkB,SAAUj/B,EAAGsK,GAC7B,MAAOtK,GAAIsK,IAIf,OAAOkkB,GAGT1zB,EAAQkG,KAAO,YACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAAQwB,EAAMP,EAAQ4B,EAAMK,GAenC,GAAIq0B,GAAiBr0B,EAAM,kBAEzBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,GAAIsK,GAGb6rB,mBAAoB,SAAUn2B,EAAGsK,GAC/B,MAAO,IAAIjO,GAAKC,QACd0D,EAAEiB,GAAKqJ,EAAErJ,GAAKjB,EAAEkB,GAAKoJ,EAAEpJ,GACvBlB,EAAEiB,GAAKqJ,EAAEpJ,GAAKlB,EAAEkB,GAAKoJ,EAAErJ,KAI3BuwB,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAE2wB,MAAMrmB,IAGjBqlC,eAAgB,SAAU3vC,EAAGsK,GAC3B,GAAIhK,GAAMgK,EAAEzG,OAEZ,OADAvD,GAAIS,MAAuB,OAAdT,EAAIS,MAAkBT,EAAImH,WAAWzH,GAAMM,EAAIS,MAAQf,EAC7DM,GAGTsvC,eAAgB,SAAU5vC,EAAGsK,GAC3B,GAAIhK,GAAMN,EAAE6D,OAEZ,OADAvD,GAAIS,MAAuB,OAAdT,EAAIS,MAAkBT,EAAImH,WAAW6C,GAAMhK,EAAIS,MAAQuJ,EAC7DhK,IAIX,OAAO8xB,GAGTt3B,EAAQkG,KAAO,iBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAAQwB,EAAMP,EAAQ4B,EAAMK,GAuCnC,QAAS8xC,GAAgB7vC,EAAGsK,GAC1B,GAAIs0B,GAAMt0B,EAAErJ,GAAKqJ,EAAErJ,GAAKqJ,EAAEpJ,GAAKoJ,EAAEpJ,EACjC,OAAW,IAAP09B,EACK,GAAIviC,GAAKC,SACX0D,EAAEiB,GAAKqJ,EAAErJ,GAAKjB,EAAEkB,GAAKoJ,EAAEpJ,IAAM09B,GAC7B5+B,EAAEkB,GAAKoJ,EAAErJ,GAAKjB,EAAEiB,GAAKqJ,EAAEpJ,IAAM09B,GAK3B,GAAIviC,GAAKC,QACH,GAAR0D,EAAEiB,GAAYjB,EAAEiB,GAAK,EAAK,EAClB,GAARjB,EAAEkB,GAAYlB,EAAEkB,GAAK,EAAK,GArCnC,GAAI0vB,GAAe7yB,EAAM,gBACvBuzB,iBAAkB,SAAUtxB,EAAGsK,GAC7B,MAAOtK,GAAIsK,GAGb6rB,mBAAoB0Z,EAEpBre,uBAAwB,SAAUxxB,EAAGsK,GACnC,MAAOtK,GAAE8xB,IAAIxnB,IAGfslC,eAAgB,SAAU5vC,EAAGsK,GAC3B,GAAIhK,GAAMN,EAAE6D,OAEZ,OADAvD,GAAIS,OAAwB,OAAdT,EAAIS,MAAkBT,EAAImH,WAAW,GAAKnH,EAAIS,OAASuJ,EAC9DhK,IA4BX,OAAOswB,GAGT91B,EAAQkG,KAAO,eACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YA4XA,SAAS00C,GAAQ9vC,EAAGsK,EAAGylC,GACrB,GAEIC,GAAOC,EAFP53B,EAAYrY,EAAE4G,YAGdspC,IAAUlwC,EAAEqS,EAAI,GAChB89B,IAAU7lC,EAAE+H,EAAI,EACpB,IAAI69B,EAAO,CACTF,EAAQI,EAA6Bt1C,EAAQglB,IAAI9f,GACjD,KAAK,GAAIpB,GAAI,EAAGA,EAAIoxC,EAAM7wC,SAAUP,EAClCoxC,EAAMpxC,IAAM,MAGdoxC,GAAQI,EAA6BpwC,EAEvC,IAAImwC,EAAO,CACTF,EAAQG,EAA6Bt1C,EAAQglB,IAAIxV,GACjD,KAAK,GAAI1L,GAAI,EAAGA,EAAIqxC,EAAM9wC,SAAUP,EAClCqxC,EAAMrxC,IAAM,MAGdqxC,GAAQG,EAA6B9lC,EAGvC,IAAI+lC,GAASC,EAASC,CAClBP,GAAM7wC,QAAU8wC,EAAM9wC,QACxBkxC,EAAUL,EACVM,EAAUL,EACVM,EAAUL,IAEVG,EAAUJ,EACVK,EAAUN,EACVO,EAAUJ,EAGZ,IAAIK,GAAWH,EAAQlxC,OACnBsxC,EAAUH,EAAQnxC,OAClBuxC,EAAkC,EAArBX,EAAKG,EAAOC,GACzBQ,EAAS,GAAIt4B,GAAuB,EAAbq4B,GACvBE,EAAWv4B,EAAUw4B,IACrBC,EAAM,GAAIz4B,GAAU,GAEpB04B,EAAW14B,EAAUha,SAGzB,KAFAga,EAAUvc,QAAQuC,UAAW,MAEtBmyC,EAAW,GACZT,EAAKM,IAAUG,GAAWF,IAAUG,KAAaC,IACnDC,EAASA,EAAO9a,KAAK+a,IAEvBA,EAAWA,EAASjgB,MAAMmgB,EAE5B,MAAOL,EAAU,GACXV,EAAKQ,EAASD,IAAUG,KAAaC,IACvCC,EAASA,EAAO9a,KAAK+a,IAEvBA,EAAWA,EAASjgB,MAAMmgB,EAQ5B,OALAz4B,GAAUvc,QAAQuC,UAAW0yC,IAEX,GAAdL,IACFC,EAAOt+B,GAAKs+B,EAAOt+B,GAEds+B,EAIT,QAASP,GAA6BpwC,GAKpC,IAAK,GAHDoK,GAAIpK,EAAErE,EACN6F,EAAI4I,EAAE,GAAK,GAENxL,EAAI,EAAGA,EAAIwL,EAAEjL,SAAUP,EAAG,CAEjC,IAAK,GADDyT,GAAIjI,EAAExL,GAAK,GACNyL,EAAI,EAAIgI,EAAElT,OAAQkL,KACzBgI,EAAI,IAAMA,CAGZ7Q,IAAK6Q,EAGP,GAAIjT,EACJ,KAAKA,EAAIoC,EAAErC,OAAS,EAAkB,KAAfqC,EAAES,OAAO7C,KAAaA,GAE7C,GAAI4xC,GAAKhxC,EAAEiY,EACPrV,EAAMpB,EAAE8Y,MAAM,EAAGlb,EAAI,GAAK,GAC1B6xC,EAAOruC,EAAIzD,MACf,IAAI6xC,EAAK,EACP,KAAMA,EAAKC,EAET,IAAKD,GAAMC,EAAMD,IAAMpuC,GAAO,SAChBquC,GAALD,IACTpuC,EAAMA,EAAI0X,MAAM,EAAG02B,GAAM,IAAMpuC,EAAI0X,MAAM02B,GAM7C,KAAK,GADDE,IAAO,GACFtyC,EAAI,EAAGA,EAAIgE,EAAIzD,QAAU,CAChC,IAAK,GAAIgyC,GAAOD,EAAI/xC,OAAQgyC,IAAQD,EAAIC,IAAS,IAEjDD,EAAI,IAAMtuC,EAAIX,OAAOrD,MAAQ,CAC7B,KAAK,GAAIQ,GAAI,EAAGA,EAAI8xC,EAAI/xC,SAAUC,EAC5B8xC,EAAI9xC,GAAK,IACO,MAAd8xC,EAAI9xC,EAAI,KACV8xC,EAAI9xC,EAAI,GAAK,GAGf8xC,EAAI9xC,EAAI,IAAM8xC,EAAI9xC,IAAM,EACxB8xC,EAAI9xC,IAAM,GAKhB,MAAO8xC,GAAIE,UAkiBb,QAASC,GAAcrxC,EAAGu7B,GACxB,GAAI+V,GAAe/V,EAAIl9B,UAGnBkzC,IAAcD,EAAe,GAC7BE,EAAOF,EAAe,EAAItxC,EAAEiY,EAC5Bw5B,EAAiB,GAAKzxC,EAAEiY,EACxBy5B,EAAUpuC,KAAKpG,IAAiC,SAA7BoG,KAAK0F,IAAIsoC,EAAe,GAAgB,EAAO,EACtE/V,GAAIz/B,QAAQuC,UAAWozC,GAEvB,IAAI7yC,GAAI,EACJ+yC,EAAO,GAAIpW,GAAIj4B,KAAKikB,KAAKvnB,EAAEqD,YAAc,GAC7C,GAAG,CACD,GAAIuuC,GAAO92C,EAAQioC,gBAAgB4O,EAAMpW,EAAK,GAAG,GAC7CsW,EAAOC,EAASF,EACfA,GAAKxgB,WACRwgB,EAAKv/B,EAAIs/B,EAAKt/B,EAGhB,IAAI0/B,GAAOH,EAAKpkB,MAAMxtB,GAAG8xB,IAAI+f,EAC7BF,GAAOA,EAAKnkB,MAAMukB,GAElBN,EAAiBnuC,KAAKlG,IAAI,EAAEq0C,EAAgBD,GAC5CjW,EAAIz/B,QAAQuC,UAAWozC,UACf,EAAEM,EAAK95B,GAAKs5B,IAAeQ,EAAK3gB,YAAexyB,GAAK8yC,EAE9D,IAAI9yC,GAAK8yC,EACP,KAAM,IAAI/zC,OAAM,mFAKlB,OADA49B,GAAIz/B,QAAQuC,UAAWizC,IAChBK,EAAKK,KAAKV,EAAe,GAalC,QAASW,GAAcjyC,EAAG3B,GACxB,GAAIk9B,GAAMv7B,EAAE4G,WACZ20B,GAAIz/B,QAAQuC,UAAWA,EAAYiF,KAAK0F,IAAI3K,GAAa,GAWzD,KAAK,GATDk3B,GAAM,GAAIgG,GAAI,GACdjxB,EAAItK,EACJkyC,EAAQrvB,EAAAA,EACRsvB,EAAKnyC,EAAE2wB,MAAM3wB,GACboyC,EAAUpyC,EACVqyC,EAAW,GAAI9W,GAAIhG,GACnB+c,EAAW,GAAI/W,GAAIhG,GAEnBgd,EAAO,GAAIhX,GAAIhG,GACV/rB,EAAI,GAAIc,EAAExG,OAAOouC,GAAQ1oC,GAAK,EACrC4oC,EAAUA,EAAQzhB,MAAMwhB,GAExBE,EAAWA,EAAS1hB,MAAM4hB,GAC1BD,EAAWA,EAAS3hB,MAAM4hB,EAAK1c,KAAKN,IAEpC2c,EAAQ5nC,EACRioC,EAAO,GAAIhX,GAAI/xB,GACfc,EAAIA,EAAEurB,KAAKuc,EAAQzhB,MAAM0hB,GAAUvgB,IAAIygB,EAAK5hB,MAAM2hB,IAIpD,OADA/W,GAAIz/B,QAAQuC,UAAWA,IAChBiM,EAAE0nC,KAAK3zC,EAAY,GAY5B,QAASm0C,GAAcxyC,GAOrB,IAAK,GANDsK,GAAItK,EACJkyC,EAAQrvB,EAAAA,EACRsvB,EAAKnyC,EAAE2wB,MAAM3wB,GACbmF,EAAMnF,EACNojB,GAAM,EAED5Z,EAAI,GAAIc,EAAExG,OAAOouC,GAAQ1oC,GAAK,EACrCrE,EAAMA,EAAIwrB,MAAMwhB,GAEhBD,EAAQ5nC,EACR8Y,GAAOA,EACP9Y,EAAI,EAAQA,EAAEurB,KAAK1wB,EAAI2sB,IAAItoB,IAAMc,EAAEkjB,MAAMroB,EAAI2sB,IAAItoB,GAGnD,OAAOc,GAgBT,QAASmoC,GAAezyC,EAAG0yC,GAUzB,IAAK,GATDnd,GAAMv1B,EAAE4G,YAAYiqC,IAEpBvmC,EAAItK,EACJkyC,EAAQrvB,EAAAA,EACRsvB,EAAKnyC,EAAE2wB,MAAM3wB,GACbmF,EAAM,EAASmF,EAAIA,EAAIirB,EACvBqJ,EAAMrJ,EACNnS,GAAM,EAED5Z,EAAIkpC,GAAOpoC,EAAExG,OAAOouC,GAAQ1oC,GAAK,EACxCrE,EAAMA,EAAIwrB,MAAMwhB,GAChBvT,EAAMA,EAAIjO,MAAMnnB,EAAE,GAAGmnB,MAAMnnB,EAAE,GAE7B0oC,EAAQ5nC,EACR8Y,GAAOA,EACP9Y,EAAI,EAAQA,EAAEurB,KAAK1wB,EAAI2sB,IAAI8M,IAAQt0B,EAAEkjB,MAAMroB,EAAI2sB,IAAI8M,GAGrD,OAAOt0B,GAWT,QAASqoC,GAAe3yC,EAAG3B,EAAWq0C,GACpC,GAAI5vB,GAAKhoB,EAAQgoB,GAAGzkB,EAAY,GAC5B6kB,EAAMpoB,EAAQooB,IAAI7kB,EACtB,IAAI2B,EAAEqE,MAAMo4B,IAAI3Z,EAAGkvB,KAAKhyC,EAAE4yC,OACxB,OAAQ5yC,GAAG,EAGb,IAAIu7B,GAAMv7B,EAAE4G,WAEZ,IAAI5G,EAAE8xB,IAAIhP,EAAGkvB,KAAKhyC,EAAE4yC,OAAOvvC,WAAa,GAAK,EAC3C,OAAQ,GAAIk4B,GAAW,EAAPmX,IAAW,EAG7B,IAAIpoC,GAAItK,EAAE4f,IAAIsD,EAGd,OAAI5Y,GAAE0nC,KAAKhyC,EAAE4yC,KAAM,GAAGxhB,UACZ,GAAImK,GAAW,EAAPmX,IAAW,IAGzBpoC,EAAEiyB,GAAGzZ,KACH4vB,GAEFpoC,EAAIA,EAAEkjB,MAAM1K,GACZxY,EAAE+H,GAAK/H,EAAE+H,GAGT/H,EAAI4Y,EAAIsK,MAAMljB,IAIlBA,EAAE1D,YAAc20B,GACRjxB,GAAG,IAWb,QAASwnC,GAASe,GAChB,GAAItX,GAAMsX,EAAOjsC,YACbvI,EAAYk9B,EAAIl9B,SACpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIQ,GAAM08B,EAAIsV,IAAIrjB,MAAMqlB,EAAOliB,MAAMkiB,IAASlvC,MAG9C,OADA43B,GAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAK3zC,EAAY,GA/sC9B,GAAIga,GAAYjd,EAAoB,KAChCsG,EAAWtG,EAAoB,KAAKsG,SACpC8W,EAASpd,EAAoB,KAAKod,OAClCs6B,EAAU13C,EAAoB,KAAK03C,OAQvCh4C,GAAQi4C,YAAc,SAAUhyC,GAC9B,MAAQA,aAAiBsX,IAY3Bvd,EAAQk4C,YAAc,SAAS50C,EAAQwI,GAGrC,MAAO,IAAIA,GAAa4R,EAAOpa,GAAU,GAAOA,EAAS,GAAMA,IAajEtD,EAAQmd,EAAI66B,EAAQ,SAAUz0C,GAC5B,GAAIk9B,GAAMljB,EAAUzR,aAAavI,UAAWA,GAE5C,OAAO,IAAIk9B,GAAI,GAAG7X,QAQpB5oB,EAAQ2G,IAAMqxC,EAAQ,SAAUz0C,GAC9B,GAAIk9B,GAAMljB,EAAUzR,aAAavI,UAAWA,GAE5C,OAAO,IAAIk9B,GAAI,GAAG1F,KAAK,GAAI0F,GAAI,GAAG53B,QAAQmuB,IAAI,KAWhDh3B,EAAQgoB,GAAKgwB,EAAQ,SAAUz0C,GAE7B,GAAIk9B,GAAMljB,EAAUzR,aAAavI,UAAWA,EAAY,IACpD40C,EAAQ,GAAI1X,GAAI,GAAG5K,MAAM6hB,EAAc,GAAIjX,GAAI,GAAGzJ,IAAI,KACrDtE,MAAMglB,EAAc,GAAIjX,GAAI,GAAGzJ,IAAI,MAKxC,OAHAyJ,GAAIz/B,QAAQuC,UAAWA,IAGhB,GAAIk9B,GAAI,GAAG5K,MAAMsiB,KAQ1Bn4C,EAAQooB,IAAM4vB,EAAQ,SAAUz0C,GAI9B,GAAIykB,GAAKhoB,EAAQgoB,GAAGzkB,EAAY,GAE5Bk9B,EAAMljB,EAAUzR,aAAavI,UAAWA,GAE5C,OAAO,IAAIk9B,GAAI,GAAG5K,MAAM7N,KA2B1BhoB,EAAQonB,IAAM,SAASliB,EAAGsK,GACxB,GAAKtK,EAAEy1B,aAAez1B,EAAEkG,aAAiBoE,EAAEmrB,aAAenrB,EAAEpE,YAC1D,KAAM,IAAIvI,OAAM,uCAGlB,IAAI0a,GAAYrY,EAAE4G,WAClB,IAAI5G,EAAEoF,SAAWkF,EAAElF,QACjB,MAAO,IAAIiT,GAAUwK,EAAAA,EAGvB,IAAI7iB,EAAEoxB,UAAY9mB,EAAEyjB,GAAG,KAAO/tB,EAAE+tB,GAAGzjB,GACjC,MAAOtK,EAET,IAAIsK,EAAE8mB,UAAYpxB,EAAE+tB,GAAG,IACrB,MAAOzjB,EAGT,KAAKtK,EAAEy1B,aAAenrB,EAAEmrB,WAAY,CAClC,IAAKz1B,EAAEy1B,aAAenrB,EAAEmrB,WACtB,MAAIz1B,GAAEgxB,cAAgB1mB,EAAE0mB,aACfhxB,EAEF,GAAIqY,GAAU,EAEvB,KAAKrY,EAAEy1B,WACL,MAAInrB,GAAE0mB,aACGhxB,EAELA,EAAEgxB,aACG,GAAI3Y,GAAU,GAEhB/N,CAET,KAAKA,EAAEmrB,WACL,MAAIz1B,GAAEgxB,aACG1mB,EAELA,EAAE0mB,aACG,GAAI3Y,GAAU,GAEhBrY,EAGX,MAAO8vC,GAAQ9vC,EAAGsK,EAAG,SAAUF,EAAG4J,GAAK,MAAO5J,GAAI4J,KAmBpDlZ,EAAQ8pB,UAAY,SAAU5kB,EAAGsK,GAC/B,GAAKtK,EAAEy1B,aAAez1B,EAAEkG,aAAiBoE,EAAEmrB,aAAenrB,EAAEpE,YAC1D,KAAM,IAAIvI,OAAM,0CAGlB,IAAI0a,GAAYrY,EAAE4G,WAClB,OAAI5G,GAAEoF,SAAWkF,EAAElF,SAAYkF,EAAE0mB,eAAiB1mB,EAAE8mB,SAC3C,GAAI/Y,GAAUwK,EAAAA,GAEnB7iB,EAAEoxB,UAAY9mB,EAAE8mB,SACXpxB,EAEJA,EAAEy1B,YAAenrB,EAAEmrB,WAMfz1B,EAAE2wB,MADPrmB,EAAE2M,GAAG,IACQ3T,KAAKc,IAAI,EAAGkG,EAAEjH,YAAc,GAE9B,GAAIgV,GAAU,GAAGjU,IAAIkG,IAP3B,GAAI+N,GAAUwK,EAAAA,IAezB/nB,EAAQglB,IAAM,SAAU9f,GACtB,GAAIA,EAAEy1B,aAAez1B,EAAEkG,YACrB,KAAM,IAAIvI,OAAM,sCAGlB,IAAI0a,GAAYrY,EAAE4G,YACdmqC,EAAW14B,EAAUha,SACzBga,GAAUvc,QAAQuC,UAAW,KAE7B,IAAI2B,GAAIA,EAAE61B,KAAKxd,EAAUw4B,IAIzB,OAHA7wC,GAAEqS,GAAKrS,EAAEqS,GAAK,KAEdgG,EAAUvc,QAAQuC,UAAW0yC,IACtB/wC,GAsBTlF,EAAQsnB,GAAK,SAAUpiB,EAAGsK,GACxB,GAAKtK,EAAEy1B,aAAez1B,EAAEkG,aAAiBoE,EAAEmrB,aAAenrB,EAAEpE,YAC1D,KAAM,IAAIvI,OAAM,sCAGlB,IAAI0a,GAAYrY,EAAE4G,WAClB,IAAI5G,EAAEoF,SAAWkF,EAAElF,QACjB,MAAO,IAAIiT,GAAUwK,EAAAA,EAGvB,IAAIqwB,GAAS,GAAI76B,GAAU,GAC3B,OAAIrY,GAAEoxB,UAAY9mB,EAAEyjB,GAAGmlB,IAAWlzC,EAAE+tB,GAAGzjB,GAC9BA,EAELA,EAAE8mB,UAAYpxB,EAAE+tB,GAAGmlB,GACdlzC,EAGJA,EAAEy1B,YAAenrB,EAAEmrB,WAUjBqa,EAAQ9vC,EAAGsK,EAAG,SAAUF,EAAG4J,GAAK,MAAO5J,GAAI4J,KAT1ChU,EAAEy1B,aAAez1B,EAAEgxB,cAAgB1mB,EAAE0mB,cACnChxB,EAAEgxB,eAAiB1mB,EAAE0mB,eAAiB1mB,EAAEmrB,WACvCyd,EAELlzC,EAAEgxB,cAAgB1mB,EAAE0mB,aACfhxB,EAAEy1B,WAAaz1B,EAAIsK,EAErBtK,EAAEy1B,WAAanrB,EAAItK,GAwB9BlF,EAAQ+pB,gBAAkB,SAAU7kB,EAAGsK,GACrC,GAAKtK,EAAEy1B,aAAez1B,EAAEkG,aAAiBoE,EAAEmrB,aAAenrB,EAAEpE,YAC1D,KAAM,IAAIvI,OAAM,gDAGlB,IAAI0a,GAAYrY,EAAE4G,WAClB,OAAI5G,GAAEoF,SAAWkF,EAAElF,SAAYkF,EAAE0mB,eAAiB1mB,EAAE8mB,SAC3C,GAAI/Y,GAAUwK,EAAAA,GAEnB7iB,EAAEoxB,UAAY9mB,EAAE8mB,SACXpxB,EAEJsK,EAAEmrB,WAWHnrB,EAAE2M,GAAG,IACAjX,EAAE8xB,IAAIxuB,KAAKc,IAAI,EAAGkG,EAAEjH,YAAc,IAAI8W,QAExCna,EAAE8xB,IAAI,GAAIzZ,GAAU,GAAGjU,IAAIkG,IAAI6P,QAZ3B,GAAI9B,GADTrY,EAAEgxB,aACiB,GAElBhxB,EAAEy1B,WAGc,EAFE5S,EAAAA,IA6B3B/nB,EAAQqnB,IAAM,SAAUniB,EAAGsK,GACzB,GAAKtK,EAAEy1B,aAAez1B,EAAEkG,aAAiBoE,EAAEmrB,aAAenrB,EAAEpE,YAC1D,KAAM,IAAIvI,OAAM,uCAGlB,IAAI0a,GAAYrY,EAAE4G,WAClB,IAAI5G,EAAEoF,SAAWkF,EAAElF,QACjB,MAAO,IAAIiT,GAAUwK,EAAAA,EAEvB,IAAI7iB,EAAEoxB,SACJ,MAAO9mB,EAET,IAAIA,EAAE8mB,SACJ,MAAOpxB,EAGT,IAAIA,EAAE+tB,GAAGzjB,GACP,MAAO,IAAI+N,GAAU,EAGvB,IAAI66B,GAAS,GAAI76B,GAAU,GAC3B,OAAIrY,GAAE+tB,GAAGmlB,GACAp4C,EAAQglB,IAAIxV,GAEjBA,EAAEyjB,GAAGmlB,GACAp4C,EAAQglB,IAAI9f,GAGhBA,EAAEy1B,YAAenrB,EAAEmrB,WAQjBqa,EAAQ9vC,EAAGsK,EAAG,SAAUF,EAAG4J,GAAK,MAAO5J,GAAI4J,IAP3ChU,EAAEy1B,YAAenrB,EAAEmrB,WAGjB,GAAIpd,GAAUrY,EAAEgxB,cAAgB1mB,EAAE0mB,aACpCsN,EAAAA,IACAA,EAAAA,IAJI4U,GA+Ibp4C,EAAQgmC,cAAgB,SAAU9gC,EAAGu7B,EAAK4X,GACxC,GAAI90C,GAAYk9B,EAAIl9B,SACpB,IAAI80C,GACF,GAAInzC,EAAEqE,MAAM4S,GAAGskB,EAAIsV,KACjB,KAAM,IAAIlzC,OAAM,wDAEb,IAAIqC,EAAEqE,MAAMk4B,GAAGhB,EAAIsV,KACxB,KAAM,IAAIlzC,OAAM,mDAElB,IAAIqC,EAAE+tB,GAAG,IACP,MAAOjzB,GAAQgoB,GAAGzkB,EAGpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,IAE/B80C,IACFnzC,EAAIu7B,EAAIsV,IAAI/e,IAAI9xB,GAGlB,IAAI+mB,GAAOjsB,EAAQwmC,cAAc/F,EAAIsV,IAAIrjB,MAAMxtB,EAAE2wB,MAAM3wB,IAAI2D,OACtBmuB,IAAI9xB,EAAE61B,KAAK0F,EAAIsV,MAAOtV,GAAK5K,MAAM,EAGtE,OADA4K,GAAIz/B,QAAQuC,UAAWA,IAChB0oB,EAAKirB,KAAK3zC,EAAY,IAW/BvD,EAAQ+mC,cAAgB,SAAU7hC,EAAGu7B,EAAK4X,GACxC,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAGjB,IAAIxkB,GAAYk9B,EAAIl9B,UAChB+0C,EAAOpzC,EAAEqE,KACb,IAAI8uC,EAAY,CACd,GAAIC,EAAKn8B,GAAGskB,EAAIsV,KACd,KAAM,IAAIlzC,OAAM,mDAGlB49B,GAAIz/B,QAAQuC,UAAWA,EAAY,IACnC2B,EAAIu7B,EAAIsV,IAAI/e,IAAI9xB,GAChBu7B,EAAIz/B,QAAQuC,UAAWA,IAEvB+0C,EAAOpzC,EAAEqE,UACJ,IAAI+uC,EAAK7W,GAAGhB,EAAIsV,KACrB,KAAM,IAAIlzC,OAAM,mDAIlB,IAAIy1C,EAAK7W,GAAG,IAAM,CAChBhB,EAAIz/B,QAAQuC,UAAWA,EAAY,GAGnC,IAAImH,GAAOxF,EAAEqS,EACTghC,EAASv4C,EAAQgoB,GAAGzkB,EAAY,GAAGyzB,IAAI,EAM3C,OALA9xB,GAAIqzC,EAAO7lB,MAAM1yB,EAAQ+mC,cAActG,EAAIsV,IAAIrjB,MAAMxtB,EAAE2wB,MAAM3wB,IAAI2D,OAAQ43B,IACzEv7B,EAAEqS,EAAI7M,EAENxF,EAAE4G,YAAc20B,EAChBA,EAAIz/B,QAAQuC,UAAWA,IAChB2B,EAAEgyC,KAAK3zC,EAAY,GAE5B,GAAIi1C,GAAaF,EAAK7W,GAAG,IACrB+W,KACF/X,EAAIz/B,QAAQuC,UAAWA,EAAY,IAGnC2B,EAAIA,EAAE8xB,IAAI,GAAIyJ,GAAI,GAAG53B,OAAOgtB,MAAM4K,EAAIsV,IAAIrjB,MAAMxtB,EAAE2wB,MAAM3wB,IAAI2D,OACrDkyB,KAAK0F,EAAIsV,KAAKltC,SAErB43B,EAAIz/B,QAAQuC,UAAWA,IAIzB,IAAIQ,GAAoB,IAAbR,GAAqB2B,EAAE4yC,MAAQtvC,KAAK0F,IAAI3K,IAAe2B,EAAEiX,GAAG,KACnEg7B,EAAcjyC,EAAG3B,GACjBgzC,EAAcrxC,EAAGu7B,EAErB,OAAI+X,GACKz0C,EAAI8xB,MAAM,GAEZ9xB,GAWT/D,EAAQwmC,cAAgB,SAAUthC,EAAGu7B,EAAK4X,GACxC,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAEjB,KAAMswB,GAAcnzC,EAAEoxB,UAAc+hB,IAAenzC,EAAEy1B,WACnD,MAAO,IAAI8F,GAAI,EAGjB,IAAIl9B,GAAYk9B,EAAIl9B,SACpB,KAAM80C,IAAenzC,EAAEy1B,YAAgB0d,GAAcnzC,EAAEoxB,SAAW,CAChE,GAAIiiB,GAASv4C,EAAQgoB,GAAGzkB,EAAY,GAAGyzB,IAAI,GAAGkgB,KAAK3zC,EAAY,EAI/D,OAHAg1C,GAAOzsC,YAAc20B,EACrB8X,EAAOhhC,EAAIrS,EAAEqS,EAENghC,EAGT9X,EAAIz/B,QAAQuC,UAAWA,EAAY,IAE/B80C,IACFnzC,EAAIu7B,EAAIsV,IAAI/e,IAAI9xB,GAGlB,IAAIozC,GAAOpzC,EAAEqE,KACb,IAAI+uC,EAAK3W,IAAI,MAAQ,CACnB,GAAI59B,GAAM2zC,EAAcxyC,EAIxB,OAFAnB,GAAI+H,YAAc20B,EAClBA,EAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAKzW,EAAIl9B,UAAY,GAElC,GAAI+0C,EAAK1W,IAAI,OAAQ,CAEnB,GAAI2W,GAASv4C,EAAQgoB,GAAGzkB,EAAY,GAAGyzB,IAAI,GACvCjzB,EAAMw0C,EAAO7lB,MAAMglB,EAAcjX,EAAIsV,IAAI/e,IAAIshB,IAKjD,OAJAv0C,GAAIwT,EAAIrS,EAAEqS,EAEVxT,EAAI+H,YAAc20B,EAClBA,EAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAKzW,EAAIl9B,UAAY,GAOlC,MAHA2B,GAAIA,EAAE8xB,IAAI9xB,EAAE2wB,MAAM3wB,GAAG61B,KAAK,GAAGlyB,QAE7B43B,EAAIz/B,QAAQuC,UAAWA,IAChBvD,EAAQ+mC,cAAc7hC,EAAGu7B,IAWlCzgC,EAAQ0nC,QAAU,SAAUl4B,EAAGtK,EAAGu7B,GAChC,GAAIl9B,GAAYk9B,EAAIl9B,SACpB,IAAI2B,EAAEoxB,SAAU,CACd,GAAI9mB,EAAE8mB,SACJ,MAAO,IAAImK,GAAI1Y,EAAAA,EAGjB,IAAIwwB,GAASv4C,EAAQgoB,GAAGzkB,EAAY,GAAGyzB,IAAI,GAAGkgB,KAAK3zC,EAAY,EAI/D,OAHAg1C,GAAOzsC,YAAc20B,EACrB8X,EAAOhhC,EAAI/H,EAAE+H,EAENghC,EAGT9X,EAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIQ,GAAM/D,EAAQwmC,cAAch3B,EAAEwnB,IAAI9xB,GAAIu7B,GAAK,EAC/C,IAAIv7B,EAAEgxB,aAAc,CAClB,GAAIlO,GAAKhoB,EAAQgoB,GAAGzkB,EAAY,EAChCQ,GAAMyL,EAAE0mB,aAAenyB,EAAI2uB,MAAM1K,GAAMjkB,EAAIg3B,KAAK/S,GAKlD,MAFAjkB,GAAI+H,YAAc20B,EAClBA,EAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAK3zC,EAAY,IAoB9BvD,EAAQomC,wBAA0B,SAAUlhC,EAAGu7B,EAAKmX,EAAMS,GACxD,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAEjB,IAAIswB,GAAcnzC,EAAEoxB,SAClB,MAAO,IAAImK,GAAI+C,EAAAA,EAEjB,KAAKoU,EACH,GAAIS,GACF,GAAInzC,EAAEgxB,cAAgBhxB,EAAEu8B,GAAGhB,EAAIsV,KAC7B,KAAM,IAAIlzC,OAAM,4DAEb,IAAIqC,EAAEiX,GAAGskB,EAAIsV,KAClB,KAAM,IAAIlzC,OAAM,kDAIpB,IAAIU,GAAYk9B,EAAIl9B,SACpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIiM,GAAI,GAAIixB,GAAIv7B,EAChBsK,GAAE1D,YAAc20B,EAEZ4X,IACF7oC,EAAIixB,EAAIsV,IAAI/e,IAAIxnB,GAGlB,IAAIipC,GAAgB,EAASjpC,EAAEqmB,MAAMrmB,GAAGurB,KAAK0F,EAAIsV,KAAOvmC,EAAEqmB,MAAMrmB,GAAGkjB,MAAM+N,EAAIsV,KACzEhyC,EAAMyL,EAAEurB,KAAK0d,EAAc5vC,QAAQsuB,IAGvC,OADAsJ,GAAIz/B,QAAQuC,UAAWA,IAChB,GAAIk9B,GAAI18B,EAAIw/B,YAAYhgC,KAejCvD,EAAQ2mC,YAAc,SAAUzhC,EAAGu7B,EAAK4X,GACtC,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAGjB,IAAIuwB,GAAOpzC,EAAEqE,KACb,IAAI+uC,EAAKrlB,GAAGwN,EAAIsV,KACd,MAAO,IAAItV,GAAIv7B,EAAEgxB,eAAgBsN,EAAAA,GAAWA,EAAAA,EAE9C,IAAI8U,EAAK7W,GAAGhB,EAAIsV,MACd,IAAKsC,EACH,KAAM,IAAIx1C,OAAM,yDAEb,IAAIw1C,EACT,KAAM,IAAIx1C,OAAM,0CAGlB,IAAIqC,EAAEoxB,SACJ,MAAO,IAAImK,GAAI,EAGjB,IAAIl9B,GAAYk9B,EAAIl9B,SACpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIiM,GAAI,GAAIixB,GAAIv7B,EAChBsK,GAAE1D,YAAc20B,EAEZ4X,IACF7oC,EAAIixB,EAAIsV,IAAI/e,IAAIxnB,GAElB,IAAIzL,GAAM08B,EAAIsV,IAAIhb,KAAKvrB,GAAGwnB,IAAIyJ,EAAIsV,IAAIrjB,MAAMljB,IAAI2nB,KAAKH,IAAI,EAGzD,OADAyJ,GAAIz/B,QAAQuC,UAAWA,IAChB,GAAIk9B,GAAI18B,EAAIw/B,YAAYhgC,KAiBjCvD,EAAQioC,gBAAkB,SAAU/iC,EAAGu7B,EAAKmX,EAAMS,GAChD,GAAInzC,EAAEoF,UAAYpF,EAAEy1B,WAClB,MAAO,IAAI8F,GAAI1Y,EAAAA,EAEjB,IAAIxkB,GAAYk9B,EAAIl9B,UAGhBiM,EAAI,GAAIixB,GAAIv7B,GAGZwzC,EAAQlpC,EAAE0mB,YACVwiB,KACFlpC,EAAE+H,GAAK/H,EAAE+H,EAIX,IAAIohC,GAAsBp1C,GAAmC,EAAtBiF,KAAK0F,IAAI3K,IAAkB,CAKlE,IAJAk9B,EAAIz/B,QAAQuC,UAAWo1C,IAEvBnpC,EAAIqoC,EAAeroC,EAAGmpC,EAAqBf,GAC3CpoC,EAAE,GAAG1D,YAAc20B,EACfjxB,EAAE,GAOJ,MANAA,GAAIA,EAAE,GACF6oC,GAAc7oC,EAAE8mB,WAClB9mB,EAAI,GAAIixB,GAAI+C,EAAAA,IAGd/C,EAAIz/B,QAAQuC,UAAWA,IAChBiM,CAGT,IAAIzL,EAEJ,IADAyL,EAAIA,EAAE,GACFooC,EAAM,CACR7zC,EAAM4zC,EAAenoC,EAAEwnB,IAAI,MAAO4gB,GAClCnX,EAAIz/B,QAAQuC,UAAWiF,KAAKlG,IAAIq2C,EAAqBp1C,EAAY,KAKjE,KAAK,GAHDq1C,GAAO,GAAInY,GAAI,GACfoY,EAAU,GAAIpY,GAAI,IAClBqY,EAAS,GAAIrY,GAAI,IACZ38B,EAAI,EAAO,EAAJA,IAASA,EAAG,CAC1B,GAAIi1C,GAAOh1C,EAAI8xB,MAAM9xB,GACjBi1C,EAAOD,EAAKljB,MAAM9xB,GAClBk1C,EAAOD,EAAKnjB,MAAMkjB,EACtBh1C,GAAM80C,EAAQhjB,MAAMojB,GAAMvmB,MAClBomB,EAAOjjB,MAAMmjB,IAAOje,KAClB6d,EAAK/iB,MAAM9xB,IAGnB20C,IACF30C,EAAIwT,GAAKxT,EAAIwT,OAEV,CACL,GAAI2hC,GAAYC,CACZ3pC,GAAEjG,MAAM4S,GAAGskB,EAAIsV,MACjBmD,EAAa,GACbC,EAAQ,IAERD,EAAa,IACbC,EAAQ,GAGVp1C,EAAM4zC,EAAenoC,EAAEwnB,IAAIkiB,GAAatB,GACxCnX,EAAIz/B,QAAQuC,UAAWiF,KAAKlG,IAAIq2C,EAAqBp1C,EAAY,IAGjE,KADA,GAAI61C,GAAQ,GAAI3Y,GAAI,GACb0Y,EAAQ,IAAKA,EAAO,CACzB,GAAIJ,GAAOh1C,EAAI8xB,MAAM9xB,GACjBs1C,EAAON,EAAKljB,MAAMkjB,EACtBh1C,GAAMq1C,EAAMvjB,MAAMwjB,EAAK3mB,MAAMqmB,IAAOhe,KAAK0F,EAAIsV,MAWjD,MAPIsC,KACFt0C,EAAOA,EAAIoZ,IAAM5Z,EACb,GAAIk9B,GAAI+C,EAAAA,GACR/C,EAAIsV,IAAI/e,IAAIjzB,IAGlB08B,EAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAK3zC,EAAY,IAe9BvD,EAAQwoC,QAAU,SAAUtjC,EAAGu7B,EAAK4X,GAClC,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAGjB,IAAIxkB,GAAYk9B,EAAIl9B,UAChBykB,EAAKhoB,EAAQgoB,GAAGzkB,EAAY,GAC5Bg1C,EAASvwB,EAAGgP,IAAI,GAAGkgB,KAAK3zC,EAAY,EACxCykB,GAAKA,EAAGkvB,KAAK3zC,EAAY,EAEzB,IAAIiM,GAAIqoC,EAAe3yC,EAAG3B,EAAW,GAAG,EACxC,IAAIiM,EAAEjG,MAAM0pB,GAAGjL,GACb,MAAO,IAAIyY,GAAI+C,EAAAA,EAGjB/C,GAAIz/B,QAAQuC,UAAWA,EAAY,GACnC,IAAImF,GAAM1I,EAAQioC,gBAAgBz4B,EAAGixB,EAAK,GAAG,GACzCh4B,EAAMuuC,EAAStuC,EAEnBA,GAAMA,EAAIwuC,KAAK3zC,GACfkF,EAAMA,EAAIyuC,KAAK3zC,GAGXiM,EAAEyjB,GAAG/tB,GACHsK,EAAEiyB,GAAG8W,KACP9vC,EAAI8O,GAAK9O,EAAI8O,GAENyQ,EAAG0K,MAAMljB,EAAEjG,OAAOk4B,GAAG8W,KAC9B9vC,EAAI8O,GAAK9O,EAAI8O,EAGf,IAAI6V,GAAM,EAAe3kB,EAAIuuB,IAAItuB,GAAOA,EAAIsuB,IAAIvuB,EAGhD,OADAg4B,GAAIz/B,QAAQuC,UAAWA,IAChB,GAAIk9B,GAAIrT,EAAImW,YAAYhgC,KAwBjCvD,EAAQsoC,oBAAsB,SAAUpjC,EAAGu7B,EAAKmX,EAAMS,GACpD,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAEjB,KAAK7iB,EAAEy1B,WACL,MACS,IAAI8F,GADT4X,EACa,EAEF,EAASnzC,EAAIs+B,EAAAA,EAG9B,IAAIjgC,GAAYk9B,EAAIl9B,SACpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIiM,GAAI,GAAIixB,GAAIv7B,EAQhB,OAPAsK,GAAE1D,YAAc20B,EAEhBjxB,EAAIA,EAAEoZ,MACNpZ,EAAI,EAASA,EAAEkjB,MAAM+N,EAAIsV,IAAI/e,IAAIxnB,IAAMA,EAAEurB,KAAK0F,EAAIsV,IAAI/e,IAAIxnB,IAC1DA,EAAI,EAAe,GAAIixB,GAAI,GAAGzJ,IAAIxnB,GAAKA,EAAEwnB,IAAI,GAE7CyJ,EAAIz/B,QAAQuC,UAAWA,IAChB,GAAIk9B,GAAIjxB,EAAE+zB,YAAYhgC,KAmB/BvD,EAAQ2oC,UAAY,SAAUzjC,EAAGu7B,EAAK4X,GACpC,GAAInzC,EAAEoF,QACJ,MAAO,IAAIm2B,GAAI1Y,EAAAA,EAEjB,KAAK7iB,EAAEy1B,WACL,MAAO,IAAI8F,GAAIv7B,EAAEqS,EAGnB,IAAIhU,GAAYk9B,EAAIl9B,SACpBk9B,GAAIz/B,QAAQuC,UAAWA,EAAY,GAEnC,IAAIiM,GAAI,GAAIixB,GAAIv7B,EAChBsK,GAAE1D,YAAc20B,CAEhB,IAAI6Y,GAAS9pC,EAAEoZ,MACX2wB,EAAS9Y,EAAIsV,IAAI/e,IAAIsiB,GACrBv1C,EAAMu1C,EAAO5mB,MAAM6mB,EAIvB,OAHAx1C,GAAM,EAAeu1C,EAAOve,KAAKwe,GAAQviB,IAAIjzB,GAAOA,EAAIizB,IAAIsiB,EAAOve,KAAKwe,IAExE9Y,EAAIz/B,QAAQuC,UAAWA,IAChBQ,EAAImzC,KAAK3zC,EAAY,IA0R9BvD,EAAQkJ,OAAS,SAASjD,EAAOkD,GAC/B,GAAuB,kBAAZA,GAET,MAAOA,GAAQlD,EAIjB,KAAKA,EAAM00B,WACT,MAAO10B,GAAMqE,QAAU,MAASrE,EAAMw7B,GAAG,GAAK,WAAa,WAI7D,IAAIgO,GAAW,OACXlsC,EAAYqH,MAkBhB,QAhBgBA,SAAZzB,IAEEA,EAAQsmC,WACVA,EAAWtmC,EAAQsmC,UAIjB7oC,EAASuC,GACX5F,EAAY4F,EAELA,EAAQ5F,YACfA,EAAY4F,EAAQ5F,YAKhBksC,GACN,IAAK,QACH,MAAOzvC,GAAQk8B,QAAQj2B,EAAO1C,EAEhC,KAAK,cACH,MAAOvD,GAAQ0vC,cAAczpC,EAAO1C,EAEtC,KAAK,OAGH,GAAIi2C,GAAQ,KACRC,EAAQ,GACRtwC,IAAWA,EAAQwmC,cACa/kC,SAA9BzB,EAAQwmC,YAAY6J,QACtBA,EAAQrwC,EAAQwmC,YAAY6J,OAEI5uC,SAA9BzB,EAAQwmC,YAAY8J,QACtBA,EAAQtwC,EAAQwmC,YAAY8J,OAKhC,IACEC,SAAUzzC,EAAM6F,YAAY4tC,SAC5BC,SAAU1zC,EAAM6F,YAAY6tC,WAS9B,GANA1zC,EAAM6F,YAAY9K,QAChB04C,SAAUlxC,KAAK4gB,MAAM5gB,KAAK0F,IAAIsrC,GAAShxC,KAAK2F,MAC5CwrC,SAAUnxC,KAAK4gB,MAAM5gB,KAAK0F,IAAIurC,GAASjxC,KAAK2F,QAI1ClI,EAAMqwB,SAAU,MAAO,GAG3B,IAAIxuB,GACAyB,EAAMtD,EAAMsD,KAWhB,OAREzB,GAFEyB,EAAIq4B,IAAI4X,IAAUjwC,EAAI4S,GAAGs9B,GAErBxzC,EAAM2zC,oBAAoBr2C,GAAW24B,UAIrCl8B,EAAQ0vC,cAAczpC,EAAO1C,GAI9BuE,EAAIyiC,QAAQ,sBAAuB,WACxC,GAAI7sB,GAASpX,UAAU,GACnB6W,EAAI7W,UAAU,EAClB,OAAmB,MAAXoX,EAAkBA,EAASP,EAAIA,GAG3C,SACE,KAAM,IAAIta,OAAM,qBAAuB4sC,EAAW,kDAaxDzvC,EAAQ0vC,cAAgB,SAASzpC,EAAO1C,GACtC,MAAkBqH,UAAdrH,EACK0C,EAAMypC,cAAcnsC,EAAY,GAGhC0C,EAAMypC,iBAUjB1vC,EAAQk8B,QAAU,SAASj2B,EAAO1C,GAChC,MAAO0C,GAAMi2B,QAAQ34B,GAAa,KAQ/B,SAAStD,EAAQD,EAASM,GAE/B,YAMA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GA8BpC,QAAS+gC,GAAa99B,GACpB,IAAK2zC,EAAc7sC,eAAe9G,GAChC,KAAM,IAAIrD,OAAM,wBAA0BqD,EAE5C,IAAItB,GAAOV,MAAMyE,UAAU6W,MAAM7e,KAAK2F,UAAW,GAC7C09B,EAAe6V,EAAc3zC,GAAMoF,MAAMlL,KAAMwE,EAEnD,OAAO,UAAUo/B,GAGf,GAAI8V,IAEFxuB,OAAQ,SAAS3L,EAAMo6B,EAAMC,GAC3B,GAAIp0C,GAAMtD,EAAKF,CACf,IAAIkE,UAAUjC,OAAS,EACrB,KAAM,IAAIub,GAAe,SAAUtZ,UAAUjC,OAAQ,EAAG,EA+B1D,IA5BgC,IAArBiC,UAAUjC,OACfY,EAAa0a,GACf/Z,EAAO+Z,EAGPvd,EAAMud,EAGsB,IAArBrZ,UAAUjC,OACfY,EAAa0a,IACf/Z,EAAO+Z,EACPvd,EAAM23C,IAGNz3C,EAAMqd,EACNvd,EAAM23C,IAIRn0C,EAAO+Z,EACPrd,EAAMy3C,EACN33C,EAAM43C,GAKIpvC,SAARxI,IAAmBA,EAAM,GACjBwI,SAARtI,IAAmBA,EAAM,GAChBsI,SAAThF,EAAoB,CACtB,GAAIJ,GAAMy0C,EAAqBr0C,EAAKb,UAAWzC,EAAKF,EAAK83C,EACzD,OAAQt0C,aAAgBrE,GAAKuD,OAAUzB,EAAOmC,GAAOA,EAElD,MAAO00C,GAAQ53C,EAAKF,IAG3BmpB,UAAW,SAAS5L,EAAMo6B,EAAMC,GAC9B,GAAIp0C,GAAMtD,EAAKF,CACf,IAAIkE,UAAUjC,OAAS,GAAKiC,UAAUjC,OAAS,EAC7C,KAAM,IAAIub,GAAe,YAAatZ,UAAUjC,OAAQ,EAAG,EA8B7D,IA3B8B,IAArBiC,UAAUjC,OACbY,EAAa0a,GACf/Z,EAAO+Z,EAGPvd,EAAMud,EAGoB,IAArBrZ,UAAUjC,OACbY,EAAa0a,IACf/Z,EAAO+Z,EACPvd,EAAM23C,IAGNz3C,EAAMqd,EACNvd,EAAM23C,IAIRn0C,EAAO+Z,EACPrd,EAAMy3C,EACN33C,EAAM43C,GAKIpvC,SAARtI,IAAmBA,EAAM,GAChBsI,SAAThF,EAAoB,CACtB,GAAIJ,GAAMy0C,EAAqBr0C,EAAKb,UAAWzC,EAAKF,EAAK+3C,EACzD,OAAQv0C,aAAgBrE,GAAKuD,OAAUzB,EAAOmC,GAAOA,EAElD,MAAO20C,GAAW73C,EAAKF,IAG9BipB,WAAY,SAAS+uB,GACnB,GAAyB,IAArB9zC,UAAUjC,OACZ,KAAM,IAAIub,GAAe,aAActZ,UAAUjC,OAAQ,EAE3D,IAAI+1C,YAAqB74C,GAAKuD,OAC5Bs1C,EAAYA,EAAUr1C,cAEnB,KAAKb,MAAMC,QAAQi2C,GACtB,KAAM,IAAIvzC,WAAU,mDAGtB,IAAIhC,EAAMe,KAAKw0C,GAAW/1C,OAAS,EACjC,KAAM,IAAIxB,OAAM,yCAIlB,OAAOu3C,GAAU5xC,KAAK6W,MAAM7W,KAAK8iB,SAAW8uB,EAAU/1C,WAKtD61C,EAAU,SAAS53C,EAAKF,GAC1B,MAAOE,GAAM0hC,KAAkB5hC,EAAME,IAGnC63C,EAAa,SAAS73C,EAAKF,GAC7B,MAAOoG,MAAK6W,MAAM/c,EAAM0hC,KAAkB5hC,EAAME,KAI9C23C,EAAuB,SAASr0C,EAAMtD,EAAKF,EAAKi4C,GAClD,GAAeh2C,GAAQP,EAAnB0pB,IAGJ,IAFA5nB,EAAOA,EAAK4Z,MAAM,GAEd5Z,EAAKvB,OAAS,EAChB,IAAKP,EAAI,EAAGO,EAASuB,EAAKo5B,QAAa36B,EAAJP,EAAYA,IAC7C0pB,EAAKtqB,KAAK+2C,EAAqBr0C,EAAMtD,EAAKF,EAAKi4C,QAEjD,KAAKv2C,EAAI,EAAGO,EAASuB,EAAKo5B,QAAa36B,EAAJP,EAAYA,IAC7C0pB,EAAKtqB,KAAKm3C,EAAS/3C,EAAKF,GAG5B,OAAOorB,GAGT,OAAOssB,IAEN9V,GAzKL,GAAIt/B,GAAa9B,EAAKtC,EAAoB,IACtC+C,EAAST,EAAKtC,EAAoB,KAClCuE,EAAQvE,EAAoB,KAE5B2E,EAAeP,EAAWO,aA0K1B40C,GAEFS,QAAS,WACP,MAAO9xC,MAAK8iB,QAOdivB,OAAQ,WACN,MAAO,YAKL,IAJA,GAAIC,GAAIC,EACJC,EAAS,GAGG,EAATA,GAAcA,EAAS,GAC5BF,EAAKhyC,KAAK8iB,SACVmvB,EAAKjyC,KAAK8iB,SACVovB,EAAS,EAAE,EAAIlyC,KAAKc,IAAI,GAAKd,KAAK0F,IAAIssC,GAAK,IAAOhyC,KAAKC,IAAI,EAAID,KAAKyf,GAAKwyB,GAAM,EAEjF,OAAOC,KAKb,OAAO1W,GA7MT,GAAIpkB,GAAiBtf,EAAoB,IAgNzCN,GAAQkG,KAAO,eACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAWAN,GAAQuB,KAAO,SAAS2D,GACtB,GAAI3D,SAAc2D,EAElB,IAAa,WAAT3D,EAAmB,CACrB,GAAU,OAAN2D,EAAsB,MAAO,MACjC,IAAIA,YAAaioC,SAAS,MAAO,SACjC,IAAIjoC,YAAa8C,QAAS,MAAO,QACjC,IAAI9C,YAAai5B,QAAS,MAAO,QACjC,IAAIj6B,MAAMC,QAAQe,GAAQ,MAAO,OACjC,IAAIA,YAAakoC,MAAS,MAAO,MACjC,IAAIloC,YAAauvC,UAAS,MAAO,UACjC,IAAIvvC,YAAamoC,QAAS,MAAO,SAGnC,MAAO9rC,KAMJ,SAAStB,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClCw1B,EAAelzB,EAAKtC,EAAoB,MACxC2oB,EAAWrmB,EAAKtC,EAAoB,KACpCgpB,EAAW1mB,EAAKtC,EAAoB,KACpC0tB,EAAQprB,EAAKtC,EAAoB,MAEjCq6C,EAAyB/3C,EAAKtC,EAAoB,MAElDitB,EAAehsB,EAAKgsB,aACpBuD,EAAcvvB,EAAKuvB,YAYnB6b,EAAuB1pC,EAAM,wBAC/B+pC,yBAA0B,SAAUpsC,EAAGsY,GAErC,OAAQtY,EAAEiL,WACR,IAAK,QACH,MAAO+uC,GAA2Bh6C,EAAGsY,EACvC,KAAK,SACH,MAAO2hC,GAA4Bj6C,EAAGsY,KAG5C4zB,wBAAyB,SAAUx9B,EAAG4J,GAEpC,GAAItY,GAAIyC,EAAOiM,GAEX5I,EAAIimC,EAAqB/rC,EAAGsY,EAEhC,OAAOxS,GAAE3B,aAIT61C,EAA6B,SAAUh6C,EAAGsY,GAE5CA,EAAIyhC,EAAuB/5C,EAAGsY,EAS9B,KAAK,GAPD2M,GAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElB3Y,EAAI,GAAIhB,OAAM2hB,GAEd2H,EAAO5sB,EAAEmwB,MAEJzsB,EAAI4pB,EAAU,EAAG5pB,GAAK,EAAIA,IAAK,CAEtC,GAEIw2C,GAFAC,EAAK7hC,EAAE5U,IAAM,CAIjB,IAAK0pB,EAAM+sB,EAAI,GAkBbD,EAAK,MAlBY,CAEjB,GAAIrP,GAAMje,EAAKlpB,GAAGA,EAElB,IAAI0pB,EAAMyd,EAAK,GAEb,KAAM,IAAI5oC,OAAM,0DAGlBi4C,GAAKhlB,EAAailB,EAAItP,EAEtB,KAAK,GAAI3nC,GAAIQ,EAAI,EAAGR,GAAK,EAAGA,IAE1BoV,EAAEpV,GAAKwlB,EAASpQ,EAAEpV,IAAM,EAAGmlB,EAAS6xB,EAAIttB,EAAK1pB,GAAGQ,KAQpDY,EAAEZ,IAAMw2C,GAGV,MAAO,IAAIhqB,IACTtD,KAAMtoB,EACNU,MAAOigB,EAAM,MAIbg1B,EAA8B,SAAUj6C,EAAGsY,GAE7CA,EAAIyhC,EAAuB/5C,EAAGsY,EAE9B,IAWIpV,GAAG4K,EAXHmX,EAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElBtS,EAAS3K,EAAE+sB,QACXzrB,EAAQtB,EAAEgtB,OACVF,EAAM9sB,EAAEitB,KAERmtB,KACAC,KACAC,IAIJA,GAAKh4C,KAAK,EAEV,KAAK,GAAIoB,GAAI4pB,EAAU,EAAG5pB,GAAK,EAAIA,IAAK,CAEtC,GAAIy2C,GAAK7hC,EAAE5U,IAAM,CAEjB,KAAK0pB,EAAM+sB,EAAI,GAAI,CAEjB,GAAItP,GAAM,EAENp8B,EAAIqe,EAAIppB,GACRmQ,EAAIiZ,EAAIppB,EAAI,EAEhB,KAAKoK,EAAI+F,EAAI,EAAG/F,GAAKW,EAAGX,IAItB,GAFA5K,EAAI5B,EAAMwM,GAEN5K,IAAMQ,EAERmnC,EAAMlgC,EAAOmD,OAEV,IAAQpK,EAAJR,EAEP,KAIJ,IAAIkqB,EAAMyd,EAAK,GAEb,KAAM,IAAI5oC,OAAM,0DAKlB,KAFA,GAAIi4C,GAAKhlB,EAAailB,EAAItP,GAEnB/8B,GAAKW,EAAGX,IAEb5K,EAAI5B,EAAMwM,GAEVwK,EAAEpV,GAAKwlB,EAASpQ,EAAEpV,IAAM,EAAGmlB,EAAS6xB,EAAIvvC,EAAOmD,IAG5Csf,GAAM8sB,EAAI,KAEbE,EAAQ7L,QAAQ2L,GAEhBG,EAAO9L,QAAQ7qC,KAOrB,MAFA42C,GAAKh4C,KAAK83C,EAAQ32C,QAEX,GAAIkpB,IACThiB,OAAQyvC,EACR94C,MAAO+4C,EACPvtB,IAAKwtB,EACLt1C,MAAOigB,EAAM,KAIjB,OAAO8mB,GAGT3sC,EAAQkG,KAAO,uBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/B,YAEA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAII,GAAST,EAAKtC,EAAoB,KAClCw1B,EAAelzB,EAAKtC,EAAoB,MACxC2oB,EAAWrmB,EAAKtC,EAAoB,KACpCgpB,EAAW1mB,EAAKtC,EAAoB,KACpC0tB,EAAQprB,EAAKtC,EAAoB,MAEjCq6C,EAAyB/3C,EAAKtC,EAAoB,MAElDitB,EAAehsB,EAAKgsB,aACpBuD,EAAcvvB,EAAKuvB,YAYnB8b,EAAsB3pC,EAAM,uBAC9B+pC,yBAA0B,SAAUpsC,EAAGsY,GAErC,OAAQtY,EAAEiL,WACR,IAAK,QACH,MAAOsvC,GAA0Bv6C,EAAGsY,EACtC,KAAK,SACH,MAAOkiC,GAA2Bx6C,EAAGsY,KAG3C4zB,wBAAyB,SAAUx9B,EAAG4J,GAEpC,GAAItY,GAAIyC,EAAOiM,GAEX5I,EAAIkmC,EAAoBhsC,EAAGsY,EAE/B,OAAOxS,GAAE3B,aAITo2C,EAA4B,SAAUv6C,EAAGsY,GAE3CA,EAAIyhC,EAAuB/5C,EAAGsY,EAS9B,KAAK,GAPD2M,GAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElB3Y,EAAI,GAAIhB,OAAM2hB,GAEd2H,EAAO5sB,EAAEmwB,MAEJzsB,EAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAEhC,GAEIw2C,GAFAC,EAAK7hC,EAAE5U,IAAM,CAIjB,IAAK0pB,EAAM+sB,EAAI,GAkBbD,EAAK,MAlBY,CAEjB,GAAIrP,GAAMje,EAAKlpB,GAAGA,EAElB,IAAI0pB,EAAMyd,EAAK,GAEb,KAAM,IAAI5oC,OAAM,0DAGlBi4C,GAAKhlB,EAAailB,EAAItP,EAEtB,KAAK,GAAI3nC,GAAIQ,EAAI,EAAOuhB,EAAJ/hB,EAAUA,IAE5BoV,EAAEpV,GAAKwlB,EAASpQ,EAAEpV,IAAM,EAAGmlB,EAAS6xB,EAAIttB,EAAK1pB,GAAGQ,KAQpDY,EAAEZ,IAAMw2C,GAGV,MAAO,IAAIhqB,IACTtD,KAAMtoB,EACNU,MAAOigB,EAAM,MAIbu1B,EAA6B,SAAUx6C,EAAGsY,GAE5CA,EAAIyhC,EAAuB/5C,EAAGsY,EAE9B,IAWIpV,GAAG4K,EAXHmX,EAAOjlB,EAAEid,MAAM,GACfqQ,EAAUttB,EAAEid,MAAM,GAElBtS,EAAS3K,EAAE+sB,QACXzrB,EAAQtB,EAAEgtB,OACVF,EAAM9sB,EAAEitB,KAERmtB,KACAC,KACAC,IAIJA,GAAKh4C,KAAK,EAEV,KAAK,GAAIoB,GAAI,EAAO4pB,EAAJ5pB,EAAaA,IAAK,CAEhC,GAAIy2C,GAAK7hC,EAAE5U,IAAM,CAEjB,KAAK0pB,EAAM+sB,EAAI,GAAI,CAEjB,GAAItP,GAAM,EAENh3B,EAAIiZ,EAAIppB,EAAI,EAEhB,KAAKoK,EAAIgf,EAAIppB,GAAQmQ,EAAJ/F,EAAOA,IAItB,GAFA5K,EAAI5B,EAAMwM,GAEN5K,IAAMQ,EAERmnC,EAAMlgC,EAAOmD,OAEV,IAAI5K,EAAIQ,EAEX,KAIJ,IAAI0pB,EAAMyd,EAAK,GAEb,KAAM,IAAI5oC,OAAM,0DAKlB,KAFA,GAAIi4C,GAAKhlB,EAAailB,EAAItP,GAEfh3B,EAAJ/F,EAAOA,IAEZ5K,EAAI5B,EAAMwM,GAEVwK,EAAEpV,GAAKwlB,EAASpQ,EAAEpV,IAAM,EAAGmlB,EAAS6xB,EAAIvvC,EAAOmD,IAG5Csf,GAAM8sB,EAAI,KAEbE,EAAQ93C,KAAK43C,GAEbG,EAAO/3C,KAAKoB,KAOlB,MAFA42C,GAAKh4C,KAAK83C,EAAQ32C,QAEX,GAAIkpB,IACThiB,OAAQyvC,EACR94C,MAAO+4C,EACPvtB,IAAKwtB,EACLt1C,MAAOigB,EAAM,KAIjB,OAAO+mB,GAGT5sC,EAAQkG,KAAO,sBACflG,EAAQD,QAAUA,GAKb,SAASE,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,UAEFD,YAAe,8BACfE,UACE,WACA,aAEFK,SAAY,UAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,QACA,aAEFD,YAAe,kBACfE,UACE,gBACA,UACA,SACA,qBACA,iBAEFK,SACE,cAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,WAEFD,YACI,wHACJE,UACE,YACA,YACA,cAEFK,SAAY,QAAS,MAAO,WAMzB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,WAEFD,YAAe,2DACfE,UACE,UACA,MACA,aAEFK,SACE,WACA,SACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,YACZE,QACE,QACA,gBAEFD,YAAe,qBACfE,UACE,YACA,QACA,UACA,YACA,cACA,eAEFK,SACE,cAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,YACZE,QACE,SACA,mBAEFD,YAAe,kCACfE,UACE,yBACA,yBACA,UAEFK,SACE,WACA,cACA,YAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,cACR0W,SAAY,YACZE,QACE,SACA,qBAEFD,YAAe,oCACfE,UACE,yBACA,yBACA,UAEFK,SACE,WACA,SACA,eAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,YACZE,QACE,SACA,gBAEFD,YACI,+CACJE,UACE,yBACA,UAEFK,SACE,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,UAEFD,YAAe,qCACfE,UACE,WACA,UACA,gBACA,UACA,uDAEFK,SACE,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,UAEFD,YACI,sGACJE,UACE,WACA,WACA,YACA,aAEFK,SAAY,OAAQ,QAAS,WAM1B,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,aACZE,QACE,YAEFD,YACI,yHACJE,UACE,aACA,aACA,eAEFK,SAAY,OAAQ,MAAO,WAMxB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,YACA,qBAEFD,YAAe,uCACfE,UACE,aACA,aACA,oBAEFK,SAAa,MAAO,UAMjB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,aAEFD,YAAe,qCACfE,UACE,YACA,aACA,iBAEFK,SAAa,SAMV,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,SACA,gBAEFD,YAAe,8NACfE,UACE,WACA,eACA,SACA,SACA,iBACA,uBACA,mBACA,SAEFK,SACE,MACA,WAMC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,aACZE,QACE,YAEFD,YAAe,4CACfE,UACE,iBACA,eACA,SACA,uBACA,kBAEFK,SACE,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,QACA,UACA,aAEFD,YACI,gEACJE,UACE,QACA,SACA,WACA,4BACA,WACA,YAEFK,SAAY,YAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,WACR0W,SAAY,YACZE,QACE,QACA,kBAEFD,YAAe,uBACfE,UACE,gBACA,UACA,YACA,cACA,cAEFK,SACE,YAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,UACA,cAEFD,YAAe,oDACfE,UACE,YACA,aACA,gBACA,6BACA,8BACA,kBACA,4BACA,gCACA,mCAOC,SAAS9c,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,aACZE,QACE,aACA,oBAEFD,YAAe,qJAGfE,UACE,QACA,iBACA,gBACA,WAEFK,SACE,OACA,SAMC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,YACZE,QACE,QACA,aAEFD,YACI,uCACJE,UACE,UACA,QACA,oBAEFK,SAAa,cAMV,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,aACZE,QACE,WACA,eAEFD,YACI,4LACJE,UACE,aACA,aACA,cACA,cACA,eACA,uBAEFK,SAAY,OAAQ,QAAS,SAM1B,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,WAEFD,YACI,iGACJE,UACE,YACA,aACA,WAEFK,SACE,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,WAEFD,YACI,+EACJE,UACE,WACA,QACA,YAEFK,SACE,SACA,cAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,aACZE,QACE,aAEFD,YACI,2DACJE,UACE,YACA,UACA,MACA,SAEFK,SACE,WACA,MACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,WACR0W,SAAY,YACZE,QACE,QACA,kBAEFD,YAAe,uBACfE,UACE,cACA,QACA,YACA,YACA,iBAEFK,SACE,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,aACR0W,SAAY,YACZE,QACE,KACA,iBAEFD,YACI,yEACJE,UACE,OACA,UACA,SAEFK,SACE,MAAO,WAAY,eAOlB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,YACZE,QACE,KACA;AAEFD,YACI,4CACJE,UACE,QACA,QAEFK,SACE,MAAO,WAAY,gBAOlB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,cAEFD,YAAe,gEACfE,UACE,cACA,aACA,sBAEFK,SAAa,MAAO,SAMjB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,UACZE,QACE,QACA,gBAEFD,YAAe,6QACfE,UACE,QACA,kBACA,oBAEFK,SACE,SAAU,QAAS,SAAU,YAAa,kBAAmB,mBAO5D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,UACZE,QACE,KACA,aAEFD,YAAe,8IACfE,UACE,KACA,KACA,sBAEFK,SACE,SAAU,QAAS,SAAU,YAAa,kBAAmB,mBAO5D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,UACZE,QACE,QACA,eAEFD,YAAe,8PACfE,UACE,QACA,uBAEFK,SACE,SAAU,SAAU,SAAU,YAAa,kBAAmB,mBAO7D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,UACZE,QACE,gBAEFD,YAAe,mRACfE,UACE,cACA,wBAEFK,SACE,SAAU,SAAU,QAAS,YAAa,kBAAmB,mBAO5D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,+DACfE,UACE,SACA,UAEFK,SACE,SAAU,SAAU,QAAS,SAAU,kBAAmB,mBAOzD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,kBACR0W,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,mEACfE,UACE,SACA,SACA,YAEFK,SACE,SAAU,SAAU,QAAS,SAAU,YAAa,mBAOnD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,gBACR0W,SAAY,UACZE,QACE,SACA,mBAEFD,YAAe,gEACfE,UACE,UACA,SACA,aAEFK,SACE,SAAU,SAAU,QAAS,SAAU,YAAa,qBAOnD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,UACZE,QACE,UAEFD,YACI,iGACJE,UACE,cACA,cACA,eAEFK,SACE,KACA,KACA,OACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,UACZE,QACE,WAEFD,YACI,gGACJE,UACE,eACA,eACA,eAEFK,SACE,KACA,KACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,KACR0W,SAAY,UACZE,QACE,SAEFD,YAAe,yCACfE,UACE,aACA,aACA,YACA,WAEFK,SACE,KACA,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,KACR0W,SAAY,UACZE,QACE,SAEFD,YAAe,8CACfE,UACE,aACA,aACA,YACA,WAEFK,SACE,KACA,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,OACZE,QACE,gBAEFD,YACI,+CACJE,UACE,YACA,kCACA,mBACA,uBACA,8BAEFK,SACE,UAAW,UAAW,QAAS,SAAU,SAAU,UAOlD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,OACZE,QACE,IACA,cAEFD,YACI,6CACJE,UACE,aACA,aACA,aACA,kBACA,mBACA,yBAEFK,SACE,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,UAO9D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,OACZE,QACE,YACA,kBACA,mBAEFD,YACI,2BACJE,UACE,YACA,gBACA,qBAEFK,SACE,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,UAO9D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,OACZE,QACE,UACA,cACA,mBACA,yBACA,kCACA,+CAEFD,YACI,yDACJE,UACE,KACA,YACA,yBACA,UACA,eACA,4BAEFK,SACE,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,UAO1E,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,OACZE,QACE,KACA,6BACA,WACA,iBAEFD,YACI,mBACJE,UACE,KACA,YACA,qBACA,WACA,kBAEFK,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,OACZE,QACE,IACA,aAEFD,YACI,gEACJE,UACE,IACA,MACA,OACA,YACA,gBACA,eACA,oCACA,uBAEFK,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,OACZE,QACE,SACA,aAEFD,YACI,iDACJE,UACE,iBACA,cACA,kBAEFK,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,UAO/D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,OACZE,QACE,aACA,oBACA,gBAEFD,YACI,iBACJE,UACE,SACA,SACA,wBACA,kBAEFK,SACE,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,YAO/D,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,mBACA,oCAEFD,YAAe,uDACfE,UACE,gBACA,2BAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,eACA,gBAEFD,YAAe,oDACfE,UACE,aACA,mBAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,UACZE,QACE,UACA,aAEFD,YAAe,uFACfE,UACE,iBACA,gBACA,WAEFK,SACE,MAAO,KAAM,SAOZ,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,UACZE,QACE,KACA,QACA,UAEFD,YAAe,0DACfE,UACE,QACA,YACA,KACA,MAEFK,SACE,MAAO,KAAM,SAOZ,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,KACR0W,SAAY,UACZE,QACE,SACA,YAEFD,YAAe,mFACfE,UACE,gBACA,iBACA,UAEFK,SACE,MAAO,MAAO,SAOb,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,UACZE,QACE,SACA,YAEFD,YAAe,2GACfE,UACE,iBACA,kBACA,gBACA,UAEFK,SACE,MAAO,MAAO,QAOb,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,SACZE,QACE,uBACA,6BAEFD,YAAe,iKACfE,UACE,mBACA,mBACA,eACA,kBACA,mBAEFK,SACE,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOhG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,SACZE,QACE,eAEFD,YAAe,0EACfE,UACE,+BACA,+BACA,gCAEFK,SACE,WACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,SACZE,QACE,UAEFD,YAAe,wCACfE,UACE,oBACA,uCAEFK,SACE,SAAU,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,SACZE,QACE,UACA,cAEFD,YAAe,4aACfE,UACE,YACA,eACA,kCACA,WAEFK,SACE,SAAU,MAAO,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOlG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,SACZE,QACE,aAEFD,YAAe,6LAGfE,UACE,4BACA,yBAEFK,SACE,WACA,WAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,SACZE,QACE,SACA,YACA,cACA,OAEFD,YAAe,yGACfE,UACE,SACA,YACA,yBACA,gBAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,SACZE,QACE,cAEFD,YAAe,uEACfE,UACE,yBACA,UACA,iBACA,WAEFK,SACE,SAAU,SAAU,OAAQ,aAO3B,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,SACZE,QACE,UAEFD,YAAe,oCACfE,UACE,oBACA,SACA,SAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOnG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,SACZE,QACE,UACA,aACA,qBACA,YACA,eACA,uBACA,QAEFD,YAAe,mCACfE,UACE,UACA,aACA,oBACA,yBACA,iBAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOlG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,OACZE,QACE,YACA,iBACA,oBACA,0BACA,iBAEFD,YACI,iFACJE,UACE,MACA,UACA,cACA,kBACA,gBACA,+BACA,eAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,WAOjG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,SACZE,QACE,kBACA,iCAEFD,YAAe,mBACfE,UACE,2BACA,uBACA,2BACA,oBACA,6BAEFK,SACE,OAAQ,SAAU,aAOjB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,SACZE,QACE,WAEFD,YAAe,kCACfE,UACE,YACA,sBACA,yBACA,UACA,aAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,WAOlG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,SACZE,QACE,cAEFD,YAAe,6DACfE,UACE,mBACA,mBACA,mBACA,oBAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,WAO/F,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,SACZE,QACE,eACA,6BACA,yBACA,uCAEFD,YAAe,8HAGfE,UACE,mBACA,SACA,qBACA,mBACA,YACA,UACA,WAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,WAOhG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,SACZE,QACE,YAEFD,YAAe,oGACfE,UACE,mCACA,YAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,WAOjG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,SACZE,QACE,KACA,gBAEFD,YAAe,qBACfE,UACE,yBACA,KACA,gBAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,WAO7F,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,SACZE,QACE,WACA,cACA,sBACA,aACA,gBACA,wBACA,SAEFD,YAAe,oCACfE,UACE,WACA,cACA,yBACA,kBAEFK,SACE,SAAU,MAAO,OAAQ,MAAO,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,eAO7F,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,eACR0W,SAAY,cACZE,QACE,sBAEFD,YAAe,kEACfE,UACE,sBAEFK,SAAY,eAAgB,eAMzB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,cACZE,QACE,KACA,gBAEFD,YAAe,mCACfE,UACE,KACA,oBACA,MAEFK,SAAY,eAAgB,eAAgB,WAMzC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,cACZE,QACE,YAEFD,YAAe,6IACfE,UACE,WACA,KACA,aACA,YAEFK,SAAY,eAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,eACR0W,SAAY,cACZE,QACE,kBACA,sBAEFD,YAAe,kEACfE,UACE,kBACA,sBAEFK,SAAY,eAAgB,eAMzB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,aACR0W,SAAY,cACZE,QACE,qBAEFD,YACI,0CACJE,UACE,mBACA,4BAEFK,SAAY,SAAU,eAMnB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,cACZE,QACE,WACA,cACA,mBACA,eACA,oBACA,0BAEFD,YACI,0BACJE,UACE,WACA,iBACA,kBAEFK,SAAY,aAAc,eAMvB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,cACZE,QACE,YACA,eACA,oBACA,gBACA,qBACA,2BAEFD,YACI,iCACJE,UACE,YACA,kBACA,uBAEFK,SAAY,aAAc,YAKvB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,aACZE,QACE,iBAEFD,YACI,8GACJE,UACE,gBACA,gBACA,gBACA,qBACA,yBAEFK,SACE,QAAS,UAAW,UAAW,YAAa,cAO3C,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,aACZE,QACE,mBAEFD,YACI,+IACJE,UACE,qBACA,oBAEFK,SACE,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,aAOjE,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,aACZE,QACE,SACA,eAEFD,YACI,wFACJE,UACE,WACA,WACA,UACA,YACA,SACA,gBAEFK,SACE,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,eAOnE,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,aACZE,QACE,QACA,gBAEFD,YACI,2FACJE,UACE,QACA,UACA,UACA,YACA,UACA,UACA,iBAEFK,SACE,QAAS,UAAW,UAAW,YAAa,WAAY,aAOvD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,WACR0W,SAAY,aACZE,QACE,SACA,kBAEFD,YACI,yGACJE,UACE,UACA,WACA,UACA,YACA,WAEFK,SACE,QAAS,UAAW,YAAa,UAAW,WAAY,aAOvD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,aACZE,QACE,QACA,iBAEFD,YACI,mGACJE,UACE,QACA,UACA,UACA,YACA,UACA,iBAEFK,SACE,QAAS,UAAW,SAAU,YAAa,WAAY,aAOtD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,YACR0W,SAAY,aACZE,QACE,SACA,mBAEFD,YACI,0GACJE,UACE,UACA,WACA,UACA,YACA,WAEFK,SACE,QAAS,UAAW,SAAU,UAAW,WAAY,aAOpD,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,aACZE,QACE,SACA,iBAEFD,YACI,uGACJE,UACE,WACA,WACA,UACA,YACA,SACA,eACA,kBAEFK,SACE,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,eAOjE,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,oBACA,SACA,eAEFD,YAAe,iDACfE,UACE,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFK,SACE,OACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,qBACA,UACA,gBAEFD,YAAe,mDACfE,UACE,mBACA,qBACA,qBACA,wBACA,wBACA,8BAEFK,SACE,MACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,aACZE,QACE,uBACA,aAEFD,YAAe,mLACfE,UACE,kBACA,yBAEFK,SACE,MACA,OACA,MACA,OACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,oBACA,SACA,eAEFD,YAAe,iDACfE,UACE,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFK,SACE,MACA,OACA,SACA,OACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,aACZE,QACE,qBACA,WAEFD,YAAe,qCACfE,UACE,gBACA,kBACA,sBAEFK,SACE,MACA,OACA,MACA,SACA,MACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,oBACA,SACA,yBAEFD,YAAe,4KACfE,UACE,eACA,oBACA,mCACA,8BACA,2BAEFK,SACE,MACA,OACA,MACA,SACA,MACA,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,oBACA,UAEFD,YAAe,iCACfE,UACE,kBACA,oBACA,qBAEFK,SACE,MACA,OACA,SACA,MACA,OACA,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,aACZE,QACE,oBACA,SACA,yBAEFD,YAAe,gIACfE,UACE,eACA,oBACA,mCACA,8BACA,2BAEFK,SACE,MACA,OACA,MACA,SACA,MACA,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,oDACfE,UACE,YACA,kBAEFK,SACE,MACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,6FACfE,UACE,cAEFK,SACE,OACA,QACA,WAMC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,8CACfE,UACE,YACA,iBACA,WAEFK,SACE,MACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,6GACfE,UACE,cAEFK,SACE,QACA,WAMC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,8CACfE,UACE,YACA,iBACA,WAEFK,SACE,MACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,sGACfE,UACE,cAEFK,SACE,QACA,WAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,2CACfE,UACE,YACA,iBACA,WAEFK,SACE,OACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,2CACfE,UACE,cAEFK,SACE,QACA,WAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,kDACfE,UACE,YACA,kBAEFK,SACE,MACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,8FACfE,UACE,cAEFK,SACE,QACA,WAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,qDACfE,UACE,YACA,kBAEFK,SACE,MACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,YAEFD,YAAe,mGACfE,UACE,cAEFK,SACE,QACA,WAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,eACZE,QACE,eAEFD,YACI,qEACJE,UACE,mBACA,wBACA,iBACA,iBACA,eAEFK,SACE,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,sCACfE,UACE,SACA,kBACA,eACA,cACA,2BAEFK,SACE,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,iDACfE,UACE,aAEFK,SACE,OACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,6DACfE,UACE,SACA,cAEFK,SACE,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,oDACfE,UACE,UACA,eAEFK,SACE,OACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,4DACfE,UACE,SACA,cAEFK,SACE,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,wEACfE,UACE,UACA,eAEFK,SACE,OACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,0DACfE,UACE,SACA,cAEFK,SACE,MACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,sEACfE,UACE,UACA,eAEFK,SACE,OACA,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,oCACfE,UACE,SACA,kBACA,cACA,cACA,2BAEFK,SACE,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,+CACfE,UACE,aAEFK,SACE,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,eACZE,QACE,UAEFD,YAAe,uCACfE,UACE,WACA,sBACA,cACA,eAEFK,SACE,OACA,MACA,SAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,eACZE,QACE,WAEFD,YAAe,kDACfE,UACE,YACA,yBAEFK,SACE,OACA,UAOC,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,KACR0W,SAAY,QACZE,QACE,YACA,eAEFD,YAAe,8BACfE,UACE,eACA,aACA,oBAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,QACR0W,SAAY,QACZE,QACE,YAEFD,YAAe,sFACfE,UACE,aACA,gBACA,gBACA,sBACA,wBAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,MACR0W,SAAY,QACZE,QACE,oBAEFD,YAAe,qHACfE,UACE,0DAEFK,SAAY,SAAU,aAMnB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,QACZE,QACE,mBAEFD,YAAe,4BACfE,UACE,wBACA,wCACA,oCAEFK,SAAY,OAAQ,MAAO,aAMxB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,UACR0W,SAAY,QACZE,QACE,wBAEFD,YAAe,0FACfE,UACE,0DAEFK,SAAY,MAAO,OAAQ,YAMxB,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,QACZE,QACE,gBACA,4BAEFD,YAAe,wCACfE,UACE,cACA,iBACA,aACA,iBAEFK,SAAY,WAMT,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,QACZE,QACE,kBAEFD,YAAe,gCACfE,UACE,oBACA,wBAEFK,aAMG,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,OACR0W,SAAY,QACZE,QACE,UACA,oBAEFD,YAAe,kGACfE,UACE,mBACA,6BACA,+CACA,kDAEFK,SAAY,MAAO,SAAU,aAM1B,SAASnd,EAAQD,EAASM,GAE/BL,EAAOD,SACLkG,KAAQ,SACR0W,SAAY,QACZE,QACE,aAEFD,YAAe,8BACfE,UACE,cACA,iBACA,iBACA,yBAEFK,aAMG,SAASnd,EAAQD,EAASM,GAwB/B,QAAS+6C,GAAeC,GACvB,MAAOh7C,GAAoBi7C,EAAsBD,IAElD,QAASC,GAAsBD,GAC9B,MAAOn5C,GAAIm5C,IAAS,WAAa,KAAM,IAAIz4C,OAAM,uBAAyBy4C,EAAM,SA1BjF,GAAIn5C,IACHq5C,UAAW,IACXC,aAAc,IACdC,WAAY,IACZC,cAAe,IACfC,WAAY,IACZC,cAAe,IACfC,YAAa,IACbC,eAAgB,IAChBC,WAAY,IACZC,cAAe,IACfC,WAAY,IACZC,cAAe,IACfC,QAAS,IACTC,WAAY,IACZC,UAAW,IACXC,aAAc,IACdC,SAAU,IACVC,YAAa,IACbC,WAAY,IACZC,cAAe,IAQhBtB,GAAe5Q,KAAO,WACrB,MAAOrnC,QAAOqnC,KAAKtoC,IAEpBk5C,EAAeuB,QAAUrB,EACzBt7C,EAAOD,QAAUq7C,EACjBA,EAAe56C,GAAK,KAKf,SAASR,EAAQD,EAASM,GAE/BL,EAAOD,QAAU,kBAOZ,SAASC,EAAQD,EAASM,GAE/B,YASA,SAAS+yB,GAAqBhQ,EAAI0K,GAChC,KAAM3tB,eAAgBizB,IACpB,KAAM,IAAIhtB,aAAY,mDAGxBjG,MAAKijB,GAAKA,EACVjjB,KAAK2tB,MAAQ7pB,MAAMyE,UAAU0mB,OAAO1uB,KAAK2F,UAAW,GAE/C+c,EAIsB,GAArBjjB,KAAK2tB,MAAM1pB,OACbjE,KAAKgmB,QAAU,4CAA8C/C,EAG7DjjB,KAAKgmB,QAAU,YAAc/C,EAAK,IAAMjjB,KAAK2tB,MAAMpiB,KAAK,MAAQ,kBAPlEvL,KAAKgmB,QAAU;AAWjBhmB,KAAKgvC,OAAQ,GAAKvsC,QAASusC,MAG7B/b,EAAqB1qB,UAAY,GAAI9B,WACrCwsB,EAAqB1qB,UAAUmD,YAAcjF,UAC7CwsB,EAAqB1qB,UAAUzC,KAAO,uBAEtCjG,EAAOD,QAAUqzB,GAKZ,SAASpzB,EAAQD,EAASM,GAY/BN,EAAQg4C,QAAU,SAAS30B,GACzB,MAAO,SAAS20B,KACe,gBAAlBA,GAAQ6E,QACjB7E,EAAQ6E,SAGV,IAAIC,GAAOC,KAAKC,UAAU12C,UAC1B,OAAMw2C,KAAQ9E,GAAQ6E,MAGf7E,EAAQ6E,MAAMC,GAFZ9E,EAAQ6E,MAAMC,GAAQz5B,EAAG/X,MAAM+X,EAAI/c,cAS3C,SAASrG,EAAQD,EAASM,GAE/B,GAAI28C,IACH,SAAWC,GACR,YAu0DA,SAASC,GAAoB7tC,GAMzB,IALA,GAAIiI,GAAGhI,EACHzL,EAAI,EACJQ,EAAIgL,EAAEjL,OACNqC,EAAI4I,EAAE,GAAK,GAEHhL,EAAJR,EAAOA,IAAM,CAGjB,IAFAyT,EAAIjI,EAAExL,GAAK,GAELyL,EAAI6tC,EAAU7lC,EAAElT,OAAQkL,KAC1BgI,EAAI,IAAMA,CAGd7Q,IAAK6Q,EAIT,IAAMjT,EAAIoC,EAAErC,OAA8B,KAAtBqC,EAAE22C,aAAa/4C,KAEnC,MAAOoC,GAAE8Y,MAAO,EAAGlb,EAAI,GAAK,GAmBhC,QAASg5C,GAAqBz8C,EAAGiD,EAAGy5C,EAAIC,GACpC,GAAIC,GAAI/uC,EAAGU,EAAG1I,EAAGkN,CAGjB,KAAMlF,EAAI,EAAGU,EAAIvO,EAAE,GAAIuO,GAAK,GAAIA,GAAK,GAAIV,KAoDzC,MAlDAU,GAAItL,EAAI4K,EAGC,EAAJU,GACDA,GAAKguC,EACLK,EAAK,IAELA,EAAKj1C,KAAKmC,MAAQyE,EAAI,GAAMguC,GAC5BhuC,GAAKguC,GAGT1uC,EAAIgvC,EAAS,GAAIN,EAAUhuC,GAC3BwE,EAAK/S,EAAE48C,GAAM/uC,EAAI,EAEC,MAAb8uC,EAEQ,EAAJpuC,GAES,GAALA,EACDwE,EAAKA,EAAK,IAAM,EACH,GAALxE,IACRwE,EAAKA,EAAK,GAAK,GAGnBlN,EAAS,EAAL62C,GAAgB,OAAN3pC,GAAe2pC,EAAK,GAAW,OAAN3pC,GAAqB,KAANA,GAAqB,GAANA,GAErElN,GAAW,EAAL62C,GAAU3pC,EAAK,GAAKlF,GAAK6uC,EAAK,GAAK3pC,EAAK,GAAKlF,EAAI,KACjD7N,EAAE48C,EAAK,GAAK/uC,EAAI,IAAM,IAAOgvC,EAAS,GAAItuC,EAAI,GAAM,IAChDwE,GAAMlF,EAAI,GAAW,GAANkF,IAA4C,IAA7B/S,EAAE48C,EAAK,GAAK/uC,EAAI,IAAM,GAIzD,EAAJU,GAES,GAALA,EACDwE,EAAKA,EAAK,IAAO,EACJ,GAALxE,EACRwE,EAAKA,EAAK,IAAM,EACH,GAALxE,IACRwE,EAAKA,EAAK,GAAK,GAGnBlN,GAAM82C,GAAkB,EAALD,IAAkB,MAAN3pC,IAAe4pC,GAAaD,EAAK,GAAW,MAAN3pC,GAErElN,IAAQ82C,GAAkB,EAALD,IAAY3pC,EAAK,GAAKlF,IACxC8uC,GAAaD,EAAK,GAAO3pC,EAAK,GAAKlF,EAAI,KACpC7N,EAAE48C,EAAK,GAAK/uC,EAAI,IAAO,IAAOgvC,EAAS,GAAItuC,EAAI,GAAM,EAI5D1I,EAOX,QAASi3C,GAASz4C,EAAGq4C,EAAIK,GACrB,GAAIpgC,GAAUtY,EAAe,WAE7B,OAAa,OAANq4C,KAAkBM,EAAkB,EAALN,GAAUA,EAAK,IAC5C,IAAPA,IAAc//B,EAAgB,OAAIsgC,SAAW9zC,YAAauzC,IAAOA,KAC9DQ,EAAmBvgC,EAAS,gBAAiB+/B,EAAIK,EAAQ,GACtDpgC,EAAkB,SAAS,EAAL+/B,EAOlC,QAASS,GAAU94C,EAAGkK,EAAGwuC,EAAQt7C,GAC7B,GAAIkb,GAAUtY,EAAe,WAE7B,SAAU24C,GAAmBv7C,GAAO,GAAb8M,GAAoBA,GAAK6uC,EAAa,KAMnD,IAAN7uC,IAAaoO,EAAgB,OAAIsgC,SAAW9zC,YAAaoF,IAAMA,IAC/D2uC,EAAmBvgC,EAAS,WAAYpO,EAAGwuC,EAAQ,GA0d3D,QAASh1B,GAAK1jB,EAAGg5C,GACb,GAAIC,GAAOC,EAAO95C,EAAGgF,EAAK+0C,EAAIryB,EAAK+K,EAC/BunB,EAAM,EACNx6C,EAAI,EACJ4K,EAAI,EACJ8O,EAAUtY,EAAe,YACzBu1B,EAAMjd,EAAa,IACnB+/B,EAAK//B,EAAkB,SACvBja,EAAYia,EAAmB,SAGnC,KAAMtY,EAAK,IAAMA,EAAK,EAAE,IAAMA,EAAK,EAAI,GAEnC,MAAO,IAAIsY,GAAStY,EAAK,EACpBA,EAAK,EAAE,GAAWA,EAAK,EAAI,EAAI,EAAI,EAAI,EAA3Bu1B,EACbv1B,EAAK,EAAIA,EAAK,EAAI,EAAI,EAAIA,EAAI6iB,EAAAA,EA4BtC,KAzBW,MAANm2B,GAgBDK,GAAW,EACXF,EAAK96C,GAEL86C,EAAKH,EAGTnnB,EAAI,GAAIvZ,GAAQ,QAGRtY,EAAK,EAAI,IAGbA,EAAIA,EAAS,MAAE6xB,GACfroB,GAAK,CAaT,KANA0vC,EAAQ51C,KAAK0F,IAAKwvC,EAAS,EAAGhvC,IAAQlG,KAAK2F,KAAO,EAAI,EAAI,EAC1DkwC,GAAMD,EAEND,EAAQ70C,EAAM0iB,EAAM,GAAIxO,GAAQid,GAChCjd,EAAmB,UAAI6gC,IAEX,CAKR,GAJA/0C,EAAMk1C,EAAKl1C,EAAW,MAAEpE,GAAIm5C,EAAI,GAChCF,EAAQA,EAAa,QAAIr6C,GACzBizB,EAAI/K,EAAU,KAAGgL,EAAK1tB,EAAK60C,EAAOE,EAAI,IAEjClB,EAAqBpmB,EAAK,GAAIvX,MAAO,EAAG6+B,KACxClB,EAAqBnxB,EAAO,GAAIxM,MAAO,EAAG6+B,GAAO,CAGlD,IAFA/5C,EAAIoK,EAEIpK,KACJ0nB,EAAMwyB,EAAKxyB,EAAW,MAAEA,GAAMqyB,EAAI,EAYtC,IAAW,MAANH,EAcD,MAFA1gC,GAAmB,UAAIja,EAEhByoB,CAZP,MAAW,EAANsyB,GAAWhB,EAAqBtxB,EAAO,EAAGqyB,EAAKD,EAAOb,EAAIe,IAO3D,MAAOE,GAAKxyB,EAAKxO,EAAmB,UAAIja,EAAWg6C,EAAIgB,GAAW,EANlE/gC,GAAmB,UAAI6gC,GAAM,GAC7BF,EAAQ70C,EAAMytB,EAAI,GAAIvZ,GAAQid,GAC9B32B,EAAI,EACJw6C,IAWZtyB,EAAM+K,GAad,QAAS7tB,GAAQkG,EAAGtL,EAAGQ,EAAGoK,GACtB,GAAI6I,GAAGhI,EACHiO,EAAUpO,EAAe,YACzB+N,GAAM/N,EAAI,GAAIoO,GAAQpO,IAAQ,CAsBlC,IAnBU,MAALtL,EACDQ,EAAI,GAEJk6C,EAAKpvC,IAAKtL,EAAGQ,GAGbA,EAAIoK,EAAI5K,EAAIA,EAAIsL,EAAK,EAAI+N,GAG7BA,EAAI/N,EAAK,EACTmI,EAAI4lC,EAAqB/tC,EAAK,GASpB,GAALV,GAAe,GAALA,IAAiByO,GAALrZ,GAAUqZ,GAAKK,EAAkB,UAAM,CAG9D,KAAQjG,EAAElT,OAASC,EAAGiT,GAAK,KAEtBA,EAAElT,OAAS,IACZkT,EAAIA,EAAEpQ,OAAO,GAAK,IAAMoQ,EAAEiI,MAAM,IAGpCjI,IAAW,EAAJ4F,EAAQ,IAAM,MAASA,MAG3B,CAIH,GAHAzO,EAAI6I,EAAElT,OAGG,EAAJ8Y,EAAQ,CAIT,IAHA5N,EAAIjL,EAAIoK,IAGEyO,EAAG5F,EAAI,IAAMA,GACvBA,EAAI,KAAOA,MAKX,MAAO4F,EAAIzO,EAAI,CAIX,IAHAa,EAAIjL,EAAI6Y,EAGFA,GAAKzO,EAAGyO,IAAM5F,GAAK,KAEpBhI,EAAI,IACLgI,GAAK,SAIThI,GAAIjL,EAAIoK,EAECA,EAAJyO,EACD5F,EAAIA,EAAEiI,MAAO,EAAGrC,GAAM,IAAM5F,EAAEiI,MAAMrC,GAC5B5N,EAAI,IACZgI,GAAK,IAMjB,IAAKhI,EAAI,EAEL,KAAQA,IAAKgI,GAAK,MAI1B,MAAOnI,GAAK,EAAI,GAAKA,EAAK,EAAE,GAAK,IAAMmI,EAAIA,EAI/C,QAASknC,GAAe59C,GACpB,GAAIstB,GAAIttB,EAAEwD,OAAS,EACf+K,EAAI+e,EAAIivB,EAAU,CAEtB,IAAKjvB,EAAIttB,EAAEstB,GAAK,CAGZ,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAI/e,KAG9B,IAAM+e,EAAIttB,EAAE,GAAIstB,GAAK,GAAIA,GAAK,GAAI/e,MAGtC,MAAOA,GAOX,QAAS2uC,GAAmBvgC,EAAS4I,EAAS7f,EAAKq3C,EAAQc,GAEvD,GAAKlhC,EAAgB,OAAI,CACrB,GAAI/Z,GAAQ,GAAIZ,QAAS+6C,IACvB,cAAe,MAAO,MAAO,KAAM,KAAM,MAAO,KAAM,MAAO,QAAS,MACtE,OAAQ,QAAS,aAAc,MAAO,SAAU,MAAO,OAAQ,YAAa,YACzEn9C,EAAU,EAALA,GAAUA,EAAKA,EAAc,EAAT,EAAIA,EAAS,EAAI,IAAQ,QACrD,kDAAmD,sBAAuB2lB,IACvEA,IAAcy3B,EAAa,gBAAkB,kBAChD,kCAAmCa,IAAS,KAAS,KAAOn4C,EAK9D,MAHA9C,GAAY,KAAI,gBAChBo6C,EAAap9C,EAAK,EAEZgD,GAQd,QAASk7C,GAAQnhC,EAAStY,EAAGpB,GACzB,GAAI4C,GAAI,GAAI8W,GAASA,EAAa,IAElC,KAAM+gC,GAAW,EAEJ,EAAJz6C,IACD4C,EAAIA,EAAS,MAAExB,IAEnBpB,IAAM,EAEAA,GAINoB,EAAIA,EAAS,MAAEA,EAInB,OAFAq5C,IAAW,EAEJ73C,EAgBX,QAASywB,GAAI3nB,EAAG0uC,GACZ,GAAIr9C,GAAG+9C,EAAIT,EAAOhhC,EAAG9S,EAAKi0C,EAAKD,EAAIryB,EAAK+K,EAAG8nB,EAAIxH,EAC3CjoC,EAAI,EACJgvC,EAAQ,GACRl5C,EAAIsK,EACJsvC,EAAK55C,EAAK,EACVsY,EAAUtY,EAAe,YACzBu1B,EAAMjd,EAAa,IACnB+/B,EAAK//B,EAAkB,SACvBja,EAAYia,EAAmB,SAGnC,IAAKtY,EAAK,EAAI,IAAM45C,IAAOA,EAAG,KAAO55C,EAAK,GAAc,GAAT45C,EAAG,IAAwB,GAAbA,EAAGz6C,OAE5D,MAAO,IAAImZ,GAASshC,IAAOA,EAAG,GAAK,GAAK,EAAc,GAAV55C,EAAK,EAAS6iB,EAAAA,EAAM+2B,EAAK,EAAI55C,EAe7E,IAZW,MAANg5C,GACDK,GAAW,EACXF,EAAK96C,GAEL86C,EAAKH,EAGT1gC,EAAmB,UAAI6gC,GAAMD,EAE7Bv9C,EAAIs8C,EAAoB2B,GACxBF,EAAK/9C,EAAEsG,OAAO,KAETqB,KAAKe,IAAK4T,EAAIjY,EAAK,GAAM,OAiD1B,MAZAA,GAAI,GAAIsY,GAASohC,EAAK,IAAM/9C,EAAE2e,MAAM,IAE/B6+B,EAAK,EAAIlwC,EAAK9J,QACf05C,EAAmBvgC,EAAS,EAAG6gC,EAAK,EAAG,MAG3Cn5C,EAAIiyB,EAAIjyB,EAAGm5C,EAAKD,GAAc,KAC1B,GAAI5gC,GAASrP,EAAKqR,MAAO,EAAG6+B,EAAK,IAAa,MAAGlhC,EAAI,KAGzDK,EAAmB,UAAIja,EAEV,MAAN26C,EAAaM,EAAKt5C,EAAG3B,EAAWg6C,EAAIgB,GAAW,GAASr5C,CAlC/D,MAAa,EAAL05C,GAAgB,GAANA,GAAiB,GAANA,GAAW/9C,EAAEsG,OAAO,GAAK,GAClDjC,EAAIA,EAAS,MAAEsK,GACf3O,EAAIs8C,EAAqBj4C,EAAK,GAC9B05C,EAAK/9C,EAAEsG,OAAO,GACdiI,GA8CR,KA3CI+N,EAAIjY,EAAK,EAEJ05C,EAAK,GACN15C,EAAI,GAAIsY,GAAS,KAAO3c,GACxBsc,KAEAjY,EAAI,GAAIsY,GAASohC,EAAK,IAAM/9C,EAAE2e,MAAM,IAyB5Cq/B,EAAK35C,EAQL8mB,EAAM3hB,EAAMnF,EAAI8xB,EAAK9xB,EAAS,MAAEu1B,GAAMv1B,EAAQ,KAAEu1B,GAAM4jB,EAAI,GAC1DhH,EAAKmH,EAAKt5C,EAAS,MAAEA,GAAIm5C,EAAI,GAC7BF,EAAQ,IAEI,CAIR,GAHA9zC,EAAMm0C,EAAKn0C,EAAW,MAAEgtC,GAAKgH,EAAI,GACjCtnB,EAAI/K,EAAU,KAAGgL,EAAK3sB,EAAK,GAAImT,GAAQ2gC,GAAQE,EAAI,IAE9ClB,EAAqBpmB,EAAK,GAAIvX,MAAO,EAAG6+B,KACxClB,EAAqBnxB,EAAO,GAAIxM,MAAO,EAAG6+B,GAAO,CA+BlD,GA9BAryB,EAAMA,EAAW,MAAE,GAOR,IAAN7O,IAEIkhC,EAAK,EAAIlwC,EAAK9J,QACf05C,EAAmBvgC,EAAS,EAAG6gC,EAAK,EAAG,MAG3CryB,EAAMA,EAAU,KACZ,GAAIxO,GAASrP,EAAKqR,MAAO,EAAG6+B,EAAK,IAAa,MAAGlhC,EAAI,MAI7D6O,EAAMgL,EAAKhL,EAAK,GAAIxO,GAAQpO,GAAIivC,EAAI,GAYzB,MAANH,EAcD,MAFA1gC,GAAmB,UAAIja,EAEhByoB,CAZP,KAAKsxB,EAAqBtxB,EAAO,EAAGqyB,EAAKD,EAAOb,EAAIe,GAOhD,MAAOE,GAAKxyB,EAAKxO,EAAmB,UAAIja,EAAWg6C,EAAIgB,GAAW,EANlE/gC,GAAmB,UAAI6gC,GAAMD,EAC7BrnB,EAAI1sB,EAAMnF,EAAI8xB,EAAK6nB,EAAU,MAAEpkB,GAAMokB,EAAS,KAAEpkB,GAAM4jB,EAAI,GAC1DhH,EAAKmH,EAAKt5C,EAAS,MAAEA,GAAIm5C,EAAI,GAC7BF,EAAQG,EAAM,EAY1BtyB,EAAM+K,EACNonB,GAAS,GAQhB,QAASK,GAAKt5C,EAAGm5C,EAAId,EAAI72C,GACtB,GAAIgX,GAAQ5Z,EAAGQ,EAAGoK,EAAGU,EAAGwE,EAAIkrC,EAAIC,EAC5BvhC,EAAUtY,EAAe,WAG7B85C,GAAK,GAAW,MAANX,EAAa,CAGnB,KAAQS,EAAK55C,EAAK,GAEd,MAAOA,EAcX,KAAMwY,EAAS,EAAGhP,EAAIowC,EAAG,GAAIpwC,GAAK,GAAIA,GAAK,GAAIgP,KAK/C,GAHA5Z,EAAIu6C,EAAK3gC,EAGA,EAAJ5Z,EACDA,GAAKs5C,EACL94C,EAAI+5C,EACJjvC,EAAI0vC,EAAIC,EAAM,GAGdnrC,EAAKxE,EAAIsuC,EAAS,GAAIhgC,EAASpZ,EAAI,GAAM,GAAK,MAI9C,IAFAy6C,EAAMv2C,KAAKmC,MAAQ7G,EAAI,GAAMs5C,GAExB2B,GAAOD,EAAGz6C,OAAS,CAEpB,IAAIqC,EAWF,KAAMs4C,EARJ,MAAQF,EAAGz6C,QAAU06C,EAAKD,EAAG57C,KAAK,IAElCkM,EAAIwE,EAAK,EACT8J,EAAS,EACT5Z,GAAKs5C,EACL94C,EAAIR,EAAIs5C,EAAU,MAKnB,CAIH,IAHAhuC,EAAIV,EAAIowC,EAAGC,GAGLrhC,EAAS,EAAGhP,GAAK,GAAIA,GAAK,GAAIgP,KAGpC5Z,GAAKs5C,EAIL94C,EAAIR,EAAIs5C,EAAU1/B,EAIlB9J,EAAS,EAAJtP,EAAQ,EAAI26C,EAAW7vC,EAAIsuC,EAAS,GAAIhgC,EAASpZ,EAAI,GAAM,IAqBxE,GAjBAoC,EAAIA,GAAU,EAAL23C,GAEQ,MAAfS,EAAGC,EAAM,KAAoB,EAAJz6C,EAAQ8K,EAAIA,EAAIsuC,EAAS,GAAIhgC,EAASpZ,EAAI,IAQrEoC,EAAS,EAAL62C,GACE3pC,GAAMlN,KAAe,GAAN62C,GAAWA,IAAQr4C,EAAK,EAAI,EAAI,EAAI,IACrD0O,EAAK,GAAW,GAANA,IAAmB,GAAN2pC,GAAW72C,GAE5B,GAAN62C,IAAez5C,EAAI,EAAIQ,EAAI,EAAI8K,EAAIsuC,EAAS,GAAIhgC,EAASpZ,GAAM,EAAIw6C,EAAGC,EAAM,IAAO,GAAO,GACxFxB,IAAQr4C,EAAK,EAAI,EAAI,EAAI,IAErB,EAALm5C,IAAWS,EAAG,GAiBf,MAhBAA,GAAGz6C,OAAS,EAERqC,GAGA23C,GAAMn5C,EAAK,EAAI,EAGf45C,EAAG,GAAKpB,EAAS,GAAIW,EAAKjB,GAC1Bl4C,EAAK,GAAKm5C,GAAM,GAIhBS,EAAG,GAAK55C,EAAK,EAAI,EAGdA,CAmBX,IAdU,GAALpB,GACDg7C,EAAGz6C,OAAS06C,EACZrwC,EAAI,EACJqwC,MAEAD,EAAGz6C,OAAS06C,EAAM,EAClBrwC,EAAIgvC,EAAS,GAAIN,EAAUt5C,GAI3Bg7C,EAAGC,GAAOz6C,EAAI,GAAM8K,EAAIsuC,EAAS,GAAIhgC,EAASpZ,GAAMo5C,EAAS,GAAIp5C,GAAM,GAAMoK,EAAI,GAIjFhI,EAEA,OAAY,CAGR,GAAY,GAAPq4C,EAAW,CAGZ,IAAMj7C,EAAI,EAAGQ,EAAIw6C,EAAG,GAAIx6C,GAAK,GAAIA,GAAK,GAAIR,KAI1C,IAFAQ,EAAIw6C,EAAG,IAAMpwC,EAEPA,EAAI,EAAGpK,GAAK,GAAIA,GAAK,GAAIoK,KAG1B5K,GAAK4K,IACNxJ,EAAK,IAEA45C,EAAG,IAAMI,IACVJ,EAAG,GAAK,GAIhB,OAIA,GAFAA,EAAGC,IAAQrwC,EAENowC,EAAGC,IAAQG,EAEZ,KAGJJ,GAAGC,KAAS,EACZrwC,EAAI,EAMhB,IAAM5K,EAAIg7C,EAAGz6C,OAAoB,IAAZy6C,IAAKh7C,GAAUg7C,EAAGhd,QAmB3C,MAhBIyc,KAGKr5C,EAAK,EAAIsY,EAAc,KAGxBtY,EAAK,EAAIA,EAAK,EAAI,KAGVA,EAAK,EAAIsY,EAAc,OAG/BtY,EAAK,GAAMA,EAAK,EAAI,KAIrBA,EAr/FX,GAAIi6C,GAAaC,EAMbvB,EALAwB,EAASnC,EAAe,OACxBqB,GAAW,EACX99C,EAAK,EACLw+C,EAAYz2C,KAAK6W,MACjBq+B,EAAUl1C,KAAKc,IAEfE,EAAWpG,OAAOuF,UAAUa,SAC5B01C,EAAO,IACP9B,EAAU,EACVkC,EAAW,mEACXxwC,KAMAywC,EAAY,KAMZtB,EAAa,IAObuB,EAAgB,IAGhBrxC,EAAO,ogCAUXW,GAAiB,cAAIA,EAAO,IAAI,WAC5B,GAAI5J,GAAI,GAAI9E,MAAkB,YAAEA,KAMhC,OAJK8E,GAAK,EAAI,IACVA,EAAK,EAAI,GAGNs5C,EAAIt5C,IASf4J,EAAQ,KAAI,WAER,MAAO0vC,GAAK,GAAIp+C,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAY9D0O,EAAc,WAAIA,EAAO,IAAI,SAAWU,EAAG0J,GACvC,GAAI5J,GACApK,EAAI9E,KACJ0+C,EAAK55C,EAAK,EACVu6C,GAAOh/C,GAAMA,EAAI+O,EAAI,GAAItK,GAAe,YAAGsK,EAAG0J,GAAK1J,EAAK,GACxD1L,EAAIoB,EAAK,EACTZ,EAAIkL,EAAK,EACTd,EAAIxJ,EAAK,EACTuP,EAAIjF,EAAK,CAGb,KAAM1L,IAAMQ,EACR,MAAO,KAOX,IAJAgL,EAAIwvC,IAAOA,EAAG,GACd5lC,EAAIumC,IAAOA,EAAG,GAGTnwC,GAAK4J,EACN,MAAO5J,GAAI4J,EAAI,GAAK5U,EAAIR,CAI5B,IAAKA,GAAKQ,EACN,MAAOR,EAMX,IAHAwL,EAAQ,EAAJxL,GAGEg7C,IAAOW,EACT,MAAO/wC,IAAK+F,EAAI,GAAKqqC,EAAKxvC,EAAI,EAAI,EAItC,IAAKZ,GAAK+F,EACN,MAAO/F,GAAI+F,EAAInF,EAAI,EAAI,EAI3B,KAAMxL,EAAI,GACJQ,GAAMoK,EAAIowC,EAAGz6C,SAAaoQ,EAAIgrC,EAAGp7C,QAAWqK,EAAI+F,IAC9C3Q,EAAIQ,GAER,GAAKw6C,EAAGh7C,IAAM27C,EAAG37C,GACb,MAAOg7C,GAAGh7C,GAAK27C,EAAG37C,GAAKwL,EAAI,EAAI,EAKvC,OAAOZ,IAAK+F,EAAI,EAAI/F,EAAI+F,EAAInF,EAAI,EAAI,IAQvCR,EAAiB,cAAIA,EAAM,GAAI,WAC5B,GAAIjO,GAAGstB,EACH/e,EAAI,IAER,IAAKvO,EAAIT,KAAQ,EAAI,CAGjB,GAFAgP,IAAQ+e,EAAIttB,EAAEwD,OAAS,GAAM46C,EAAW7+C,KAAQ,EAAIg9C,IAAcA,EAE7DjvB,EAAIttB,EAAEstB,GAGP,KAAQA,EAAI,IAAM,EAAGA,GAAK,GAAI/e,KAGzB,EAAJA,IACDA,EAAI,GAIZ,MAAOA,IAyBXN,EAAa,UAAIA,EAAO,IAAI,SAAWU,EAAG0J,GAGtC,MAFAzY,GAAK,EAEEu2B,EAAK52B,KAAM,GAAIA,MAAkB,YAAGoP,EAAG0J,KAUlDpK,EAAsB,mBAAIA,EAAY,SAAI,SAAWU,EAAG0J,GACpD,GAAIhU,GAAI9E,KACJod,EAAUtY,EAAe,WAG7B,OAFAzE,GAAK,GAEE+9C,EACLxnB,EAAK9xB,EAAG,GAAIsY,GAAShO,EAAG0J,GAAK,EAAG,EAAG,GAAKsE,EAAmB,UAAGA,EAAkB,WAUtF1O,EAAU,OAAIA,EAAM,GAAI,SAAWM,EAAG8J,GAGlC,MAFAzY,GAAK,EAE0B,IAAxBL,KAAU,IAAGgP,EAAG8J,IAU3BpK,EAAe,YAAIA,EAAO,IAAI,WAE1B,MAAO8Z,GAAIxoB,OASf0O,EAAS,MAAI,WAET,MAAO0vC,GAAK,GAAIp+C,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAS9D0O,EAAe,YAAIA,EAAM,GAAI,SAAWM,EAAG8J,GAGvC,MAFAzY,GAAK,EAEEL,KAAU,IAAGgP,EAAG8J,GAAM,GASjCpK,EAAwB,qBAAIA,EAAO,IAAI,SAAWM,EAAG8J,GAIjD,MAHAzY,GAAK,EACLyY,EAAI9Y,KAAU,IAAGgP,EAAG8J,GAER,GAALA,GAAgB,IAANA,GAQrBpK,EAAY,SAAI,WAEZ,QAAS1O,KAAQ,GAQrB0O,EAAa,UAAIA,EAAS,MAAI,WAE1B,QAAS1O,KAAQ,GAAK6+C,EAAW7+C,KAAQ,EAAIg9C,GAAYh9C,KAAQ,EAAEiE,OAAS,GAQhFyK,EAAS,MAAI,WAET,OAAQ1O,KAAQ,GAQpB0O,EAAc,WAAIA,EAAS,MAAI,WAE3B,MAAO1O,MAAQ,EAAI,GAQvB0O,EAAU,OAAI,WAEV,QAAS1O,KAAQ,GAAqB,GAAhBA,KAAQ,EAAE,IAQpC0O,EAAY,SAAIA,EAAM,GAAI,SAAWM,EAAG8J,GAGpC,MAFAzY,GAAK,EAEEL,KAAU,IAAGgP,EAAG8J,GAAM,GASjCpK,EAAqB,kBAAIA,EAAO,IAAI,SAAWM,EAAG8J,GAI9C,MAHAzY,GAAK,EACLyY,EAAI9Y,KAAU,IAAGgP,EAAG8J,GAER,IAALA,GAAiB,IAANA,GAmCtBpK,EAAa,UAAIA,EAAO,IAAI,SAAWpB,EAAMwL,GACzC,GAAIwmC,GAAQ7+C,EAAGs9C,EAAOr6C,EAAG67C,EAAKt1C,EAAKg0C,EAAIuB,EAAMl5C,EACzCH,EAAMnG,KACNod,EAAUjX,EAAiB,YAC3B23C,EAAK1gC,EAAmB,UACxB+/B,EAAK//B,EAAkB,SACvB4gC,EAAQ,CAGZ,IAAa,MAAR1wC,EACDA,EAAO,GAAI8P,GAAQ,IACnBkiC,GAAS,MACN,CAMH,GALAj/C,EAAK,GACLiN,EAAO,GAAI8P,GAAS9P,EAAMwL,GAC1BrY,EAAI6M,EAAQ,EAGPA,EAAQ,EAAI,IAAM7M,IAAMA,EAAE,KAAO6M,EAAQ,GAAa,GAAR7M,EAAE,IAAuB,GAAZA,EAAEwD,OAE9D,MAAO,IAAImZ,GAAQuK,EAAAA,EAEvB23B,GAAShyC,EAAS,GAAE,IAKxB,GAHA7M,EAAI0F,EAAO,EAGNA,EAAO,EAAI,IAAM1F,IAAMA,EAAE,KAAO0F,EAAO,GAAa,GAAR1F,EAAE,IAAuB,GAAZA,EAAEwD,OAE5D,MAAO,IAAImZ,GAAS3c,IAAMA,EAAE,GAAK,GAAK,EAAgB,GAAZ0F,EAAO,EAASwhB,EAAAA,EAAMlnB,EAAI,EAAI,EAAI,EAqDhF,IA9CA8+C,EAAMD,IAAY57C,EAAIjD,EAAE,GAAIA,EAAEwD,OAAS,GAAU,GAALP,GAAe,IAALA,GAC/C,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAAiB,KAALA,GAUlDy6C,GAAW,EACXF,EAAKH,EAAKE,EACVwB,EAAOvB,EAAK,GAEZh0C,EAAM8sB,EAAI5wB,EAAK83C,GAEXqB,GAEKE,EAAOzxC,EAAK9J,QACb05C,EAAmBvgC,EAAS,EAAGoiC,EAAM,OAEzCzB,EAAQ,GAAI3gC,GAASrP,EAAKqR,MAAO,EAAGogC,KAEpCzB,EAAQhnB,EAAIzpB,EAAM2wC,GAItB33C,EAAIswB,EAAK3sB,EAAK8zC,EAAOE,EAAI,GAkBpBf,EAAqB52C,EAAK,EAAG5C,EAAIo6C,EAAIX,GAEtC,EAiBI,IAhBAc,GAAM,GACNh0C,EAAM8sB,EAAI5wB,EAAK83C,GAEXqB,GACAE,EAAOvB,EAAK,GAEPuB,EAAOzxC,EAAK9J,QACb05C,EAAmBvgC,EAAS,EAAGoiC,EAAM,OAEzCzB,EAAQ,GAAI3gC,GAASrP,EAAKqR,MAAO,EAAGogC,KAEpCzB,EAAQhnB,EAAIzpB,EAAM2wC,GAGtB33C,EAAIswB,EAAK3sB,EAAK8zC,EAAOE,EAAI,IAEnBsB,EAAM,EAGFxC,EAAqBz2C,EAAK,GAAI8Y,MAAO1b,EAAI,EAAGA,EAAI,IAAO,GAAK,OAC9D4C,EAAI83C,EAAK93C,EAAGw3C,EAAK,EAAG,GAGxB,aAEEZ,EAAqB52C,EAAK,EAAG5C,GAAK,GAAIy5C,GAIpD,OAFAgB,IAAW,EAEJC,EAAK93C,EAAGw3C,EAAIX,IAyBvBzuC,EAAS,MAAI,SAAWU,EAAG0J,GACvB,GAAI6d,GAAGjzB,EAAGQ,EAAGu7C,EACT36C,EAAI9E,KACJod,EAAUtY,EAAe,YACzBoK,EAAIpK,EAAK,CAOb,IALAzE,EAAK,EACL+O,EAAI,GAAIgO,GAAShO,EAAG0J,GACpBA,EAAI1J,EAAK,GAGHF,IAAM4J,EAER,MAAO,IAAIsE,GAAQuK,EAAAA,EAIvB,IAAKzY,GAAK4J,EAGN,MAFA1J,GAAK,GAAK0J,EAEHhU,EAAQ,KAAEsK,EAGrB,IAAIsvC,GAAK55C,EAAK,EACVu6C,EAAKjwC,EAAK,EACV2N,EAAI8hC,EAAWzvC,EAAK,EAAI4tC,GACxB1uC,EAAIuwC,EAAW/5C,EAAK,EAAIk4C,GACxBc,EAAK1gC,EAAmB,UACxB+/B,EAAK//B,EAAkB,QAE3B,KAAM9O,IAAMyO,EAAI,CAGZ,IAAM2hC,IAAOW,EAET,MAAOX,IAAOtvC,EAAK,GAAK0J,EAAG1J,GAAM,GAAIgO,GAASiiC,EAAKv6C,EAAI6iB,EAAAA,EAI3D,KAAM+2B,EAAG,KAAOW,EAAG,GAQf,MALAv6C,GAAIu6C,EAAG,IAAOjwC,EAAK,GAAK0J,EAAG1J,GAAM,GAAIgO,GAASshC,EAAG,GAAK55C,EAG9C,GAANq4C,GAAW,EAAI,GAEVgB,EAAWC,EAAKt5C,EAAGg5C,EAAIX,GAAOr4C,EAQ7C,GAJA45C,EAAKA,EAAGt/B,QACR1b,EAAIg7C,EAAGz6C,OAGFiL,EAAIZ,EAAIyO,EAAI,CA2Bb,KAzBK0iC,EAAW,EAAJvwC,IACRA,GAAKA,EACLynB,EAAI+nB,EACJh7C,EAAI27C,EAAGp7C,SAEP8Y,EAAIzO,EACJqoB,EAAI0oB,IAGD/wC,EAAIlG,KAAKmC,KAAMuzC,EAAKd,IAAct5C,IACrCA,EAAI4K,GASHY,GAAMxL,GAAK,KACZwL,EAAIxL,EACJizB,EAAE1yB,OAAS,GAGf0yB,EAAEuf,UACIp9B,EAAI5J,EAAG4J,IAAK6d,EAAE7zB,KAAK,IACzB6zB,EAAEuf,cAQF,MAJKuJ,EAAO/7C,GAAMQ,EAAIm7C,EAAGp7C,WACrBC,EAAIR,GAGFwL,EAAI4J,EAAI,EAAO5U,EAAJ4U,EAAOA,IAEpB,GAAK4lC,EAAG5lC,IAAMumC,EAAGvmC,GAAK,CAClB2mC,EAAOf,EAAG5lC,GAAKumC,EAAGvmC,EAElB,OAeZ,GATK2mC,IACD9oB,EAAI+nB,EAAIA,EAAKW,EAAIA,EAAK1oB,EACtBvnB,EAAK,GAAKA,EAAK,IAOZ0J,KAAS5U,EAAIw6C,EAAGz6C,QAAWo7C,EAAGp7C,SAAa,EAE9C,KAAQ6U,IAAK4lC,EAAGx6C,KAAO,GAI3B,IAAMoK,EAAIwwC,EAAO,EAAGhmC,EAAIumC,EAAGp7C,OAAQ6U,EAAI5J,GAAK,CAExC,GAAKwvC,IAAK5lC,GAAKumC,EAAGvmC,GAAK,CAEnB,IAAMpV,EAAIoV,EAAGpV,IAAMg7C,IAAKh7C,GAAIg7C,EAAGh7C,GAAK4K,KAClCowC,EAAGh7C,GACLg7C,EAAG5lC,IAAMgmC,EAEbJ,EAAG5lC,IAAMumC,EAAGvmC,GAIhB,KAAmB,GAAX4lC,IAAKx6C,GAASw6C,EAAGhd,OAGzB,KAAiB,GAATgd,EAAG,GAASA,EAAG9f,UAAW7hB,GAclC,IAZM2hC,EAAG,KAGLA,GAAO3hC,EAAI,GAGX3N,EAAK,EAAU,GAAN+tC,EAAU,GAAK,GAG5B/tC,EAAK,EAAIsvC,EAGHxvC,EAAI,EAAG4J,EAAI4lC,EAAG,GAAI5lC,GAAK,GAAIA,GAAK,GAAI5J,KAG1C,MAFAE,GAAK,EAAIF,EAAI6N,EAAIigC,EAAU,EAEpBmB,EAAWC,EAAKhvC,EAAG0uC,EAAIX,GAAO/tC,GA4BzCV,EAAU,OAAIA,EAAO,IAAI,SAAWU,EAAG0J,GACnC,GAAI9J,GAAG2tB,EACH73B,EAAI9E,KACJod,EAAUtY,EAAe,YACzBtE,EAAI4c,EAAgB,MAWxB,OATA/c,GAAK,EACL+O,EAAI,GAAIgO,GAAShO,EAAG0J,GACpBA,EAAI1J,EAAK,EACTJ,GAAKlK,EAAK,IAAMgU,GAAK1J,EAAK,IAAMA,EAAK,EAAE,GAMlCJ,IAAMI,EAAK,GAAKtK,EAAK,IAAMA,EAAK,EAAE,GAE5BkK,EACH,GAAIoO,GAAQuK,EAAAA,GACZy2B,EAAK,GAAIhhC,GAAQtY,GAAIsY,EAAmB,UAAGA,EAAkB,WAGrE+gC,GAAW,EAED,GAAL39C,GAID4O,EAAK,EAAI,EACTutB,EAAI/F,EAAK9xB,EAAGsK,EAAG,EAAG,EAAG,GACrBA,EAAK,EAAI0J,EACT6jB,EAAK,GAAK7jB,GAEV6jB,EAAI/F,EAAK9xB,EAAGsK,EAAG,EAAG5O,EAAG,GAGzBm8B,EAAIA,EAAS,MAAEvtB,GACf+uC,GAAW,EAEJr5C,EAAS,MAAE63B,KAStBjuB,EAAoB,iBAAIA,EAAM,GAAI,WAE9B,MAAOqoB,GAAG/2B,OASd0O,EAAW,QAAIA,EAAO,IAAI,WACtB,GAAI5J,GAAI,GAAI9E,MAAkB,YAAEA,KAGhC,OAFA8E,GAAK,GAAKA,EAAK,GAAK,KAEbs5C,EAAIt5C,IAyBf4J,EAAQ,KAAI,SAAWU,EAAG0J,GACtB,GAAI6d,GACA7xB,EAAI9E,KACJod,EAAUtY,EAAe,YACzBoK,EAAIpK,EAAK,CAOb,IALAzE,EAAK,GACL+O,EAAI,GAAIgO,GAAShO,EAAG0J,GACpBA,EAAI1J,EAAK,GAGHF,IAAM4J,EAER,MAAO,IAAIsE,GAAQuK,EAAAA,EAIvB,IAAKzY,GAAK4J,EAGN,MAFA1J,GAAK,GAAK0J,EAEHhU,EAAS,MAAEsK,EAGtB,IAAIsvC,GAAK55C,EAAK,EACVu6C,EAAKjwC,EAAK,EACV2N,EAAI8hC,EAAWzvC,EAAK,EAAI4tC,GACxB1uC,EAAIuwC,EAAW/5C,EAAK,EAAIk4C,GACxBc,EAAK1gC,EAAmB,UACxB+/B,EAAK//B,EAAkB,QAE3B,KAAM9O,IAAMyO,EAAI,CAGZ,IAAM2hC,IAAOW,EAGT,MAAO,IAAIjiC,GAASlO,EAAI,EAI5B,KAAMwvC,EAAG,KAAOW,EAAG,GAKf,MAFAv6C,GAAIu6C,EAAG,GAAKjwC,EAAI,GAAIgO,GAASshC,EAAG,GAAK55C,EAAQ,EAAJoK,GAElCivC,EAAWC,EAAKt5C,EAAGg5C,EAAIX,GAAOr4C,EAO7C,GAHA45C,EAAKA,EAAGt/B,QAGHlQ,EAAIZ,EAAIyO,EAAI,CAsBb,IApBS,EAAJ7N,GACDA,GAAKA,EACLynB,EAAI+nB,EACJ5lC,EAAIumC,EAAGp7C,SAEP8Y,EAAIzO,EACJqoB,EAAI0oB,EACJvmC,EAAI4lC,EAAGz6C,SAGJqK,EAAIlG,KAAKmC,KAAMuzC,EAAKd,IAAclkC,IACrCA,EAAIxK,GAIHY,IAAM4J,IACP5J,EAAI4J,EACJ6d,EAAE1yB,OAAS,GAGT0yB,EAAEuf,UAAWhnC,IAAKynB,EAAE7zB,KAAK,IAC/B6zB,EAAEuf,UASN,IALKwI,EAAGz6C,OAASo7C,EAAGp7C,OAAS,IACzB0yB,EAAI0oB,EAAIA,EAAKX,EAAIA,EAAK/nB,GAIpBznB,EAAImwC,EAAGp7C,OAAQ6U,EAAI,EAAGxK,EAAIwwC,EAAM5vC,EAAGwvC,EAAGxvC,IAAMZ,EAC9CwK,GAAM4lC,IAAKxvC,GAAKwvC,EAAGxvC,GAAKmwC,EAAGnwC,GAAK4J,GAAMxK,EAAI,CAS9C,KANIwK,IACA4lC,EAAG3P,QAAQj2B,KACTiE,GAIA7N,EAAIwvC,EAAGz6C,OAAmB,GAAXy6C,IAAKxvC,GAASwvC,EAAGhd,OAOtC,IAHAtyB,EAAK,EAAIsvC,EAGHxvC,EAAI,EAAG4J,EAAI4lC,EAAG,GAAI5lC,GAAK,GAAIA,GAAK,GAAI5J,KAG1C,MAFAE,GAAK,EAAIF,EAAI6N,EAAIigC,EAAU,EAEpBmB,EAAWC,EAAKhvC,EAAG0uC,EAAIX,GAAO/tC,GAUzCV,EAAa,UAAIA,EAAM,GAAI,SAAUS,GACjC,GAAIH,GAAI,KACJlK,EAAI9E,IAgBR,OAdKmP,IAAKH,GAAKG,MAAQA,GAAW,IAANA,GAAiB,IAANA,GAGnCwuC,EAAmB74C,EAAe,YAAG,WAAYqK,EAAG,YAAa,GAGhErK,EAAK,IACNkK,EAAIqvC,EAAgBv5C,EAAK,GAEpBqK,GAAKrK,EAAK,EAAI,EAAIkK,IACnBA,EAAIlK,EAAK,EAAI,IAIdkK,GASXN,EAAS,MAAI,WACT,GAAI5J,GAAI9E,KACJod,EAAUtY,EAAe,WAE7B,OAAOs5C,GAAK,GAAIhhC,GAAQtY,GAAIA,EAAK,EAAI,EAAGsY,EAAkB,WAgB9D1O,EAAc,WAAIA,EAAQ,KAAI,WAC1B,GAAIlO,GAAGwO,EAAGivC,EAAI33C,EAAG43C,EAAKvnB,EAClB7xB,EAAI9E,KACJS,EAAIqE,EAAK,EACTqS,EAAIrS,EAAK,EACTiY,EAAIjY,EAAK,EACTsY,EAAUtY,EAAe,YACzB46C,EAAO,GAAItiC,GAAQ,GAGvB,IAAW,IAANjG,IAAY1W,IAAMA,EAAE,GAErB,MAAO,IAAI2c,IAAUjG,GAAS,EAAJA,KAAY1W,GAAKA,EAAE,IAAOknB,EAAAA,EAAMlnB,EAAIqE,EAAI,EAAI,EAqC1E,KAlCAq5C,GAAW,EAGXhnC,EAAI/O,KAAKK,MAAO3D,GAMN,GAALqS,GAAUA,GAAK,EAAI,GACpBnI,EAAI+tC,EAAoBt8C,IAEjBuO,EAAE/K,OAAS8Y,GAAM,GAAK,IACzB/N,GAAK,KAGTmI,EAAI/O,KAAKK,KAAKuG,GACd+N,EAAI8hC,GAAa9hC,EAAI,GAAM,IAAY,EAAJA,GAASA,EAAI,GAE3C5F,GAAK,EAAI,EACVnI,EAAI,KAAO+N,GAEX/N,EAAImI,EAAEm4B,gBACNtgC,EAAIA,EAAEoQ,MAAO,EAAGpQ,EAAEpM,QAAQ,KAAO,GAAMma,GAG3CzW,EAAI,GAAI8W,GAAQpO,IAEhB1I,EAAI,GAAI8W,GAASjG,EAAE/N,YAGvB60C,GAAOlhC,EAAIK,EAAmB,WAAM,IAOhC,GAHAuZ,EAAIrwB,EACJA,EAAIo5C,EAAY,MAAG/oB,EAAQ,KAAGC,EAAK9xB,EAAG6xB,EAAGsnB,EAAK,EAAG,KAE5ClB,EAAqBpmB,EAAK,GAAIvX,MAAO,EAAG6+B,MACvCjvC,EAAI+tC,EAAqBz2C,EAAK,IAAM8Y,MAAO,EAAG6+B,GAAO,CAOvD,GANAjvC,EAAIA,EAAEoQ,MAAO6+B,EAAK,EAAGA,EAAK,GAMhB,QAALjvC,IAAgBkvC,GAAY,QAALlvC,GAiBrB,IAMIA,KAAOA,EAAEoQ,MAAM,IAAqB,KAAfpQ,EAAEjI,OAAO,MAGjCq3C,EAAK93C,EAAGyW,EAAI,EAAG,GACfvc,GAAK8F,EAAS,MAAEA,GAAO,GAAExB,GAG7B,OAxBA,IAAMo5C,IACFE,EAAKznB,EAAG5Z,EAAI,EAAG,GAEV4Z,EAAS,MAAEA,GAAO,GAAE7xB,IAAK,CAC1BwB,EAAIqwB,CAEJ,OAGRsnB,GAAM,EACNC,EAAM,EAoBlB,MAFAC,IAAW,EAEJC,EAAK93C,EAAGyW,EAAGK,EAAkB,SAAG5c,IAyB3CkO,EAAS,MAAI,SAAWU,EAAG0J,GACvB,GAAIrY,GAAGsc,EACHjY,EAAI9E,KACJod,EAAUtY,EAAe,YACzB45C,EAAK55C,EAAK,EACVu6C,GAAOh/C,EAAK,GAAI+O,EAAI,GAAIgO,GAAShO,EAAG0J,GAAK1J,EAAK,GAC9C1L,EAAIm7C,EAAW/5C,EAAK,EAAIk4C,GACxB94C,EAAI26C,EAAWzvC,EAAK,EAAI4tC,GACxB9tC,EAAIpK,EAAK,CAOb,IALAgU,EAAI1J,EAAK,EAETA,EAAK,EAAIF,GAAK4J,EAAI,EAAI,MAGhBpV,GAAQg7C,GAAOA,EAAG,MAASx6C,GAAQm7C,GAAOA,EAAG,KAG/C,MAAO,IAAIjiC,IAAUlO,IAAM4J,GAGzB4lC,IAAOA,EAAG,KAAOW,GAAMA,IAAOA,EAAG,KAAOX,EAGpC/2B,EAAAA,EAGC+2B,GAAOW,EAMG,EAATjwC,EAAK,EAHLA,EAAK,EAAI,EAiBrB,KAXA2N,EAAIrZ,EAAIQ,EACRgL,EAAIwvC,EAAGz6C,OACP6U,EAAIumC,EAAGp7C,OAEE6U,EAAJ5J,IAGDzO,EAAIi+C,EAAIA,EAAKW,EAAIA,EAAK5+C,EACtByD,EAAIgL,EAAGA,EAAI4J,EAAGA,EAAI5U,GAGhBA,EAAIgL,EAAI4J,EAAGrY,KAAQyD,IAAKzD,EAAEqC,KAAK,IAGrC,IAAMY,EAAIoV,EAAI,EAAGpV,EAAI,GAAIA,IAAM,CAG3B,IAFAoV,EAAI,EAEE5U,EAAIgL,EAAIxL,EAAGQ,EAAIR,GACfoV,EAAIrY,EAAEyD,GAAKm7C,EAAG37C,GAAKg7C,EAAGx6C,EAAIR,EAAI,GAAKoV,EACnCrY,EAAEyD,KAAO4U,EAAIgmC,EAAO,EACpBhmC,EAAIA,EAAIgmC,EAAO,CAErBr+C,GAAEyD,IAAOzD,EAAEyD,GAAK4U,GAAMgmC,EAAO,EAYjC,IATIhmC,IACEiE,EACOtc,EAAE,IAGXA,EAAEm+B,QAIA16B,EAAIzD,EAAEwD,QAASxD,IAAIyD,GAAIzD,EAAEihC,OAI/B,IAHAtyB,EAAK,EAAI3O,EAGHyO,EAAI,EAAG4J,EAAIrY,EAAE,GAAIqY,GAAK,GAAIA,GAAK,GAAI5J,KAGzC,MAFAE,GAAK,EAAIF,EAAI6N,EAAIigC,EAAU,EAEpBmB,EAAWC,EAAKhvC,EAAGgO,EAAmB,UAAGA,EAAkB,UAAMhO,GAmB5EV,EAAmB,gBAAIA,EAAQ,KAAI,SAAWgpC,EAAIyF,GAC9C,GAAIr4C,GAAI9E,IAGR,OAFA8E,GAAI,GAAIA,GAAe,YAAEA,GAEZ,MAAN4yC,GAAekG,EAAU94C,EAAG4yC,EAAI,QAEnC0G,EAAKt5C,GAAU,EAAL4yC,GAAW5yC,EAAK,EAAI,EAAGy4C,EAASz4C,EAAGq4C,EAAI,SADjDr4C,GAqBR4J,EAAiB,cAAI,SAAWgpC,EAAIyF,GAChC,GAAIr4C,GAAI9E,IAER,OAAO8E,GAAK,EACRgE,EAAQhE,EAAS,MAAN4yC,GAAckG,EAAU94C,EAAG4yC,EAAI,iBAAyB,EAALA,EAAS,KACjE,MAANA,GAAc6F,EAASz4C,EAAGq4C,EAAI,iBAAmB,GACjDr4C,EAAEsE,YAsBVsF,EAAW,QAAI,SAAWgpC,EAAIyF,GAC1B,GAAIz1C,GACA5C,EAAI9E,KACJod,EAAUtY,EAAe,YACzBqxB,EAAM/Y,EAAkB,SACxBuiC,EAAMviC,EAAkB,QAgC5B,OA9BW,OAANs6B,IACDA,EAAKkG,EAAU94C,EAAG4yC,EAAIhwC,EAAM,WAAc5C,EAAK,GAAW,EAAL4yC,GAAW,KAChEyF,EAAKI,EAASz4C,EAAGq4C,EAAIz1C,IAIzB0V,EAAkB,WAAOA,EAAkB,SAAI,EAAI,GAExC,MAANs6B,GAAe5yC,EAAK,GAGrB4C,EAAMoB,EAAQhE,EAAG4yC,EAAIyF,GAIhBr4C,EAAK,EAAI,GAAKA,EAAK,IAGdA,EAAK,EAAE,GAID4C,EAAI9E,QAAQ,KAAO,IAC3B8E,EAAM,IAAMA,GAJZA,EAAMA,EAAIyiC,QAAS,IAAK,MAVhCziC,EAAM5C,EAAEsE,WAkBZgU,EAAkB,SAAI+Y,EACtB/Y,EAAkB,SAAIuiC,EAEfj4C,GAwBXgH,EAAY,SAAI,SAAUgpC,EAAIyF,GAC1B,GAAIr4C,GAAI9E,IAER,KAAM8E,EAAK,EACP,MAAOA,GAAEsE,UAGb,IAAI1F,GACA40C,EAAQxzC,EAAK,EAAI,EACjBmK,EAAInK,EAAe,YAAU,OAC7B86C,EAAiB3wC,EAAkB,eACnC4wC,GAAM5wC,EAAa,UACnB6wC,GAAM7wC,EAAsB,mBAC5B+mC,EAAMlxC,EAAEg3B,QAAS4b,EAAIyF,GAAKtzC,MAAM,KAChCk2C,EAAU/J,EAAI,GACdgK,EAAehK,EAAI,GACnBiK,EAAY3H,EAAQyH,EAAQ3gC,MAAM,GAAK2gC,EACvC16C,EAAM46C,EAAUh8C,MAMpB,IAJI67C,IACSp8C,EAAIm8C,EAAIA,EAAKC,EAAtBz6C,GAA0By6C,EAAKp8C,GAG9Bm8C,EAAK,GAAKx6C,EAAM,EAAI,CAIrB,IAHA3B,EAAI2B,EAAMw6C,GAAMA,EAChBE,EAAUE,EAAUhe,OAAQ,EAAGv+B,GAEnB2B,EAAJ3B,EAASA,GAAKm8C,EAClBE,GAAWH,EAAiBK,EAAUhe,OAAQv+B,EAAGm8C,EAGhDC,GAAK,IACNC,GAAWH,EAAiBK,EAAU7gC,MAAM1b,IAG5C40C,IACAyH,EAAU,IAAMA,GAIxB,MAAOC,GACHD,EAAU9wC,EAAoB,mBAAQ6wC,GAAM7wC,EAAqB,mBAC/D+wC,EAAa7V,QAAS,GAAI8C,QAAQ,OAAS6S,EAAK,OAAQ,KACxD,KAAO7wC,EAA0B,wBACjC+wC,GACFD,GAeRrxC,EAAc,WAAI,SAAUwxC,GACxB,GAAIC,GAAIC,EAAIrjC,EAAGsjC,EAAMrxC,EAAGsxC,EAAI5/C,EAAGi8B,EAC3B73B,EAAI9E,KACJod,EAAUtY,EAAe,YACzBy7C,EAAKJ,EAAK,GAAI/iC,GAASA,EAAa,KACpCojC,EAAKF,EAAK,GAAIljC,GAAQ,GACtBshC,EAAK55C,EAAK,EACVgK,EAAI,GAAIsO,GAAQojC,EAGpB,KAAM9B,EAEF,MAAO55C,GAAEsE,UAkCb,KA/BA2T,EAAIjO,EAAK,EAAIuvC,EAAeK,GAAM55C,EAAK,EAAI,EAC3CgK,EAAK,EAAE,GAAKwuC,EAAS,IAAM58C,EAAIqc,EAAIigC,GAAY,EAAIA,EAAUt8C,EAAIA,IAGpD,MAARw/C,MAGK7/C,EAAK,GAAI2O,EAAI,GAAIoO,GAAQ8iC,IAAW,IAGrCzC,EAAazuC,EAAO,IAAEuxC,GAAM,IAAMvxC,EAAK,IAGrCoO,EAAgB,QAAKyhC,EAAW7vC,EAAK,EAAIguC,GAAYhuC,EAAK,EAAE/K,OAAS,KAIpE05C,EAAmBvgC,EAAS,kBAAmB8iC,EAAM,aAAc,KAGhEA,EAAOlxC,GAAS,IAAEF,GAAK,KAGlCoxC,EAAOnjC,EAAI,EAAIjO,EAAIyxC,GAGvBpC,GAAW,EACXnvC,EAAI,GAAIoO,GAAS2/B,EAAoB2B,IACrCh+C,EAAI0c,EAAmB,UACvBA,EAAmB,UAAIL,EAAI2hC,EAAGz6C,OAAS+4C,EAAU,EAG7CrgB,EAAI/F,EAAK5nB,EAAGF,EAAG,EAAG,EAAG,GACrBsxC,EAAKD,EAAS,KAAGxjB,EAAS,MAAE6jB,IAEJ,GAAnBJ,EAAQ,IAAEF,IAIfC,EAAKK,EACLA,EAAKJ,EAELG,EAAKD,EAAS,KAAG3jB,EAAS,MAAGyjB,EAAKG,IAClCD,EAAKF,EAELtxC,EAAIE,EAAS,MAAG2tB,EAAS,MAAGyjB,EAAKtxC,IACjCE,EAAIoxC,CAiBR,OAdAA,GAAKxpB,EAAKspB,EAAY,MAAEC,GAAKK,EAAI,EAAG,EAAG,GACvCF,EAAKA,EAAS,KAAGF,EAAU,MAAEG,IAC7BJ,EAAKA,EAAS,KAAGC,EAAU,MAAEI,IAC7BF,EAAM,EAAIC,EAAM,EAAIz7C,EAAK,EAGzBu7C,EAAOzpB,EAAK2pB,EAAIC,EAAIzjC,EAAG,GAAW,MAAEjY,GAAQ,MAAS,IAC9C8xB,EAAK0pB,EAAIH,EAAIpjC,EAAG,GAAW,MAAEjY,GAAQ,OAAQ,GAC9Cy7C,EAAK,GAAIC,EAAK,KACdF,EAAK,GAAIH,EAAK,IAEpBhC,GAAW,EACX/gC,EAAmB,UAAI1c,EAEhB2/C,GA2BX3xC,EAAa,UAAI,SAAWM,EAAGmuC,GAC3B,GAAIr4C,GAAI9E,KACJod,EAAUtY,EAAe,WAuC7B,OArCAA,GAAI,GAAIsY,GAAQtY,GAEN,MAALkK,GACDA,EAAI,GAAIoO,GAASA,EAAa,KAC9B+/B,EAAK//B,EAAkB,WAEvB/c,EAAK,GACL2O,EAAI,GAAIoO,GAAQpO,GAChBmuC,EAAKI,EAASz4C,EAAGq4C,EAAI,cAIpBnuC,EAAK,EAGDlK,EAAK,IAEDkK,EAAK,EAAE,IACRmvC,GAAW,EACXr5C,EAAI8xB,EAAK9xB,EAAGkK,EAAG,EAAQ,EAALmuC,GAAU,EAAG,EAAG,EAAG,GAAGA,GAAMA,EAAI,GAAW,MAAEnuC,GAC/DmvC,GAAW,EACXC,EAAIt5C,IAEJA,EAAK,GAAMA,EAAK,EAAI,IAKpBA,EAAK,IAGRkK,EAAK,IACNA,EAAK,EAAIlK,EAAK,GAElBA,EAAIkK,GAGDlK,GAQX4J,EAAY,SAAI,WACZ,GAAI5J,GAAI9E,IAGR,QAAQ8E,IAAOA,EAAK,EAAI,EAAIA,EAAK,EAAI6iB,EAAAA,IAmDzCjZ,EAAW,QAAIA,EAAO,IAAI,SAAWU,EAAG0J,GACpC,GAAI5J,GAAG6N,EAAG/N,EAAG1I,EACTxB,EAAI9E,KACJod,EAAUtY,EAAe,YACzBqS,EAAIrS,EAAK,EACT27C,GAAQpgD,EAAK,KAAI+O,EAAI,GAAIgO,GAAShO,EAAG0J,KACrCpV,EAAS,EAAL+8C,GAAUA,EAAKA,EACnB3C,EAAK1gC,EAAmB,UACxB+/B,EAAK//B,EAAkB,QAG3B,KAAMtY,EAAK,IAAMsK,EAAK,IAAOJ,GAAKlK,EAAK,EAAE,MAASsK,EAAK,EAAE,GAGrD,MAAO,IAAIgO,GAASkgC,EAAStuC,EAAQ,EAAJmI,GAASrS,EAAG27C,GAOjD,IAJA37C,EAAI,GAAIsY,GAAQtY,GAChBoK,EAAIpK,EAAK,EAAEb,QAGLa,EAAK,GAAKA,EAAK,EAAE,IAAMA,EAAK,GAAU,GAALoK,EAEnC,MAAOpK,EAMX,IAHAgU,EAAI1J,EAAK,EAAEnL,OAAS,EAGdmL,EAAK,GAAKA,EAAK,EAAE,IAAMA,EAAK,GAAM0J,EAOpC,GAJAiE,EAAI8hC,EAAWzvC,EAAK,EAAI4tC,GACxBhuC,EAAI+N,GAAKjE,GAGH9J,GAAS,EAAJmI,EACP7Q,EAAI,GAAI8W,GAAQuK,EAAAA,OACb,CAMH,GAAK3Y,GAAuBowC,EAAlBlwC,EAAI8tC,EAAUt5C,GAGpB,GAFA4C,EAAIi4C,EAAQnhC,EAAStY,EAAGpB,GAEnB0L,EAAK,EAAI,EAEV,MAAOgO,GAAa,IAAO,IAAE9W,OAE9B,CAqBH,GAlBA6Q,EAAQ,EAAJA,GAAsC,EAA7B/H,EAAK,EAAGhH,KAAKpG,IAAK+a,EAAGjE,IAAY,GAAK,EAEnDA,EAAIwkC,GAAUx4C,EAAG27C,GAQjB1jC,EAAS,GAALjE,GAAWyhB,SAASzhB,GAGpB,GAAIsE,GAAStE,EAAI,IAAQ,EAFzB+lC,EAAW4B,GAAOr4C,KAAK0F,IAAK,KAAOivC,EAAqBj4C,EAAK,IAC7DsD,KAAK2F,KAAOjJ,EAAK,EAAI,IAMpBiY,EAAIK,EAAc,KAAI,GAAKL,EAAIK,EAAc,KAAI,EAElD,MAAO,IAAIA,GAASL,EAAI,EAAI5F,EAAI,EAAI,EAGxCgnC,IAAW,EACX/gC,EAAkB,SAAItY,EAAK,EAAI,EAS/BpB,EAAI0E,KAAKlG,IAAK,IAAM6a,EAAI,IAAK9Y,QAG7BqC,EAAIkiB,EAAKpZ,EAAS,MAAG2nB,EAAIjyB,EAAGg5C,EAAKp6C,IAAOo6C,GAGxCx3C,EAAI83C,EAAK93C,EAAGw3C,EAAK,EAAG,GAMfZ,EAAqB52C,EAAK,EAAGw3C,EAAIX,KAClCpgC,EAAI+gC,EAAK,GAGTx3C,EAAI83C,EAAK51B,EAAKpZ,EAAS,MAAG2nB,EAAIjyB,EAAGiY,EAAIrZ,IAAOqZ,GAAKA,EAAI,EAAG,IAMlDggC,EAAqBz2C,EAAK,GAAI8Y,MAAO0+B,EAAK,EAAGA,EAAK,IAAO,GAAK,OAChEx3C,EAAI83C,EAAK93C,EAAGw3C,EAAK,EAAG,KAI5Bx3C,EAAK,EAAI6Q,EACTgnC,GAAW,EACX/gC,EAAkB,SAAI+/B,EAG1B72C,EAAI83C,EAAK93C,EAAGw3C,EAAIX,OAzFpB72C,GAAI83C,EAAKt5C,EAAGg5C,EAAIX,EA6FpB,OAAO72C,IAuBXoI,EAAe,YAAI,SAAWuvC,EAAId,GAC9B,GAAIr4C,GAAI9E,IAER,OAAa,OAANi+C,GAAcL,EAAU94C,EAAGm5C,EAAI,cAAe,IAAOn5C,EAAK,EAC7DgE,EAAQhE,EAAU,IAALm5C,EAAQV,EAASz4C,EAAGq4C,EAAI,eAAiB,GACtDr4C,EAAEsE,YAiBVsF,EAAuB,oBAAIA,EAAQ,KAAI,SAAWI,EAAGquC,GACjD,GAAIr4C,GAAI9E,KACJod,EAAUtY,EAAe,WAI7B,OAFAA,GAAI,GAAIsY,GAAQtY,GAEJ,MAALgK,GAAc8uC,EAAU94C,EAAGgK,EAAG,OAAQ,GAEzCsvC,EAAKt5C,EAAO,EAAJgK,EAAOyuC,EAASz4C,EAAGq4C,EAAI,SAD/BiB,EAAKt5C,EAAGsY,EAAmB,UAAGA,EAAkB,WAiBvD1O,EAAY,SAAI,SAAUoK,GACvB,GAAI/J,GAAGrH,EAAKquC,EACRjxC,EAAI9E,KACJod,EAAUtY,EAAe,YACzBgxC,EAAKhxC,EAAK,CAGd,IAAY,OAAPgxC,EACDpuC,EAAM5C,EAAK,EAAI,WAAa,UAGzB,CAAA,GAAKgU,IAAM/J,IAAO+mC,GAAM14B,EAAkB,UAAK04B,GAAM14B,EAAkB,UAE1E,MAAOtU,GAAQhE,EAAG,KAAMsY,EAAkB,SAAG,EAK7C,IAHA1V,EAAMq1C,EAAqBj4C,EAAK,GAGtB,EAALgxC,EAAS,CAGV,OAAUA,EAAIpuC,EAAM,IAAMA,GAC1BA,EAAM,KAAOA,MAGV,IAAKquC,EAAOruC,EAAIzD,OAAQ6xC,EAAK,EAEhC,KAAOA,EAAKC,EAGR,IAAMD,GAAMC,EAAMD,IAAOpuC,GAAO,SAEnBquC,GAALD,IACRpuC,EAAMA,EAAI0X,MAAO,EAAG02B,GAAO,IAAMpuC,EAAI0X,MAAM02B,QAO/C,IAFA/mC,EAAIrH,EAAIX,OAAO,GAEVgvC,EAAO,EACRruC,EAAMqH,EAAI,IAAMrH,EAAI0X,MAAM,OAGvB,IAAU,KAALrQ,EAER,MAAOA,EAIf,IAAU,MAAL+J,EAED,IAAQ2kC,IAAgB3kC,GAAK,GAAS,GAAJA,KAC9BA,IAAU,EAAJA,IAAWsE,EAAgB,OAYjCugC,EAAmBvgC,EAAS,OAAQtE,EAAG,WAAY,OARnD,IAHApR,EAAMq3C,EAAa3hC,EAAS1V,EAAS,EAAJoR,EAAO,GAAIhU,EAAK,GAGrC,KAAP4C,EAED,MAAOA,GAWvB,MAAO5C,GAAK,EAAI,EAAI,IAAM4C,EAAMA,GAQpCgH,EAAa,UAAIA,EAAS,MAAI,WAE1B,MAAO0vC,GAAK,GAAIp+C,MAAkB,YAAEA,MAAOA,KAAQ,EAAI,EAAG,IAU9D0O,EAAW,QAAIA,EAAU,OAAI,WAEzB,MAAO1O,MAAKoJ,YAuKhB21C,EAAc,WAOV,QAAS2B,GAAWh5C,EAAKi5C,EAAQC,GAO7B,IANA,GAAI18C,GAEA+xC,EADAD,GAAO,GAEPtyC,EAAI,EACJqyC,EAAOruC,EAAIzD,OAEH8xC,EAAJryC,GAAY,CAChB,IAAMuyC,EAAOD,EAAI/xC,OAAQgyC,IAAQD,EAAIC,IAAS0K,GAG9C,IAFA3K,EAAK9xC,EAAI,IAAOg7C,EAASt8C,QAAS8E,EAAIX,OAAQrD,MAEtCQ,EAAI8xC,EAAI/xC,OAAQC,IAEf8xC,EAAI9xC,GAAK08C,EAAU,IAED,MAAd5K,EAAI9xC,EAAI,KACT8xC,EAAI9xC,EAAI,GAAK,GAEjB8xC,EAAI9xC,EAAI,IAAM8xC,EAAI9xC,GAAK08C,EAAU,EACjC5K,EAAI9xC,IAAM08C,GAKtB,MAAO5K,GAAIE,UAGf,MAAO,UAAW94B,EAAS1V,EAAKk5C,EAASD,EAAQr2C,GAC7C,GAAIyS,GAAG7Y,EAAGoC,EAAGxB,EAAG45C,EAAItvC,EAChB1L,EAAIgE,EAAI9E,QAAS,KACjBk7C,EAAK1gC,EAAmB,UACxB+/B,EAAK//B,EAAkB,QA0B3B,KAxBc,GAATujC,IACDj5C,EAAMA,EAAI81B,eAIT95B,GAAK,IACNgE,EAAMA,EAAIyiC,QAAS,IAAK,IACxB/6B,EAAI,GAAIgO,GAAQujC,GAChB77C,EAAIy5C,EAAQnhC,EAAShO,EAAG1H,EAAIzD,OAASP,GAOrC0L,EAAK,EAAIsxC,EAAW57C,EAAEg3B,UAAW,GAAI8kB,GACrCxxC,EAAK,EAAIA,EAAK,EAAEnL,QAIpBy6C,EAAKgC,EAAWh5C,EAAKi5C,EAAQC,GAC7B7jC,EAAI7Y,EAAIw6C,EAAGz6C,OAGQ,GAAXy6C,IAAKx6C,GAASw6C,EAAGhd,OAEzB,IAAMgd,EAAG,GAEL,MAAO,GAsBX,IAnBS,EAAJh7C,EACDqZ,KAEAjY,EAAK,EAAI45C,EACT55C,EAAK,EAAIiY,EAGTjY,EAAK,EAAIwF,EACTxF,EAAI8xB,EAAK9xB,EAAGsK,EAAG0uC,EAAIX,EAAI,EAAGyD,GAC1BlC,EAAK55C,EAAK,EACVwB,EAAIxB,EAAK,EACTiY,EAAIjY,EAAK,GAIbpB,EAAIg7C,EAAGZ,GACP55C,EAAI08C,EAAU,EACdt6C,EAAIA,GAAmB,MAAdo4C,EAAGZ,EAAK,GAEP,EAALX,GACM,MAALz5C,GAAa4C,KAAe,GAAN62C,GAAWA,IAAQr4C,EAAK,EAAI,EAAI,EAAI,IAC5DpB,EAAIQ,GAAKR,GAAKQ,IAAa,GAANi5C,GAAW72C,GAAW,GAAN62C,GAAwB,EAAbuB,EAAGZ,EAAK,IACxDX,IAAQr4C,EAAK,EAAI,EAAI,EAAI,IAKzB,IAHA45C,EAAGz6C,OAAS65C,IAGJ8C,IAAWlC,IAAKZ,GAAM8C,GAC1BlC,EAAGZ,GAAM,EAEHA,MACA/gC,EACF2hC,EAAG3P,QAAQ,QAInB2P,GAAGz6C,OAAS65C,CAIhB,KAAM55C,EAAIw6C,EAAGz6C,QAASy6C,IAAKx6C,KAG3B,IAAMR,EAAI,EAAGgE,EAAM,GAASxD,GAALR,EAAQgE,GAAOw3C,EAASn4C,OAAQ23C,EAAGh7C,OAG1D,GAAS,EAAJqZ,EAAQ,CAGT,OAAUA,EAAGrV,EAAM,IAAMA,GAEzBA,EAAM,KAAOA,MAMb,IAFAhE,EAAIgE,EAAIzD,SAED8Y,EAAIrZ,EAGP,IAAMqZ,GAAKrZ,EAAGqZ,IAAMrV,GAAO,SAEfhE,GAAJqZ,IACRrV,EAAMA,EAAI0X,MAAO,EAAGrC,GAAM,IAAMrV,EAAI0X,MAAMrC,GAKlD,OAAOrV,MAQf,IAAIkvB,GAAM,WAGN,QAASiqB,GAAiB/7C,EAAGwJ,EAAGhB,GAC5B,GAAI6R,GACA2hC,EAAQ,EACRp9C,EAAIoB,EAAEb,MAEV,KAAMa,EAAIA,EAAEsa,QAAS1b,KACjByb,EAAOra,EAAEpB,GAAK4K,EAAIwyC,EAClBh8C,EAAEpB,GAAKyb,EAAO7R,EAAO,EACrBwzC,EAAQ3hC,EAAO7R,EAAO,CAO1B,OAJIwzC,IACAh8C,EAAEiqC,QAAQ+R,GAGPh8C,EAGX,QAASsmB,GAASlc,EAAG4J,EAAGioC,EAAIC,GACxB,GAAIt9C,GAAGq4B,CAEP,IAAKglB,GAAMC,EACPjlB,EAAMglB,EAAKC,EAAK,EAAI,OAGpB,KAAMt9C,EAAIq4B,EAAM,EAAOglB,EAAJr9C,EAAQA,IAEvB,GAAKwL,EAAExL,IAAMoV,EAAEpV,GAAK,CAChBq4B,EAAM7sB,EAAExL,GAAKoV,EAAEpV,GAAK,EAAI,EAExB,OAKZ,MAAOq4B,GAGX,QAAS7S,GAAUha,EAAG4J,EAAGioC,EAAIzzC,GAIzB,IAHA,GAAI5J,GAAI,EAGAq9C,KACJ7xC,EAAE6xC,IAAOr9C,EACTA,EAAIwL,EAAE6xC,GAAMjoC,EAAEioC,GAAM,EAAI,EACxB7xC,EAAE6xC,GAAMr9C,EAAI4J,EAAO4B,EAAE6xC,GAAMjoC,EAAEioC,EAIjC,OAAS7xC,EAAE,IAAMA,EAAEjL,OAAS,EAAGiL,EAAE0vB,UAIrC,MAAO,UAAW95B,EAAGsK,EAAG0uC,EAAIX,EAAIzF,EAAIpqC,GAChC,GAAIyuB,GAAKhf,EAAGrZ,EAAGu9C,EAAS3C,EAAMtvC,EAAG0c,EAAMw1B,EAAOvkB,EAAGwkB,EAAIC,EAAKC,EAAMC,EAAM3qB,EAAG4qB,EAAIC,EAAIC,EAC7EC,EAAIC,EACJvkC,EAAUtY,EAAe,YACzBqS,EAAIrS,EAAK,GAAKsK,EAAK,EAAI,EAAI,GAC3BsvC,EAAK55C,EAAK,EACVu6C,EAAKjwC,EAAK,CAGd,MAAMsvC,GAAOA,EAAG,IAAOW,GAAOA,EAAG,IAE7B,MAAO,IAAIjiC,GAGRtY,EAAK,GAAMsK,EAAK,IAAOsvC,GAAKW,GAAMX,EAAG,IAAMW,EAAG,GAAMA,GAGnDX,GAAe,GAATA,EAAG,KAAYW,EAAS,EAAJloC,EAAQA,EAAI,EAHoBwQ,EAAAA,EAuBlE,KAhBIra,GACA2zC,EAAU,EACVlkC,EAAIjY,EAAK,EAAIsK,EAAK,IAElB9B,EAAOwxC,EACPmC,EAAUjE,EACVjgC,EAAI8hC,EAAW/5C,EAAK,EAAIm8C,GAAYpC,EAAWzvC,EAAK,EAAI6xC,IAG5DS,EAAKrC,EAAGp7C,OACRu9C,EAAK9C,EAAGz6C,OACR04B,EAAI,GAAIvf,GAAQjG,GAChBgqC,EAAKxkB,EAAK,KAIJj5B,EAAI,EAAG27C,EAAG37C,KAAQg7C,EAAGh7C,IAAM,GAAKA,KAetC,GAbK27C,EAAG37C,IAAOg7C,EAAGh7C,IAAM,IACpBqZ,IAGO,MAAN+gC,GACD3mC,EAAI2mC,EAAK1gC,EAAmB,UAC5B+/B,EAAK//B,EAAkB,UAEvBjG,EADOugC,EACHoG,GAAOh5C,EAAK,EAAIsK,EAAK,GAAM,EAE3B0uC,EAGC,EAAJ3mC,EACDgqC,EAAGr+C,KAAK,GACRw7C,GAAO,MACJ,CAOH,GAJAnnC,EAAIA,EAAI8pC,EAAU,EAAI,EACtBv9C,EAAI,EAGO,GAANg+C,EAAU,CAMX,IALA1yC,EAAI,EACJqwC,EAAKA,EAAG,GACRloC,KAGcqqC,EAAJ99C,GAAUsL,IAAOmI,IAAKzT,IAC5BizB,EAAI3nB,EAAI1B,GAASoxC,EAAGh7C,IAAM,GAC1By9C,EAAGz9C,GAAKizB,EAAI0oB,EAAK,EACjBrwC,EAAI2nB,EAAI0oB,EAAK,CAGjBf,GAAOtvC,GAASwyC,EAAJ99C,MAGT,CAiBH,IAdAsL,EAAI1B,GAAS+xC,EAAG,GAAK,GAAM,EAEtBrwC,EAAI,IACLqwC,EAAKwB,EAAiBxB,EAAIrwC,EAAG1B,GAC7BoxC,EAAKmC,EAAiBnC,EAAI1vC,EAAG1B,GAC7Bo0C,EAAKrC,EAAGp7C,OACRu9C,EAAK9C,EAAGz6C,QAGZs9C,EAAKG,EACLN,EAAM1C,EAAGt/B,MAAO,EAAGsiC,GACnBL,EAAOD,EAAIn9C,OAGIy9C,EAAPL,EAAWD,EAAIC,KAAU,GAEjCM,EAAKtC,EAAGjgC,QACRuiC,EAAG5S,QAAQ,GACX0S,EAAMpC,EAAG,GAEJA,EAAG,IAAM/xC,EAAO,GACjBm0C,GAGJ,GACIzyC,GAAI,EAGJ+sB,EAAM3Q,EAASi0B,EAAI+B,EAAKM,EAAIL,GAGjB,EAANtlB,GAGDulB,EAAOF,EAAI,GAENM,GAAML,IACPC,EAAOA,EAAOh0C,GAAS8zC,EAAI,IAAM,IAIrCpyC,EAAIsyC,EAAOG,EAAM,EAYZzyC,EAAI,GAEAA,GAAK1B,IACN0B,EAAI1B,EAAO,GAIfoe,EAAOm1B,EAAiBxB,EAAIrwC,EAAG1B,GAC/B4zC,EAAQx1B,EAAKznB,OACbo9C,EAAOD,EAAIn9C,OAGX83B,EAAM3Q,EAASM,EAAM01B,EAAKF,EAAOG,GAGrB,GAAPtlB,IACD/sB,IAGAka,EAAUwC,EAAWw1B,EAALQ,EAAaC,EAAKtC,EAAI6B,EAAO5zC,MAOvC,GAAL0B,IACD+sB,EAAM/sB,EAAI,GAEd0c,EAAO2zB,EAAGjgC,SAEd8hC,EAAQx1B,EAAKznB,OAEAo9C,EAARH,GACDx1B,EAAKqjB,QAAQ,GAIjB7lB,EAAUk4B,EAAK11B,EAAM21B,EAAM/zC,GAGf,IAAPyuB,IACDslB,EAAOD,EAAIn9C,OAGX83B,EAAM3Q,EAASi0B,EAAI+B,EAAKM,EAAIL,GAGjB,EAANtlB,IACD/sB,IAGAka,EAAUk4B,EAAUC,EAALK,EAAYC,EAAKtC,EAAIgC,EAAM/zC,KAIlD+zC,EAAOD,EAAIn9C,QAEK,IAAR83B,IACR/sB,IACAoyC,GAAO,IAIXD,EAAGz9C,KAAOsL,EAGL+sB,GAAOqlB,EAAI,GACZA,EAAIC,KAAU3C,EAAG6C,IAAO,GAExBH,GAAQ1C,EAAG6C,IACXF,EAAO,UAGHE,IAAOC,GAAgB,MAAVJ,EAAI,KAAgBjqC,IAE7CmnC,GAAiB,MAAV8C,EAAI,GAITD,EAAG,IACLA,EAAGviB,QAKX,GAAgB,GAAXqiB,EACDtkB,EAAK,EAAI5f,EACT4f,EAAK,GAAK2hB,MACP,CAGH,IAAM56C,EAAI,EAAGyT,EAAIgqC,EAAG,GAAIhqC,GAAK,GAAIA,GAAK,GAAIzT,KAC1Ci5B,EAAK,EAAIj5B,EAAIqZ,EAAIkkC,EAAU,EAE3B7C,EAAKzhB,EAAG+a,EAAKoG,EAAKnhB,EAAK,EAAI,EAAImhB,EAAIX,EAAImB,GAG3C,MAAO3hB,MAyoBfqiB,GAAU,WA+GN,QAASp+C,GAAO6J,GACZ,GAAI/J,GAAGqO,EAAGgf,EACN3Q,EAAUpd,KACVS,EAAI,SACJgH,EAAQ2V,EAAgB,OAAIsgC,SAAW9zC,UAE3C,OAAKa,IAAOsE,GAAmB,gBAAPtE,KAErBkzC,EAAmBvgC,EAAS,kBAAmB3S,EAAKhK,GAE5C2c,IAIJ2Q,EAAItjB,EAAK/J,EAAI,eAAmBqO,KAE3B0uC,EAAiB,EAAJ1vB,GAASA,EAAI8vB,IAAgBp2C,EAAMsmB,IAAMA,EAM1D4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAS,EAAJqtB,IAUdA,EAAItjB,EAAK/J,EAAI,cAAkBqO,KAE1B0uC,EAAiB,EAAJ1vB,GAASA,EAAI,IAAOtmB,EAAMsmB,IAAMA,EAMjD4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAS,EAAJqtB,IAUdA,EAAItjB,EAAK/J,EAAI,cAAkBqO,KAE1B0uC,GAAkB0B,EAALpxB,GAAkBA,EAAI,IAAOtmB,EAAMsmB,IAAMA,EAM1D4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAKm+C,EAAU9wB,KAUxBA,EAAItjB,EAAK/J,EAAI,cAAkBqO,KAE1B0uC,EAAiB,EAAJ1vB,GAASA,EAAIoxB,IAAe13C,EAAMsmB,IAAMA,EAMzD4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAKm+C,EAAU9wB,KAUxBA,EAAItjB,EAAK/J,EAAI,UAAcqO,KAEtB0uC,GAAkB0B,EAALpxB,GAAkBA,EAAI,IAAOtmB,EAAMsmB,IAAMA,EAM1D4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAKm+C,EAAU9wB,KAUxBA,EAAItjB,EAAK/J,EAAI,UAAcqO,KAEtB0uC,EAAiB,EAAJ1vB,GAASA,EAAIoxB,IAAe13C,EAAMsmB,IAAMA,EAMzD4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAKm+C,EAAU9wB,KAUxBA,EAAItjB,EAAK/J,EAAI,YAAgBqO,IAE3Bgf,MAAQA,GAAW,IAANA,GAAiB,IAANA,GACzB0vB,EAAap9C,EAAK,EAClB+c,EAAQ1c,KAAOqtB,GAIf4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,KAKtCstB,EAAItjB,EAAK/J,EAAI,YAAgBqO,IAE3Bgf,MAAQA,GAAW,IAANA,GAAiB,IAANA,EACzB3Q,EAAQ1c,MAASqtB,IAAKkxB,GAA2B,gBAAVA,IAIvCtB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,KAKtCstB,EAAItjB,EAAK/J,EAAI,YAAgBqO,KAExB0uC,EAAiB,EAAJ1vB,GAASA,EAAI,IAAOtmB,EAAMsmB,IAAMA,EAMjD4vB,EAAmBvgC,EAAS1c,EAAGqtB,EAAGttB,EAAG,GALrC2c,EAAQ1c,GAAS,EAAJqtB,IAUdtjB,EAAMA,EAAK/J,EAAI,YAAgBqO,IAEf,gBAAPtE,GACR2S,EAAQ1c,GAAK+J,EAIbkzC,EAAmBvgC,EAAS,yBAA0B3S,EAAKhK,IAI5D2c,GAmBX,QAASoL,GAAIxZ,GAAK,MAAO,IAAIhP,MAAKgP,GAAQ,MAkB1C,QAAS+nB,GAAG/nB,GAAK,MAAO,IAAIhP,MAAKgP,GAAO,KAaxC,QAASlB,GAAKhJ,EAAGsK,GAAM,MAAO,IAAIpP,MAAK8E,GAAQ,IAAEsK,GAMjD,QAASwyC,GAAUxkC,EAAS5Y,EAAMq9C,GAC9B,GAAIrhD,GAAGwO,EACHtL,EAAI,CAQR,KANiC,kBAA5B0F,EAAS7I,KAAMiE,EAAK,MACrBA,EAAOA,EAAK,IAGhBhE,EAAI,GAAI4c,GAAS5Y,EAAK,MAEZd,EAAIc,EAAKP,QAAU,CAGzB,GAFA+K,EAAI,GAAIoO,GAAS5Y,EAAKd,KAEhBsL,EAAK,EAAI,CACXxO,EAAIwO,CAEJ,OACQxO,EAAEqhD,GAAM7yC,KAChBxO,EAAIwO,GAIZ,MAAOxO,GAUX,QAASwB,KAAQ,MAAO4/C,GAAU5hD,KAAMkG,UAAW,MASnD,QAAShE,KAAQ,MAAO0/C,GAAU5hD,KAAMkG,UAAW,MAyNnD,QAASgD,GAAKpE,EAAGsK,GAAM,MAAO,IAAIpP,MAAK8E,GAAQ,IAAEsK,GAWjD,QAAS8b,GAAOwsB,GACZ,GAAIxoC,GAAGF,EAAG+e,EACNrqB,EAAI,EACJ4C,KACA8W,EAAUpd,KACV8hD,EAAO,GAAI1kC,GAASA,EAAa,IAUrC,IARW,MAANs6B,GAAekG,EAAUkE,EAAMpK,EAAI,UAGpCA,GAAM,EAFNA,EAAKt6B,EAAmB,UAK5BpO,EAAI5G,KAAKmC,KAAMmtC,EAAKsF,GAEf5/B,EAAgB,OAGjB,GAAK6hC,GAAUA,EAAwB,gBAInC,IAFA/vC,EAAI+vC,EAAwB,gBAAG,GAAI8C,aAAY/yC,IAEnCA,EAAJtL,GACJqqB,EAAI7e,EAAExL,GAIDqqB,GAAK,MAEN7e,EAAExL,GAAKu7C,EAAwB,gBAAG,GAAI8C,aAAY,IAAK,GAKvDz7C,EAAE5C,KAAOqqB,EAAI,QAKlB,IAAKkxB,GAAUA,EAAoB,YAAI,CAK1C,IAFA/vC,EAAI+vC,EAAoB,YAAGjwC,GAAK,GAEpBA,EAAJtL,GAGJqqB,EAAI7e,EAAExL,IAAOwL,EAAExL,EAAI,IAAM,IAAQwL,EAAExL,EAAI,IAAM,MAC1B,IAAXwL,EAAExL,EAAI,KAAe,IAGxBqqB,GAAK,MACNkxB,EAAoB,YAAE,GAAG/vB,KAAMhgB,EAAGxL,IAKlC4C,EAAExD,KAAMirB,EAAI,KACZrqB,GAAK,EAGbA,GAAIsL,EAAI,MAGR2uC,GAAmBvgC,EAAS,qBAAsB6hC,EAAQ,SAKlE,KAAKv7C,EAED,KAAYsL,EAAJtL,GACJ4C,EAAE5C,KAAuB,IAAhB0E,KAAK8iB,SAAiB,CAcvC,KAVAlc,EAAI1I,IAAI5C,GACRg0C,GAAMsF,EAGDhuC,GAAK0oC,IACN3pB,EAAIuvB,EAAS,GAAIN,EAAUtF,GAC3BpxC,EAAE5C,IAAOsL,EAAI+e,EAAI,GAAMA,GAIV,IAATznB,EAAE5C,GAAUA,IAChB4C,EAAEo7B,KAIN,IAAS,EAAJh+B,EACD4C,GAAM0I,EAAI,OACP,CAIH,IAHAA,EAAI,GAGa,IAAT1I,EAAE,IACNA,EAAEs4B,QACF5vB,GAAKguC,CAIT,KAAMt5C,EAAI,EAAGqqB,EAAIznB,EAAE,GAAIynB,GAAK,IACxBA,GAAK,GACLrqB,GAIKs5C,GAAJt5C,IACDsL,GAAKguC,EAAUt5C,GAOvB,MAHAo+C,GAAQ,EAAI9yC,EACZ8yC,EAAQ,EAAIx7C,EAELw7C,EAkCX,QAASr5C,GAAKuG,GAAK,MAAO,IAAIhP,MAAKgP,GAAS,OAyB5C,QAASgzC,GAAev3C,GAUpB,QAAS2S,GAASpO,EAAG8J,GACjB,GAAIhU,GAAI9E,IAGR,MAAQ8E,YAAasY,IAGjB,MAFAugC,GAAmBvgC,EAAS,6BAA8BpO,GAEnD,GAAIoO,GAASpO,EAAG8J,EAQ3B,IAHAhU,EAAe,YAAIsY,EAGdpO,YAAaoO,GAAU,CAExB,GAAU,MAALtE,EAMD,MALAzY,GAAK,EACLyE,EAAK,EAAIkK,EAAK,EACdlK,EAAK,EAAIkK,EAAK,EACdlK,EAAK,GAAMkK,EAAIA,EAAK,GAAMA,EAAEoQ,QAAUpQ,EAE/BlK,CACJ,IAAU,IAALgU,EAER,MAAOslC,GAAK,GAAIhhC,GAAQpO,GAAIoO,EAAmB,UAAGA,EAAkB,SAEpEpO,IAAK,GAIb,MAAOizC,GAAc7kC,EAAStY,EAAGkK,EAAG8J,GAiJxC,MAjIAsE,GAAmB,UAAI,GAmBvBA,EAAkB,SAAI,EAoBtBA,EAAgB,OAAI,EAIpBA,EAAkB,SAAI,GAItBA,EAAkB,SAAI,GAItBA,EAAc,MAAK+hC,EAInB/hC,EAAc,KAAI+hC,EAGlB/hC,EAAgB,QAAI,EAGpBA,EAAgB,QAAI,EAGpBA,EAAQtU,QACJo5C,iBAAkB,IAClBtC,eAAgB,IAChBuC,UAAW,EACXC,mBAAoB,EACpBC,uBAAwB,IACxBC,kBAAmB,GAOvBllC,EAAQ7U,UAAYmG,EAEpB0O,EAAa,IAAI,GAAIA,GAAQ,GAS7BA,EAAkB,SAAI,EACtBA,EAAoB,WAAI,EACxBA,EAAoB,WAAI,EACxBA,EAAqB,YAAI,EACzBA,EAAuB,cAAI,EAC3BA,EAAyB,gBAAI,EAC7BA,EAAyB,gBAAI,EAC7BA,EAAyB,gBAAI,EAC7BA,EAA0B,iBAAI,EAG9BA,EAAgB,OAAI,EAepBA,EAAgB,OAAIxc,EACpBwc,EAAqB,YAAI4kC,EACzB5kC,EAAa,IAAIoL,EACjBpL,EAAY,GAAI2Z,EAChB3Z,EAAa,IAAItP,EACjBsP,EAAa,IAAIpb,EACjBob,EAAa,IAAIlb,EACjBkb,EAAa,IAAIlU,EACjBkU,EAAc,KAAI3U,EAClB2U,EAAgB,OAAI8N,EAER,MAAPzgB,GACD2S,EAAgB,OAAE3S,GAGf2S,EAzkBX,GAAI6kC,GAAe,WACf,GAAIM,GAAU,uCACVC,EAAOzkB,OAAOx1B,UAAUi6C,MACtB,WAAc,MAAOxiD,MAAKmqC,QAAQ,aAAc,IAEtD,OAAO,UAAW/sB,EAAStY,EAAGkK,EAAG8J,GAC7B,GAAIhK,GAAGiO,EAAGrZ,EAAG++C,EAAOC,EAAM/gC,CAU1B,IARiB,gBAAL3S,KAGRA,GAAMyzC,EAAoB,gBAALzzC,IAAqC,mBAApB5F,EAAS7I,KAAKyO,KAC1C,IAANA,GAAmB,EAAR,EAAIA,EAAQ,KAAOA,EAAI,IAE1C0zC,EAAO1zC,EAEG,MAAL8J,GAAaypC,EAAQ9vB,KAAKzjB,GAG3BlK,EAAK,EAAwB,KAApBkK,EAAEiuC,WAAW,IAAcjuC,EAAIA,EAAEoQ,MAAM,GAAI,IAAO,MAGxD,CAMH,GAAU,IAALtG,EAED,MAAOslC,GAAK,GAAIhhC,GAAQpO,GAAIoO,EAAmB,UAAGA,EAAkB,SAoDxE,IAjDApO,EAAIwzC,EAAKjiD,KAAKyO,GAAGm7B,QAAS,WAAY,IAEtCrlC,EAAK,EAAwB,KAApBkK,EAAEiuC,WAAW,IAAcjuC,EAAIA,EAAEm7B,QAAS,UAAW,IAAM,IAAO,EAEjE,MAALrxB,EAEMA,IAAU,EAAJA,IAAWsE,EAAgB,SACnCqgC,IAAgB3kC,GAAK,GAAS,GAAJA,KAiC3B6kC,EAAmBvgC,EAAS,OAAQtE,EAAG,EAAG,GAG1C6I,EAAQ4gC,EAAQ9vB,KAAKzjB,KAnCrBF,EAAI,IAAMowC,EAAS9/B,MAAO,EAAGtG,EAAQ,EAAJA,GAAU,KAG3C9J,EAAIA,EAAEm7B,QAAS,MAAO,IAAKA,QAAS,MAAO,OAGtCxoB,EAAQ,GAAIsrB,QACf,IAAMn+B,EAAI,SAAWA,EAAI,MAAW,GAAJgK,EAAS,IAAM,IAAK2Z,KAAKzjB,KAEnDyzC,IAEKzzC,EAAEm7B,QAAS,YAAa,IAAKlmC,OAAS,IAGvC05C,EAAmBvgC,EAAS,EAAGslC,GAInCD,GAASA,GAEbzzC,EAAI+vC,EAAa3hC,EAASpO,EAAG,GAAI8J,EAAGhU,EAAK,IAE5B,YAALkK,GAAwB,OAALA,IAG3B2uC,EAAmBvgC,EAAS,cAAgBtE,EAAI,UAAW4pC,GAC3D1zC,EAAI,QAYZ2S,EAAQ4gC,EAAQ9vB,KAAKzjB,IAGnB2S,EAkBF,MAfA7c,GAAK,EAAIA,EAAK,EAAI,KAGR,YAALkK,IAGS,OAALA,GAGD2uC,EAAmBvgC,EAAS,eAAgBslC,GAEhD59C,EAAK,EAAI,MAEbzE,EAAK,EAEEyE,EA0Bf,KArBOiY,EAAI/N,EAAEpM,QAAQ,MAAS,KAC1BoM,EAAIA,EAAEm7B,QAAS,IAAK,MAIjBzmC,EAAIsL,EAAEqvB,OAAO,OAAU,GAGjB,EAAJthB,IACDA,EAAIrZ,GAERqZ,IAAM/N,EAAEoQ,MAAO1b,EAAI,GACnBsL,EAAIA,EAAEjH,UAAW,EAAGrE,IAER,EAAJqZ,IAGRA,EAAI/N,EAAE/K,QAIJP,EAAI,EAAuB,KAApBsL,EAAEiuC,WAAWv5C,GAAWA,KAGrC,IAAMoV,EAAI9J,EAAE/K,OAA8B,KAAtB+K,EAAEiuC,aAAankC,KAInC,GAFA9J,EAAIA,EAAEoQ,MAAO1b,EAAGoV,EAAI,GAEb,CAwBH,GAvBAA,EAAI9J,EAAE/K,OAGDw+C,GAAS3pC,EAAI,IAGd6kC,EAAmBvgC,EAAS,EAAGslC,GAGnC59C,EAAK,EAAIiY,EAAIA,EAAIrZ,EAAI,EACrBoB,EAAK,KAMLpB,GAAMqZ,EAAI,GAAMigC,EAEP,EAAJjgC,IACDrZ,GAAKs5C,GAIAlkC,EAAJpV,EAAQ,CAMT,IAJIA,GACAoB,EAAK,EAAEhC,MAAOkM,EAAEoQ,MAAO,EAAG1b,IAGxBoV,GAAKkkC,EAAalkC,EAAJpV,GAChBoB,EAAK,EAAEhC,MAAOkM,EAAEoQ,MAAO1b,EAAGA,GAAKs5C,GAGnChuC,GAAIA,EAAEoQ,MAAM1b,GACZA,EAAIs5C,EAAUhuC,EAAE/K,WAEhBP,IAAKoV,CAGT,MAAQpV,IAAKsL,GAAK,KAElBlK,EAAK,EAAEhC,MAAOkM,GAEVmvC,IAGKr5C,EAAK,EAAIsY,EAAc,KAGxBtY,EAAK,EAAIA,EAAK,EAAI,KAGVA,EAAK,EAAIsY,EAAc,OAG/BtY,EAAK,GAAMA,EAAK,EAAI,SAM5BA,GAAK,GAAMA,EAAK,EAAI,EAIxB,OAFAzE,GAAK,EAEEyE,KAqYf,OAAOk9C,QAULnF,EAAgC,WAC9B,MAAOmC,IACTz+C,KAAKX,EAASM,EAAqBN,EAASC,KAA2C2K,SAAlCqyC,IAAgDh9C,EAAOD,QAAUi9C,KAyB7H78C,OAKE,SAASH,EAAQD,EAASM,GAE/B,YAOA,SAASkvC,GAAiBvpC,GAExB,GAAIwrC,GAAQtT,OAAOl4B,GAAO23B,cAAc6T,MAAM,qCAC9C,KAAKA,EACH,KAAM,IAAIprC,aAAY,iBAGxB,IAAIqE,GAAe+mC,EAAM,GACrBsR,EAAetR,EAAM,GACrBuR,EAAeh5C,WAAWynC,EAAM,IAAM,KAEtCjnB,EAAMu4B,EAAa//C,QAAQ,IAC/BggD,IAAqB,KAARx4B,EAAeA,EAAM,EAAMu4B,EAAa1+C,OAAS,EAE9DjE,KAAKsK,KAAOA,EACZtK,KAAK2iD,aAAeA,EACfxY,QAAQ,IAAK,IACbA,QAAQ,MAAO,SAAUvf,GAGxB,MADAg4B,IAAYh4B,EAAM3mB,OACX,KAERkmC,QAAQ,MAAO,IACftgC,MAAM,IACN9H,IAAI,SAAU+M,GACb,MAAO4uC,UAAS5uC,KAGW,IAA7B9O,KAAK2iD,aAAa1+C,SACpBjE,KAAK2iD,aAAa7/C,KAAK,GACvB8/C,KAGF5iD,KAAK4iD,SAAWA,EA8JlB,QAASh4B,GAAM3mB,GAEb,IAAK,GADD+xC,MACKtyC,EAAI,EAAOO,EAAJP,EAAYA,IAC1BsyC,EAAIlzC,KAAK,EAEX,OAAOkzC,GA3JT5G,EAAgB7mC,UAAUuzB,QAAU,SAAU34B,GAC5C,GAAI0/C,GAAU7iD,KAAK8iD,YAAY9iD,KAAK4iD,SAAW,GAAKz/C,GAAa,IAC7D1C,EAAIoiD,EAAQF,aACZjiD,EAAImiD,EAAQD,SAAW,EAGvBG,EAAKriD,GAAKyC,GAAa,EAgB3B,OAfI1C,GAAEwD,OAAS8+C,IACbtiD,EAAIA,EAAEkB,OAAOipB,EAAMm4B,EAAKtiD,EAAEwD,UAIpB,EAAJvD,IACFD,EAAImqB,GAAOlqB,EAAI,GAAGiB,OAAOlB,GACzBC,EAAI,GAIFyC,GACF1C,EAAEwuB,OAAOvuB,EAAG,EAAU,IAANA,EAAW,KAAO,KAG7BV,KAAKsK,KAAO7J,EAAE8K,KAAK,KAS5B6jC,EAAgB7mC,UAAU+mC,cAAgB,SAAUnsC,GAElD,GAAI0/C,GAAU1/C,EAAYnD,KAAK8iD,YAAY3/C,GAAanD,KAAK2I,QACzDlI,EAAIoiD,EAAQF,aACZ5lC,EAAI8lC,EAAQD,QAGZniD,GAAEwD,OAASd,IACb1C,EAAIA,EAAEkB,OAAOipB,EAAMznB,EAAY1C,EAAEwD,SAInC,IAAI0D,GAAQlH,EAAEm+B,OACd,OAAO5+B,MAAKsK,KAAO3C,GAASlH,EAAEwD,OAAS,EAAK,IAAMxD,EAAE8K,KAAK,IAAO,IAC5D,KAAOwR,GAAK,EAAI,IAAM,IAAMA,GAYlCqyB,EAAgB7mC,UAAU46B,YAAc,SAAShgC,EAAW4F,GAE1D,GAAIqwC,GAASrwC,GAA6ByB,SAAlBzB,EAAQqwC,MAAuBrwC,EAAQqwC,MAAQ,KACnEC,EAAStwC,GAA6ByB,SAAlBzB,EAAQswC,MAAuBtwC,EAAQswC,MAAQ,IAEnElwC,EAAMf,KAAKe,IAAIf,KAAKc,IAAI,GAAIlJ,KAAK4iD,UACrC,IAAUxJ,EAANjwC,GAAeA,GAAOkwC,EAExB,MAAOr5C,MAAKsvC,cAAcnsC,EAG1B,IAAI0/C,GAAU1/C,EAAYnD,KAAK8iD,YAAY3/C,GAAanD,KAAK2I,QACzDlI,EAAIoiD,EAAQF,aACZ5lC,EAAI8lC,EAAQD,QAGZniD,GAAEwD,OAASd,IACb1C,EAAIA,EAAEkB,OAAOipB,EAAMznB,EAAY1C,EAAEwD,UAKnCxD,EAAIA,EAAEkB,OAAOipB,EAAM7N,EAAItc,EAAEwD,OAAS,GAC7BxD,EAAEwD,OAASd,EAAYA,EAAY1C,EAAEwD,OAAS,KAGnDxD,EAAImqB,GAAO7N,GAAGpb,OAAOlB,EAErB,IAAI2pB,GAAMrN,EAAI,EAAIA,EAAI,CAKtB,OAJIqN,GAAM3pB,EAAEwD,OAAS,GACnBxD,EAAEwuB,OAAO7E,EAAM,EAAG,EAAG,KAGhBpqB,KAAKsK,KAAO7J,EAAE8K,KAAK,KAQ9B6jC,EAAgB7mC,UAAUI,MAAQ,WAChC,GAAIA,GAAQ,GAAIymC,GAAgB,IAIhC,OAHAzmC,GAAM2B,KAAOtK,KAAKsK,KAClB3B,EAAMg6C,aAAe3iD,KAAK2iD,aAAavjC,MAAM,GAC7CzW,EAAMi6C,SAAW5iD,KAAK4iD,SACfj6C,GASTymC,EAAgB7mC,UAAUu6C,YAAc,SAAU3/C,GAKhD,IAJA,GAAI0/C,GAAU7iD,KAAK2I,QACflI,EAAIoiD,EAAQF,aAGI,GAAbx/C,GACL1C,EAAEsuC,QAAQ,GACV8T,EAAQD,WACRz/C,GAGF,IAAI1C,EAAEwD,OAASd,EAAW,CACxB,GAAI6/C,GAAUviD,EAAEwuB,OAAO9rB,EAEvB,IAAI6/C,EAAQ,IAAM,EAAG,CACnB,GAAIt/C,GAAIP,EAAY,CAEpB,KADA1C,EAAEiD,KACc,KAATjD,EAAEiD,IACPjD,EAAEihC,MACQ,IAANh+B,IACFjD,EAAEsuC,QAAQ,GACV8T,EAAQD,WACRl/C,KAEFA,IACAjD,EAAEiD,MAKR,MAAOm/C,IAgBThjD,EAAOD,QAAUwvC,GAKZ,SAASvvC,EAAQD,EAASM,GAE/B,YAGAL,GAAOD,SACL8J,KAAK,IAMF,SAAS7J,EAAQD,EAASM,GAE/B,YAwNA,SAASuwC,GAAexvC,GAEtB,IAAK,GADDgiD,GAAahiD,EAAKixC,gBACbxuC,EAAI,EAAGA,EAAI0uC,EAAWnuC,OAAQP,IACrC,GAAIu/C,IAAc7Q,GAAW1uC,GAC3B,MAAOA,EAGX,OAAO,MAYT,QAASquC,GAAkB9wC,GACzB,GAAIgiD,GAAahiD,EAAKixC,gBAClBpwC,EAAQ2uC,EAAcxvC,EAC1B,IAAc,OAAVa,EAEF,MAAO,KAET,IAAIohD,GAAW9Q,EAAWtwC,GAAOmhD,EAEjC,IAAIC,EAASt2C,eAAe,iBAAkB,CAC5C,GAA+B,SAA3Bs2C,EAASpR,cACX,MAAO,MAET,IAA+B,UAA3BoR,EAASpR,cACX,MAAO,OAGT,MAAMrvC,OAAM,IAAOwgD,EAAa,oCAClBC,EAASpR,cAAgB,MAIzC,MAAO,MAWT,QAASY,GAAmByQ,EAAOC,GACjC,GAAIC,GAAcF,EAAMjR,gBACpBoR,EAAcF,EAAMlR,gBACpBpwC,EAAQ2uC,EAAc0S,EAC1B,IAAc,OAAVrhD,EAEF,MAAO,KAET,IAAIohD,GAAW9Q,EAAWtwC,GAAOuhD,EAEjC,IAAIH,EAASt2C,eAAe,oBACpBs2C,EAASK,0BAA2Bz/C,OAAQ,CAClD,IAAK,GAAIJ,GAAI,EAAGA,EAAIw/C,EAASK,gBAAgBt/C,OAAQP,IACnD,GAAIw/C,EAASK,gBAAgB7/C,KAAO4/C,EAClC,OAAO,CAGX,QAAO,EAIT,MAAO,MA7QT,GAAIlR,KAEAtwB,kBACAI,4BAGAM,iBACE6vB,iBAAiB,EACjBW,kBAAkB,EAClBV,aAAa,KAMfkR,mBACE1R,cAAe,OACfyR,sBAKFE,oBACE3R,cAAe,OACfyR,sBAIFG,oBACE5R,cAAe,OACfyR,sBAIFI,sBACE7R,cAAe,OACfyR,sBAIFK,uBACE9R,cAAe,OACfyR,sBAIFM,uBACE/R,cAAe,OACfyR,sBAIFO,sBACEhS,cAAe,OACfyR,oBAEFQ,wBACEjS,cAAe,OACfyR,oBAEFS,wBACElS,cAAe,OACfyR,oBAEFU,uBACEnS,cAAe,OACfyR,oBAEFW,0BACEpS,cAAe,OACfyR,oBAEFY,yBACErS,cAAe,OACfyR,sBAIFa,0BACEtS,cAAe,OACfyR,oBAEFc,gCACEvS,cAAe,OACfyR,oBAEFe,8BACExS,cAAe,OACfyR,sBAIFgB,mBACEzS,cAAe,OACfyR,sBAIFv/B,eAGAwgC,oBACE1S,cAAe,OACfyR,iBAAkB,mBAAoB,0BAExCkB,yBACE3S,cAAe,OACfyR,sBAIFmB,yBACE5S,cAAe,OACfyR,iBACE,wBACA,sBACA,uBACA,uBAGJoB,uBACE7S,cAAe,OACfyR,mBACAlR,iBAAiB,EACjBW,kBAAkB,EAClBV,aAAa,GAKfsS,4BACE9S,cAAe,OACfyR,iBACE,wBACA,sBACA,2BACA,0BAGJsB,0BACE/S,cAAe,OACfyR,oBAEFuB,oBACEhT,cAAe,OACfyR,sBAIFwB,0BACEjT,cAAe,SAEjBkT,2BACElT,cAAe,SAEjBmT,uBACEnT,cAAe,SAEjBoT,oBACEpT,cAAe,WAIjBqT,oBACErT,cAAe,QACfyR,mBACAvQ,kBAAkB,GAKpBoS,uBACEtT,cAAe,QACfyR,sBAIF8B,0BACEvT,cAAe,UAIjBwT,0BACExT,cAAe,SAyFrBjyC,GAAOD,QAAQwyC,WAAaA,EAC5BvyC,EAAOD,QAAQ6wC,cAAgBA,EAC/B5wC,EAAOD,QAAQmyC,iBAAmBA,EAClClyC,EAAOD,QAAQ8yC,kBAAoBA,GAK9B,SAAS7yC,EAAQD,EAASM,GAE/B,YA6FA,SAASqlD,GAAerb,EAAUpkC,EAAMtB,GAiBtC,MAfA0lC,GAAWA,EAASC,QAAQ,UAAWrkC,GAGvCtB,EAAK3C,QAAQ,SAAUsE,EAAKrE,GAC1BooC,EAAWA,EAASC,QAAQ8C,OAAO,IAAMnrC,EAAQ,IAAK,KAAMqE,KAI9D+jC,EAAWA,EAASC,QAAQ,MAAO3lC,EAAKzC,IAAI,SAAUoE,GAClD,MAAOA,KACNoF,KAAK,MAGV2+B,EAAWA,EAASC,QAAQ,KAAM,KA1GpCvqC,EAAQ4lD,SAENC,MAAO,IAASC,MAAO,UACvBC,KAAM,IAAUC,KAAM,SACtBC,MAAO,UAAc96B,MAAO,UAC5B+6B,MAAO,UAAcprB,MAAO,UAC5BqrB,QAAS,IAAO3iD,QAAS,YAAc4iD,WAAY,eACnDC,KAAM,IAAUC,KAAM,SACtBC,IAAK,IAAWC,IAAK,QACrBC,MAAO,UAAcC,MAAO,UAAcC,SAAU,aACpDC,KAAM,IAAUC,KAAM,SACtBC,MAAO,IAASC,MAAO,UAAcC,SAAU,aAC/CC,OAAQ,WAAcC,OAAQ,WAC9BC,GAAI,IAAY3nB,GAAI,OACpB4nB,GAAI,IAAYC,GAAI,OACpBC,GAAI,OAAc3F,GAAI,OACtB4F,QAAS,IAAOC,QAAS,IACzBn2C,GAAI,OAAc2W,GAAI,OAAcy/B,MAAO,UAC3CC,IAAK,IAAWC,IAAK,QAAcC,OAAQ,WAC3CC,MAAO,UAAcC,MAAO,UAAcC,SAAU,aACpDC,IAAK,IAAW5/B,IAAK,QACrB6/B,QAAS,YAAcC,QAAS,YAChCC,IAAK,QAAcxhD,IAAK,QAAcyhD,OAAQ,WAC9CC,IAAK,IAAWC,IAAK,QACrBC,IAAK,QAAcC,IAAK,QACxBC,MAAO,UAAcC,MAAO,UAE5BC,OAAQ,iBACRC,QAAS,kBAET9kD,EAAG,IACH67C,IAAK,UACLkJ,IAAK,UACLC,SAAU,UACVtlB,SAAU,UACVulB,GAAI,UACJC,IAAK,QACLp+C,UAAa,eAGf5K,EAAQojB,WACN2H,UAAa,SACbG,UAAa,IACb5hB,IAAO,IACPqf,OAAU,YACVa,UAAa,IACbD,WAAc,IACdI,OAAU,IACV3E,IAAO,QACPiE,SAAY,SACZT,OAAU,SACVE,YAAe,UACfD,UAAa,KACb3D,IAAO,QACPwD,IAAO,IACPgB,SAAY,IACZ1b,GAAM,eACNkc,UAAa,KACbC,gBAAmB,KACnBC,cAAiB,MACjBgE,MAAS,IACTpC,QAAW,QACX9N,QAAW,IACXC,OAAU,IACV4N,UAAa,QACbD,SAAY,QACZhC,OAAU,MACVG,OAAU,iBACVD,MAAS,IACTxC,IAAO,UACPC,IAAO,WACPC,GAAM,QAWR,IAAI2hC,GAAkB,qCA8BlBC,GAEF3/C,IAAO,qBACP+e,IAAO,yBACP3d,KAAQ,iCACR4d,KAAQ,uBACRC,OAAU,mBACVC,UAAa,aAAezoB,EAAQojB,UAAqB,UAAI,cAC7DsF,YAAe,aAAe1oB,EAAQojB,UAAuB,YAAI,cACjEuF,OAAU,aAAe3oB,EAAQojB,UAAkB,OAAI,cACvDwF,IAAO,0BACPC,IAAOogC,EACP5pC,MAAS,mCACTyJ,IAAO,0BACPC,IAAOkgC,EACPjgC,MAAS,+BACT9a,KACEi7C,EAAG,yBACHC,EAAG,iCAELtkC,IAAO,aAAe9kB,EAAQojB,UAAe,IAAI,cACjD6F,SAAY,aAAejpB,EAAQojB,UAAoB,SAAI,cAC3D8F,MACEigC,EAAG,yBACHC,EAAGH,GAEL9/B,QAAW,mBACX7f,IAAO,qBAAuBtJ,EAAQojB,UAAe,IAAI,QACzDgG,OACE+/B,EAAG,kCACHC,EAAGH,GAELv+C,KAAQu+C,EACRpgD,KAAQ,cACRwgB,OAAU,uBACVC,SAAY,aAAetpB,EAAQojB,UAAoB,SAAI,cAC3DmG,WAAcvpB,EAAQojB,UAAsB,WAAI,qBAChDoG,UAAaxpB,EAAQojB,UAAqB,UAAI,qBAC9CqG,KAAQw/B,EAGRv/B,OAAU,aAAe1pB,EAAQojB,UAAkB,OAAI,cACvDwG,MAAS,aAAe5pB,EAAQojB,UAAiB,MAAI,cACrDyG,OAAU,aAAe7pB,EAAQojB,UAAkB,OAAI,cACvDuG,OAAU3pB,EAAQojB,UAAkB,OAAI,qBACxC0G,UAAa,aAAe9pB,EAAQojB,UAAqB,UAAI,cAC7D2G,gBAAmB,aAAe/pB,EAAQojB,UAA2B,gBAAI,cACzE4G,cAAiB,aAAehqB,EAAQojB,UAAyB,cAAI,cAGrE7c,IAAO,0BACP0jB,KAAQ,uBACR7jB,GAAM,uCACND,GAAM,uCAGN+jB,WACE,EAAG,IACHi/B,EAAG,sBAELzrB,UAAWurB,EACX51C,MAAS41C,EACT9+B,SACE,EAAG,IACHg/B,EAAG,qBACHC,EAAG,6BACCppD,EAAQ4lD,QAAW,EAAI,oCAE7B1jD,MAAS+mD,EACT5lD,QACE,EAAG,iCACH8lD,EAAG,qBACHC,EAAG,sBAEL9lD,QACE,EAAG,IACH6lD,EAAG,qBACHC,EAAG,wCAELpsC,OAAUisC,EACVp4B,QACE,EAAG,iCACHs4B,EAAG,sBAELxhD,QACE,EAAG;AACHwhD,EAAG,SAAU9nD,GACX,MAAO,IAAMA,EAAKuD,KAAK,GAAG4E,WAAa,MAG3C+C,MACE48C,EAAG,qBACHC,EAAG,wCAIL1hC,QAAWuhC,EACX/rC,KAAQ+rC,EACR7+B,KAAQ6+B,EACRphD,MAASohD,EAGT7hC,IAAO,aAAepnB,EAAQojB,UAAe,IAAI,cACjD4B,IAAOhlB,EAAQojB,UAAe,IAAI,qBAClCkE,GAAM,aAAetnB,EAAQojB,UAAc,GAAI,cAC/CiE,IAAO,aAAernB,EAAQojB,UAAe,IAAI,cAGjDrhB,OAAUknD,EACV5+B,MAAS,8CACTC,IAAO,0BACPC,KAAQ0+B,EACRz+B,IAAO,8BACPC,IAAOw+B,EACPv+B,QAAWu+B,EACXt+B,IAAO,0BACPC,KAAQq+B,EACR1mD,MAAS0mD,EACT78C,OAAU68C,EACVrjD,KAAQqjD,EACRp+B,QAAWo+B,EACXzmD,OAAUymD,EACVn+B,MAAS,iCACTC,UAAa,qBAAuB/qB,EAAQojB,UAAqB,UACjE4H,MAASi+B,EAGTh+B,aAAgB,oBAChB+Y,aAAgBilB,EAChB/9B,UAAa,qBAAuBlrB,EAAQojB,UAAqB,UACjE+H,MAAS,4BACTC,aAAgB69B,EAChB59B,WAAc49B,EACd19B,UAAa09B,EACb39B,OAAU29B,EAGVz9B,QAAWy9B,EACXx9B,UAAaw9B,EACbj7B,MAAS,aAAehuB,EAAQojB,UAAiB,MAAI,cACrDsI,SAAY,aAAe1rB,EAAQojB,UAAoB,SAAI,cAC3DrF,OAAU,aAAe/d,EAAQojB,UAAkB,OAAI,cACvDuI,UAAa,aAAe3rB,EAAQojB,UAAqB,UAAI,cAC7DtF,QAAW,aAAe9d,EAAQojB,UAAmB,QAAI,cACzDwI,QAAW,aAAe5rB,EAAQojB,UAAmB,QAAI,cAGzDhhB,IAAO,0BACPC,KAAQ4mD,EACRp9B,OAAUo9B,EACV3mD,IAAO,0BACPwpB,KAAQm9B,EACRl9B,IAAOk9B,EACPj9B,IAAOi9B,EACPI,MAAO,kCAGPn9B,MAAS,gCACTD,KAAQ,+BACRG,MAAS,gCACTD,KAAQ,+BACRG,MAAS,wCACTD,KAAQ,+BACRG,MAAS,wCACTD,KAAQ,+BACRG,MAAS,gCACTD,KAAQ,+BACR3jB,MAAS,oCACT8jB,MAAS,gCACTD,KAAQ,+BACRE,KAAQ,2BACRpkB,IAAO,0BACPskB,KAAQ,2BACRD,IAAO,0BACPG,KAAQ,mCACRD,IAAO,0BACPE,KAAQ,mCACR1V,IAAO,0BACP2V,KAAQ,2BACRzkB,IAAO,0BACP2kB,KAAQ,2BACRD,IAAO,0BAGPxf,GAAM,aAAe5N,EAAQojB,UAAc,GAAI,cAG/Cra,MAASkgD,EACTjnD,OAAUinD,EACVhnD,QAAWgnD,EACX//C,OAAU+/C,EACVK,SAAUL,EACV9mD,IAAO8mD,EACPM,MAASN,EACT37B,KAAQ27B,EACRO,SAAUP,GAGRQ,GACF5xC,IAAK,UAMP7X,GAAQ+wC,SAAW,SAAU7qC,GAC3B,GAAIujD,EAAMz8C,eAAe9G,GACvB,MAAOujD,GAAMvjD,EAGf,IAAIlG,EAAQ4lD,QAAQ54C,eAAe9G,GACjC,MAAOlG,GAAQ4lD,QAAQ1/C,EAEpB,IAA0B,KAAtBA,EAAKlD,QAAQ,KAAa,CAEjC,GAAId,GAAQgE,EAAKlD,QAAQ,IACzB,OAAOhD,GAAQ+wC,SAAS7qC,EAAKiC,UAAU,EAAGjG,IAAU,KAChDlC,EAAQ+wC,SAAS7qC,EAAKiC,UAAUjG,EAAQ,IAAM,IAEpD,MAAO,YAAcgE,EAAO,KAI9BlG,EAAQ8zC,WAAa,SAAUzyC,EAAMivC,EAAWpqC,GAC9C,GAAIwjD,GAAiBR,EAAUhjD,GAC3BtB,EAAOvD,EAAKuD,KAAKzC,IAAI,SAAUoE,GACjC,MAAOA,GAAIkqC,MAAMH,IAGnB,cAAeoZ,IACb,IAAK,WACH,MAAOA,GAAeroD,EAAMivC,EAC9B,KAAK,SACH,MAAOqV,GAAe+D,EAAgBxjD,EAAMtB,EAC9C,KAAK,SACH,aAAe8kD,GAAe9kD,EAAKP,SACjC,IAAK,WACH,MAAOqlD,GAAe9kD,EAAKP,QAAQhD,EAAMivC,EAC3C,KAAK,SACH,MAAOqV,GAAe+D,EAAe9kD,EAAKP,QAAS6B,EAAMtB,GAG/D,QACE,MAAO+gD,GAAesD,EAAiB/iD,EAAMtB,MAO9C,SAAS3E,EAAQD,EAASM,GAE/B,YAUA,SAASP,GAASwB,EAAMP,EAAQ4B,EAAMK,GAEpC,GAAI6B,GAASvD,EAAKuD,OAUd61C,EAAyB,SAAU/5C,EAAGsY,GAExC,GAAItT,GAAOhF,EAAEgF,MAEb,IAAoB,IAAhBA,EAAKvB,OACP,KAAM,IAAI8wB,YAAW,yCAA2CxtB,EAAOuB,OAAOtD,GAAQ,IAExF,IAAIigB,GAAOjgB,EAAK,GACZsoB,EAAUtoB,EAAK,EAEnB,IAAIigB,IAASqI,EACX,KAAM,IAAIiH,YAAW,gCAAkCxtB,EAAOuB,OAAOtD,GAAQ,IAE/E,IAAIsT,YAAapU,GAAQ,CAEvB,GAAI6kD,GAAQzwC,EAAEtT,MAEd,IAAqB,IAAjB+jD,EAAMtlD,QAER,GAAIslD,EAAM,KAAO9jC,EACf,KAAM,IAAIsP,YAAW,oEAEpB,CAAA,GAAqB,IAAjBw0B,EAAMtlD,OAOb,KAAM,IAAI8wB,YAAW,+DALrB,IAAIw0B,EAAM,KAAO9jC,GAAqB,IAAb8jC,EAAM,GAC7B,KAAM,IAAIx0B,YAAW,gEAOzB,GAAIjwB,GAAI,GAAIhB,OAAM2hB,EAMlB,OAJA3M,GAAEjX,QAAQ,SAAUksB,EAAGjsB,GACrBgD,EAAEhD,EAAM,IAAMsI,EAAOzB,MAAMolB,KAC1B,GAEIjpB,EAGT,GAAIf,EAAQ+U,GAAI,CAEd,GAAIyb,GAAQ9vB,EAAMe,KAAKsT,EAEvB,IAAqB,IAAjByb,EAAMtwB,OAAc,CAEtB,GAAIswB,EAAM,KAAO9O,EACf,KAAM,IAAIsP,YAAW,+DAEvB,OAAO3qB,GAAOzB,MAAMmQ,GAEtB,GAAqB,IAAjByb,EAAMtwB,OAAc,CAEtB,GAAIswB,EAAM,KAAO9O,GAAqB,IAAb8O,EAAM,GAC7B,KAAM,IAAIQ,YAAW,+DAEvB,OAAOjc,GAAE/W,IAAI,SAAUgsB,GACrB,MAAO3jB,GAAOzB,MAAMolB,EAAE,MAI1B,KAAM,IAAIgH,YAAW,iEAIzB,OAAOwlB,GAtFT,GAAI31C,GAAO1E,EAAoB,KAE3BqH,EAAS3C,EAAK2C,OACd9C,EAAQG,EAAKH,MACb2F,EAASxF,EAAKwF,OAEdrG,EAAUD,MAAMC,OAmFpBnE,GAAQkG,KAAO,yBACflG,EAAQD,QAAUA,GAIb,SAASE,EAAQD,EAASM,GAE/B,GAAIspD,GAAgCC,EAA8B5M,GASjE,SAAUl9C,GAGL8pD,KAAmCD,EAAiC,EAAW3M,EAA2E,kBAAnC2M,GAAiDA,EAA+Bt+C,MAAMtL,EAAS6pD,GAAiCD,IAAmEh/C,SAAlCqyC,IAAgDh9C,EAAOD,QAAUi9C,KAU7V,WAOA,QAAS6M,GAAYvoD,GACnB,GAAIsxB,GAAO5vB,EAAM8qB,MAAMxsB,EACvB,KAAKsxB,EAAM,CACT,GAAIk3B,EACJ,KAAK,GAAI7jD,KAAQjD,GAAM8qB,MACrB,GAAI9qB,EAAM8qB,MAAM/gB,eAAe9G,IACzBA,EAAK03B,eAAiBr8B,EAAKq8B,cAAe,CAC5CmsB,EAAO7jD,CACP,OAKN,KAAM,IAAIrD,OAAM,iBAAmBtB,EAAO,KACrCwoD,EAAQ,mBAAqBA,EAAO,KAAQ,KAEnD,MAAOl3B,GAkBT,QAASrR,GAAY6B,EAAI2mC,EAAU9nD,EAAOmtC,EAAQC,GAChD,GAGIlpB,GAHA6jC,EAAaC,EAAU7a,GACvB8a,EAAY7a,EAAWA,EAASrlC,MAAM,KAAO,KAC7CmgD,EAAUD,GAAaE,EAASF,EAAW,OAE3C38B,GACFnK,GAAIA,EACJnhB,MAAOA,EACPmtC,OAAQA,EACRC,SAAU6a,EASR/jC,GAHA+jC,EACEH,EAAW9nD,IAAUkoD,EAEb,0CACWD,EAAUx+C,KAAK,QAAU,aAAes+C,EAAa,YAAc/nD,EAAQ,IAItF,gCACSioD,EAAUx+C,KAAK,QAAU,YAAczJ,EAAQ,IAK1D,iCACWA,EAAQ,aAAe8nD,EAAW,GAGzD,IAAI38C,GAAM,GAAIxG,WAAUuf,EAExB,OADA/Y,GAAImgB,KAAOA,EACJngB,EAST,QAASi9C,GAAKpkD,GACZ9F,KAAK8F,KAAOA,GAAQ,OACpB9F,KAAKmqD,cAmDP,QAASC,GAAMz8B,EAAO08B,GAEpB,GAAqB,gBAAV18B,GAAoB,CAE7B,GAAI28B,GAAS38B,EAAM60B,OACf+H,EAAmC,QAAxBD,EAAOroB,OAAO,EAAG,EAIhC,IAHIsoB,IACFD,EAASA,EAAOroB,OAAO,IAEV,KAAXqoB,EACFtqD,KAAK2tB,OAAS,WAEX,CACH3tB,KAAK2tB,MAAQ28B,EAAOzgD,MAAM,IAC1B,KAAK,GAAInG,GAAI,EAAGA,EAAI1D,KAAK2tB,MAAM1pB,OAAQP,IACrC1D,KAAK2tB,MAAMjqB,GAAK1D,KAAK2tB,MAAMjqB,GAAG8+C,YAI/B,CAAA,IAAI1+C,MAAMC,QAAQ4pB,GAGlB,CAAA,GAAIA,YAAiBy8B,GACxB,MAAOz8B,GAAMhlB,OAGb,MAAM,IAAIlG,OAAM,4BANhBzC,KAAK2tB,MAAQA,EAUf3tB,KAAK0tC,eAIL1tC,KAAKqqD,QAAUE,GAAYF,IAAW,EAGtCrqD,KAAKgqD,QAAwC,KAA9BhqD,KAAK2tB,MAAM/qB,QAAQ,OAsHpC,QAAS4nD,GAAUtnC,EAAQD,GACzB,GAAIwnC,EACJ,IAAsB,gBAAXvnC,GACTunC,EAAsB,KAAXvnC,EAAiBA,EAAOrZ,MAAM,YAEtC,CAAA,IAAI/F,MAAMC,QAAQmf,GAIrB,KAAM,IAAIzgB,OAAM,2BAHhBgoD,GAAUvnC,EAMZljB,KAAKkjB,OAAS,GAAIpf,OAAM2mD,EAAQxmD,OAChC,KAAK,GAAIP,GAAI,EAAGA,EAAI+mD,EAAQxmD,OAAQP,IAAK,CACvC,GAAImtC,GAAQ,GAAIuZ,GAAMK,EAAQ/mD,GAE9B,IADA1D,KAAKkjB,OAAOxf,GAAKmtC,EACbntC,IAAM+mD,EAAQxmD,OAAS,EAEzBjE,KAAKqqD,QAAUxZ,EAAMwZ,YAIrB,IAAIxZ,EAAMwZ,QACR,KAAM,IAAIpkD,aAAY,gDAK5BjG,KAAKijB,GAAKA,EAsKZ,QAASsE,GAAKtb,EAAMy+C,EAAWC,GAC7B3qD,KAAKiM,KAAOA,MACZjM,KAAK6wC,MAAQ5kC,EAAKA,EAAKhI,OAAS,IAAM,KACtCjE,KAAK0qD,UAAYA,GAAa,KAC9B1qD,KAAK2qD,OAASA,MA4LhB,QAASC,GAAgBC,GAEvB,GAAIH,GAGAhnD,EAFA2mC,KACA7U,IAGJ,KAAK,GAAI7H,KAASk9B,GAChB,GAAIA,EAAcj+C,eAAe+gB,GAAQ,CACvC,GAAI1K,GAAK4nC,EAAcl9B,EACvB+8B,GAAY,GAAIF,GAAU78B,EAAO1K,EAEjC,IAAI6nC,GAAWJ,EAAUK,QAEzB,KAAKrnD,EAAI,EAAGA,EAAIonD,EAAS7mD,OAAQP,IAAK,CACpC,GAAIsnD,GAAcF,EAASpnD,GACvBoa,EAAMktC,EAAY5hD,WAClB6hD,EAAW5gB,EAAKvsB,EACpB,IAAKmtC,EAGA,CACH,GAAIlvB,GAAMyuB,EAAUp/B,QAAQ4/B,EAAaC,EACzC,IAAU,EAANlvB,EAEFsO,EAAKvsB,GAAOktC,MAET,IAAY,IAARjvB,EACP,KAAM,IAAIt5B,OAAM,cAAgBqb,EAAM,0BATxCusB,GAAKvsB,GAAOktC,GAkBpB,IAAKltC,IAAOusB,GACNA,EAAKz9B,eAAekR,IACtB0X,EAAW1yB,KAAKunC,EAAKvsB,GAMzB,KAAKpa,EAAI,EAAGA,EAAI8xB,EAAWvxB,OAAQP,IAGjC,GAFAgnD,EAAYl1B,EAAW9xB,GAEnBgnD,EAAUL,QAKZ,IAJA,GAAIvoD,GAAQ4oD,EAAUxnC,OAAOjf,OAAS,EAClC4sC,EAAQ6Z,EAAUxnC,OAAOphB,GAEzB60B,EAAI,EACDA,EAAIka,EAAMljB,MAAM1pB,QAAQ,CAC7B,GAAI4sC,EAAMnD,YAAY/W,GAGpB,IAAK,GAFDx1B,GAAO0vC,EAAMljB,MAAMgJ,GAEdzyB,EAAI,EAAGA,EAAIsxB,EAAWvxB,OAAQC,IAAK,CAC1C,GAAI2E,GAAQ2sB,EAAWtxB,GACnBxD,EAAImI,EAAMqa,OAAOphB,EAErB,IAAI+G,IAAU6hD,GACVhqD,GACAupD,EAASvpD,EAAEitB,MAAOxsB,KACjBT,EAAEgtC,YAAY5rC,GAAQ,CAEzB+uC,EAAMljB,MAAMsB,OAAO0H,EAAG,GACtBka,EAAMnD,YAAYze,OAAO0H,EAAG,GAC5BA,GACA,QAINA,IAKN,MAAOnB,GAUT,QAAS01B,GAAc11B,GAGrB,IAAK,GAFD21B,MAEKznD,EAAI,EAAGA,EAAI8xB,EAAWvxB,OAAQP,IAAK,CAC1C,GAAIgnD,GAAYl1B,EAAW9xB,EAC3B,IAAIgnD,EAAUznC,GAAI,CAChB,GAAIC,GAASwnC,EAAUxnC,OAAO3X,KAAK,IACnC4/C,GAAWjoC,GAAUwnC,EAAUznC,IAInC,MAAOkoC,GAST,QAASC,GAAU51B,EAAYvpB,GAC7B,GAAIvI,GAAGgnD,EAEHW,EADAvpD,EAAQmK,EAAKhI,OAGbqnD,IACJ,KAAK5nD,EAAI,EAAGA,EAAI8xB,EAAWvxB,OAAQP,IACjCgnD,EAAYl1B,EAAW9xB,GAGnBgnD,EAAUxnC,OAAOjf,SAAWnC,GAAUupD,IACxCA,EAAgBX,GAGalgD,QAA3BkgD,EAAUxnC,OAAOphB,IACnBwpD,EAASxoD,KAAK4nD,EAKlBY,GAASp+B,KAAK,SAAUhe,EAAG4J,GACzB,MAAOsxC,GAAMh/B,QAAQlc,EAAEgU,OAAOphB,GAAQgX,EAAEoK,OAAOphB,KAIjD,IAAIob,KACJ,KAAKxZ,EAAI,EAAGA,EAAI4nD,EAASrnD,OAAQP,IAAK,CACpCgnD,EAAYY,EAAS5nD,EAErB,IAAImtC,GAAQ6Z,EAAUxnC,OAAOphB,GAGzBmpD,EAAW/tC,EAAQtb,OAAO,SAAUs8B,GACtC,MAAOA,GAAM2S,MAAM0a,YAAY1a,KAC9B,EAUH,IAAIoa,EAAU,CACZ,GAAIA,EAASpa,MAAMwZ,QACjB,KAAM,IAAI5nD,OAAM,sBAAwBwoD,EAASpa,MAAQ,UAAYA,EAAQ,IAE/Eoa,GAASz1B,WAAW1yB,KAAK4nD,OAGzBxtC,GAAQpa,MACN+tC,MAAOA,EACPrb,YAAak1B,KAMnB,GAAIC,GAAS,GAAI7mD,OAAMoZ,EAAQjZ,OAC/B,KAAKP,EAAI,EAAGA,EAAIwZ,EAAQjZ,OAAQP,IAAK,CACnC,GAAIw6B,GAAQhhB,EAAQxZ,EACpBinD,GAAOjnD,GAAK0nD,EAAUltB,EAAM1I,WAAYvpB,EAAKtK,OAAOu8B,EAAM2S,QAG5D,MAAO,IAAItpB,GAAKtb,EAAMo/C,EAAeV,GAQvC,QAASa,GAAQ7b,GAGf,IAAK,GADDnrC,MACKd,EAAI,EAAOisC,EAAJjsC,EAAWA,IACzBc,EAAKd,GAAK,MAAQA,CAGpB,OAAOc,GAgBT,QAASinD,GAAO3lD,EAAM0vB,GACpB,GAAIk2B,GAAO,GAAIxB,GAGXyB,EAAcf,EAAgBp1B,EAClC,IAA0B,GAAtBm2B,EAAY1nD,OACd,KAAM,IAAIxB,OAAM,yBAIlB,IAAIxB,GAAOmqD,EAAUO,MAOjBzX,KACA0X,EAAQ9lD,GAAQ,GAChB+lD,EAAQL,EAAQM,EAAUH,GAC9BzX,GAAKpxC,KAAK,YAAc8oD,EAAQ,IAAMC,EAAMtgD,KAAK,MAAQ,OACzD2oC,EAAKpxC,KAAK,mBACVoxC,EAAKpxC,KAAK7B,EAAK8qD,OAAOL,EAAM,OAC5BxX,EAAKpxC,KAAK,IAGV,IAAIkpD,IACFN,EAAKK,SACL,UAAY7X,EAAK3oC,KAAK,OACtBA,KAAK,MAGH5L,EAAU,GAAK00C,UAASqX,EAAK5lD,KAAM,cAAekmD,GAClD/oC,EAAKtjB,EAAQ+rD,EAAMtqC,EAOvB,OAFA6B,GAAGuS,WAAa01B,EAAcS,GAEvB1oC,EAsBT,QAAS6oC,GAAUt2B,GAGjB,IAAK,GAFDxzB,GAAM,EAED0B,EAAI,EAAGA,EAAI8xB,EAAWvxB,OAAQP,IAAK,CAC1C,GAAI2B,GAAMmwB,EAAW9xB,GAAGwf,OAAOjf,MAC3BoB,GAAMrD,IACRA,EAAMqD,GAIV,MAAOrD,GAQT,QAAS8nD,GAAUhlD,GACjB,IAAK,GAAI3D,KAAQwsB,GACf,GAAIA,EAAM/gB,eAAezL,IAAkB,WAATA,GAE5BwsB,EAAMxsB,GAAM2D,GAAI,MAAO3D,EAG/B,OAAIwsB,GAAc,OAAE7oB,GAAW3D,EACxB,UAST,QAAS8oD,GAASxlD,EAAOy5B,GACvB,MAAgC,KAAzBz5B,EAAM7B,QAAQs7B,GAr3BvBgsB,EAAK3hD,UAAU2f,IAAM,SAAUjF,EAAIzG,GACjC,GAAIyvC,GAAMzvC,GAAY,IACjBxc,MAAKmqD,WAAW8B,KAAMjsD,KAAKmqD,WAAW8B,MAE3C,IAAInqD,GAAQ9B,KAAKmqD,WAAW8B,GAAKrpD,QAAQqgB,EAMzC,OALa,IAATnhB,IACFA,EAAQ9B,KAAKmqD,WAAW8B,GAAKhoD,OAC7BjE,KAAKmqD,WAAW8B,GAAKnpD,KAAKmgB,IAGrBgpC,EAAMnqD,GAOfooD,EAAK3hD,UAAUwjD,OAAS,WACtB,GAAI7X,MACAjoC,EAAOjM,KAAK8F,KAAO,cACnBqkD,EAAanqD,KAAKmqD,UAEtB,KAAK,GAAI8B,KAAO9B,GACd,GAAIA,EAAWv9C,eAAeq/C,GAG5B,IAAK,GAFDzvC,GAAW2tC,EAAW8B,GAEjBvoD,EAAI,EAAGA,EAAI8Y,EAASvY,OAAQP,IACnCwwC,EAAKpxC,KAAK,OAASmpD,EAAMvoD,EAAI,MAAQuI,EAAO,KAAQggD,EAAM,MAASvoD,EAAI,KAK7E,OAAOwwC,GAAK3oC,KAAK,OA2DnB6+C,EAAMh/B,QAAU,SAAUlc,EAAG4J,GAC3B,GAAI5J,EAAE86C,QAAS,MAAO,EACtB,IAAIlxC,EAAEkxC,QAAS,MAAO,EAEtB,IAAIC,EAAS/6C,EAAEye,MAAO,UAAW,MAAO,EACxC,IAAIs8B,EAASnxC,EAAE6U,MAAO,UAAW,MAAO,EAExC,IAAIze,EAAEg9C,iBAAkB,CACtB,GAAIpzC,EAAEozC,iBAAkB,CACtB,GAAIxoD,GAAGyoD,EAAIC,CAEX,KAAK1oD,EAAI,EAAGA,EAAIwL,EAAEw+B,YAAYzpC,OAAQP,IACpC,GAAyB8G,SAArB0E,EAAEw+B,YAAYhqC,GAAkB,CAClCyoD,EAAKj9C,EAAEw+B,YAAYhqC,EACnB,OAIJ,IAAKA,EAAI,EAAGA,EAAIoV,EAAE40B,YAAYzpC,OAAQP,IACpC,GAAyB8G,SAArBsO,EAAE40B,YAAYhqC,GAAkB,CAClC0oD,EAAKtzC,EAAE40B,YAAYhqC,EACnB,OAIJ,MAAOb,GAAM6qC,YAAY9qC,QAAQupD,GAAMtpD,EAAM6qC,YAAY9qC,QAAQwpD,GAGjE,MAAO,GAIT,MAAItzC,GAAEozC,iBACG,GAIJ,GAQT9B,EAAM7hD,UAAUgjD,YAAc,SAAU1iD,GACtC,IAAK,GAAInF,GAAI,EAAGA,EAAI1D,KAAK2tB,MAAM1pB,OAAQP,IACrC,GAAIumD,EAASphD,EAAM8kB,MAAO3tB,KAAK2tB,MAAMjqB,IACnC,OAAO,CAGX,QAAO,GAOT0mD,EAAM7hD,UAAUI,MAAQ,WACtB,GAAIkoC,GAAQ,GAAIuZ,GAAMpqD,KAAK2tB,MAAMvO,QAASpf,KAAKqqD,QAE/C,OADAxZ,GAAMnD,YAAc1tC,KAAK0tC,YAAYtuB,QAC9ByxB,GAQTuZ,EAAM7hD,UAAU2jD,eAAiB,WAC/B,MAAOlsD,MAAK0tC,YAAYzpC,OAAS,GAYnCmmD,EAAM7hD,UAAUa,SAAW,SAAUijD,GAInC,IAAK,GAHD1+B,MACA0c,KAEK3mC,EAAI,EAAGA,EAAI1D,KAAK2tB,MAAM1pB,OAAQP,IAAK,CAC1C,GAAI4oD,GAAatsD,KAAK0tC,YAAYhqC,GAC9BvC,EAAOkrD,GAAgBC,EAAaA,EAAW9+C,GAAKxN,KAAK2tB,MAAMjqB,EAC7DvC,KAAQkpC,KACZA,EAAKlpC,IAAQ,EACbwsB,EAAM7qB,KAAK3B,IAIf,OAAQnB,KAAKqqD,QAAU,MAAQ,IAAM18B,EAAMpiB,KAAK,MA8ClDi/C,EAAUjiD,UAAUI,MAAQ,WAC1B,MAAO,IAAI6hD,GAAUxqD,KAAKkjB,OAAO9D,QAASpf,KAAKijB,KAQjDunC,EAAUjiD,UAAUwiD,OAAS,WAG3B,QAASt5B,GAAQi5B,EAAWz+C,GAC1B,GAAIA,EAAKhI,OAASymD,EAAUxnC,OAAOjf,OAAQ,CACzC,GAAIP,GAAG6oD,EAAUD,EAEbzb,EAAQ6Z,EAAUxnC,OAAOjX,EAAKhI,OAClC,IAAI4sC,EAAMwZ,QAAS,CAMjB,IAJAkC,EAAW1b,EAAMloC,QAIZjF,EAAI,EAAGA,EAAIb,EAAM6qC,YAAYzpC,OAAQP,IAExC,GADA4oD,EAAazpD,EAAM6qC,YAAYhqC,IAC1BumD,EAASpZ,EAAMljB,MAAO2+B,EAAWv6B,OAASk4B,EAASpZ,EAAMljB,MAAO2+B,EAAW9+C,IAAK,CACnF,GAAItJ,GAAIqoD,EAAS5+B,MAAM1pB,MACvBsoD,GAAS5+B,MAAMzpB,GAAKooD,EAAWv6B,KAC/Bw6B,EAAS7e,YAAYxpC,GAAKooD,EAI9B76B,EAAQi5B,EAAWz+C,EAAKtK,OAAO4qD,QAE5B,CAEH,IAAK7oD,EAAI,EAAGA,EAAImtC,EAAMljB,MAAM1pB,OAAQP,IAClC+tB,EAAQi5B,EAAWz+C,EAAKtK,OAAO,GAAIyoD,GAAMvZ,EAAMljB,MAAMjqB,KAIvD,KAAKA,EAAI,EAAGA,EAAIb,EAAM6qC,YAAYzpC,OAAQP,IACxC4oD,EAAazpD,EAAM6qC,YAAYhqC,IAC1BumD,EAASpZ,EAAMljB,MAAO2+B,EAAWv6B,OAASk4B,EAASpZ,EAAMljB,MAAO2+B,EAAW9+C,MAC9E++C,EAAW,GAAInC,GAAMkC,EAAWv6B,MAChCw6B,EAAS7e,YAAY,GAAK4e,EAC1B76B,EAAQi5B,EAAWz+C,EAAKtK,OAAO4qD,UAMrC/2B,GAAW1yB,KAAK,GAAI0nD,GAAUv+C,EAAMy+C,EAAUznC,KA1ClD,GAAIuS,KA+CJ,OAFA/D,GAAQzxB,SAEDw1B,GAaTg1B,EAAUp/B,QAAU,SAAUlc,EAAG4J,GAC/B,GAAI5J,EAAEgU,OAAOjf,OAAS6U,EAAEoK,OAAOjf,OAAQ,MAAO,EAC9C,IAAIiL,EAAEgU,OAAOjf,OAAS6U,EAAEoK,OAAOjf,OAAQ,MAAO,EAG9C,IAAIP,GACA2B,EAAM6J,EAAEgU,OAAOjf,OACfkoD,EAAK,EACLC,EAAK,CACT,KAAK1oD,EAAI,EAAO2B,EAAJ3B,EAASA,IACfwL,EAAEgU,OAAOxf,GAAGwoD,kBAAkBC,IAC9BrzC,EAAEoK,OAAOxf,GAAGwoD,kBAAkBE,GAGpC,IAAID,EAAKC,EAAI,MAAO,EACpB,IAASA,EAALD,EAAS,MAAO,EAGpB,KAAKzoD,EAAI,EAAGA,EAAIwL,EAAEgU,OAAOjf,OAAQP,IAAK,CACpC,GAAIq4B,GAAMquB,EAAMh/B,QAAQlc,EAAEgU,OAAOxf,GAAIoV,EAAEoK,OAAOxf,GAC9C,IAAY,IAARq4B,EACF,MAAOA,GAIX,MAAO,IAQTyuB,EAAUjiD,UAAU2jD,eAAiB,WACnC,IAAK,GAAIxoD,GAAI,EAAGA,EAAI1D,KAAKkjB,OAAOjf,OAAQP,IACtC,GAAI1D,KAAKkjB,OAAOxf,GAAGwoD,iBACjB,OAAO,CAGX,QAAO,GAST1B,EAAUjiD,UAAUwjD,OAAS,SAAUL,EAAMt/C,GAI3C,IAAK,GAHD8nC,MAEA1vC,EAAO,GAAIV,OAAM9D,KAAKkjB,OAAOjf,QACxBP,EAAI,EAAGA,EAAI1D,KAAKkjB,OAAOjf,OAAQP,IAAK,CAC3C,GAAImtC,GAAQ7wC,KAAKkjB,OAAOxf,GACpB4oD,EAAazb,EAAMnD,YAAY,EAC/BmD,GAAMwZ,QACR7lD,EAAKd,GAAK,UAEH4oD,EACP9nD,EAAKd,GAAKgoD,EAAKxjC,IAAIokC,EAAWjvC,QAAS,WAAa,OAAS3Z,EAAI,IAGjEc,EAAKd,GAAK,MAAQA,EAItB,GAAI8oD,GAAMxsD,KAAKijB,GAAKyoC,EAAKxjC,IAAIloB,KAAKijB,GAAI,aAAezY,MACrD,OAAIgiD,GACKpgD,EAAS,UAAYogD,EAAM,IAAMhoD,EAAK+G,KAAK,MAAS,oBAAsBvL,KAAKkjB,OAAO3X,KAAK,MAG7F2oC,EAAK3oC,KAAK,OAOnBi/C,EAAUjiD,UAAUa,SAAW,WAC7B,MAAOpJ,MAAKkjB,OAAO3X,KAAK,OAwB1Bgc,EAAKhf,UAAUwjD,OAAS,SAAUL,EAAMt/C,EAAQ49C,GAE9C,GAAI9V,KAEJ,IAAIl0C,KAAK6wC,MAAO,CACd,GAAI/uC,GAAQ9B,KAAKiM,KAAKhI,OAAS,EAC3BqoD,EAAatsD,KAAK6wC,MAAMnD,YAAY,GACpC+e,EAAU,aAAeH,EACxBA,EAAWv6B,KAAO,gBAAkBu6B,EAAW9+C,GAAK,IACrDxN,KAAK6wC,MAGT,IAAI7wC,KAAK6wC,MAAMwZ,QACb,GAAIrqD,KAAK6wC,MAAMmZ,QAEb9V,EAAKpxC,KAAKsJ,EAAS,0BAA4BtK,EAAQ,OACvDoyC,EAAKpxC,KAAKsJ,EAAS,uBACnB8nC,EAAKpxC,KAAKsJ,EAAS,kBAAoBtK,EAAQ,kCAC/CoyC,EAAKpxC,KAAKsJ,EAAS,mCACnB8nC,EAAKpxC,KAAKsJ,EAAS,OACnB8nC,EAAKpxC,KAAK9C,KAAK0qD,UAAUqB,OAAOL,EAAMt/C,EAAS,OAC/C8nC,EAAKpxC,KAAKsJ,EAAS,SAEhB,CAYH,IAAK,GAVDsgD,GAAW,SAAU/+B,EAAOxnB,GAE9B,IAAK,GADDwmD,GAAQ,GAAI7oD,OAAM6pB,EAAM1pB,QACnBP,EAAI,EAAGA,EAAIiqB,EAAM1pB,OAAQP,IAChCipD,EAAMjpD,GAAKgoD,EAAKxjC,IAAIwhC,EAAY/7B,EAAMjqB,IAAK,QAAU,IAAMyC,EAAM,GAEnE,OAAOwmD,GAAMphD,KAAK,SAClBqhD,KAAK5sD,MAEH6sD,EAAW7sD,KAAK6wC,MAAMljB,MACtBm/B,KACKppD,EAAI,EAAGA,EAAImpD,EAAS5oD,OAAQP,IACD8G,SAA9BxK,KAAK6wC,MAAMnD,YAAYhqC,IACzBopD,EAAWhqD,KAAK+pD,EAASnpD,GAI7BwwC,GAAKpxC,KAAKsJ,EAAS,OAASsgD,EAASG,EAAU,MAAQ/qD,GAAS,OAAS2qD,GACzEvY,EAAKpxC,KAAKsJ,EAAS,uBAAyBtK,EAAQ,MACpDoyC,EAAKpxC,KAAKsJ,EAAS,mBAAqBtK,EAAQ,GAAK,kCACrDoyC,EAAKpxC,KAAKsJ,EAAS,WAAasgD,EAASI,EAAY,gBAAkB,OACvE5Y,EAAKpxC,KAAKsJ,EAAS,oCAEnB,KAAK,GAAI1I,GAAI,EAAGA,EAAImpD,EAAS5oD,OAAQP,IAAK,CACxC,GAAIqpD,GAAe/sD,KAAK6wC,MAAMnD,YAAYhqC,EAC1C,IAAIqpD,EAAc,CAChB,GAAIt6B,GAAOi5B,EAAKxjC,IAAIwhC,EAAYmD,EAASnpD,IAAK,QAC1C2Z,EAAUquC,EAAKxjC,IAAI6kC,EAAa1vC,QAAS,UAC7C62B,GAAKpxC,KAAKsJ,EAAS,SACnB8nC,EAAKpxC,KAAKsJ,EAAS,gBAAkBqmB,EAAO,qBAC5CyhB,EAAKpxC,KAAKsJ,EAAS,sBAAwBiR,EAAU,qBAGzD62B,EAAKpxC,KAAKsJ,EAAS,gBACnB8nC,EAAKpxC,KAAKsJ,EAAS,mEAAwEygD,EAASthD,KAAK,KAAO,OAChH2oC,EAAKpxC,KAAKsJ,EAAS,SACnB8nC,EAAKpxC,KAAKsJ,EAAS,OACnB8nC,EAAKpxC,KAAK9C,KAAK0qD,UAAUqB,OAAOL,EAAMt/C,EAAS,OAC/C8nC,EAAKpxC,KAAKsJ,EAAS,SAIrB,IAAIpM,KAAK6wC,MAAMmZ,QAEb9V,EAAKpxC,KAAKsJ,EAAS,gBACnB8nC,EAAKpxC,KAAK9C,KAAKgtD,WAAWtB,EAAMt/C,EAAQ49C,QAErC,CAEH,GAAI7oD,GAAOnB,KAAK6wC,MAAMljB,MAAM,GACxB8E,EAAgB,QAATtxB,EAAiBuqD,EAAKxjC,IAAIwhC,EAAYvoD,GAAO,QAAU,IAElE+yC,GAAKpxC,KAAKsJ,EAAS,OAASqmB,EAAO,OAAS3wB,EAAQ,QAAU2qD,GAC9DvY,EAAKpxC,KAAK9C,KAAKgtD,WAAWtB,EAAMt/C,EAAS,KAAM49C,IAC/C9V,EAAKpxC,KAAKsJ,EAAS,UAMvB8nC,GAAKpxC,KAAK9C,KAAKgtD,WAAWtB,EAAMt/C,EAAQ49C,GAG1C,OAAO9V,GAAK3oC,KAAK,OAYnBgc,EAAKhf,UAAUykD,WAAa,SAAStB,EAAMt/C,EAAQ49C,GACjD,GACItmD,GADAwwC,IAGAl0C,MAAK0qD,YACPxW,EAAKpxC,KAAKsJ,EAAS,4BAA8BpM,KAAKiM,KAAKhI,OAAS,OACpEiwC,EAAKpxC,KAAK9C,KAAK0qD,UAAUqB,OAAOL,EAAMt/C,EAAS,OAC/C8nC,EAAKpxC,KAAKsJ,EAAS,KAGrB,IAAI6gD,EACJ,KAAKvpD,EAAI,EAAGA,EAAI1D,KAAK2qD,OAAO1mD,OAAQP,IAClC,GAAI1D,KAAK2qD,OAAOjnD,GAAGmtC,MAAMmZ,QAAS,CAChCiD,EAAcjtD,KAAK2qD,OAAOjnD,EAC1B,OAIJ,IAAKA,EAAI,EAAGA,EAAI1D,KAAK2qD,OAAO1mD,OAAQP,IAClCwwC,EAAKpxC,KAAK9C,KAAK2qD,OAAOjnD,GAAGqoD,OAAOL,EAAMt/C,EAAQ6gD,GAG5CjD,KAAYhqD,KAAK6wC,MAAMmZ,SACzB9V,EAAKpxC,KAAKknD,EAAQ+B,OAAOL,EAAMt/C,EAAQ6gD,GAGzC,IAAIC,GAAaltD,KAAKmtD,YAAYzB,EAAMt/C,EAKxC,OAJI8gD,IACFhZ,EAAKpxC,KAAKoqD,GAGLhZ,EAAK3oC,KAAK,OAUnBgc,EAAKhf,UAAU4kD,YAAc,SAAUzB,EAAMt/C,GAC3C,GAAItK,GAAQ9B,KAAKiM,KAAKhI,MAGtB,IAA2B,IAAvBjE,KAAK2qD,OAAO1mD,OAEd,OACEmI,EAAS,0BAA4BtK,EAAQ,MAC7CsK,EAAS,6CAAiDtK,EAAQ,eAAiBA,EAAQ,MAC3FsK,EAAS,KACTb,KAAK,KAMP,KAAK,GAHD8+B,MACA1c,KAEKjqB,EAAI,EAAGA,EAAI1D,KAAK2qD,OAAO1mD,OAAQP,IAAK,CAC3C,GAAIzC,GAAOjB,KAAK2qD,OAAOjnD,EACvB,IAAIzC,EAAK4vC,MACP,IAAK,GAAI3sC,GAAI,EAAGA,EAAIjD,EAAK4vC,MAAMljB,MAAM1pB,OAAQC,IAAK,CAChD,GAAI/C,GAAOF,EAAK4vC,MAAMljB,MAAMzpB,EACtB/C,KAAQkpC,KACZA,EAAKlpC,IAAQ,EACbwsB,EAAM7qB,KAAK3B,KAMnB,MAAOiL,GAAS,2CAA+CtK,EAAQ,eAAiBA,EAAQ,OAAU6rB,EAAMpiB,KAAK,KAAO,MAiQhI,IAAIoiB,IACFmQ,OAAY,SAAUh5B,GAAI,MAAa,QAANA,GACjC0F,UAAY,SAAU1F,GAAI,MAAa0F,UAAN1F,GACjCw4B,UAAY,SAAUx4B,GAAI,MAAoB,iBAANA,IACxC5B,OAAY,SAAU4B,GAAI,MAAoB,gBAANA,IACxCyC,OAAY,SAAUzC,GAAI,MAAoB,gBAANA,IACxCsoD,WAAY,SAAUtoD,GAAI,MAAoB,kBAANA,IACxChB,MAAY,SAAUgB,GAAI,MAAOhB,OAAMC,QAAQe,IAC/CkoC,KAAY,SAAUloC,GAAI,MAAOA,aAAakoC,OAC9CC,OAAY,SAAUnoC,GAAI,MAAOA,aAAamoC,SAC9CjqC,OAAY,SAAU8B,GAAI,MAAoB,gBAANA,KAgDtClE,KAGA8sC,KAKA7qC,GACFjC,OAAQA,EACR+sB,MAAOA,EACP+f,YAAaA,EAkFf,OArEA7qC,GAAQ4oD,EAAO,SACbzoD,OAAU,SAAUwyB,GAClB,MAAOi2B,GAAO,KAAMj2B,IAEtB2I,iBAAkBstB,EAClB4B,mBAAoB,SAAU3C,EAAWznC,GACvC,GAAIuS,KAEJ,OADAA,GAAWk1B,GAAaznC,EACjBwoC,EAAOxoC,EAAGnd,MAAQ,KAAM0vB,IAEjC83B,2BAA4B,SAASxnD,EAAM4kD,EAAWznC,GACpD,GAAIuS,KAEJ,OADAA,GAAWk1B,GAAaznC,EACjBwoC,EAAO3lD,EAAM0vB,IAEtB+3B,cAAe,SAAUC,GAKvB,IAAK,GAJDvgD,GACAnH,EAAO,GACP0vB,KAEK9xB,EAAI,EAAGA,EAAI8pD,EAAIvpD,OAAQP,IAAK,CACnC,GAAIuf,GAAKuqC,EAAI9pD,EAGb,IAA+B,gBAAlBuf,GAAGuS,WAGd,KAFAvoB,GAAM,GAAIxG,WAAU,yCAA2C/C,EAAI,KACnEuJ,EAAImgB,MAAQtrB,MAAO4B,GACbuJ,CAIR,KAAK,GAAIy9C,KAAaznC,GAAGuS,WACvB,GAAIvS,EAAGuS,WAAW5oB,eAAe89C,GAAY,CAC3C,GAAIl1B,EAAW5oB,eAAe89C,GAG5B,KAFAz9C,GAAM,GAAIxK,OAAM,cAAgBioD,EAAY,sBAC5Cz9C,EAAImgB,MAAQs9B,UAAWA,GACjBz9C,CAGNuoB,GAAWk1B,GAAaznC,EAAGuS,WAAWk1B,GAM5C,GAAe,IAAXznC,EAAGnd,KACL,GAAY,IAARA,EACFA,EAAOmd,EAAGnd,SAEP,IAAIA,GAAQmd,EAAGnd,KAMlB,KALAmH,GAAM,GAAIxK,OAAM,0CAA4CqD,EAAO,aAAemd,EAAGnd,KAAO,KAC5FmH,EAAImgB,MACF6hB,OAAQhsB,EAAGnd,KACXopC,SAAUppC,GAENmH,EAKZ,MAAOw+C,GAAO3lD,EAAM0vB,MAKxB3yB,EAAMjC,OAASA,EACfiC,EAAM8qB,MAAQA,EACd9qB,EAAM6qC,YAAcA,EAEb7qC"} \ No newline at end of file diff --git a/dist/math.min.js b/dist/math.min.js index ad1607691..4e16d215e 100644 --- a/dist/math.min.js +++ b/dist/math.min.js @@ -7,7 +7,7 @@ * mathematical functions, and a flexible expression parser. * * @version 2.0.0-SNAPSHOT - * @date 2015-03-01 + * @date 2015-04-27 * * @license * Copyright (C) 2013-2015 Jos de Jong @@ -24,13 +24,17 @@ * License for the specific language governing permissions and limitations under * the License. */ -!function(e,r){"object"==typeof exports&&"object"==typeof module?module.exports=r():"function"==typeof define&&define.amd?define(r):"object"==typeof exports?exports.math=r():e.math=r()}(this,function(){return function(e){function r(n){if(t[n])return t[n].exports;var i=t[n]={exports:{},id:n,loaded:!1};return e[n].call(i.exports,i,i.exports,r),i.loaded=!0,i.exports}var t={};return r.m=e,r.c=t,r.p="",r(0)}([function(e,r,t){e.exports=t(1)},function(e,r,t){"use strict";function n(e){if("function"!=typeof Object.create)throw new Error("ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.");var r={},h={matrix:"matrix",number:"number",precision:64,epsilon:1e-14};r.config=function(e){if(e){if(o.deepExtend(h,e),e.precision&&r.type.BigNumber.config({precision:e.precision}),t(11)(r,h),e.number&&e.number.defaultType)throw new Error("setting `number.defaultType` is deprecated. Use `number` instead.");if(e.number&&e.number.precision)throw new Error("setting `number.precision` is deprecated. Use `precision` instead.");if(e.matrix&&e.matrix.defaultType)throw new Error("setting `matrix.defaultType` is deprecated. Use `matrix` instead.");if(e.matrix&&e.matrix["default"])throw new Error("setting `matrix.default` is deprecated. Use `matrix` instead.");if(e.decimals)throw new Error("setting `decimals` is deprecated. Use `precision` instead.")}return o.clone(h)},r.create=n;var g=t(12).constructor();return g.convert=function(e){return a(e)>15?e:new g(e)},r.error=t(13),r.type={Complex:s,Range:u,Index:c,Matrix:f,Unit:l,Help:p,ResultSet:m,BigNumber:g},i.types.Complex=function(e){return e instanceof s},i.types.Range=function(e){return e instanceof u},i.types.Index=function(e){return e instanceof c},i.types.Matrix=function(e){return e instanceof f},i.types.Unit=function(e){return e instanceof l},i.types.Help=function(e){return e instanceof p},i.types.ResultSet=function(e){return e instanceof m},i.types.BigNumber=function(e){return e instanceof g},i.conversions=[{from:"number",to:"Complex",convert:function(e){return new s(e,0)}},{from:"BigNumber",to:"Complex",convert:function(e){return new s(e.toNumber(),0)}},{from:"number",to:"string",convert:function(e){return e+""}},{from:"number",to:"BigNumber",convert:function(e){if(a(e)>15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+e+"). Use function bignumber(x) to convert to BigNumber.");return new g(e)}},{from:"boolean",to:"number",convert:function(e){return+e}},{from:"boolean",to:"string",convert:function(e){return+e}},{from:"boolean",to:"BigNumber",convert:function(e){return new g(+e)}},{from:"null",to:"number",convert:function(){return 0}},{from:"null",to:"string",convert:function(){return"null"}},{from:"null",to:"BigNumber",convert:function(){return new g(0)}},{from:"Array",to:"Matrix",convert:function(e){return new f(e)}}],r.collection=t(14),r.expression={},r.expression.node=t(15),r.expression.parse=t(16),r.expression.Parser=t(17),r.expression.docs=t(18),r.json={reviver:t(19)},t(31)(r,h),t(32)(r,h),t(33)(r,h),t(34)(r,h),r.abs=t(35)(h),r.add=t(36)(h),t(37)(r,h),t(38)(r,h),r.divide=t(39)(h),t(40)(r,h),t(41)(r,h),t(42)(r,h),r.exp=t(43)(h),t(44)(r,h),t(45)(r,h),t(46)(r,h),t(47)(r,h),r.log=t(48)(h),t(49)(r,h),t(50)(r,h),r.multiply=t(51)(h),t(52)(r,h),t(53)(r,h),r.pow=t(54)(h),t(55)(r,h),t(56)(r,h),r.sqrt=t(57)(h),t(58)(r,h),r.subtract=t(59)(h),r.unaryMinus=t(60)(h),t(61)(r,h),t(62)(r,h),r.bitAnd=t(63)(h),t(64)(r,h),t(65)(r,h),t(66)(r,h),t(67)(r,h),t(68)(r,h),t(69)(r,h),t(70)(r,h),t(71)(r,h),t(72)(r,h),t(73)(r,h),t(74)(r,h),t(75)(r,h),t(76)(r,h),t(77)(r,h),t(78)(r,h),t(79)(r,h),t(80)(r,h),t(81)(r,h),t(82)(r,h),t(83)(r,h),t(84)(r,h),t(85)(r,h),t(86)(r,h),t(87)(r,h),t(88)(r,h),t(89)(r,h),r.det=t(90)(h),t(91)(r,h),t(92)(r,h),r.eye=t(93)(h),t(94)(r,h),r.inv=t(95)(h),t(96)(r,h),t(97)(r,h),t(98)(r,h),t(99)(r,h),t(100)(r,h),t(101)(r,h),t(102)(r,h),t(103)(r,h),t(104)(r,h),t(105)(r,h),t(106)(r,h),t(107)(r,h),t(108)(r,h),t(109)(r,h),t(110)(r,h),t(111)(r,h),t(112)(r,h),t(113)(r,h),r.equal=t(114)(h),r.larger=t(115)(h),t(116)(r,h),r.smaller=t(117)(h),t(118)(r,h),t(119)(r,h),r.min=t(120)(h),t(121)(r,h),t(122)(r,h),t(123)(r,h),t(124)(r,h),t(125)(r,h),r.sum=t(126)(h),t(127)(r,h),t(128)(r,h),t(129)(r,h),t(130)(r,h),t(131)(r,h),t(132)(r,h),t(133)(r,h),t(134)(r,h),t(135)(r,h),t(136)(r,h),t(137)(r,h),t(138)(r,h),t(139)(r,h),t(140)(r,h),t(141)(r,h),t(142)(r,h),t(143)(r,h),t(144)(r,h),t(145)(r,h),t(146)(r,h),t(147)(r,h),t(148)(r,h),t(149)(r,h),t(150)(r,h),t(151)(r,h),t(152)(r,h),t(153)(r,h),t(154)(r,h),t(155)(r,h),t(156)(r,h),t(157)(r,h),t(158)(r,h),t(159)(r,h),t(160)(r,h),t(161)(r,h),t(162)(r,h),r.ifElse=function(){throw new Error("Function ifElse is deprecated. Use the conditional operator instead.")},t(11)(r,h),r.expression.transform={concat:t(20)(r,h),filter:t(21)(r,h),forEach:t(22)(r,h),index:t(23)(r,h),map:t(24)(r,h),max:t(25)(r,h),mean:t(26)(r,h),min:t(27)(r,h),range:t(28)(r,h),subset:t(29)(r,h)},r.chaining={},r.chaining.Chain=t(30)(r,h),r.chaining.Selector=r.chaining.Chain,r.config(h),r.config(e),r}var i=t(163),o=t(2),a=t(3).digits,s=t(4),u=t(5),c=t(6),f=t(7),l=t(8),p=t(9),m=t(10),h=n();"undefined"!=typeof window&&(window.mathjs=h),e.exports=h},function(e,r,t){"use strict";var n=t(336);r.clone=function i(e){var r=typeof e;if("number"===r||"string"===r||"boolean"===r||null===e||void 0===e)return e;if("function"==typeof e.clone)return e.clone();if(Array.isArray(e))return e.map(function(e){return i(e)});if(e instanceof Number)return new Number(e.valueOf());if(e instanceof String)return new String(e.valueOf());if(e instanceof Boolean)return new Boolean(e.valueOf());if(e instanceof Date)return new Date(e.valueOf());if(e instanceof n)return e;if(e instanceof RegExp)throw new TypeError("Cannot clone "+e);var t={};for(var o in e)e.hasOwnProperty(o)&&(t[o]=i(e[o]));return t},r.extend=function(e,r){for(var t in r)r.hasOwnProperty(t)&&(e[t]=r[t]);return e},r.deepExtend=function o(e,r){if(Array.isArray(r))throw new TypeError("Arrays are not supported by deepExtend");for(var t in r)if(r.hasOwnProperty(t))if(r[t]&&r[t].constructor===Object)void 0===e[t]&&(e[t]={}),e[t].constructor===Object?o(e[t],r[t]):e[t]=r[t];else{if(Array.isArray(r[t]))throw new TypeError("Arrays are not supported by deepExtend");e[t]=r[t]}return e},r.deepEqual=function(e,t){var n,i,o;if(Array.isArray(e)){if(!Array.isArray(t))return!1;if(e.length!=t.length)return!1;for(i=0,o=e.length;o>i;i++)if(!r.deepEqual(e[i],t[i]))return!1;return!0}if(e instanceof Object){if(Array.isArray(t)||!(t instanceof Object))return!1;for(n in e)if(!r.deepEqual(e[n],t[n]))return!1;for(n in t)if(!r.deepEqual(e[n],t[n]))return!1;return!0}return typeof e==typeof t&&e==t},r.canDefineProperty=function(){try{if(Object.defineProperty)return Object.defineProperty({},"x",{}),!0}catch(e){}return!1},r.lazy=function(e,t,n){if(r.canDefineProperty()){var i,o=!0;Object.defineProperty(e,t,{get:function(){return o&&(i=n(),o=!1),i},set:function(e){i=e,o=!1}})}else e[t]=n()}},function(e,r){"use strict";r.isNumber=function(e){return e instanceof Number||"number"==typeof e},r.isInteger=function(e){return e==Math.round(e)},r.sign=function(e){return e>0?1:0>e?-1:0},r.format=function(e,t){if("function"==typeof t)return t(e);if(1/0===e)return"Infinity";if(e===-1/0)return"-Infinity";if(isNaN(e))return"NaN";var n="auto",i=void 0;switch(t&&(t.notation&&(n=t.notation),r.isNumber(t)?i=t:t.precision&&(i=t.precision)),n){case"fixed":return r.toFixed(e,i);case"exponential":return r.toExponential(e,i);case"auto":var o=.001,a=1e5;if(t&&t.exponential&&(void 0!==t.exponential.lower&&(o=t.exponential.lower),void 0!==t.exponential.upper&&(a=t.exponential.upper)),0===e)return"0";var s,u=Math.abs(e);if(u>=o&&a>u){var c=i?e.toPrecision(Math.min(i,21)):e.toPrecision();s=parseFloat(c)+""}else s=r.toExponential(e,i);return s.replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],r=arguments[4];return"."!==e?e+r:r});default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", or "fixed".')}},r.toExponential=function(e,r){return void 0!==r?e.toExponential(Math.min(r-1,20)):e.toExponential()},r.toFixed=function(e,r){return e.toFixed(Math.min(r,20))},r.digits=function(e){return e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length},r.DBL_EPSILON=Number.EPSILON||2.220446049250313e-16,r.nearlyEqual=function(e,t,n){if(null==n)return e==t;if(e==t)return!0;if(isNaN(e)||isNaN(t))return!1;if(isFinite(e)&&isFinite(t)){var i=Math.abs(e-t);return i="0"&&"9">=e||"."==e}function a(e){return e>="0"&&"9">=e}function s(){x++,y=v.charAt(x)}function u(e){x=e,y=v.charAt(x)}function c(){var e,r="";if(e=x,"+"==y?s():"-"==y&&(r+=y,s()),!o(y))return u(e),null;if("."==y){if(r+=y,s(),!a(y))return u(e),null}else{for(;a(y);)r+=y,s();"."==y&&(r+=y,s())}for(;a(y);)r+=y,s();if("E"==y||"e"==y){if(r+=y,s(),("+"==y||"-"==y)&&(r+=y,s()),!a(y))return u(e),null;for(;a(y);)r+=y,s()}return r}function f(){var e=v.charAt(x+1);if("I"==y||"i"==y)return s(),"1";if(!("+"!=y&&"-"!=y||"I"!=e&&"i"!=e)){var r="+"==y?"1":"-1";return s(),s(),r}return null}var l=t(164),p=t(8),m=l.number,h=l.number.isNumber,g=p.isUnit,d=l.string.isString;n.isComplex=function(e){return e instanceof n};var v,x,y;n.parse=function(e){if(v=e,x=-1,y="",!d(v))return null;s(),i();var r=c();if(r){if("I"==y||"i"==y)return s(),i(),y?null:new n(0,Number(r));i();var t=y;if("+"!=t&&"-"!=t)return i(),y?null:new n(Number(r),0);s(),i();var o=c();if(o){if("I"!=y&&"i"!=y)return null;s()}else if(o=f(),!o)return null;return"-"==t&&(o="-"==o[0]?"+"+o.substring(1):"-"+o),s(),i(),y?null:new n(Number(r),Number(o))}return(r=f())?(i(),y?null:new n(0,Number(r))):null},n.fromPolar=function(){switch(arguments.length){case 1:var e=arguments[0];if("object"==typeof e)return n.fromPolar(e.r,e.phi);throw new TypeError("Input has to be an object with r and phi keys.");case 2:var r=arguments[0],t=arguments[1];if(h(r)){if(g(t)&&t.hasBase(p.BASE_UNITS.ANGLE)&&(t=t.toNumber("rad")),h(t))return new n(r*Math.cos(t),r*Math.sin(t));throw new TypeError("Phi is not a number nor an angle unit.")}throw new TypeError("Radius r is not a number.");default:throw new SyntaxError("Wrong number of arguments in function fromPolar")}},n.prototype.toPolar=function(){return{r:Math.sqrt(this.re*this.re+this.im*this.im),phi:Math.atan2(this.im,this.re)}},n.prototype.clone=function(){return new n(this.re,this.im)},n.prototype.equals=function(e){return this.re===e.re&&this.im===e.im},n.prototype.format=function(e){var r="",t=this.im,n=this.re,i=m.format(this.re,e),o=m.format(this.im,e),a=h(e)?e:e?e.precision:null;if(null!==a){var s=Math.pow(10,-a);Math.abs(n/t)0?1==t?i+" + i":i+" + "+o+"i":-1==t?i+" - i":i+" - "+o.substring(1)+"i"},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},n.fromJSON=function(e){return new n(e)},n.prototype.valueOf=n.prototype.toString,e.exports=n},function(e,r,t){"use strict";function n(e,r,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(null!=e&&!o.isNumber(e))throw new TypeError("Parameter start must be a number");if(null!=r&&!o.isNumber(r))throw new TypeError("Parameter end must be a number");if(null!=t&&!o.isNumber(t))throw new TypeError("Parameter step must be a number");this.start=null!=e?parseFloat(e):0,this.end=null!=r?parseFloat(r):0,this.step=null!=t?parseFloat(t):1}{var i=t(164),o=i.number,a=i.string;i.array}n.parse=function(e){if(!a.isString(e))return null;var r=e.split(":"),t=r.map(function(e){return parseFloat(e)}),i=t.some(function(e){return isNaN(e)});if(i)return null;switch(t.length){case 2:return new n(t[0],t[1]);case 3:return new n(t[0],t[2],t[1]);default:return null}},n.prototype.clone=function(){return new n(this.start,this.end,this.step)},n.isRange=function(e){return e instanceof n},n.prototype.size=function(){var e=0,r=this.start,t=this.step,n=this.end,i=n-r;return o.sign(t)==o.sign(i)?e=Math.ceil(i/t):0==i&&(e=0),isNaN(e)&&(e=0),[e]},n.prototype.min=function(){var e=this.size()[0];return e>0?this.step>0?this.start:this.start+(e-1)*this.step:void 0},n.prototype.max=function(){var e=this.size()[0];return e>0?this.step>0?this.start+(e-1)*this.step:this.start:void 0},n.prototype.forEach=function(e){var r=this.start,t=this.step,n=this.end,i=0;if(t>0)for(;n>r;)e(r,i,this),r+=t,i++;else if(0>t)for(;r>n;)e(r,i,this),r+=t,i++},n.prototype.map=function(e){var r=[];return this.forEach(function(t,n,i){r[n]=e(t,n,i)}),r},n.prototype.toArray=function(){var e=[];return this.forEach(function(r,t){e[t]=r}),e},n.prototype.valueOf=function(){return this.toArray()},n.prototype.format=function(e){var r=o.format(this.start,e);return 1!=this.step&&(r+=":"+o.format(this.step,e)),r+=":"+o.format(this.end,e)},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Range",start:this.start,end:this.end,step:this.step}},n.fromJSON=function(e){return new n(e.start,e.end,e.step)},e.exports=n},function(e,r,t){"use strict";function n(){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this._ranges=[],this._isScalar=!0;for(var e=0,r=arguments.length;r>e;e++){var t=arguments[e];if(t instanceof a)this._ranges.push(t),this._isScalar=!1;else if(f(t))this._ranges.push(i(t)),this._isScalar=!1;else if(u(t))this._ranges.push(i([t,t+1]));else{var o=t.valueOf();if(!f(o))throw new TypeError("Ranges must be an Array, Number, or Range");this._ranges.push(i(o)),this._isScalar=!1}}}function i(e){for(var r=e.length,t=0;r>t;t++)if(!u(e[t])||!c(e[t]))throw new TypeError("Index parameters must be integer numbers");switch(e.length){case 2:return new a(e[0],e[1]);case 3:return new a(e[0],e[1],e[2]);default:throw new SyntaxError("Wrong number of arguments in Index (2 or 3 expected)")}}var o=t(164),a=t(5),s=o.number,u=s.isNumber,c=s.isInteger,f=Array.isArray;n.prototype.clone=function(){var e=new n;return e._ranges=o.object.clone(this._ranges),e._isScalar=this._isScalar,e},n.isIndex=function(e){return e instanceof n},n.create=function(e){var r=new n;return n.apply(r,e),r},n.prototype.size=function(){for(var e=[],r=0,t=this._ranges.length;t>r;r++){var n=this._ranges[r];e[r]=n.size()[0]}return e},n.prototype.max=function(){for(var e=[],r=0,t=this._ranges.length;t>r;r++){var n=this._ranges[r];e[r]=n.max()}return e},n.prototype.min=function(){for(var e=[],r=0,t=this._ranges.length;t>r;r++){var n=this._ranges[r];e[r]=n.min()}return e},n.prototype.forEach=function(e){for(var r=0,t=this._ranges.length;t>r;r++)e(this._ranges[r],r,this)},n.prototype.range=function(e){return this._ranges[e]||null},n.prototype.isScalar=function(){return this._isScalar},n.prototype.toArray=function(){for(var e=[],r=0,t=this._ranges.length;t>r;r++){var n=this._ranges[r],i=[],o=n.start,a=n.end,s=n.step;if(s>0)for(;a>o;)i.push(o),o+=s;else if(0>s)for(;o>a;)i.push(o),o+=s;e.push(i)}return e},n.prototype.valueOf=n.prototype.toArray,n.prototype.toString=function(){for(var e=[],r=0,t=this._ranges.length;t>r;r++){var n=this._ranges[r],i=s.format(n.start);1!=n.step&&(i+=":"+s.format(n.step)),i+=":"+s.format(n.end),e.push(i)}return"["+e.join(", ")+"]"},n.prototype.toJSON=function(){return{mathjs:"Index",ranges:this._ranges}},n.fromJSON=function(e){return n.create(e.ranges)},e.exports=n},function(e,r,t){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(e instanceof n)this._data=e.clone()._data;else if(d(e))this._data=c(e);else{if(null!=e)throw new TypeError("Unsupported type of data ("+f.types.type(e)+")");this._data=[]}this._size=h.size(this._data)}function i(e,r){if(!(r instanceof p))throw new TypeError("Invalid index");var t=r.isScalar();if(t)return e.get(r.min());var i=r.size();if(i.length!=e._size.length)throw new l(i.length,e._size.length);for(var a=r.min(),s=r.max(),u=0,c=e._size.length;c>u;u++)v(a[u],e._size[u]),v(s[u],e._size[u]);return new n(o(e._data,r,i.length,0))}function o(e,r,t,n){var i=n==t-1,a=r.range(n);return a.map(i?function(r){return e[r]}:function(i){var a=e[i];return o(a,r,t,n+1)})}function a(e,r,t,i){if(!(r instanceof p))throw new TypeError("Invalid index");var o,a=r.size(),c=r.isScalar();if(t instanceof n?(o=t.size(),t=t.valueOf()):o=h.size(t),c){if(0!=o.length)throw new TypeError("Scalar expected");e.set(r.min(),t,i)}else{if(a.length");var d=r.max().map(function(e){return e+1});u(e,d,i);var v=a.length,x=0;s(e._data,r,t,v,x)}return e}function s(e,r,t,n,i){var o=i==n-1,a=r.range(i);a.forEach(o?function(r,n){v(r),e[r]=t[n]}:function(o,a){v(o),s(e[o],r,t[a],n,i+1)})}function u(e,r,t){for(var n=g.clone(e._size),i=!1;n.lengtho;o++)r[o]>n[o]&&(n[o]=r[o],i=!0);i&&e.resize(n,t)}function c(e){for(var r=0,t=e.length;t>r;r++){var i=e[r];d(i)?e[r]=c(i):i instanceof n&&(e[r]=c(i._data))}return e}var f=t(164),l=t(165),p=t(6),m=(f.number,f.string),h=f.array,g=f.object,d=Array.isArray,v=h.validateIndex;n.isMatrix=function(e){return e instanceof n},n.prototype.subset=function(e,r,t){switch(arguments.length){case 1:return i(this,e);case 2:case 3:return a(this,e,r,t);default:throw new SyntaxError("Wrong number of arguments")}},n.prototype.get=function(e){if(!d(e))throw new TypeError("Array expected");if(e.length!=this._size.length)throw new l(e.length,this._size.length);for(var r=this._data,t=0,n=e.length;n>t;t++){var i=e[t];v(i,r.length),r=r[i]}return g.clone(r)},n.prototype.set=function(e,r,t){var n,i;if(!d(e))throw new Error("Array expected");if(e.lengthn;n++){var s=e[n];v(s,a.length),a=a[s]}return s=e[e.length-1],v(s,a.length),a[s]=r,this},n.prototype.resize=function(e,r){return this._size=g.clone(e),this._data=h.resize(this._data,this._size,r),this},n.prototype.clone=function(){var e=new n;return e._data=g.clone(this._data),e._size=g.clone(this._size),e},n.prototype.size=function(){return this._size},n.prototype.map=function(e){var r=this,t=new n,i=function(t,n){return d(t)?t.map(function(e,r){return i(e,n.concat(r))}):e(t,n,r)};return t._data=i(this._data,[]),t._size=g.clone(this._size),t},n.prototype.forEach=function(e){var r=this,t=function(n,i){d(n)?n.forEach(function(e,r){t(e,i.concat(r))}):e(n,i,r)};t(this._data,[])},n.prototype.toArray=function(){return g.clone(this._data)},n.prototype.valueOf=function(){return this._data},n.prototype.format=function(e){return m.format(this._data,e)},n.prototype.toString=function(){return m.format(this._data)},n.prototype.toJSON=function(){return{mathjs:"Matrix",data:this._data}},n.fromJSON=function(e){return new n(e.data)},e.exports=n},function(e,r,t){"use strict";function n(e,r){if(!(this instanceof n))throw new Error("Constructor must be called with the new operator");if(void 0!=e&&!x(e))throw new TypeError("First parameter in Unit constructor must be a number");if(void 0!=r&&(!y(r)||""==r))throw new TypeError("Second parameter in Unit constructor must be a string");if(void 0!=r){var t=l(r);if(!t)throw new SyntaxError('Unknown unit "'+r+'"');this.unit=t.unit,this.prefix=t.prefix}else this.unit=A,this.prefix=b;this.value=void 0!=e?this._normalize(e):null,this.fixPrefix=!1}function i(){for(;" "==h||" "==h;)s()}function o(e){return e>="0"&&"9">=e||"."==e}function a(e){return e>="0"&&"9">=e}function s(){m++,h=p.charAt(m)}function u(e){m=e,h=p.charAt(m)}function c(){var e,r="";if(e=m,"+"==h?s():"-"==h&&(r+=h,s()),!o(h))return u(e),null;if("."==h){if(r+=h,s(),!a(h))return u(e),null}else{for(;a(h);)r+=h,s();"."==h&&(r+=h,s())}for(;a(h);)r+=h,s();if("E"==h||"e"==h){if(r+=h,s(),("+"==h||"-"==h)&&(r+=h,s()),!a(h))return u(e),null;for(;a(h);)r+=h,s()}return r}function f(){var e="";for(i();h&&" "!=h&&" "!=h;)e+=h,s();return e||null}function l(e){for(var r in M)if(M.hasOwnProperty(r)&&v.endsWith(e,r)){var t=M[r],n=e.length-r.length,i=e.substring(0,n),o=t.prefixes[i];if(void 0!==o)return{unit:t,prefix:o}}return null}var p,m,h,g=t(164),d=g.number,v=g.string,x=g.number.isNumber,y=g.string.isString;n.parse=function(e){if(p=e,m=-1,h="",!y(p))return null;s(),i();var r,t=c();if(t){if(r=f(),s(),i(),h)return null;if(t&&r)try{return new n(Number(t),r)}catch(o){}}else{if(r=f(),s(),i(),h)return null;if(r)try{return new n(null,r)}catch(o){}}return null},n.isUnit=function(e){return e instanceof n},n.prototype.clone=function(){var e=new n;for(var r in this)this.hasOwnProperty(r)&&(e[r]=this[r]);return e},n.prototype._normalize=function(e){return(e+this.unit.offset)*this.unit.value*this.prefix.value},n.prototype._denormalize=function(e,r){return void 0==r?e/this.unit.value/this.prefix.value-this.unit.offset:e/this.unit.value/r-this.unit.offset},n.isValuelessUnit=function(e){return null!=l(e)},n.prototype.hasBase=function(e){return this.unit.base===e},n.prototype.equalBase=function(e){return this.unit.base===e.unit.base},n.prototype.equals=function(e){return this.equalBase(e)&&this.value==e.value},n.prototype.to=function(e){var r,t=null==this.value?this._normalize(1):this.value;if(y(e)){if(r=new n(null,e),!this.equalBase(r))throw new Error("Units do not match");return r.value=t,r.fixPrefix=!0,r}if(e instanceof n){if(!this.equalBase(e))throw new Error("Units do not match");if(null!==e.value)throw new Error("Cannot convert to a unit with a value");return r=e.clone(),r.value=t,r.fixPrefix=!0,r}throw new Error("String or Unit expected as parameter")},n.prototype.toNumber=function(e){var r=this.to(e);return r._denormalize(r.value,r.prefix.value)},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Unit",value:this._denormalize(this.value),unit:this.prefix.name+this.unit.name,fixPrefix:this.fixPrefix}},n.fromJSON=function(e){var r=new n(e.value,e.unit);return r.fixPrefix=e.fixPrefix||!1,r},n.prototype.valueOf=n.prototype.toString,n.prototype.format=function(e){var r,t;if(null===this.value||this.fixPrefix)r=this._denormalize(this.value),t=null!==this.value?d.format(r,e)+" ":"",t+=this.prefix.name+this.unit.name;else{var n=this._bestPrefix();r=this._denormalize(this.value,n.value),t=d.format(r,e)+" ",t+=n.name+this.unit.name}return t},n.prototype._bestPrefix=function(){var e=Math.abs(this.value/this.unit.value),r=b,t=Math.abs(Math.log(e/r.value)/Math.LN10-1.2),n=this.unit.prefixes;for(var i in n)if(n.hasOwnProperty(i)){var o=n[i];if(o.scientific){var a=Math.abs(Math.log(e/o.value)/Math.LN10-1.2);t>a&&(r=o,t=a)}}return r};var w={NONE:{"":{name:"",value:1,scientific:!0}},SHORT:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:10,scientific:!1},h:{name:"h",value:100,scientific:!1},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},d:{name:"d",value:.1,scientific:!1},c:{name:"c",value:.01,scientific:!1},m:{name:"m",value:.001,scientific:!0},u:{name:"u",value:1e-6,scientific:!0},n:{name:"n",value:1e-9,scientific:!0},p:{name:"p",value:1e-12,scientific:!0},f:{name:"f",value:1e-15,scientific:!0},a:{name:"a",value:1e-18,scientific:!0},z:{name:"z",value:1e-21,scientific:!0},y:{name:"y",value:1e-24,scientific:!0}},LONG:{"":{name:"",value:1,scientific:!0},deca:{name:"deca",value:10,scientific:!1},hecto:{name:"hecto",value:100,scientific:!1},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},deci:{name:"deci",value:.1,scientific:!1},centi:{name:"centi",value:.01,scientific:!1},milli:{name:"milli",value:.001,scientific:!0},micro:{name:"micro",value:1e-6,scientific:!0},nano:{name:"nano",value:1e-9,scientific:!0},pico:{name:"pico",value:1e-12,scientific:!0},femto:{name:"femto",value:1e-15,scientific:!0},atto:{name:"atto",value:1e-18,scientific:!0},zepto:{name:"zepto",value:1e-21,scientific:!0},yocto:{name:"yocto",value:1e-24,scientific:!0}},SQUARED:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:100,scientific:!1},h:{name:"h",value:1e4,scientific:!1},k:{name:"k",value:1e6,scientific:!0},M:{name:"M",value:1e12,scientific:!0},G:{name:"G",value:1e18,scientific:!0},T:{name:"T",value:1e24,scientific:!0},P:{name:"P",value:1e30,scientific:!0},E:{name:"E",value:1e36,scientific:!0},Z:{name:"Z",value:1e42,scientific:!0},Y:{name:"Y",value:1e48,scientific:!0},d:{name:"d",value:.01,scientific:!1},c:{name:"c",value:1e-4,scientific:!1},m:{name:"m",value:1e-6,scientific:!0},u:{name:"u",value:1e-12,scientific:!0},n:{name:"n",value:1e-18,scientific:!0},p:{name:"p",value:1e-24,scientific:!0},f:{name:"f",value:1e-30,scientific:!0},a:{name:"a",value:1e-36,scientific:!0},z:{name:"z",value:1e-42,scientific:!0},y:{name:"y",value:1e-42,scientific:!0}},CUBIC:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:1e3,scientific:!1},h:{name:"h",value:1e6,scientific:!1},k:{name:"k",value:1e9,scientific:!0},M:{name:"M",value:1e18,scientific:!0},G:{name:"G",value:1e27,scientific:!0},T:{name:"T",value:1e36,scientific:!0},P:{name:"P",value:1e45,scientific:!0},E:{name:"E",value:1e54,scientific:!0},Z:{name:"Z",value:1e63,scientific:!0},Y:{name:"Y",value:1e72,scientific:!0},d:{name:"d",value:.001,scientific:!1},c:{name:"c",value:1e-6,scientific:!1},m:{name:"m",value:1e-9,scientific:!0},u:{name:"u",value:1e-18,scientific:!0},n:{name:"n",value:1e-27,scientific:!0},p:{name:"p",value:1e-36,scientific:!0},f:{name:"f",value:1e-45,scientific:!0},a:{name:"a",value:1e-54,scientific:!0},z:{name:"z",value:1e-63,scientific:!0},y:{name:"y",value:1e-72,scientific:!0}},BINARY_SHORT:{"":{name:"",value:1,scientific:!0},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},Ki:{name:"Ki",value:1024,scientific:!0},Mi:{name:"Mi",value:Math.pow(1024,2),scientific:!0},Gi:{name:"Gi",value:Math.pow(1024,3),scientific:!0},Ti:{name:"Ti",value:Math.pow(1024,4),scientific:!0},Pi:{name:"Pi",value:Math.pow(1024,5),scientific:!0},Ei:{name:"Ei",value:Math.pow(1024,6),scientific:!0},Zi:{name:"Zi",value:Math.pow(1024,7),scientific:!0},Yi:{name:"Yi",value:Math.pow(1024,8),scientific:!0}},BINARY_LONG:{"":{name:"",value:1,scientific:!0},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},kibi:{name:"kibi",value:1024,scientific:!0},mebi:{name:"mebi",value:Math.pow(1024,2),scientific:!0},gibi:{name:"gibi",value:Math.pow(1024,3),scientific:!0},tebi:{name:"tebi",value:Math.pow(1024,4),scientific:!0},pebi:{name:"pebi",value:Math.pow(1024,5),scientific:!0},exi:{name:"exi",value:Math.pow(1024,6),scientific:!0},zebi:{name:"zebi",value:Math.pow(1024,7),scientific:!0},yobi:{name:"yobi",value:Math.pow(1024,8),scientific:!0}}},b={name:"",value:1,scientific:!0},E={NONE:{},LENGTH:{},MASS:{},TIME:{},CURRENT:{},TEMPERATURE:{},LUMINOUS_INTENSITY:{},AMOUNT_OF_SUBSTANCE:{},FORCE:{},SURFACE:{},VOLUME:{},ANGLE:{},BIT:{}},N={},A={name:"",base:N,value:1,offset:0},M={meter:{name:"meter",base:E.LENGTH,prefixes:w.LONG,value:1,offset:0},inch:{name:"inch",base:E.LENGTH,prefixes:w.NONE,value:.0254,offset:0},foot:{name:"foot",base:E.LENGTH,prefixes:w.NONE,value:.3048,offset:0},yard:{name:"yard",base:E.LENGTH,prefixes:w.NONE,value:.9144,offset:0},mile:{name:"mile",base:E.LENGTH,prefixes:w.NONE,value:1609.344,offset:0},link:{name:"link",base:E.LENGTH,prefixes:w.NONE,value:.201168,offset:0},rod:{name:"rod",base:E.LENGTH,prefixes:w.NONE,value:5.02921,offset:0},chain:{name:"chain",base:E.LENGTH,prefixes:w.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:E.LENGTH,prefixes:w.NONE,value:1e-10,offset:0},m:{name:"m",base:E.LENGTH,prefixes:w.SHORT,value:1,offset:0},"in":{name:"in",base:E.LENGTH,prefixes:w.NONE,value:.0254,offset:0},ft:{name:"ft",base:E.LENGTH,prefixes:w.NONE,value:.3048,offset:0},yd:{name:"yd",base:E.LENGTH,prefixes:w.NONE,value:.9144,offset:0},mi:{name:"mi",base:E.LENGTH,prefixes:w.NONE,value:1609.344,offset:0},li:{name:"li",base:E.LENGTH,prefixes:w.NONE,value:.201168,offset:0},rd:{name:"rd",base:E.LENGTH,prefixes:w.NONE,value:5.02921,offset:0},ch:{name:"ch",base:E.LENGTH,prefixes:w.NONE,value:20.1168,offset:0},mil:{name:"mil",base:E.LENGTH,prefixes:w.NONE,value:254e-7,offset:0},m2:{name:"m2",base:E.SURFACE,prefixes:w.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:E.SURFACE,prefixes:w.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:E.SURFACE,prefixes:w.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:E.SURFACE,prefixes:w.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:E.SURFACE,prefixes:w.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:E.SURFACE,prefixes:w.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:E.SURFACE,prefixes:w.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:E.SURFACE,prefixes:w.NONE,value:6.4516e-10,offset:0},m3:{name:"m3",base:E.VOLUME,prefixes:w.CUBIC,value:1,offset:0},L:{name:"L",base:E.VOLUME,prefixes:w.SHORT,value:.001,offset:0},l:{name:"l",base:E.VOLUME,prefixes:w.SHORT,value:.001,offset:0},litre:{name:"litre",base:E.VOLUME,prefixes:w.LONG,value:.001,offset:0},cuin:{name:"cuin",base:E.VOLUME,prefixes:w.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:E.VOLUME,prefixes:w.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:E.VOLUME,prefixes:w.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:E.VOLUME,prefixes:w.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:E.VOLUME,prefixes:w.NONE,value:15e-6,offset:0},drop:{name:"drop",base:E.VOLUME,prefixes:w.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:E.VOLUME,prefixes:w.NONE,value:5e-8,offset:0},minim:{name:"minim",base:E.VOLUME,prefixes:w.NONE,value:6.161152e-8,offset:0},fluiddram:{name:"fluiddram",base:E.VOLUME,prefixes:w.NONE,value:36966911e-13,offset:0},fluidounce:{name:"fluidounce",base:E.VOLUME,prefixes:w.NONE,value:2957353e-11,offset:0},gill:{name:"gill",base:E.VOLUME,prefixes:w.NONE,value:.0001182941,offset:0},cc:{name:"cc",base:E.VOLUME,prefixes:w.NONE,value:1e-6,offset:0},cup:{name:"cup",base:E.VOLUME,prefixes:w.NONE,value:.0002365882,offset:0},pint:{name:"pint",base:E.VOLUME,prefixes:w.NONE,value:.0004731765,offset:0},quart:{name:"quart",base:E.VOLUME,prefixes:w.NONE,value:.0009463529,offset:0},gallon:{name:"gallon",base:E.VOLUME,prefixes:w.NONE,value:.003785412,offset:0},beerbarrel:{name:"beerbarrel",base:E.VOLUME,prefixes:w.NONE,value:.1173478,offset:0},oilbarrel:{name:"oilbarrel",base:E.VOLUME,prefixes:w.NONE,value:.1589873,offset:0},hogshead:{name:"hogshead",base:E.VOLUME,prefixes:w.NONE,value:.238481,offset:0},fldr:{name:"fldr",base:E.VOLUME,prefixes:w.NONE,value:36966911e-13,offset:0},floz:{name:"floz",base:E.VOLUME,prefixes:w.NONE,value:2957353e-11,offset:0},gi:{name:"gi",base:E.VOLUME,prefixes:w.NONE,value:.0001182941,offset:0},cp:{name:"cp",base:E.VOLUME,prefixes:w.NONE,value:.0002365882,offset:0},pt:{name:"pt",base:E.VOLUME,prefixes:w.NONE,value:.0004731765,offset:0},qt:{name:"qt",base:E.VOLUME,prefixes:w.NONE,value:.0009463529,offset:0},gal:{name:"gal",base:E.VOLUME,prefixes:w.NONE,value:.003785412,offset:0},bbl:{name:"bbl",base:E.VOLUME,prefixes:w.NONE,value:.1173478,offset:0},obl:{name:"obl",base:E.VOLUME,prefixes:w.NONE,value:.1589873,offset:0},g:{name:"g",base:E.MASS,prefixes:w.SHORT,value:.001,offset:0},gram:{name:"gram",base:E.MASS,prefixes:w.LONG,value:.001,offset:0},ton:{name:"ton",base:E.MASS,prefixes:w.SHORT,value:907.18474,offset:0},tonne:{name:"tonne",base:E.MASS,prefixes:w.SHORT,value:1e3,offset:0},grain:{name:"grain",base:E.MASS,prefixes:w.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:E.MASS,prefixes:w.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:E.MASS,prefixes:w.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:E.MASS,prefixes:w.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:E.MASS,prefixes:w.NONE,value:45.359237,offset:0},stick:{name:"stick",base:E.MASS,prefixes:w.NONE,value:.115,offset:0},gr:{name:"gr",base:E.MASS,prefixes:w.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:E.MASS,prefixes:w.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:E.MASS,prefixes:w.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:E.MASS,prefixes:w.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:E.MASS,prefixes:w.NONE,value:45.359237,offset:0},s:{name:"s",base:E.TIME,prefixes:w.SHORT,value:1,offset:0},min:{name:"min",base:E.TIME,prefixes:w.NONE,value:60,offset:0},h:{name:"h",base:E.TIME,prefixes:w.NONE,value:3600,offset:0},second:{name:"second",base:E.TIME,prefixes:w.LONG,value:1,offset:0},sec:{name:"sec",base:E.TIME,prefixes:w.LONG,value:1,offset:0},minute:{name:"minute",base:E.TIME,prefixes:w.NONE,value:60,offset:0},hour:{name:"hour",base:E.TIME,prefixes:w.NONE,value:3600,offset:0},day:{name:"day",base:E.TIME,prefixes:w.NONE,value:86400,offset:0},rad:{name:"rad",base:E.ANGLE,prefixes:w.NONE,value:1,offset:0},deg:{name:"deg",base:E.ANGLE,prefixes:w.NONE,value:.017453292519943295,offset:0},grad:{name:"grad",base:E.ANGLE,prefixes:w.NONE,value:.015707963267948967,offset:0},cycle:{name:"cycle",base:E.ANGLE,prefixes:w.NONE,value:6.283185307179586,offset:0},A:{name:"A",base:E.CURRENT,prefixes:w.SHORT,value:1,offset:0},ampere:{name:"ampere",base:E.CURRENT,prefixes:w.LONG,value:1,offset:0},K:{name:"K",base:E.TEMPERATURE,prefixes:w.NONE,value:1,offset:0},degC:{name:"degC",base:E.TEMPERATURE,prefixes:w.NONE,value:1,offset:273.15},degF:{name:"degF",base:E.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:459.67},degR:{name:"degR",base:E.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:0},kelvin:{name:"kelvin",base:E.TEMPERATURE,prefixes:w.NONE,value:1,offset:0},celsius:{name:"celsius",base:E.TEMPERATURE,prefixes:w.NONE,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:E.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:459.67},rankine:{name:"rankine",base:E.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:0},mol:{name:"mol",base:E.AMOUNT_OF_SUBSTANCE,prefixes:w.NONE,value:1,offset:0},mole:{name:"mole",base:E.AMOUNT_OF_SUBSTANCE,prefixes:w.NONE,value:1,offset:0},cd:{name:"cd",base:E.LUMINOUS_INTENSITY,prefixes:w.NONE,value:1,offset:0},candela:{name:"candela",base:E.LUMINOUS_INTENSITY,prefixes:w.NONE,value:1,offset:0},N:{name:"N",base:E.FORCE,prefixes:w.SHORT,value:1,offset:0},newton:{name:"newton",base:E.FORCE,prefixes:w.LONG,value:1,offset:0},lbf:{name:"lbf",base:E.FORCE,prefixes:w.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:E.FORCE,prefixes:w.NONE,value:4.4482216152605,offset:0},b:{name:"b",base:E.BIT,prefixes:w.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:E.BIT,prefixes:w.BINARY_LONG,value:1,offset:0},B:{name:"B",base:E.BIT,prefixes:w.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:E.BIT,prefixes:w.BINARY_LONG,value:8,offset:0}},T={meters:"meter",inches:"inch",feet:"foot",yards:"yard",miles:"mile",links:"link",rods:"rod",chains:"chain",angstroms:"angstrom",litres:"litre",teaspoons:"teaspoon",tablespoons:"tablespoon",minims:"minim",fluiddrams:"fluiddram",fluidounces:"fluidounce",gills:"gill",cups:"cup",pints:"pint",quarts:"quart",gallons:"gallon",beerbarrels:"beerbarrel",oilbarrels:"oilbarrel",hogsheads:"hogshead",gtts:"gtt",grams:"gram",tons:"ton",tonnes:"tonne",grains:"grain",drams:"dram",ounces:"ounce",poundmasses:"poundmass",hundredweights:"hundredweight",sticks:"stick",seconds:"second",minutes:"minute",hours:"hour",days:"day",radians:"rad",degrees:"deg",gradients:"grad",cycles:"cycle",amperes:"ampere",moles:"mole"}; -for(var S in T)if(T.hasOwnProperty(S)){var O=M[T[S]],C=Object.create(O);C.name=S,M[S]=C}M.lt=M.l,M.liter=M.litre,M.liters=M.litres,M.lb=M.lbm,M.lbs=M.lbm,n.PREFIXES=w,n.BASE_UNITS=E,n.UNITS=M,e.exports=n},function(e,r,t){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!e)throw new Error('Argument "doc" missing');this.doc=e}var i=t(164),o=i.object,a=i.string;n.isHelp=function(e){return e instanceof n},n.prototype.toText=function(e){var r=this.doc||{},t="\n";if(r.name&&(t+="Name: "+r.name+"\n\n"),r.category&&(t+="Category: "+r.category+"\n\n"),r.description&&(t+="Description:\n "+r.description+"\n\n"),r.syntax&&(t+="Syntax:\n "+r.syntax.join("\n ")+"\n\n"),r.examples){var i=e&&e.parser();t+="Examples:\n";for(var o=0;o=r){if(f(e[0])){for(u=i(e),a=[],o=0;ot;t++){var a=[];for(r=0;n>r;r++)a.push(e[r][t]);o.push(a)}return o}{var o=t(164),a=t(170),s=t(165),u=t(7),c=o.array,f=o.array.isArray;o.string.isString}r.argsToArray=function(e){if(0==e.length)return[];if(1==e.length){var r=e[0];return r instanceof u&&(r=r.valueOf()),f(r)||(r=[r]),r}return o.array.argsToArray(e)},r.isCollection=function(e){return f(e)||e instanceof u},r.deepMap=function l(e,r){return e&&"function"==typeof e.map?e.map(function(e){return l(e,r)}):r(e)},r.deepMap2=function p(e,r,t){var n,i,o;if(f(e))if(f(r)){if(e.length!=r.length)throw new s(e.length,r.length);for(n=[],i=e.length,o=0;i>o;o++)n[o]=p(e[o],r[o],t)}else{if(r instanceof u)return n=p(e,r.valueOf(),t),new u(n);for(n=[],i=e.length,o=0;i>o;o++)n[o]=p(e[o],r,t)}else{if(e instanceof u)return r instanceof u?(n=p(e.valueOf(),r.valueOf(),t),new u(n)):(n=p(e.valueOf(),r,t),new u(n));if(f(r))for(n=[],i=r.length,o=0;i>o;o++)n[o]=p(e,r[o],t);else{if(r instanceof u)return n=p(e,r.valueOf(),t),new u(n);n=t(e,r)}}return n},r.reduce=function(e,r,t){var i=f(e)?c.size(e):e.size();if(0>r)throw new a(r);if(r>=i.length)throw new a(r,i.length);return e instanceof u?new u(n(e.valueOf(),r,t)):n(e,r,t)},r.deepForEach=function m(e,r){e instanceof u&&(e=e.valueOf());for(var t=0,n=e.length;n>t;t++){var i=e[t];f(i)?m(i,r):r(i)}}},function(e,r,t){"use strict";r.ArrayNode=t(172),r.AssignmentNode=t(173),r.BlockNode=t(174),r.ConditionalNode=t(175),r.ConstantNode=t(176),r.IndexNode=t(177),r.FunctionAssignmentNode=t(178),r.FunctionNode=t(179),r.Node=t(180),r.OperatorNode=t(181),r.RangeNode=t(182),r.SymbolNode=t(183),r.UpdateNode=t(184)},function(e,r,t){"use strict";function n(e,r){if(1!=arguments.length&&2!=arguments.length)throw new J("parse",arguments.length,1,2);if(gr=r&&r.nodes?r.nodes:{},K(e))return dr=e,g();if(X(e)||e instanceof Q)return $.deepMap(e,function(e){if(!K(e))throw new TypeError("String expected");return dr=e,g()});throw new TypeError("String or matrix expected")}function i(){vr=0,xr=dr.charAt(0),br=0,Er=null}function o(){vr++,xr=dr.charAt(vr)}function a(){return dr.charAt(vr+1)}function s(){return dr.charAt(vr+2)}function u(){for(wr=pr.NULL,yr="";" "==xr||" "==xr||"\n"==xr&&br;)o();if("#"==xr)for(;"\n"!=xr&&""!=xr;)o();if(""==xr)return void(wr=pr.DELIMITER);if("\n"==xr&&!br)return wr=pr.DELIMITER,yr=xr,void o();var e=xr+a(),r=e+s();if(3==r.length&&mr[r])return wr=pr.DELIMITER,yr=r,o(),o(),void o();if(2==e.length&&mr[e])return wr=pr.DELIMITER,yr=e,o(),void o();if(mr[xr])return wr=pr.DELIMITER,yr=xr,void o();if(!m(xr)){if(p(xr)){for(;p(xr)||h(xr);)yr+=xr,o();return void(wr=hr[yr]?pr.DELIMITER:pr.SYMBOL)}for(wr=pr.UNKNOWN;""!=xr;)yr+=xr,o();throw H('Syntax error in part "'+yr+'"')}if(wr=pr.NUMBER,"."==xr)yr+=xr,o(),h(xr)||(wr=pr.UNKNOWN);else{for(;h(xr);)yr+=xr,o();"."==xr&&(yr+=xr,o())}for(;h(xr);)yr+=xr,o();if(e=a(),("E"==xr||"e"==xr)&&(h(e)||"-"==e||"+"==e))for(yr+=xr,o(),("+"==xr||"-"==xr)&&(yr+=xr,o()),h(xr)||(wr=pr.UNKNOWN);h(xr);)yr+=xr,o()}function c(){do u();while("\n"==yr)}function f(){br++}function l(){br--}function p(e){return e>="a"&&"z">=e||e>="A"&&"Z">=e||"_"==e}function m(e){return e>="0"&&"9">=e||"."==e}function h(e){return e>="0"&&"9">=e}function g(){i(),u();var e=d();if(""!=yr)throw wr==pr.DELIMITER?Y("Unexpected operator "+yr):H('Unexpected part "'+yr+'"');return e}function d(){var e,r,t=[];if(""==yr)return new ir("undefined","undefined");for("\n"!=yr&&";"!=yr&&(e=v());"\n"==yr||";"==yr;)0==t.length&&e&&(r=";"!=yr,t.push({node:e,visible:r})),u(),"\n"!=yr&&";"!=yr&&""!=yr&&(e=v(),r=";"!=yr,t.push({node:e,visible:r}));return t.length>0?new tr(t):e}function v(){if(wr==pr.SYMBOL&&"function"==yr)throw H('Deprecated keyword "function". Functions can now be assigned without it, like "f(x) = x^2".');return x()}function x(){var e,r,t,n,i=y();if("="==yr){if(i instanceof fr)return e=i.name,c(),t=x(),new rr(e,t);if(i instanceof ar)return c(),t=x(),new lr(i,t);if(i instanceof ur&&(n=!0,r=[],e=i.name,i.args.forEach(function(e,t){e instanceof fr?r[t]=e.name:n=!1}),n))return c(),t=x(),new or(e,r,t);throw H("Invalid left hand side of assignment operator =")}return i}function y(){for(var e=w();"?"==yr;){var r=Er;Er=br,c();var t=e,n=w();if(":"!=yr)throw H("False part of conditional expression expected");Er=null,c();var i=y();e=new nr(t,n,i),Er=r}return e}function w(){for(var e=b();"or"==yr;)c(),e=new sr("or","or",[e,b()]);return e}function b(){for(var e=E();"xor"==yr;)c(),e=new sr("xor","xor",[e,E()]);return e}function E(){for(var e=N();"and"==yr;)c(),e=new sr("and","and",[e,N()]);return e}function N(){for(var e=A();"|"==yr;)c(),e=new sr("|","bitOr",[e,A()]);return e}function A(){for(var e=M();"^|"==yr;)c(),e=new sr("^|","bitXor",[e,M()]);return e}function M(){for(var e=T();"&"==yr;)c(),e=new sr("&","bitAnd",[e,T()]);return e}function T(){var e,r,t,n,i;for(e=S(),r={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};yr in r;)t=yr,n=r[t],c(),i=[e,S()],e=new sr(t,n,i);return e}function S(){var e,r,t,n,i;for(e=O(),r={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};yr in r;)t=yr,n=r[t],c(),i=[e,O()],e=new sr(t,n,i);return e}function O(){var e,r,t,n,i;for(e=C(),r={to:"to","in":"to"};yr in r;)t=yr,n=r[t],c(),i=[e,C()],e=new sr(t,n,i);return e}function C(){var e,r=[];if(e=":"==yr?new ir("1","number"):_(),":"==yr&&Er!==br){for(r.push(e);":"==yr&&r.length<3;)c(),r.push(")"==yr||"]"==yr||","==yr||""==yr?new fr("end"):_());e=3==r.length?new cr(r[0],r[2],r[1]):new cr(r[0],r[1])}return e}function _(){var e,r,t,n,i;for(e=B(),r={"+":"add","-":"subtract"};yr in r;)t=yr,n=r[t],c(),i=[e,B()],e=new sr(t,n,i);return e}function B(){var e,r,t,n,i;if(e=U(),r={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide","%":"mod",mod:"mod"},yr in r)for(;yr in r;)t=yr,n=r[t],c(),i=[e,U()],e=new sr(t,n,i);return(wr==pr.SYMBOL||"in"==yr&&e instanceof ir||wr==pr.NUMBER&&!(e instanceof ir)||"("==yr||"["==yr)&&(e=new sr("*","multiply",[e,B()])),e}function U(){var e,r,t={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"}[yr];return t?(e=yr,c(),r=[U()],new sr(e,t,r)):q()}function q(){var e,r,t,n;return e=I(),("^"==yr||".^"==yr)&&(r=yr,t="^"==r?"pow":"dotPow",c(),n=[e,U()],e=new sr(r,t,n)),e}function I(){var e,r,t,n,i;for(e=z(),r={"!":"factorial","'":"transpose"};yr in r;)t=yr,n=r[t],u(),i=[e],e=new sr(t,n,i);return e}function z(){var e,r=[];if(wr==pr.SYMBOL&&gr[yr]){if(e=gr[yr],u(),"("==yr){if(r=[],f(),u(),")"!=yr)for(r.push(y());","==yr;)u(),r.push(y());if(")"!=yr)throw H("Parenthesis ) expected");l(),u()}return new e(r)}return P()}function P(){var e,r;return wr==pr.SYMBOL||wr==pr.DELIMITER&&yr in hr?(r=yr,u(),e=R(r),e=L(e)):F()}function R(e){var r;if("("==yr){if(r=[],f(),u(),")"!=yr)for(r.push(y());","==yr;)u(),r.push(y());if(")"!=yr)throw H("Parenthesis ) expected");return l(),u(),new ur(e,r)}return new fr(e)}function L(e){for(var r;"["==yr;){if(r=[],f(),u(),"]"!=yr)for(r.push(y());","==yr;)u(),r.push(y());if("]"!=yr)throw H("Parenthesis ] expected");l(),u(),e=new ar(e,r)}return e}function F(){var e,r,t;if('"'==yr){for(r="",t="";""!=xr&&('"'!=xr||"\\"==t);)r+=xr,t=xr,o();if(u(),'"'!=yr)throw H('End of string " expected');return u(),e=new ir(r,"string"),e=L(e)}return j()}function j(){var e,r,t,n;if("["==yr){if(f(),u(),"]"!=yr){var i=k();if(";"==yr){for(t=1,r=[i];";"==yr;)u(),r[t]=k(),t++;if("]"!=yr)throw H("End of matrix ] expected");l(),u(),n=r[0].nodes.length;for(var o=1;t>o;o++)if(r[o].nodes.length!=n)throw Y("Column dimensions mismatch ("+r[o].nodes.length+" != "+n+")");e=new er(r)}else{if("]"!=yr)throw H("End of matrix ] expected");l(),u(),e=i}}else l(),u(),e=new er([]);return e}return D()}function k(){for(var e=[x()],r=1;","==yr;)u(),e[r]=x(),r++;return new er(e)}function D(){var e;return wr==pr.NUMBER?(e=yr,u(),new ir(e,"number")):G()}function G(){var e;if("("==yr){if(f(),u(),e=x(),")"!=yr)throw H("Parenthesis ) expected");return l(),u(),e}return Z()}function Z(){throw H(""==yr?"Unexpected end of expression":"Value expected")}function V(){return vr-yr.length+1}function H(e){var r=V(),t=new SyntaxError(e+" (char "+r+")");return t["char"]=r,t}function Y(e){var r=V(),t=new Error(e+" (char "+r+")");return t["char"]=r,t}var W=t(164),J=t(169),K=W.string.isString,X=Array.isArray,Q=(W.types.type,t(4),t(7)),$=(t(8),t(14)),er=t(172),rr=t(173),tr=t(174),nr=t(175),ir=t(176),or=t(178),ar=t(177),sr=t(181),ur=t(179),cr=t(182),fr=t(183),lr=t(184),pr={NULL:0,DELIMITER:1,NUMBER:2,SYMBOL:3,UNKNOWN:4},mr={",":!0,"(":!0,")":!0,"[":!0,"]":!0,'"':!0,";":!0,"+":!0,"-":!0,"*":!0,".*":!0,"/":!0,"./":!0,"%":!0,"^":!0,".^":!0,"~":!0,"!":!0,"&":!0,"|":!0,"^|":!0,"'":!0,"=":!0,":":!0,"?":!0,"==":!0,"!=":!0,"<":!0,">":!0,"<=":!0,">=":!0,"<<":!0,">>":!0,">>>":!0},hr={mod:!0,to:!0,"in":!0,and:!0,xor:!0,or:!0,not:!0},gr={},dr="",vr=0,xr="",yr="",wr=pr.NULL,br=0,Er=null;e.exports=n},function(e,r,t){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(e instanceof Object))throw new TypeError("Object expected as parameter math");this.math=e,this.scope={}}var i=t(16);n.prototype.parse=function(){throw new Error("Parser.parse is deprecated. Use math.parse instead.")},n.prototype.compile=function(){throw new Error("Parser.compile is deprecated. Use math.compile instead.")},n.prototype.eval=function(e){return i(e).compile(this.math).eval(this.scope)},n.prototype.get=function(e){return this.scope[e]},n.prototype.set=function(e,r){return this.scope[e]=r},n.prototype.remove=function(e){delete this.scope[e]},n.prototype.clear=function(){for(var e in this.scope)this.scope.hasOwnProperty(e)&&delete this.scope[e]},e.exports=n},function(e,r,t){r.e=t(185),r.E=t(185),r["false"]=t(186),r.i=t(187),r.Infinity=t(188),r.LN2=t(189),r.LN10=t(190),r.LOG2E=t(191),r.LOG10E=t(192),r.NaN=t(193),r["null"]=t(194),r.pi=t(195),r.PI=t(195),r.phi=t(196),r.SQRT1_2=t(197),r.SQRT2=t(198),r.tau=t(199),r["true"]=t(200),r.version=t(201),r.abs=t(206),r.add=t(207),r.ceil=t(208),r.cube=t(209),r.divide=t(210),r.dotDivide=t(211),r.dotMultiply=t(212),r.dotPow=t(213),r.exp=t(214),r.fix=t(215),r.floor=t(216),r.gcd=t(217),r.lcm=t(218),r.log=t(219),r.log10=t(220),r.mod=t(221),r.multiply=t(222),r.norm=t(223),r.nthRoot=t(224),r.pow=t(225),r.round=t(226),r.sign=t(227),r.sqrt=t(228),r.square=t(229),r.subtract=t(230),r.unaryMinus=t(231),r.unaryPlus=t(232),r.xgcd=t(233),r.bitAnd=t(234),r.bitNot=t(235),r.bitOr=t(236),r.bitXor=t(237),r.leftShift=t(238),r.rightArithShift=t(239),r.rightLogShift=t(240),r.arg=t(241),r.conj=t(242),r.re=t(243),r.im=t(244),r.bignumber=t(245),r["boolean"]=t(246),r.complex=t(247),r.index=t(248),r.matrix=t(249),r.number=t(250),r.string=t(251),r.unit=t(252),r.eval=t(253),r.help=t(254),r.and=t(255),r.not=t(256),r.or=t(257),r.xor=t(258),r.concat=t(259),r.cross=t(260),r.det=t(261),r.diag=t(262),r.dot=t(263),r.eye=t(264),r.flatten=t(265),r.inv=t(266),r.ones=t(267),r.range=t(268),r.resize=t(269),r.size=t(270),r.squeeze=t(271),r.subset=t(272),r.trace=t(273),r.transpose=t(274),r.zeros=t(275),r.combinations=t(276),r.factorial=t(277),r.gamma=t(278),r.permutations=t(279),r.pickRandom=t(280),r.random=t(281),r.randomInt=t(282),r.compare=t(283),r.deepEqual=t(284),r.equal=t(285),r.larger=t(286),r.largerEq=t(287),r.smaller=t(288),r.smallerEq=t(289),r.unequal=t(290),r.max=t(291),r.mean=t(292),r.median=t(293),r.min=t(294),r.prod=t(295),r.std=t(296),r.sum=t(297),r["var"]=t(298),r.acos=t(299),r.acosh=t(300),r.acot=t(301),r.acoth=t(302),r.acsc=t(303),r.acsch=t(304),r.asec=t(305),r.asech=t(306),r.asin=t(307),r.asinh=t(308),r.atan=t(309),r.atanh=t(310),r.atan2=t(311),r.cos=t(312),r.cosh=t(313),r.cot=t(314),r.coth=t(315),r.csc=t(316),r.csch=t(317),r.sec=t(318),r.sech=t(319),r.sin=t(320),r.sinh=t(321),r.tan=t(322),r.tanh=t(323),r.to=t(324),r.clone=t(325),r.map=t(326),r.filter=t(327),r.forEach=t(328),r.format=t(329),r["import"]=t(330),r.sort=t(331),r["typeof"]=t(332)},function(e,r,t){"use strict";function n(e,r){var t=r&&r.mathjs;switch(t){case"BigNumber":return i.fromJSON(r);case"Complex":return o.fromJSON(r);case"Help":return a.fromJSON(r);case"Index":return s.fromJSON(r);case"Matrix":return u.fromJSON(r);case"Range":return c.fromJSON(r);case"ResultSet":return f.fromJSON(r);case"Unit":return l.fromJSON(r)}return r}var i=t(12),o=t(4),a=t(9),s=t(6),u=t(7),c=t(5),f=t(10),l=t(8);e.exports=n},function(e,r,t){"use strict";var n=t(12),i=t(203).transform,o=t(3).isNumber,a=t(167).argsToArray;e.exports=function(e){var r=function(){var r=a(arguments),t=r.length-1,s=r[t];o(s)?r[t]=s-1:s instanceof n&&(r[t]=s.minus(1));try{return e.concat.apply(e,r)}catch(u){throw i(u)}};return e.concat.transform=r,r}},function(e,r,t){"use strict";var n=t(183),i=(t(204).isBoolean,t(167).argsToArray,t(169));e.exports=function(e){var r=e.filter,t=function(e,t,o){if(2!==e.length)throw new i("filter",arguments.length,2);var a,s=e[0].compile(t).eval(o);if(e[1]instanceof n)a=e[1].compile(t).eval(o);else{var u=o||{},c=e[1].filter(function(e){return e instanceof n&&!(e.name in t)&&!(e.name in u)})[0],f=Object.create(u),l=e[1].compile(t);if(!c)throw new Error("No undefined variable found in filter equation");var p=c.name;a=function(e){return f[p]=e,l.eval(f)}}return r(s,a)};return t.rawArgs=!0,e.filter.transform=t,t}},function(e,r,t){"use strict";var n=t(7);e.exports=function(e){function r(e,r,t){var n=function(e,i){Array.isArray(e)?e.forEach(function(e,r){n(e,i.concat(r+1))}):r(e,i,t)};n(e,[])}var t=function(t,i){if(2!=arguments.length)throw new e.error.ArgumentsError("forEach",arguments.length,2);if(Array.isArray(t))r(t,i,t);else{if(!(t instanceof n))throw new e.error.UnsupportedTypeError("forEach",e["typeof"](t));r(t.valueOf(),i,t)}};return e.forEach.transform=t,t}},function(e,r,t){"use strict";{var n=t(12),i=t(5),o=t(6),a=(t(7),t(3).isNumber);Array.isArray}e.exports=function(e){var r=function(){for(var e=[],r=0,t=arguments.length;t>r;r++){var s=arguments[r];if(s instanceof i)s.start--,s.end-=s.step>0?0:2;else if(a(s))s--;else{if(!(s instanceof n))throw new TypeError("Ranges must be a Number or Range");s=s.toNumber()-1}e[r]=s}var u=new o;return o.apply(u,e),u};return e.index.transform=r,r}},function(e,r,t){"use strict";{var n=t(7);t(12),t(5),t(6),t(3).isNumber,Array.isArray}e.exports=function(e){function r(e,r,t){var n=function(e,i){return Array.isArray(e)?e.map(function(e,r){return n(e,i.concat(r+1))}):r(e,i,t)};return n(e,[])}var t=function(t,i){if(2!=arguments.length)throw new e.error.ArgumentsError("map",arguments.length,2);if(Array.isArray(t))return r(t,i,t);if(t instanceof n)return new n(r(t.valueOf(),i,t));throw new e.error.UnsupportedTypeError("map",e["typeof"](t))};return e.map.transform=t,t}},function(e,r,t){"use strict";var n=t(12),i=t(203).transform,o=t(3).isNumber,a=t(14).isCollection,s=t(167).argsToArray;e.exports=function(e){var r=function(){var r=s(arguments);if(2==r.length&&a(r[0])){var t=r[1];o(t)?r[1]=t-1:t instanceof n&&(r[1]=t.minus(1))}try{return e.max.apply(e,r)}catch(u){throw i(u)}};return e.max.transform=r,r}},function(e,r,t){"use strict";var n=t(12),i=t(203).transform,o=t(3).isNumber,a=t(14).isCollection,s=t(167).argsToArray;e.exports=function(e){var r=function(){var r=s(arguments);if(2==r.length&&a(r[0])){var t=r[1];o(t)?r[1]=t-1:t instanceof n&&(r[1]=t.minus(1))}try{return e.mean.apply(e,r)}catch(u){throw i(u)}};return e.mean.transform=r,r}},function(e,r,t){"use strict";var n=t(12),i=t(203).transform,o=t(3).isNumber,a=t(14).isCollection,s=t(167).argsToArray;e.exports=function(e){var r=function(){var r=s(arguments);if(2==r.length&&a(r[0])){var t=r[1];o(t)?r[1]=t-1:t instanceof n&&(r[1]=t.minus(1))}try{return e.min.apply(e,r)}catch(u){throw i(u)}};return e.min.transform=r,r}},function(e,r,t){"use strict";var n=t(204).isBoolean,i=t(167).argsToArray;e.exports=function(e){var r=function(){var r=i(arguments),t=r.length-1,o=r[t];return n(o)||r.push(!0),e.range.apply(e,r)};return e.range.transform=r,r}},function(e,r,t){"use strict";var n=t(203).transform,i=(t(204).isBoolean,t(167).argsToArray);e.exports=function(e){var r=function(){try{return e.subset.apply(e,i(arguments))}catch(r){throw n(r)}};return e.subset.transform=r,r}},function(e,r,t){"use strict";e.exports=function(e){function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.value=e instanceof r?e.value:e}function n(e,t){var n=Array.prototype.slice;r.prototype[e]="function"==typeof t?function(){var e=[this.value].concat(n.call(arguments,0));return new r(t.apply(this,e))}:new r(t)}var i=t(205);r.prototype.done=function(){return this.value},r.prototype.valueOf=function(){return this.value},r.prototype.toString=function(){return i.format(this.value)},r.createProxy=n;for(var o in e)e.hasOwnProperty(o)&&n(o,e[o]);return r}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(16),i=t(14),o=r.string.isString,a=i.isCollection;e.compile=function(r){if(1!=arguments.length)throw new e.error.ArgumentsError("compile",arguments.length,1);if(o(r))return n(r).compile(e);if(a(r))return i.deepMap(r,function(r){return n(r).compile(e)});throw new TypeError("String, array, or matrix expected")}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(16),i=t(14),o=r.string.isString,a=i.isCollection;e.eval=function(r,t){if(1!=arguments.length&&2!=arguments.length)throw new e.error.ArgumentsError("eval",arguments.length,1,2);if(t=t||{},o(r))return n(r).compile(e).eval(t);if(a(r))return i.deepMap(r,function(r){return n(r).compile(e).eval(t)});throw new TypeError("String, array, or matrix expected")}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(9);e.help=function(t){if(1!=arguments.length)throw new SyntaxError("Wrong number of arguments in function help ("+arguments.length+" provided, 1 expected)");var n=null;if(t instanceof String||"string"==typeof t)n=t;else{var i;for(i in e)if(e.hasOwnProperty(i)&&t===e[i]){n=i;break}}var o=e.expression.docs[n];if(!n)throw new Error('Cannot find "'+t+'" in math.js');if(!o)throw new Error('No documentation found on "'+n+'"');return new r(o)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(16);e.parse=function(){return r.apply(r,arguments)}}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(14),n=e("abs",{number:Math.abs,Complex:function(e){var r=Math.abs(e.re),t=Math.abs(e.im);if(r>=t){var e=t/r;return r*Math.sqrt(1+e*e)}var n=r/t;return t*Math.sqrt(1+n*n)},BigNumber:function(e){return e.abs()},"Array | Matrix":function(e){return r.deepMap(e,n)}});return n}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(4),n=t(14),i=e("add",{"number, number":function(e,r){return e+r},"BigNumber, BigNumber":function(e,r){return e.plus(r)},"Complex, Complex":function(e,t){return new r(e.re+t.re,e.im+t.im)},"Unit, Unit":function(e,r){if(null==e.value)throw new Error("Parameter x contains a unit with undefined value");if(null==r.value)throw new Error("Parameter y contains a unit with undefined value");if(!e.equalBase(r))throw new Error("Units do not match");var t=e.clone();return t.value+=r.value,t.fixPrefix=!1,t},"Array | Matrix, any":function(e,r){return n.deepMap2(e,r,i)},"any, Array | Matrix":function(e,r){return n.deepMap2(e,r,i)},"string, string":function(e,r){return e+r}});return i}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=o.isCollection,c=i.isComplex;e.ceil=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("ceil",arguments.length,1);if(a(r))return Math.ceil(r);if(c(r))return new i(Math.ceil(r.re),Math.ceil(r.im));if(r instanceof n)return r.ceil();if(u(r))return o.deepMap(r,f);if(s(r)||null===r)return Math.ceil(r);throw new e.error.UnsupportedTypeError("ceil",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection;e.cube=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("cube",arguments.length,1);if(a(r))return r*r*r;if(u(r))return e.multiply(e.multiply(r,r),r);if(r instanceof n)return r.times(r).times(r);if(c(r))return o.deepMap(r,f);if(s(r)||null===r)return f(+r);throw new e.error.UnsupportedTypeError("cube",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(163),n=t(14),i=t(333)(e),o=t(51)(e),a=t(95)(e);return r("divide",{"any, any":i,"Array | Matrix, Array | Matrix":function(e,r){return o(e,a(r))},"Array | Matrix, any":function(e,r){return n.deepMap2(e,r,i)},"any, Array | Matrix":function(e,r){return o(e,a(r))}})}},function(e,r,t){"use strict";e.exports=function(e){var r=t(14);e.dotDivide=function(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("dotDivide",arguments.length,2);return r.deepMap2(t,n,e.divide)},e.edivide=function(){throw new Error("Function edivide is renamed to dotDivide")}}},function(e,r,t){"use strict";e.exports=function(e){var r=(t(164),t(14));e.dotMultiply=function(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("dotMultiply",arguments.length,2);return r.deepMap2(t,n,e.multiply)},e.emultiply=function(){throw new Error("Function emultiply is renamed to dotMultiply")}}},function(e,r,t){"use strict";e.exports=function(e){var r=(t(164),t(14));e.dotPow=function(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("dotPow",arguments.length,2);return r.deepMap2(t,n,e.pow)},e.epow=function(){throw new Error("Function epow is renamed to dotPow")}}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(4),n=t(14),i=e("exp",{number:Math.exp,Complex:function(e){var t=Math.exp(e.re);return new r(t*Math.cos(e.im),t*Math.sin(e.im))},BigNumber:function(e){return e.exp()},"Array | Matrix":function(e){return n.deepMap(e,i)}});return i}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection;e.fix=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("fix",arguments.length,1);if(a(r))return r>0?Math.floor(r):Math.ceil(r);if(u(r))return new i(r.re>0?Math.floor(r.re):Math.ceil(r.re),r.im>0?Math.floor(r.im):Math.ceil(r.im));if(r instanceof n)return r.isNegative()?r.ceil():r.floor();if(c(r))return o.deepMap(r,f);if(s(r)||null===r)return f(+r);throw new e.error.UnsupportedTypeError("fix",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection;e.floor=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("floor",arguments.length,1);if(a(r))return Math.floor(r);if(u(r))return new i(Math.floor(r.re),Math.floor(r.im));if(r instanceof n)return r.floor();if(c(r))return o.deepMap(r,f);if(s(r)||null===r)return f(+r);throw new e.error.UnsupportedTypeError("floor",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){if(!e.isInt()||!r.isInt())throw new Error("Parameters in function gcd must be integer numbers");for(var t=new i(0);!r.isZero();){var n=e.mod(r);e=r,r=n}return e.lt(t)?e.neg():e}var n=t(164),i=e.type.BigNumber,o=t(14),a=n.number.isNumber,s=n["boolean"].isBoolean,u=n.number.isInteger,c=o.isCollection;e.gcd=function f(){var t,n=arguments[0],l=arguments[1];if(2==arguments.length){if(a(n)&&a(l)){if(!u(n)||!u(l))throw new Error("Parameters in function gcd must be integer numbers");for(;0!=l;)t=n%l,n=l,l=t;return 0>n?-n:n}if(c(n)||c(l))return o.deepMap2(n,l,f);if(n instanceof i)return a(l)?l=i.convert(l):(s(l)||null===l)&&(l=new i(l?1:0)),l instanceof i?r(n,l):f(n.toNumber(),l);if(l instanceof i)return a(n)?n=i.convert(n):(s(n)||null===n)&&(n=new i(n?1:0)),n instanceof i?r(n,l):f(n.toNumber(),l);if(s(n)||null===n)return f(+n,l);if(s(l)||null===l)return f(n,+l);throw new e.error.UnsupportedTypeError("gcd",e["typeof"](n),e["typeof"](l))}if(arguments.length>2){for(var p=1;p2){for(var m=1;m=0?Math.log(e):s(new o(e,0))}var n=t(163),i=t(14),o=t(4),a=t(333)(e),s=n("log",{number:r,Complex:function(e){return new o(Math.log(Math.sqrt(e.re*e.re+e.im*e.im)),Math.atan2(e.im,e.re))},BigNumber:function(e){return e.ln()},"Array | Matrix":function(e){return i.deepMap(e,s)},"any, any":function(e,r){return a(s(e),s(r))}});return s}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection;e.log10=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("log10",arguments.length,1);if(a(r))return r>=0?Math.log(r)/Math.LN10:f(new i(r,0));if(r instanceof n)return r.isNegative()?f(r.toNumber()):r.log();if(u(r))return new i(Math.log(Math.sqrt(r.re*r.re+r.im*r.im))/Math.LN10,Math.atan2(r.im,r.re)/Math.LN10);if(c(r))return o.deepMap(r,f);if(s(r)||null===r)return f(+r);throw new e.error.UnsupportedTypeError("log10",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){if(r>0)return e-r*Math.floor(e/r);if(0==r)return e;throw new Error("Cannot calculate mod for a negative divisor")}var n=t(164),i=e.type.BigNumber,o=t(14),a=n.number.isNumber,s=n["boolean"].isBoolean,u=o.isCollection;e.mod=function c(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("mod",arguments.length,2);if(a(t)&&a(n))return r(t,n);if(t instanceof i)return a(n)?n=i.convert(n):(s(n)||null===n)&&(n=new i(n?1:0)),n instanceof i?n.isZero()?t:t.mod(n):c(t.toNumber(),n);if(n instanceof i)return a(t)?t=i.convert(t):(s(t)||null===t)&&(t=new i(t?1:0)),t instanceof i?n.isZero()?t:t.mod(n):c(t,n.toNumber());if(u(t)||u(n))return o.deepMap2(t,n,c);if(s(t)||null===t)return c(+t,n);if(s(n)||null===n)return c(t,+n);throw new e.error.UnsupportedTypeError("mod",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){var t=u(e),s=u(r);if(1==t.length){if(1==s.length){if(t[0]!=s[0])throw new RangeError("Dimension mismatch in multiplication. Length of A must match length of B (A is "+t[0]+", B is "+s[0]+", "+t[0]+" != "+s[0]+")");return a(e,r)}if(2==s.length){if(t[0]!=s[0])throw new RangeError("Dimension mismatch in multiplication. Length of A must match rows of B (A is "+t[0]+", B is "+s[0]+"x"+s[1]+", "+t[0]+" != "+s[0]+")");return i(e,r)}throw new Error("Can only multiply a 1 or 2 dimensional matrix (B has "+s.length+" dimensions)")}if(2==t.length){if(1==s.length){if(t[1]!=s[0])throw new RangeError("Dimension mismatch in multiplication. Columns of A must match length of B (A is "+t[0]+"x"+t[0]+", B is "+s[0]+", "+t[1]+" != "+s[0]+")");return o(e,r)}if(2==s.length){if(t[1]!=s[0])throw new RangeError("Dimension mismatch in multiplication. Columns of A must match rows of B (A is "+t[0]+"x"+t[1]+", B is "+s[0]+"x"+s[1]+", "+t[1]+" != "+s[0]+")");return n(e,r)}throw new Error("Can only multiply a 1 or 2 dimensional matrix (B has "+s.length+" dimensions)")}throw new Error("Can only multiply a 1 or 2 dimensional matrix (A has "+t.length+" dimensions)")}function n(e,r){for(var t=[],n=e.length,i=r[0].length,o=e[0].length,a=0;n>a;a++){t[a]=[]; -for(var s=0;i>s;s++){for(var u=null,c=0;o>c;c++){var f=m(e[a][c],r[c][s]);u=null===u?f:p(u,f)}t[a][s]=u}}var l=1===n&&1===i;return l?t[0][0]:t}function i(e,r){for(var t=[],n=r.length,i=r[0].length,o=0;i>o;o++){for(var a=null,s=0;n>s;s++){var u=m(e[s],r[s][o]);a=0===s?u:p(a,u)}t[o]=a}return 1===t.length?t[0]:t}function o(e,r){for(var t=[],n=e.length,i=e[0].length,o=0;n>o;o++){for(var a=null,s=0;i>s;s++){var u=m(e[o][s],r[s]);a=0===s?u:p(a,u)}t[o]=a}return 1===t.length?t[0]:t}function a(e,r){var t=e.length;if(!t)throw new Error("Cannot multiply two empty vectors");for(var n=0,i=0;t>i;i++)n=p(n,m(e[i],r[i]));return n}var s=t(163),u=t(167).size,c=t(4),f=t(7),l=t(14),p=t(36)(e),m=s("multiply",{"number, number":function(e,r){return e*r},"BigNumber, BigNumber":function(e,r){return e.times(r)},"Complex, Complex":function(e,r){return new c(e.re*r.re-e.im*r.im,e.re*r.im+e.im*r.re)},"number, Unit":function(e,r){var t=r.clone();return t.value=null===t.value?t._normalize(e):t.value*e,t},"Unit, number":function(e,r){var t=e.clone();return t.value=null===t.value?t._normalize(r):t.value*r,t},"Array, Array":function(e,t){return r(e,t)},"Matrix, Matrix":function(e,r){var t=m(e.valueOf(),r.valueOf());return Array.isArray(t)?new f(t):t},"Matrix, Array":function(e,r){var t=m(e.valueOf(),r);return Array.isArray(t)?new f(t):t},"Array, Matrix":function(e,r){var t=m(e,r.valueOf());return Array.isArray(t)?new f(t):t},"Array | Matrix, any":function(e,r){return l.deepMap2(e,r,m)},"any, Array | Matrix":function(e,r){return l.deepMap2(e,r,m)}});return m}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(167),i=e.type.BigNumber,o=t(4),a=t(7),s=(t(14),r.number.isNumber),u=r["boolean"].isBoolean,c=o.isComplex,f=Array.isArray;e.norm=function l(r,t){if(arguments.length<1||arguments.length>2)throw new e.error.ArgumentsError("abs",arguments.length,1,2);if(s(r))return Math.abs(r);if(c(r)){var o=Math.abs(r.re),p=Math.abs(r.im);if(o>=p){var r=p/o;return o*Math.sqrt(1+r*r)}var m=o/p;return p*Math.sqrt(1+m*m)}if(r instanceof i)return r.abs();if(u(r)||null===r)return Math.abs(r);if(f(r)){var h=n.size(r);if(null==t&&(t=2),1==h.length){if(t===Number.POSITIVE_INFINITY||"inf"===t){var g;return e.forEach(r,function(r){var t=e.abs(r);(!g||e.larger(t,g))&&(g=t)}),g}if(t===Number.NEGATIVE_INFINITY||"-inf"===t){var g;return e.forEach(r,function(r){var t=e.abs(r);(!g||e.smaller(t,g))&&(g=t)}),g}if("fro"===t)return l(r);if(s(t)&&!isNaN(t)){if(!e.equal(t,0)){var g=0;return e.forEach(r,function(r){g=e.add(e.pow(e.abs(r),t),g)}),e.pow(g,1/t)}return Number.POSITIVE_INFINITY}throw new Error("Unsupported parameter value")}if(2==h.length){if(1==t){for(var d=[],v=0;vt;if(n&&(t=-t),0==t)throw new Error("Root must be non-zero");if(0>e&&Math.abs(t)%2!=1)throw new Error("Root must be odd when a is negative.");if(0==e)return 0;if(!Number.isFinite(e))return n?0:e;var i=1e-16,o=1,a=0,s=100;do{var u=(e/Math.pow(o,t-1)-o)/t;o+=u,a++}while(Math.abs(u)>i&&s>a);return n?1/o:o}function i(e,r){var t=void 0!=r?r:new a(2),n=new a(0),i=new a(1),o=t.isNegative();if(o&&(t=t.negated()),t.isZero())throw new Error("Root must be non-zero");if(e.isNegative()&&!t.abs().mod(2).equals(1))throw new Error("Root must be odd when a is negative.");if(e.isZero())return n;if(!e.isFinite())return o?n:e;var s=i,u=0,c=100;do{var f=s,l=e.div(s.pow(t.minus(1))).minus(s).div(t);s=s.plus(l),u++}while(!s.equals(f)&&c>u);return o?i.div(s):s}var o=t(164),a=e.type.BigNumber,s=t(14),u=o.number.isNumber,c=o["boolean"].isBoolean,f=s.isCollection;e.nthRoot=function l(t,o){if(1!=arguments.length&&2!=arguments.length)throw new e.error.ArgumentsError("nthRoot",arguments.length,1,2);switch(arguments.length){case 1:if(u(t))return r(t);if(t instanceof a)return i(t);if(f(t))return s.deepMap(x,l);if(c(t)||null===t)return l(+t);break;case 2:if(u(t)){if(u(o))return r(t,o);if(o instanceof a)return t=a.convert(t),t instanceof a?i(t,o):r(t,o.toNumber())}else{if(t instanceof a)return u(o)&&(o=a.convert(o)),o instanceof a?i(t,o):r(t.toNumber(),o);if(f(t)&&!f(o))return s.deepMap2(t,o,l)}if(c(t)||null===t)return l(+t,o);if(c(o)||null===o)return l(t,+o);break;default:throw new e.error.ArgumentsError("nthRoot",arguments.length,1,2)}if(c(x)||null===x)return 2==arguments.length?l(+x,n):l(+x);throw new e.error.UnsupportedTypeError("nthRoot",e["typeof"](t),e["typeof"](o))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){return f(m(p(e),r))}function n(e,r){if(!u(r)||0>r)throw new TypeError("For A^b, b must be a positive integer (value is "+r+")");var t=c(e);if(2!=t.length)throw new Error("For A^b, A must be 2 dimensional (A has "+t.length+" dimensions)");if(t[0]!=t[1])throw new Error("For A^b, A must be square (size is "+t[0]+"x"+t[1]+")");for(var n=l(t[0]).valueOf(),i=e;r>=1;)1==(1&r)&&(n=m(i,n)),r>>=1,i=m(i,i);return n}function i(e,r){return new a(n(e.valueOf(),r))}var o=t(163),a=t(7),s=t(4),u=t(3).isInteger,c=t(167).size,f=t(43)(e),l=t(93)(e),p=t(48)(e),m=t(51)(e),h=o("pow",{"number, number":function(e,t){return u(t)||e>=0?Math.pow(e,t):r(new s(e,0),new s(t,0))},"BigNumber, BigNumber":function(e,t){return u(t)||e>=0?e.pow(t):r(new s(e.toNumber(),0),new s(t.toNumber(),0))},"Complex, Complex":r,"Array, number":n,"Array, BigNumber":function(e,r){return n(e,r.toNumber())},"Matrix, number":i,"Matrix, BigNumber":function(e,r){return i(e,r.toNumber())}});return h}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){var t=Math.pow(10,r);return Math.round(e*t)/t}var n=t(164),i=e.type.BigNumber,o=t(4),a=t(14),s=n.number.isNumber,u=n.number.isInteger,c=n["boolean"].isBoolean,f=o.isComplex,l=a.isCollection;e.round=function p(t,n){if(1!=arguments.length&&2!=arguments.length)throw new e.error.ArgumentsError("round",arguments.length,1,2);if(void 0==n){if(s(t))return Math.round(t);if(f(t))return new o(Math.round(t.re),Math.round(t.im));if(t instanceof i)return t.toDecimalPlaces(0);if(l(t))return a.deepMap(t,p);if(c(t)||null===t)return Math.round(t);throw new e.error.UnsupportedTypeError("round",e["typeof"](t))}if(!s(n)||!u(n)){if(!(n instanceof i)){if(c(n)||null===t)return p(t,+n);throw new TypeError("Number of decimals in function round must be an integer")}n=parseFloat(n.valueOf())}if(0>n||n>15)throw new Error("Number of decimals in function round must be in te range of 0-15");if(s(t))return r(t,n);if(f(t))return new o(r(t.re,n),r(t.im,n));if(t instanceof i)return t.toDecimalPlaces(n);if(l(t)||l(n))return a.deepMap2(t,n,p);if(c(t)||null===t)return p(+t,n);throw new e.error.UnsupportedTypeError("round",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number,s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isCollection;e.sign=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("sign",arguments.length,1);if(s(r))return a.sign(r);if(c(r)){var t=Math.sqrt(r.re*r.re+r.im*r.im);return new i(r.re/t,r.im/t)}if(r instanceof n)return new n(r.cmp(0));if(f(r))return o.deepMap(r,l);if(u(r)||null===r)return a.sign(r);throw new e.error.UnsupportedTypeError("sign",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(){function e(e){return e>=0?Math.sqrt(e):r(new o(e,0))}function r(e){var r,t,n=Math.sqrt(e.re*e.re+e.im*e.im);return r=e.re>=0?.5*Math.sqrt(2*(n+e.re)):Math.abs(e.im)/Math.sqrt(2*(n-e.re)),t=e.re<=0?.5*Math.sqrt(2*(n-e.re)):Math.abs(e.im)/Math.sqrt(2*(n+e.re)),e.im>=0?new o(r,t):new o(r,-t)}var n=t(163),i=t(14),o=t(4),a=n("sqrt",{number:e,Complex:r,BigNumber:function(r){return r.isNegative()?e(r.toNumber()):r.sqrt()},"Array | Matrix":function(e){return i.deepMap(e,a)}});return a}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection;e.square=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("square",arguments.length,1);if(a(r))return r*r;if(u(r))return e.multiply(r,r);if(r instanceof n)return r.times(r);if(c(r))return o.deepMap(r,f);if(s(r)||null===r)return r*r;throw new e.error.UnsupportedTypeError("square",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(4),n=t(14),i=e("subtract",{"number, number":function(e,r){return e-r},"Complex, Complex":function(e,t){return new r(e.re-t.re,e.im-t.im)},"BigNumber, BigNumber":function(e,r){return e.minus(r)},"Unit, Unit":function(e,r){if(null==e.value)throw new Error("Parameter x contains a unit with undefined value");if(null==r.value)throw new Error("Parameter y contains a unit with undefined value");if(!e.equalBase(r))throw new Error("Units do not match");var t=e.clone();return t.value-=r.value,t.fixPrefix=!1,t},"Array | Matrix, any":function(e,r){return n.deepMap2(e,r,i)},"any, Array | Matrix":function(e,r){return n.deepMap2(e,r,i)}});return i}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(4),n=t(14),i=e("unaryMinus",{number:function(e){return-e},Complex:function(e){return new r(-e.re,-e.im)},BigNumber:function(e){return e.neg()},Unit:function(e){var r=e.clone();return r.value=-e.value,r},"Array | Matrix":function(e){return n.deepMap(e,i)}});return i}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(14),u=n.number.isNumber,c=n["boolean"].isBoolean,f=n.string.isString,l=o.isComplex,p=a.isUnit,m=s.isCollection;e.unaryPlus=function h(t){if(1!=arguments.length)throw new e.error.ArgumentsError("unaryPlus",arguments.length,1);if(u(t))return t;if(l(t))return t.clone();if(t instanceof i)return t;if(p(t))return t.clone();if(m(t))return s.deepMap(t,h);if(c(t)||f(t)||null===t)return"bignumber"==r.number?new i(+t):+t;throw new e.error.UnsupportedTypeError("unaryPlus",e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e,r){function n(e,t){for(var n,i,o,s=0,u=1,c=1,f=0;t;)i=Math.floor(e/t),o=e%t,n=s,s=u-i*s,u=n,n=c,c=f-i*c,f=n,e=t,t=o;var l;return l=0>e?[-e,-u,-f]:[e,e?u:0,f],"array"===r.matrix?l:new a(l)}function i(e,t){for(var n,i,o,u=new s(0),c=new s(0),f=new s(1),l=new s(1),p=new s(0);!t.isZero();)i=e.div(t).floor(),o=e.mod(t),n=c,c=f.minus(i.times(c)),f=n,n=l,l=p.minus(i.times(l)),p=n,e=t,t=o;var m;return m=e.lt(u)?[e.neg(),f.neg(),p.neg()]:[e,e.isZero()?0:f,p],"array"===r.matrix?m:new a(m)}var o=t(164),a=t(7),s=e.type.BigNumber,u=o.number.isNumber,c=o["boolean"].isBoolean,f=o.number.isInteger;e.xgcd=function l(r,t){if(2==arguments.length){if(u(r)&&u(t)){if(!f(r)||!f(t))throw new Error("Parameters in function xgcd must be integer numbers");return n(r,t)}if(r instanceof s)return u(t)?t=s.convert(t):(c(t)||null===t)&&(t=new s(t?1:0)),t instanceof s?i(r,t):l(r.toNumber(),t);if(t instanceof s)return u(r)?r=s.convert(r):(c(r)||null===r)&&(r=new s(r?1:0)),r instanceof s?i(r,t):l(r.toNumber(),t);if(c(r)||null===r)return l(+r,t);if(c(t)||null===t)return l(r,+t);throw new e.error.UnsupportedTypeError("xgcd",e["typeof"](r),e["typeof"](t))}throw new SyntaxError("Function xgcd expects two arguments")}}},function(e,r,t){"use strict";e.exports=function(){var e=t(163),r=t(3).isInteger,n=t(166).and,i=t(14),o=e("bitAnd",{"number, number":function(e,t){if(!r(e)||!r(t))throw new Error("Parameters in function bitAnd must be integer numbers");return e&t},"BigNumber, BigNumber":n,"Array | Matrix, any":function(e,r){return i.deepMap2(e,r,o)},"any, Array | Matrix":function(e,r){return i.deepMap2(e,r,o)}});return o}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(7),t(8),t(14)),o=r["boolean"].isBoolean,a=r.number.isInteger,s=r.number.isNumber,u=i.isCollection,c=r.bignumber.not;e.bitNot=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("bitNot",arguments.length,1);if(s(r)){if(!a(r))throw new Error("Parameter in function bitNot must be integer numbers");return~r}if(r instanceof n)return c(r);if(u(r))return i.deepMap(r,f);if(o(r)||null===r)return f(+r);throw new e.error.UnsupportedTypeError("bitNot",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(7),t(8),t(14)),o=r["boolean"].isBoolean,a=r.number.isInteger,s=r.number.isNumber,u=i.isCollection,c=r.bignumber.or;e.bitOr=function f(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("bitOr",arguments.length,2);if(s(r)&&s(t)){if(!a(r)||!a(t))throw new Error("Parameters in function bitOr must be integer numbers");return r|t}if(u(r)||u(t))return i.deepMap2(r,t,f);if(o(r)||null===r)return f(+r,t);if(o(t)||null===t)return f(r,+t);if(r instanceof n)return s(t)&&(t=n.convert(t)),t instanceof n?c(r,t):f(r.toNumber(),t);if(t instanceof n)return s(r)&&(r=n.convert(r)),r instanceof n?c(r,t):f(r,t.toNumber());throw new e.error.UnsupportedTypeError("bitOr",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(7),t(8),t(14)),o=r["boolean"].isBoolean,a=r.number.isInteger,s=r.number.isNumber,u=i.isCollection,c=r.bignumber.xor;e.bitXor=function f(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("bitXor",arguments.length,2);if(s(r)&&s(t)){if(!a(r)||!a(t))throw new Error("Parameters in function bitXor must be integer numbers");return r^t}if(u(r)||u(t))return i.deepMap2(r,t,f);if(o(r)||null===r)return f(+r,t);if(o(t)||null===t)return f(r,+t);if(r instanceof n)return s(t)&&(t=n.convert(t)),t instanceof n?c(r,t):f(r.toNumber(),t);if(t instanceof n)return s(r)&&(r=n.convert(r)),r instanceof n?c(r,t):f(r,t.toNumber());throw new e.error.UnsupportedTypeError("bitXor",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(7),t(8),t(14)),o=r["boolean"].isBoolean,a=r.number.isInteger,s=r.number.isNumber,u=i.isCollection,c=r.bignumber.leftShift;e.leftShift=function f(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("leftShift",arguments.length,2);if(s(r)){if(s(t)){if(!a(r)||!a(t))throw new Error("Parameters in function leftShift must be integer numbers");return r<t?new n(0/0):0==t||r.isZero()?r:1/0!=t||r.isFinite()?55>t?r.times(Math.pow(2,t)+""):(t=n.convert(t),c(r,t)):new n(0/0)}}if(u(r)&&s(t))return i.deepMap2(r,t,f);if(o(r)||null===r)return f(+r,t);if(o(t)||null===t)return f(r,+t);if(r instanceof n)return t instanceof n?c(r,t):f(r.toNumber(),t);if(t instanceof n)return f(r,t.toNumber());throw new e.error.UnsupportedTypeError("leftShift",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(7),t(8),t(14)),o=r["boolean"].isBoolean,a=r.number.isInteger,s=r.number.isNumber,u=i.isCollection,c=r.bignumber.rightShift;e.rightArithShift=function f(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("rightArithShift",arguments.length,2);if(s(r)){if(s(t)){if(!a(r)||!a(t))throw new Error("Parameters in function rightArithShift must be integer numbers");return r>>t}if(t instanceof n)return c(n.convert(r),t)}if(s(t)){if(isFinite(t)&&!a(t))throw new Error("Parameters in function rightArithShift must be integer numbers");if(r instanceof n){if(r.isFinite()&&!r.isInteger())throw new Error("Parameters in function rightArithShift must be integer numbers");return r.isNaN()||isNaN(t)||0>t?new n(0/0):1/0==t?new n(r.isNegative()?-1:r.isFinite()?0:0/0):55>t?r.div(Math.pow(2,t)+"").floor():(t=n.convert(t),c(r,t))}}if(u(r)&&s(t))return i.deepMap2(r,t,f);if(o(r)||null===r)return f(+r,t);if(o(t)||null===t)return f(r,+t);if(r instanceof n)return t instanceof n?c(r,t):f(r.toNumber(),t);if(t instanceof n)return f(r,t.toNumber());throw new e.error.UnsupportedTypeError("rightArithShift",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=(t(7),t(8),t(14)),i=r["boolean"].isBoolean,o=r.number.isInteger,a=r.number.isNumber,s=n.isCollection;e.rightLogShift=function u(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("rightLogShift",arguments.length,2);if(a(r)&&a(t)){if(!o(r)||!o(t))throw new Error("Parameters in function rightLogShift must be integer numbers");return r>>>t}if(s(r)&&a(t))return n.deepMap2(r,t,u);if(i(r)||null===r)return u(+r,t);if(i(t)||null===t)return u(r,+t);throw new e.error.UnsupportedTypeError("rightLogShift",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=o.isCollection,c=i.isComplex;e.arg=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("arg",arguments.length,1);if(a(r))return Math.atan2(0,r);if(c(r))return Math.atan2(r.im,r.re);if(u(r))return o.deepMap(r,f);if(s(r)||null===r)return f(+r);if(r instanceof n)return f(r.toNumber());throw new e.error.UnsupportedTypeError("arg",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.object,s=r.number.isNumber,u=r["boolean"].isBoolean,c=o.isCollection,f=i.isComplex;e.conj=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("conj",arguments.length,1);return s(r)?r:r instanceof n?new n(r):f(r)?new i(r.re,-r.im):c(r)?o.deepMap(r,l):u(r)||null===r?+r:a.clone(r)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.object,s=r.number.isNumber,u=r["boolean"].isBoolean,c=o.isCollection,f=i.isComplex;e.re=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("re",arguments.length,1);return s(r)?r:r instanceof n?new n(r):f(r)?r.re:c(r)?o.deepMap(r,l):u(r)||null===r?+r:a.clone(r)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=o.isCollection,c=i.isComplex;e.im=function f(r){if(1!=arguments.length)throw new e.error.ArgumentsError("im",arguments.length,1);return a(r)?0:r instanceof n?new n(0):c(r)?r.im:u(r)?o.deepMap(r,f):(s(r)||null===r,0)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(14),o=i.isCollection,a=r.number.isNumber,s=r.string.isString,u=r["boolean"].isBoolean;e.bignumber=function c(r){if(arguments.length>1)throw new e.error.ArgumentsError("bignumber",arguments.length,0,1);if(a(r))return new n(r+"");if(s(r))return new n(r);if(r instanceof n)return r;if(u(r)||null===r)return new n(+r);if(o(r))return i.deepMap(r,c);if(0==arguments.length)return new n(0);throw new e.error.UnsupportedTypeError("bignumber",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(14),o=i.isCollection,a=r.number.isNumber,s=r.string.isString;e["boolean"]=function u(r){if(1!=arguments.length)throw new e.error.ArgumentsError("boolean",arguments.length,0,1);if("true"===r||r===!0)return!0;if("false"===r||r===!1||null===r)return!1;if(r instanceof Boolean)return 1==r;if(a(r))return 0!==r;if(r instanceof n)return!r.isZero();if(s(r)){var t=r.toLowerCase();if("true"===t)return!0;if("false"===t)return!1;var c=Number(r);if(""!=r&&!isNaN(c))return 0!==c}if(o(r))return i.deepMap(r,u);throw new SyntaxError(r.toString()+" is no valid boolean")}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=o.isCollection,s=r.number.isNumber,u=r.string.isString,c=i.isComplex;e.complex=function f(){switch(arguments.length){case 0:return new i(0,0);case 1:var r=arguments[0];if(s(r))return new i(r,0);if(r instanceof n)return new i(r.toNumber(),0);if(c(r))return r.clone();if(u(r)){var t=i.parse(r);if(t)return t;throw new SyntaxError('String "'+r+'" is no valid complex number')}if(a(r))return o.deepMap(r,f);if("object"==typeof r){if("re"in r&&"im"in r)return new i(r.re,r.im);if("r"in r&&"phi"in r)return i.fromPolar(r.r,r.phi)}throw new TypeError("Two numbers, single string or an fitting object expected in function complex");case 2:var l=arguments[0],p=arguments[1];if(l instanceof n&&(l=l.toNumber()),p instanceof n&&(p=p.toNumber()),s(l)&&s(p))return new i(l,p);throw new TypeError("Two numbers or a single string expected in function complex");default:throw new e.error.ArgumentsError("complex",arguments.length,0,2)}}}},function(e,r,t){"use strict";e.exports=function(e){var r=(t(164),e.type.BigNumber),n=t(6);e.index=function(){var e=Array.prototype.slice.apply(arguments).map(function(e){return e instanceof r?e.toNumber():Array.isArray(e)?e.map(function(e){return e instanceof r?e.toNumber():e}):e}),t=new n;return n.apply(t,e),t}}},function(e,r,t){"use strict";e.exports=function(e){var r=(t(164),t(7));e.matrix=function(t){if(arguments.length>1)throw new e.error.ArgumentsError("matrix",arguments.length,0,1);return new r(t)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=e.type.Unit,o=t(14),a=o.isCollection,s=r.number.isNumber,u=r["boolean"].isBoolean,c=r.string.isString;e.number=function f(r,t){switch(arguments.length){case 0:return 0;case 1:if(a(r))return o.deepMap(r,f);if(r instanceof n)return r.toNumber();if(c(r)){var l=Number(r);if(isNaN(l)&&(l=Number(r.valueOf())),isNaN(l))throw new SyntaxError(r.toString()+" is no valid number");return l}if(u(r)||null===r)return+r;if(s(r))return r;if(r instanceof i)throw new Error("Second argument with valueless unit expected");throw new e.error.UnsupportedTypeError("number",e["typeof"](r));case 2:if(r instanceof i&&c(t)||t instanceof i)return r.toNumber(t);throw new e.error.UnsupportedTypeError("number",e["typeof"](r),e["typeof"](t));default:throw new e.error.ArgumentsError("number",arguments.length,0,1)}}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(17);e.parser=function(){return new r(e)}}},function(e){"use strict";e.exports=function(e){e.chain=function(r){return new e.chaining.Chain(r)},e.select=function(r){return console&&"function"==typeof console.log&&console.log('WARNING: Function "select" is renamed to "chain". It will be deprecated in v2.0.'),e.select=e.chain,e.chaining.Chain.prototype.select=e.select,e.chain(r)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(14),i=r.number,o=r.number.isNumber,a=n.isCollection;e.string=function s(r){switch(arguments.length){case 0:return"";case 1:return o(r)?i.format(r):a(r)?n.deepMap(r,s):null===r?"null":r.toString();default:throw new e.error.ArgumentsError("string",arguments.length,0,1)}}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(8),o=t(14),a=o.isCollection,s=r.string.isString;e.unit=function u(r){switch(arguments.length){case 1:var t=arguments[0];if(t instanceof i)return t.clone();if(s(t)){if(i.isValuelessUnit(t))return new i(null,t);var c=i.parse(t);if(c)return c;throw new SyntaxError('String "'+t+'" is no valid unit')}if(a(r))return o.deepMap(r,u);throw new TypeError("A string or a number and string expected in function unit");case 2:return arguments[0]instanceof n?new i(arguments[0].toNumber(),arguments[1]):new i(arguments[0],arguments[1]);default:throw new e.error.ArgumentsError("unit",arguments.length,1,2)}}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection;e.and=function p(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("and",arguments.length,2);if((s(r)||u(r)||null===r)&&(s(t)||u(t)||null===t))return!(!r||!t);if(c(r))return 0==r.re&&0==r.im?!1:p(!0,t);if(c(t))return 0==t.re&&0==t.im?!1:p(r,!0);if(r instanceof n)return r.isZero()||r.isNaN()?!1:p(!0,t);if(t instanceof n)return t.isZero()||t.isNaN()?!1:p(r,!0);if(f(r))return null===r.value||0==r.value?!1:p(!0,t);if(f(t))return null===t.value||0==t.value?!1:p(r,!0);if(l(r)||l(t))return a.deepMap2(r,t,p);throw new e.error.UnsupportedTypeError("and",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection;e.not=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("not",arguments.length,1);if(s(r)||u(r)||null===r)return!r;if(c(r))return 0==r.re&&0==r.im;if(r instanceof n)return r.isZero()||r.isNaN();if(f(r))return null===r.value||0==r.value;if(l(r))return a.deepMap(r,p);throw new e.error.UnsupportedTypeError("not",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection;e.or=function p(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("or",arguments.length,2);if((s(r)||u(r)||null===r)&&(s(t)||u(t)||null===t))return!(!r&&!t);if(c(r))return 0==r.re&&0==r.im?p(!1,t):!0;if(c(t))return 0==t.re&&0==t.im?p(r,!1):!0;if(r instanceof n)return r.isZero()||r.isNaN()?p(!1,t):!0;if(t instanceof n)return t.isZero()||t.isNaN()?p(r,!1):!0;if(f(r))return null===r.value||0==r.value?p(!1,t):!0;if(f(t))return null===t.value||0==t.value?p(r,!1):!0;if(l(r)||l(t))return a.deepMap2(r,t,p);throw new e.error.UnsupportedTypeError("or",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection;e.xor=function p(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("xor",arguments.length,2);if((s(r)||u(r)||null===r)&&(s(t)||u(t)||null===t))return!!(!!r^!!t);if(c(r))return p(!(0==r.re&&0==r.im),t);if(c(t))return p(r,!(0==t.re&&0==t.im));if(r instanceof n)return p(!(r.isZero()||r.isNaN()),t);if(t instanceof n)return p(r,!(t.isZero()||t.isNaN()));if(f(r))return p(!(null===r.value||0==r.value),t);if(f(t))return p(r,!(null===t.value||0==t.value));if(l(r)||l(t))return a.deepMap2(r,t,p);throw new e.error.UnsupportedTypeError("xor",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){function r(t,n,i,o){if(i>o){if(t.length!=n.length)throw new e.error.DimensionError(t.length,n.length);for(var a=[],s=0;st;t++){var g=arguments[t];if(g instanceof o&&(m=!0),t==a-1&&(c(g)||g instanceof i)){if(n=p,p=g.valueOf(),!f(p))throw new TypeError("Integer number expected for dimension");if(0>p)throw new e.error.IndexError(p);if(t>0&&p>n)throw new e.error.IndexError(p,n+1)}else{if(!l(g))throw new e.error.UnsupportedTypeError("concat",e["typeof"](g));var d=s.clone(g).valueOf(),v=u.size(g.valueOf());if(h[t]=d,n=p,p=v.length-1,t>0&&p!=n)throw new e.error.DimensionError(n+1,p+1)}}if(0==h.length)throw new SyntaxError("At least one matrix expected");for(var x=h.shift();h.length;)x=r(x,h.shift(),p,0);return m?new o(x):x}}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){var i=n.size(r),o=n.size(t);if(1!=i.length||1!=o.length||3!=i[0]||3!=o[0])throw new RangeError("Vectors with length 3 expected (Size A = ["+i.join(", ")+"], B = ["+o.join(", ")+"])");return[e.subtract(e.multiply(r[1],t[2]),e.multiply(r[2],t[1])),e.subtract(e.multiply(r[2],t[0]),e.multiply(r[0],t[2])),e.subtract(e.multiply(r[0],t[1]),e.multiply(r[1],t[0]))]}var n=t(167),i=t(7);e.cross=function(t,n){if(t instanceof i){if(n instanceof i)return new i(r(t.toArray(),n.toArray()));if(Array.isArray(n))return new i(r(t.toArray(),n))}else if(Array.isArray(t)){if(n instanceof i)return new i(r(t,n.toArray()));if(Array.isArray(n))return r(t,n)}throw new e.error.UnsupportedTypeError("cross",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){if(1==r)return f.clone(e[0][0]);if(2==r)return a(s(e[0][0],e[1][1]),s(e[1][0],e[0][1]));for(var t=function(e){var r,t,n=new Array(e.length),i=0;for(r=1;rt;t++)n[r][t]=0;for(t=r+1;ti;i++)n=s(t(n),e);return r%2==0?u(n[0][0]):n[0][0]}var n=t(163),i=t(7),o=t(36)(e),a=t(59)(e),s=t(51)(e),u=t(60)(e),c=t(164),f=c.object,l=c.string;return n("det",{any:function(e){return f.clone(e)},"Array | Matrix":function(e){var t;switch(e instanceof i?t=e.size():e instanceof Array?(e=new i(e),t=e.size()):t=[],t.length){case 0:return f.clone(e);case 1:if(1==t[0])return f.clone(e.valueOf()[0]);throw new RangeError("Matrix must be square (size: "+l.format(t)+")");case 2:var n=t[0],o=t[1];if(n==o)return r(e.clone().valueOf(),n,o);throw new RangeError("Matrix must be square (size: "+l.format(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+l.format(t)+")")}}})}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(7),o=r.object,a=r.array.isArray,s=r.number.isNumber,u=r.number.isInteger;e.diag=function(r,t){var c,f,l,p;if(1!=arguments.length&&2!=arguments.length)throw new e.error.ArgumentsError("diag",arguments.length,1,2);if(t){if(t instanceof n&&(t=t.toNumber()),!s(t)||!u(t))throw new TypeError("Second parameter in function diag must be an integer")}else t=0;var m,h=t>0?t:0,g=0>t?-t:0;if(r instanceof i)m=!1;else{if(!a(r))throw new TypeError("First parameter in function diag must be a Matrix or Array");r=new i(r),m=!0}var d=r.size();switch(d.length){case 1:f=r.valueOf();var v=new i,x=f[0]instanceof n?new n(0):0;for(v.resize([f.length+g,f.length+h],x),c=v.valueOf(),p=f.length,l=0;p>l;l++)c[l+g][l+h]=o.clone(f[l]);return m?v.valueOf():v;case 2:for(f=[],c=r.valueOf(),p=Math.min(d[0]-g,d[1]-h),l=0;p>l;l++)f[l]=o.clone(c[l+g][l+h]);return m?f:new i(f);default:throw new RangeError("Matrix for function diag must be 2 dimensional")}}}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){var i=n.size(r),o=n.size(t),a=i[0];if(1!==i.length||1!==o.length)throw new RangeError("Vector expected");if(i[0]!=o[0])throw new RangeError("Vectors must have equal length ("+i[0]+" != "+o[0]+")");if(0==a)throw new RangeError("Cannot calculate the dot product of empty vectors");for(var s=0,u=0;a>u;u++)s=e.add(s,e.multiply(r[u],t[u]));return s}var n=t(167),i=t(7);e.dot=function(t,n){if(t instanceof i){if(n instanceof i)return r(t.toArray(),n.toArray());if(Array.isArray(n))return r(t.toArray(),n)}else if(Array.isArray(t)){if(n instanceof i)return r(t,n.toArray());if(Array.isArray(n))return r(t,n)}throw new e.error.UnsupportedTypeError("dot",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){function r(r){switch(r.length){case 0:return"matrix"===e.matrix?new a([]):[];case 1:return n(r[0],r[0]);case 2:return n(r[0],r[1]);default:throw new Error("Vector containing two values expected")}}function n(e,r){var t=e instanceof o?e.constructor:r instanceof o?r.constructor:null;if(e instanceof o&&(e=e.toNumber()),r instanceof o&&(r=r.toNumber()),!s(e)||1>e)throw new Error("Parameters in function eye must be positive integers"); -if(!s(r)||1>r)throw new Error("Parameters in function eye must be positive integers");var n=new a,i=t?new o(1):1,u=t?new t(0):0;n.resize([e,r],u);for(var c=Math.min(e,r),f=n.valueOf(),l=0;c>l;l++)f[l][l]=i;return n}var i=t(163),o=t(336),a=t(7),s=t(3).isInteger;return i("eye",{"":function(){return"matrix"===e.matrix?new a([]):[]},"number | BigNumber":function(r){var t=n(r,r);return"matrix"===e.matrix?t:t.valueOf()},"number | BigNumber, number | BigNumber":function(r,t){var i=n(r,t);return"matrix"===e.matrix?i:i.valueOf()},Array:function(e){return r(e).valueOf()},Matrix:function(e){return r(e.valueOf())}})}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(7),i=r.object,o=r.array,a=Array.isArray;e.flatten=function(r){if(1!==arguments.length)throw new e.error.ArgumentsError("flatten",arguments.length,1);if(r instanceof n){var t=i.clone(r.toArray()),s=o.flatten(t);return new n(s)}if(a(r))return o.flatten(i.clone(r));throw new e.error.UnsupportedTypeError("flatten",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r,t){var n,i,o,p,m;if(1==r){if(p=e[0][0],0==p)throw Error("Cannot calculate inverse, determinant is zero");return[[a(1,p)]]}if(2==r){var h=f(e);if(0==h)throw Error("Cannot calculate inverse, determinant is zero");return[[a(e[1][1],h),a(c(e[0][1]),h)],[a(c(e[1][0]),h),a(e[0][0],h)]]}var g=e.concat();for(n=0;r>n;n++)g[n]=g[n].concat();for(var d=l(r).valueOf(),v=0;t>v;v++){for(n=v;r>n&&0==g[n][v];)n++;if(n==r||0==g[n][v])throw Error("Cannot calculate inverse, determinant is zero");n!=v&&(m=g[v],g[v]=g[n],g[n]=m,m=d[v],d[v]=d[n],d[n]=m);var x=g[v],y=d[v];for(n=0;r>n;n++){var w=g[n],b=d[n];if(n!=v){if(0!=w[v]){for(o=a(c(w[v]),x[v]),i=v;t>i;i++)w[i]=s(w[i],u(o,x[i]));for(i=0;t>i;i++)b[i]=s(b[i],u(o,y[i]))}}else{for(o=x[v],i=v;t>i;i++)w[i]=a(w[i],o);for(i=0;t>i;i++)b[i]=a(b[i],o)}}}return d}var n=t(163),i=t(164),o=t(7),a=t(333)(e),s=t(36)(e),u=t(51)(e),c=t(60)(e),f=t(90)(e),l=t(93)(e),p=n("inv",{"Array | Matrix":function(e){var t=e instanceof o?e.size():i.array.size(e);switch(t.length){case 1:if(1==t[0])return e instanceof o?new o([a(1,e.valueOf()[0])]):[a(1,e[0])];throw new RangeError("Matrix must be square (size: "+i.string.format(t)+")");case 2:var n=t[0],s=t[1];if(n==s)return e instanceof o?new o(r(e.valueOf(),n,s)):r(e,n,s);throw new RangeError("Matrix must be square (size: "+i.string.format(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+i.string.format(t)+")")}},any:function(e){return a(1,e)}});return p}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(7),a=t(14),s=n.array,u=Array.isArray;e.ones=function(e){var t=a.argsToArray(arguments),n=e instanceof o?!0:u(e)?!1:"matrix"===r.matrix;if(0==t.length)return n?new o:[];var c=!1;t=t.map(function(e){return e instanceof i?(c=!0,e.toNumber()):e});var f=[],l=c?new i(1):1;return f=s.resize(f,t,l),n?new o(f):f}}},function(e,r,t){"use strict";e.exports=function(e,r){function n(e,r,t){var n=[],i=e;if(t>0)for(;r>i;)n.push(i),i+=t;else if(0>t)for(;i>r;)n.push(i),i+=t;return n}function i(e,r,t){var n=[],i=e;if(t>0)for(;r>=i;)n.push(i),i+=t;else if(0>t)for(;i>=r;)n.push(i),i+=t;return n}function o(e,r,t){var n=[],i=e,o=new c(0);if(t.gt(o))for(;i.lt(r);)n.push(i),i=i.plus(t);else if(t.lt(o))for(;i.gt(r);)n.push(i),i=i.plus(t);return n}function a(e,r,t){var n=[],i=e,o=new c(0);if(t.gt(o))for(;i.lte(r);)n.push(i),i=i.plus(t);else if(t.lt(o))for(;i.gte(r);)n.push(i),i=i.plus(t);return n}function s(e){var t=e.split(":"),n=null;if("bignumber"===r.number)try{n=t.map(function(e){return new c(e)})}catch(i){return null}else{n=t.map(function(e){return Number(e)});var o=n.some(function(e){return isNaN(e)});if(o)return null}switch(n.length){case 2:return{start:n[0],end:n[1],step:1};case 3:return{start:n[0],end:n[2],step:n[1]};default:return null}}var u=t(164),c=e.type.BigNumber,f=t(7),l=(t(14),u["boolean"].isBoolean),p=u.string.isString,m=u.number.isNumber;e.range=function(){var t,u,h,g=Array.prototype.slice.call(arguments),d=!1;switch(l(g[g.length-1])&&(d=g.pop()?!0:!1),g.length){case 1:if(!p(g[0]))throw new TypeError("Two or three numbers or a single string expected in function range");var v=s(g[0]);if(!v)throw new SyntaxError('String "'+g[0]+'" is no valid range');t=v.start,u=v.end,h=v.step;break;case 2:t=g[0],u=g[1],h=1;break;case 3:t=g[0],u=g[1],h=g[2];break;case 4:throw new TypeError("Parameter includeEnd must be a boolean");default:throw new e.error.ArgumentsError("range",arguments.length,2,4)}if(!(m(t)||t instanceof c))throw new TypeError("Parameter start must be a number");if(!(m(u)||u instanceof c))throw new TypeError("Parameter end must be a number");if(!(m(h)||h instanceof c))throw new TypeError("Parameter step must be a number");if(t instanceof c||u instanceof c||h instanceof c){var x=!0;t instanceof c||(t=c.convert(t)),u instanceof c||(u=c.convert(u)),h instanceof c||(h=c.convert(h)),t instanceof c&&u instanceof c&&h instanceof c||(x=!1,t instanceof c&&(t=t.toNumber()),u instanceof c&&(u=u.toNumber()),h instanceof c&&(h=h.toNumber()))}var y=x?d?a:o:d?i:n,w=y(t,u,h);return"array"===r.matrix?w:new f(w)}}},function(e,r,t){"use strict";e.exports=function(e,r){function n(r,t,n){if(void 0!==n){if(!f(n)||1!==n.length)throw new TypeError("Single character expected as defaultValue")}else n=" ";if(1!==t.length)throw new e.error.DimensionError(t.length,1);var i=t[0];if(!l(i)||!p(i))throw new TypeError("Invalid size, must contain positive integers (size: "+c.format(t)+")");if(r.length>i)return r.substring(0,i);if(r.lengtha;a++)o+=n;return o}return r}var i=t(164),o=e.type.BigNumber,a=t(7),s=i.array,u=i.object.clone,c=i.string,f=i.string.isString,l=i.number.isNumber,p=i.number.isInteger,m=s.isArray;e.resize=function(t,i,c){if(2!=arguments.length&&3!=arguments.length)throw new e.error.ArgumentsError("resize",arguments.length,2,3);var l=t instanceof a?!0:m(t)?!1:"array"!==r.matrix;if(t instanceof a&&(t=t.valueOf()),i instanceof a&&(i=i.valueOf()),i.length&&i[0]instanceof o&&(i=i.map(function(e){return e instanceof o?e.toNumber():e})),f(t))return n(t,i,c);if(0==i.length){for(;m(t);)t=t[0];return u(t)}m(t)||(t=[t]),t=u(t);var p=s.resize(t,i,c);return l?new a(p):p}}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(7),u=n.array,c=n.number.isNumber,f=n["boolean"].isBoolean,l=n.string.isString,p=o.isComplex,m=a.isUnit;e.size=function(t){if(1!=arguments.length)throw new e.error.ArgumentsError("size",arguments.length,1);var n="array"===r.matrix;if(c(t)||p(t)||m(t)||f(t)||null==t||t instanceof i)return n?[]:new s([]);if(l(t))return n?[t.length]:new s([t.length]);if(Array.isArray(t))return u.size(t);if(t instanceof s)return new s(t.size());throw new e.error.UnsupportedTypeError("size",e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(7),i=r.object,o=r.array,a=Array.isArray;e.squeeze=function(r){if(1!=arguments.length)throw new e.error.ArgumentsError("squeeze",arguments.length,1);if(a(r))return o.squeeze(i.clone(r));if(r instanceof n){var t=o.squeeze(r.toArray());return a(t)?new n(t):t}return i.clone(r)}}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){var i,o;if(l(r))return i=new s(r),o=i.subset(t),o&&o.valueOf();if(r instanceof s)return r.subset(t);if(f(r))return n(r,t);throw new e.error.UnsupportedTypeError("subset",e["typeof"](r))}function n(r,t){if(!(t instanceof u))throw new TypeError("Index expected");if(1!=t.size().length)throw new e.error.DimensionError(t.size().length,1);var n=r.length;c.validateIndex(t.min()[0],n),c.validateIndex(t.max()[0],n);var i=t.range(0),o="";return i.forEach(function(e){o+=r.charAt(e)}),o}function i(r,t,n,i){var a;if(l(r))return a=new s(e.clone(r)),a.subset(t,n,i),a.valueOf();if(r instanceof s)return r.clone().subset(t,n,i);if(f(r))return o(r,t,n,i);throw new e.error.UnsupportedTypeError("subset",e["typeof"](r))}function o(r,t,n,i){if(!(t instanceof u))throw new TypeError("Index expected");if(1!=t.size().length)throw new e.error.DimensionError(t.size().length,1);if(void 0!==i){if(!f(i)||1!==i.length)throw new TypeError("Single character expected as defaultValue")}else i=" ";var o=t.range(0),a=o.size()[0];if(a!=n.length)throw new e.error.DimensionError(o.size()[0],n.length);var s=r.length;c.validateIndex(t.min()[0]),c.validateIndex(t.max()[0]);for(var l=[],p=0;s>p;p++)l[p]=r.charAt(p);if(o.forEach(function(e,r){l[e]=n.charAt(r)}),l.length>s)for(p=s-1,a=l.length;a>p;p++)l[p]||(l[p]=i);return l.join("")}var a=t(164),s=t(7),u=t(6),c=a.array,f=a.string.isString,l=Array.isArray;e.subset=function(){switch(arguments.length){case 2:return r(arguments[0],arguments[1]);case 3:case 4:return i(arguments[0],arguments[1],arguments[2],arguments[3]);default:throw new e.error.ArgumentsError("subset",arguments.length,2,4)}}}},function(e,r,t){"use strict";e.exports=function(e){function r(r){for(var t=0,n=0;nm;m++){a=l[m]=[];for(var h=0;u>h;h++)a[h]=p(f[h][m])}return c?new n(l):l;default:throw new RangeError("Matrix must be two dimensional (size: "+o.format(t)+")")}}}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(7),a=t(14),s=n.array,u=Array.isArray;e.zeros=function(e){var t=a.argsToArray(arguments),n=e instanceof o?!0:u(e)?!1:"matrix"===r.matrix;if(0==t.length)return n?new o:[];var c=!1;t=t.map(function(e){return e instanceof i?(c=!0,e.toNumber()):e});var f=[],l=c?new i(0):0;return f=s.resize(f,t,l),n?new o(f):f}}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(14),a=n.number.isNumber,s=n["boolean"].isBoolean,u=(n.number.isInteger,o.isCollection);e.factorial=function p(t){var m,h,g;if(1!=arguments.length)throw new e.error.ArgumentsError("factorial",arguments.length,1);if(a(t))return t!==Number.POSITIVE_INFINITY?e.gamma(t+1):Math.sqrt(2*Math.PI);if(t instanceof i){if(!c(t))return t.isNegative()||t.isFinite()?e.gamma(t.plus(1)):n.bignumber.tau(r.precision).sqrt();if(t=t.toNumber(),ty;++y)g[y]=h=h.times(m),m=m.plus(x);return g[t]=h.times(m),new i(g[t].toPrecision(r.precision))}if(s(t)||null===t)return 1;if(u(t))return o.deepMap(t,p);throw new e.error.UnsupportedTypeError("factorial",e["typeof"](t))};var c=function(e){return e.isInteger()&&(!e.isNegative()||e.isZero())},f=[],l=[1,1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600,6227020800,87178291200,1307674368e3,20922789888e3,355687428096e3,6402373705728e3,0x1b02b9306890000,243290200817664e4]}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r["boolean"].isBoolean,s=i.isComplex,u=r.number.isNumber,c=r.number.isInteger,f=o.isCollection;e.gamma=function p(r){var t,m,h=4.7421875;if(1!=arguments.length)throw new e.error.ArgumentsError("gamma",arguments.length,1);if(u(r)){if(c(r)){if(0>=r)return isFinite(r)?1/0:0/0;if(r>171)return 1/0;for(var g=r-2,d=r-1;g>1;)d*=g,g--;return 0==d&&(d=1),d}if(.5>r)return Math.PI/(Math.sin(Math.PI*r)*p(1-r));if(r>=171.35)return 1/0;if(r>85){var v=r*r,x=v*r,y=x*r,w=y*r;return Math.sqrt(2*Math.PI/r)*Math.pow(r/Math.E,r)*(1+1/(12*r)+1/(288*v)-139/(51840*x)-571/(2488320*y)+163879/(209018880*w)+5246819/(75246796800*w*r))}--r,m=l[0];for(var b=1;b2)throw new e.error.ArgumentsError("permutations",arguments.length,2);if(i(r)){if(!o(r)||0>r)throw new TypeError("Positive integer value expected in function permutations");if(1==c)return e.factorial(r);if(2==c&&i(t)){if(!o(t)||0>t)throw new TypeError("Positive integer value expected in function permutations");if(t>r)throw new TypeError("second argument k must be less than or equal to first argument n");for(s=1,u=r-t+1;r>=u;u++)s*=u;return s}}if(r instanceof n){if(void 0===t&&a(r))return e.factorial(r);if(t=n.convert(t),!(t instanceof n&&a(r)&&a(t)))throw new TypeError("Positive integer value expected in function permutations");if(t.gt(r))throw new TypeError("second argument k must be less than or equal to first argument n");for(s=new n(1),u=r.minus(t).plus(1);u.lte(r);u=u.plus(1))s=s.times(u);return s}throw new e.error.UnsupportedTypeError("permutations",e["typeof"](r))};var a=function(e){return e.isInteger()&&e.gte(0)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=(t(14),r.number.isNumber),o=r.number.isInteger;e.combinations=function(r,t){var s,u,c,f,l=arguments.length;if(2!=l)throw new e.error.ArgumentsError("combinations",arguments.length,2);if(i(r)){if(!o(r)||0>r)throw new TypeError("Positive integer value enpected in function combinations");if(t>r)throw new TypeError("k must be less than or equal to n");for(s=Math.max(t,r-t),u=1,c=1;r-s>=c;c++)u=u*(s+c)/c;return u}if(r instanceof n){if(t=n.convert(t),!(t instanceof n&&a(r)&&a(t)))throw new TypeError("Positive integer value expected in function combinations");if(t.gt(r))throw new TypeError("k must be less than n in function combinations");for(s=r.minus(t),t.lt(s)&&(s=t),u=new n(1),c=new n(1),f=r.minus(s);c.lte(f);c=c.plus(1))u=u.times(s.plus(c)).dividedBy(c);return u}throw new e.error.UnsupportedTypeError("combinations",e["typeof"](r))};var a=function(e){return e.isInteger()&&e.gte(0)}}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(14),u=n.number.isNumber,c=n.number.nearlyEqual,f=n["boolean"].isBoolean,l=n.string.isString,p=o.isComplex,m=a.isUnit,h=s.isCollection;e.compare=function g(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("compare",arguments.length,2);if(u(t)&&u(n))return c(t,n,r.epsilon)?0:t>n?1:-1;if(t instanceof i)return u(n)?n=i.convert(n):(f(n)||null===n)&&(n=new i(n?1:0)),n instanceof i?new i(t.cmp(n)):g(t.toNumber(),n);if(n instanceof i)return u(t)?t=i.convert(t):(f(t)||null===t)&&(t=new i(t?1:0)),t instanceof i?new i(t.cmp(n)):g(t,n.toNumber());if(m(t)&&m(n)){if(!t.equalBase(n))throw new Error("Cannot compare units with different base");return t.value>n.value?1:t.valuen?1:n>t?-1:0;if(f(t)||null===t)return g(+t,n);if(f(n)||null===n)return g(t,+n);if(p(t)||p(n))throw new TypeError("No ordering relation is defined for complex numbers");throw new e.error.UnsupportedTypeError("compare",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){function r(t,n){if(o(t)){if(o(n)){var i=t.length;if(i!==n.length)return!1;for(var a=0;i>a;a++)if(!r(t[a],n[a]))return!1;return!0}return!1}return o(n)?!1:e.equal(t,n)}var n=t(14),i=n.isCollection,o=Array.isArray;e.deepEqual=function(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("deepEqual",arguments.length,2);return i(t)||i(n)?r(t.valueOf(),n.valueOf()):e.equal(t,n)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(163),n=t(3).nearlyEqual,i=t(14),o=r("equal",{"any, any":function(e,r){return null===e?null===r:null===r?null===e:void 0===e?void 0===r:void 0===r?void 0===e:a(e,r)},"Array | Matrix, any":function(e,r){return i.deepMap2(e,r,a)},"any, Array | Matrix":function(e,r){return i.deepMap2(e,r,a)}}),a=r("_equal",{"boolean, boolean":function(e,r){return e===r},"number, number":function(r,t){return r===t||n(r,t,e.epsilon)},"BigNumber, BigNumber":function(e,r){return e.eq(r)},"Complex, Complex":function(r,t){return(r.re===t.re||n(r.re,t.re,e.epsilon))&&(r.im===t.im||n(r.im,t.im,e.epsilon))},"Unit, Unit":function(r,t){if(!r.equalBase(t))throw new Error("Cannot compare units with different base");return r.value===t.value||n(r.value,t.value,e.epsilon)},"string, string":function(e,r){return e===r}});return o}},function(e,r,t){"use strict";e.exports=function(e){var r=t(163),n=t(3).nearlyEqual,i=t(14),o=r("larger",{"boolean, boolean":function(e,r){return e>r},"number, number":function(r,t){return r>t&&!n(r,t,e.epsilon)},"BigNumber, BigNumber":function(e,r){return e.gt(r)},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(r,t){if(!r.equalBase(t))throw new Error("Cannot compare units with different base");return r.value>t.value&&!n(r.value,t.value,e.epsilon)},"string, string":function(e,r){return e>r},"Array | Matrix, any":function(e,r){return i.deepMap2(e,r,o)},"any, Array | Matrix":function(e,r){return i.deepMap2(e,r,o)}});return o}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(14),u=n.number.isNumber,c=n.number.nearlyEqual,f=n["boolean"].isBoolean,l=n.string.isString,p=o.isComplex,m=a.isUnit,h=s.isCollection;e.largerEq=function g(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("largerEq",arguments.length,2);if(u(t)&&u(n))return t>n||c(t,n,r.epsilon);if(t instanceof i)return u(n)?n=i.convert(n):(f(n)||null===n)&&(n=new i(n?1:0)),n instanceof i?t.gte(n):g(t.toNumber(),n);if(n instanceof i)return u(t)?t=i.convert(t):(f(t)||null===t)&&(t=new i(t?1:0)),t instanceof i?t.gte(n):g(t,n.toNumber());if(m(t)&&m(n)){if(!t.equalBase(n))throw new Error("Cannot compare units with different base");return t.value>=n.value}if(h(t)||h(n))return s.deepMap2(t,n,g);if(l(t)||l(n))return t>=n;if(f(t)||null===t)return g(+t,n);if(f(n)||null===n)return g(t,+n);if(p(t)||p(n))throw new TypeError("No ordering relation is defined for complex numbers");throw new e.error.UnsupportedTypeError("largerEq",e["typeof"](t),e["typeof"](n))},e.largereq=function(){throw new Error("Function largereq is renamed to largerEq")}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(163),n=t(3).nearlyEqual,i=t(14),o=r("smaller",{"boolean, boolean":function(e,r){return r>e},"number, number":function(r,t){return t>r&&!n(r,t,e.epsilon)},"BigNumber, BigNumber":function(e,r){return e.lt(r)},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(r,t){if(!r.equalBase(t))throw new Error("Cannot compare units with different base");return r.valuee},"Array | Matrix, any":function(e,r){return i.deepMap2(e,r,o)},"any, Array | Matrix":function(e,r){return i.deepMap2(e,r,o)}});return o}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(14),u=n.number.isNumber,c=n.number.nearlyEqual,f=n["boolean"].isBoolean,l=n.string.isString,p=o.isComplex,m=a.isUnit,h=s.isCollection;e.smallerEq=function g(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("smallerEq",arguments.length,2);if(u(t)&&u(n))return n>t||c(t,n,r.epsilon);if(t instanceof i)return u(n)?n=i.convert(n):(f(n)||null===n)&&(n=new i(n?1:0)),n instanceof i?t.lte(n):g(t.toNumber(),n);if(n instanceof i)return u(t)?t=i.convert(t):(f(t)||null===t)&&(t=new i(t?1:0)),t instanceof i?t.lte(n):g(t,n.toNumber());if(m(t)&&m(n)){if(!t.equalBase(n))throw new Error("Cannot compare units with different base");return t.value<=n.value}if(h(t)||h(n))return s.deepMap2(t,n,g);if(l(t)||l(n))return n>=t;if(f(t)||null===t)return g(+t,n);if(f(n)||null===n)return g(t,+n);if(p(t)||p(n))throw new TypeError("No ordering relation is defined for complex numbers");throw new e.error.UnsupportedTypeError("smallerEq",e["typeof"](t),e["typeof"](n))},e.smallereq=function(){throw new Error("Function smallereq is renamed to smallerEq")}}},function(e,r,t){"use strict";e.exports=function(e,r){var n=t(164),i=e.type.BigNumber,o=t(4),a=t(8),s=t(14),u=n.number.isNumber,c=n.number.nearlyEqual,f=n["boolean"].isBoolean,l=n.string.isString,p=o.isComplex,m=a.isUnit,h=s.isCollection;e.unequal=function g(t,n){if(2!=arguments.length)throw new e.error.ArgumentsError("unequal",arguments.length,2);if(u(t)){if(u(n))return!c(t,n,r.epsilon);if(p(n))return!c(t,n.re,r.epsilon)||!c(n.im,0,r.epsilon)}if(p(t)){if(u(n))return!c(t.re,n,r.epsilon)||!c(t.im,0,r.epsilon);if(p(n))return!c(t.re,n.re,r.epsilon)||!c(t.im,n.im,r.epsilon)}if(t instanceof i)return u(n)?n=i.convert(n):f(n)&&(n=new i(n?1:0)),n instanceof i?!t.eq(n):g(t.toNumber(),n);if(n instanceof i)return u(t)?t=i.convert(t):f(t)&&(t=new i(t?1:0)),t instanceof i?!t.eq(n):g(t,n.toNumber());if(m(t)&&m(n)){if(!t.equalBase(n))throw new Error("Cannot compare units with different base");return t.value!=n.value}if(h(t)||h(n))return s.deepMap2(t,n,g);if(l(t)||l(n))return t!=n;if(f(t))return g(+t,n);if(f(n))return g(t,+n);if(null===t)return null!==n;if(null===n)return null!==t;if(void 0===t)return void 0!==n;if(void 0===n)return void 0!==t;throw new e.error.UnsupportedTypeError("unequal",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){return a(e,r)?e:r}function n(e){var r=void 0;if(o.deepForEach(e,function(e){(void 0===r||a(e,r))&&(r=e)}),void 0===r)throw new Error("Cannot calculate min of an empty array");return r}var i=t(163),o=t(14),a=t(117)(e);return i("min",{"Array | Matrix":function(e){return n(e)},"Array | Matrix, number | BigNumber":function(e,t){return o.reduce(e,t.valueOf(),r)},"...":function(){return n(arguments)}})}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){return e.larger(r,t)?r:t}function n(r){var t=void 0;if(i.deepForEach(r,function(r){(void 0===t||e.larger(r,t))&&(t=r)}),void 0===t)throw new Error("Cannot calculate max of an empty array");return t}var i=(t(7),t(14)),o=i.isCollection;e.max=function(e){if(0==arguments.length)throw new SyntaxError("Function max requires one or more parameters (0 provided)");if(o(e)){if(1==arguments.length)return n(e);if(2==arguments.length)return i.reduce(arguments[0],arguments[1],r);throw new SyntaxError("Wrong number of parameters")}return n(arguments)}}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){var n=i.reduce(r,t,e.add),o=s(r)?a(r):r.size();return e.divide(n,o[t])}function n(r){var t=0,n=0;if(i.deepForEach(r,function(r){t=e.add(t,r),n++}),0===n)throw new Error("Cannot calculate mean of an empty array");return e.divide(t,n)}var i=(t(7),t(14)),o=i.isCollection,a=t(167).size,s=Array.isArray;e.mean=function(e){if(0==arguments.length)throw new SyntaxError("Function mean requires one or more parameters (0 provided)");if(o(e)){if(1==arguments.length)return n(e);if(2==arguments.length)return r(arguments[0],arguments[1]);throw new SyntaxError("Wrong number of parameters")}return n(arguments)}}},function(e,r,t){"use strict";e.exports=function(e){function r(r){var t=u(r);t.sort(e.compare);var o=t.length;if(0==o)throw new Error("Cannot calculate median of an empty array");if(o%2==0){var s=t[o/2-1],c=t[o/2];if(!(a(s)||s instanceof i||s instanceof n))throw new e.error.UnsupportedTypeError("median",e["typeof"](s));if(!(a(c)||c instanceof i||c instanceof n))throw new e.error.UnsupportedTypeError("median",e["typeof"](c));return e.divide(e.add(s,c),2)}var f=t[(o-1)/2];if(!(a(f)||f instanceof i||f instanceof n))throw new e.error.UnsupportedTypeError("median",e["typeof"](f));return f}var n=(t(7),t(8)),i=e.type.BigNumber,o=t(14),a=t(3).isNumber,s=o.isCollection,u=t(167).flatten;e.median=function(e){if(0==arguments.length)throw new SyntaxError("Function median requires one or more parameters (0 provided)");if(s(e)){if(1==arguments.length)return r(e.valueOf());throw 2==arguments.length?new Error("median(A, dim) is not yet supported"):new SyntaxError("Wrong number of parameters")}return r(Array.prototype.slice.call(arguments))}}},function(e,r,t){"use strict";e.exports=function(e){function r(r){var t=void 0;if(n.deepForEach(r,function(r){t=void 0===t?r:e.multiply(t,r)}),void 0===t)throw new Error("Cannot calculate prod of an empty array");return t}var n=(t(7),t(14)),i=n.isCollection;e.prod=function(e){if(0==arguments.length)throw new SyntaxError("Function prod requires one or more parameters (0 provided)");if(i(e)){if(1==arguments.length)return r(e);throw 2==arguments.length?new Error("prod(A, dim) is not yet supported"):new SyntaxError("Wrong number of parameters")}return r(arguments)}}},function(e){"use strict";e.exports=function(e){e.std=function(){if(0==arguments.length)throw new SyntaxError("Function std requires one or more parameters (0 provided)");var r=e["var"].apply(null,arguments);return e.sqrt(r)}}},function(e,r,t){"use strict";e.exports=function(e){function r(e){var r=void 0;if(i.deepForEach(e,function(e){r=void 0===r?e:o(r,e)}),void 0===r)throw new Error("Cannot calculate sum of an empty array");return r}var n=t(163),i=t(14),o=t(36)(e);return n("sum",{"Array | Matrix":function(e){return r(e)},"Array | Matrix, number | BigNumber":function(){throw new Error("sum(A, dim) is not yet supported")},"...":function(){return r(arguments)}})}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t){var o=0,a=0;if(i.deepForEach(r,function(r){o=e.add(o,r),a++}),0===a)throw new Error("Cannot calculate var of an empty array");var s=e.divide(o,a);switch(o=0,i.deepForEach(r,function(r){var t=e.subtract(r,s);o=e.add(o,e.multiply(t,t))}),t){case"uncorrected":return e.divide(o,a);case"biased":return e.divide(o,a+1);case"unbiased":var u=o instanceof n?new n(0):0;return 1==a?u:e.divide(o,a-1);default:throw new Error('Unknown normalization "'+t+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}var n=(t(7),e.type.BigNumber),i=t(14),o=i.isCollection,a=t(205).isString,s="unbiased";e["var"]=function(e,t){if(0==arguments.length)throw new SyntaxError("Function var requires one or more parameters (0 provided)");if(o(e)){if(1==arguments.length)return r(e,s);if(2==arguments.length){if(!a(t))throw new Error("String expected for parameter normalization");return r(e,t)}throw new SyntaxError("Wrong number of parameters")}return r(arguments,s)}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arccos_arcsec;e.acos=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acos",arguments.length,1);if(a(r))return r>=-1&&1>=r?Math.acos(r):l(new i(r,0));if(u(r)){var t=new i(r.im*r.im-r.re*r.re+1,-2*r.re*r.im),p=e.sqrt(t),m=new i(p.re-r.im,p.im+r.re),h=e.log(m);return new i(1.5707963267948966-h.im,h.re)}if(c(r))return o.deepMap(r,l);if(s(r)||null===r)return Math.acos(r);if(r instanceof n)return f(r,n,!1);throw new e.error.UnsupportedTypeError("acos",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.acosh_asinh_asech_acsch;e.acosh=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acosh",arguments.length,1);if(s(r))return r>=1?Math.log(Math.sqrt(r*r-1)+r):-1>=r?new i(Math.log(Math.sqrt(r*r-1)-r),Math.PI):p(new i(r,0));if(c(r)){var t,o=e.acos(r);return o.im<=0?(t=o.re,o.re=-o.im,o.im=t):(t=o.im,o.im=-o.re,o.re=t),o}if(f(r))return a.deepMap(r,p);if(u(r)||null===r)return r?0:new i(0,1.5707963267948966);if(r instanceof n)return l(r,n,!1,!1);throw new e.error.UnsupportedTypeError("acosh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arctan_arccot;e.acot=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acot",arguments.length,1);if(a(r))return r?Math.atan(1/r):l;if(u(r)){if(0==r.im)return new i(r.re?Math.atan(1/r.re):l,0);var t=r.re*r.re+r.im*r.im;return r=0!=t?new i(r.re=r.re/t,r.im=-r.im/t):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.atan(r)}if(c(r))return o.deepMap(r,p);if(s(r)||null===r)return r?.7853981633974483:l;if(r instanceof n)return f(r,n,!0);throw new e.error.UnsupportedTypeError("acot",e["typeof"](r))};var l=1.5707963267948966}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.atanh_acoth;e.acoth=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acoth",arguments.length,1);if(s(r))return r>=1||-1>=r?isFinite(r)?(Math.log((r+1)/r)+Math.log(r/(r-1)))/2:0:r?m(new i(r,0)):new i(0,p);if(c(r)){if(0==r.re&&0==r.im)return new i(0,p);var t=r.re*r.re+r.im*r.im;return r=0!=t?new i(r.re/t,-r.im/t):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.atanh(r)}if(f(r))return a.deepMap(r,m);if(u(r)||null===r)return r?1/0:new i(0,p);if(r instanceof n)return l(r,n,!0);throw new e.error.UnsupportedTypeError("acoth",e["typeof"](r))};var p=1.5707963267948966}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arcsin_arccsc;e.acsc=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acsc",arguments.length,1);if(a(r))return-1>=r||r>=1?Math.asin(1/r):p(new i(r,0));if(u(r)){if(0==r.re&&0==r.im)return new i(l,1/0); -var t=r.re*r.re+r.im*r.im;return r=0!=t?new i(r.re=r.re/t,r.im=-r.im/t):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.asin(r)}if(c(r))return o.deepMap(r,p);if(s(r)||null===r)return r?l:new i(l,1/0);if(r instanceof n)return f(r,n,!0);throw new e.error.UnsupportedTypeError("acsc",e["typeof"](r))};var l=1.5707963267948966}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.acosh_asinh_asech_acsch;e.acsch=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("acsch",arguments.length,1);if(s(r))return r=1/r,Math.log(r+Math.sqrt(r*r+1));if(c(r)){if(0==r.im)return r=0!=r.re?Math.log(r.re+Math.sqrt(r.re*r.re+1)):1/0,new i(r,0);var t=r.re*r.re+r.im*r.im;return r=0!=t?new i(r.re/t,-r.im/t):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.asinh(r)}if(f(r))return a.deepMap(r,p);if(u(r)||null===r)return r?.881373587019543:1/0;if(r instanceof n)return l(r,n,!0,!0);throw new e.error.UnsupportedTypeError("acsch",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arccos_arcsec;e.asec=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("asec",arguments.length,1);if(a(r))return-1>=r||r>=1?Math.acos(1/r):l(new i(r,0));if(u(r)){if(0==r.re&&0==r.im)return new i(0,1/0);var t=r.re*r.re+r.im*r.im;return r=0!=t?new i(r.re=r.re/t,r.im=-r.im/t):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.acos(r)}if(c(r))return o.deepMap(r,l);if(s(r)||null===r)return r?0:new i(0,1/0);if(r instanceof n)return f(r,n,!0);throw new e.error.UnsupportedTypeError("asec",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.acosh_asinh_asech_acsch;e.asech=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("asech",arguments.length,1);if(s(r)){if(1>=r&&r>=-1){r=1/r;var t=Math.sqrt(r*r-1);return r>0?Math.log(t+r):new i(Math.log(t-r),Math.PI)}return p(new i(r,0))}if(c(r)){if(0==r.re&&0==r.im)return new i(1/0,0);var o=r.re*r.re+r.im*r.im;return r=0!=o?new i(r.re/o,-r.im/o):new i(0!=r.re?r.re/0:0,0!=r.im?-(r.im/0):0),e.acosh(r)}if(f(r))return a.deepMap(r,p);if(u(r)||null===r)return r?0:1/0;if(r instanceof n)return l(r,n,!1,!0);throw new e.error.UnsupportedTypeError("asech",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arcsin_arccsc;e.asin=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("asin",arguments.length,1);if(a(r))return r>=-1&&1>=r?Math.asin(r):l(new i(r,0));if(u(r)){var t=r.re,p=r.im,m=new i(p*p-t*t+1,-2*t*p),h=e.sqrt(m),g=new i(h.re-p,h.im+t),d=e.log(g);return new i(d.im,-d.re)}if(c(r))return o.deepMap(r,l);if(s(r)||null===r)return Math.asin(r);if(r instanceof n)return f(r,n,!1);throw new e.error.UnsupportedTypeError("asin",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.acosh_asinh_asech_acsch;e.asinh=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("asinh",arguments.length,1);if(s(r))return Math.log(Math.sqrt(r*r+1)+r);if(c(r)){var t=r.im;r.im=-r.re,r.re=t;var i=e.asin(r);return r.re=-r.im,r.im=t,t=i.re,i.re=-i.im,i.im=t,i}if(f(r))return a.deepMap(r,p);if(u(r)||null===r)return r?.881373587019543:0;if(r instanceof n)return l(r,n,!0,!1);throw new e.error.UnsupportedTypeError("asinh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=i.isComplex,c=o.isCollection,f=r.bignumber.arctan_arccot;e.atan=function l(r){if(1!=arguments.length)throw new e.error.ArgumentsError("atan",arguments.length,1);if(a(r))return Math.atan(r);if(u(r)){if(0==r.re){if(1==r.im)return new i(0,1/0);if(-1==r.im)return new i(0,-1/0)}var t=r.re,p=r.im,m=t*t+(1-p)*(1-p),h=new i((1-p*p-t*t)/m,-2*t/m),g=e.log(h);return new i(-.5*g.im,.5*g.re)}if(c(r))return o.deepMap(r,l);if(s(r)||null===r)return Math.atan(r);if(r instanceof n)return f(r,n,!1);throw new e.error.UnsupportedTypeError("atan",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(14),a=r.number.isNumber,s=r["boolean"].isBoolean,u=(i.isComplex,o.isCollection);e.atan2=function c(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("atan2",arguments.length,2);if(a(r)&&a(t))return Math.atan2(r,t);if(u(r)||u(t))return o.deepMap2(r,t,c);if(s(r)||null===r)return c(+r,t);if(s(t)||null===t)return c(r,+t);if(r instanceof n)return c(r.toNumber(),t);if(t instanceof n)return c(r,t.toNumber());throw new e.error.UnsupportedTypeError("atan2",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=(o.isUnit,a.isCollection),l=r.bignumber.atanh_acoth;e.atanh=function p(r){if(1!=arguments.length)throw new e.error.ArgumentsError("atanh",arguments.length,1);if(s(r))return 1>=r&&r>=-1?Math.log((1+r)/(1-r))/2:p(new i(r,0));if(c(r)){var t=r.re>1&&0==r.im,o=1-r.re,m=1+r.re,h=o*o+r.im*r.im;r=0!=h?new i((m*o-r.im*r.im)/h,(r.im*o+m*r.im)/h):new i(-1!=r.re?r.re/0:0,0!=r.im?r.im/0:0);var g=r.re;return r.re=Math.log(Math.sqrt(r.re*r.re+r.im*r.im))/2,r.im=Math.atan2(r.im,g)/2,t&&(r.im=-r.im),r}if(f(r))return a.deepMap(r,p);if(u(r)||null===r)return r?1/0:0;if(r instanceof n)return l(r,n,!1);throw new e.error.UnsupportedTypeError("atanh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cos_sin_sec_csc;e.cos=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("cos",arguments.length,1);if(s(r))return Math.cos(r);if(c(r))return new i(Math.cos(r.re)*e.cosh(-r.im),Math.sin(r.re)*e.sinh(-r.im));if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cos is no angle");return Math.cos(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return Math.cos(r);if(r instanceof n)return p(r,n,0,!1);throw new e.error.UnsupportedTypeError("cos",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cosh_sinh_csch_sech;e.cosh=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("cosh",arguments.length,1);if(s(r))return(Math.exp(r)+Math.exp(-r))/2;if(c(r)){var t=Math.exp(r.re),h=Math.exp(-r.re);return new i(Math.cos(r.im)*(t+h)/2,Math.sin(r.im)*(t-h)/2)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cosh is no angle");return m(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(r?1:0);if(r instanceof n)return p(r,n,!1,!1);throw new e.error.UnsupportedTypeError("cosh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.tan_cot;e.cot=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("cot",arguments.length,1);if(s(r))return 1/Math.tan(r);if(c(r)){var t=Math.exp(-4*r.im)-2*Math.exp(-2*r.im)*Math.cos(2*r.re)+1;return new i(2*Math.exp(-2*r.im)*Math.sin(2*r.re)/t,(Math.exp(-4*r.im)-1)/t)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cot is no angle");return 1/Math.tan(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(+r);if(r instanceof n)return p(r,n,!0);throw new e.error.UnsupportedTypeError("cot",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.tanh_coth;e.coth=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("coth",arguments.length,1);if(s(r)){var t=Math.exp(2*r);return(t+1)/(t-1)}if(c(r)){var h=Math.exp(2*r.re),g=h*Math.cos(2*r.im),d=h*Math.sin(2*r.im),v=(g-1)*(g-1)+d*d;return new i(((g+1)*(g-1)+d*d)/v,-2*d/v)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function coth is no angle");return m(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(r?1:0);if(r instanceof n)return p(r,n,!0);throw new e.error.UnsupportedTypeError("coth",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cos_sin_sec_csc;e.csc=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("csc",arguments.length,1);if(s(r))return 1/Math.sin(r);if(c(r)){var t=.25*(Math.exp(-2*r.im)+Math.exp(2*r.im))-.5*Math.cos(2*r.re);return new i(.5*Math.sin(r.re)*(Math.exp(-r.im)+Math.exp(r.im))/t,.5*Math.cos(r.re)*(Math.exp(-r.im)-Math.exp(r.im))/t)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csc is no angle");return 1/Math.sin(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(+r);if(r instanceof n)return p(r,n,1,!0);throw new e.error.UnsupportedTypeError("csc",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number,u=r.number.isNumber,c=r["boolean"].isBoolean,f=i.isComplex,l=o.isUnit,p=a.isCollection,m=r.bignumber.cosh_sinh_csch_sech;e.csch=function h(r){if(1!=arguments.length)throw new e.error.ArgumentsError("csch",arguments.length,1);if(u(r))return 0==r?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(r)-Math.exp(-r)))*s.sign(r);if(f(r)){var t=Math.exp(r.re),g=Math.exp(-r.re),d=Math.cos(r.im)*(t-g),v=Math.sin(r.im)*(t+g),x=d*d+v*v;return new i(2*d/x,-2*v/x)}if(l(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csch is no angle");return h(r.value)}if(p(r))return a.deepMap(r,h);if(c(r)||null===r)return h(r?1:0);if(r instanceof n)return m(r,n,!0,!0);throw new e.error.UnsupportedTypeError("csch",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cos_sin_sec_csc;e.sec=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("sec",arguments.length,1);if(s(r))return 1/Math.cos(r);if(c(r)){var t=.25*(Math.exp(-2*r.im)+Math.exp(2*r.im))+.5*Math.cos(2*r.re);return new i(.5*Math.cos(r.re)*(Math.exp(-r.im)+Math.exp(r.im))/t,.5*Math.sin(r.re)*(Math.exp(r.im)-Math.exp(-r.im))/t)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sec is no angle");return 1/Math.cos(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(+r);if(r instanceof n)return p(r,n,0,!0);throw new e.error.UnsupportedTypeError("sec",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cosh_sinh_csch_sech;e.sech=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("sech",arguments.length,1);if(s(r))return 2/(Math.exp(r)+Math.exp(-r));if(c(r)){var t=Math.exp(r.re),h=Math.exp(-r.re),g=Math.cos(r.im)*(t+h),d=Math.sin(r.im)*(t-h),v=g*g+d*d;return new i(2*g/v,-2*d/v)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sech is no angle");return m(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(r?1:0);if(r instanceof n)return p(r,n,!1,!0);throw new e.error.UnsupportedTypeError("sech",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cos_sin_sec_csc;e.sin=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("sin",arguments.length,1);if(s(r))return Math.sin(r);if(c(r))return new i(Math.sin(r.re)*e.cosh(-r.im),Math.cos(r.re)*e.sinh(r.im));if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sin is no angle");return Math.sin(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return Math.sin(r);if(r instanceof n)return p(r,n,1,!1);throw new e.error.UnsupportedTypeError("sin",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.cosh_sinh_csch_sech;e.sinh=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("sinh",arguments.length,1);if(s(r))return Math.abs(r)<1?r+r*r*r/6+r*r*r*r*r/120:(Math.exp(r)-Math.exp(-r))/2;if(c(r)){var t=Math.cos(r.im),h=Math.sin(r.im),g=Math.exp(r.re),d=Math.exp(-r.re);return new i(t*(g-d)/2,h*(g+d)/2)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sinh is no angle");return m(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(r?1:0);if(r instanceof n)return p(r,n,!0,!1);throw new e.error.UnsupportedTypeError("sinh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.tan_cot;e.tan=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("tan",arguments.length,1);if(s(r))return Math.tan(r);if(c(r)){var t=Math.exp(-4*r.im)+2*Math.exp(-2*r.im)*Math.cos(2*r.re)+1;return new i(2*Math.exp(-2*r.im)*Math.sin(2*r.re)/t,(1-Math.exp(-4*r.im))/t)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tan is no angle");return Math.tan(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return Math.tan(r);if(r instanceof n)return p(r,n,!1);throw new e.error.UnsupportedTypeError("tan",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=e.type.BigNumber,i=t(4),o=t(8),a=t(14),s=r.number.isNumber,u=r["boolean"].isBoolean,c=i.isComplex,f=o.isUnit,l=a.isCollection,p=r.bignumber.tanh_coth;e.tanh=function m(r){if(1!=arguments.length)throw new e.error.ArgumentsError("tanh",arguments.length,1);if(s(r)){var t=Math.exp(2*r);return(t-1)/(t+1)}if(c(r)){var h=Math.exp(2*r.re),g=h*Math.cos(2*r.im),d=h*Math.sin(2*r.im),v=(g+1)*(g+1)+d*d;return new i(((g-1)*(g+1)+d*d)/v,2*d/v)}if(f(r)){if(!r.hasBase(o.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tanh is no angle");return m(r.value)}if(l(r))return a.deepMap(r,m);if(u(r)||null===r)return m(r?1:0);if(r instanceof n)return p(r,n,!1);throw new e.error.UnsupportedTypeError("tanh",e["typeof"](r))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=t(8),i=t(14),o=r.string.isString,a=n.isUnit,s=i.isCollection;e.to=function u(r,t){if(2!=arguments.length)throw new e.error.ArgumentsError("to",arguments.length,2);if(a(r)&&(a(t)||o(t)))return r.to(t);if(s(r)||s(t))return i.deepMap2(r,t,u);throw new e.error.UnsupportedTypeError("to",e["typeof"](r),e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=r.object;e.clone=function(r){if(1!=arguments.length)throw new e.error.ArgumentsError("clone",arguments.length,1);return n.clone(r)}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){if("function"==typeof r)return e.filter(function(e){return r(e)});if(r instanceof RegExp)return e.filter(function(e){return r.test(e)});throw new TypeError("Function or RegExp expected")}var n=t(7);e.filter=function(t,i){if(2!==arguments.length)throw new e.error.ArgumentsError("filter",arguments.length,2);if(t instanceof n){var o=t.size();if(o.length>1)throw new Error("Only one dimensional matrices supported");return new n(r(t.toArray(),i))}if(Array.isArray(t))return r(t,i);throw new e.error.UnsupportedTypeError("filter",e["typeof"](t),e["typeof"](compare))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=r.string;e.format=function(r,t){var i=arguments.length;if(1!==i&&2!==i)throw new e.error.ArgumentsError("format",i,1,2);return n.format(r,t)}}},function(e,r,t){"use strict";e.exports=function(e){function r(r,t,n){(n.override||void 0===e[r])&&(n.wrap&&"function"==typeof t?(e[r]=function(){for(var r=[],n=0,i=arguments.length;i>n;n++){var o=arguments[n];r[n]=o&&o.valueOf()}return t.apply(e,r)},t&&t.transform&&(e[r].transform=t.transform)):e[r]=t,t&&t.transform&&(e.expression.transform[r]=t.transform),e.chaining.Chain.createProxy(r,t))}function n(e){return"function"==typeof e||s(e)||u(e)||c(e)||f(e)}var i=t(164),o=t(4),a=t(8),s=i.number.isNumber,u=i.string.isString,c=o.isComplex,f=a.isUnit;e["import"]=function l(i,o){var a=arguments.length;if(1!=a&&2!=a)throw new e.error.ArgumentsError("import",a,1,2);var s,c={override:o&&o.override||!1,wrap:o&&o.wrap||!1};if(u(i)){var f=t(202)(i);l(f,o)}else{if("object"!=typeof i)throw new TypeError("Object or module name expected");for(s in i)if(i.hasOwnProperty(s)){var p=i[s];n(p)?r(s,p,c):l(p,o)}}}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){var t=function(n,i){return Array.isArray(n)?n.map(function(e,r){return t(e,i.concat(r))}):r(n,i,e)};return t(e,[])}var n=t(7);e.map=function(t,i){if(2!=arguments.length)throw new e.error.ArgumentsError("map",arguments.length,2);if(Array.isArray(t))return r(t,i);if(t instanceof n)return t.map(i);throw new e.error.UnsupportedTypeError("map",e["typeof"](t))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(164),n=r.string.isString;e.print=function(r,t,i){var o=arguments.length;if(2!=o&&3!=o)throw new e.error.ArgumentsError("print",o,2,3);if(!n(r))throw new TypeError("String expected as first parameter in function format");if(!(t instanceof Object))throw new TypeError("Object expected as second parameter in function format");return r.replace(/\$([\w\.]+)/g,function(r,o){for(var a=o.split("."),s=t[a.shift()];a.length&&void 0!==s;){var u=a.shift();s=u?s[u]:s+"."}return void 0!==s?n(s)?s:e.format(s,i):r})}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(7);e.sort=function(t,n){var i=null;if(1===arguments.length)i=e.compare;else{if(2!==arguments.length)throw new e.error.ArgumentsError("sort",arguments.length,1,2);if("function"==typeof n)i=n;else if("asc"===n)i=e.compare;else{if("desc"!==n)throw new e.error.UnsupportedTypeError("sort",e["typeof"](t),e["typeof"](n));i=function(r,t){return-e.compare(r,t)}}}if(t instanceof r){var o=t.size();if(o.length>1)throw new Error("Only one dimensional matrices supported");return new r(t.toArray().sort(i))}if(Array.isArray(t))return t.sort(i);throw new e.error.UnsupportedTypeError("sort",e["typeof"](t),e["typeof"](n))}}},function(e,r,t){"use strict";e.exports=function(e){var r=t(335),n=t(4),i=t(7),o=t(8),a=t(6),s=t(5),u=t(9);e["typeof"]=function(t){if(1!=arguments.length)throw new e.error.ArgumentsError("typeof",arguments.length,1);var c=r.type(t);if("object"===c){if(t instanceof n)return"complex";if(t instanceof i)return"matrix";if(t instanceof o)return"unit";if(t instanceof a)return"index";if(t instanceof s)return"range";if(t instanceof u)return"help";if(t instanceof e.type.BigNumber)return"bignumber";if(t instanceof e.chaining.Chain)return"chain"}return c}}},function(e,r,t){"use strict";e.exports=function(e){function r(e,r){var t=function(n,i){Array.isArray(n)?n.forEach(function(e,r){t(e,i.concat(r))}):r(n,i,e)};t(e,[])}var n=t(7);e.forEach=function(t,i){if(2!=arguments.length)throw new e.error.ArgumentsError("forEach",arguments.length,2);if(Array.isArray(t))return r(t,i);if(t instanceof n)return t.forEach(i);throw new e.error.UnsupportedTypeError("forEach",e["typeof"](t))}}},function(module,exports,__webpack_require__){var __WEBPACK_AMD_DEFINE_FACTORY__,__WEBPACK_AMD_DEFINE_ARRAY__,__WEBPACK_AMD_DEFINE_RESULT__;!function(e){__WEBPACK_AMD_DEFINE_ARRAY__=[],__WEBPACK_AMD_DEFINE_FACTORY__=e,__WEBPACK_AMD_DEFINE_RESULT__="function"==typeof __WEBPACK_AMD_DEFINE_FACTORY__?__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports,__WEBPACK_AMD_DEFINE_ARRAY__):__WEBPACK_AMD_DEFINE_FACTORY__,!(void 0!==__WEBPACK_AMD_DEFINE_RESULT__&&(module.exports=__WEBPACK_AMD_DEFINE_RESULT__))}(function(){"use strict";function getTypeTest(e){var r=typed.types[e];if(!r){var t=Object.keys(typed.types).filter(function(r){return r.toLowerCase()==e.toLowerCase()}).map(function(e){return'"'+e+'"'});throw new Error('Unknown type "'+e+'"'+(t.length?". Did you mean "+t.join(", or ")+"?":""))}return r}function createError(e,r,t,n){var i,o=r[t],a=getTypeOf(o),s=n?n.split(","):null,u=s&&contains(s,"any"),c={fn:e,index:t,actual:o,expected:s};i=s?r.length>t&&!u?"Unexpected type of argument (expected: "+s.join(" or ")+", actual: "+a+", index: "+t+")":"Too few arguments (expected: "+s.join(" or ")+", index: "+t+")":"Too many arguments (expected: "+t+", actual: "+r.length+")";var f=new TypeError(i);return f.data=c,f}function Refs(e){this.name=e||"refs",this.categories={}}function Param(e,r){if("string"==typeof e){var t=e.trim(),n="..."===t.substr(0,3);n&&(t=t.substr(3)),this.types=""===t?["any"]:t.split("|").map(function(e){return e.trim()})}else{if(!Array.isArray(e)){if(e instanceof Param)return e.clone();throw new Error("String or Array expected")}this.types=e}this.conversions=[],this.varArgs=n||r||!1,this.anyType=this.types.some(function(e){return"any"==e})}function Signature(e,r){if("string"==typeof e)this.params=""!==e?e.split(",").map(function(e){return new Param(e)}):[];else{if(!Array.isArray(e))throw new Error("string or Array expected");this.params=e.map(function(e){return new Param(e)})}var t=this.params.filter(function(e){return e.varArgs});if(0===t.length)this.varArgs=!1;else{if(t[0]!==this.params[this.params.length-1])throw new SyntaxError('Unexpected variable arguments operator "..."');this.varArgs=!0}this.fn=r}function Node(e,r,t){this.path=e||[],this.param=e[e.length-1]||null,this.signature=r||null,this.childs=t||[]}function parseSignatures(e){var r=Object.keys(e).reduce(function(r,t){var n=e[t],i=new Signature(t,n);return i.expand().forEach(function(e){var t=e.toString();if(void 0===r[t])r[t]=e;else{var n=Signature.compare(e,r[t]);if(0>n)r[t]=e;else if(0===n)throw new Error('Signature "'+t+'" is defined twice')}}),r},{}),t=Object.keys(r).map(function(e){return r[e]});return t.forEach(function(e){if(e.varArgs)for(var r=e.params.length-1,n=e.params[r],i=0;it;t++)r[t]="arg"+t;return r}function _typed(name,signatures){var refs=new Refs,_signatures=parseSignatures(signatures);if(0==_signatures.length)throw new Error("No signatures provided");var node=parseTree(_signatures,[]),code=[],_name=name||"",_args=getArgs(maxParams(_signatures));code.push("function "+_name+"("+_args.join(", ")+") {"),code.push(node.toCode(refs," ")),code.push("}");var factory=["(function ("+refs.name+") {",refs.toCode(),"return "+code.join("\n"),"})"].join("\n"),fn=eval(factory)(refs);return fn.signatures=mapSignatures(_signatures),fn}function maxParams(e){return e.reduce(function(e,r){return Math.max(e,r.params.length)},0)}function getTypeOf(e){for(var r in types)if(types.hasOwnProperty(r)&&"Object"!==r&&types[r](e))return r;return types.Object(e)?r:"unknown"}function contains(e,r){return-1!==e.indexOf(r)}Refs.prototype.add=function(e,r){var t=r||"fn";this.categories[t]||(this.categories[t]=[]);var n=this.categories[t].indexOf(e);return-1==n&&(n=this.categories[t].length,this.categories[t].push(e)),t+n},Refs.prototype.toCode=function(){var e=[],r=this.name+".categories",t=this.categories;return Object.keys(t).forEach(function(n){t[n].forEach(function(t,i){e.push("var "+n+i+" = "+r+"['"+n+"']["+i+"];")})}),e.join("\n")},Param.compare=function(e,r){if(e.anyType)return 1;if(r.anyType)return-1;if(contains(e.types,"Object"))return 1;if(contains(r.types,"Object"))return-1;if(e.hasConversions()){if(r.hasConversions()){var t=e.conversions.filter(function(e){return void 0!==e})[0],n=r.conversions.filter(function(e){return void 0!==e})[0];return typed.conversions.indexOf(t)-typed.conversions.indexOf(n)}return 1}return r.hasConversions()?-1:0},Param.prototype.overlapping=function(e){return this.types.some(function(r){return contains(e.types,r)})},Param.prototype.clone=function(){var e=new Param(this.types.slice(),this.varArgs);return e.conversions=this.conversions.slice(),e},Param.prototype.hasConversions=function(){return this.conversions.length>0},Param.prototype.toString=function(e){var r=this.types.map(function(r,t){var n=this.conversions[t];return e&&n?n.to:r}.bind(this)).filter(function(e,r,t){return t.indexOf(e)===r});return(this.varArgs?"...":"")+r.join("|")},Signature.prototype.clone=function(){return new Signature(this.params.slice(),this.fn)},Signature.prototype.expand=function(){function e(t,n){if(n.lengthr.params.length)return 1;if(e.params.lengthn.length)return 1;if(t.length "+i+") {"),n.push(r+" var varArgs = [];"),n.push(r+" for (var i = "+i+"; i < arguments.length; i++) {"),n.push(r+" varArgs.push(arguments[i]);"),n.push(r+" }"),n.push(this.signature.toCode(e,r+" ")),n.push(r+"}");else{var s=function(r,t){return r.map(function(r){return e.add(getTypeTest(r),"test")+"("+t+")"}).join(" || ")}.bind(this),u=this.param.types,c=u.filter(function(e,r){return void 0===this.param.conversions[r]}.bind(this));n.push(r+"if ("+s(u,"arg"+i)+") { "+a),n.push(r+" var varArgs = [arg"+i+"];"),n.push(r+" for (var i = "+(i+1)+"; i < arguments.length; i++) {"),n.push(r+" if ("+s(c,"arguments[i]")+") {"),n.push(r+" varArgs.push(arguments[i]);"),u.forEach(function(t,i){var o=this.param.conversions[i];if(o){var a=e.add(getTypeTest(t),"test"),s=e.add(o.convert,"convert");n.push(r+" }"),n.push(r+" else if ("+a+"(arguments[i])) {"),n.push(r+" varArgs.push("+s+"(arguments[i]));")}}.bind(this)),n.push(r+" } else {"),n.push(r+" throw createError('', arguments, i, '"+u.join(",")+"');"),n.push(r+" }"),n.push(r+" }"),n.push(this.signature.toCode(e,r+" ")),n.push(r+"}")}else if(this.param.anyType)n.push(r+"// type: any"),n.push(this._innerCode(e,r,t));else{var f=this.param.types[0],l="any"!==f?e.add(getTypeTest(f),"test"):null;n.push(r+"if ("+l+"(arg"+i+")) { "+a),n.push(this._innerCode(e,r+" ",t)),n.push(r+"}")}}else n.push(this._innerCode(e,r,t));return n.join("\n")},Node.prototype._innerCode=function(e,r,t){var n=[];this.signature&&(n.push(r+"if (arguments.length === "+this.path.length+") {"),n.push(this.signature.toCode(e,r+" ")),n.push(r+"}"));var i=this.childs.filter(function(e){return e.param.anyType})[0];this.childs.forEach(function(t){n.push(t.toCode(e,r,i))}),t&&!this.param.anyType&&n.push(t.toCode(e,r,i));var o=this._exceptions(e,r);return o&&n.push(o),n.join("\n")},Node.prototype._exceptions=function(e,r){var t=this.path.length;if(0===this.childs.length)return[r+"if (arguments.length > "+t+") {",r+" throw createError('', arguments, "+t+")",r+"}"].join("\n");var n=this.childs.reduce(function(e,r){return r.param&&r.param.types.forEach(function(r){-1===e.indexOf(r)&&e.push(r)}),e},[]);return r+"throw createError('', arguments, "+t+", '"+n.join(",")+"');"};var types={"null":function(e){return null===e},undefined:function(e){return void 0===e},"boolean":function(e){return"boolean"==typeof e},number:function(e){return"number"==typeof e},string:function(e){return"string"==typeof e},"function":function(e){return"function"==typeof e},Array:function(e){return Array.isArray(e)},Date:function(e){return e instanceof Date},RegExp:function(e){return e instanceof RegExp},Object:function(e){return"object"==typeof e}},config={},conversions=[],typed={config:config,types:types,conversions:conversions};return typed=_typed("typed",{Object:function(e){return _typed(null,e)},"string, Object":_typed,"string, function":function(e,r){var t={};return t[e]=r,_typed(r.name||null,t)},"string, string, function":function(e,r,t){var n={};return n[r]=t,_typed(e,n)},"...function":function(e){var r="",t={};return e.forEach(function(e,n){var i;if("object"!=typeof e.signatures)throw i=new TypeError("Function is no typed-function (index: "+n+")"),i.data={index:n},i;for(var o in e.signatures)if(e.signatures.hasOwnProperty(o)){if(t.hasOwnProperty(o))throw i=new Error('Signature "'+o+'" is defined twice'),i.data={signature:o},i;t[o]=e.signatures[o]}if(""!=e.name)if(""==r)r=e.name;else if(r!=e.name)throw i=new Error("Function names do not match (expected: "+r+", actual: "+e.name+")"),i.data={actual:e.name,expected:r},i}),_typed(r,t)}}),typed.config=config,typed.types=types,typed.conversions=conversions,typed})},function(e,r,t){"use strict";r.array=t(167),r["boolean"]=t(204),r["function"]=t(337),r.number=t(3),r.bignumber=t(166),r.object=t(2),r.string=t(205),r.types=t(335) -},function(e){"use strict";function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=n,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}r.prototype=new RangeError,r.prototype.constructor=RangeError,r.prototype.name="DimensionError",e.exports=r},function(e,r,t){"use strict";function n(e,t,n){var o,a,s=e.constructor,u=+(e.s<0),c=+(t.s<0);if(u){o=i(r.not(e));for(var f=0;f0;)n(l[--h],p[--g])==d&&(v=v.plus(x)),x=x.times(y);for(;g>0;)n(m,p[--g])==d&&(v=v.plus(x)),x=x.times(y);return s.config({precision:w}),0==d&&(v.s=-v.s),v}function i(e){for(var r=e.c,t=r[0]+"",n=1;n0)if(++s>c)for(s-=c;s--;u+="0");else c>s&&(u=u.slice(0,s)+"."+u.slice(s));for(var f=[0],n=0;n1&&(null==f[a+1]&&(f[a+1]=0),f[a+1]+=f[a]>>1,f[a]&=1)}return f.reverse()}function o(e,t){var n=t.precision,i=-(n+4),o=n+8-e.e,a=25-e.e,s=Math.max(1.442695*Math.log(n+2)|5,5);t.config({precision:a});var u=0,c=new t(Math.asin(e.toNumber())+"");do{var l=r.cos_sin_sec_csc(c,t,1,!1),p=f(l);l.isZero()||(l.s=c.s);var m=l.minus(e).div(p);c=c.minus(m),a=Math.min(2*a,o),t.config({precision:a})}while(2*m.e>=i&&!m.isZero()&&++u<=s);if(u==s)throw new Error("asin() failed to converge to the requested accuracy.Try with a higher precision.");return t.config({precision:n}),c.toDP(n-1)}function a(e,r){var t=e.constructor;t.config({precision:r+Math.log(r)|4});for(var n=new t(1),i=e,o=0/0,a=e.times(e),s=e,u=new t(n),c=new t(n),f=new t(n),l=3;!i.equals(o);l+=2)s=s.times(a),u=u.times(f),c=c.times(f.plus(n)),o=i,f=new t(l),i=i.plus(s.times(u).div(f.times(c)));return t.config({precision:r}),i.toDP(r-1)}function s(e){for(var r=e,t=0/0,n=e.times(e),i=e,o=!0,a=3;!r.equals(t);a+=2)i=i.times(n),t=r,o=!o,r=o?r.plus(i.div(a)):r.minus(i.div(a));return r}function u(e,r){for(var t=e.constructor.ONE,n=e,i=0/0,o=e.times(e),a=r?n:n=t,s=t,u=!0,c=r;!n.equals(i);c+=2)a=a.times(o),s=s.times(c+1).times(c+2),i=n,u=!u,n=u?n.plus(a.div(s)):n.minus(a.div(s));return n}function c(e,t,n){var i=r.pi(t+2),o=r.tau(t);if(e.abs().lte(i.toDP(e.dp())))return[e,!1];var a=e.constructor;if(e.div(i.toDP(e.dp())).toNumber()%2==0)return[new a(1^n),!0];var s=e.mod(o);return s.toDP(e.dp(),1).isZero()?[new a(1^n),!0]:(s.gt(i)&&(n?(s=s.minus(i),s.s=-s.s):s=o.minus(s)),s.constructor=a,[s,!1])}function f(e){var r=e.constructor,t=r.precision;r.config({precision:t+2});var n=r.ONE.minus(e.times(e)).sqrt();return r.config({precision:t}),n.toDP(t-1)}var l=t(12),p=t(3).isNumber,m=t(3).digits,h=t(337).memoize;r.isBigNumber=function(e){return e instanceof l},r.toBigNumber=function(e,r){return new r(m(e)>15?e+"":e)},r.e=h(function(e){var r=l.constructor({precision:e});return new r(1).exp()}),r.phi=h(function(e){var r=l.constructor({precision:e});return new r(1).plus(new r(5).sqrt()).div(2)}),r.pi=h(function(e){var r=l.constructor({precision:e+4}),t=new r(4).times(s(new r(1).div(5))).minus(s(new r(1).div(239)));return r.config({precision:e}),new r(4).times(t)}),r.tau=h(function(e){var t=r.pi(e+2),n=l.constructor({precision:e});return new n(2).times(t)}),r.and=function(e,r){if(e.isFinite()&&!e.isInteger()||r.isFinite()&&!r.isInteger())throw new Error("Parameters in function bitAnd must be integer numbers");var t=e.constructor;if(e.isNaN()||r.isNaN())return new t(0/0);if(e.isZero()||r.eq(-1)||e.eq(r))return e;if(r.isZero()||e.eq(-1))return r;if(!e.isFinite()||!r.isFinite()){if(!e.isFinite()&&!r.isFinite())return e.isNegative()==r.isNegtive()?e:new t(0);if(!e.isFinite())return r.isNegative()?e:e.isNegative()?new t(0):r;if(!r.isFinite())return e.isNegative()?r:r.isNegative()?new t(0):e}return n(e,r,function(e,r){return e&r})},r.leftShift=function(e,r){if(e.isFinite()&&!e.isInteger()||r.isFinite()&&!r.isInteger())throw new Error("Parameters in function leftShift must be integer numbers");var t=e.constructor;return e.isNaN()||r.isNaN()||r.isNegative()&&!r.isZero()?new t(0/0):e.isZero()||r.isZero()?e:e.isFinite()||r.isFinite()?e.times(r.lt(55)?Math.pow(2,r.toNumber())+"":new t(2).pow(r)):new t(0/0)},r.not=function(e){if(e.isFinite()&&!e.isInteger())throw new Error("Parameter in function bitNot must be integer numbers");var r=e.constructor,t=r.precision;r.config({precision:1e9});var e=e.plus(r.ONE);return e.s=-e.s||null,r.config({precision:t}),e},r.or=function(e,r){if(e.isFinite()&&!e.isInteger()||r.isFinite()&&!r.isInteger())throw new Error("Parameters in function bitOr must be integer numbers");var t=e.constructor;if(e.isNaN()||r.isNaN())return new t(0/0);var i=new t(-1);return e.isZero()||r.eq(i)||e.eq(r)?r:r.isZero()||e.eq(i)?e:e.isFinite()&&r.isFinite()?n(e,r,function(e,r){return e|r}):!e.isFinite()&&!e.isNegative()&&r.isNegative()||e.isNegative()&&!r.isNegative()&&!r.isFinite()?i:e.isNegative()&&r.isNegative()?e.isFinite()?e:r:e.isFinite()?r:e},r.rightShift=function(e,r){if(e.isFinite()&&!e.isInteger()||r.isFinite()&&!r.isInteger())throw new Error("Parameters in function rightArithShift must be integer numbers");var t=e.constructor;return e.isNaN()||r.isNaN()||r.isNegative()&&!r.isZero()?new t(0/0):e.isZero()||r.isZero()?e:r.isFinite()?r.lt(55)?e.div(Math.pow(2,r.toNumber())+"").floor():e.div(new t(2).pow(r)).floor():new t(e.isNegative()?-1:e.isFinite()?0:0/0)},r.xor=function(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Parameters in function bitXor must be integer numbers");var i=e.constructor;if(e.isNaN()||t.isNaN())return new i(0/0);if(e.isZero())return t;if(t.isZero())return e;if(e.eq(t))return new i(0);var o=new i(-1);return e.eq(o)?r.not(t):t.eq(o)?r.not(e):e.isFinite()&&t.isFinite()?n(e,t,function(e,r){return e^r}):e.isFinite()||t.isFinite()?new i(e.isNegative()==t.isNegative()?1/0:-1/0):o},r.arccos_arcsec=function(e,t,n){var i=t.precision;if(n){if(e.abs().lt(t.ONE))throw new Error("asec() only has non-complex values for |x| >= 1.")}else if(e.abs().gt(t.ONE))throw new Error("acos() only has non-complex values for |x| <= 1.");if(e.eq(-1))return r.pi(i);t.config({precision:i+4}),n&&(e=t.ONE.div(e));var o=r.arctan_arccot(t.ONE.minus(e.times(e)).sqrt().div(e.plus(t.ONE)),t).times(2);return t.config({precision:i}),o.toDP(i-1)},r.arcsin_arccsc=function(e,t,n){if(e.isNaN())return new t(0/0);var i=t.precision,s=e.abs();if(n){if(s.lt(t.ONE))throw new Error("acsc() only has non-complex values for |x| >= 1.");t.config({precision:i+2}),e=t.ONE.div(e),t.config({precision:i}),s=e.abs()}else if(s.gt(t.ONE))throw new Error("asin() only has non-complex values for |x| <= 1.");if(s.gt(.8)){t.config({precision:i+4});var u=e.s,c=r.pi(i+4).div(2);return e=c.minus(r.arcsin_arccsc(t.ONE.minus(e.times(e)).sqrt(),t)),e.s=u,e.constructor=t,t.config({precision:i}),e.toDP(i-1)}var f=s.gt(.58);f&&(t.config({precision:i+8}),e=e.div(new t(2).sqrt().times(t.ONE.minus(e.times(e)).sqrt().plus(t.ONE).sqrt())),t.config({precision:i}));var l=60>=i||e.dp()<=Math.log(i)&&e.lt(.05)?a(e,i):o(e,t);return f?l.times(2):l},r.arctan_arccot=function(e,t,n){if(e.isNaN())return new t(0/0);if(!n&&e.isZero()||n&&!e.isFinite())return new t(0);var i=t.precision;if(!n&&!e.isFinite()||n&&e.isZero()){var o=r.pi(i+2).div(2).toDP(i-1);return o.s=e.s,o}t.config({precision:i+4}),n&&(e=t.ONE.div(e));var a=e.abs();if(a.lte(.875)){var u=s(e);return u.constructor=t,t.config({precision:i}),u.toDP(t.precision-1)}if(a.gte(1.143)){var o=r.pi(i+4).div(2),u=o.minus(s(t.ONE.div(a)));return u.s=e.s,u.constructor=t,t.config({precision:i}),u.toDP(t.precision-1)}return e=e.div(e.times(e).plus(1).sqrt()),t.config({precision:i}),r.arcsin_arccsc(e,t)},r.acosh_asinh_asech_acsch=function(e,r,t,n){if(e.isNaN())return new r(0/0);if(n&&e.isZero())return new r(1/0);if(!t)if(n){if(e.isNegative()||e.gt(r.ONE))throw new Error("asech() only has non-complex values for 0 <= x <= 1.")}else if(e.lt(r.ONE))throw new Error("acosh() only has non-complex values for x >= 1.");var i=r.precision;r.config({precision:i+4});var o=new r(e);o.constructor=r,n&&(o=r.ONE.div(o));var a=t?o.times(o).plus(r.ONE):o.times(o).minus(r.ONE),s=o.plus(a.sqrt()).ln();return r.config({precision:i}),new r(s.toPrecision(i))},r.atanh_acoth=function(e,r,t){if(e.isNaN())return new r(0/0);var n=e.abs();if(n.eq(r.ONE))return new r(e.isNegative()?-1/0:1/0);if(n.gt(r.ONE)){if(!t)throw new Error("atanh() only has non-complex values for |x| <= 1.")}else if(t)throw new Error("acoth() has complex values for |x| < 1.");if(e.isZero())return new r(0);var i=r.precision;r.config({precision:i+4});var o=new r(e);o.constructor=r,t&&(o=r.ONE.div(o));var a=r.ONE.plus(o).div(r.ONE.minus(o)).ln().div(2);return r.config({precision:i}),new r(a.toPrecision(i))},r.cos_sin_sec_csc=function(e,r,t,n){if(e.isNaN()||!e.isFinite())return new r(0/0);var i=r.precision,o=new r(e),a=o.isNegative();a&&(o.s=-o.s);var s=i+(0|Math.log(i))+3;if(r.config({precision:s}),o=c(o,s,t),o[0].constructor=r,o[1])return o=o[0],n&&o.isZero()&&(o=new r(1/0)),r.config({precision:i}),o;var f;if(o=o[0],t){f=u(o.div(3125),t),r.config({precision:Math.min(s,i+15)});for(var l=new r(5),p=new r(16),m=new r(20),h=0;5>h;++h){var g=f.times(f),d=g.times(f),v=d.times(g);f=p.times(v).minus(m.times(d)).plus(l.times(f))}a&&(f.s=-f.s)}else{var x,y;o.abs().lt(r.ONE)?(x=64,y=3):(x=256,y=4),f=u(o.div(x),t),r.config({precision:Math.min(s,i+8)});for(var w=new r(8);y>0;--y){var g=f.times(f),b=g.times(g);f=w.times(b.minus(g)).plus(r.ONE)}}return n&&(f=f.e<=-i?new r(1/0):r.ONE.div(f)),r.config({precision:i}),f.toDP(i-1)},r.tan_cot=function(e,t,n){if(e.isNaN())return new t(0/0);var i=t.precision,o=r.pi(i+2),a=o.div(2).toDP(i-1);o=o.toDP(i-1);var s=c(e,i,1)[0];if(s.abs().eq(o))return new t(1/0);t.config({precision:i+2});var u=r.cos_sin_sec_csc(s,t,1,!1),l=f(u);u=u.toDP(i),l=l.toDP(i),s.eq(e)?s.gt(a)&&(l.s=-l.s):o.minus(s.abs()).gt(a)&&(l.s=-l.s);var p=n?l.div(u):u.div(l);return t.config({precision:i}),new t(p.toPrecision(i))},r.cosh_sinh_csch_sech=function(e,r,t,n){if(e.isNaN())return new r(0/0);if(!e.isFinite())return new r(n?0:t?e:1/0);var i=r.precision;r.config({precision:i+4});var o=new r(e);return o.constructor=r,o=o.exp(),o=t?o.minus(r.ONE.div(o)):o.plus(r.ONE.div(o)),o=n?new r(2).div(o):o.div(2),r.config({precision:i}),new r(o.toPrecision(i))},r.tanh_coth=function(e,r,t){if(e.isNaN())return new r(0/0);if(!e.isFinite())return new r(e.s);var n=r.precision;r.config({precision:n+4});var i=new r(e);i.constructor=r;var o=i.exp(),a=r.ONE.div(o),s=o.minus(a);return s=t?o.plus(a).div(s):s.div(o.plus(a)),r.config({precision:n}),s.toDP(n-1)},r.format=function(e,t){if("function"==typeof t)return t(e);if(!e.isFinite())return e.isNaN()?"NaN":e.gt(0)?"Infinity":"-Infinity";var n="auto",i=void 0;switch(void 0!==t&&(t.notation&&(n=t.notation),p(t)?i=t:t.precision&&(i=t.precision)),n){case"fixed":return r.toFixed(e,i);case"exponential":return r.toExponential(e,i);case"auto":var o=.001,a=1e5;t&&t.exponential&&(void 0!==t.exponential.lower&&(o=t.exponential.lower),void 0!==t.exponential.upper&&(a=t.exponential.upper));{({toExpNeg:e.constructor.toExpNeg,toExpPos:e.constructor.toExpPos})}if(e.constructor.config({toExpNeg:Math.round(Math.log(o)/Math.LN10),toExpPos:Math.round(Math.log(a)/Math.LN10)}),e.isZero())return"0";var s,u=e.abs();return s=u.gte(o)&&u.lt(a)?e.toSignificantDigits(i).toFixed():r.toExponential(e,i),s.replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],r=arguments[4];return"."!==e?e+r:r});default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", or "fixed".')}},r.toExponential=function(e,r){return void 0!==r?e.toExponential(r-1):e.toExponential()},r.toFixed=function(e,r){return e.toFixed(r||0)}},function(e,r,t){"use strict";function n(e){for(var r=[];m(e);)r.push(e.length),e=e[0];return r}function i(e,r,t){var n,o=e.length;if(o!=r[t])throw new l(o,r[t]);if(tn;n++){var s=e[n];if(!m(s))throw new l(r.length-1,r.length,"<");i(e[n],r,a)}}else for(n=0;o>n;n++)if(m(e[n]))throw new l(r.length+1,r.length,">")}function o(e,t,n,i){var a,s,u=e.length,c=t[n],l=Math.min(u,c);if(e.length=c,na;a++)s=e[a],m(s)||(s=[s],e[a]=s),o(s,t,p,i);for(a=l;c>a;a++)s=[],e[a]=s,o(s,t,p,i)}else{for(a=0;l>a;a++)for(;m(e[a]);)e[a]=e[a][0];if(i!==r.UNINITIALIZED)for(a=l;c>a;a++)e[a]=f.clone(i)}}function a(e,r,t){var n,i;if(r>t){var o=t+1;for(n=0,i=e.length;i>n;n++)e[n]=a(e[n],r,o)}else for(;m(e);)e=e[0];return e}function s(e,r,t){var n,i;if(m(e)){var o=t+1;for(n=0,i=e.length;i>n;n++)e[n]=s(e[n],r,o)}else for(var a=t;r>a;a++)e=[e];return e}var u=t(3),c=t(205),f=t(2),l=(t(335),t(165)),p=t(170),m=Array.isArray;r.size=function(e){var t=n(e);return r.validate(e,t),t},r.validate=function(e,r){var t=0==r.length;if(t){if(m(e))throw new l(e.length,0)}else i(e,r,0)},r.validateIndex=function(e,r){if(!u.isNumber(e)||!u.isInteger(e))throw new TypeError("Index must be an integer (value: "+e+")");if(0>e)throw new p(e);if(void 0!==r&&e>=r)throw new p(e,r)},r.UNINITIALIZED={},r.resize=function(e,r,t){if(!m(e)||!m(r))throw new TypeError("Array expected");if(0===r.length)throw new Error("Resizing to scalar is not supported");r.forEach(function(e){if(!u.isNumber(e)||!u.isInteger(e)||0>e)throw new TypeError("Invalid size, must contain positive integers (size: "+c.format(r)+")")});var n=void 0!==t?t:0;return o(e,r,0,n),e},r.squeeze=function(e,t){for(var n=t||r.size(e);m(e)&&1===e.length;)e=e[0],n.shift();for(var i=n.length;1===n[i-1];)i--;return ia;a++)e=[e],o.unshift(1);for(e=s(e,t,0);o.lengthi;i++)n=n.concat.apply(n,r[i]);r=n}return r},r.argsToArray=function(e){for(var r=[],t=0,n=e.length;n>t;t++)r[t]=e[t];return r},r.isArray=m},function(e){e.exports="2.0.0-SNAPSHOT"},function(e){"use strict";function r(e,t,n,i){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.count=t,this.min=n,this.max=i,this.message="Wrong number of arguments in function "+e+" ("+t+" provided, "+n+(void 0!=i?"-"+i:"")+" expected)",this.stack=(new Error).stack}r.prototype=new Error,r.prototype.constructor=Error,r.prototype.name="ArgumentsError",e.exports=r},function(e){"use strict";function r(e,t,n){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=n),this.message=void 0!==this.min&&this.index=this.max?"Index out of range ("+this.index+" > "+(this.max-1)+")":"Index out of range ("+this.index+")",this.stack=(new Error).stack}r.prototype=new RangeError,r.prototype.constructor=RangeError,r.prototype.name="IndexError",e.exports=r},function(e){"use strict";function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.types=Array.prototype.splice.call(arguments,1),this.message=e?0==this.types.length?"Unsupported type of argument in function "+e:"Function "+e+"("+this.types.join(", ")+") not supported":"Unsupported type of argument",this.stack=(new Error).stack}r.prototype=new TypeError,r.prototype.constructor=TypeError,r.prototype.name="UnsupportedTypeError",e.exports=r},function(e,r,t){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(this.nodes=e||[],!a(this.nodes)||!this.nodes.every(s))throw new TypeError("Array containing Nodes expected")}var i=t(180),o=(t(2),t(205)),a=(t(14),t(164),Array.isArray),s=i.isNode;n.prototype=new i,n.prototype.type="ArrayNode",n.prototype._compile=function(e){var r="array"!==e.math.config().matrix,t=this.nodes.map(function(r){return r._compile(e)});return(r?"math.matrix([":"[")+t.join(",")+(r?"])":"]")},n.prototype.forEach=function(e){for(var r=0;r0;return n=r?r:n,r});e.range=function(e,r,t){return new u(e instanceof s?e.toNumber():e,r instanceof s?r.toNumber():r,t instanceof s?t.toNumber():t)};var c=this.ranges.map(function(r,t){var n=i[t];return r instanceof o?n?'(function (scope) { scope = Object.create(scope); scope["end"] = size['+t+"]; return range( "+r.start._compile(e)+", "+r.end._compile(e)+", "+(r.step?r.step._compile(e):"1")+" );})(scope)":"range("+r.start._compile(e)+", "+r.end._compile(e)+", "+(r.step?r.step._compile(e):"1")+")":n?'(function (scope) { scope = Object.create(scope); scope["end"] = size['+t+"]; return "+r._compile(e)+";})(scope)":r._compile(e)});return n?"(function () { var obj = "+this.object._compile(e)+"; var size = math.size(obj).valueOf(); return math.subset( obj, math.index("+c.join(", ")+") "+(r?", "+r:"")+" );})()":"math.subset("+this.object._compile(e)+",math.index("+c.join(", ")+")"+(r?", "+r:"")+")"},n.prototype.forEach=function(e){e(this.object,"object",this);for(var r=0;r3)throw new Error("Too many arguments");this.start=e,this.end=r,this.step=t||null}var i=t(180),o=i.isNode;n.prototype=new i,n.prototype.type="RangeNode",n.prototype._compile=function(e){return"math.range("+this.start._compile(e)+", "+this.end._compile(e)+(this.step?", "+this.step._compile(e):"")+")"},n.prototype.forEach=function(e){e(this.start,"start",this),e(this.end,"end",this),this.step&&e(this.step,"step",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.start,"start",this)),this._ifNode(e(this.end,"end",this)),this.step&&this._ifNode(e(this.step,"step",this)))},n.prototype.clone=function(){return new n(this.start,this.end,this.step&&this.step)},n.prototype.toString=function(){var e=this.start.toString();return this.step&&(e+=":"+this.step.toString()),e+=":"+this.end.toString()},n.prototype.toTex=function(){var e=this.start.toTex();return this.step&&(e+=":"+this.step.toTex()),e+=":"+this.end.toTex()},e.exports=n},function(e,r,t){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!u(e))throw new TypeError('String expected for parameter "name"');this.name=e}function i(e){throw new Error("Undefined symbol "+e)}var o=t(180),a=t(8),s=t(339),u=t(205).isString;n.prototype=new o,n.prototype.type="SymbolNode",n.prototype._compile=function(e){return e.undef=i,e.Unit=a,this.name in e.math?'("'+this.name+'" in scope ? scope["'+this.name+'"] : math["'+this.name+'"])':'("'+this.name+'" in scope ? scope["'+this.name+'"] : '+(a.isValuelessUnit(this.name)?'new Unit(null, "'+this.name+'")':'undef("'+this.name+'")')+")"},n.prototype.forEach=function(){},n.prototype.map=function(){return this.clone()},n.prototype.clone=function(){return new n(this.name)},n.prototype.toString=function(){return this.name},n.prototype.toTex=function(){return s.toSymbol(this.name)},e.exports=n},function(e,r,t){"use strict";function n(e,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(e instanceof o))throw new TypeError('Expected IndexNode for parameter "index"');if(!(r instanceof i))throw new TypeError('Expected Node for parameter "expr"');this.index=e,this.expr=r}var i=t(180),o=t(177);n.prototype=new i,n.prototype.type="UpdateNode",n.prototype._compile=function(e){return'scope["'+this.index.objectName()+'"] = '+this.index.compileSubset(e,this.expr._compile(e))},n.prototype.forEach=function(e){e(this.index,"index",this),e(this.expr,"expr",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.index,"index",this)),this._ifNode(e(this.expr,"expr",this)))},n.prototype.clone=function(){return new n(this.index,this.expr)},n.prototype.toString=function(){return this.index.toString()+" = "+this.expr.toString()},n.prototype.toTex=function(){return this.index.toTex()+" = "+this.expr.toTex()},e.exports=n},function(e){e.exports={name:"e",category:"Constants",syntax:["e"],description:"Euler's number, the base of the natural logarithm. Approximately equal to 2.71828",examples:["e","e ^ 2","exp(2)","log(e)"],seealso:["exp"]}},function(e){e.exports={name:"false",category:"Constants",syntax:["false"],description:"Boolean value false",examples:["false"],seealso:["true"]}},function(e){e.exports={name:"i",category:"Constants",syntax:["i"],description:"Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.",examples:["i","i * i","sqrt(-1)"],seealso:[]}},function(e){e.exports={name:"Infinity",category:"Constants",syntax:["Infinity"],description:"Infinity, a number which is larger than the maximum number that can be handled by a floating point number.",examples:["Infinity","1 / 0"],seealso:[]}},function(e){e.exports={name:"LN2",category:"Constants",syntax:["LN2"],description:"Returns the natural logarithm of 2, approximately equal to 0.693",examples:["LN2","log(2)"],seealso:[]}},function(e){e.exports={name:"LN10",category:"Constants",syntax:["LN10"],description:"Returns the natural logarithm of 10, approximately equal to 2.302",examples:["LN10","log(10)"],seealso:[]}},function(e){e.exports={name:"LOG2E",category:"Constants",syntax:["LOG2E"],description:"Returns the base-2 logarithm of E, approximately equal to 1.442",examples:["LOG2E","log(e, 2)"],seealso:[]}},function(e){e.exports={name:"LOG10E",category:"Constants",syntax:["LOG10E"],description:"Returns the base-10 logarithm of E, approximately equal to 0.434",examples:["LOG10E","log(e, 10)"],seealso:[]}},function(e){e.exports={name:"NaN",category:"Constants",syntax:["NaN"],description:"Not a number",examples:["NaN","0 / 0"],seealso:[]}},function(e){e.exports={name:"null",category:"Constants",syntax:["null"],description:"Value null",examples:["null"],seealso:["true","false"]}},function(e){e.exports={name:"pi",category:"Constants",syntax:["pi"],description:"The number pi is a mathematical constant that is the ratio of a circle's circumference to its diameter, and is approximately equal to 3.14159",examples:["pi","sin(pi/2)"],seealso:["tau"]}},function(e){e.exports={name:"phi",category:"Constants",syntax:["phi"],description:"Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...",examples:["tau"],seealso:[]}},function(e){e.exports={name:"SQRT1_2",category:"Constants",syntax:["SQRT1_2"],description:"Returns the square root of 1/2, approximately equal to 0.707",examples:["SQRT1_2","sqrt(1/2)"],seealso:[]}},function(e){e.exports={name:"SQRT2",category:"Constants",syntax:["SQRT2"],description:"Returns the square root of 2, approximately equal to 1.414",examples:["SQRT2","sqrt(2)"],seealso:[]}},function(e){e.exports={name:"tau",category:"Constants",syntax:["tau"],description:"Tau is the ratio constant of a circle's circumference to radius, equal to 2 * pi, approximately 6.2832.",examples:["tau","2 * pi"],seealso:["pi"]}},function(e){e.exports={name:"true",category:"Constants",syntax:["true"],description:"Boolean value true",examples:["true"],seealso:["false"]}},function(e){e.exports={name:"version",category:"Constants",syntax:["version"],description:"A string with the version number of math.js",examples:["version"],seealso:[]}},function(e,r,t){function n(e){return t(i(e))}function i(e){return o[e]||function(){throw new Error("Cannot find module '"+e+"'.")}()}var o={"./clone":154,"./clone.js":154,"./filter":155,"./filter.js":155,"./forEach":162,"./forEach.js":162,"./format":156,"./format.js":156,"./import":157,"./import.js":157,"./map":158,"./map.js":158,"./print":159,"./print.js":159,"./sort":160,"./sort.js":160,"./typeof":161,"./typeof.js":161};n.keys=function(){return Object.keys(o)},n.resolve=i,e.exports=n,n.id=202},function(e,r,t){var n=(t(165),t(170));r.transform=function(e){return e instanceof n?new n(e.index+1,e.min+1,e.max+1):e}},function(e,r){"use strict";r.isBoolean=function(e){return e instanceof Boolean||"boolean"==typeof e}},function(e,r,t){"use strict";function n(e,t){if(Array.isArray(e)){for(var i="[",o=e.length,a=0;o>a;a++)0!=a&&(i+=", "),i+=n(e[a],t);return i+="]"}return r.format(e,t)}var i=t(3),o=t(166),a=t(12);r.isString=function(e){return e instanceof String||"string"==typeof e},r.endsWith=function(e,r){var t=e.length-r.length,n=e.length;return e.substring(t,n)===r},r.format=function(e,t){return i.isNumber(e)?i.format(e,t):e instanceof a?o.format(e,t):Array.isArray(e)?n(e,t):r.isString(e)?'"'+e+'"':"function"==typeof e?e.syntax?e.syntax+"":"function":e instanceof Object?"function"==typeof e.format?e.format(t):e.toString():String(e)}},function(e){e.exports={name:"abs",category:"Arithmetic",syntax:["abs(x)"],description:"Compute the absolute value.",examples:["abs(3.5)","abs(-4.2)"],seealso:["sign"]}},function(e){e.exports={name:"add",category:"Operators",syntax:["x + y","add(x, y)"],description:"Add two values.",examples:["a = 2.1 + 3.6","a - 3.6","3 + 2i",'"hello" + " world"',"3 cm + 2 inch"],seealso:["subtract"]}},function(e){e.exports={name:"ceil",category:"Arithmetic",syntax:["ceil(x)"],description:"Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.",examples:["ceil(3.2)","ceil(3.8)","ceil(-4.2)"],seealso:["floor","fix","round"]}},function(e){e.exports={name:"cube",category:"Arithmetic",syntax:["cube(x)"],description:"Compute the cube of a value. The cube of x is x * x * x.",examples:["cube(2)","2^3","2 * 2 * 2"],seealso:["multiply","square","pow"]}},function(e){e.exports={name:"divide",category:"Operators",syntax:["x / y","divide(x, y)"],description:"Divide two values.",examples:["a = 2 / 3","a * 3","4.5 / 2","3 + 4 / 2","(3 + 4) / 2","18 km / 4.5"],seealso:["multiply"]}},function(e){e.exports={name:"dotDivide",category:"Operators",syntax:["x ./ y","dotDivide(x, y)"],description:"Divide two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a ./ b"],seealso:["multiply","dotMultiply","divide"]}},function(e){e.exports={name:"dotMultiply",category:"Operators",syntax:["x .* y","dotMultiply(x, y)"],description:"Multiply two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a .* b"],seealso:["multiply","divide","dotDivide"]}},function(e){e.exports={name:"dotpow",category:"Operators",syntax:["x .^ y","dotpow(x, y)"],description:"Calculates the power of x to y element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","a .^ 2"],seealso:["pow"]}},function(e){e.exports={name:"exp",category:"Arithmetic",syntax:["exp(x)"],description:"Calculate the exponent of a value.",examples:["exp(1.3)","e ^ 1.3","log(exp(1.3))","x = 2.4","(exp(i*x) == cos(x) + i*sin(x)) # Euler's formula"],seealso:["pow","log"]}},function(e){e.exports={name:"fix",category:"Arithmetic",syntax:["fix(x)"],description:"Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.",examples:["fix(3.2)","fix(3.8)","fix(-4.2)","fix(-4.8)"],seealso:["ceil","floor","round"]}},function(e){e.exports={name:"floor",category:"Arithmetic",syntax:["floor(x)"],description:"Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.",examples:["floor(3.2)","floor(3.8)","floor(-4.2)"],seealso:["ceil","fix","round"]}},function(e){e.exports={name:"gcd",category:"Arithmetic",syntax:["gcd(a, b)","gcd(a, b, c, ...)"],description:"Compute the greatest common divisor.",examples:["gcd(8, 12)","gcd(-4, 6)","gcd(25, 15, -10)"],seealso:["lcm","xgcd"]}},function(e){e.exports={name:"lcm",category:"Arithmetic",syntax:["lcm(x, y)"],description:"Compute the least common multiple.",examples:["lcm(4, 6)","lcm(6, 21)","lcm(6, 21, 5)"],seealso:["gcd"]}},function(e){e.exports={name:"log",category:"Arithmetic",syntax:["log(x)","log(x, base)"],description:"Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).",examples:["log(3.5)","a = log(2.4)","exp(a)","10 ^ 4","log(10000, 10)","log(10000) / log(10)","b = log(1024, 2)","2 ^ b"],seealso:["exp","log10"]}},function(e){e.exports={name:"log10",category:"Arithmetic",syntax:["log10(x)"],description:"Compute the 10-base logarithm of a value.",examples:["log10(0.00001)","log10(10000)","10 ^ 4","log(10000) / log(10)","log(10000, 10)"],seealso:["exp","log"]}},function(e){e.exports={name:"mod",category:"Operators",syntax:["x % y","x mod y","mod(x, y)"],description:"Calculates the modulus, the remainder of an integer division.",examples:["7 % 3","11 % 2","10 mod 4","function isOdd(x) = x % 2","isOdd(2)","isOdd(3)"],seealso:["divide"]}},function(e){e.exports={name:"multiply",category:"Operators",syntax:["x * y","multiply(x, y)"],description:"multiply two values.",examples:["a = 2.1 * 3.4","a / 3.4","2 * 3 + 4","2 * (3 + 4)","3 * 2.1 km"],seealso:["divide"]}},function(e){e.exports={name:"norm",category:"Arithmetic",syntax:["norm(x)","norm(x, p)"],description:"Calculate the norm of a number, vector or matrix.",examples:["abs(-3.5)","norm(-3.5)","norm(3 - 4i))","norm([1, 2, -3], Infinity)","norm([1, 2, -3], -Infinity)","norm([3, 4], 2)","norm([[1, 2], [3, 4]], 1)","norm([[1, 2], [3, 4]], 'inf')","norm([[1, 2], [3, 4]], 'fro')"]}},function(e){e.exports={name:"nthRoot",category:"Arithmetic",syntax:["nthRoot(a)","nthRoot(a, root)"],description:'Calculate the nth root of a value. The principal nth root of a positive real number A, is the positive real solution of the equation "x^root = A".',examples:["4 ^ 3","nthRoot(64, 3)","nthRoot(9, 2)","sqrt(9)"],seealso:["sqrt","pow"]}},function(e){e.exports={name:"pow",category:"Operators",syntax:["x ^ y","pow(x, y)"],description:"Calculates the power of x to y, x^y.",examples:["2^3 = 8","2*2*2","1 + e ^ (pi * i)"],seealso:["multiply"]}},function(e){e.exports={name:"round",category:"Arithmetic",syntax:["round(x)","round(x, n)"],description:"round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.",examples:["round(3.2)","round(3.8)","round(-4.2)","round(-4.8)","round(pi, 3)","round(123.45678, 2)"],seealso:["ceil","floor","fix"]}},function(e){e.exports={name:"sign",category:"Arithmetic",syntax:["sign(x)"],description:"Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.",examples:["sign(3.5)","sign(-4.2)","sign(0)"],seealso:["abs"]}},function(e){e.exports={name:"sqrt",category:"Arithmetic",syntax:["sqrt(x)"],description:"Compute the square root value. If x = y * y, then y is the square root of x.",examples:["sqrt(25)","5 * 5","sqrt(-1)"],seealso:["square","multiply"]}},function(e){e.exports={name:"square",category:"Arithmetic",syntax:["square(x)"],description:"Compute the square of a value. The square of x is x * x.",examples:["square(3)","sqrt(9)","3^2","3 * 3"],seealso:["multiply","pow","sqrt","cube"]}},function(e){e.exports={name:"subtract",category:"Operators",syntax:["x - y","subtract(x, y)"],description:"subtract two values.",examples:["a = 5.3 - 2","a + 2","2/3 - 1/6","2 * 3 - 3","2.1 km - 500m"],seealso:["add"]}},function(e){e.exports={name:"unaryMinus",category:"Operators",syntax:["-x","unaryMinus(x)"],description:"Inverse the sign of a value. Converts booleans and strings to numbers.",examples:["-4.5","-(-5.6)",'-"22"'],seealso:["add","subtract","unaryPlus"]}},function(e){e.exports={name:"unaryPlus",category:"Operators",syntax:["+x","unaryPlus(x)"],description:"Converts booleans and strings to numbers.",examples:["+true",'+"2"'],seealso:["add","subtract","unaryMinus"]}},function(e){e.exports={name:"xgcd",category:"Arithmetic",syntax:["xgcd(a, b)"],description:"Calculate the extended greatest common divisor for two values",examples:["xgcd(8, 12)","gcd(8, 12)","xgcd(36163, 21199)"],seealso:["gcd","lcm"]}},function(e){e.exports={name:"bitAnd",category:"Bitwise",syntax:["x & y","bitAnd(x, y)"],description:"Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0",examples:["5 & 3","bitAnd(53, 131)","[1, 12, 31] & 42"],seealso:["bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e){e.exports={name:"bitNot",category:"Bitwise",syntax:["~x","bitNot(x)"],description:"Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.",examples:["~1","~2","bitNot([2, -3, 4])"],seealso:["bitAnd","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e){e.exports={name:"bitOr",category:"Bitwise",syntax:["x | y","bitOr(x, y)"],description:"Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.",examples:["5 | 3","bitOr([1, 2, 3], 4)"],seealso:["bitAnd","bitNot","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e){e.exports={name:"bitXor",category:"Bitwise",syntax:["bitXor(x, y)"],description:"Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.",examples:["bitOr(1, 2)","bitXor([2, 3, 4], 4)"],seealso:["bitAnd","bitNot","bitOr","leftShift","rightArithShift","rightLogShift"]}},function(e){e.exports={name:"leftShift",category:"Bitwise",syntax:["x << y","leftShift(x, y)"],description:"Bitwise left logical shift of a value x by y number of bits.",examples:["4 << 1","8 >> 1"],seealso:["bitAnd","bitNot","bitOr","bitXor","rightArithShift","rightLogShift"]}},function(e){e.exports={name:"rightArithShift",category:"Bitwise",syntax:["x >> y","leftShift(x, y)"],description:"Bitwise right arithmetic shift of a value x by y number of bits.",examples:["8 >> 1","4 << 1","-12 >> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightLogShift"]}},function(e){e.exports={name:"rightLogShift",category:"Bitwise",syntax:["x >> y","leftShift(x, y)"],description:"Bitwise right logical shift of a value x by y number of bits.",examples:["8 >>> 1","4 << 1","-12 >>> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift"]}},function(e){e.exports={name:"arg",category:"Complex",syntax:["arg(x)"],description:"Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).",examples:["arg(2 + 2i)","atan2(3, 2)","arg(2 + 3i)"],seealso:["re","im","conj","abs"]}},function(e){e.exports={name:"conj",category:"Complex",syntax:["conj(x)"],description:"Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.",examples:["conj(2 + 3i)","conj(2 - 3i)","conj(-5.2i)"],seealso:["re","im","abs","arg"]}},function(e){e.exports={name:"re",category:"Complex",syntax:["re(x)"],description:"Get the real part of a complex number.",examples:["re(2 + 3i)","im(2 + 3i)","re(-5.2i)","re(2.4)"],seealso:["im","conj","abs","arg"]}},function(e){e.exports={name:"im",category:"Complex",syntax:["im(x)"],description:"Get the imaginary part of a complex number.",examples:["im(2 + 3i)","re(2 + 3i)","im(-5.2i)","im(2.4)"],seealso:["re","conj","abs","arg"]}},function(e){e.exports={name:"bignumber",category:"Type",syntax:["bignumber(x)"],description:"Create a big number from a number or string.",examples:["0.1 + 0.2","bignumber(0.1) + bignumber(0.2)",'bignumber("7.2")','bignumber("7.2e500")',"bignumber([0.1, 0.2, 0.3])"],seealso:["boolean","complex","index","matrix","string","unit"]}},function(e){e.exports={name:"boolean",category:"Type",syntax:["x","boolean(x)"],description:"Convert a string or number into a boolean.",examples:["boolean(0)","boolean(1)","boolean(3)",'boolean("true")','boolean("false")',"boolean([1, 0, 1, 1])"],seealso:["bignumber","complex","index","matrix","number","string","unit"]}},function(e){e.exports={name:"complex",category:"Type",syntax:["complex()","complex(re, im)","complex(string)"],description:"Create a complex number.",examples:["complex()","complex(2, 3)",'complex("7 - 2i")'],seealso:["bignumber","boolean","index","matrix","number","string","unit"]}},function(e){e.exports={name:"index",category:"Type",syntax:["[start]","[start:end]","[start:step:end]","[start1, start 2, ...]","[start1:end1, start2:end2, ...]","[start1:step1:end1, start2:step2:end2, ...]"],description:"Create an index to get or replace a subset of a matrix",examples:["[]","[1, 2, 3]","A = [1, 2, 3; 4, 5, 6]","A[1, :]","A[1, 2] = 50","A[0:2, 0:2] = ones(2, 2)"],seealso:["bignumber","boolean","complex","matrix,","number","range","string","unit"]}},function(e){e.exports={name:"matrix",category:"Type",syntax:["[]","[a1, b1, ...; a2, b2, ...]","matrix()","matrix([...])"],description:"Create a matrix.",examples:["[]","[1, 2, 3]","[1, 2, 3; 4, 5, 6]","matrix()","matrix([3, 4])"],seealso:["bignumber","boolean","complex","index","number","string","unit"]}},function(e){e.exports={name:"number",category:"Type",syntax:["x","number(x)"],description:"Create a number or convert a string or boolean into a number.",examples:["2","2e3","4.05","number(2)",'number("7.2")',"number(true)","number([true, false, true, true])",'number("52cm", "m")'],seealso:["bignumber","boolean","complex","index","matrix","string","unit"]}},function(e){e.exports={name:"string",category:"Type",syntax:['"text"',"string(x)"],description:"Create a string or convert a value to a string",examples:['"Hello World!"',"string(4.2)","string(3 + 2i)"],seealso:["bignumber","boolean","complex","index","matrix","number","unit"]}},function(e){e.exports={name:"unit",category:"Type",syntax:["value unit","unit(value, unit)","unit(string)"],description:"Create a unit.",examples:["5.5 mm","3 inch",'unit(7.1, "kilogram")','unit("23 deg")'],seealso:["bignumber","boolean","complex","index","matrix","number","string"]}},function(e){e.exports={name:"eval",category:"Expression",syntax:["eval(expression)","eval([expr1, expr2, expr3, ...])"],description:"Evaluate an expression or an array with expressions.",examples:['eval("2 + 3")','eval("sqrt(" + 4 + ")")'],seealso:[]}},function(e){e.exports={name:"help",category:"Expression",syntax:["help(object)","help(string)"],description:"Display documentation on a function or data type.",examples:["help(sqrt)",'help("complex")'],seealso:[]}},function(e){e.exports={name:"and",category:"Logical",syntax:["x and y","and(x, y)"],description:"Logical and. Test whether two values are both defined with a nonzero/nonempty value.",examples:["true and false","true and true","2 and 4"],seealso:["not","or","xor"]}},function(e){e.exports={name:"not",category:"Logical",syntax:["!x","not x","not(x)"],description:"Logical not. Flips the boolean value of given argument.",examples:["!true","not false","!2","!0"],seealso:["and","or","xor"]}},function(e){e.exports={name:"or",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical or. Test if at least one value is defined with a nonzero/nonempty value.",examples:["true or false","false or false","0 or 4"],seealso:["not","and","xor"]}},function(e){e.exports={name:"xor",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.",examples:["true xor false","false xor false","true xor true","0 or 4"],seealso:["not","and","or"]}},function(e){e.exports={name:"concat",category:"Matrix",syntax:["concat(A, B, C, ...)","concat(A, B, C, ..., dim)"],description:"Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.",examples:["A = [1, 2; 5, 6]","B = [3, 4; 7, 8]","concat(A, B)","concat(A, B, 1)","concat(A, B, 2)"],seealso:["det","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"cross",category:"Matrix",syntax:["cross(A, B)"],description:"Calculate the cross product for two vectors in three dimensional space.",examples:["cross([1, 1, 0], [0, 1, 1])","cross([3, -3, 1], [4, 9, 2])","cross([2, 3, 4], [5, 6, 7])"],seealso:["multiply","dot"]}},function(e){e.exports={name:"det",category:"Matrix",syntax:["det(x)"],description:"Calculate the determinant of a matrix",examples:["det([1, 2; 3, 4])","det([-2, 2, 3; -1, 1, 3; 2, 0, -1])"],seealso:["concat","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"diag",category:"Matrix",syntax:["diag(x)","diag(x, k)"],description:"Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.",examples:["diag(1:3)","diag(1:3, 1)","a = [1, 2, 3; 4, 5, 6; 7, 8, 9]","diag(a)"],seealso:["concat","det","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"dot",category:"Matrix",syntax:["dot(A, B)"],description:"Calculate the dot product of two vectors. The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn",examples:["dot([2, 4, 1], [2, 2, 3])","[2, 4, 1] * [2, 2, 3]"],seealso:["multiply","cross"]}},function(e){e.exports={name:"eye",category:"Matrix",syntax:["eye(n)","eye(m, n)","eye([m, n])","eye"],description:"Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.",examples:["eye(3)","eye(3, 5)","a = [1, 2, 3; 4, 5, 6]","eye(size(a))"],seealso:["concat","det","diag","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"flatten",category:"Matrix",syntax:["flatten(x)"],description:"Flatten a multi dimensional matrix into a single dimensional matrix.",examples:["a = [1, 2, 3; 4, 5, 6]","size(a)","b = flatten(a)","size(b)"],seealso:["concat","resize","size","squeeze"]}},function(e){e.exports={name:"inv",category:"Matrix",syntax:["inv(x)"],description:"Calculate the inverse of a matrix",examples:["inv([1, 2; 3, 4])","inv(4)","1 / 4"],seealso:["concat","det","diag","eye","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"ones",category:"Matrix",syntax:["ones(m)","ones(m, n)","ones(m, n, p, ...)","ones([m])","ones([m, n])","ones([m, n, p, ...])","ones"],description:"Create a matrix containing ones.",examples:["ones(3)","ones(3, 5)","ones([2,3]) * 4.5","a = [1, 2, 3; 4, 5, 6]","ones(size(a))"],seealso:["concat","det","diag","eye","inv","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"range",category:"Type",syntax:["start:end","start:step:end","range(start, end)","range(start, end, step)","range(string)"],description:"Create a range. Lower bound of the range is included, upper bound is excluded.",examples:["1:5","3:-1:-3","range(3, 7)","range(0, 12, 2)",'range("4:10")',"a = [1, 2, 3, 4; 5, 6, 7, 8]","a[1:2, 1:2]"],seealso:["concat","det","diag","eye","inv","ones","size","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"resize",category:"Matrix",syntax:["resize(x, size)","resize(x, size, defaultValue)"],description:"Resize a matrix.",examples:["resize([1,2,3,4,5], [3])","resize([1,2,3], [5])","resize([1,2,3], [5], -1)","resize(2, [2, 3])",'resize("hello", [8], "!")'],seealso:["size","subset","squeeze"]}},function(e){e.exports={name:"size",category:"Matrix",syntax:["size(x)"],description:"Calculate the size of a matrix.",examples:["size(2.3)",'size("hello world")',"a = [1, 2; 3, 4; 5, 6]","size(a)","size(1:6)"],seealso:["concat","det","diag","eye","inv","ones","range","squeeze","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"squeeze",category:"Matrix",syntax:["squeeze(x)"],description:"Remove inner and outer singleton dimensions from a matrix.",examples:["a = zeros(3,2,1)","size(squeeze(a))","b = zeros(1,1,3)","size(squeeze(b))"],seealso:["concat","det","diag","eye","inv","ones","range","size","subset","trace","transpose","zeros"]}},function(e){e.exports={name:"subset",category:"Matrix",syntax:["value(index)","value(index) = replacement","subset(value, [index])","subset(value, [index], replacement)"],description:"Get or set a subset of a matrix or string. Indexes are one-based. Both the ranges lower-bound and upper-bound are included.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","trace","transpose","zeros"]}},function(e){e.exports={name:"trace",category:"Matrix",syntax:["trace(A)"],description:"Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.",examples:["A = [1, 2, 3; -1, 2, 3; 2, 0, 3]","trace(A)"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","transpose","zeros"]}},function(e){e.exports={name:"transpose",category:"Matrix",syntax:["x'","transpose(x)"],description:"Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","transpose(a)"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","trace","zeros"]}},function(e){e.exports={name:"zeros",category:"Matrix",syntax:["zeros(m)","zeros(m, n)","zeros(m, n, p, ...)","zeros([m])","zeros([m, n])","zeros([m, n, p, ...])","zeros"],description:"Create a matrix containing zeros.",examples:["zeros(3)","zeros(3, 5)","a = [1, 2, 3; 4, 5, 6]","zeros(size(a))"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose"]}},function(e){e.exports={name:"combinations",category:"Probability",syntax:["combinations(n, k)"],description:"Compute the number of combinations of n items taken k at a time",examples:["combinations(7, 5)"],seealso:["permutations","factorial"]}},function(e){e.exports={name:"factorial",category:"Probability",syntax:["n!","factorial(n)"],description:"Compute the factorial of a value",examples:["5!","5 * 4 * 3 * 2 * 1","3!"],seealso:["combinations","permutations","gamma"]}},function(e){e.exports={name:"gamma",category:"Probability",syntax:["gamma(n)"],description:"Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.",examples:["gamma(4)","3!","gamma(1/2)","sqrt(pi)"],seealso:["factorial"]}},function(e){e.exports={name:"permutations",category:"Probability",syntax:["permutations(n)","permutations(n, k)"],description:"Compute the number of permutations of n items taken k at a time",examples:["permutations(5)","permutations(5, 3)"],seealso:["combinations","factorial"]}},function(e){e.exports={name:"pickRandom",category:"Probability",syntax:["pickRandom(array)"],description:"Pick a random entry from a given array.",examples:["pickRandom(0:10)","pickRandom([1, 3, 1, 6])"],seealso:["random","randomInt"]} -},function(e){e.exports={name:"random",category:"Probability",syntax:["random()","random(max)","random(min, max)","random(size)","random(size, max)","random(size, min, max)"],description:"Return a random number.",examples:["random()","random(10, 20)","random([2, 3])"],seealso:["pickRandom","randomInt"]}},function(e){e.exports={name:"randInt",category:"Probability",syntax:["randInt()","randInt(max)","randInt(min, max)","randInt(size)","randInt(size, max)","randInt(size, min, max)"],description:"Return a random integer number",examples:["randInt()","randInt(10, 20)","randInt([2, 3], 10)"],seealso:["pickRandom","random"]}},function(e){e.exports={name:"compare",category:"Relational",syntax:["compare(x, y)"],description:"Compare two values. Returns 1 if x is larger than y, -1 if x is smaller than y, and 0 if x and y are equal.",examples:["compare(2, 3)","compare(3, 2)","compare(2, 2)","compare(5cm, 40mm)","compare(2, [1, 2, 3])"],seealso:["equal","unequal","smaller","smallerEq","largerEq"]}},function(e){e.exports={name:"deepEqual",category:"Relational",syntax:["deepEqual(x, y)"],description:"Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.",examples:["[1,3,4] == [1,3,4]","[1,3,4] == [1,3]"],seealso:["equal","unequal","smaller","larger","smallerEq","largerEq","compare"]}},function(e){e.exports={name:"equal",category:"Relational",syntax:["x == y","equal(x, y)"],description:"Check equality of two values. Returns true if the values are equal, and false if not.",examples:["2+2 == 3","2+2 == 4","a = 3.2","b = 6-2.8","a == b","50cm == 0.5m"],seealso:["unequal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]}},function(e){e.exports={name:"larger",category:"Relational",syntax:["x > y","larger(x, y)"],description:"Check if value x is larger than y. Returns true if x is larger than y, and false if not.",examples:["2 > 3","5 > 2*2","a = 3.3","b = 6-2.8","(a > b)","(b < a)","5 cm > 2 inch"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare"]}},function(e){e.exports={name:"largerEq",category:"Relational",syntax:["x >= y","largerEq(x, y)"],description:"Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.",examples:["2 > 1+1","2 >= 1+1","a = 3.2","b = 6-2.8","(a > b)"],seealso:["equal","unequal","smallerEq","smaller","largerEq","compare"]}},function(e){e.exports={name:"smaller",category:"Relational",syntax:["x < y","smaller(x, y)"],description:"Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.",examples:["2 < 3","5 < 2*2","a = 3.3","b = 6-2.8","(a < b)","5 cm < 2 inch"],seealso:["equal","unequal","larger","smallerEq","largerEq","compare"]}},function(e){e.exports={name:"smallerEq",category:"Relational",syntax:["x <= y","smallerEq(x, y)"],description:"Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.",examples:["2 < 1+1","2 <= 1+1","a = 3.2","b = 6-2.8","(a < b)"],seealso:["equal","unequal","larger","smaller","largerEq","compare"]}},function(e){e.exports={name:"unequal",category:"Relational",syntax:["x != y","unequal(x, y)"],description:"Check unequality of two values. Returns true if the values are unequal, and false if they are equal.",examples:["2+2 != 3","2+2 != 4","a = 3.2","b = 6-2.8","a != b","50cm != 0.5m","5 cm != 2 inch"],seealso:["equal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]}},function(e){e.exports={name:"max",category:"Statistics",syntax:["max(a, b, c, ...)","max(A)","max(A, dim)"],description:"Compute the maximum value of a list of values.",examples:["max(2, 3, 4, 1)","max([2, 3, 4, 1])","max([2, 5; 4, 3])","max([2, 5; 4, 3], 1)","max([2, 5; 4, 3], 2)","max(2.7, 7.1, -4.5, 2.0, 4.1)","min(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["mean","median","min","prod","std","sum","var"]}},function(e){e.exports={name:"mean",category:"Statistics",syntax:["mean(a, b, c, ...)","mean(A)","mean(A, dim)"],description:"Compute the arithmetic mean of a list of values.",examples:["mean(2, 3, 4, 1)","mean([2, 3, 4, 1])","mean([2, 5; 4, 3])","mean([2, 5; 4, 3], 1)","mean([2, 5; 4, 3], 2)","mean([1.0, 2.7, 3.2, 4.0])"],seealso:["max","median","min","prod","std","sum","var"]}},function(e){e.exports={name:"median",category:"Statistics",syntax:["median(a, b, c, ...)","median(A)"],description:"Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.",examples:["median(5, 2, 7)","median([3, -1, 5, 7])"],seealso:["max","mean","min","prod","std","sum","var"]}},function(e){e.exports={name:"min",category:"Statistics",syntax:["min(a, b, c, ...)","min(A)","min(A, dim)"],description:"Compute the minimum value of a list of values.",examples:["min(2, 3, 4, 1)","min([2, 3, 4, 1])","min([2, 5; 4, 3])","min([2, 5; 4, 3], 1)","min([2, 5; 4, 3], 2)","min(2.7, 7.1, -4.5, 2.0, 4.1)","max(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["max","mean","median","prod","std","sum","var"]}},function(e){e.exports={name:"prod",category:"Statistics",syntax:["prod(a, b, c, ...)","prod(A)"],description:"Compute the product of all values.",examples:["prod(2, 3, 4)","prod([2, 3, 4])","prod([2, 5; 4, 3])"],seealso:["max","mean","min","median","min","std","sum","var"]}},function(e){e.exports={name:"std",category:"Statistics",syntax:["std(a, b, c, ...)","std(A)","std(A, normalization)"],description:'Compute the standard deviation of all values, defined as std(A) = sqrt(var(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["std(2, 4, 6)","std([2, 4, 6, 8])",'std([2, 4, 6, 8], "uncorrected")','std([2, 4, 6, 8], "biased")',"std([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","sum","var"]}},function(e){e.exports={name:"sum",category:"Statistics",syntax:["sum(a, b, c, ...)","sum(A)"],description:"Compute the sum of all values.",examples:["sum(2, 3, 4, 1)","sum([2, 3, 4, 1])","sum([2, 5; 4, 3])"],seealso:["max","mean","median","min","prod","std","sum","var"]}},function(e){e.exports={name:"var",category:"Statistics",syntax:["var(a, b, c, ...)","var(A)","var(A, normalization)"],description:'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["var(2, 4, 6)","var([2, 4, 6, 8])",'var([2, 4, 6, 8], "uncorrected")','var([2, 4, 6, 8], "biased")',"var([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","std","sum"]}},function(e){e.exports={name:"acos",category:"Trigonometry",syntax:["acos(x)"],description:"Compute the inverse cosine of a value in radians.",examples:["acos(0.5)","acos(cos(2.3))"],seealso:["cos","atan","asin"]}},function(e){e.exports={name:"acosh",category:"Trigonometry",syntax:["acosh(x)"],description:"Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.",examples:["acosh(1.5)"],seealso:["cosh","asinh","atanh"]}},function(e){e.exports={name:"acot",category:"Trigonometry",syntax:["acot(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acot(0.5)","acot(cot(0.5))","acot(2)"],seealso:["cot","atan"]}},function(e){e.exports={name:"acoth",category:"Trigonometry",syntax:["acoth(x)"],description:"Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.",examples:["acoth(0.5)"],seealso:["acsch","asech"]}},function(e){e.exports={name:"acsc",category:"Trigonometry",syntax:["acsc(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acsc(0.5)","acsc(csc(0.5))","acsc(2)"],seealso:["csc","asin","asec"]}},function(e){e.exports={name:"acsch",category:"Trigonometry",syntax:["acsch(x)"],description:"Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.",examples:["acsch(0.5)"],seealso:["asech","acoth"]}},function(e){e.exports={name:"asec",category:"Trigonometry",syntax:["asec(x)"],description:"Calculate the inverse secant of a value.",examples:["asec(0.5)","asec(sec(0.5))","asec(2)"],seealso:["acos","acot","acsc"]}},function(e){e.exports={name:"asech",category:"Trigonometry",syntax:["asech(x)"],description:"Calculate the inverse secant of a value.",examples:["asech(0.5)"],seealso:["acsch","acoth"]}},function(e){e.exports={name:"asin",category:"Trigonometry",syntax:["asin(x)"],description:"Compute the inverse sine of a value in radians.",examples:["asin(0.5)","asin(sin(2.3))"],seealso:["sin","acos","atan"]}},function(e){e.exports={name:"asinh",category:"Trigonometry",syntax:["asinh(x)"],description:"Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.",examples:["asinh(0.5)"],seealso:["acosh","atanh"]}},function(e){e.exports={name:"atan",category:"Trigonometry",syntax:["atan(x)"],description:"Compute the inverse tangent of a value in radians.",examples:["atan(0.5)","atan(tan(2.3))"],seealso:["tan","acos","asin"]}},function(e){e.exports={name:"atanh",category:"Trigonometry",syntax:["atanh(x)"],description:"Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.",examples:["atanh(0.5)"],seealso:["acosh","asinh"]}},function(e){e.exports={name:"atan2",category:"Trigonometry",syntax:["atan2(y, x)"],description:"Computes the principal value of the arc tangent of y/x in radians.",examples:["atan2(2, 2) / pi","angle = 60 deg in rad","x = cos(angle)","y = sin(angle)","atan2(y, x)"],seealso:["sin","cos","tan"]}},function(e){e.exports={name:"cos",category:"Trigonometry",syntax:["cos(x)"],description:"Compute the cosine of x in radians.",examples:["cos(2)","cos(pi / 4) ^ 2","cos(180 deg)","cos(60 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["acos","sin","tan"]}},function(e){e.exports={name:"cosh",category:"Trigonometry",syntax:["cosh(x)"],description:"Compute the hyperbolic cosine of x in radians.",examples:["cosh(0.5)"],seealso:["sinh","tanh","coth"]}},function(e){e.exports={name:"cot",category:"Trigonometry",syntax:["cot(x)"],description:"Compute the cotangent of x in radians. Defined as 1/tan(x)",examples:["cot(2)","1 / tan(2)"],seealso:["sec","csc","tan"]}},function(e){e.exports={name:"coth",category:"Trigonometry",syntax:["coth(x)"],description:"Compute the hyperbolic cotangent of x in radians.",examples:["coth(2)","1 / tanh(2)"],seealso:["sech","csch","tanh"]}},function(e){e.exports={name:"csc",category:"Trigonometry",syntax:["csc(x)"],description:"Compute the cosecant of x in radians. Defined as 1/sin(x)",examples:["csc(2)","1 / sin(2)"],seealso:["sec","cot","sin"]}},function(e){e.exports={name:"csch",category:"Trigonometry",syntax:["csch(x)"],description:"Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)",examples:["csch(2)","1 / sinh(2)"],seealso:["sech","coth","sinh"]}},function(e){e.exports={name:"sec",category:"Trigonometry",syntax:["sec(x)"],description:"Compute the secant of x in radians. Defined as 1/cos(x)",examples:["sec(2)","1 / cos(2)"],seealso:["cot","csc","cos"]}},function(e){e.exports={name:"sech",category:"Trigonometry",syntax:["sech(x)"],description:"Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)",examples:["sech(2)","1 / cosh(2)"],seealso:["coth","csch","cosh"]}},function(e){e.exports={name:"sin",category:"Trigonometry",syntax:["sin(x)"],description:"Compute the sine of x in radians.",examples:["sin(2)","sin(pi / 4) ^ 2","sin(90 deg)","sin(30 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["asin","cos","tan"]}},function(e){e.exports={name:"sinh",category:"Trigonometry",syntax:["sinh(x)"],description:"Compute the hyperbolic sine of x in radians.",examples:["sinh(0.5)"],seealso:["cosh","tanh"]}},function(e){e.exports={name:"tan",category:"Trigonometry",syntax:["tan(x)"],description:"Compute the tangent of x in radians.",examples:["tan(0.5)","sin(0.5) / cos(0.5)","tan(pi / 4)","tan(45 deg)"],seealso:["atan","sin","cos"]}},function(e){e.exports={name:"tanh",category:"Trigonometry",syntax:["tanh(x)"],description:"Compute the hyperbolic tangent of x in radians.",examples:["tanh(0.5)","sinh(0.5) / cosh(0.5)"],seealso:["sinh","cosh"]}},function(e){e.exports={name:"to",category:"Units",syntax:["x to unit","to(x, unit)"],description:"Change the unit of a value.",examples:["5 inch to cm","3.2kg to g","16 bytes in bits"],seealso:[]}},function(e){e.exports={name:"clone",category:"Utils",syntax:["clone(x)"],description:"Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices",examples:["clone(3.5)","clone(2 - 4i)","clone(45 deg)","clone([1, 2; 3, 4])",'clone("hello world")'],seealso:[]}},function(e){e.exports={name:"map",category:"Utils",syntax:["map(x, callback)"],description:"Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.",examples:["map([1, 2, 3], function(val) { return value * value })"],seealso:["filter","forEach"]}},function(e){e.exports={name:"filter",category:"Utils",syntax:["filter(x, test)"],description:"Filter items in a matrix.",examples:["isPositive(x) = x > 0","filter([6, -2, -1, 4, 3], isPositive)","filter([6, -2, 0, 1, 0], x != 0)"],seealso:["sort","map","forEach"]}},function(e){e.exports={name:"forEach",category:"Utils",syntax:["forEach(x, callback)"],description:"Iterates over all elements of a matrix/array, and executes the given callback function.",examples:["forEach([1, 2, 3], function(val) { console.log(val) })"],seealso:["map","sort","filter"]}},function(e){e.exports={name:"format",category:"Utils",syntax:["format(value)","format(value, precision)"],description:"Format a value of any type as string.",examples:["format(2.3)","format(3 - 4i)","format([])","format(pi, 3)"],seealso:["print"]}},function(e){e.exports={name:"import",category:"Utils",syntax:["import(string)"],description:"Import functions from a file.",examples:['import("numbers")','import("./mylib.js")'],seealso:[]}},function(e){e.exports={name:"sort",category:"Utils",syntax:["sort(x)","sort(x, compare)"],description:'Sort the items in a matrix. Compare can be a string "asc" or "desc", or a custom sort function.',examples:["sort([5, 10, 1])",'sort(["C", "B", "A", "D"])',"sortByLength(a, b) = size(a)[1] - size(b)[1]",'sort(["Langdon", "Tom", "Sara"], sortByLength)'],seealso:["map","filter","forEach"]}},function(e){e.exports={name:"typeof",category:"Utils",syntax:["typeof(x)"],description:"Get the type of a variable.",examples:["typeof(3.5)","typeof(2 - 4i)","typeof(45 deg)",'typeof("hello world")'],seealso:[]}},function(e,r,t){"use strict";e.exports=function(){function e(e,r){var t=r.re*r.re+r.im*r.im;return 0!=t?new n((e.re*r.re+e.im*r.im)/t,(e.im*r.re-e.re*r.im)/t):new n(0!=e.re?e.re/0:0,0!=e.im?e.im/0:0)}var r=t(163),n=t(4),i=r("divideScalar",{"number, number":function(e,r){return e/r},"Complex, Complex":e,"BigNumber, BigNumber":function(e,r){return e.div(r)},"Unit, number":function(e,r){var t=e.clone();return t.value=(null===t.value?t._normalize(1):t.value)/r,t}});return i}},function(e,r,t){"use strict";e.exports=function(e){function r(r){if(!s.hasOwnProperty(r))throw new Error("Unknown distribution "+r);var t=Array.prototype.slice.call(arguments,1),o=s[r].apply(this,t);return function(r){var t={random:function(r,t,i){var s,c,f;if(arguments.length>3)throw new e.error.ArgumentsError("random",arguments.length,0,3);if(1===arguments.length?a(r)?s=r:f=r:2===arguments.length?a(r)?(s=r,f=t):(c=r,f=t):(s=r,c=t,f=i),void 0===f&&(f=1),void 0===c&&(c=0),void 0!==s){var l=u(s.valueOf(),c,f,o);return s instanceof n?new n(l):l}return o(c,f)},randomInt:function(r,t,i){var o,c,f;if(arguments.length>3||arguments.length<1)throw new e.error.ArgumentsError("randomInt",arguments.length,1,3);if(1===arguments.length?a(r)?o=r:f=r:2===arguments.length?a(r)?(o=r,f=t):(c=r,f=t):(o=r,c=t,f=i),void 0===c&&(c=0),void 0!==o){var l=u(o.valueOf(),c,f,s);return o instanceof n?new n(l):l}return s(c,f)},pickRandom:function(r){if(1!==arguments.length)throw new e.error.ArgumentsError("pickRandom",arguments.length,1);if(r instanceof n)r=r.valueOf();else if(!Array.isArray(r))throw new e.error.UnsupportedTypeError("pickRandom",e["typeof"](r));if(i.size(r).length>1)throw new Error("Only one dimensional vectors supported");return r[Math.floor(Math.random()*r.length)]}},o=function(e,t){return e+r()*(t-e)},s=function(e,t){return Math.floor(e+r()*(t-e))},u=function(e,r,t,n){var i,o,a=[];if(e=e.slice(0),e.length>1)for(o=0,i=e.shift();i>o;o++)a.push(u(e,r,t,n));else for(o=0,i=e.shift();i>o;o++)a.push(n(r,t));return a};return t}(o)}var n=t(7),i=t(167),o=t(14),a=o.isCollection,s={uniform:function(){return Math.random},normal:function(){return function(){for(var e,r,t=-1;0>t||t>1;)e=Math.random(),r=Math.random(),t=1/6*Math.pow(-2*Math.log(e),.5)*Math.cos(2*Math.PI*r)+.5;return t}}};return r}},function(e,r){"use strict";r.type=function(e){var r=typeof e;if("object"===r){if(null===e)return"null";if(e instanceof Boolean)return"boolean";if(e instanceof Number)return"number";if(e instanceof String)return"string";if(Array.isArray(e))return"array";if(e instanceof Date)return"date";if(e instanceof Function)return"function";if(e instanceof RegExp)return"regexp"}return r}},function(e,r,t){var n;!function(i){"use strict";function o(e){for(var r,t,n=1,i=e.length,o=e[0]+"";i>n;n++){for(r=e[n]+"",t=T-r.length;t--;)r="0"+r;o+=r}for(i=o.length;48===o.charCodeAt(--i););return o.slice(0,i+1||1)}function a(e,r,t,n){var i,o,a,s,u;for(o=1,a=e[0];a>=10;a/=10,o++);return a=r-o,0>a?(a+=T,i=0):(i=Math.ceil((a+1)/T),a%=T),o=N(10,T-a),u=e[i]%o|0,null==n?3>a?(0==a?u=u/100|0:1==a&&(u=u/10|0),s=4>t&&99999==u||t>3&&49999==u||5e4==u||0==u):s=(4>t&&u+1==o||t>3&&u+1==o/2)&&(e[i+1]/o/100|0)==N(10,a-2)-1||(u==o/2||0==u)&&0==(e[i+1]/o/100|0):4>a?(0==a?u=u/1e3|0:1==a?u=u/100|0:2==a&&(u=u/10|0),s=(n||4>t)&&9999==u||!n&&t>3&&4999==u):s=((n||4>t)&&u+1==o||!n&&t>3&&u+1==o/2)&&(e[i+1]/o/1e3|0)==N(10,a-3)-1,s}function s(e,r,t){var n=e.constructor;return null==r||((x=0>r||r>8)||0!==r&&(n.errors?parseInt:parseFloat)(r)!=r)&&!p(n,"rounding mode",r,t,0)?n.rounding:0|r}function u(e,r,t,n){var i=e.constructor;return!(x=(n||0)>r||r>=_+1)&&(0===r||(i.errors?parseInt:parseFloat)(r)==r)||p(i,"argument",r,t,0)}function c(e,r){var t,n,i,s,u,c,f,l=0,p=0,m=0,h=e.constructor,d=h.ONE,v=h.rounding,x=h.precision;if(!e.c||!e.c[0]||e.e>17)return new h(e.c?e.c[0]?e.s<0?0:1/0:d:e.s?e.s<0?0:e:0/0);for(null==r?(w=!1,u=x):u=r,f=new h(.03125);e.e>-2;)e=e.times(f),m+=5;for(n=Math.log(N(2,m))/Math.LN10*2+5|0,u+=n,t=s=c=new h(d),h.precision=u;;){if(s=g(s.times(e),u,1),t=t.times(++p),f=c.plus(q(s,t,u,1)),o(f.c).slice(0,u)===o(c.c).slice(0,u)){for(i=m;i--;)c=g(c.times(c),u,1);if(null!=r)return h.precision=x,c;if(!(3>l&&a(c.c,u-n,v,l)))return g(c,h.precision=x,v,w=!0);h.precision=u+=10,t=s=f=new h(d),p=0,l++}c=f}}function f(e,r,t,n){var i,a,s=e.constructor,u=(e=new s(e)).e;if(null==r?t=0:(g(e,++r,t),t=n?r:r+e.e-u),u=e.e,i=o(e.c),1==n||2==n&&(u>=r||u<=s.toExpNeg)){for(;i.length1&&(i=i.charAt(0)+"."+i.slice(1)),i+=(0>u?"e":"e+")+u}else{if(n=i.length,0>u){for(a=t-n;++u;i="0"+i);i="0."+i}else if(++u>n){for(a=t-u,u-=n;u--;i+="0");a>0&&(i+=".")}else a=t-n,n>u?i=i.slice(0,u)+"."+i.slice(u):a>0&&(i+=".");if(a>0)for(;a--;i+="0");}return e.s<0&&e.c[0]?"-"+i:i}function l(e){var r=e.length-1,t=r*T+1;if(r=e[r]){for(;r%10==0;r/=10,t--);for(r=e[0];r>=10;r/=10,t++);}return t}function p(e,r,t,n,i){if(e.errors){var o=new Error((n||["new Decimal","cmp","div","eq","gt","gte","lt","lte","minus","mod","plus","times","toFraction","pow","random","log","sqrt","toNearest","divToInt"][b?0>b?-b:b:0>1/b?1:0])+"() "+(["number type has more than 15 significant digits","LN10 out of digits"][r]||r+([x?" out of range":" not an integer"," not a boolean or binary digit"][i]||""))+": "+t);throw o.name="Decimal Error",x=b=0,o}}function m(e,r,t){var n=new e(e.ONE);for(w=!1;1&t&&(n=n.times(r)),t>>=1,t;)r=r.times(r);return w=!0,n}function h(e,r){var t,n,i,s,u,c,f,l,m,d,v,x=1,y=10,b=e,E=b.c,N=b.constructor,A=N.ONE,M=N.rounding,T=N.precision;if(b.s<0||!E||!E[0]||!b.e&&1==E[0]&&1==E.length)return new N(E&&!E[0]?-1/0:1!=b.s?0/0:E?0:b);if(null==r?(w=!1,f=T):f=r,N.precision=f+=y,t=o(E),n=t.charAt(0),!(Math.abs(s=b.e)<15e14))return b=new N(n+"."+t.slice(1)),f+2>U.length&&p(N,1,f+2,"ln"),b=h(b,f-y).plus(new N(U.slice(0,f+2)).times(s+"")),N.precision=T,null==r?g(b,T,M,w=!0):b;for(;7>n&&1!=n||1==n&&t.charAt(1)>3;)b=b.times(e),t=o(b.c),n=t.charAt(0),x++;for(s=b.e,n>1?(b=new N("0."+t),s++):b=new N(n+"."+t.slice(1)),d=b,l=u=b=q(b.minus(A),b.plus(A),f,1),v=g(b.times(b),f,1),i=3;;){if(u=g(u.times(v),f,1),m=l.plus(q(u,new N(i),f,1)),o(m.c).slice(0,f)===o(l.c).slice(0,f)){if(l=l.times(2),0!==s&&(f+2>U.length&&p(N,1,f+2,"ln"),l=l.plus(new N(U.slice(0,f+2)).times(s+""))),l=q(l,new N(x),f,1),null!=r)return N.precision=T,l;if(!a(l.c,f-y,M,c))return g(l,N.precision=T,M,w=!0);N.precision=f+=y,m=u=b=q(d.minus(A),d.plus(A),f,1),v=g(b.times(b),f,1),i=c=1}l=m,i+=2}}function g(e,r,t,n){var i,o,a,s,u,c,f,l,p=e.constructor;e:if(null!=r){if(!(f=e.c))return e;for(i=1,s=f[0];s>=10;s/=10,i++);if(o=r-i,0>o)o+=T,a=r,u=f[l=0],c=u/N(10,i-a-1)%10|0;else if(l=Math.ceil((o+1)/T),l>=f.length){if(!n)break e;for(;f.length<=l;f.push(0));u=c=0,i=1,o%=T,a=o-T+1}else{for(u=s=f[l],i=1;s>=10;s/=10,i++);o%=T,a=o-T+i,c=0>a?0:E(u/N(10,i-a-1)%10)}if(n=n||0>r||null!=f[l+1]||(0>a?u:u%N(10,i-a-1)),n=4>t?(c||n)&&(0==t||t==(e.s<0?3:2)):c>5||5==c&&(4==t||n||6==t&&(o>0?a>0?u/N(10,i-a):0:f[l-1])%10&1||t==(e.s<0?8:7)),1>r||!f[0])return f.length=0,n?(r-=e.e+1,f[0]=N(10,r%T),e.e=-r||0):f[0]=e.e=0,e;if(0==o?(f.length=l,s=1,l--):(f.length=l+1,s=N(10,T-o),f[l]=a>0?(u/N(10,i-a)%N(10,a)|0)*s:0),n)for(;;){if(0==l){for(o=1,a=f[0];a>=10;a/=10,o++);for(a=f[0]+=s,s=1;a>=10;a/=10,s++);o!=s&&(e.e++,f[0]==M&&(f[0]=1));break}if(f[l]+=s,f[l]!=M)break;f[l--]=0,s=1}for(o=f.length;0===f[--o];f.pop());}return w&&(e.e>p.maxE?e.c=e.e=null:e.ea,!i||!o)return u==c?0:!i^t?1:-1;if(u!=c)return u>c^t?1:-1;for(a=-1,s=(u=i.length)<(c=o.length)?u:c;++ao[a]^t?1:-1;return u==c?0:u>c^t?1:-1},O.decimalPlaces=O.dp=function(){var e,r,t=null;if(e=this.c){if(t=((r=e.length-1)-E(this.e/T))*T,r=e[r])for(;r%10==0;r/=10,t--);0>t&&(t=0)}return t},O.dividedBy=O.div=function(e,r){return b=2,q(this,new this.constructor(e,r))},O.dividedToIntegerBy=O.divToInt=function(e,r){var t=this,n=t.constructor;return b=18,g(q(t,new n(e,r),0,1,1),n.precision,n.rounding)},O.equals=O.eq=function(e,r){return b=3,0===this.cmp(e,r)},O.exponential=O.exp=function(){return c(this)},O.floor=function(){return g(new this.constructor(this),this.e+1,3)},O.greaterThan=O.gt=function(e,r){return b=4,this.cmp(e,r)>0},O.greaterThanOrEqualTo=O.gte=function(e,r){return b=5,r=this.cmp(e,r),1==r||0===r},O.isFinite=function(){return!!this.c},O.isInteger=O.isInt=function(){return!!this.c&&E(this.e/T)>this.c.length-2},O.isNaN=function(){return!this.s},O.isNegative=O.isNeg=function(){return this.s<0},O.isZero=function(){return!!this.c&&0==this.c[0]},O.lessThan=O.lt=function(e,r){return b=6,this.cmp(e,r)<0},O.lessThanOrEqualTo=O.lte=function(e,r){return b=7,r=this.cmp(e,r),-1==r||0===r},O.logarithm=O.log=function(e,r){var t,n,i,s,u,c,f,l,m,d=this,v=d.constructor,x=v.precision,y=v.rounding,E=5;if(null==e)e=new v(10),t=!0;else{if(b=15,e=new v(e,r),n=e.c,e.s<0||!n||!n[0]||!e.e&&1==n[0]&&1==n.length)return new v(0/0);t=e.eq(10)}if(n=d.c,d.s<0||!n||!n[0]||!d.e&&1==n[0]&&1==n.length)return new v(n&&!n[0]?-1/0:1!=d.s?0/0:n?0:1/0);if(u=t&&(s=n[0],n.length>1||1!=s&&10!=s&&100!=s&&1e3!=s&&1e4!=s&&1e5!=s&&1e6!=s),w=!1,f=x+E,l=f+10,c=h(d,f),t?(l>U.length&&p(v,1,l,"log"),i=new v(U.slice(0,l))):i=h(e,f),m=q(c,i,f,1),a(m.c,s=x,y))do if(f+=10,c=h(d,f),t?(l=f+10,l>U.length&&p(v,1,l,"log"),i=new v(U.slice(0,l))):i=h(e,f),m=q(c,i,f,1),!u){+o(m.c).slice(s+1,s+15)+1==1e14&&(m=g(m,x+1,0));break}while(a(m.c,s+=10,y));return w=!0,g(m,x,y)},O.minus=function(e,r){var t,n,i,o,a=this,s=a.constructor,u=a.s;if(b=8,e=new s(e,r),r=e.s,!u||!r)return new s(0/0);if(u!=r)return e.s=-r,a.plus(e);var c=a.c,f=e.c,l=E(e.e/T),p=E(a.e/T),m=s.precision,h=s.rounding;if(!p||!l){if(!c||!f)return c?(e.s=-r,e):new s(f?a:0/0);if(!c[0]||!f[0])return a=f[0]?(e.s=-r,e):new s(c[0]?a:3==h?-0:0),w?g(a,m,h):a}if(c=c.slice(),n=c.length,u=p-l){for((o=0>u)?(u=-u,t=c,n=f.length):(l=p,t=f),(p=Math.ceil(m/T))>n&&(n=p),u>(n+=2)&&(u=n,t.length=1),t.reverse(),r=u;r--;t.push(0));t.reverse()}else for((o=n<(i=f.length))&&(i=n),u=r=0;i>r;r++)if(c[r]!=f[r]){o=c[r]0)for(;r--;c[i++]=0);for(p=M-1,r=f.length;r>u;){if(c[--r]=10;r/=10,u++);return e.e=u+l*T-1,w?g(e,m,h):e},O.modulo=O.mod=function(e,r){var t,n,i=this,o=i.constructor,a=o.modulo;return b=9,e=new o(e,r),r=e.s,t=!i.c||!r||e.c&&!e.c[0],t||!e.c||i.c&&!i.c[0]?t?new o(0/0):g(new o(i),o.precision,o.rounding):(w=!1,9==a?(e.s=1,n=q(i,e,0,3,1),e.s=r,n.s*=r):n=q(i,e,0,a,1),n=n.times(e),w=!0,i.minus(n))},O.naturalLogarithm=O.ln=function(){return h(this)},O.negated=O.neg=function(){var e=new this.constructor(this);return e.s=-e.s||null,g(e)},O.plus=function(e,r){var t,n=this,i=n.constructor,o=n.s;if(b=10,e=new i(e,r),r=e.s,!o||!r)return new i(0/0);if(o!=r)return e.s=-r,n.minus(e);var a=n.c,s=e.c,u=E(e.e/T),c=E(n.e/T),f=i.precision,l=i.rounding;if(!c||!u){if(!a||!s)return new i(o/0);if(!a[0]||!s[0])return n=s[0]?e:new i(a[0]?n:0*o),w?g(n,f,l):n}if(a=a.slice(),o=c-u){for(0>o?(o=-o,t=a,r=s.length):(u=c,t=s,r=a.length),(c=Math.ceil(f/T))>r&&(r=c),o>++r&&(o=r,t.length=1),t.reverse();o--;t.push(0));t.reverse()}for(a.length-s.length<0&&(t=s,s=a,a=t),o=s.length,r=0,c=M;o;a[o]%=c)r=(a[--o]=a[o]+s[o]+r)/c|0;for(r&&(a.unshift(r),++u),o=a.length;0==a[--o];a.pop());for(e.c=a,o=1,r=a[0];r>=10;r/=10,o++);return e.e=o+u*T-1,w?g(e,f,l):e},O.precision=O.sd=function(e){var r=null,t=this;return e!=r&&e!==!!e&&1!==e&&0!==e&&p(t.constructor,"argument",e,"precision",1),t.c&&(r=l(t.c),e&&t.e+1>r&&(r=t.e+1)),r},O.round=function(){var e=this,r=e.constructor;return g(new r(e),e.e+1,r.rounding)},O.squareRoot=O.sqrt=function(){var e,r,t,n,i,a,s=this,u=s.c,c=s.s,f=s.e,l=s.constructor,p=new l(.5);if(1!==c||!u||!u[0])return new l(!c||0>c&&(!u||u[0])?0/0:u?s:1/0);for(w=!1,c=Math.sqrt(+s),0==c||c==1/0?(r=o(u),(r.length+f)%2==0&&(r+="0"),c=Math.sqrt(r),f=E((f+1)/2)-(0>f||f%2),c==1/0?r="1e"+f:(r=c.toExponential(),r=r.slice(0,r.indexOf("e")+1)+f),n=new l(r)):n=new l(c.toString()),t=(f=l.precision)+3;;)if(a=n,n=p.times(a.plus(q(s,a,t+2,1))),o(a.c).slice(0,t)===(r=o(n.c)).slice(0,t)){if(r=r.slice(t-3,t+1),"9999"!=r&&(i||"4999"!=r)){(!+r||!+r.slice(1)&&"5"==r.charAt(0))&&(g(n,f+1,1),e=!n.times(n).eq(s));break}if(!i&&(g(a,f+1,0),a.times(a).eq(s))){n=a;break}t+=4,i=1}return w=!0,g(n,f,l.rounding,e)},O.times=function(e,r){var t,n,i=this,o=i.constructor,a=i.c,s=(b=11,e=new o(e,r),e.c),u=E(i.e/T),c=E(e.e/T),f=i.s;if(r=e.s,e.s=f==r?1:-1,!((u||a&&a[0])&&(c||s&&s[0])))return new o(!f||!r||a&&!a[0]&&!s||s&&!s[0]&&!a?0/0:a&&s?0*e.s:e.s/0);for(n=u+c,f=a.length,r=s.length,r>f&&(t=a,a=s,s=t,c=f,f=r,r=c),c=f+r,t=[];c--;t.push(0));for(u=r-1;u>-1;u--){for(r=0,c=f+u;c>u;)r=t[c]+s[u]*a[c-u-1]+r,t[c--]=r%M|0,r=r/M|0;t[c]=(t[c]+r)%M|0}for(r?++n:t[0]||t.shift(),c=t.length;!t[--c];t.pop());for(e.c=t,f=1,r=t[0];r>=10;r/=10,f++);return e.e=f+n*T-1,w?g(e,o.precision,o.rounding):e},O.toDecimalPlaces=O.toDP=function(e,r){var t=this;return t=new t.constructor(t),null!=e&&u(t,e,"toDP")?g(t,(0|e)+t.e+1,s(t,r,"toDP")):t},O.toExponential=function(e,r){var t=this;return t.c?f(t,null!=e&&u(t,e,"toExponential")?0|e:null,null!=e&&s(t,r,"toExponential"),1):t.toString()},O.toFixed=function(e,r){var t,n=this,i=n.constructor,o=i.toExpNeg,a=i.toExpPos;return null!=e&&(e=u(n,e,t="toFixed")?n.e+(0|e):null,r=s(n,r,t)),i.toExpNeg=-(i.toExpPos=1/0),null!=e&&n.c?(t=f(n,e,r),n.s<0&&n.c&&(n.c[0]?t.indexOf("-")<0&&(t="-"+t):t=t.replace("-",""))):t=n.toString(),i.toExpNeg=o,i.toExpPos=a,t},O.toFormat=function(e,r){var t=this;if(!t.c)return t.toString();var n,i=t.s<0,o=t.constructor.format,a=o.groupSeparator,s=+o.groupSize,u=+o.secondaryGroupSize,c=t.toFixed(e,r).split("."),f=c[0],l=c[1],p=i?f.slice(1):f,m=p.length;if(u&&(n=s,s=u,m-=u=n),s>0&&m>0){for(n=m%s||s,f=p.substr(0,n);m>n;n+=s)f+=a+p.substr(n,s);u>0&&(f+=a+p.slice(n)),i&&(f="-"+f)}return l?f+o.decimalSeparator+((u=+o.fractionGroupSize)?l.replace(new RegExp("\\d{"+u+"}\\B","g"),"$&"+o.fractionGroupSeparator):l):f},O.toFraction=function(e){var r,t,n,i,a,s,u,c,f=this,m=f.constructor,h=r=new m(m.ONE),g=s=new m(0),d=f.c,v=new m(g);if(!d)return f.toString();for(n=v.e=l(d)-f.e-1,v.c[0]=N(10,(u=n%T)<0?T+u:u),(null==e||(!(b=12,a=new m(e)).s||(x=a.cmp(h)<0||!a.c)||m.errors&&E(a.e/T)0)&&(e=n>0?v:h),w=!1,a=new m(o(d)),u=m.precision,m.precision=n=d.length*T*2;c=q(a,v,0,1,1),t=r.plus(c.times(g)),1!=t.cmp(e);)r=g,g=t,h=s.plus(c.times(t=h)),s=t,v=a.minus(c.times(t=v)),a=t;return t=q(e.minus(r),g,0,1,1),s=s.plus(t.times(h)),r=r.plus(t.times(g)),s.s=h.s=f.s,i=q(h,g,n,1).minus(f).abs().cmp(q(s,r,n,1).minus(f).abs())<1?[h+"",g+""]:[s+"",r+""],w=!0,m.precision=u,i},O.toNearest=function(e,r){var t=this,n=t.constructor;return t=new n(t),null==e?(e=new n(n.ONE),r=n.rounding):(b=17,e=new n(e),r=s(t,r,"toNearest")),e.c?t.c&&(e.c[0]?(w=!1,t=q(t,e,0,4>r?[4,5,7,8][r]:r,1).times(e),w=!0,g(t)):t.c=[t.e=0]):t.s&&(e.s&&(e.s=t.s),t=e),t},O.toNumber=function(){var e=this;return+e||(e.s?0*e.s:0/0)},O.toPower=O.pow=function(e,r){var t,n,i,s,u=this,f=u.constructor,l=u.s,p=(b=13,+(e=new f(e,r))),d=0>p?-p:p,v=f.precision,x=f.rounding;if(!u.c||!e.c||(i=!u.c[0])||!e.c[0])return new f(N(i?0*l:+u,p));if(u=new f(u),t=u.c.length,!u.e&&u.c[0]==u.s&&1==t)return u;if(r=e.c.length-1,e.e||e.c[0]!=e.s||r)if(n=E(e.e/T),i=n>=r,!i&&0>l)s=new f(0/0);else{if(i&&B>t*T*d){if(s=m(f,u,d),e.s<0)return f.ONE.div(s)}else{if(l=0>l&&1&e.c[Math.max(n,r)]?-1:1,r=N(+u,p),n=0!=r&&isFinite(r)?new f(r+"").e:E(p*(Math.log("0."+o(u.c))/Math.LN10+u.e+1)),n>f.maxE+1||n0?l/0:0);w=!1,f.rounding=u.s=1,d=Math.min(12,(n+"").length),s=c(e.times(h(u,v+d)),v),s=g(s,v+5,1),a(s.c,v,x)&&(n=v+10,s=g(c(e.times(h(u,n+d)),n),n+5,1),+o(s.c).slice(v+1,v+15)+1==1e14&&(s=g(s,v+1,0))),s.s=l,w=!0,f.rounding=x -}s=g(s,v,x)}else s=g(u,v,x);return s},O.toPrecision=function(e,r){var t=this;return null!=e&&u(t,e,"toPrecision",1)&&t.c?f(t,0|--e,s(t,r,"toPrecision"),2):t.toString()},O.toSignificantDigits=O.toSD=function(e,r){var t=this,n=t.constructor;return t=new n(t),null!=e&&u(t,e,"toSD",1)?g(t,0|e,s(t,r,"toSD")):g(t,n.precision,n.rounding)},O.toString=function(e){var r,t,n,i=this,a=i.constructor,s=i.e;if(null===s)t=i.s?"Infinity":"NaN";else{if(e===r&&(s<=a.toExpNeg||s>=a.toExpPos))return f(i,null,a.rounding,1);if(t=o(i.c),0>s){for(;++s;t="0"+t);t="0."+t}else if(n=t.length,s>0)if(++s>n)for(s-=n;s--;t+="0");else n>s&&(t=t.slice(0,s)+"."+t.slice(s));else if(r=t.charAt(0),n>1)t=r+"."+t.slice(1);else if("0"==r)return r;if(null!=e)if((x=!(e>=2&&65>e))||e!=(0|e)&&a.errors)p(a,"base",e,"toString",0);else if(t=d(a,t,0|e,10,i.s),"0"==t)return t}return i.s<0?"-"+t:t},O.truncated=O.trunc=function(){return g(new this.constructor(this),this.e+1,1)},O.valueOf=O.toJSON=function(){return this.toString()},d=function(){function e(e,r,t){for(var n,i,o=[0],a=0,s=e.length;s>a;){for(i=o.length;i--;o[i]*=r);for(o[n=0]+=S.indexOf(e.charAt(a++));nt-1&&(null==o[n+1]&&(o[n+1]=0),o[n+1]+=o[n]/t|0,o[n]%=t)}return o.reverse()}return function(r,t,n,i,o){var a,s,u,c,f,l,p=t.indexOf("."),h=r.precision,g=r.rounding;for(37>i&&(t=t.toLowerCase()),p>=0&&(t=t.replace(".",""),l=new r(i),c=m(r,l,t.length-p),l.c=e(c.toFixed(),10,n),l.e=l.c.length),f=e(t,i,n),a=s=f.length;0==f[--s];f.pop());if(!f[0])return"0";if(0>p?a--:(c.c=f,c.e=a,c.s=o,c=q(c,l,h,g,0,n),f=c.c,u=c.r,a=c.e),p=f[h],s=n/2,u=u||null!=f[h+1],4>g?(null!=p||u)&&(0==g||g==(c.s<0?3:2)):p>s||p==s&&(4==g||u||6==g&&1&f[h-1]||g==(c.s<0?8:7)))for(f.length=h,--n;++f[--h]>n;)f[h]=0,h||(++a,f.unshift(1));else f.length=h;for(s=f.length;!f[--s];);for(p=0,t="";s>=p;t+=S.charAt(f[p++]));if(0>a){for(;++a;t="0"+t);t="0."+t}else if(p=t.length,++a>p)for(a-=p;a--;t+="0");else p>a&&(t=t.slice(0,a)+"."+t.slice(a));return t}}();var q=function(){function e(e,r,t){var n,i=0,o=e.length;for(e=e.slice();o--;)n=e[o]*r+i,e[o]=n%t|0,i=n/t|0;return i&&e.unshift(i),e}function r(e,r,t,n){var i,o;if(t!=n)o=t>n?1:-1;else for(i=o=0;t>i;i++)if(e[i]!=r[i]){o=e[i]>r[i]?1:-1;break}return o}function t(e,r,t,n){for(var i=0;t--;)e[t]-=i,i=e[t]1;e.shift());}return function(n,i,o,a,s,u){var c,f,l,p,m,h,d,v,x,y,w,b,N,A,S,O,C,_,B,U=n.constructor,q=n.s==i.s?1:-1,I=n.c,z=i.c;if(!(I&&I[0]&&z&&z[0]))return new U(n.s&&i.s&&(I?!z||I[0]!=z[0]:z)?I&&0==I[0]||!z?0*q:q/0:0/0);for(u?(p=1,f=n.e-i.e):(u=M,p=T,f=E(n.e/p)-E(i.e/p)),_=z.length,O=I.length,x=new U(q),y=x.c=[],l=0;z[l]==(I[l]||0);l++);if(z[l]>(I[l]||0)&&f--,null==o?(q=o=U.precision,a=U.rounding):q=s?o+(n.e-i.e)+1:o,0>q)y.push(1),m=!0;else{if(q=q/p+2|0,l=0,1==_){for(h=0,z=z[0],q++;(O>l||h)&&q--;l++)A=h*u+(I[l]||0),y[l]=A/z|0,h=A%z|0;m=h||O>l}else{for(h=u/(z[0]+1)|0,h>1&&(z=e(z,h,u),I=e(I,h,u),_=z.length,O=I.length),S=_,w=I.slice(0,_),b=w.length;_>b;w[b++]=0);B=z.slice(),B.unshift(0),C=z[0],z[1]>=u/2&&C++;do h=0,c=r(z,w,_,b),0>c?(N=w[0],_!=b&&(N=N*u+(w[1]||0)),h=N/C|0,h>1?(h>=u&&(h=u-1),d=e(z,h,u),v=d.length,b=w.length,c=r(d,w,v,b),1==c&&(h--,t(d,v>_?B:z,v,u))):(0==h&&(c=h=1),d=z.slice()),v=d.length,b>v&&d.unshift(0),t(w,d,b,u),-1==c&&(b=w.length,c=r(z,w,_,b),1>c&&(h++,t(w,b>_?B:z,b,u))),b=w.length):0===c&&(h++,w=[0]),y[l++]=h,c&&w[0]?w[b++]=I[S]||0:(w=[I[S]],b=1);while((S++=10;q/=10,l++);x.e=l+f*p-1,g(x,s?o+x.e+1:o,a,m)}return x}}();v=function(){function e(e){var r,t,n,i=this,o="config",a=i.errors?parseInt:parseFloat;return e==t||"object"!=typeof e&&!p(i,"object expected",e,o)?i:((n=e[r="precision"])!=t&&((x=1>n||n>_)||a(n)!=n?p(i,r,n,o,0):i[r]=0|n),(n=e[r="rounding"])!=t&&((x=0>n||n>8)||a(n)!=n?p(i,r,n,o,0):i[r]=0|n),(n=e[r="toExpNeg"])!=t&&((x=-C>n||n>0)||a(n)!=n?p(i,r,n,o,0):i[r]=E(n)),(n=e[r="toExpPos"])!=t&&((x=0>n||n>C)||a(n)!=n?p(i,r,n,o,0):i[r]=E(n)),(n=e[r="minE"])!=t&&((x=-C>n||n>0)||a(n)!=n?p(i,r,n,o,0):i[r]=E(n)),(n=e[r="maxE"])!=t&&((x=0>n||n>C)||a(n)!=n?p(i,r,n,o,0):i[r]=E(n)),(n=e[r="errors"])!=t&&(n===!!n||1===n||0===n?(x=b=0,i[r]=!!n):p(i,r,n,o,1)),(n=e[r="crypto"])!=t&&(n===!!n||1===n||0===n?i[r]=!(!n||!y||"object"!=typeof y):p(i,r,n,o,1)),(n=e[r="modulo"])!=t&&((x=0>n||n>9)||a(n)!=n?p(i,r,n,o,0):i[r]=0|n),(e=e[r="format"])!=t&&("object"==typeof e?i[r]=e:p(i,"format object expected",e,o)),i)}function r(e){return new this(e).exp()}function t(e){return new this(e).ln()}function n(e,r){return new this(e).log(r)}function i(e,r,t){var n,i,o=0;for("[object Array]"==A.call(r[0])&&(r=r[0]),n=new e(r[0]);++oi;)n=r[i],n>=429e7?r[i]=y.getRandomValues(new Uint32Array(1))[0]:o[i++]=n%1e7;else if(y&&y.randomBytes){for(r=y.randomBytes(t*=4);t>i;)n=r[i]+(r[i+1]<<8)+(r[i+2]<<16)+((127&r[i+3])<<24),n>=214e7?y.randomBytes(4).copy(r,i):(o.push(n%1e7),i+=4);i=t/4}else p(a,"crypto unavailable",y,"random");if(!i)for(;t>i;)o[i++]=1e7*Math.random()|0;for(t=o[--i],e%=T,t&&e&&(n=N(10,T-e),o[i]=(t/n|0)*n);0===o[i];i--)o.pop();if(0>i)o=[t=0];else{for(t=-1;0===o[0];)o.shift(),t-=T;for(i=1,n=o[0];n>=10;)n/=10,i++;T>i&&(t-=T-i)}return s.e=t,s.c=o,s}function f(e){return new this(e).sqrt()}function l(i){function u(e,r){var t=this;if(!(t instanceof u))return p(u,"Decimal called without new",e),new u(e,r);if(t.constructor=u,e instanceof u){if(null==r)return b=0,t.s=e.s,t.e=e.e,t.c=(e=e.c)?e.slice():e,t;if(10==r)return g(new u(e),u.precision,u.rounding);e+=""}return m(u,t,e,r)}return u.precision=20,u.rounding=4,u.modulo=1,u.toExpNeg=-7,u.toExpPos=21,u.minE=-C,u.maxE=C,u.errors=!0,u.crypto=!1,u.format={decimalSeparator:".",groupSeparator:",",groupSize:3,secondaryGroupSize:0,fractionGroupSeparator:" ",fractionGroupSize:0},u.prototype=O,u.ONE=new u(1),u.ROUND_UP=0,u.ROUND_DOWN=1,u.ROUND_CEIL=2,u.ROUND_FLOOR=3,u.ROUND_HALF_UP=4,u.ROUND_HALF_DOWN=5,u.ROUND_HALF_EVEN=6,u.ROUND_HALF_CEIL=7,u.ROUND_HALF_FLOOR=8,u.EUCLID=9,u.config=e,u.constructor=l,u.exp=r,u.ln=t,u.log=n,u.max=o,u.min=a,u.pow=s,u.sqrt=f,u.random=c,null!=i&&u.config(i),u}var m=function(){var e=/^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,r=String.prototype.trim||function(){return this.replace(/^\s+|\s+$/g,"")};return function(t,n,i,o){var a,s,u,c,f,l;if("string"!=typeof i&&(i=(c="number"==typeof i||"[object Number]"==A.call(i))&&0===i&&0>1/i?"-0":i+""),f=i,null==o&&e.test(i))n.s=45===i.charCodeAt(0)?(i=i.slice(1),-1):1;else{if(10==o)return g(new t(i),t.precision,t.rounding);if(i=r.call(i).replace(/^\+(?!-)/,""),n.s=45===i.charCodeAt(0)?(i=i.replace(/^-(?!-)/,""),-1):1,null!=o?o!=(0|o)&&t.errors||(x=!(o>=2&&65>o))?(p(t,"base",o,0,0),l=e.test(i)):(a="["+S.slice(0,o=0|o)+"]+",i=i.replace(/\.$/,"").replace(/^\./,"0."),(l=new RegExp("^"+a+"(?:\\."+a+")?$",37>o?"i":"").test(i))?(c&&(i.replace(/^0\.0*|\./,"").length>15&&p(t,0,f),c=!c),i=d(t,i,10,o,n.s)):"Infinity"!=i&&"NaN"!=i&&(p(t,"not a base "+o+" number",f),i="NaN")):l=e.test(i),!l)return n.c=n.e=null,"Infinity"!=i&&("NaN"!=i&&p(t,"not a number",f),n.s=null),b=0,n}for((s=i.indexOf("."))>-1&&(i=i.replace(".","")),(u=i.search(/e/i))>0?(0>s&&(s=u),s+=+i.slice(u+1),i=i.substring(0,u)):0>s&&(s=i.length),u=0;48===i.charCodeAt(u);u++);for(o=i.length;48===i.charCodeAt(--o););if(i=i.slice(u,o+1)){if(o=i.length,c&&o>15&&p(t,0,f),n.e=s=s-u-1,n.c=[],u=(s+1)%T,0>s&&(u+=T),o>u){for(u&&n.c.push(+i.slice(0,u)),o-=T;o>u;)n.c.push(+i.slice(u,u+=T));i=i.slice(u),u=T-i.length}else u-=o;for(;u--;i+="0");n.c.push(+i),w&&(n.e>t.maxE?n.c=n.e=null:n.et;t++){e=r[t];for(var i in e)e.hasOwnProperty(i)&&(y[i]=e[i])}}function i(e,r){return"undefined"!=typeof e[r]}function o(e){return function(r){return i(e,r)}}function a(e){return function(t){if("boolean"==typeof e[t])t=e[t]===!0?"\\"+t:"\\mathrm{"+t+"}";else if("string"==typeof e[t])t=e[t];else if("string"==typeof t){var n=t.indexOf("_");-1!==n&&(t=r.toSymbol(t.substring(0,n))+"_{"+r.toSymbol(t.substring(n+1))+"}")}return t}}var s=t(172),u=t(181),c=t(183),f=t(176),l={Alpha:"A",alpha:!0,Beta:"B",beta:!0,Gamma:!0,gamma:!0,Delta:!0,delta:!0,Epsilon:"E",epsilon:!0,varepsilon:!0,Zeta:"Z",zeta:!0,Eta:"H",eta:!0,Theta:!0,theta:!0,vartheta:!0,Iota:"I",iota:!0,Kappa:"K",kappa:!0,varkappa:!0,Lambda:!0,lambda:!0,Mu:"M",mu:!0,Nu:"N",nu:!0,Xi:!0,xi:!0,Omicron:"O",omicron:!0,Pi:!0,pi:!0,varpi:!0,Rho:"P",rho:!0,varrho:!0,Sigma:!0,sigma:!0,varsigma:!0,Tau:"T",tau:!0,Upsilon:!0,upsilon:!0,Phi:!0,phi:!0,varphi:!0,Chi:"X",chi:!0,Psi:!0,psi:!0,Omega:!0,omega:!0},p={dots:!0,ldots:!0,cdots:!0,vdots:!0,ddots:!0,idots:!0},m={"true":"\\mathrm{True}","false":"\\mathrm{False}"},h={inf:"\\infty",Inf:"\\infty",infinity:"\\infty",Infinity:"\\infty",oo:"\\infty",lim:!0,undefined:"\\mathbf{?}"},g={acos:"\\cos^{-1}",arccos:"\\cos^{-1}",cos:!0,csc:!0,csch:!1,exp:!0,ker:!0,limsup:!0,min:!0,sinh:!0,asin:"\\sin^{-1}",arcsin:"\\sin^{-1}",cosh:!0,deg:!0,gcd:!0,lg:!0,ln:!0,Pr:!0,sup:!0,atan:"\\tan^{-1}",atan2:"\\tan2^{-1}",arctan:"\\tan^{-1}",cot:!0,det:!0,hom:!0,log:!0,log10:"\\log_{10}",sec:!0,sech:!1,tan:!0,arg:!0,coth:!0,dim:!0,inf:!0,max:!0,sin:!0,tanh:!0,fix:!1,lcm:!1,sign:!1,xgcd:!1,unaryMinus:!1,unaryPlus:!1,complex:!1,conj:!1,im:!1,re:!1,diag:!1,resize:!1,size:!1,squeeze:!1,subset:!1,index:!1,ones:!1,zeros:!1,range:!1,random:!1,mean:"\\mu",median:!1,prod:!1,std:"\\sigma","var":"\\sigma^2"},d={sqrt:!0,inv:!0,"int":"\\int",Int:"\\int",integrate:"\\int",eigenvalues:"\\lambda",liminf:!0,lim:!0,exp:"e^",sum:!0,eye:"\\mathbf{I}"},v={"<=":"\\leq",">=":"\\geq","!=":"\\neq","in":!0,"*":"\\cdot","/":"\\frac",mod:"\\bmod",to:"\\rightarrow"},x={deg:"^{\\circ}"},y={};n(g,d,l,p,m,h),r.isSymbol=o(y),r.toSymbol=a(y),r.isFunction=o(g),r.toFunction=a(g),r.isCurlyFunction=o(d),r.toCurlyFunction=a(d),r.isOperator=o(v),r.toOperator=a(v),r.isUnit=o(x),r.toUnit=function(){var e=a(x);return function(t,n){return r.isUnit(t)?e(t):(n?"":"\\,")+"\\mathrm{"+t+"}"}}(),r.addBraces=function(e,r,t){if(null===r)return e;var n=["",""];switch(t=t||"normal","undefined"==typeof r||r===!1?n=["{","}"]:r===!0?(n=["(",")"],t="lr"):n=Array.isArray(r)&&2===r.length?r:[r,r],t){case"normal":case!1:return n[0]+e+n[1];case"lr":return"\\left"+n[0]+"{"+e+"}\\right"+n[1];case"be":return"\\begin{"+n[0]+"}"+e+"\\end{"+n[1]+"}"}return n[0]+e+n[1]},r.toArgs=function(e){var t=e.name,n=e.args,i=r.toSymbol(e.name),o=null,a=null,l=!1,p=!1,m="",h="",g=null;switch(t){case"add":g="+";break;case"subtract":g="-";break;case"larger":g=">";break;case"largerEq":g=">=";break;case"smaller":g="<";break;case"smallerEq":g="<=";break;case"unequal":g="!=";break;case"equal":g="=";break;case"mod":g="mod";break;case"multiply":g="*";break;case"pow":g="^";break;case"concat":g="||";break;case"factorial":g="!";break;case"permutations":if(1!==n.length){var d=n[0].toTex(),v=n[1].toTex();return"\\frac{"+d+"!}{\\left("+d+" - "+v+"\\right)!}"}if(!(n[0]instanceof c||n[0]instanceof f))return"{\\left("+n[0].toTex()+"\\right)!}";g="!";break;case"combinations":g="\\choose";break;case"abs":a="|",l="lr";break;case"norm":if(a="\\|",l="lr",2===n.length){var x=n[1].toTex();"\\text{inf}"===x?x="\\infty":"\\text{-inf}"===x?x="{- \\infty}":"\\text{fro}"===x&&(x="F"),h="_{"+x+"}",n=[n[0]]}break;case"ceil":a=["\\lceil","\\rceil"],l="lr";break;case"floor":a=["\\lfloor","\\rfloor"],l="lr";break;case"round":a=["\\lfloor","\\rceil"],l="lr",2===n.length&&(h="_"+r.addBraces(n[1].toTex()),n=[n[0]]);break;case"inv":h="^{-1}";break;case"transpose":h="^{T}",a=!1;break;case"log":var y="e";2===n.length&&(y=n[1].toTex(),i="\\log_{"+y+"}",n=[n[0]]),"e"===y&&(i="\\ln"),p=!0;break;case"square":h="^{2}";break;case"cube":h="^{3}";break;case"eye":p=!0,a=!1,i+="_";break;case"det":if(e.args[0]instanceof s)return e.args[0].toTex("vmatrix");a="vmatrix",l="be";break;default:p=!0}return null!==g?(a="+"===g||"-"===g,o=new u(g,t,n).toTex()):g=", ",null!==a||r.isCurlyFunction(t)||(a=!0),o=o||n.map(function(e){return"{"+e.toTex()+"}"}).join(g),m+(p?i:"")+r.addBraces(o,a,l)+h}}])}); +!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):"object"==typeof exports?exports.math=t():e.math=t()}(this,function(){return function(e){function t(n){if(r[n])return r[n].exports;var i=r[n]={exports:{},id:n,loaded:!1};return e[n].call(i.exports,i,i.exports,t),i.loaded=!0,i.exports}var r={};return t.m=e,t.c=r,t.p="",t(0)}([function(e,t,r){function n(e){var t=i.create();t.create=n;var o=t._config;return t["import"](r(2)),t.expression={},t.expression.node=r(15),t["import"](r(13)),t["import"](r(14)),t.expression.docs=r(16),t.type.Complex=r(3),t.type.Range=r(4),t.type.Index=r(5),t["import"](r(6)),t.type.Unit=r(7),t.type.Help=r(8),t.type.ResultSet=r(9),t["import"](r(10)),t["import"](r(11)),t["import"](r(17)),t["import"](r(18)),t["import"](r(19)),t["import"](r(20)),t["import"](r(164)),t["import"](r(165)),t["import"](r(31)),t["import"](r(32)),t["import"](r(33)),t["import"](r(34)),t["import"](r(35)),t["import"](r(36)),t["import"](r(37)),t["import"](r(38)),t["import"](r(39)),t["import"](r(40)),t["import"](r(41)),t["import"](r(42)),t["import"](r(43)),t["import"](r(44)),t["import"](r(45)),t["import"](r(46)),t["import"](r(47)),t["import"](r(48)),t["import"](r(49)),t["import"](r(50)),t["import"](r(51)),t["import"](r(52)),t["import"](r(53)),t["import"](r(54)),t["import"](r(55)),t["import"](r(56)),t["import"](r(57)),t["import"](r(58)),t["import"](r(59)),t["import"](r(60)),t["import"](r(61)),t["import"](r(62)),t["import"](r(63)),t["import"](r(64)),t["import"](r(65)),t["import"](r(66)),t["import"](r(67)),t["import"](r(68)),t["import"](r(69)),t["import"](r(70)),t["import"](r(71)),t["import"](r(72)),t["import"](r(73)),t["import"](r(74)),t["import"](r(75)),t["import"](r(76)),t["import"](r(77)),t["import"](r(78)),t["import"](r(79)),t["import"](r(80)),t["import"](r(81)),t["import"](r(82)),t["import"](r(83)),t["import"](r(84)),t["import"](r(85)),t["import"](r(86)),t["import"](r(87)),t["import"](r(88)),t["import"](r(89)),t["import"](r(90)),t["import"](r(91)),t["import"](r(92)),t["import"](r(93)),t["import"](r(94)),t["import"](r(95)),t["import"](r(96)),r(97)(t,o),r(98)(t,o),r(99)(t,o),t["import"](r(100)),t["import"](r(101)),r(102)(t,o),t["import"](r(103)),t["import"](r(104)),r(105)(t,o),t["import"](r(106)),t["import"](r(107)),t["import"](r(108)),t["import"](r(109)),t["import"](r(110)),t["import"](r(111)),t["import"](r(112)),t["import"](r(113)),t["import"](r(114)),t["import"](r(115)),t["import"](r(116)),t["import"](r(117)),t["import"](r(118)),t["import"](r(119)),t["import"](r(120)),t["import"](r(121)),t["import"](r(122)),t["import"](r(123)),t["import"](r(124)),t["import"](r(125)),t["import"](r(126)),t["import"](r(127)),t["import"](r(128)),t["import"](r(129)),t["import"](r(130)),t["import"](r(131)),t["import"](r(132)),t["import"](r(133)),t["import"](r(134)),t["import"](r(135)),t["import"](r(136)),t["import"](r(137)),t["import"](r(138)),t["import"](r(139)),t["import"](r(140)),t["import"](r(141)),t["import"](r(142)),t["import"](r(143)),t["import"](r(144)),t["import"](r(145)),t["import"](r(146)),t["import"](r(147)),t["import"](r(148)),t["import"](r(149)),t["import"](r(150)),t["import"](r(151)),t["import"](r(152)),t["import"](r(153)),t["import"](r(154)),t["import"](r(155)),t["import"](r(156)),t["import"](r(157)),t["import"](r(158)),t["import"](r(159)),t["import"](r(160)),t["import"](r(161)),t["import"](r(162)),t["import"](r(163)),t.expression.transform={concat:r(21)(t,o),filter:r(22)(t,o),forEach:r(23)(t,o),index:r(30)(t,o),map:r(24)(t,o),max:r(25)(t,o),mean:r(26)(t,o),min:r(27)(t,o),range:r(28)(t,o),subset:r(29)(t,o)},t.type.Chain=r(12)(),t.type.Chain.createProxy(t),t.config(e),t}var i=r(1);e.exports=n()},function(e,t,r){var n=r(166).isFactory;t.create=function(){function e(r){if(!n(r))throw new Error("Factory object with properties `type`, `name`, and `factory` expected");var u,c=t.indexOf(r);return-1===c?(u=r.math?r.factory(o.type,s,e,a,o):r.factory(o.type,s,e,a),t.push(r),i.push(u)):u=i[c],u}if("function"!=typeof Object.create)throw new Error("ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.");var t=[],i=[],o={type:{}},a=r(167).create(o),s={matrix:"matrix",number:"number",precision:64,epsilon:1e-14};return o["import"]=e(r(168)),r(169)(o,s),o._config=s,o.error=r(170),o}},function(e,t,r){"use strict";function n(e,t,n,u){function c(e,t,r){var n,i,o,a;if(0>=t){if(Array.isArray(e[0])){for(a=f(e),i=[],n=0;nr;r++){var a=[];for(t=0;n>t;t++)a.push(e[t][r]);o.push(a)}return o}var l=n(r(75)),p={};return p.argsToArray=function(t){if(0===t.length)return[];if(1==t.length){var r=t[0];return r instanceof e.Matrix&&(r=r.valueOf()),Array.isArray(r)||(r=[r]),r}return i.array.argsToArray(t)},p.isCollection=function(t){return Array.isArray(t)||t instanceof e.Matrix},p.deepMap=function m(e,t,r){return e&&"function"==typeof e.map?e.map(function(e){return m(e,t,r)}):t(e)},p.deepMap2=function h(t,r,n){var i,o,a;if(Array.isArray(t))if(Array.isArray(r)){if(t.length!=r.length)throw new s(t.length,r.length);for(i=[],o=t.length,a=0;o>a;a++)i[a]=h(t[a],r[a],n)}else{if(r instanceof e.Matrix)return i=h(t,r.valueOf(),n),l(i);for(i=[],o=t.length,a=0;o>a;a++)i[a]=h(t[a],r,n)}else{if(t instanceof e.Matrix)return r instanceof e.Matrix?(i=h(t.valueOf(),r.valueOf(),n),l(i)):(i=h(t.valueOf(),r,n),l(i));if(Array.isArray(r))for(i=[],o=r.length,a=0;o>a;a++)i[a]=h(t,r[a],n);else{if(r instanceof e.Matrix)return i=h(t,r.valueOf(),n),l(i);i=n(t,r)}}return i},p.reduce=function(t,r,n){var i=Array.isArray(t)?o(t):t.size();if(0>r)throw new a(r);if(r>=i.length)throw new a(r,i.length);return t instanceof e.Matrix?l(c(t.valueOf(),r,n)):c(t,r,n)},p.deepForEach=function g(t,r){t instanceof e.Matrix&&(t=t.valueOf());for(var n=0,i=t.length;i>n;n++){var o=t[n];Array.isArray(o)?g(o,r):r(o)}},p}var i=r(171),o=r(172).size,a=r(173),s=r(174);t.name="collection",t.factory=n},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");switch(arguments.length){case 0:this.re=0,this.im=0;break;case 1:var r=arguments[0];if("object"==typeof r){if("re"in r&&"im"in r){var i=new n(r.re,r.im);this.re=i.re,this.im=i.im;break}if("r"in r&&"phi"in r){var i=n.fromPolar(r.r,r.phi);this.re=i.re,this.im=i.im;break}}throw new SyntaxError("Object with the re and im or r and phi properties expected.");case 2:if(!h(e)||!h(t))throw new TypeError("Two numbers expected in Complex constructor");this.re=e,this.im=t;break;default:throw new SyntaxError("One, two or three arguments expected in Complex constructor")}}function i(){for(;" "==y||" "==y;)s()}function o(e){return e>="0"&&"9">=e||"."==e}function a(e){return e>="0"&&"9">=e}function s(){x++,y=d.charAt(x)}function u(e){x=e,y=d.charAt(x)}function c(){var e,t="";if(e=x,"+"==y?s():"-"==y&&(t+=y,s()),!o(y))return u(e),null;if("."==y){if(t+=y,s(),!a(y))return u(e),null}else{for(;a(y);)t+=y,s();"."==y&&(t+=y,s())}for(;a(y);)t+=y,s();if("E"==y||"e"==y){if(t+=y,s(),("+"==y||"-"==y)&&(t+=y,s()),!a(y))return u(e),null;for(;a(y);)t+=y,s()}return t}function f(){var e=d.charAt(x+1);if("I"==y||"i"==y)return s(),"1";if(!("+"!=y&&"-"!=y||"I"!=e&&"i"!=e)){var t="+"==y?"1":"-1";return s(),s(),t}return null}var l=r(171),p=r(7),m=l.number,h=l.number.isNumber,g=p.isUnit,v=l.string.isString;n.isComplex=function(e){return e instanceof n};var d,x,y;n.parse=function(e){if(d=e,x=-1,y="",!v(d))return null;s(),i();var t=c();if(t){if("I"==y||"i"==y)return s(),i(),y?null:new n(0,Number(t));i();var r=y;if("+"!=r&&"-"!=r)return i(),y?null:new n(Number(t),0);s(),i();var o=c();if(o){if("I"!=y&&"i"!=y)return null;s()}else if(o=f(),!o)return null;return"-"==r&&(o="-"==o[0]?"+"+o.substring(1):"-"+o),s(),i(),y?null:new n(Number(t),Number(o))}return(t=f())?(i(),y?null:new n(0,Number(t))):null},n.fromPolar=function(e){switch(arguments.length){case 1:var t=arguments[0];if("object"==typeof t)return n.fromPolar(t.r,t.phi);throw new TypeError("Input has to be an object with r and phi keys.");case 2:var r=arguments[0],i=arguments[1];if(h(r)){if(g(i)&&i.hasBase(p.BASE_UNITS.ANGLE)&&(i=i.toNumber("rad")),h(i))return new n(r*Math.cos(i),r*Math.sin(i));throw new TypeError("Phi is not a number nor an angle unit.")}throw new TypeError("Radius r is not a number.");default:throw new SyntaxError("Wrong number of arguments in function fromPolar")}},n.prototype.toPolar=function(){return{r:Math.sqrt(this.re*this.re+this.im*this.im),phi:Math.atan2(this.im,this.re)}},n.prototype.clone=function(){return new n(this.re,this.im)},n.prototype.equals=function(e){return this.re===e.re&&this.im===e.im},n.prototype.format=function(e){var t="",r=this.im,n=this.re,i=m.format(this.re,e),o=m.format(this.im,e),a=h(e)?e:e?e.precision:null;if(null!==a){var s=Math.pow(10,-a);Math.abs(n/r)0?1==r?i+" + i":i+" + "+o+"i":-1==r?i+" - i":i+" - "+o.substring(1)+"i"},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},n.fromJSON=function(e){return new n(e)},n.prototype.valueOf=n.prototype.toString,e.exports=n},function(e,t,r){"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(null!=e&&!o.isNumber(e))throw new TypeError("Parameter start must be a number");if(null!=t&&!o.isNumber(t))throw new TypeError("Parameter end must be a number");if(null!=r&&!o.isNumber(r))throw new TypeError("Parameter step must be a number");this.start=null!=e?parseFloat(e):0,this.end=null!=t?parseFloat(t):0,this.step=null!=r?parseFloat(r):1}{var i=r(171),o=i.number,a=i.string;i.array}n.parse=function(e){if(!a.isString(e))return null;var t=e.split(":"),r=t.map(function(e){return parseFloat(e)}),i=r.some(function(e){return isNaN(e)});if(i)return null;switch(r.length){case 2:return new n(r[0],r[1]);case 3:return new n(r[0],r[2],r[1]);default:return null}},n.prototype.clone=function(){return new n(this.start,this.end,this.step)},n.isRange=function(e){return e instanceof n},n.prototype.size=function(){var e=0,t=this.start,r=this.step,n=this.end,i=n-t;return o.sign(r)==o.sign(i)?e=Math.ceil(i/r):0==i&&(e=0),isNaN(e)&&(e=0),[e]},n.prototype.min=function(){var e=this.size()[0];return e>0?this.step>0?this.start:this.start+(e-1)*this.step:void 0},n.prototype.max=function(){var e=this.size()[0];return e>0?this.step>0?this.start+(e-1)*this.step:this.start:void 0},n.prototype.forEach=function(e){var t=this.start,r=this.step,n=this.end,i=0;if(r>0)for(;n>t;)e(t,i,this),t+=r,i++;else if(0>r)for(;t>n;)e(t,i,this),t+=r,i++},n.prototype.map=function(e){var t=[];return this.forEach(function(r,n,i){t[n]=e(r,n,i)}),t},n.prototype.toArray=function(){var e=[];return this.forEach(function(t,r){e[r]=t}),e},n.prototype.valueOf=function(){return this.toArray()},n.prototype.format=function(e){var t=o.format(this.start,e);return 1!=this.step&&(t+=":"+o.format(this.step,e)),t+=":"+o.format(this.end,e)},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Range",start:this.start,end:this.end,step:this.step}},n.fromJSON=function(e){return new n(e.start,e.end,e.step)},e.exports=n},function(e,t,r){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this._ranges=[],this._isScalar=!0;for(var t=0,r=arguments.length;r>t;t++){var o=arguments[t];if(o instanceof a)this._ranges.push(o),this._isScalar=!1;else if(f(o))this._ranges.push(i(o)),this._isScalar=!1;else if(u(o))this._ranges.push(i([o,o+1]));else{var s=o.valueOf();if(!f(s))throw new TypeError("Ranges must be an Array, Number, or Range");this._ranges.push(i(s)),this._isScalar=!1}}}function i(e){for(var t=e.length,r=0;t>r;r++)if(!u(e[r])||!c(e[r]))throw new TypeError("Index parameters must be integer numbers");switch(e.length){case 2:return new a(e[0],e[1]);case 3:return new a(e[0],e[1],e[2]);default:throw new SyntaxError("Wrong number of arguments in Index (2 or 3 expected)")}}var o=r(171),a=r(4),s=o.number,u=s.isNumber,c=s.isInteger,f=Array.isArray;n.prototype.clone=function(){var e=new n;return e._ranges=o.object.clone(this._ranges),e._isScalar=this._isScalar,e},n.isIndex=function(e){return e instanceof n},n.create=function(e){var t=new n;return n.apply(t,e),t},n.prototype.size=function(){for(var e=[],t=0,r=this._ranges.length;r>t;t++){var n=this._ranges[t];e[t]=n.size()[0]}return e},n.prototype.max=function(){for(var e=[],t=0,r=this._ranges.length;r>t;t++){var n=this._ranges[t];e[t]=n.max()}return e},n.prototype.min=function(){for(var e=[],t=0,r=this._ranges.length;r>t;t++){var n=this._ranges[t];e[t]=n.min()}return e},n.prototype.forEach=function(e){for(var t=0,r=this._ranges.length;r>t;t++)e(this._ranges[t],t,this)},n.prototype.range=function(e){return this._ranges[e]||null},n.prototype.isScalar=function(){return this._isScalar},n.prototype.toArray=function(){for(var e=[],t=0,r=this._ranges.length;r>t;t++){var n=this._ranges[t],i=[],o=n.start,a=n.end,s=n.step;if(s>0)for(;a>o;)i.push(o),o+=s;else if(0>s)for(;o>a;)i.push(o),o+=s;e.push(i)}return e},n.prototype.valueOf=n.prototype.toArray,n.prototype.toString=function(){for(var e=[],t=0,r=this._ranges.length;r>t;t++){var n=this._ranges[t],i=s.format(n.start);1!=n.step&&(i+=":"+s.format(n.step)),i+=":"+s.format(n.end),e.push(i)}return"["+e.join(", ")+"]"},n.prototype.toJSON=function(){return{mathjs:"Index",ranges:this._ranges}},n.fromJSON=function(e){return n.create(e.ranges)},e.exports=n},function(e,t,r){"use strict";function n(e,t,r,n){function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator")}return i.isMatrix=function(e){return e instanceof i},i.storage=function(e){if(!a(e))throw new TypeError("format must be a string value");var t=i._storage[e];if(!t)throw new SyntaxError("Unsupported matrix storage format: "+e);return t},i._storage={},i.prototype.storage=function(){throw new Error("Cannot invoke storage on a Matrix interface")},i.prototype.subset=function(e,t,r){throw new Error("Cannot invoke subset on a Matrix interface")},i.prototype.get=function(e){throw new Error("Cannot invoke get on a Matrix interface")},i.prototype.set=function(e,t,r){throw new Error("Cannot invoke set on a Matrix interface")},i.prototype.resize=function(e,t){throw new Error("Cannot invoke resize on a Matrix interface")},i.prototype.clone=function(){throw new Error("Cannot invoke clone on a Matrix interface")},i.prototype.size=function(){throw new Error("Cannot invoke size on a Matrix interface")},i.prototype.map=function(e,t){throw new Error("Cannot invoke map on a Matrix interface")},i.prototype.forEach=function(e){throw new Error("Cannot invoke forEach on a Matrix interface")},i.prototype.toArray=function(){throw new Error("Cannot invoke toArray on a Matrix interface")},i.prototype.valueOf=function(){throw new Error("Cannot invoke valueOf on a Matrix interface")},i.prototype.format=function(e){throw new Error("Cannot invoke format on a Matrix interface")},i.prototype.toString=function(){throw new Error("Cannot invoke toString on a Matrix interface")},i}var i=r(171),o=i.string,a=o.isString;t.name="Matrix",t.path="type",t.factory=n},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new Error("Constructor must be called with the new operator");if(void 0!=e&&!x(e))throw new TypeError("First parameter in Unit constructor must be a number");if(void 0!=t&&(!y(t)||""==t))throw new TypeError("Second parameter in Unit constructor must be a string");if(void 0!=t){var r=l(t);if(!r)throw new SyntaxError('Unknown unit "'+t+'"');this.unit=r.unit,this.prefix=r.prefix}else this.unit=M,this.prefix=b;this.value=void 0!=e?this._normalize(e):null,this.fixPrefix=!1}function i(){for(;" "==h||" "==h;)s()}function o(e){return e>="0"&&"9">=e||"."==e}function a(e){return e>="0"&&"9">=e}function s(){m++,h=p.charAt(m)}function u(e){m=e,h=p.charAt(m)}function c(){var e,t="";if(e=m,"+"==h?s():"-"==h&&(t+=h,s()),!o(h))return u(e),null;if("."==h){if(t+=h,s(),!a(h))return u(e),null}else{for(;a(h);)t+=h,s();"."==h&&(t+=h,s())}for(;a(h);)t+=h,s();if("E"==h||"e"==h){if(t+=h,s(),("+"==h||"-"==h)&&(t+=h,s()),!a(h))return u(e),null;for(;a(h);)t+=h,s()}return t}function f(){var e="";for(i();h&&" "!=h&&" "!=h;)e+=h,s();return e||null}function l(e){for(var t in A)if(A.hasOwnProperty(t)&&d.endsWith(e,t)){var r=A[t],n=e.length-t.length,i=e.substring(0,n),o=r.prefixes[i];if(void 0!==o)return{unit:r,prefix:o}}return null}var p,m,h,g=r(171),v=g.number,d=g.string,x=g.number.isNumber,y=g.string.isString;n.parse=function(e){if(p=e,m=-1,h="",!y(p))return null;s(),i();var t,r=c();if(r){if(t=f(),s(),i(),h)return null;if(r&&t)try{return new n(Number(r),t)}catch(o){}}else{if(t=f(),s(),i(),h)return null;if(t)try{return new n(null,t)}catch(o){}}return null},n.isUnit=function(e){return e instanceof n},n.prototype.clone=function(){var e=new n;for(var t in this)this.hasOwnProperty(t)&&(e[t]=this[t]);return e},n.prototype._normalize=function(e){return(e+this.unit.offset)*this.unit.value*this.prefix.value},n.prototype._denormalize=function(e,t){return void 0==t?e/this.unit.value/this.prefix.value-this.unit.offset:e/this.unit.value/t-this.unit.offset},n.isValuelessUnit=function(e){return null!=l(e)},n.prototype.hasBase=function(e){return this.unit.base===e},n.prototype.equalBase=function(e){return this.unit.base===e.unit.base},n.prototype.equals=function(e){return this.equalBase(e)&&this.value==e.value},n.prototype.to=function(e){var t,r=null==this.value?this._normalize(1):this.value;if(y(e)){if(t=new n(null,e),!this.equalBase(t))throw new Error("Units do not match");return t.value=r,t.fixPrefix=!0,t}if(e instanceof n){if(!this.equalBase(e))throw new Error("Units do not match");if(null!==e.value)throw new Error("Cannot convert to a unit with a value");return t=e.clone(),t.value=r,t.fixPrefix=!0,t}throw new Error("String or Unit expected as parameter")},n.prototype.toNumber=function(e){var t=this.to(e);return t._denormalize(t.value,t.prefix.value)},n.prototype.toString=function(){return this.format()},n.prototype.toJSON=function(){return{mathjs:"Unit",value:this._denormalize(this.value),unit:this.prefix.name+this.unit.name,fixPrefix:this.fixPrefix}},n.fromJSON=function(e){var t=new n(e.value,e.unit);return t.fixPrefix=e.fixPrefix||!1,t},n.prototype.valueOf=n.prototype.toString,n.prototype.format=function(e){var t,r;if(null===this.value||this.fixPrefix)t=this._denormalize(this.value),r=null!==this.value?v.format(t,e)+" ":"",r+=this.prefix.name+this.unit.name;else{var n=this._bestPrefix();t=this._denormalize(this.value,n.value),r=v.format(t,e)+" ",r+=n.name+this.unit.name}return r},n.prototype._bestPrefix=function(){var e=Math.abs(this.value/this.unit.value),t=b,r=Math.abs(Math.log(e/t.value)/Math.LN10-1.2),n=this.unit.prefixes;for(var i in n)if(n.hasOwnProperty(i)){var o=n[i];if(o.scientific){var a=Math.abs(Math.log(e/o.value)/Math.LN10-1.2);r>a&&(t=o,r=a)}}return t};var w={NONE:{"":{name:"",value:1,scientific:!0}},SHORT:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:10,scientific:!1},h:{name:"h",value:100,scientific:!1},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},d:{name:"d",value:.1,scientific:!1},c:{name:"c",value:.01,scientific:!1},m:{name:"m",value:.001,scientific:!0},u:{name:"u",value:1e-6,scientific:!0},n:{name:"n",value:1e-9,scientific:!0},p:{name:"p",value:1e-12,scientific:!0},f:{name:"f",value:1e-15,scientific:!0},a:{name:"a",value:1e-18,scientific:!0},z:{name:"z",value:1e-21,scientific:!0},y:{name:"y",value:1e-24,scientific:!0}},LONG:{"":{name:"",value:1,scientific:!0},deca:{name:"deca",value:10,scientific:!1},hecto:{name:"hecto",value:100,scientific:!1},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},deci:{name:"deci",value:.1,scientific:!1},centi:{name:"centi",value:.01,scientific:!1},milli:{name:"milli",value:.001,scientific:!0},micro:{name:"micro",value:1e-6,scientific:!0},nano:{name:"nano",value:1e-9,scientific:!0},pico:{name:"pico",value:1e-12,scientific:!0},femto:{name:"femto",value:1e-15,scientific:!0},atto:{name:"atto",value:1e-18,scientific:!0},zepto:{name:"zepto",value:1e-21,scientific:!0},yocto:{name:"yocto",value:1e-24,scientific:!0}},SQUARED:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:100,scientific:!1},h:{name:"h",value:1e4,scientific:!1},k:{name:"k",value:1e6,scientific:!0},M:{name:"M",value:1e12,scientific:!0},G:{name:"G",value:1e18,scientific:!0},T:{name:"T",value:1e24,scientific:!0},P:{name:"P",value:1e30,scientific:!0},E:{name:"E",value:1e36,scientific:!0},Z:{name:"Z",value:1e42,scientific:!0},Y:{name:"Y",value:1e48,scientific:!0},d:{name:"d",value:.01,scientific:!1},c:{name:"c",value:1e-4,scientific:!1},m:{name:"m",value:1e-6,scientific:!0},u:{name:"u",value:1e-12,scientific:!0},n:{name:"n",value:1e-18,scientific:!0},p:{name:"p",value:1e-24,scientific:!0},f:{name:"f",value:1e-30,scientific:!0},a:{name:"a",value:1e-36,scientific:!0},z:{name:"z",value:1e-42,scientific:!0},y:{name:"y",value:1e-42,scientific:!0}},CUBIC:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:1e3,scientific:!1},h:{name:"h",value:1e6,scientific:!1},k:{name:"k",value:1e9,scientific:!0},M:{name:"M",value:1e18,scientific:!0},G:{name:"G",value:1e27,scientific:!0},T:{name:"T",value:1e36,scientific:!0},P:{name:"P",value:1e45,scientific:!0},E:{name:"E",value:1e54,scientific:!0},Z:{name:"Z",value:1e63,scientific:!0},Y:{name:"Y",value:1e72,scientific:!0},d:{name:"d",value:.001,scientific:!1},c:{name:"c",value:1e-6,scientific:!1},m:{name:"m",value:1e-9,scientific:!0},u:{name:"u",value:1e-18,scientific:!0},n:{name:"n",value:1e-27,scientific:!0},p:{name:"p",value:1e-36,scientific:!0},f:{name:"f",value:1e-45,scientific:!0},a:{name:"a",value:1e-54,scientific:!0},z:{name:"z",value:1e-63,scientific:!0},y:{name:"y",value:1e-72,scientific:!0}},BINARY_SHORT:{"":{name:"",value:1,scientific:!0},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},Ki:{name:"Ki",value:1024,scientific:!0},Mi:{name:"Mi",value:Math.pow(1024,2),scientific:!0},Gi:{name:"Gi",value:Math.pow(1024,3),scientific:!0},Ti:{name:"Ti",value:Math.pow(1024,4),scientific:!0},Pi:{name:"Pi",value:Math.pow(1024,5),scientific:!0},Ei:{name:"Ei",value:Math.pow(1024,6),scientific:!0},Zi:{name:"Zi",value:Math.pow(1024,7),scientific:!0},Yi:{name:"Yi",value:Math.pow(1024,8),scientific:!0}},BINARY_LONG:{"":{name:"",value:1,scientific:!0},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},kibi:{name:"kibi",value:1024,scientific:!0},mebi:{name:"mebi",value:Math.pow(1024,2),scientific:!0},gibi:{name:"gibi",value:Math.pow(1024,3),scientific:!0},tebi:{name:"tebi",value:Math.pow(1024,4),scientific:!0},pebi:{name:"pebi",value:Math.pow(1024,5),scientific:!0},exi:{name:"exi",value:Math.pow(1024,6),scientific:!0},zebi:{name:"zebi",value:Math.pow(1024,7),scientific:!0},yobi:{name:"yobi",value:Math.pow(1024,8),scientific:!0}}},b={name:"",value:1,scientific:!0},N={NONE:{},LENGTH:{},MASS:{},TIME:{},CURRENT:{},TEMPERATURE:{},LUMINOUS_INTENSITY:{},AMOUNT_OF_SUBSTANCE:{},FORCE:{},SURFACE:{},VOLUME:{},ANGLE:{},BIT:{}},E={},M={name:"",base:E,value:1,offset:0},A={meter:{name:"meter",base:N.LENGTH,prefixes:w.LONG,value:1,offset:0},inch:{name:"inch",base:N.LENGTH,prefixes:w.NONE,value:.0254,offset:0},foot:{name:"foot",base:N.LENGTH,prefixes:w.NONE,value:.3048,offset:0},yard:{name:"yard",base:N.LENGTH,prefixes:w.NONE,value:.9144,offset:0},mile:{name:"mile",base:N.LENGTH,prefixes:w.NONE,value:1609.344,offset:0},link:{name:"link",base:N.LENGTH,prefixes:w.NONE,value:.201168,offset:0},rod:{name:"rod",base:N.LENGTH,prefixes:w.NONE,value:5.02921,offset:0},chain:{name:"chain",base:N.LENGTH,prefixes:w.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:N.LENGTH,prefixes:w.NONE,value:1e-10,offset:0},m:{name:"m",base:N.LENGTH,prefixes:w.SHORT,value:1,offset:0},"in":{name:"in",base:N.LENGTH,prefixes:w.NONE,value:.0254,offset:0},ft:{name:"ft",base:N.LENGTH,prefixes:w.NONE,value:.3048,offset:0},yd:{name:"yd",base:N.LENGTH,prefixes:w.NONE,value:.9144,offset:0},mi:{name:"mi",base:N.LENGTH,prefixes:w.NONE,value:1609.344,offset:0},li:{name:"li",base:N.LENGTH,prefixes:w.NONE,value:.201168,offset:0},rd:{name:"rd",base:N.LENGTH,prefixes:w.NONE,value:5.02921,offset:0},ch:{name:"ch",base:N.LENGTH,prefixes:w.NONE,value:20.1168,offset:0},mil:{name:"mil",base:N.LENGTH,prefixes:w.NONE,value:254e-7,offset:0},m2:{name:"m2",base:N.SURFACE,prefixes:w.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:N.SURFACE,prefixes:w.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:N.SURFACE,prefixes:w.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:N.SURFACE,prefixes:w.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:N.SURFACE,prefixes:w.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:N.SURFACE,prefixes:w.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:N.SURFACE,prefixes:w.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:N.SURFACE,prefixes:w.NONE,value:6.4516e-10,offset:0},m3:{name:"m3",base:N.VOLUME,prefixes:w.CUBIC,value:1,offset:0},L:{name:"L",base:N.VOLUME,prefixes:w.SHORT,value:.001,offset:0},l:{name:"l",base:N.VOLUME,prefixes:w.SHORT,value:.001,offset:0},litre:{name:"litre",base:N.VOLUME,prefixes:w.LONG,value:.001,offset:0},cuin:{name:"cuin",base:N.VOLUME,prefixes:w.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:N.VOLUME,prefixes:w.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:N.VOLUME,prefixes:w.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:N.VOLUME,prefixes:w.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:N.VOLUME,prefixes:w.NONE,value:15e-6,offset:0},drop:{name:"drop",base:N.VOLUME,prefixes:w.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:N.VOLUME,prefixes:w.NONE,value:5e-8,offset:0},minim:{name:"minim",base:N.VOLUME,prefixes:w.NONE,value:6.161152e-8,offset:0},fluiddram:{name:"fluiddram",base:N.VOLUME,prefixes:w.NONE,value:36966911e-13,offset:0},fluidounce:{name:"fluidounce",base:N.VOLUME,prefixes:w.NONE,value:2957353e-11,offset:0},gill:{name:"gill",base:N.VOLUME,prefixes:w.NONE,value:.0001182941,offset:0},cc:{name:"cc",base:N.VOLUME,prefixes:w.NONE,value:1e-6,offset:0},cup:{name:"cup",base:N.VOLUME,prefixes:w.NONE,value:.0002365882,offset:0},pint:{name:"pint",base:N.VOLUME,prefixes:w.NONE,value:.0004731765,offset:0},quart:{name:"quart",base:N.VOLUME,prefixes:w.NONE,value:.0009463529,offset:0},gallon:{name:"gallon",base:N.VOLUME,prefixes:w.NONE,value:.003785412,offset:0},beerbarrel:{name:"beerbarrel",base:N.VOLUME,prefixes:w.NONE,value:.1173478,offset:0},oilbarrel:{name:"oilbarrel",base:N.VOLUME,prefixes:w.NONE,value:.1589873,offset:0},hogshead:{name:"hogshead",base:N.VOLUME,prefixes:w.NONE,value:.238481,offset:0},fldr:{name:"fldr",base:N.VOLUME,prefixes:w.NONE,value:36966911e-13,offset:0},floz:{name:"floz",base:N.VOLUME,prefixes:w.NONE,value:2957353e-11,offset:0},gi:{name:"gi",base:N.VOLUME,prefixes:w.NONE,value:.0001182941,offset:0},cp:{name:"cp",base:N.VOLUME,prefixes:w.NONE,value:.0002365882,offset:0},pt:{name:"pt",base:N.VOLUME,prefixes:w.NONE,value:.0004731765,offset:0},qt:{name:"qt",base:N.VOLUME,prefixes:w.NONE,value:.0009463529,offset:0},gal:{name:"gal",base:N.VOLUME,prefixes:w.NONE,value:.003785412,offset:0},bbl:{name:"bbl",base:N.VOLUME,prefixes:w.NONE,value:.1173478,offset:0},obl:{name:"obl",base:N.VOLUME,prefixes:w.NONE,value:.1589873,offset:0},g:{name:"g",base:N.MASS,prefixes:w.SHORT,value:.001,offset:0},gram:{name:"gram",base:N.MASS,prefixes:w.LONG,value:.001,offset:0},ton:{name:"ton",base:N.MASS,prefixes:w.SHORT,value:907.18474,offset:0},tonne:{name:"tonne",base:N.MASS,prefixes:w.SHORT,value:1e3,offset:0},grain:{name:"grain",base:N.MASS,prefixes:w.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:N.MASS,prefixes:w.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:N.MASS,prefixes:w.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:N.MASS,prefixes:w.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:N.MASS,prefixes:w.NONE,value:45.359237,offset:0},stick:{name:"stick",base:N.MASS,prefixes:w.NONE,value:.115,offset:0},stone:{name:"stone",base:N.MASS,prefixes:w.NONE,value:6350,offset:0},gr:{name:"gr",base:N.MASS,prefixes:w.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:N.MASS,prefixes:w.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:N.MASS,prefixes:w.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:N.MASS,prefixes:w.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:N.MASS,prefixes:w.NONE,value:45.359237,offset:0},s:{name:"s",base:N.TIME,prefixes:w.SHORT,value:1,offset:0},min:{name:"min",base:N.TIME,prefixes:w.NONE,value:60,offset:0},h:{name:"h",base:N.TIME,prefixes:w.NONE,value:3600,offset:0},second:{name:"second",base:N.TIME,prefixes:w.LONG,value:1,offset:0},sec:{name:"sec",base:N.TIME,prefixes:w.LONG,value:1,offset:0},minute:{name:"minute",base:N.TIME,prefixes:w.NONE,value:60,offset:0},hour:{name:"hour",base:N.TIME,prefixes:w.NONE,value:3600,offset:0},day:{name:"day",base:N.TIME,prefixes:w.NONE,value:86400,offset:0},rad:{name:"rad",base:N.ANGLE,prefixes:w.NONE,value:1,offset:0},deg:{name:"deg",base:N.ANGLE,prefixes:w.NONE,value:.017453292519943295,offset:0},grad:{name:"grad",base:N.ANGLE,prefixes:w.NONE,value:.015707963267948967,offset:0},cycle:{name:"cycle",base:N.ANGLE,prefixes:w.NONE,value:6.283185307179586,offset:0},A:{name:"A",base:N.CURRENT,prefixes:w.SHORT,value:1,offset:0},ampere:{name:"ampere",base:N.CURRENT,prefixes:w.LONG,value:1,offset:0},K:{name:"K",base:N.TEMPERATURE,prefixes:w.NONE,value:1,offset:0},degC:{name:"degC",base:N.TEMPERATURE,prefixes:w.NONE,value:1,offset:273.15},degF:{name:"degF",base:N.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:459.67},degR:{name:"degR",base:N.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:0},kelvin:{name:"kelvin",base:N.TEMPERATURE,prefixes:w.NONE,value:1,offset:0},celsius:{name:"celsius",base:N.TEMPERATURE,prefixes:w.NONE,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:N.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:459.67},rankine:{name:"rankine",base:N.TEMPERATURE,prefixes:w.NONE,value:1/1.8,offset:0},mol:{name:"mol",base:N.AMOUNT_OF_SUBSTANCE,prefixes:w.NONE,value:1,offset:0},mole:{name:"mole",base:N.AMOUNT_OF_SUBSTANCE,prefixes:w.NONE,value:1,offset:0},cd:{name:"cd",base:N.LUMINOUS_INTENSITY,prefixes:w.NONE,value:1,offset:0},candela:{name:"candela",base:N.LUMINOUS_INTENSITY,prefixes:w.NONE,value:1,offset:0},N:{name:"N",base:N.FORCE,prefixes:w.SHORT,value:1,offset:0},newton:{name:"newton",base:N.FORCE,prefixes:w.LONG,value:1,offset:0},lbf:{name:"lbf",base:N.FORCE, +prefixes:w.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:N.FORCE,prefixes:w.NONE,value:4.4482216152605,offset:0},b:{name:"b",base:N.BIT,prefixes:w.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:N.BIT,prefixes:w.BINARY_LONG,value:1,offset:0},B:{name:"B",base:N.BIT,prefixes:w.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:N.BIT,prefixes:w.BINARY_LONG,value:8,offset:0}},_={meters:"meter",inches:"inch",feet:"foot",yards:"yard",miles:"mile",links:"link",rods:"rod",chains:"chain",angstroms:"angstrom",litres:"litre",teaspoons:"teaspoon",tablespoons:"tablespoon",minims:"minim",fluiddrams:"fluiddram",fluidounces:"fluidounce",gills:"gill",cups:"cup",pints:"pint",quarts:"quart",gallons:"gallon",beerbarrels:"beerbarrel",oilbarrels:"oilbarrel",hogsheads:"hogshead",gtts:"gtt",grams:"gram",tons:"ton",tonnes:"tonne",grains:"grain",drams:"dram",ounces:"ounce",poundmasses:"poundmass",hundredweights:"hundredweight",sticks:"stick",seconds:"second",minutes:"minute",hours:"hour",days:"day",radians:"rad",degrees:"deg",gradients:"grad",cycles:"cycle",amperes:"ampere",moles:"mole"};for(var O in _)if(_.hasOwnProperty(O)){var C=A[_[O]],S=Object.create(C);S.name=O,A[O]=S}A.lt=A.l,A.liter=A.litre,A.liters=A.litres,A.lb=A.lbm,A.lbs=A.lbm,n.PREFIXES=w,n.BASE_UNITS=N,n.UNITS=A,e.exports=n},function(e,t,r){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!e)throw new Error('Argument "doc" missing');this.doc=e}var i=r(171),o=i.object,a=i.string;n.isHelp=function(e){return e instanceof n},n.prototype.toText=function(e){var t=this.doc||{},r="\n";if(t.name&&(r+="Name: "+t.name+"\n\n"),t.category&&(r+="Category: "+t.category+"\n\n"),t.description&&(r+="Description:\n "+t.description+"\n\n"),t.syntax&&(r+="Syntax:\n "+t.syntax.join("\n ")+"\n\n"),t.examples){var i=e&&e.parser();r+="Examples:\n";for(var o=0;o15?e:new a(e)},a}var i=r(350),o=r(175).digits;t.name="BigNumber",t.path="type",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(){if(!(this instanceof o))throw new SyntaxError("Constructor must be called with the new operator");this._minimum=null,this._size=0}var a=n(r(118)),s=n(r(116)),u=1/Math.log((1+Math.sqrt(5))/2);o.prototype.insert=function(e,t){var r={key:e,value:t,degree:0};if(this._minimum){var n=this._minimum;r.left=n,r.right=n.right,n.right=r,r.right.left=r,a(e,n.key)&&(this._minimum=r)}else r.left=r,r.right=r,this._minimum=r;return this._size++,r},o.prototype.size=function(){return this._size},o.prototype.clear=function(){this._minimum=null,this._size=0},o.prototype.isEmpty=function(){return!!this._minimum},o.prototype.extractMinimum=function(){var e=this._minimum;if(null===e)return e;for(var t=this._minimum,r=e.degree,n=e.child;r>0;){var i=n.right;n.left.right=n.right,n.right.left=n.left,n.left=t,n.right=t.right,t.right=n,n.right.left=n,n.parent=null,n=i,r--}return e.left.right=e.right,e.right.left=e.left,e==e.right?t=null:(t=e.right,t=m(t,this._size)),this._size--,this._minimum=t,e},o.prototype.remove=function(e){this._minimum=c(this._minimum,e,null),this.extractMinimum()};var c=function(e,t,r){t.key=r;var n=t.parent;return n&&a(t.key,n.key)&&(f(e,t,n),l(e,n)),a(t.key,e.key)&&(e=t),e},f=function(e,t,r){t.left.right=t.right,t.right.left=t.left,r.degree--,r.child==t&&(r.child=t.right),0===r.degree&&(r.child=null),t.left=e,t.right=e.right,e.right=t,t.right.left=t,t.parent=null,t.mark=!1},l=function(e,t){var r=t.parent;r&&(t.mark?(f(e,t,r),l(r)):t.mark=!0)},p=function(e,t){e.left.right=e.right,e.right.left=e.left,e.parent=t,t.child?(e.left=t.child,e.right=t.child.right,t.child.right=e,e.right.left=e):(t.child=e,e.right=e,e.left=e),t.degree++,e.mark=!1},m=function(e,t){var r=Math.floor(Math.log(t)*u)+1,n=new Array(r),i=0,o=e;if(o)for(i++,o=o.right;o!==e;)i++,o=o.right;for(var c;i>0;){for(var f=o.degree,l=o.right;;){if(c=n[f],!c)break;if(s(o.key,c.key)){var m=c;c=o,o=m}p(c,o),n[f]=null,f++}n[f]=o,o=l,i--}e=null;for(var h=0;r>h;h++)c=n[h],c&&(e?(c.left.right=c.right,c.right.left=c.left,c.left=e,c.right=e.right,e.right=c,c.right.left=c,a(c.key,e.key)&&(e=c)):e=c);return e};return o}t.name="FibonacciHeap",t.path="type",t.factory=n},function(e,t,r){"use strict";e.exports=function(){function e(t){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");t instanceof e?this.value=t.value:this.value=t}function t(t,r){var n=Array.prototype.slice;"function"==typeof r?e.prototype[t]=function(){var t=[this.value].concat(n.call(arguments,0));return new e(r.apply(this,t))}:e.prototype[t]=new e(r)}var n=r(176);return e.prototype.done=function(){return this.value},e.prototype.valueOf=function(){return this.value},e.prototype.toString=function(){return n.format(this.value)},e.createProxy=function(e,r){if("string"==typeof e)t(e,r);else for(var n in e)e.hasOwnProperty(n)&&t(n,e[n])},e}},function(e,t,r){"use strict";function n(e,t,n,i){function y(t,r){if(1!=arguments.length&&2!=arguments.length)throw new o("parse",arguments.length,1,2);if(he=r&&r.nodes?r.nodes:{},a(t))return ge=t,T();if(Array.isArray(t)||t instanceof e.Matrix)return fe.deepMap(t,function(e){if(!a(e))throw new TypeError("String expected");return ge=e,T()});throw new TypeError("String or matrix expected")}function w(){ve=0,de=ge.charAt(0),we=0,be=null}function b(){ve++,de=ge.charAt(ve)}function N(){return ge.charAt(ve+1)}function E(){return ge.charAt(ve+2)}function M(){for(ye=le.NULL,xe="";" "==de||" "==de||"\n"==de&&we;)b();if("#"==de)for(;"\n"!=de&&""!=de;)b();if(""==de)return void(ye=le.DELIMITER);if("\n"==de&&!we)return ye=le.DELIMITER,xe=de,void b();var e=de+N(),t=e+E();if(3==t.length&&pe[t])return ye=le.DELIMITER,xe=t,b(),b(),void b();if(2==e.length&&pe[e])return ye=le.DELIMITER,xe=e,b(),void b();if(pe[de])return ye=le.DELIMITER,xe=de,void b();if(!S(de)){if(C(de)){for(;C(de)||z(de);)xe+=de,b();return void(ye=me[xe]?le.DELIMITER:le.SYMBOL)}for(ye=le.UNKNOWN;""!=de;)xe+=de,b();throw ue('Syntax error in part "'+xe+'"')}if(ye=le.NUMBER,"."==de)xe+=de,b(),z(de)||(ye=le.UNKNOWN);else{for(;z(de);)xe+=de,b();"."==de&&(xe+=de,b())}for(;z(de);)xe+=de,b();if(e=N(),("E"==de||"e"==de)&&(z(e)||"-"==e||"+"==e))for(xe+=de,b(),("+"==de||"-"==de)&&(xe+=de,b()),z(de)||(ye=le.UNKNOWN);z(de);)xe+=de,b()}function A(){do M();while("\n"==xe)}function _(){we++}function O(){we--}function C(e){return e>="a"&&"z">=e||e>="A"&&"Z">=e||"_"==e}function S(e){return e>="0"&&"9">=e||"."==e}function z(e){return e>="0"&&"9">=e}function T(){w(),M();var e=B();if(""!=xe)throw ye==le.DELIMITER?ce("Unexpected operator "+xe):ue('Unexpected part "'+xe+'"');return e}function B(){var e,t,r=[];if(""==xe)return new l("undefined","undefined");for("\n"!=xe&&";"!=xe&&(e=I());"\n"==xe||";"==xe;)0==r.length&&e&&(t=";"!=xe,r.push({node:e,visible:t})),M(),"\n"!=xe&&";"!=xe&&""!=xe&&(e=I(),t=";"!=xe,r.push({node:e,visible:t}));return r.length>0?new c(r):e}function I(){if(ye==le.SYMBOL&&"function"==xe)throw ue('Deprecated keyword "function". Functions can now be assigned without it, like "f(x) = x^2".');return q()}function q(){var e,t,r,n,i=P();if("="==xe){if(i instanceof d)return e=i.name,A(),r=q(),new u(e,r);if(i instanceof m)return A(),r=q(),new x(i,r);if(i instanceof g&&(n=!0,t=[],e=i.name,i.args.forEach(function(e,r){e instanceof d?t[r]=e.name:n=!1}),n))return A(),r=q(),new p(e,t,r);throw ue("Invalid left hand side of assignment operator =")}return i}function P(){for(var e=U();"?"==xe;){var t=be;be=we,A();var r=e,n=U();if(":"!=xe)throw ue("False part of conditional expression expected");be=null,A();var i=P();e=new f(r,n,i),be=t}return e}function U(){for(var e=R();"or"==xe;)A(),e=new h("or","or",[e,R()]);return e}function R(){for(var e=L();"xor"==xe;)A(),e=new h("xor","xor",[e,L()]);return e}function L(){for(var e=k();"and"==xe;)A(),e=new h("and","and",[e,k()]);return e}function k(){for(var e=j();"|"==xe;)A(),e=new h("|","bitOr",[e,j()]);return e}function j(){for(var e=F();"^|"==xe;)A(),e=new h("^|","bitXor",[e,F()]);return e}function F(){for(var e=D();"&"==xe;)A(),e=new h("&","bitAnd",[e,D()]);return e}function D(){var e,t,r,n,i;for(e=G(),t={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};xe in t;)r=xe,n=t[r],A(),i=[e,G()],e=new h(r,n,i);return e}function G(){var e,t,r,n,i;for(e=V(),t={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};xe in t;)r=xe,n=t[r],A(),i=[e,V()],e=new h(r,n,i);return e}function V(){var e,t,r,n,i;for(e=Z(),t={to:"to","in":"to"};xe in t;)r=xe,n=t[r],A(),i=[e,Z()],e=new h(r,n,i);return e}function Z(){var e,t=[];if(e=":"==xe?new l("1","number"):W(),":"==xe&&be!==we){for(t.push(e);":"==xe&&t.length<3;)A(),t.push(")"==xe||"]"==xe||","==xe||""==xe?new d("end"):W());e=3==t.length?new v(t[0],t[2],t[1]):new v(t[0],t[1])}return e}function W(){var e,t,r,n,i;for(e=H(),t={"+":"add","-":"subtract"};xe in t;)r=xe,n=t[r],A(),i=[e,H()],e=new h(r,n,i);return e}function H(){var e,t,r,n,i;if(e=Y(),t={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide","%":"mod",mod:"mod"},xe in t)for(;xe in t;)r=xe,n=t[r],A(),i=[e,Y()],e=new h(r,n,i);return(ye==le.SYMBOL||"in"==xe&&e instanceof l||ye==le.NUMBER&&!(e instanceof l)||"("==xe||"["==xe)&&(e=new h("*","multiply",[e,H()])),e}function Y(){var e,t,r={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"}[xe];return r?(e=xe,A(),t=[Y()],new h(e,r,t)):X()}function X(){var e,t,r,n;return e=J(),("^"==xe||".^"==xe)&&(t=xe,r="^"==t?"pow":"dotPow",A(),n=[e,Y()],e=new h(t,r,n)),e}function J(){var e,t,r,n,i;for(e=Q(),t={"!":"factorial","'":"transpose"};xe in t;)r=xe,n=t[r],M(),i=[e],e=new h(r,n,i);return e}function Q(){var e,t=[];if(ye==le.SYMBOL&&he[xe]){if(e=he[xe],M(),"("==xe){if(t=[],_(),M(),")"!=xe)for(t.push(P());","==xe;)M(),t.push(P());if(")"!=xe)throw ue("Parenthesis ) expected");O(),M()}return new e(t)}return $()}function $(){var e,t;return ye==le.SYMBOL||ye==le.DELIMITER&&xe in me?(t=xe,M(),e=K(t),e=ee(e)):te()}function K(e){var t;if("("==xe){if(t=[],_(),M(),")"!=xe)for(t.push(P());","==xe;)M(),t.push(P());if(")"!=xe)throw ue("Parenthesis ) expected");return O(),M(),new g(e,t)}return new d(e)}function ee(e){for(var t;"["==xe;){if(t=[],_(),M(),"]"!=xe)for(t.push(P());","==xe;)M(),t.push(P());if("]"!=xe)throw ue("Parenthesis ] expected");O(),M(),e=new m(e,t)}return e}function te(){var e,t,r;if('"'==xe){for(t="",r="";""!=de&&('"'!=de||"\\"==r);)t+=de,r=de,b();if(M(),'"'!=xe)throw ue('End of string " expected');return M(),e=new l(t,"string"),e=ee(e)}return re()}function re(){var e,t,r,n;if("["==xe){if(_(),M(),"]"!=xe){var i=ne();if(";"==xe){for(r=1,t=[i];";"==xe;)M(),t[r]=ne(),r++;if("]"!=xe)throw ue("End of matrix ] expected");O(),M(),n=t[0].nodes.length;for(var o=1;r>o;o++)if(t[o].nodes.length!=n)throw ce("Column dimensions mismatch ("+t[o].nodes.length+" != "+n+")");e=new s(t)}else{if("]"!=xe)throw ue("End of matrix ] expected");O(),M(),e=i}}else O(),M(),e=new s([]);return e}return ie()}function ne(){for(var e=[q()],t=1;","==xe;)M(),e[t]=q(),t++;return new s(e)}function ie(){var e;return ye==le.NUMBER?(e=xe,M(),new l(e,"number")):oe()}function oe(){var e;if("("==xe){if(_(),M(),e=q(),")"!=xe)throw ue("Parenthesis ) expected");return O(),M(),e}return ae()}function ae(){throw ue(""==xe?"Unexpected end of expression":"Value expected")}function se(){return ve-xe.length+1}function ue(e){var t=se(),r=new SyntaxError(e+" (char "+t+")");return r["char"]=t,r}function ce(e){var t=se(),r=new Error(e+" (char "+t+")");return r["char"]=t,r}var fe=n(r(2)),le={NULL:0,DELIMITER:1,NUMBER:2,SYMBOL:3,UNKNOWN:4},pe={",":!0,"(":!0,")":!0,"[":!0,"]":!0,'"':!0,";":!0,"+":!0,"-":!0,"*":!0,".*":!0,"/":!0,"./":!0,"%":!0,"^":!0,".^":!0,"~":!0,"!":!0,"&":!0,"|":!0,"^|":!0,"'":!0,"=":!0,":":!0,"?":!0,"==":!0,"!=":!0,"<":!0,">":!0,"<=":!0,">=":!0,"<<":!0,">>":!0,">>>":!0},me={mod:!0,to:!0,"in":!0,and:!0,xor:!0,or:!0,not:!0},he={},ge="",ve=0,de="",xe="",ye=le.NULL,we=0,be=null;return y}var i=r(171),o=r(177),a=i.string.isString,s=r(178),u=r(179),c=r(180),f=r(181),l=r(182),p=r(183),m=r(184),h=r(185),g=r(186),v=r(187),d=r(188),x=r(189);t.name="parse",t.path="expression",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i,o){function a(){if(!(this instanceof a))throw new SyntaxError("Constructor must be called with the new operator");this.scope={}}var s=n(r(13));return a.prototype.parse=function(e){throw new Error("Parser.parse is deprecated. Use math.parse instead.")},a.prototype.compile=function(e){throw new Error("Parser.compile is deprecated. Use math.compile instead.")},a.prototype.eval=function(e){return s(e).compile(o).eval(this.scope)},a.prototype.get=function(e){return this.scope[e]},a.prototype.set=function(e,t){return this.scope[e]=t},a.prototype.remove=function(e){delete this.scope[e]},a.prototype.clear=function(){for(var e in this.scope)this.scope.hasOwnProperty(e)&&delete this.scope[e]},a}t.name="Parser",t.path="expression",t.factory=n,t.math=!0},function(e,t,r){"use strict";t.ArrayNode=r(178),t.AssignmentNode=r(179),t.BlockNode=r(180),t.ConditionalNode=r(181),t.ConstantNode=r(182),t.IndexNode=r(184),t.FunctionAssignmentNode=r(183),t.FunctionNode=r(186),t.Node=r(190),t.OperatorNode=r(185),t.RangeNode=r(187),t.SymbolNode=r(188),t.UpdateNode=r(189)},function(e,t,r){t.e=r(191),t.E=r(191),t["false"]=r(192),t.i=r(193),t.Infinity=r(194),t.LN2=r(195),t.LN10=r(196),t.LOG2E=r(197),t.LOG10E=r(198),t.NaN=r(199),t["null"]=r(200),t.pi=r(201),t.PI=r(201),t.phi=r(202),t.SQRT1_2=r(203),t.SQRT2=r(204),t.tau=r(205),t["true"]=r(206),t.version=r(207),t.abs=r(219),t.add=r(220),t.ceil=r(221),t.cube=r(222),t.divide=r(223),t.dotDivide=r(224),t.dotMultiply=r(225),t.dotPow=r(226),t.exp=r(227),t.fix=r(228),t.floor=r(229),t.gcd=r(230),t.lcm=r(231),t.log=r(232),t.log10=r(233),t.mod=r(234),t.multiply=r(235),t.norm=r(236),t.nthRoot=r(237),t.pow=r(238),t.round=r(239),t.sign=r(240),t.sqrt=r(241),t.square=r(242),t.subtract=r(243),t.unaryMinus=r(244),t.unaryPlus=r(245),t.xgcd=r(246),t.bitAnd=r(247),t.bitNot=r(248),t.bitOr=r(249),t.bitXor=r(250),t.leftShift=r(251),t.rightArithShift=r(252),t.rightLogShift=r(253),t.arg=r(254),t.conj=r(255),t.re=r(256),t.im=r(257),t.bignumber=r(258),t["boolean"]=r(259),t.complex=r(260),t.index=r(261),t.matrix=r(262),t.number=r(263),t.string=r(264),t.unit=r(265),t.eval=r(266),t.help=r(267),t.and=r(268),t.not=r(269),t.or=r(270),t.xor=r(271),t.concat=r(272),t.cross=r(273),t.det=r(274),t.diag=r(275),t.dot=r(276),t.eye=r(277),t.flatten=r(278),t.inv=r(279),t.ones=r(280),t.range=r(281),t.resize=r(282),t.size=r(283),t.squeeze=r(284),t.subset=r(285),t.trace=r(286),t.transpose=r(287),t.zeros=r(288),t.combinations=r(289),t.factorial=r(290),t.gamma=r(291),t.permutations=r(292),t.pickRandom=r(293),t.random=r(294),t.randomInt=r(295),t.compare=r(296),t.deepEqual=r(297),t.equal=r(298),t.larger=r(299),t.largerEq=r(300),t.smaller=r(301),t.smallerEq=r(302),t.unequal=r(303),t.max=r(304),t.mean=r(305),t.median=r(306),t.min=r(307),t.prod=r(308),t.std=r(309),t.sum=r(310),t["var"]=r(311),t.acos=r(312),t.acosh=r(313),t.acot=r(314),t.acoth=r(315),t.acsc=r(316),t.acsch=r(317),t.asec=r(318),t.asech=r(319),t.asin=r(320),t.asinh=r(321),t.atan=r(322),t.atanh=r(323),t.atan2=r(324),t.cos=r(325),t.cosh=r(326),t.cot=r(327),t.coth=r(328),t.csc=r(329),t.csch=r(330),t.sec=r(331),t.sech=r(332),t.sin=r(333),t.sinh=r(334),t.tan=r(335),t.tanh=r(336),t.to=r(337),t.clone=r(338),t.map=r(339),t.filter=r(340),t.forEach=r(341),t.format=r(342),t["import"]=r(343),t.sort=r(344),t["typeof"]=r(345)},function(e,t,r){"use strict";function n(e,t,n){function h(e){if(!(this instanceof h))throw new SyntaxError("Constructor must be called with the new operator");if(e instanceof x)y(this,e);else if(e&&f(e.index)&&f(e.ptr)&&f(e.size))this._values=e.values,this._index=e.index,this._ptr=e.ptr,this._size=e.size;else if(f(e))w(this,e);else{if(e)throw new TypeError("Unsupported type of data ("+i.types.type(e)+")");this._values=[],this._index=[],this._ptr=[0],this._size=[0]}}var g=n(r(115)),v=e.Index,d=e.BigNumber,x=e.Matrix,y=function(e,t){"SparseMatrix"===t.type?(e._values=t._values?s.clone(t._values):void 0,e._index=s.clone(t._index),e._ptr=s.clone(t._ptr),e._size=s.clone(t._size)):w(e,t.valueOf())},w=function(e,t){e._values=[],e._index=[],e._ptr=[];var r=t.length,n=0;if(r>0){var i=0;do{e._ptr.push(e._values.length);for(var o=0;r>o;o++){var a=t[o];if(f(a)){if(0===i&&nn&&(n=1),g(a,0)||(e._values.push(a),e._index.push(o))}i++}while(n>i)}e._ptr.push(e._values.length),e._size=[r,n]};h.prototype=new x,h.prototype.type="SparseMatrix",h.prototype.storage=function(){return"sparse"},h.prototype.subset=function(e,t,r){if(!this._values)throw new Error("Cannot invoke subset on a Pattern only matrix");switch(arguments.length){case 1:return b(this,e);case 2:case 3:return N(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}};var b=function(e,t){if(!(t instanceof v))throw new TypeError("Invalid index");var r=t.isScalar();if(r)return e.get(t.min());var n=t.size();if(n.length!=e._size.length)throw new o(n.length,e._size.length);for(var i=t.min(),a=t.max(),s=0,u=e._size.length;u>s;s++)m(i[s],e._size[s]),m(a[s],e._size[s]);var c=function(e){return e};return O(e,i[0],a[0],i[1],a[1],c,!1)},N=function(e,t,r,n){if(!(t instanceof v))throw new TypeError("Invalid index");var i,u=t.size(),c=t.isScalar();if(r instanceof x?(i=r.size(),r=r.toArray()):i=a.size(r),c){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),r,n)}else{if(1!==u.length&&2!==u.length)throw new o(u.length,e._size.length,"<");if(i.length");for(var p=t.min()[0],m=t.min()[1],h=i[0],g=i[1],d=0;h>d;d++)for(var y=0;g>y;y++){var w=r[d][y];e.set([d+p,y+m],w,n)}}return e};h.prototype.get=function(e){if(!f(e))throw new TypeError("Array expected");if(e.length!=this._size.length)throw new o(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke get on a Pattern only matrix");var t=e[0],r=e[1];m(t,this._size[0]),m(r,this._size[1]);var n=E(t,this._ptr[r],this._ptr[r+1],this._index);return na-1||i>s-1)&&(_(this,Math.max(n+1,a),Math.max(i+1,s),r),a=this._size[0],s=this._size[1]),m(n,a),m(i,s);var u=E(n,this._ptr[i],this._ptr[i+1],this._index);return un[r-1])return r;for(;r>t;){var i=~~((t+r)/2),o=n[i];if(o>e)r=i;else{if(!(e>o))return i;t=i+1}}return t},M=function(e,t,r,n,i){r.splice(e,1),n.splice(e,1);for(var o=t+1;ot)throw new TypeError("Invalid size, must contain positive integers (size: "+u.format(e)+")")});var n=r?this.clone():this;return _(n,e[0],e[1],t)};var _=function(e,t,r,n){var i,o,a,s=n||0,u=!g(s,0),c=e._size[0],f=e._size[1];if(r>f){for(o=f;r>o;o++)if(e._ptr[o]=e._values.length,u)for(i=0;c>i;i++)e._values.push(s),e._index.push(i);e._ptr[r]=e._values.length}else f>r&&(e._ptr.splice(r+1,f-r),e._values.splice(e._ptr[r],e._values.length),e._index.splice(e._ptr[r],e._index.length));if(f=r,t>c){if(u){var l=0;for(o=0;f>o;o++){e._ptr[o]=e._ptr[o]+l,a=e._ptr[o+1]+l;var p=0;for(i=c;t>i;i++,p++)e._values.splice(a+p,0,s),e._index.splice(a+p,0,i),l++}e._ptr[f]=e._values.length}}else if(c>t){var m=0;for(o=0;f>o;o++){e._ptr[o]=e._ptr[o]-m;var h=e._ptr[o],v=e._ptr[o+1]-m;for(a=h;v>a;a++)i=e._index[a],i>t-1&&(e._values.splice(a,1),e._index.splice(a,1),m++)}e._ptr[o]=e._values.length}return e._size[0]=t,e._size[1]=r,e};h.prototype.clone=function(){var e=new h({values:this._values?s.clone(this._values):void 0,index:s.clone(this._index),ptr:s.clone(this._ptr),size:s.clone(this._size)});return e},h.prototype.size=function(){return s.clone(this._size)},h.prototype.map=function(e,t){if(!this._values)throw new Error("Cannot invoke map on a Pattern only matrix");var r=this,n=this._size[0],i=this._size[1],o=function(t,n,i){return e(t,[n,i],r)};return O(this,0,n-1,0,i-1,o,t)};var O=function(e,t,r,n,i,o,a){for(var s=[],u=[],c=[],f=function(e,t,r){e=o(e,t,r),g(e,0)||(s.push(e),u.push(t))},l=n;i>=l;l++){c.push(s.length);for(var p=e._ptr[l],m=e._ptr[l+1],v=t,d=p;m>d;d++){var x=e._index[d];if(x>=t&&r>=x){if(!a)for(var y=v;x>y;y++)f(0,y-t,l-n);f(e._values[d],x-t,l-n)}v=x+1}if(!a)for(var w=v;r>=w;w++)f(0,w-t,l-n)}return c.push(s.length),new h({values:s,index:u,ptr:c,size:[r-t+1,i-n+1]})};h.prototype.forEach=function(e,t){if(!this._values)throw new Error("Cannot invoke forEach on a Pattern only matrix");for(var r=this,n=this._size[0],i=this._size[1],o=0;i>o;o++){for(var a=this._ptr[o],s=this._ptr[o+1],u=0,c=a;s>c;c++){var f=this._index[c];if(!t)for(var l=u;f>l;l++)e(0,[l,o],r);e(this._values[c],[f,o],r),u=f+1}if(!t)for(var p=u;n>p;p++)e(0,[p,o],r)}},h.prototype.toArray=function(){return C(this._values,this._index,this._ptr,this._size,!0)},h.prototype.valueOf=function(){return C(this._values,this._index,this._ptr,this._size,!1)};var C=function(e,t,r,n,i){var o,a,u=n[0],c=n[1],f=new Array(u);for(o=0;u>o;o++)for(f[o]=new Array(c),a=0;c>a;a++)f[o][a]=0;for(a=0;c>a;a++)for(var l=r[a],p=r[a+1],m=l;p>m;m++)o=t[m],f[o][a]=e?i?s.clone(e[m]):e[m]:1;return f};return h.prototype.format=function(e){for(var t=this._size[0],r=this._size[1],n="Sparse Matrix ["+u.format(t,e)+" x "+u.format(r,e)+"] density: "+u.format(this._index.length/(t*r),e)+"\n",i=0;r>i;i++)for(var o=this._ptr[i],a=this._ptr[i+1],s=o;a>s;s++){var c=this._index[s];n+="\n ("+u.format(c,e)+", "+u.format(i,e)+") ==> "+(this._values?u.format(this._values[s],e):"X")}return n},h.prototype.toString=function(){return u.format(this.toArray())},h.prototype.toJSON=function(){return{mathjs:"SparseMatrix",values:this._values,index:this._index,ptr:this._ptr,size:this._size}},h.prototype.diagonal=function(e){if(e){if(e instanceof d&&(e=e.toNumber()),!l(e)||!p(e))throw new TypeError("The parameter k must be an integer number")}else e=0;var t=e>0?e:0,r=0>e?-e:0,n=this._size[0],i=this._size[1],o=Math.min(n-r,i-t),a=[],u=[],c=[];c[0]=0;for(var f=t;i>f&&a.lengthv;v++){var x=this._index[v];if(x===f-t+r){a.push(s.clone(this._values[v])),u[a.length-1]=x-r;break}}return c.push(a.length),new h({values:a,index:u,ptr:c,size:[o,1]})},h.fromJSON=function(e){return new h(e)},h.diagonal=function(e,t,r){if(!f(e))throw new TypeError("Array expected, size parameter");if(2!==e.length)throw new Error("Only two dimensions matrix are supported");if(e=e.map(function(e){if(e instanceof d&&(e=e.toNumber()),!l(e)||!p(e)||1>e)throw new Error("Size values must be positive integers");return e}),r){if(r instanceof d&&(r=r.toNumber()),!l(r)||!p(r))throw new TypeError("The parameter k must be an integer number")}else r=0;var n,i=r>0?r:0,o=0>r?-r:0,a=e[0],s=e[1],u=Math.min(a-o,s-i);if(f(t)){if(t.length!==u)throw new Error("Invalid value array length");n=function(e){return t[e]}}else if(t instanceof x){var c=t.size();if(1!==c.length||c[0]!==u)throw new Error("Invalid matrix length");n=function(e){return t.get([e])}}else n=function(){return t};for(var m=[],v=[],y=[],w=0;s>w;w++){y.push(m.length);var b=w-i;if(b>=0&&u>b){var N=n(b);g(N,0)||(v.push(b+o),m.push(N))}}return y.push(m.length),new h({values:m,index:v,ptr:y,size:[a,s]})},h.prototype.swapRows=function(e,t){if(!(l(e)&&p(e)&&l(t)&&p(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return m(e,this._size[0]),m(t,this._size[0]),h._swapRows(e,t,this._size[1],this._values,this._index,this._ptr),this},h._forEachRow=function(e,t,r,n,i){for(var o=n[e],a=n[e+1],s=o;a>s;s++)i(r[s],t[s])},h._swapRows=function(e,t,r,n,i,o){for(var a=0;r>a;a++){var s=o[a],u=o[a+1],c=E(e,s,u,i),f=E(t,s,u,i);if(u>c&&u>f&&i[c]===e&&i[f]===t){if(n){var l=n[c];n[c]=n[f],n[f]=l}}else if(u>c&&i[c]===e&&(f>=u||i[f]!==t)){var p=n?n[c]:void 0;i.splice(f,0,t),n&&n.splice(f,0,p),i.splice(c>=f?c+1:c,1),n&&n.splice(c>=f?c+1:c,1)}else if(u>f&&i[f]===t&&(c>=u||i[c]!==e)){var m=n?n[f]:void 0;i.splice(c,0,e),n&&n.splice(c,0,m),i.splice(f>=c?f+1:f,1),n&&n.splice(f>=c?f+1:f,1)}}},x._storage.sparse=h,h}var i=r(171),o=r(174),a=i.array,s=i.object,u=i.string,c=i.number,f=Array.isArray,l=i.number.isNumber,p=i.number.isInteger,m=a.validateIndex;t.name="SparseMatrix",t.path="type",t.factory=n},function(e,t,r){"use strict";function n(e,t,r){function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(e instanceof b)"DenseMatrix"===e.type?(this._data=u.clone(e._data),this._size=u.clone(e._size)):(this._data=e.toArray(),this._size=e.size());else if(e&&c(e.data)&&c(e.size))this._data=e.data,this._size=e.size;else if(c(e))this._data=x(e),this._size=s.size(this._data);else{if(e)throw new TypeError("Unsupported type of data ("+i.types.type(e)+")");this._data=[],this._size=[0]}}function m(e,t){if(!(t instanceof y))throw new TypeError("Invalid index");var r=t.isScalar();if(r)return e.get(t.min());var i=t.size();if(i.length!=e._size.length)throw new o(i.length,e._size.length);for(var a=t.min(),s=t.max(),u=0,c=e._size.length;c>u;u++)p(a[u],e._size[u]),p(s[u],e._size[u]);return new n(h(e._data,t,i.length,0))}function h(e,t,r,n){var i=n==r-1,o=t.range(n);return o.map(i?function(t){return e[t]}:function(i){var o=e[i];return h(o,t,r,n+1)})}function g(e,t,r,n){if(!(t instanceof y))throw new TypeError("Invalid index");var i,a=t.size(),c=t.isScalar();if(r instanceof b?(i=r.size(),r=r.valueOf()):i=s.size(r),c){if(0!==i.length)throw new TypeError("Scalar expected");e.set(t.min(),r,n)}else{if(a.length");var p=t.max().map(function(e){return e+1});d(e,p,n);var m=a.length,h=0;v(e._data,t,r,m,h)}return e}function v(e,t,r,n,i){var o=i==n-1,a=t.range(i);a.forEach(o?function(t,n){p(t),e[t]=r[n]}:function(o,a){p(o),v(e[o],t,r[a],n,i+1)})}function d(e,t,r){for(var n=u.clone(e._size),i=!1;n.lengtho;o++)t[o]>n[o]&&(n[o]=t[o],i=!0);i&&N(e,n,r)}function x(e){for(var t=0,r=e.length;r>t;t++){var n=e[t];c(n)?e[t]=x(n):n instanceof b&&(e[t]=x(n.valueOf()))}return e}var y=e.Index,w=e.BigNumber,b=e.Matrix;n.prototype=new b,n.prototype.type="DenseMatrix",n.prototype.storage=function(){return"dense"},n.prototype.subset=function(e,t,r){switch(arguments.length){case 1:return m(this,e);case 2:case 3:return g(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},n.prototype.get=function(e){if(!c(e))throw new TypeError("Array expected");if(e.length!=this._size.length)throw new o(e.length,this._size.length);for(var t=0;tn;n++){var a=e[n];p(a,r.length),r=r[a]}return u.clone(r)},n.prototype.set=function(e,t,r){if(!c(e))throw new TypeError("Array expected");if(e.lengthn;n++)a=e[n],p(a,u.length),u=u[a];return a=e[e.length-1],p(a,u.length),u[a]=t,this},n.prototype.resize=function(e,t,r){if(!c(e))throw new TypeError("Array expected");var n=r?this.clone():this;return N(n,e,t)};var N=function(e,t,r){if(0===t.length){for(var n=e._data;c(n);)n=n[0];return u.clone(n)}return e._size=u.clone(t),e._data=s.resize(e._data,e._size,r),e};return n.prototype.clone=function(){var e=new n({data:u.clone(this._data),size:u.clone(this._size)});return e},n.prototype.size=function(){return this._size},n.prototype.map=function(e){var t=this,r=function(n,i){return c(n)?n.map(function(e,t){return r(e,i.concat(t))}):e(n,i,t)};return new n({data:r(this._data,[]),size:u.clone(this._size)})},n.prototype.forEach=function(e){var t=this,r=function(n,i){c(n)?n.forEach(function(e,t){r(e,i.concat(t))}):e(n,i,t)};r(this._data,[])},n.prototype.toArray=function(){return u.clone(this._data)},n.prototype.valueOf=function(){return this._data},n.prototype.format=function(e){return a.format(this._data,e)},n.prototype.toString=function(){return a.format(this._data)},n.prototype.toJSON=function(){return{mathjs:"DenseMatrix",data:this._data,size:this._size}},n.prototype.diagonal=function(e){if(e){if(e instanceof w&&(e=e.toNumber()),!f(e)||!l(e))throw new TypeError("The parameter k must be an integer number")}else e=0;for(var t=e>0?e:0,r=0>e?-e:0,i=this._size[0],o=this._size[1],a=Math.min(i-r,o-t),s=[],c=0;a>c;c++)s[c]=u.clone(this._data[c+r][c+t]);return new n({data:s,size:[a]})},n.diagonal=function(t,r,i,o){if(!c(t))throw new TypeError("Array expected, size parameter");if(2!==t.length)throw new Error("Only two dimensions matrix are supported");if(t=t.map(function(e){if(e instanceof w&&(e=e.toNumber()),!f(e)||!l(e)||1>e)throw new Error("Size values must be positive integers");return e}),i){if(i instanceof w&&(i=i.toNumber()),!f(i)||!l(i))throw new TypeError("The parameter k must be an integer number")}else i=0;var a,u=i>0?i:0,p=0>i?-i:0,m=t[0],h=t[1],g=Math.min(m-p,h-u);if(c(r)){if(r.length!==g)throw new Error("Invalid value array length");a=function(e){return r[e]}}else if(r instanceof b){var v=r.size();if(1!==v.length||v[0]!==g)throw new Error("Invalid matrix length");a=function(e){return r.get([e])}}else a=function(){return r};o||(o=a(0)instanceof e.BigNumber?new e.BigNumber(0):0);var d=[];if(t.length>0){d=s.resize(d,t,o);for(var x=0;g>x;x++)d[x+p][x+u]=a(x)}return new n({data:d,size:[m,h]})},n.fromJSON=function(e){return new n(e)},n.prototype.swapRows=function(e,t){if(!(f(e)&&l(e)&&f(t)&&l(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return p(e,this._size[0]), +p(t,this._size[0]),n._swapRows(e,t,this._data),this},n._swapRows=function(e,t,r){var n=r[e];r[e]=r[t],r[t]=n},b._storage.dense=n,b._storage["default"]=n,n}var i=r(171),o=r(174),a=i.string,s=i.array,u=i.object,c=Array.isArray,f=i.number.isNumber,l=i.number.isInteger,p=s.validateIndex;t.name="DenseMatrix",t.path="type",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(t){if(!(this instanceof o))throw new SyntaxError("Constructor must be called with the new operator");this._values=new Array(t),this._heap=new e.FibonacciHeap}var a=n(r(32)),s=n(r(115));return o.prototype.set=function(e,t){if(this._values[e])this._values[e].value=t;else{var r=this._heap.insert(e,t);this._values[e]=r}},o.prototype.get=function(e){var t=this._values[e];return t?t.value:0},o.prototype.accumulate=function(e,t){var r=this._values[e];r?r.value=a(r.value,t):(r=this._heap.insert(e,t),this._values[e]=r)},o.prototype.forEach=function(e,t,r){var n=this._heap,i=this._values,o=[],a=n.extractMinimum();for(a&&o.push(a);a&&a.key<=t;)a.key>=e&&(s(a.value,0)||r(a.key,a.value,this)),a=n.extractMinimum(),a&&o.push(a);for(var u=0;ut;t++){var s=arguments[t];if(s instanceof i)s.start--,s.end-=s.step>0?0:2;else if(a(s))s--;else{if(!(s instanceof n))throw new TypeError("Ranges must be a Number or Range");s=s.toNumber()-1}e[t]=s}var u=new o;return o.apply(u,e),u};return e.index.transform=t,t}},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("abs",{number:Math.abs,Complex:function(e){var t=Math.abs(e.re),r=Math.abs(e.im);if(1e3>t&&1e3>r)return Math.sqrt(t*t+r*r);if(t>=r){var n=r/t;return t*Math.sqrt(1+n*n)}var i=t/r;return r*Math.sqrt(1+i*i)},BigNumber:function(e){return e.abs()},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="abs",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=n(r(75)),c=n(r(115)),f=n(r(210)),l=n(r(211)),p=e.DenseMatrix,m=e.SparseMatrix,h=a("add",{"any, any":l,"Matrix, Matrix":function(e,t){var r=e.size(),n=t.size();if(r.length!==n.length)throw new o(r.length,n.length);var i;switch(e.storage()){case"sparse":switch(t.storage()){case"sparse":i=v(e,t,r,n);break;default:i=d(e,t.valueOf(),r,n)}break;default:switch(t.storage()){case"sparse":i=x(e.valueOf(),t,r,n);break;default:i=y(e.valueOf(),t.valueOf(),e.storage())}}return i},"Array, Array":function(e,t){return h(u(e),u(t)).valueOf()},"Array, Matrix":function(e,t){return h(u(e),t)},"Matrix, Array":function(e,t){return h(e,u(t))},"Matrix, any":function(e,t){var r;switch(e.storage()){case"sparse":r=g(e,t,e.size());break;default:r=s.deepMap2(e,t,h)}return r},"any, Matrix":function(e,t){var r;switch(t.storage()){case"sparse":r=g(t,e,t.size());break;default:r=s.deepMap2(e,t,h)}return r},"Array, any":function(e,t){return s.deepMap2(e,t,h)},"any, Array":function(e,t){return s.deepMap2(e,t,h)}}),g=function(e,t,r){var n=r[0],i=r[1],o=e._values,a=e._index,s=e._ptr;if(!c(t,0)){for(var u=[],f=[],p=new Array(i),h=new m({values:u,index:f,ptr:p,size:[n,i]}),g=0;i>g;g++){p[g]=f.length;for(var v=s[g],d=s[g+1],x=v;d>x;x++){var y=l(o[x],t);c(y,0)||(f.push(a[x]),u.push(y))}}return p[i]=f.length,h}return e.clone()},v=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var i=r[0],o=r[1],a=e._values,s=t._values,u=a&&s,c=u?[]:void 0,l=[],p=new Array(o),h=new m({values:c,index:l,ptr:p,size:[i,o]}),g=u?new Array(i):void 0,v=new Array(i),d=0;o>d;d++)if(p[d]=l.length,f(e,d,1,v,g,d+1,h),f(t,d,1,v,g,d+1,h),u)for(var x=p[d],y=l.length,w=x;y>w;w++)c.push(g[l[w]]);return p[o]=l.length,h},d=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var i=r[0],o=r[1],a=t,s=[],u=[],l=new Array(o),p=new m({values:s,index:u,ptr:l,size:[i,o]}),h=new Array(i),g=new Array(i),v=0;o>v;v++){l[v]=u.length;for(var d=0;i>d;d++){var x=a[d][v];c(x,0)||(h[d]=x,g[d]=v+1,u.push(d))}f(e,v,1,g,h,v+1,p);for(var y=l[v],w=u.length,b=y;w>b;b++)s.push(h[u[b]])}return l[o]=u.length,p},x=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var o=r[0],a=r[1],s=e,u=t._values,c=t._index,f=t._ptr,m=i(s),h=new p({data:m,size:[o,a]}),g=0;a>g;g++)for(var v=f[g],d=f[g+1],x=v;d>x;x++){var y=c[x];m[y][g]=l(m[y][g],u[x])}return h},y=function(e,t,r){return u(s.deepMap2(e,t,h),r)};return h}var i=r(166).clone,o=r(174);t.name="add",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("ceil",{number:Math.ceil,Complex:function(e){return new e.constructor(Math.ceil(e.re),Math.ceil(e.im))},BigNumber:function(e){return e.ceil()},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="ceil",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=n(r(212)).signatures["Complex,Complex"],s=i("cube",{number:function(e){return e*e*e},Complex:function(e){return a(a(e,e),e)},BigNumber:function(e){return e.times(e).times(e)},"Array | Matrix":function(e){return o.deepMap(e,s,!0)}});return s}t.name="cube",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=n(r(213)),s=n(r(47)),u=n(r(96));return i("divide",{"any, any":a,"Array | Matrix, Array | Matrix":function(e,t){return s(e,u(t))},"Array | Matrix, any":function(e,t){return o.deepMap2(e,t,a)},"any, Array | Matrix":function(e,t){return s(e,u(t))}})}t.name="divide",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=n(r(213));return i("dotDivide",{"any, any":function(e,t){return o.deepMap2(e,t,a)}})}t.name="dotDivide",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=n(r(47));return i("dotMultiply",{"any, any":function(e,t){return o.deepMap2(e,t,a)}})}r(172).size;t.name="dotMultiply",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=n(r(50));return i("dotMultiply",{"any, any":function(e,t){return o.deepMap2(e,t,a)}})}t.name="dotPow",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("exp",{number:Math.exp,Complex:function(t){var r=Math.exp(t.re);return new e.Complex(r*Math.cos(t.im),r*Math.sin(t.im))},BigNumber:function(e){return e.exp()},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="exp",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("fix",{number:function(e){return e>0?Math.floor(e):Math.ceil(e)},Complex:function(e){return new e.constructor(e.re>0?Math.floor(e.re):Math.ceil(e.re),e.im>0?Math.floor(e.im):Math.ceil(e.im))},BigNumber:function(e){return e.isNegative()?e.ceil():e.floor()},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="fix",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("floor",{number:Math.floor,Complex:function(e){return new e.constructor(Math.floor(e.re),Math.floor(e.im))},BigNumber:function(e){return e.floor()},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="floor",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t,r){if(!t.isInt()||!r.isInt())throw new Error("Parameters in function gcd must be integer numbers");for(var n=new e.BigNumber(0);!r.isZero();){var i=t.mod(r);t=r,r=i}return t.lt(n)?t.neg():t}var s=n(r(2)),u=o("gcd",{"number, number":i,"BigNumber, BigNumber":a,"Array | Matrix, Array | Matrix | number | BigNumber":function(e,t){return s.deepMap2(e,t,u)},"number | BigNumber, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,r){for(var n=u(e,t),i=0;ie?-e:e}var o=r(175).isInteger;t.name="gcd",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t,r){if(!t.isInt()||!r.isInt())throw new Error("Parameters in function lcm must be integer numbers");if(t.isZero()||r.isZero())return new e.BigNumber(0);for(var n=t.times(r);!r.isZero();){var i=r;r=t.mod(i),t=i}return n.div(t).abs()}var s=n(r(2)),u=o("lcm",{"number, number":i,"BigNumber, BigNumber":a,"Array | Matrix, Array | Matrix | number | BigNumber":function(e,t){return s.deepMap2(e,t,u)},"number | BigNumber, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)},"Array | Matrix | number | BigNumber, Array | Matrix | number | BigNumber, ...Array | Matrix | number | BigNumber":function(e,t,r){for(var n=u(e,t),i=0;i=0?Math.log(t):u(new e.Complex(t,0))}var a=n(r(2)),s=n(r(213)),u=i("log",{number:o,Complex:function(t){return new e.Complex(Math.log(Math.sqrt(t.re*t.re+t.im*t.im)),Math.atan2(t.im,t.re))},BigNumber:function(e){return e.ln()},"Array | Matrix":function(e){return a.deepMap(e,u)},"any, any":function(e,t){return s(u(e),u(t))}});return u}t.name="log",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(t){return new e.Complex(Math.log(Math.sqrt(t.re*t.re+t.im*t.im))/Math.LN10,Math.atan2(t.im,t.re)/Math.LN10)}var a=n(r(2)),s=i("log10",{number:function(t){return t>=0?Math.log(t)/Math.LN10:s(new e.Complex(t,0))},Complex:o,BigNumber:function(t){return t.isNegative()?o(new e.Complex(t.toNumber(),0)):t.log()},"Array | Matrix":function(e){return a.deepMap(e,s)}});return s}t.name="log10",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){if(t>0)return e-t*Math.floor(e/t);if(0===t)return e;throw new Error("Cannot calculate mod for a negative divisor")}var a=n(r(2)),s=i("mod",{"number, number":o,"BigNumber, BigNumber":function(e,t){return t.isZero()?e:e.mod(t)},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}t.name="mod",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var a=n(r(75)),s=n(r(32)),u=n(r(212)),c=n(r(115)),f=n(r(210)),l=n(r(2)),p=e.DenseMatrix,m=e.SparseMatrix,h=e.Spa,g=i("multiply",{"any, any":u,"Array, Array":function(t,r){v(o.size(t),o.size(r));var n=g(a(t),a(r));return n instanceof e.Matrix?n.valueOf():n},"Matrix, Matrix":function(e,t){var r=e.size(),n=t.size();return v(r,n),1===r.length?1===n.length?d(e,t,r[0]):x(e,t):1===n.length?w(e,t):b(e,t)},"Matrix, Array":function(e,t){return g(e,a(t))},"Array, Matrix":function(e,t){return g(a(e,t.storage()),t)},"Array, any":function(e,t){return l.deepMap2(e,t,g)},"Matrix, any":function(e,t){return e.map(function(e){return g(e,t)},!0)},"any, Array | Matrix":function(e,t){return t.map(function(t){return g(t,e)},!0)}}),v=function(e,t){switch(e.length){case 1:switch(t.length){case 1:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vectors must have the same length");break;case 2:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vector length ("+e[0]+") must match Matrix rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;case 2:switch(t.length){case 1:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix columns ("+e[1]+") must match Vector length ("+t[0]+")");break;case 2:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix A columns ("+e[1]+") must match Matrix B rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix A has "+e.length+" dimensions)")}},d=function(e,t,r){if(0===r)throw new Error("Cannot multiply two empty vectors");for(var n=e._data,i=t._data,o=0,a=0;r>a;a++)o=s(o,g(n[a],i[a]));return o},x=function(e,t){switch(t.storage()){case"dense":return y(e,t)}throw new Error("Not implemented")},y=function(e,t){for(var r=e._data,n=e._size,i=t._data,o=t._size,a=n[0],u=o[1],c=new Array(u),f=0;u>f;f++){for(var l=0,m=0;a>m;m++)l=s(l,g(r[m],i[m][f]));c[f]=l}return 1===u?c[0]:new p({data:c,size:[u]})},w=function(e,t){switch(e.storage()){case"dense":return N(e,t);case"sparse":return A(e,t)}},b=function(e,t){switch(e.storage()){case"dense":switch(t.storage()){case"dense":return E(e,t);case"sparse":return M(e,t)}break;case"sparse":switch(t.storage()){case"dense":return _(e,t);case"sparse":return O(e,t)}}},N=function(e,t){for(var r=e._data,n=e._size,i=t._data,o=n[0],a=n[1],u=new Array(o),c=0;o>c;c++){for(var f=r[c],l=0,m=0;a>m;m++)l=s(l,g(f[m],i[m]));u[c]=l}return 1===o?u[0]:new p({data:u,size:[o]})},E=function(e,t){for(var r=e._data,n=e._size,i=t._data,o=t._size,a=n[0],u=n[1],c=o[1],f=new Array(a),l=0;a>l;l++){var m=r[l];f[l]=new Array(c);for(var h=0;c>h;h++){for(var v=0,d=0;u>d;d++)v=s(v,g(m[d],i[d][h]));f[l][h]=v}}return 1===a&&1===c?f[0][0]:new p({data:f,size:[a,c]})},M=function(e,t){for(var r=e._data,n=e._size,i=t._values,o=t._index,a=t._ptr,u=t._size,c=n[0],f=u[1],l=new Array(c),m=0;c>m;m++){l[m]=new Array(f);for(var h=r[m],v=0;f>v;v++){for(var d=0,x=a[v],y=a[v+1],w=x;y>w;w++){var b=o[w];d=s(d,g(h[b],i[w]))}l[m][v]=d}}return 1===c&&1===f?l[0][0]:new p({data:l,size:[c,f]})},A=function(e,t){var r=e._values,n=e._index,i=e._ptr,o=t._data,a=e._size[0],s=t._size[0],u=[],f=[],l=[],p=new h(a);l.push(0);for(var v=0;s>v;v++){var d=o[v];if(!c(d,0))for(var x=i[v],y=i[v+1],w=x;y>w;w++){var b=n[w];p.accumulate(b,g(d,r[w]))}}return p.forEach(0,a-1,function(e,t){f.push(e),u.push(t)}),l.push(u.length),1===a?1===u.length?u[0]:0:new m({values:u,index:f,ptr:l,size:[a,1]})},_=function(e,t){for(var r=e._values,n=e._index,i=e._ptr,o=t._data,a=e._size[0],s=t._size[0],u=t._size[1],f=[],l=[],p=[],v=function(e,t){l.push(e),f.push(t)},d=0;u>d;d++){p.push(f.length);for(var x=new h(a),y=0;s>y;y++){var w=o[y][d];if(!c(w,0))for(var b=i[y],N=i[y+1],E=b;N>E;E++){var M=n[E];x.accumulate(M,g(w,r[E]))}}x.forEach(0,a-1,v)}return p.push(f.length),1===a&&1===u?1===f.length?f[0]:0:new m({values:f,index:l,ptr:p,size:[a,u]})},O=function(e,t){for(var r=e._values,n=t._values,i=t._index,o=t._ptr,a=e._size[0],s=t._size[1],u=r&&n,c=u?[]:void 0,l=[],p=[],h=new m({values:c,index:l,ptr:p,size:[a,s]}),g=u?new Array(a):void 0,v=new Array(a),d=0;s>d;d++){p.push(l.length);for(var x=o[d],y=o[d+1],w=x;y>w;w++){var b=i[w];f(e,b,n?n[w]:1,v,g,d+1,h)}if(u)for(var N=p[d],E=l.length,M=N;E>M;M++)c[M]=g[l[M]]}return p.push(l.length),1===a&&1===s&&u?1===c.length?c[0]:0:h};return g}var i=r(171),o=i.array;t.name="multiply",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){var r=e.size();if(1==r.length){if(t===Number.POSITIVE_INFINITY||"inf"===t){var n=0;return e.forEach(function(e){var t=a(e);p(t,n)&&(n=t)},!0),n}if(t===Number.NEGATIVE_INFINITY||"-inf"===t){var i;return e.forEach(function(e){var t=a(e);(!i||m(t,i))&&(i=t)},!0),i||0}if("fro"===t)return o(e,2);if("number"==typeof t&&!isNaN(t)){if(!l(t,0)){var h=0;return e.forEach(function(e){h=s(u(a(e),t),h)},!0),u(h,1/t)}return Number.POSITIVE_INFINITY}throw new Error("Unsupported parameter value")}if(2==r.length){if(1===t){var d=[],x=0;return e.forEach(function(e,t){var r=t[1],n=s(d[r]||0,a(e));p(n,x)&&(x=n),d[r]=n},!0),x}if(t===Number.POSITIVE_INFINITY||"inf"===t){var y=[],w=0;return e.forEach(function(e,t){var r=t[0],n=s(y[r]||0,a(e));p(n,w)&&(w=n),y[r]=n},!0),w}if("fro"===t)return c(g(f(v(e),e)));if(2===t)throw new Error("Unsupported parameter value, missing implementation of matrix singular value decomposition");throw new Error("Unsupported parameter value")}}var a=n(r(31)),s=n(r(32)),u=n(r(50)),c=n(r(53)),f=n(r(47)),l=n(r(115)),p=n(r(116)),m=n(r(118)),h=n(r(75)),g=n(r(103)),v=n(r(104)),d=a.signatures.Complex,x=i("norm",{number:Math.abs,Complex:d,BigNumber:function(e){return e.abs()},"boolean | null":function(e){return Math.abs(e)},Array:function(e){return o(h(e),2)},Matrix:function(e){return o(e,2)},"number | Complex | BigNumber | boolean | null, number | BigNumber | string":function(e){return x(e)},"Array, number | BigNumber | string":function(e,t){return o(h(e),t)},"Matrix, number | BigNumber | string":function(e,t){return o(e,t)}});return x}t.name="norm",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t,r){var n=new e.BigNumber(0),i=new e.BigNumber(1),o=r.isNegative();if(o&&(r=r.negated()),r.isZero())throw new Error("Root must be non-zero");if(t.isNegative()&&!r.abs().mod(2).equals(1))throw new Error("Root must be odd when a is negative.");if(t.isZero())return n;if(!t.isFinite())return o?n:t;var a=i,s=0,u=100;do{var c=a,f=t.div(a.pow(r.minus(1))).minus(a).div(r);a=a.plus(f),s++}while(!a.equals(c)&&u>s);return o?i.div(a):a}var s=n(r(2)),u=o("nthRoot",{number:function(e){return i(e,2)},"number, number":i,BigNumber:function(t){return a(t,new e.BigNumber(2))},"BigNumber, BigNumber":a,"Array | Matrix":function(e){return s.deepMap(e,u)},"Array | Matrix, any":function(e,t){return s.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}function i(e,t){var r=0>t;if(r&&(t=-t),0===t)throw new Error("Root must be non-zero");if(0>e&&Math.abs(t)%2!=1)throw new Error("Root must be odd when a is negative.");if(0==e)return 0;if(!Number.isFinite(e))return r?0:e;var n=1e-16,i=1,o=0,a=100;do{var s=(e/Math.pow(i,t-1)-i)/t;i+=s,o++}while(Math.abs(s)>n&&a>o);return r?1/i:i}t.name="nthRoot",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){function s(e,t){return f(m(p(e),t))}function u(e,t){if(!i(t)||0>t)throw new TypeError("For A^b, b must be a positive integer (value is "+t+")");var r=o(e);if(2!=r.length)throw new Error("For A^b, A must be 2 dimensional (A has "+r.length+" dimensions)");if(r[0]!=r[1])throw new Error("For A^b, A must be square (size is "+r[0]+"x"+r[1]+")");for(var n=l(r[0]).valueOf(),a=e;t>=1;)1==(1&t)&&(n=m(a,n)),t>>=1,a=m(a,a);return n}function c(e,t){return h(u(e.valueOf(),t))}var f=(n(r(2)),n(r(39))),l=n(r(94)),p=n(r(44)),m=n(r(47)),h=n(r(75)),g=a("pow",{"number, number":function(t,r){return i(r)||t>=0?Math.pow(t,r):s(new e.Complex(t,0),new e.Complex(r,0))},"BigNumber, BigNumber":function(t,r){return i(r)||t>=0?t.pow(r):s(new e.Complex(t.toNumber(),0),new e.Complex(r.toNumber(),0))},"Complex, Complex":s,"Array, number":u,"Array, BigNumber":function(e,t){return u(e,t.toNumber())},"Matrix, number":c,"Matrix, BigNumber":function(e,t){return c(e,t.toNumber())}});return g}var i=r(175).isInteger,o=r(172).size;t.name="pow",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("round",{number:Math.round,"number, number":function(e,t){if(!o(t))throw new TypeError("Number of decimals in function round must be an integer");if(0>t||t>15)throw new Error("Number of decimals in function round must be in te range of 0-15");return i(e,t)},Complex:function(t){return new e.Complex(Math.round(t.re),Math.round(t.im))},"Complex, number":function(t,r){return new e.Complex(i(t.re,r),i(t.im,r))},"Complex, BigNumber":function(t,r){var n=r.toNumber();return new e.Complex(i(t.re,n),i(t.im,n))},BigNumber:function(e){return e.toDecimalPlaces(0)},"BigNumber, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError("Number of decimals in function round must be an integer");return e.toDecimalPlaces(t.toNumber())},"Array | Matrix":function(e){return s.deepMap(e,u,!0)},"Array | Matrix, number | BigNumber":function(e,t){return s.deepMap2(e,t,u)},"number | Complex | BigNumber, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}function i(e,t){return parseFloat(a(e,t))}var o=r(175).isInteger,a=r(175).toFixed;t.name="round",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("sign",{number:i.sign,Complex:function(e){var t=Math.sqrt(e.re*e.re+e.im*e.im);return new e.constructor(e.re/t,e.im/t)},BigNumber:function(e){return new e.constructor(e.cmp(0))},"Array | Matrix":function(e){return a.deepMap(e,s,!0)}});return s}var i=r(175);t.name="sign",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(t){return t>=0?Math.sqrt(t):a(new e.Complex(t,0))}function a(t){var r,n,i=Math.sqrt(t.re*t.re+t.im*t.im);return r=t.re>=0?.5*Math.sqrt(2*(i+t.re)):Math.abs(t.im)/Math.sqrt(2*(i-t.re)),n=t.re<=0?.5*Math.sqrt(2*(i-t.re)):Math.abs(t.im)/Math.sqrt(2*(i+t.re)),t.im>=0?new e.Complex(r,n):new e.Complex(r,-n)}var s=n(r(2)),u=i("sqrt",{number:o,Complex:a,BigNumber:function(e){return e.isNegative()?o(e.toNumber()):e.sqrt()},"Array | Matrix":function(e){return s.deepMap(e,u,!0)}});return u}t.name="sqrt",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("square",{number:function(e){return e*e},Complex:function(e){return new e.constructor(e.re*e.re-e.im*e.im,e.re*e.im+e.im*e.re)},BigNumber:function(e){return e.times(e)},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="square",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(56)),u=n(r(75)),c=n(r(115)),f=n(r(210)),l=n(r(2)),p=e.DenseMatrix,m=e.SparseMatrix,h=a("subtract",{"number, number":function(e,t){return e-t},"Complex, Complex":function(t,r){return new e.Complex(t.re-r.re,t.im-r.im)},"BigNumber, BigNumber":function(e,t){return e.minus(t)},"Unit, Unit":function(e,t){if(null==e.value)throw new Error("Parameter x contains a unit with undefined value");if(null==t.value)throw new Error("Parameter y contains a unit with undefined value");if(!e.equalBase(t))throw new Error("Units do not match");var r=e.clone();return r.value-=t.value,r.fixPrefix=!1,r},"Matrix, Matrix":function(e,t){var r=e.size(),n=t.size();if(r.length!==n.length)throw new o(r.length,n.length);var i;switch(e.storage()){case"sparse":switch(t.storage()){case"sparse":i=d(e,t,r,n);break;default:i=x(e,t.valueOf(),r,n)}break;default:switch(t.storage()){case"sparse":i=y(e.valueOf(),t,r,n);break;default:i=w(e.valueOf(),t.valueOf(),e.storage())}}return i},"Array, Array":function(e,t){return h(u(e),u(t)).valueOf()},"Array, Matrix":function(e,t){return h(u(e),t)},"Matrix, Array":function(e,t){return h(e,u(t))},"Matrix, any":function(e,t){var r;switch(e.storage()){case"sparse":r=g(e,t,e.size());break;default:r=l.deepMap2(e,t,h)}return r},"any, Matrix":function(e,t){var r;switch(t.storage()){case"sparse":r=v(e,t,t.size());break;default:r=l.deepMap2(e,t,h)}return r},"Array, any":function(e,t){return l.deepMap2(e,t,h)},"any, Array":function(e,t){return l.deepMap2(e,t,h)}}),g=function(e,t,r){var n=r[0],i=r[1],o=e._values,a=e._index,s=e._ptr;if(!c(t,0)){for(var u=[],f=[],l=new Array(i),p=new m({values:u,index:f,ptr:l,size:[n,i]}),g=0;i>g;g++){l[g]=f.length;for(var v=s[g],d=s[g+1],x=v;d>x;x++){var y=h(o[x],t);c(y,0)||(f.push(a[x]),u.push(y))}}return l[i]=f.length,p}return e.clone()},v=function(e,t,r){var n=r[0],i=r[1],o=t._values,a=t._index,s=t._ptr;if(!c(e,0)){for(var u=[],f=[],l=new Array(i),p=new m({values:u,index:f,ptr:l,size:[n,i]}),g=0;i>g;g++){l[g]=f.length;for(var v=s[g],d=s[g+1],x=v;d>x;x++){var y=h(e,o[x]);c(y,0)||(f.push(a[x]),u.push(y))}}return l[i]=f.length,p}return t.clone()},d=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var i=r[0],o=r[1],a=e._values,s=t._values,u=a&&s,c=u?[]:void 0,l=[],p=new Array(o),h=new m({values:c,index:l,ptr:p,size:[i,o]}),g=u?new Array(i):void 0,v=new Array(i),d=0;o>d;d++)if(p[d]=l.length,f(e,d,1,v,g,d+1,h),f(t,d,-1,v,g,d+1,h),u)for(var x=p[d],y=l.length,w=x;y>w;w++)c.push(g[l[w]]);return p[o]=l.length,h},x=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var i=r[0],o=r[1],a=t,u=[],l=[],p=new Array(o),h=new m({values:u,index:l,ptr:p,size:[i,o]}),g=new Array(i),v=new Array(i),d=0;o>d;d++){p[d]=l.length;for(var x=0;i>x;x++){var y=s(a[x][d]);c(y,0)||(g[x]=y,v[x]=d+1,l.push(x))}f(e,d,1,v,g,d+1,h);for(var w=p[d],b=l.length,N=w;b>N;N++)u.push(g[l[N]])}return p[o]=l.length,h},y=function(e,t,r,n){if(r[0]!==n[0]||r[1]!==n[1])throw new RangeError("Dimension mismatch in add. Matrix A ("+r+") must match Matrix B ("+n+")");for(var o=r[0],a=r[1],s=e,u=t._values,c=t._index,f=t._ptr,l=i(s),m=new p({data:l,size:[o,a]}),g=0;a>g;g++)for(var v=f[g],d=f[g+1],x=v;d>x;x++){var y=c[x];l[y][g]=h(l[y][g],u[x])}return m},w=function(e,t,r){return u(l.deepMap2(e,t,h),r)};return h}var i=r(166).clone,o=r(174);t.name="subtract",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("unaryMinus",{number:function(e){return-e},Complex:function(e){return new e.constructor(-e.re,-e.im)},BigNumber:function(e){return e.neg()},Unit:function(e){var t=e.clone();return t.value=-e.value,t},"Array | Matrix":function(e){return o.deepMap(e,a,!0)}});return a}t.name="unaryMinus",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("unaryPlus",{number:function(e){return e},Complex:function(e){return e.clone()},BigNumber:function(e){return e},Unit:function(e){return e.clone()},"Array | Matrix":function(e){return o.deepMap(e,a,!0)},"boolean | string | null":function(r){return"bignumber"==t.number?new e.BigNumber(+r):+r}});return a}t.name="unaryPlus",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e,r){var n,o,a,s=0,c=1,f=1,l=0;if(!i(e)||!i(r))throw new Error("Parameters in function xgcd must be integer numbers");for(;r;)o=Math.floor(e/r),a=e%r,n=s,s=c-o*s,c=n,n=f,f=l-o*f,l=n,e=r,r=a;var p;return p=0>e?[-e,-c,-l]:[e,e?c:0,l],"array"===t.matrix?p:u(p)}function s(r,n){var i,o,a,s=new e.BigNumber(0),c=new e.BigNumber(0),f=new e.BigNumber(1),l=new e.BigNumber(1),p=new e.BigNumber(0);if(!r.isInt()||!n.isInt())throw new Error("Parameters in function xgcd must be integer numbers");for(;!n.isZero();)o=r.div(n).floor(),a=r.mod(n),i=c,c=f.minus(o.times(c)),f=i,i=l,l=p.minus(o.times(l)),p=i,r=n,n=a;var m;return m=r.lt(s)?[r.neg(),f.neg(),p.neg()]:[r,r.isZero()?0:f,p],"array"===t.matrix?m:u(m)}var u=(n(r(2)),n(r(75)));return o("xgcd",{"number, number":a,"BigNumber, BigNumber":s})}var i=r(175).isInteger;t.name="xgcd",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("bitAnd",{"number, number":function(e,t){if(!i(e)||!i(t))throw new Error("Integers expected in function bitAnd");return e&t},"BigNumber, BigNumber":o,"Array | Matrix, any":function(e,t){return s.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}var i=r(175).isInteger,o=r(214).and;t.name="bitAnd",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("bitNot",{number:function(e){if(!i(e))throw new Error("Integer expected in function bitNot");return~e},BigNumber:o,"Array | Matrix":function(e){return s.deepMap(e,u)}});return u}var i=r(175).isInteger,o=r(214).not;t.name="bitNot",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("bitOr",{"number, number":function(e,t){if(!i(e)||!i(t))throw new Error("Integers expected in function bitOr");return e|t},"BigNumber, BigNumber":o,"Array | Matrix, any":function(e,t){return s.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}var i=r(175).isInteger,o=r(214).or;t.name="bitOr",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("bitXor",{"number, number":function(e,t){if(!i(e)||!i(t))throw new Error("Integers expected in function bitXor");return e^t},"BigNumber, BigNumber":o,"Array | Matrix, any":function(e,t){ +return s.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}var i=r(175).isInteger,o=r(214).xor;t.name="bitXor",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("leftShift",{"number, number":function(e,t){if(!i(e)||!i(t))throw new Error("Integers expected in function leftShift");return e<>t},"BigNumber, BigNumber":o,"Array | Matrix, any":function(e,t){return s.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return s.deepMap2(e,t,u)}});return u}var i=r(175).isInteger,o=r(214).rightArithShift;t.name="rightArithShift",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("rightLogShift",{"number, number":function(e,t){if(!i(e)||!i(t))throw new Error("Integers expected in function rightLogShift");return e>>>t},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).isInteger;t.name="rightLogShift",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("arg",{number:function(e){return Math.atan2(0,e)},Complex:function(e){return Math.atan2(e.im,e.re)},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="arg",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("conj",{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return new e.constructor(e.re,-e.im)},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="conj",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("re",{number:function(e){return e},BigNumber:function(e){return e},Complex:function(e){return e.re},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="re",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("im",{number:function(e){return 0},BigNumber:function(e){return new e.constructor(0)},Complex:function(e){return e.im},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="im",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("bignumber",{"":function(){return new e.BigNumber(0)},number:function(t){return new e.BigNumber(t+"")},string:function(t){return new e.BigNumber(t)},BigNumber:function(e){return e},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="bignumber",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("bool",{"":function(){return!1},"boolean":function(e){return e},number:function(e){return!!e},BigNumber:function(e){return!e.isZero()},string:function(e){var t=e.toLowerCase();if("true"===t)return!0;if("false"===t)return!1;var r=Number(e);if(""!=e&&!isNaN(r))return!!r;throw new Error('Cannot convert "'+e+'" to a boolean')},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="boolean",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("chain",{"":function(){return new e.Chain},any:function(t){return new e.Chain(t)}})}t.name="chain",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("complex",{"":function(){return new e.Complex(0,0)},number:function(t){return new e.Complex(t,0)},"number, number":function(t,r){return new e.Complex(t,r)},"BigNumber, BigNumber":function(t,r){return new e.Complex(t.toNumber(),r.toNumber())},Complex:function(e){return e.clone()},string:function(t){var r=e.Complex.parse(t);if(r)return r;throw new SyntaxError('String "'+t+'" is no valid complex number')},Object:function(t){if("re"in t&&"im"in t)return new e.Complex(t.re,t.im);if("r"in t&&"phi"in t)return e.Complex.fromPolar(t.r,t.phi);throw new Error("Expected object with either properties re and im, or properties r and phi.")},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="complex",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("index",{"...number | BigNumber | Range | Array":function(t){var r=t.map(function(t){return t instanceof e.BigNumber?t.toNumber():Array.isArray(t)?t.map(function(t){return t instanceof e.BigNumber?t.toNumber():t}):t}),n=new e.Index;return e.Index.apply(n,r),n}})}t.name="index",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){function i(t,r){var n=e.Matrix.storage(r||"default");return new n(t)}return n("matrix",{"":function(){return i([])},string:function(e){return i([],e)},Array:function(e){return i(e)},Matrix:function(e){return i(e,e.storage())},"Array | Matrix, string":i})}t.name="matrix",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("number",{"":function(){return 0},number:function(e){return e},string:function(e){var t=Number(e);if(isNaN(t))throw new SyntaxError('String "'+e+'" is no valid number');return t},BigNumber:function(e){return e.toNumber()},Unit:function(e){throw new Error("Second argument with valueless unit expected")},"Unit, string | Unit":function(e,t){return e.toNumber(t)},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="number",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i,o){var a=n(r(14));return i("parser",{"":function(){return new a(o)}})}t.name="parser",t.factory=n,t.math=!0},function(e,t,r){"use strict";function n(e,t,r,n){var i=e.SparseMatrix;return n("sparse",{"":function(){return new i([])},"Array | Matrix":function(e){return new i(e)}})}t.name="sparse",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("string",{"":function(){return""},number:i.format,"null":function(e){return"null"},"boolean":function(e){return e+""},"Array | Matrix":function(e){return a.deepMap(e,s)},any:function(e){return String(e)}});return s}var i=r(175);t.name="string",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("unit",{Unit:function(e){return e.clone()},string:function(t){if(e.Unit.isValuelessUnit(t))return new e.Unit(null,t);var r=e.Unit.parse(t);if(r)return r;throw new SyntaxError('String "'+t+'" is no valid unit')},"number, string":function(t,r){return new e.Unit(t,r)},"BigNumber, string":function(t,r){return new e.Unit(t.toNumber(),r)},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="unit",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i,o){var a=n(r(2)),s=n(r(13));return i("compile",{string:function(e){return s(e).compile(o)},"Array | Matrix":function(e){return a.deepMap(e,function(e){return s(e).compile(o)})}})}t.math=!0,t.name="compile",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i,o){var a=n(r(2)),s=n(r(13));return i("compile",{string:function(e){var t={};return s(e).compile(o).eval(t)},"string, Object":function(e,t){return s(e).compile(o).eval(t)},"Array | Matrix":function(e){var t={};return a.deepMap(e,function(e){return s(e).compile(o).eval(t)})},"Array | Matrix, Object":function(e,t){return a.deepMap(e,function(e){return s(e).compile(o).eval(t)})}})}t.math=!0,t.name="eval",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n,o){return n("help",{any:function(t){var r,n=t;if("string"!=typeof t)for(r in o)if(o.hasOwnProperty(r)&&t===o[r]){n=r;break}var a=i[n];if(!a)throw new Error('No documentation found on "'+n+'"');return new e.Help(a)}})}var i=r(16);t.math=!0,t.name="help",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(13));return i("parse",{"string | Array | Matrix":o,"string | Array | Matrix, Object":o})}t.name="parse",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("and",{"number, number":function(e,t){return!(!e||!t)},"Complex, Complex":function(e,t){return!(0===e.re&&0===e.im||0===t.re&&0===t.im)},"BigNumber, BigNumber":function(e,t){return!(e.isZero()||t.isZero()||e.isNaN()||t.isNaN())},"Unit, Unit":function(e,t){return 0!==e.value&&null!==e.value&&0!==t.value&&null!==t.value},"Array | Matrix, any":function(e,t){return o.deepMap2(e,t,a)},"any, Array | Matrix":function(e,t){return o.deepMap2(e,t,a)}});return a}t.name="and",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("not",{number:function(e){return!e},Complex:function(e){return 0===e.re&&0===e.im},BigNumber:function(e){return e.isZero()||e.isNaN()},Unit:function(e){return null===e.value||0==e.value},"Array | Matrix":function(e){return o.deepMap(e,a)}});return a}t.name="not",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("or",{"number, number":function(e,t){return!(!e&&!t)},"Complex, Complex":function(e,t){return 0!==e.re||0!==e.im||0!==t.re||0!==t.im},"BigNumber, BigNumber":function(e,t){return!e.isZero()&&!e.isNaN()||!t.isZero()&&!t.isNaN()},"Unit, Unit":function(e,t){return 0!==e.value&&null!==e.value||0!==t.value&&null!==t.value},"Array | Matrix, any":function(e,t){return o.deepMap2(e,t,a)},"any, Array | Matrix":function(e,t){return o.deepMap2(e,t,a)}});return a}t.name="or",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("xor",{"number, number":function(e,t){return!!(!!e^!!t)},"Complex, Complex":function(e,t){return!!((0!==e.re||0!==e.im)^(0!==t.re||0!==t.im))},"BigNumber, BigNumber":function(e,t){return!!((!e.isZero()&&!e.isNaN())^(!t.isZero()&&!t.isNaN()))},"Unit, Unit":function(e,t){return!!((0!==e.value&&null!==e.value)^(0!==t.value&&null!==t.value))},"Array | Matrix, any":function(e,t){return o.deepMap2(e,t,a)},"any, Array | Matrix":function(e,t){return o.deepMap2(e,t,a)}});return a}t.name="xor",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,f){var l=n(r(75));return f("concat",{"...Array | Matrix | number | BigNumber":function(t){var r,n,f=t.length,p=-1,m=!1,h=[];for(r=0;f>r;r++){var g=t[r];if(g instanceof e.Matrix&&(m=!0),"number"==typeof g||g instanceof e.BigNumber){if(r!==f-1)throw new Error("Dimension must be specified as last argument");if(n=p,p=g.valueOf(),!a(p))throw new TypeError("Integer number expected for dimension");if(0>p)throw new u(p);if(r>0&&p>n)throw new u(p,n+1)}else{var v=o(g).valueOf(),d=s.size(v);if(h[r]=v,n=p,p=d.length-1,r>0&&p!=n)throw new c(n+1,p+1)}}if(0==h.length)throw new SyntaxError("At least one matrix expected");for(var x=h.shift();h.length;)x=i(x,h.shift(),p,0);return m?l(x):x}})}function i(e,t,r,n){if(r>n){if(e.length!=t.length)throw new c(e.length,t.length);for(var o=[],a=0;ar;r++)n[t][r]=0;for(r=t+1;ra;a++)i=l(n(i),e);return t%2==0?p(i[0][0]):i[0][0]}var u=(n(r(2)),n(r(75))),c=n(r(32)),f=n(r(55)),l=n(r(47)),p=n(r(56));return i("det",{any:function(e){return o.clone(e)},"Array | Matrix":function(t){var r;switch(t instanceof e.Matrix?r=t.size():t instanceof Array?(t=u(t),r=t.size()):r=[],r.length){case 0:return o.clone(t);case 1:if(1==r[0])return o.clone(t.valueOf()[0]);throw new RangeError("Matrix must be square (size: "+a.format(r)+")");case 2:var n=r[0],i=r[1];if(n==i)return s(t.clone().valueOf(),n,i);throw new RangeError("Matrix must be square (size: "+a.format(r)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+a.format(r)+")")}}})}var i=r(171),o=i.object,a=i.string;t.name="det",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,s){function u(e,t,r,n){if(!a(t))throw new TypeError("Second parameter in function diag must be an integer");var i=t>0?t:0,o=0>t?-t:0;switch(r.length){case 1:return c(e,t,n,r[0],o,i);case 2:return f(e,t,n,r,o,i)}throw new RangeError("Matrix for function diag must be 2 dimensional")}function c(t,r,n,i,o,a){var s=[i+o,i+a],u=e.Matrix.storage(n||"dense"),c=u.diagonal(s,t,r);return null!==n?c:c.valueOf()}function f(t,r,n,i,a,s){if(t instanceof e.Matrix){var u=t.diagonal(r);return null!==n?n!==u.storage()?l(u,n):u:u.valueOf()}for(var c=Math.min(i[0]-a,i[1]-s),f=new Array(c),p=0;c>p;p++)f[p]=o(t[p+a][p+s]);return null!==n?l(f):f}var l=n(r(75));return s("diag",{Array:function(e){return u(e,0,i.size(e),null)},"Array, number":function(e,t){return u(e,t,i.size(e),null)},"Array, BigNumber":function(e,t){return u(e,t.toNumber(),i.size(e),null)},"Array, string":function(e,t){return u(e,0,i.size(e),t)},"Array, number, string":function(e,t,r){return u(e,t,i.size(e),r)},"Array, BigNumber, string":function(e,t,r){return u(e,t.toNumber(),i.size(e),r)},Matrix:function(e){return u(e,0,e.size(),e.storage())},"Matrix, number":function(e,t){return u(e,t,e.size(),e.storage())},"Matrix, BigNumber":function(e,t){return u(e,t.toNumber(),e.size(),e.storage())},"Matrix, string":function(e,t){return u(e,0,e.size(),t)},"Matrix, number, string":function(e,t,r){return u(e,t,e.size(),r)},"Matrix, BigNumber, string":function(e,t,r){return u(e,t.toNumber(),e.size(),r)}})}var i=r(172),o=r(166).clone,a=r(175).isInteger;t.name="diag",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e,t){var r=i(e),n=i(t),o=r[0];if(1!==r.length||1!==n.length)throw new RangeError("Vector expected");if(r[0]!=n[0])throw new RangeError("Vectors must have equal length ("+r[0]+" != "+n[0]+")");if(0==o)throw new RangeError("Cannot calculate the dot product of empty vectors");for(var a=0,c=0;o>c;c++)a=s(a,u(e[c],t[c]));return a}var s=n(r(32)),u=n(r(47));return o("dot",{"Matrix, Matrix":function(e,t){return a(e.toArray(),t.toArray())},"Matrix, Array":function(e,t){return a(e.toArray(),t)},"Array, Matrix":function(e,t){return a(e,t.toArray())},"Array, Array":a})}var i=r(172).size;t.name="dot",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){function s(e,t){switch(e.length){case 0:return t?c(t):[];case 1:return u(e[0],e[0],t);case 2:return u(e[0],e[1],t);default:throw new Error("Vector containing two values expected")}}function u(t,r,n){var a=t instanceof e.BigNumber?t.constructor:r instanceof e.BigNumber?r.constructor:null;if(t instanceof e.BigNumber&&(t=t.toNumber()),r instanceof e.BigNumber&&(r=r.toNumber()),!o(t)||1>t)throw new Error("Parameters in function eye must be positive integers");if(!o(r)||1>r)throw new Error("Parameters in function eye must be positive integers");var s=a?new e.BigNumber(1):1,u=a?new a(0):0,c=[t,r];if(n){var f=e.Matrix.storage(n);return f.diagonal(c,s,0,u)}for(var l=i.resize([],c,u),p=r>t?t:r,m=0;p>m;m++)l[m][m]=s;return l}var c=n(r(75));return a("eye",{"":function(){return"matrix"===t.matrix?c([]):[]},string:function(e){return c(e)},"number | BigNumber":function(e){return u(e,e,"matrix"===t.matrix?"default":void 0)},"number | BigNumber, string":function(e,t){return u(e,e,t)},"number | BigNumber, number | BigNumber":function(e,r){return u(e,r,"matrix"===t.matrix?"default":void 0)},"number | BigNumber, number | BigNumber, string":function(e,t,r){return u(e,t,r)},Array:function(e){return s(e)},"Array, string":function(e,t){return s(e,t)},Matrix:function(e){return s(e.valueOf(),e.storage())},"Matrix, string":function(e,t){return s(e.valueOf(),t)}})}var i=r(172),o=r(175).isInteger;t.name="eye",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(75));return a("flatten",{Array:function(e){return o(i(e))},Matrix:function(e){var t=o(i(e.toArray()));return s(t)}})}var i=r(166).clone,o=r(172).flatten;t.name="flatten",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e,t,r){var n,i,o,a,s;if(1==t){if(a=e[0][0],0==a)throw Error("Cannot calculate inverse, determinant is zero");return[[u(1,a)]]}if(2==t){var h=p(e);if(0==h)throw Error("Cannot calculate inverse, determinant is zero");return[[u(e[1][1],h),u(l(e[0][1]),h)],[u(l(e[1][0]),h),u(e[0][0],h)]]}var g=e.concat();for(n=0;t>n;n++)g[n]=g[n].concat();for(var v=m(t).valueOf(),d=0;r>d;d++){for(n=d;t>n&&0==g[n][d];)n++;if(n==t||0==g[n][d])throw Error("Cannot calculate inverse, determinant is zero");n!=d&&(s=g[d],g[d]=g[n],g[n]=s,s=v[d],v[d]=v[n],v[n]=s);var x=g[d],y=v[d];for(n=0;t>n;n++){var w=g[n],b=v[n];if(n!=d){if(0!=w[d]){for(o=u(l(w[d]),x[d]),i=d;r>i;i++)w[i]=c(w[i],f(o,x[i]));for(i=0;r>i;i++)b[i]=c(b[i],f(o,y[i]))}}else{for(o=x[d],i=d;r>i;i++)w[i]=u(w[i],o);for(i=0;r>i;i++)b[i]=u(b[i],o)}}}return v}var s=(n(r(2)),n(r(75))),u=n(r(213)),c=n(r(32)),f=n(r(47)),l=n(r(56)),p=n(r(91)),m=n(r(94)),h=o("inv",{"Array | Matrix":function(t){var r=t instanceof e.Matrix?t.size():i.array.size(t);switch(r.length){case 1:if(1==r[0])return t instanceof e.Matrix?s([u(1,t.valueOf()[0])]):[u(1,t[0])];throw new RangeError("Matrix must be square (size: "+i.string.format(r)+")");case 2:var n=r[0],o=r[1];if(n==o)return t instanceof e.Matrix?s(a(t.valueOf(),n,o),t.storage()):a(t,n,o);throw new RangeError("Matrix must be square (size: "+i.string.format(r)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+i.string.format(r)+")")}},any:function(e){return u(1,e)}});return h}var i=r(171);t.name="inv",t.factory=n},function(e,t,r){"use strict";e.exports=function(e,t){var n=r(171),i=e.type.BigNumber,o=e.type.Matrix,a=e.collection,s=n.array,u=n.number.isNumber,c=n.number.isInteger,f=n.string.isString,l=Array.isArray;e.ones=function(r,n){var p,m=a.argsToArray(arguments);m.length>0&&f(m[m.length-1])?(p=m[m.length-1],m=a.argsToArray(m.slice(0,m.length-1))):r instanceof o?p=r.storage():l(r)||"matrix"!==t.matrix||(p="default");var h=!1;m=m.map(function(e){if(e instanceof i&&(h=!0,e=e.toNumber()),!u(e)||!c(e)||0>e)throw new Error("Parameters in function eye must be positive integers");return e});var g=h?new i(1):1;if(p){var v=e.matrix(p);return m.length>0?v.resize(m,g):v}var d=[];return m.length>0?s.resize(d,m,g):d}}},function(e,t,r){"use strict";e.exports=function(e,t){function n(e,t,r){var n=[],i=e;if(r>0)for(;t>i;)n.push(i),i+=r;else if(0>r)for(;i>t;)n.push(i),i+=r;return n}function i(e,t,r){var n=[],i=e;if(r>0)for(;t>=i;)n.push(i),i+=r;else if(0>r)for(;i>=t;)n.push(i),i+=r;return n}function o(e,t,r){var n=[],i=e,o=new c(0);if(r.gt(o))for(;i.lt(t);)n.push(i),i=i.plus(r);else if(r.lt(o))for(;i.gt(t);)n.push(i),i=i.plus(r);return n}function a(e,t,r){var n=[],i=e,o=new c(0);if(r.gt(o))for(;i.lte(t);)n.push(i),i=i.plus(r);else if(r.lt(o))for(;i.gte(t);)n.push(i),i=i.plus(r);return n}function s(e){var r=e.split(":"),n=null;if("bignumber"===t.number)try{n=r.map(function(e){return new c(e)})}catch(i){return null}else{n=r.map(function(e){return Number(e)});var o=n.some(function(e){return isNaN(e)});if(o)return null}switch(n.length){case 2:return{start:n[0],end:n[1],step:1};case 3:return{start:n[0],end:n[2],step:n[1]};default:return null}}var u=r(171),c=e.type.BigNumber,f=(e.type.Matrix,e.collection,u["boolean"].isBoolean),l=u.string.isString,p=u.number.isNumber;e.range=function(r){var u,m,h,g=Array.prototype.slice.call(arguments),v=!1;switch(f(g[g.length-1])&&(v=g.pop()?!0:!1),g.length){case 1:if(!l(g[0]))throw new TypeError("Two or three numbers or a single string expected in function range");var d=s(g[0]);if(!d)throw new SyntaxError('String "'+g[0]+'" is no valid range');u=d.start,m=d.end,h=d.step;break;case 2:u=g[0],m=g[1],h=1;break;case 3:u=g[0],m=g[1],h=g[2];break;case 4:throw new TypeError("Parameter includeEnd must be a boolean");default:throw new e.error.ArgumentsError("range",arguments.length,2,4)}if(!(p(u)||u instanceof c))throw new TypeError("Parameter start must be a number");if(!(p(m)||m instanceof c))throw new TypeError("Parameter end must be a number");if(!(p(h)||h instanceof c))throw new TypeError("Parameter step must be a number");if(u instanceof c||m instanceof c||h instanceof c){var x=!0;u instanceof c||(u=c.convert(u)),m instanceof c||(m=c.convert(m)),h instanceof c||(h=c.convert(h)),u instanceof c&&m instanceof c&&h instanceof c||(x=!1,u instanceof c&&(u=u.toNumber()),m instanceof c&&(m=m.toNumber()),h instanceof c&&(h=h.toNumber()))}var y=x?v?a:o:v?i:n,w=y(u,m,h);return"array"===t.matrix?w:e.matrix(w)}}},function(e,t,r){"use strict";e.exports=function(e,t){function n(t,r,n){if(void 0!==n){if(!f(n)||1!==n.length)throw new TypeError("Single character expected as defaultValue")}else n=" ";if(1!==r.length)throw new e.error.DimensionError(r.length,1);var i=r[0];if(!l(i)||!p(i))throw new TypeError("Invalid size, must contain positive integers (size: "+c.format(r)+")");if(t.length>i)return t.substring(0,i);if(t.lengtha;a++)o+=n;return o}return t}var i=r(171),o=e.type.BigNumber,a=e.type.Matrix,s=i.array,u=i.object.clone,c=i.string,f=i.string.isString,l=i.number.isNumber,p=i.number.isInteger,m=s.isArray;e.resize=function(r,i,c){if(2!=arguments.length&&3!=arguments.length)throw new e.error.ArgumentsError("resize",arguments.length,2,3);if(i instanceof a&&(i=i.valueOf()),i.length&&i[0]instanceof o&&(i=i.map(function(e){return e instanceof o?e.toNumber():e})),r instanceof a)return r.resize(i,c,!0);if(f(r))return n(r,i,c);var l=m(r)?!1:"array"!==t.matrix;if(0==i.length){for(;m(r);)r=r[0];return u(r)}m(r)||(r=[r]),r=u(r);var p=s.resize(r,i,c);return l?e.matrix(p):p}}},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(75));return o("size",{Matrix:function(e){return a(e.size())},Array:i.size,string:function(e){return"array"===t.matrix?[e.length]:a([e.length])},"number | Complex | BigNumber | Unit | boolean | null":function(e){return"array"===t.matrix?[]:a([])}})}var i=r(172);t.name="size",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(75));return a("squeeze",{Array:function(e){return o.squeeze(i.clone(e))},Matrix:function(e){var t=o.squeeze(e.toArray());return Array.isArray(t)?s(t):t},any:function(e){return i.clone(e)}})}var i=r(166),o=r(172);t.name="squeeze",t.factory=n},function(e,t,r){"use strict";e.exports=function(e,t){function n(t,r){var n,o;if(p(t))return n=e.matrix(t),o=n.subset(r),o&&o.valueOf();if(t instanceof u)return t.subset(r);if(l(t))return i(t,r);throw new e.error.UnsupportedTypeError("subset",e["typeof"](t))}function i(t,r){if(!(r instanceof c))throw new TypeError("Index expected");if(1!=r.size().length)throw new e.error.DimensionError(r.size().length,1);var n=t.length;f.validateIndex(r.min()[0],n),f.validateIndex(r.max()[0],n);var i=r.range(0),o="";return i.forEach(function(e){o+=t.charAt(e)}),o}function o(t,r,n,i){var o;if(p(t))return o=e.matrix(e.clone(t)),o.subset(r,n,i),o.valueOf();if(t instanceof u)return t.clone().subset(r,n,i);if(l(t))return a(t,r,n,i);throw new e.error.UnsupportedTypeError("subset",e["typeof"](t))}function a(t,r,n,i){if(!(r instanceof c))throw new TypeError("Index expected");if(1!=r.size().length)throw new e.error.DimensionError(r.size().length,1);if(void 0!==i){if(!l(i)||1!==i.length)throw new TypeError("Single character expected as defaultValue")}else i=" ";var o=r.range(0),a=o.size()[0];if(a!=n.length)throw new e.error.DimensionError(o.size()[0],n.length);var s=t.length;f.validateIndex(r.min()[0]),f.validateIndex(r.max()[0]);for(var u=[],p=0;s>p;p++)u[p]=t.charAt(p);if(o.forEach(function(e,t){u[e]=n.charAt(t)}),u.length>s)for(p=s-1,a=u.length;a>p;p++)u[p]||(u[p]=i);return u.join("")}var s=r(171),u=e.type.Matrix,c=r(5),f=s.array,l=s.string.isString,p=Array.isArray;e.subset=function(t,r,i,a){switch(arguments.length){case 2:return n(arguments[0],arguments[1]);case 3:case 4:return o(arguments[0],arguments[1],arguments[2],arguments[3]);default:throw new e.error.ArgumentsError("subset",arguments.length,2,4)}}}},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(75)),u=n(r(32)),c=a("trace",{Array:function(e){return c(s(e))},Matrix:function(e){var t;switch(e.storage()){case"dense":t=f(e);break;case"sparse":t=l(e)}return t},any:i}),f=function(e){var t=e._size,r=e._data;switch(t.length){case 1:if(1==t[0])return i(r[0]);throw new RangeError("Matrix must be square (size: "+o(t)+")");case 2:var n=t[0],a=t[1];if(n===a){for(var s=0,c=0;n>c;c++)s=u(s,r[c][c]);return s}throw new RangeError("Matrix must be square (size: "+o(t)+")");default:throw new RangeError("Matrix must be two dimensional (size: "+o(t)+")")}},l=function(e){var t=e._values,r=e._index,n=e._ptr,i=e._size,a=i[0],s=i[1];if(a===s){var c=0;if(t.length>0)for(var f=0;s>f;f++)for(var l=n[f],p=n[f+1],m=l;p>m;m++){var h=r[m];if(h===f){c=u(c,t[m]);break}if(h>f)break}return c}throw new RangeError("Matrix must be square (size: "+o(i)+")")};return c}var i=r(166).clone,o=r(176).format;t.name="trace",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(75)),u=e.DenseMatrix,c=e.SparseMatrix,f=a("transpose",{Array:function(e){return f(s(e)).valueOf()},Matrix:function(e){var t,r=e.size();switch(r.length){case 1:t=e.clone();break;case 2:var n=r[0],i=r[1];if(0===i)throw new RangeError("Cannot transpose a 2D matrix with no columns (size: "+o(r)+")");switch(e.storage()){case"dense":t=l(e,n,i);break;case"sparse":t=p(e,n,i)}break;default:throw new RangeError("Matrix must be a vector or two dimensional (size: "+o(this._size)+")")}return t},any:function(e){return i(e)}}),l=function(e,t,r){for(var n,o=e._data,a=[],s=0;r>s;s++){n=a[s]=[];for(var c=0;t>c;c++)n[c]=i(o[c][s])}return new u({data:a,size:[r,t]})},p=function(e,t,r){for(var n=e._values,o=e._index,a=e._ptr,s=[],u=[],f=[],l=new Array(t),p=0;t>p;p++)l[p]=0;var m,h,g;for(m=0,h=o.length;h>m;m++)l[o[m]]++;for(var v=0,d=0;t>d;d++)f.push(v),v+=l[d],l[d]=f[d];for(f.push(v),g=0;r>g;g++)for(var x=a[g],y=a[g+1],w=x;y>w;w++){var b=l[o[w]]++;u[b]=g,s[b]=i(n[w])}return new c({values:s,index:u,ptr:f,size:[r,t]})};return f}var i=r(166).clone,o=r(176).format;t.name="transpose",t.factory=n},function(e,t,r){"use strict";e.exports=function(e,t){var n=r(171),i=e.type.BigNumber,o=e.type.Matrix,a=e.collection,s=n.array,u=n.number.isNumber,c=n.number.isInteger,f=n.string.isString,l=Array.isArray;e.zeros=function(r){var n,p=a.argsToArray(arguments);p.length>0&&f(p[p.length-1])?(n=p[p.length-1],p=a.argsToArray(p.slice(0,p.length-1))):r instanceof o?n=r.storage():l(r)||"matrix"!==t.matrix||(n="default");var m=!1;p=p.map(function(e){if(e instanceof i&&(m=!0,e=e.toNumber()),!u(e)||!c(e)||0>e)throw new Error("Parameters in function eye must be positive integers");return e});var h=m?new i(0):0;if(n){var g=e.matrix(n);return p.length>0?g.resize(p,h):g}var v=[];return p.length>0?s.resize(v,p,h):v}}},function(e,t,r){"use strict";function n(e,t,r,n){return n("combinations",{"number, number":function(e,t){var r,n,i;if(!o(e)||0>e)throw new TypeError("Positive integer value expected in function combinations");if(t>e)throw new TypeError("k must be less than or equal to n");for(r=Math.max(t,e-t),n=1,i=1;e-r>=i;i++)n=n*(r+i)/i;return n},"BigNumber, BigNumber":function(t,r){var n,o,a,s,u=new e.BigNumber(1);if(!i(t)||!i(r))throw new TypeError("Positive integer value expected in function combinations");if(r.gt(t))throw new TypeError("k must be less than n in function combinations");for(n=t.minus(r),r.lt(n)&&(n=r),o=u,a=u,s=t.minus(n);a.lte(s);a=a.plus(1))o=o.times(n.plus(a)).dividedBy(a);return o}})}function i(e){return e.isInteger()&&e.gte(0)}var o=r(175).isInteger;t.name="combinations",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=n(r(108)),u=o("factorial",{number:function(e){return e===Number.POSITIVE_INFINITY?Math.sqrt(2*Math.PI):s(e+1)},BigNumber:function(e){return e.isFinite()||e.isNegative()?s(e.plus(1)):i.tau(t.precision).sqrt()},"Array | Matrix":function(e){return a.deepMap(e,u)}});return u}var i=r(214);t.name="factorial",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,c){function f(r){var n,i,o,a=r.toNumber();if(ap;++p)o[p]=i=i.times(n),n=n.plus(l);return o[a]=i.times(n),new e.BigNumber(o[a].toPrecision(t.precision))}var l=n(r(2)),p=n(r(47)),m=n(r(50)),h=c("gamma",{number:function(e){var t,r;if(i(e)){if(0>=e)return isFinite(e)?1/0:0/0;if(e>171)return 1/0;for(var n=e-2,s=e-1;n>1;)s*=n,n--;return 0==s&&(s=1),s}if(.5>e)return Math.PI/(Math.sin(Math.PI*e)*h(1-e));if(e>=171.35)return 1/0;if(e>85){var u=e*e,c=u*e,f=c*e,l=f*e;return Math.sqrt(2*Math.PI/e)*Math.pow(e/Math.E,e)*(1+1/(12*e)+1/(288*u)-139/(51840*c)-571/(2488320*f)+163879/(209018880*l)+5246819/(75246796800*l*e))}--e,r=a[0];for(var p=1;pe)throw new TypeError("Positive integer value expected in function permutations");if(!o(t)||0>t)throw new TypeError("Positive integer value expected in function permutations");if(t>e)throw new TypeError("second argument k must be less than or equal to first argument n");for(r=1,n=e-t+1;e>=n;n++)r*=n;return r},"BigNumber, BigNumber":function(t,r){var n,o;if(!i(t)||!i(r))throw new TypeError("Positive integer value expected in function permutations");if(r.gt(t))throw new TypeError("second argument k must be less than or equal to first argument n");for(n=new e.BigNumber(1),o=t.minus(r).plus(1);o.lte(t);o=o.plus(1))n=n.times(o);return n}})}function i(e){return e.isInteger()&&e.gte(0)}var o=r(175).isInteger;t.name="permutations",t.factory=n; + +},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(215));return o("uniform").pickRandom}t.name="pickRandom",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(215));return o("uniform").random}t.name="random",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(215));return o("uniform").randomInt}t.name="randomInt",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("compare",{"boolean, boolean":function(e,t){return e===t?0:e>t?1:-1},"number, number":function(e,r){return e===r||i(e,r,t.epsilon)?0:e>r?1:-1},"BigNumber, BigNumber":function(e,t){return new e.constructor(e.cmp(t))},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.value===r.value||i(e.value,r.value,t.epsilon)?0:e.value>r.value?1:-1},"string, string":function(e,t){return e===t?0:e>t?1:-1},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).nearlyEqual;t.name="compare",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){if(Array.isArray(e)){if(Array.isArray(t)){var r=e.length;if(r!==t.length)return!1;for(var n=0;r>n;n++)if(!o(e[n],t[n]))return!1;return!0}return!1}return Array.isArray(t)?!1:a(e,t)}var a=(n(r(2)),n(r(115)));return i("deepEqual",{"any, any":function(e,t){return o(e.valueOf(),t.valueOf())}})}t.name="deepEqual",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("equal",{"any, any":function(e,t){return null===e?null===t:null===t?null===e:void 0===e?void 0===t:void 0===t?void 0===e:u(e,t)},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,u)}}),u=o("_equal",{"boolean, boolean":function(e,t){return e===t},"number, number":function(e,r){return e===r||i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return e.eq(t)},"Complex, Complex":function(e,r){return(e.re===r.re||i(e.re,r.re,t.epsilon))&&(e.im===r.im||i(e.im,r.im,t.epsilon))},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.value===r.value||i(e.value,r.value,t.epsilon)},"string, string":function(e,t){return e===t}});return s}var i=r(175).nearlyEqual;t.name="equal",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("larger",{"boolean, boolean":function(e,t){return e>t},"number, number":function(e,r){return e>r&&!i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gt(t)},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.value>r.value&&!i(e.value,r.value,t.epsilon)},"string, string":function(e,t){return e>t},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).nearlyEqual;t.name="larger",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("largerEq",{"boolean, boolean":function(e,t){return e>=t},"number, number":function(e,r){return e>=r||i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return e.gte(t)},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.value>=r.value||i(e.value,r.value,t.epsilon)},"string, string":function(e,t){return e>=t},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).nearlyEqual;t.name="largerEq",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("smaller",{"boolean, boolean":function(e,t){return t>e},"number, number":function(e,r){return r>e&&!i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lt(t)},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.valuee},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).nearlyEqual;t.name="smaller",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("smallerEq",{"boolean, boolean":function(e,t){return t>=e},"number, number":function(e,r){return r>=e||i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return e.lte(t)},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return e.value<=r.value||i(e.value,r.value,t.epsilon)},"string, string":function(e,t){return t>=e},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(175).nearlyEqual;t.name="smallerEq",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("unequal",{"any, any":function(e,t){return null===e?null!==t:null===t?null!==e:void 0===e?void 0!==t:void 0===t?void 0!==e:u(e,t)},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,u)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,u)}}),u=o("_unequal",{"boolean, boolean":function(e,t){return e!==t},"number, number":function(e,r){return!i(e,r,t.epsilon)},"BigNumber, BigNumber":function(e,t){return!e.eq(t)},"Complex, Complex":function(e,r){return!i(e.re,r.re,t.epsilon)||!i(e.im,r.im,t.epsilon)},"Unit, Unit":function(e,r){if(!e.equalBase(r))throw new Error("Cannot compare units with different base");return!i(e.value,r.value,t.epsilon)},"string, string":function(e,t){return e!==t}});return s}var i=r(175).nearlyEqual;t.name="unequal",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){return u(e,t)?e:t}function a(e){var t=void 0;if(s.deepForEach(e,function(e){(void 0===t||u(e,t))&&(t=e)}),void 0===t)throw new Error("Cannot calculate max of an empty array");return t}var s=n(r(2)),u=n(r(116));return i("max",{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){return s.reduce(e,t.valueOf(),o)},"...":function(){return a(arguments)}})}t.name="max",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e,t){var r=u.reduce(e,t,c),n=Array.isArray(e)?i(e):e.size();return f(r,n[t])}function s(e){var t=0,r=0;if(u.deepForEach(e,function(e){t=c(t,e),r++}),0===r)throw new Error("Cannot calculate mean of an empty array");return f(t,r)}var u=n(r(2)),c=n(r(32)),f=n(r(35));return o("mean",{"Array | Matrix":s,"Array | Matrix, number | BigNumber":a,"...":function(){return s(arguments)}})}var i=r(172).size;t.name="mean",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e){var t=i(e.valueOf());t.sort(c);var r=t.length;if(0==r)throw new Error("Cannot calculate median of an empty array");return r%2==0?p(t[r/2-1],t[r/2]):l(t[(r-1)/2])}var s=n(r(32)),u=n(r(35)),c=n(r(113)),f=o("median",{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("median(A, dim) is not yet supported")},"...":function(){return a(Array.prototype.slice.call(arguments))}}),l=o("number | BigNumber | Unit",function(e){return e}),p=o("number | BigNumber | Unit, number | BigNumber | Unit",function(e,t){return u(s(e,t),2)});return f}var i=r(172).flatten;t.name="median",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){return u(e,t)?e:t}function a(e){var t=void 0;if(s.deepForEach(e,function(e){(void 0===t||u(e,t))&&(t=e)}),void 0===t)throw new Error("Cannot calculate min of an empty array");return t}var s=n(r(2)),u=n(r(118));return i("min",{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){return s.reduce(e,t.valueOf(),o)},"...":function(){return a(arguments)}})}t.name="min",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e){var t=void 0;if(a.deepForEach(e,function(e){t=void 0===t?e:s(t,e)}),void 0===t)throw new Error("Cannot calculate prod of an empty array");return t}var a=n(r(2)),s=n(r(47));return i("prod",{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("prod(A, dim) is not yet supported")},"...":function(){return o(arguments)}})}t.name="prod",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e,t){if(0==e.length)throw new SyntaxError("Function std requires one or more parameters (0 provided)");return a(s.apply(null,arguments))}var a=(n(r(2)),n(r(53))),s=n(r(128));return i("std",{"Array | Matrix":o,"Array | Matrix, string":o,"...":function(){return o(Array.prototype.slice.call(arguments))}})}t.name="std",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){function o(e){var t=void 0;if(a.deepForEach(e,function(e){t=void 0===t?e:s(t,e)}),void 0===t)throw new Error("Cannot calculate sum of an empty array");return t}var a=n(r(2)),s=n(r(32));return i("sum",{"Array | Matrix":function(e){return o(e)},"Array | Matrix, number | BigNumber":function(){throw new Error("sum(A, dim) is not yet supported")},"...":function(){return o(arguments)}})}t.name="sum",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t,r){var n=0,i=0;if(0==t.length)throw new SyntaxError("Function var requires one or more parameters (0 provided)");if(s.deepForEach(t,function(e){n=u(n,e),i++}),0===i)throw new Error("Cannot calculate var of an empty array");var o=l(n,i);switch(n=0,s.deepForEach(t,function(e){var t=c(e,o);n=u(n,f(t,t))}),r){case"uncorrected":return l(n,i);case"biased":return l(n,i+1);case"unbiased":var a=n instanceof e.BigNumber?new e.BigNumber(0):0;return 1==i?a:l(n,i-1);default:throw new Error('Unknown normalization "'+r+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}var s=n(r(2)),u=n(r(32)),c=n(r(55)),f=n(r(47)),l=n(r(35));return o("variance",{"Array | Matrix":function(e){return a(e,i)},"Array | Matrix, string":a,"...":function(){return a(arguments,i)}})}var i="unbiased";t.name="var",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){var r=new e.Complex(t.im*t.im-t.re*t.re+1,-2*t.re*t.im),n=u(r),i=new e.Complex(n.re-t.im,n.im+t.re),o=c(i);return new e.Complex(1.5707963267948966-o.im,o.re)}var s=n(r(2)),u=n(r(53)).signatures.Complex,c=n(r(44)).signatures.Complex,f=o("acos",{number:function(t){return t>=-1&&1>=t?Math.acos(t):a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!1)},"Array | Matrix":function(e){return s.deepMap(e,f)}});return f}var i=r(214).arccos_arcsec;t.name="acos",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e){var t,r=u(e);return r.im<=0?(t=r.re,r.re=-r.im,r.im=t):(t=r.im,r.im=-r.re,r.re=t),r}var s=n(r(2)),u=n(r(129)).signatures.Complex,c=o("acosh",{number:function(t){return t>=1?Math.log(Math.sqrt(t*t-1)+t):-1>=t?new e.Complex(Math.log(Math.sqrt(t*t-1)-t),Math.PI):a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!1,!1)},"Array | Matrix":function(e){return s.deepMap(e,c)}});return c}var i=r(214).acosh_asinh_asech_acsch;t.name="acosh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=n(r(139)).signatures.Complex,c=a("acot",{number:function(e){return e?Math.atan(1/e):o},Complex:function(t){if(0==t.im)return new e.Complex(t.re?Math.atan(1/t.re):o,0);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re=t.re/r,t.im=-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),u(t)},BigNumber:function(t){return i(t,e.BigNumber,!0)},"Array | Matrix":function(e){return s.deepMap(e,c)}});return c}var i=r(214).arctan_arccot,o=1.5707963267948966;t.name="acot",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){function s(t){if(0==t.re&&0==t.im)return new e.Complex(0,o);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re/r,-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),u(t)}var u=n(r(141)).signatures.Complex,c=n(r(2)),f=a("acoth",{number:function(t){return t>=1||-1>=t?isFinite(t)?(Math.log((t+1)/t)+Math.log(t/(t-1)))/2:0:0!==t?s(new e.Complex(t,0)):new e.Complex(0,o)},Complex:s,BigNumber:function(t){return i(t,e.BigNumber,!0)},"Array | Matrix":function(e){return c.deepMap(e,f)}});return f}var i=r(214).atanh_acoth,o=1.5707963267948966;t.name="acoth",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){function s(t){if(0==t.re&&0==t.im)return new e.Complex(o,1/0);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re=t.re/r,t.im=-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),c(t)}var u=n(r(2)),c=n(r(137)).signatures.Complex,f=a("acsc",{number:function(t){return-1>=t||t>=1?Math.asin(1/t):s(new e.Complex(t,0))},Complex:s,BigNumber:function(t){return i(t,e.BigNumber,!0)},"Array | Matrix":function(e){return u.deepMap(e,f)}});return f}var i=r(214).arcsin_arccsc,o=1.5707963267948966;t.name="acsc",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=n(r(138)).signatures.Complex,u=o("acsch",{number:function(e){return e=1/e,Math.log(e+Math.sqrt(e*e+1))},Complex:function(t){if(0==t.im)return t=0!=t.re?Math.log(t.re+Math.sqrt(t.re*t.re+1)):1/0,new e.Complex(t,0);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re/r,-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),s(t)},BigNumber:function(t){return i(t,e.BigNumber,!0,!0)},"Array | Matrix":function(e){return a.deepMap(e,u)}});return u}var i=r(214).acosh_asinh_asech_acsch;t.name="acsch",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){if(0==t.re&&0==t.im)return new e.Complex(0,1/0);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re=t.re/r,t.im=-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),u(t)}var s=n(r(2)),u=n(r(129)).signatures.Complex,c=o("asec",{number:function(t){return-1>=t||t>=1?Math.acos(1/t):a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!0)},"Array | Matrix":function(e){return s.deepMap(e,c)}});return c}var i=r(214).arccos_arcsec;t.name="asec",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){if(0==t.re&&0==t.im)return new e.Complex(1/0,0);var r=t.re*t.re+t.im*t.im;return t=0!=r?new e.Complex(t.re/r,-t.im/r):new e.Complex(0!=t.re?t.re/0:0,0!=t.im?-(t.im/0):0),u(t)}var s=n(r(2)),u=n(r(130)).signatures.Complex,c=o("asech",{number:function(t){if(1>=t&&t>=-1){t=1/t;var r=Math.sqrt(t*t-1);return t>0?Math.log(r+t):new e.Complex(Math.log(r-t),Math.PI)}return a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!1,!0)},"Array | Matrix":function(e){return s.deepMap(e,c)}});return c}var i=r(214).acosh_asinh_asech_acsch;t.name="asech",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){var r=t.re,n=t.im,i=new e.Complex(n*n-r*r+1,-2*r*n),o=u(i),a=new e.Complex(o.re-n,o.im+r),s=c(a);return new e.Complex(s.im,-s.re)}var s=n(r(2)),u=n(r(53)).signatures.Complex,c=n(r(44)).signatures.Complex,f=o("asin",{number:function(t){return t>=-1&&1>=t?Math.asin(t):a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!1)},"Array | Matrix":function(e){return s.deepMap(e,f,!0)}});return f}var i=r(214).arcsin_arccsc;t.name="asin",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=n(r(137)).signatures.Complex,u=o("asinh",{number:function(e){return Math.log(Math.sqrt(e*e+1)+e)},Complex:function(e){var t=e.im;e.im=-e.re,e.re=t;var r=s(e);return e.re=-e.im,e.im=t,t=r.re,r.re=-r.im,r.im=t,r},BigNumber:function(t){return i(t,e.BigNumber,!0,!1)},"Array | Matrix":function(e){return a.deepMap(e,u,!0)}});return u}var i=r(214).acosh_asinh_asech_acsch;t.name="asinh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=n(r(44)).signatures.Complex,u=o("atan",{number:function(e){return Math.atan(e)},Complex:function(t){if(0==t.re){if(1==t.im)return new e.Complex(0,1/0);if(-1==t.im)return new e.Complex(0,-(1/0))}var r=t.re,n=t.im,i=r*r+(1-n)*(1-n),o=new e.Complex((1-n*n-r*r)/i,-2*r/i),a=s(o);return new e.Complex(-.5*a.im,.5*a.re)},BigNumber:function(t){return i(t,e.BigNumber,!1)},"Array | Matrix":function(e){return a.deepMap(e,u,!0)}});return u}var i=r(214).arctan_arccot;t.name="atan",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("atan2",{"number, number":Math.atan2,"BigNumber, BigNumber":function(t,r){return i(t,r,e.BigNumber)},"Array | Matrix, any":function(e,t){return a.deepMap2(e,t,s)},"any, Array | Matrix":function(e,t){return a.deepMap2(e,t,s)}});return s}var i=r(214).arctan2;t.name="atan2",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){var r=t.re>1&&0==t.im,n=1-t.re,i=1+t.re,o=n*n+t.im*t.im;t=0!=o?new e.Complex((i*n-t.im*t.im)/o,(t.im*n+i*t.im)/o):new e.Complex(-1!=t.re?t.re/0:0,0!=t.im?t.im/0:0);var a=t.re;return t.re=Math.log(Math.sqrt(t.re*t.re+t.im*t.im))/2,t.im=Math.atan2(t.im,a)/2,r&&(t.im=-t.im),t}var s=n(r(2)),u=o("atanh",{number:function(t){return 1>=t&&t>=-1?Math.log((1+t)/(1-t))/2:a(new e.Complex(t,0))},Complex:a,BigNumber:function(t){return i(t,e.BigNumber,!1)},"Array | Matrix":function(e){return s.deepMap(e,u,!0)}});return u}var i=r(214).atanh_acoth;t.name="atanh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=n(r(143)).signatures.number,u=n(r(151)).signatures.number,c=o("cos",{number:Math.cos,Complex:function(t){return new e.Complex(Math.cos(t.re)*s(-t.im),Math.sin(t.re)*u(-t.im))},BigNumber:function(t){return i(t,e.BigNumber,0,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cos is no angle");return Math.cos(t.value)},"Array | Matrix":function(e){return a.deepMap(e,c)}});return c}var i=r(214).cos_sin_sec_csc;t.name="cos",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("cosh",{number:i,Complex:function(t){var r=Math.exp(t.re),n=Math.exp(-t.re);return new e.Complex(Math.cos(t.im)*(r+n)/2,Math.sin(t.im)*(r-n)/2)},BigNumber:function(t){return o(t,e.BigNumber,!1,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cosh is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u)}});return u}function i(e){return(Math.exp(e)+Math.exp(-e))/2}var o=r(214).cosh_sinh_csch_sech;t.name="cosh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("cot",{number:function(e){return 1/Math.tan(e)},Complex:function(t){var r=Math.exp(-4*t.im)-2*Math.exp(-2*t.im)*Math.cos(2*t.re)+1;return new e.Complex(2*Math.exp(-2*t.im)*Math.sin(2*t.re)/r,(Math.exp(-4*t.im)-1)/r)},BigNumber:function(t){return i(t,e.BigNumber,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cot is no angle");return 1/Math.tan(t.value)},"Array | Matrix":function(e){return a.deepMap(e,s)}});return s}var i=r(214).tan_cot;t.name="cot",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("coth",{number:i,Complex:function(t){var r=Math.exp(2*t.re),n=r*Math.cos(2*t.im),i=r*Math.sin(2*t.im),o=(n-1)*(n-1)+i*i;return new e.Complex(((n+1)*(n-1)+i*i)/o,-2*i/o)},BigNumber:function(t){return o(t,e.BigNumber,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function coth is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u)}});return u}function i(e){var t=Math.exp(2*e);return(t+1)/(t-1)}var o=r(214).tanh_coth;t.name="coth",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("csc",{number:function(e){return 1/Math.sin(e)},Complex:function(t){var r=.25*(Math.exp(-2*t.im)+Math.exp(2*t.im))-.5*Math.cos(2*t.re);return new e.Complex(.5*Math.sin(t.re)*(Math.exp(-t.im)+Math.exp(t.im))/r,.5*Math.cos(t.re)*(Math.exp(-t.im)-Math.exp(t.im))/r)},BigNumber:function(t){return i(t,e.BigNumber,1,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csc is no angle");return 1/Math.sin(t.value)},"Array | Matrix":function(e){return a.deepMap(e,s)}});return s}var i=r(214).cos_sin_sec_csc;t.name="csc",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("csch",{number:i,Complex:function(t){var r=Math.exp(t.re),n=Math.exp(-t.re),i=Math.cos(t.im)*(r-n),o=Math.sin(t.im)*(r+n),a=i*i+o*o;return new e.Complex(2*i/a,-2*o/a)},BigNumber:function(t){return o(t,e.BigNumber,!0,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function csch is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u)}});return u}function i(e){return 0==e?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(e)-Math.exp(-e)))*a(e)}var o=r(214).cosh_sinh_csch_sech,a=r(175).sign;t.name="csch",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("sec",{number:function(e){return 1/Math.cos(e)},Complex:function(t){var r=.25*(Math.exp(-2*t.im)+Math.exp(2*t.im))+.5*Math.cos(2*t.re);return new e.Complex(.5*Math.cos(t.re)*(Math.exp(-t.im)+Math.exp(t.im))/r,.5*Math.sin(t.re)*(Math.exp(t.im)-Math.exp(-t.im))/r)},BigNumber:function(t){return i(t,e.BigNumber,0,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sec is no angle");return 1/Math.cos(t.value)},"Array | Matrix":function(e){return a.deepMap(e,s)}});return s}var i=r(214).cos_sin_sec_csc;t.name="sec",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("sech",{number:i,Complex:function(t){var r=Math.exp(t.re),n=Math.exp(-t.re),i=Math.cos(t.im)*(r+n),o=Math.sin(t.im)*(r-n),a=i*i+o*o;return new e.Complex(2*i/a,-2*o/a)},BigNumber:function(t){return o(t,e.BigNumber,!1,!0)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sech is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u)}});return u}function i(e){return 2/(Math.exp(e)+Math.exp(-e))}var o=r(214).cosh_sinh_csch_sech;t.name="sech",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(143)).signatures.number,s=n(r(151)).signatures.number,u=n(r(2)),c=o("sin",{number:Math.sin,Complex:function(t){return new e.Complex(Math.sin(t.re)*a(-t.im),Math.cos(t.re)*s(t.im))},BigNumber:function(t){return i(t,e.BigNumber,1,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sin is no angle");return Math.sin(t.value)},"Array | Matrix":function(e){return u.deepMap(e,c,!0)}});return c}var i=r(214).cos_sin_sec_csc;t.name="sin",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("sinh",{number:i,Complex:function(t){var r=Math.cos(t.im),n=Math.sin(t.im),i=Math.exp(t.re),o=Math.exp(-t.re);return new e.Complex(r*(i-o)/2,n*(i+o)/2)},BigNumber:function(t){return o(t,e.BigNumber,!0,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function sinh is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u,!0)}});return u}function i(e){return Math.abs(e)<1?e+e*e*e/6+e*e*e*e*e/120:(Math.exp(e)-Math.exp(-e))/2}var o=r(214).cosh_sinh_csch_sech;t.name="sinh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(2)),s=o("tan",{number:Math.tan,Complex:function(t){var r=Math.exp(-4*t.im)+2*Math.exp(-2*t.im)*Math.cos(2*t.re)+1;return new e.Complex(2*Math.exp(-2*t.im)*Math.sin(2*t.re)/r,(1-Math.exp(-4*t.im))/r)},BigNumber:function(t){return i(t,e.BigNumber,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tan is no angle");return Math.tan(t.value)},"Array | Matrix":function(e){return a.deepMap(e,s,!0)}});return s}var i=r(214).tan_cot;t.name="tan",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(2)),u=a("tanh",{number:i,Complex:function(t){var r=Math.exp(2*t.re),n=r*Math.cos(2*t.im),i=r*Math.sin(2*t.im),o=(n+1)*(n+1)+i*i;return new e.Complex(((n-1)*(n+1)+i*i)/o,2*i/o)},BigNumber:function(t){return o(t,e.BigNumber,!1)},Unit:function(t){if(!t.hasBase(e.Unit.BASE_UNITS.ANGLE))throw new TypeError("Unit in function tanh is no angle");return i(t.value)},"Array | Matrix":function(e){return s.deepMap(e,u,!0)}});return u}function i(e){var t=Math.exp(2*e);return(t-1)/(t+1)}var o=r(214).tanh_coth;t.name="tanh",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(2)),a=i("to",{"Unit, Unit | string":function(e,t){return e.to(t)},"Array | Matrix, any":function(e,t){return o.deepMap2(e,t,a)},"any, Array | Matrix":function(e,t){return o.deepMap2(e,t,a)}});return a}t.name="to",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("clone",{any:i.clone})}var i=r(166);t.name="clone",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o,a){return function(n){return n&&(i.deepExtend(t,n),n.precision&&e.BigNumber&&e.BigNumber.config({precision:n.precision}),r(169)(a,t)),i.clone(t)}}var i=r(166);t.name="config",t.math=!0,t.factory=n},function(e,t,r){"use strict";function n(e,t,n,a){var s=n(r(75));return a("filter",{"Array, function":i,"Array, RegExp":o,"Matrix, function":function(e,t){return s(i(e.toArray(),t))},"Matrix, RegExp":function(e,t){return s(o(e.toArray(),t))}})}function i(e,t){if(1!==a(e).length)throw new Error("Only one dimensional matrices supported");return e.filter(function(e){return t(e)})}function o(e,t){if(1!==a(e).length)throw new Error("Only one dimensional matrices supported");return e.filter(function(e){return t.test(e)})}var a=r(172).size;t.name="filter",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("format",{any:i.format,"any, Object | function | number":i.format})}var i=r(176);t.name="format",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("map",{"Array, function":i,"Matrix, function":function(e,t){return e.map(t)}})}function i(e,t){var r=function(n,i){return Array.isArray(n)?n.map(function(e,t){return r(e,i.concat(t))}):t(n,i,e)};return r(e,[])}t.name="map",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("print",{"string, Object":i,"string, Object, number":i})}function i(e,t,r){return e.replace(/\$([\w\.]+)/g,function(e,n){for(var i=n.split("."),s=t[i.shift()];i.length&&void 0!==s;){var u=i.shift();s=u?s[u]:s+"."}return void 0!==s?o(s)?s:a(s,r):e})}var o=r(176).isString,a=r(176).format;t.name="print",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){function a(e){if("asc"===e)return f;if("desc"===e)return l;throw new Error('String "asc" or "desc" expected')}function s(e){if(1!==i(e).length)throw new Error("One dimensional array expected")}function u(e){if(1!==e.size().length)throw new Error("One dimensional matrix expected")}var c=n(r(75)),f=n(r(113)),l=function(e,t){return-f(e,t)};return o("sort",{Array:function(e){return s(e),e.sort(f)},Matrix:function(e){return u(e),c(e.toArray().sort(f),e.storage())},"Array, function":function(e,t){return s(e),e.sort(t)},"Matrix, function":function(e,t){return u(e),c(e.toArray().sort(t),e.storage())},"Array, string":function(e,t){return s(e),e.sort(a(t))},"Matrix, string":function(e,t){return u(e),c(e.toArray().sort(a(t)),e.storage())}})}var i=r(172).size;t.name="sort",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("_typeof",{any:function(t){var r=i.type(t);if("object"===r){if(t instanceof e.Complex)return"complex";if(t instanceof e.Matrix)return"matrix";if(t instanceof e.Unit)return"unit";if(t instanceof e.Index)return"index";if(t instanceof e.Range)return"range";if(t instanceof e.Help)return"help";if(t instanceof e.BigNumber)return"bignumber";if(t instanceof e.Chain)return"chain"}return r}})}var i=r(216);t.name="typeof",t.factory=n},function(e,t,r){"use strict";function n(e,t,r,n){return n("forEach",{"Array, function":i,"Matrix, function":function(e,t){return e.forEach(t)}})}function i(e,t){var r=function(n,i){Array.isArray(n)?n.forEach(function(e,t){r(e,i.concat(t))}):t(n,i,e)};r(e,[])}t.name="forEach",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var a=n(r(75)),s=n(r(31)),u=n(r(32)),c=n(r(213)),f=n(r(47)),l=n(r(55)),p=n(r(116)),m=n(r(115)),h=n(r(56)),g=e.SparseMatrix,v=e.DenseMatrix,d=e.Spa,x=i("lup",{Matrix:function(e){switch(e.storage()){case"dense":return y(e);case"sparse":return w(e)}},Array:function(e){var t=a(e),r=x(t);return{L:r.L.valueOf(),U:r.U.valueOf(),P:r.P.valueOf()}}}),y=function(e){var t,r,n,i=e._size[0],a=e._size[1],h=Math.min(i,a),g=o.clone(e._data),d=[],x=[i,h],y=[],w=[h,a],b=v.diagonal([i,i],1,0);for(r=0;a>r;r++){if(r>0)for(t=0;i>t;t++){var N=Math.min(t,r),E=0;for(n=0;N>n;n++)E=u(E,f(g[t][n],g[n][r]));g[t][r]=l(g[t][r],E)}var M=r,A=0,_=0;for(t=r;i>t;t++){var O=g[t][r],C=s(O);p(C,A)&&(M=t,A=C,_=O)}if(r!==M&&(v._swapRows(r,M,b._data),v._swapRows(r,M,g)),i>r)for(t=r+1;i>t;t++){var S=g[t][r];m(S,0)||(g[t][r]=c(g[t][r],_))}}for(r=0;a>r;r++)for(t=0;i>t;t++)0===r&&(a>t&&(y[t]=[]),d[t]=[]),r>t?(a>t&&(y[t][r]=g[t][r]),i>r&&(d[t][r]=0)):t!==r?(a>t&&(y[t][r]=0),i>r&&(d[t][r]=g[t][r])):(a>t&&(y[t][r]=g[t][r]),i>r&&(d[t][r]=1));var z=new v({data:d,size:x}),T=new v({data:y,size:w});return{L:z,U:T,P:b,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.P.toString()}}},w=function(e){var t,r,n,i=e._size[0],o=e._size[1],a=Math.min(i,o),u=e._values,l=e._index,v=e._ptr,x=[],y=[],w=[],b=[i,a],N=[],E=[],M=[],A=[a,o],_=[],O=[],C=[],S=[i,i],z=new Array(i),T=new Array(i);for(t=0;i>t;t++)z[t]=t,T[t]=t;var B=function(e,t){var r=T[e],n=T[t];z[r]=t,z[n]=e,T[e]=n,T[t]=r};for(r=0;o>r;r++){var I=new d(i);i>r&&(w.push(x.length),x.push(1),y.push(r)),M.push(N.length);var q=v[r],P=v[r+1];for(n=q;P>n;n++)t=l[n],I.set(z[t],u[n]);r>0&&I.forEach(0,r-1,function(e,t){g._forEachRow(e,x,y,w,function(r,n){r>e&&I.accumulate(r,h(f(n,t)))})});var U=r,R=I.get(r),L=s(R);I.forEach(r+1,i-1,function(e,t){var r=s(t);p(r,L)&&(U=e,L=r,R=t)}),r!==U&&(g._swapRows(r,U,b[1],x,y,w),g._swapRows(r,U,A[1],N,E,M),I.swap(r,U),B(r,U)),I.forEach(0,i-1,function(e,t){r>=e?(N.push(t),E.push(e)):(t=c(t,R),m(t,0)||(x.push(t),y.push(e)))})}for(w.push(x.length),M.push(N.length),t=0;i>t;t++)C.push(_.length),_.push(1),O.push(z[t]);return C.push(_.length),{L:new g({values:x,index:y,ptr:w,size:b}),U:new g({values:N,index:E,ptr:M,size:A}),P:new g({values:_,index:O,ptr:C,size:S}),toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.P.toString()}}};return x}var i=r(171),o=i.object;t.name="lup",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,o){var a=n(r(75)),s=n(r(164)),u=n(r(47)),c=n(r(217)),f=n(r(218)),l=o("lusolve",{"Array, Array | Matrix":function(e,t){e=a(e);var r=s(e),n=m(r.L,r.U,r.P,t);return n.valueOf()},"Matrix, Array | Matrix":function(e,t){var r=s(e);return m(r.L,r.U,r.P,t)},"Object, Array | Matrix":function(e,t){return m(e.L,e.U,e.P,t)}}),p=function(t){if(t instanceof e.Matrix)return t;if(i(t))return a(t);throw new TypeError("Invalid Matrix LUP decomposition")},m=function(e,t,r,n){e=p(e),t=p(t),r=p(r),n=u(r,n);var i=f(e,n);return c(t,i)};return l}var i=Array.isArray;t.name="lusolve",t.factory=n},function(e,t,r){"use strict";var n=r(350);t.clone=function i(e){var t=typeof e;if("number"===t||"string"===t||"boolean"===t||null===e||void 0===e)return e;if("function"==typeof e.clone)return e.clone();if(Array.isArray(e))return e.map(function(e){return i(e)});if(e instanceof Number)return new Number(e.valueOf());if(e instanceof String)return new String(e.valueOf());if(e instanceof Boolean)return new Boolean(e.valueOf()); + +if(e instanceof Date)return new Date(e.valueOf());if(e instanceof n)return e;if(e instanceof RegExp)throw new TypeError("Cannot clone "+e);var r={};for(var o in e)e.hasOwnProperty(o)&&(r[o]=i(e[o]));return r},t.extend=function(e,t){for(var r in t)t.hasOwnProperty(r)&&(e[r]=t[r]);return e},t.deepExtend=function o(e,t){if(Array.isArray(t))throw new TypeError("Arrays are not supported by deepExtend");for(var r in t)if(t.hasOwnProperty(r))if(t[r]&&t[r].constructor===Object)void 0===e[r]&&(e[r]={}),e[r].constructor===Object?o(e[r],t[r]):e[r]=t[r];else{if(Array.isArray(t[r]))throw new TypeError("Arrays are not supported by deepExtend");e[r]=t[r]}return e},t.deepEqual=function(e,r){var n,i,o;if(Array.isArray(e)){if(!Array.isArray(r))return!1;if(e.length!=r.length)return!1;for(i=0,o=e.length;o>i;i++)if(!t.deepEqual(e[i],r[i]))return!1;return!0}if(e instanceof Object){if(Array.isArray(r)||!(r instanceof Object))return!1;for(n in e)if(!t.deepEqual(e[n],r[n]))return!1;for(n in r)if(!t.deepEqual(e[n],r[n]))return!1;return!0}return typeof e==typeof r&&e==r},t.canDefineProperty=function(){try{if(Object.defineProperty)return Object.defineProperty({},"x",{}),!0}catch(e){}return!1},t.lazy=function(e,r,n){if(t.canDefineProperty()){var i,o=!0;Object.defineProperty(e,r,{get:function(){return o&&(i=n(),o=!1),i},set:function(e){i=e,o=!1},configurable:!0})}else e[r]=n()},t.traverse=function(e,t){var r=e;if(t)for(var n=t.split("."),i=0;i15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+t+"). Use function bignumber(x) to convert to BigNumber.");return new e.type.BigNumber(t)}},{from:"number",to:"Complex",convert:function(t){return new e.type.Complex(t,0)}},{from:"number",to:"string",convert:function(e){return e+""}},{from:"BigNumber",to:"Complex",convert:function(t){return new e.type.Complex(t.toNumber(),0)}},{from:"boolean",to:"number",convert:function(e){return+e}},{from:"boolean",to:"BigNumber",convert:function(t){return new e.type.BigNumber(+t)}},{from:"boolean",to:"string",convert:function(e){return+e}},{from:"null",to:"number",convert:function(){return 0}},{from:"null",to:"string",convert:function(){return"null"}},{from:"null",to:"BigNumber",convert:function(){return new e.type.BigNumber(0)}},{from:"Array",to:"Matrix",convert:function(t){return new e.type.Matrix(t)}}],n}},function(e,t,r){"use strict";function n(e,t,n,a,s){function u(e,t){var n=arguments.length;if(1!=n&&2!=n)throw new s.error.ArgumentsError("import",n,1,2);var o,a={override:t&&t.override||!1,wrap:t&&t.wrap||!1};if("string"==typeof e){var p=r(346)(e);return u(p,t)}if(i(e))return f(e);if("object"==typeof e){var m={};for(o in e)if(e.hasOwnProperty(o)){var h=e[o];l(h)?m[o]=c(o,h,a):i(e)?m[o]=f(e):m[o]=u(h,t)}return m}throw new TypeError("Object or module name expected")}function c(e,t,r){return r.override||void 0===s[e]?(r.wrap&&"function"==typeof t?(s[e]=function(){for(var e=[],r=0,n=arguments.length;n>r;r++){var i=arguments[r];e[r]=i&&i.valueOf()}return t.apply(s,e)},t&&t.transform&&(s[e].transform=t.transform)):s[e]=t,t&&t.transform&&(s.expression.transform[e]=t.transform),s.type.Chain.createProxy(e,t),t):void 0}function f(e){var t=n(e),r=e.path?o(s,e.path):s;if(r[e.name])throw new Error('"'+e.name+'" already exists');return r[e.name]=t,t}function l(t){return"function"==typeof t||"number"==typeof t||"string"==typeof t||"boolean"==typeof t||null===t||t instanceof e.Unit||t instanceof e.Complex}return u}var i=r(166).isFactory,o=r(166).traverse;t.math=!0,t.name="import",t.factory=n},function(e,t,r){"use strict";e.exports=function(e,t){var n=r(166),i=r(214),o=r(3),a=e.type.BigNumber;e["true"]=!0,e["false"]=!1,e["null"]=null,e.uninitialized=r(172).UNINITIALIZED,"bignumber"===t.number?(e.Infinity=new a(1/0),e.NaN=new a(0/0),n.lazy(e,"pi",function(){return i.pi(t.precision)}),n.lazy(e,"tau",function(){return i.tau(t.precision)}),n.lazy(e,"e",function(){return i.e(t.precision)}),n.lazy(e,"phi",function(){return i.phi(t.precision)}),n.lazy(e,"E",function(){return e.e}),n.lazy(e,"LN2",function(){return new a(2).ln()}),n.lazy(e,"LN10",function(){return new a(10).ln()}),n.lazy(e,"LOG2E",function(){return new a(1).div(new a(2).ln())}),n.lazy(e,"LOG10E",function(){return new a(1).div(new a(10).ln())}),n.lazy(e,"PI",function(){return e.pi}),n.lazy(e,"SQRT1_2",function(){return new a("0.5").sqrt()}),n.lazy(e,"SQRT2",function(){return new a(2).sqrt()})):(e.Infinity=1/0,e.NaN=0/0,e.pi=Math.PI,e.tau=2*Math.PI,e.e=Math.E,e.phi=1.618033988749895,e.E=e.e,e.LN2=Math.LN2,e.LN10=Math.LN10,e.LOG2E=Math.LOG2E,e.LOG10E=Math.LOG10E,e.PI=e.pi,e.SQRT1_2=Math.SQRT1_2,e.SQRT2=Math.SQRT2),e.i=new o(0,1),e.version=r(347)}},function(e,t,r){"use strict";t.ArgumentsError=r(177),t.DimensionError=r(174),t.IndexError=r(173),t.UnsupportedTypeError=r(348)},function(e,t,r){"use strict";t.array=r(172),t["boolean"]=r(209),t["function"]=r(349),t.number=r(175),t.bignumber=r(214),t.object=r(166),t.string=r(176),t.types=r(216)},function(e,t,r){"use strict";function n(e){for(var t=[];m(e);)t.push(e.length),e=e[0];return t}function i(e,t,r){var n,o=e.length;if(o!=t[r])throw new l(o,t[r]);if(rn;n++){var s=e[n];if(!m(s))throw new l(t.length-1,t.length,"<");i(e[n],t,a)}}else for(n=0;o>n;n++)if(m(e[n]))throw new l(t.length+1,t.length,">")}function o(e,r,n,i){var a,s,u=e.length,c=r[n],l=Math.min(u,c);if(e.length=c,na;a++)s=e[a],m(s)||(s=[s],e[a]=s),o(s,r,p,i);for(a=l;c>a;a++)s=[],e[a]=s,o(s,r,p,i)}else{for(a=0;l>a;a++)for(;m(e[a]);)e[a]=e[a][0];if(i!==t.UNINITIALIZED)for(a=l;c>a;a++)e[a]=f.clone(i)}}function a(e,t,r){var n,i;if(t>r){var o=r+1;for(n=0,i=e.length;i>n;n++)e[n]=a(e[n],t,o)}else for(;m(e);)e=e[0];return e}function s(e,t,r){var n,i;if(m(e)){var o=r+1;for(n=0,i=e.length;i>n;n++)e[n]=s(e[n],t,o)}else for(var a=r;t>a;a++)e=[e];return e}var u=r(175),c=r(176),f=r(166),l=(r(216),r(174)),p=r(173),m=Array.isArray;t.size=function(e){var r=n(e);return t.validate(e,r),r},t.validate=function(e,t){var r=0==t.length;if(r){if(m(e))throw new l(e.length,0)}else i(e,t,0)},t.validateIndex=function(e,t){if(!u.isNumber(e)||!u.isInteger(e))throw new TypeError("Index must be an integer (value: "+e+")");if(0>e)throw new p(e);if(void 0!==t&&e>=t)throw new p(e,t)},t.UNINITIALIZED={},t.resize=function(e,t,r){if(!m(e)||!m(t))throw new TypeError("Array expected");if(0===t.length)throw new Error("Resizing to scalar is not supported");t.forEach(function(e){if(!u.isNumber(e)||!u.isInteger(e)||0>e)throw new TypeError("Invalid size, must contain positive integers (size: "+c.format(t)+")")});var n=void 0!==r?r:0;return o(e,t,0,n),e},t.squeeze=function(e,r){for(var n=r||t.size(e);m(e)&&1===e.length;)e=e[0],n.shift();for(var i=n.length;1===n[i-1];)i--;return ia;a++)e=[e],o.unshift(1);for(e=s(e,r,0);o.lengthi;i++)n=n.concat.apply(n,t[i]);t=n}return t},t.argsToArray=function(e){for(var t=[],r=0,n=e.length;n>r;r++)t[r]=e[r];return t},t.isArray=m},function(e,t,r){"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=r),void 0!==this.min&&this.index=this.max?this.message="Index out of range ("+this.index+" > "+(this.max-1)+")":this.message="Index out of range ("+this.index+")",this.stack=(new Error).stack}n.prototype=new RangeError,n.prototype.constructor=RangeError,n.prototype.name="IndexError",e.exports=n},function(e,t,r){"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=r,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}n.prototype=new RangeError,n.prototype.constructor=RangeError,n.prototype.name="DimensionError",e.exports=n},function(e,t,r){"use strict";var n=r(351);t.isNumber=function(e){return e instanceof Number||"number"==typeof e},t.isInteger=function(e){return e==Math.round(e)},t.sign=function(e){return e>0?1:0>e?-1:0},t.format=function(e,r){if("function"==typeof r)return r(e);if(e===1/0)return"Infinity";if(e===-(1/0))return"-Infinity";if(isNaN(e))return"NaN";var n="auto",i=void 0;switch(r&&(r.notation&&(n=r.notation),t.isNumber(r)?i=r:r.precision&&(i=r.precision)),n){case"fixed":return t.toFixed(e,i);case"exponential":return t.toExponential(e,i);case"auto":return t.toPrecision(e,i,r&&r.exponential).replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],t=arguments[4];return"."!==e?e+t:t});default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", or "fixed".')}},t.toExponential=function(e,t){return new n(e).toExponential(t)},t.toFixed=function(e,t){return new n(e).toFixed(t)},t.toPrecision=function(e,t,r){return new n(e).toPrecision(t,r)},t.digits=function(e){return e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length},t.DBL_EPSILON=Number.EPSILON||2.220446049250313e-16,t.nearlyEqual=function(e,r,n){if(null==n)return e==r;if(e==r)return!0;if(isNaN(e)||isNaN(r))return!1;if(isFinite(e)&&isFinite(r)){var i=Math.abs(e-r);return ia;a++)0!=a&&(i+=", "),i+=n(e[a],r);return i+="]"}return t.format(e,r)}var i=r(175),o=r(214),a=r(350);t.isString=function(e){return e instanceof String||"string"==typeof e},t.endsWith=function(e,t){var r=e.length-t.length,n=e.length;return e.substring(r,n)===t},t.format=function(e,r){return i.isNumber(e)?i.format(e,r):e instanceof a?o.format(e,r):Array.isArray(e)?n(e,r):t.isString(e)?'"'+e+'"':"function"==typeof e?e.syntax?e.syntax+"":"function":e instanceof Object?"function"==typeof e.format?e.format(r):e.toString():String(e)}},function(e,t,r){"use strict";function n(e,t,r,i){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.count=t,this.min=r,this.max=i,this.message="Wrong number of arguments in function "+e+" ("+t+" provided, "+r+(void 0!=i?"-"+i:"")+" expected)",this.stack=(new Error).stack}n.prototype=new Error,n.prototype.constructor=Error,n.prototype.name="ArgumentsError",e.exports=n},function(e,t,r){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(this.nodes=e||[],!a(this.nodes)||!this.nodes.every(s))throw new TypeError("Array containing Nodes expected")}var i=r(190),o=r(176),a=Array.isArray,s=i.isNode;n.prototype=new i,n.prototype.type="ArrayNode",n.prototype._compile=function(e){var t="array"!==e.math.config().matrix,r=this.nodes.map(function(t){return t._compile(e)});return(t?"math.matrix([":"[")+r.join(",")+(t?"])":"]")},n.prototype.forEach=function(e){for(var t=0;t=t&&(r="("+r+")"),this.name+" = "+r},n.prototype._toTex=function(e){var t=a.getPrecedence(this),r=a.getPrecedence(this.expr),n=this.expr.toTex(e);return null!==r&&t>=r&&(n="\\left("+n+"\\right)"),s.toSymbol(this.name)+":="+n},e.exports=n},function(e,t,r){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!Array.isArray(e))throw new Error("Array expected");this.blocks=e.map(function(e){var t=e&&e.node,r=e&&void 0!==e.visible?e.visible:!0;if(!(t instanceof i))throw new TypeError('Property "node" must be a Node');if(!a(r))throw new TypeError('Property "visible" must be a boolean');return{node:t,visible:r}})}var i=r(190),o=r(9),a=r(209).isBoolean;n.prototype=new i,n.prototype.type="BlockNode",n.prototype._compile=function(e){e.ResultSet=o;var t=this.blocks.map(function(t){var r=t.node._compile(e);return t.visible?"results.push("+r+");":r+";"});return"(function () {var results = [];"+t.join("")+"return new ResultSet(results);})()"},n.prototype.forEach=function(e){for(var t=0;t=r)&&(t="("+t+")");var n=this.trueExpr.toString(),i=c.getPrecedence(this.trueExpr);("OperatorNode"===this.trueExpr.type||null!==i&&e>=i)&&(n="("+n+")");var o=this.falseExpr.toString(),a=c.getPrecedence(this.falseExpr);return("OperatorNode"===this.falseExpr.type||null!==a&&e>=a)&&(o="("+o+")"),t+" ? "+n+" : "+o},n.prototype._toTex=function(e){return"\\left\\{\\begin{array}{l l}{"+this.trueExpr.toTex(e)+"}, &\\quad{\\text{if}\\;"+this.condition.toTex(e)+"}\\\\{"+this.falseExpr.toTex(e)+"}, &\\quad{\\text{otherwise}}\\end{array}\\right."},e.exports=n},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(t){if(!a(t))throw new TypeError('String expected for parameter "valueType"');if(!a(e))throw new TypeError('String expected for parameter "value"');this.value=e,this.valueType=t}else this.value=e+"",this.valueType=o(e);if(!s[this.valueType])throw new TypeError('Unsupported type of value "'+this.valueType+'"')}var i=r(190),o=(r(350),r(216).type),a=r(176).isString,s={number:!0,string:!0,"boolean":!0,undefined:!0,"null":!0};n.prototype=new i,n.prototype.type="ConstantNode",n.prototype._compile=function(e){switch(this.valueType){case"number":return"bignumber"===e.math.config().number?'math.bignumber("'+this.value+'")':this.value.replace(/^(0*)[0-9]/,function(e,t){return e.substring(t.length)});case"string":return'"'+this.value+'"';case"boolean":return this.value;case"undefined":return this.value;case"null":return this.value;default:throw new TypeError('Unsupported type of constant "'+this.valueType+'"')}},n.prototype.forEach=function(e){},n.prototype.map=function(e){return this.clone()},n.prototype.clone=function(){return new n(this.value,this.valueType)},n.prototype.toString=function(){switch(this.valueType){case"string":return'"'+this.value+'"';default:return this.value}},n.prototype._toTex=function(e){var t,r=this.value;switch(this.valueType){case"string":return"\\text{"+r+"}";case"number":return t=r.toLowerCase().indexOf("e"),-1!==t?r.substring(0,t)+"\\cdot10^{"+r.substring(t+1)+"}":r;default:return r}},e.exports=n},function(e,t,r){"use strict";function n(e,t,r){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!u(e))throw new TypeError('String expected for parameter "name"');if(!c(t)||!t.every(u))throw new TypeError('Array containing strings expected for parameter "params"');if(!(r instanceof i))throw new TypeError('Node expected for parameter "expr"');if(e in o)throw new Error('Illegal function name, "'+e+'" is a reserved keyword');this.name=e,this.params=t,this.expr=r}var i=r(190),o=r(352),a=r(354),s=r(353),u=r(176).isString,c=Array.isArray;n.prototype=new i,n.prototype.type="FunctionAssignmentNode",n.prototype._compile=function(e){return this.params.forEach(function(t){e.args[t]=!0}),'scope["'+this.name+'"] = (function () { var fn = function '+this.name+"("+this.params.join(",")+") { if (arguments.length != "+this.params.length+') { throw new SyntaxError("Wrong number of arguments in function '+this.name+' (" + arguments.length + " provided, '+this.params.length+' expected)"); } return '+this.expr._compile(e)+' }; fn.syntax = "'+this.name+"("+this.params.join(", ")+')"; return fn; })();'},n.prototype.forEach=function(e){e(this.expr,"expr",this)},n.prototype.map=function(e){var t=this._ifNode(e(this.expr,"expr",this));return new n(this.name,this.params.slice(0),t)},n.prototype.clone=function(){return new n(this.name,this.params.slice(0),this.expr)},n.prototype.toString=function(){var e=s.getPrecedence(this),t=s.getPrecedence(this.expr),r=this.expr.toString();return null!==t&&e>=t&&(r="("+r+")"),"function "+this.name+"("+this.params.join(", ")+") = "+r},n.prototype._toTex=function(e){var t=s.getPrecedence(this),r=s.getPrecedence(this.expr),n=this.expr.toTex(e);return null!==r&&t>=r&&(n="\\left("+n+"\\right)"),a.toSymbol(this.name)+"\\left("+this.params.map(a.toSymbol).join(",")+"\\right):="+n},e.exports=n},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(e instanceof i))throw new TypeError('Node expected for parameter "object"');if(!f(t)||!t.every(c))throw new TypeError('Array containing Nodes expected for parameter "ranges"');this.object=e,this.ranges=t}var i=r(190),o=r(187),a=r(188),s=r(350),u=r(4),c=i.isNode,f=Array.isArray;n.prototype=new i,n.prototype.type="IndexNode",n.prototype._compile=function(e){return this.compileSubset(e)},n.prototype.compileSubset=function(e,t){function r(e){return e instanceof a&&"end"==e.name}var n=!1,i=this.ranges.map(function(e){var t=e.filter(r).length>0;return n=t?t:n,t});e.range=function(e,t,r){return new u(e instanceof s?e.toNumber():e,t instanceof s?t.toNumber():t,r instanceof s?r.toNumber():r)};var c=this.ranges.map(function(t,r){var n=i[r];return t instanceof o?n?(e.args.end=!0,"(function () { var end = size["+r+"]; return range( "+t.start._compile(e)+", "+t.end._compile(e)+", "+(t.step?t.step._compile(e):"1")+" );})()"):"range("+t.start._compile(e)+", "+t.end._compile(e)+", "+(t.step?t.step._compile(e):"1")+")":n?(e.args.end=!0,"(function () { var end = size["+r+"]; return "+t._compile(e)+";})()"):t._compile(e)});return n?"(function () { var obj = "+this.object._compile(e)+"; var size = math.size(obj).valueOf(); return math.subset( obj, math.index("+c.join(", ")+") "+(t?", "+t:"")+" );})()":"math.subset("+this.object._compile(e)+",math.index("+c.join(", ")+")"+(t?", "+t:"")+")"},n.prototype.forEach=function(e){e(this.object,"object",this);for(var t=0;t=o?[!0]:[!1];case 2:var c,f=s.getPrecedence(t[0]),l=s.isAssociativeWith(e,t[0]);c=null===f?!1:f!==n||"right"!==i||l?n>f?!0:!1:!0;var p,m=s.getPrecedence(t[1]),h=s.isAssociativeWith(e,t[1]);if(p=null===m?!1:m!==n||"left"!==i||h?n>m?!0:!1:!0,r){var u=e.getIdentifier(),g=e.args[0].getIdentifier(),v=e.args[1].getIdentifier();null!==f&&(s.properties[n][u].latexLeftParens===!1&&(c=!1),s.properties[f][g].latexParens===!1&&(c=!1)),null!==m&&(s.properties[n][u].latexRightParens===!1&&(p=!1),s.properties[m][v].latexParens===!1&&(p=!1))}return[c,p];default:var d=[];return t.forEach(function(){d.push(!0)}),d}}var o=r(190),a=(r(182),r(188),r(186),r(354)),s=r(353),u=Array.isArray,c=o.isNode;n.prototype=new o,n.prototype.type="OperatorNode",n.prototype._compile=function(e){if(!(this.fn in e.math))throw new Error("Function "+this.fn+' missing in provided namespace "math"');var t=this.args.map(function(t){return t._compile(e)});return"math."+this.fn+"("+t.join(", ")+")"},n.prototype.forEach=function(e){for(var t=0;t3)throw new Error("Too many arguments");this.start=e,this.end=t,this.step=r||null}var i=r(190),o=r(353),a=i.isNode;n.prototype=new i,n.prototype.type="RangeNode",n.prototype._compile=function(e){return"math.range("+this.start._compile(e)+", "+this.end._compile(e)+(this.step?", "+this.step._compile(e):"")+")"},n.prototype.forEach=function(e){e(this.start,"start",this),e(this.end,"end",this),this.step&&e(this.step,"step",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.start,"start",this)),this._ifNode(e(this.end,"end",this)),this.step&&this._ifNode(e(this.step,"step",this)))},n.prototype.clone=function(){return new n(this.start,this.end,this.step&&this.step)},n.prototype.toString=function(){var e,t=o.getPrecedence(this),r=this.start.toString(),n=o.getPrecedence(this.start);if(null!==n&&t>=n&&(r="("+r+")"),e=r,this.step){var i=this.step.toString(),a=o.getPrecedence(this.step);null!==a&&t>=a&&(i="("+i+")"),e+=":"+i}var s=this.end.toString(),u=o.getPrecedence(this.end);return null!==u&&t>=u&&(s="("+s+")"),e+=":"+s},n.prototype._toTex=function(e){var t=this.start.toTex(e);return this.step&&(t+=":"+this.step.toTex(e)),t+=":"+this.end.toTex(e)},e.exports=n},function(e,t,r){"use strict";function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!u(e))throw new TypeError('String expected for parameter "name"');this.name=e}function i(e){throw new Error("Undefined symbol "+e)}var o=r(190),a=r(7),s=r(354),u=r(176).isString;n.prototype=new o,n.prototype.type="SymbolNode",n.prototype._compile=function(e){return e.undef=i,e.Unit=a,this.name in e.args?this.name:this.name in e.math?'("'+this.name+'" in scope ? scope["'+this.name+'"] : math["'+this.name+'"])':'("'+this.name+'" in scope ? scope["'+this.name+'"] : '+(a.isValuelessUnit(this.name)?'new Unit(null, "'+this.name+'")':'undef("'+this.name+'")')+")"},n.prototype.forEach=function(e){},n.prototype.map=function(e){return this.clone()},n.prototype.clone=function(){return new n(this.name)},n.prototype.toString=function(){return this.name},n.prototype._toTex=function(e){var t=s.toSymbol(this.name);return"\\"===t[0]?t:" "+t},e.exports=n},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!(e instanceof o))throw new TypeError('Expected IndexNode for parameter "index"');if(!(t instanceof i))throw new TypeError('Expected Node for parameter "expr"');this.index=e,this.expr=t}var i=r(190),o=r(184);n.prototype=new i,n.prototype.type="UpdateNode",n.prototype._compile=function(e){var t=this.index.objectName()in e.args?this.name+" = ":'scope["'+this.index.objectName()+'"]',r=this.index.compileSubset(e,this.expr._compile(e));return t+" = "+r},n.prototype.forEach=function(e){e(this.index,"index",this),e(this.expr,"expr",this)},n.prototype.map=function(e){return new n(this._ifNode(e(this.index,"index",this)),this._ifNode(e(this.expr,"expr",this)))},n.prototype.clone=function(){return new n(this.index,this.expr)},n.prototype.toString=function(){return this.index.toString()+" = "+this.expr.toString()},n.prototype._toTex=function(e){return this.index.toTex(e)+":="+this.expr.toTex(e)},e.exports=n},function(e,t,r){"use strict";function n(){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator")}function i(e){for(var t in e)if(e.hasOwnProperty(t)&&t in a)throw new Error('Scope contains an illegal symbol, "'+t+'" is a reserved keyword')}function o(e){var t=Object.create(e);if(e.expression&&e.expression.transform)for(var r in e.expression.transform)e.expression.transform.hasOwnProperty(r)&&(t[r]=e.expression.transform[r]); + +return t}var a=r(352);n.prototype.eval=function(){throw new Error("Node.eval is deprecated. Use Node.compile(math).eval([scope]) instead.")},n.prototype.type="Node",n.prototype.compile=function(e){if(!(e instanceof Object))throw new TypeError("Object expected for parameter math");var t={math:o(e),args:{},_validateScope:i},r=this._compile(t),n=Object.keys(t).map(function(e){return" var "+e+' = defs["'+e+'"];'}),a=n.join(" ")+'return { "eval": function (scope) { if (scope) _validateScope(scope); scope = scope || {}; return '+r+"; }};",s=new Function("defs",a);return s(t)},n.prototype._compile=function(e){throw new Error("Cannot compile a Node interface")},n.prototype.forEach=function(e){throw new Error("Cannot run forEach on a Node interface")},n.prototype.map=function(e){throw new Error("Cannot run map on a Node interface")},n.prototype._ifNode=function(e){if(!(e instanceof n))throw new TypeError("Callback function must return a Node");return e},n.prototype.traverse=function(e){function t(e,r){e.forEach(function(e,n,i){r(e,n,i),t(e,r)})}e(this,null,null),t(this,e)},n.prototype.transform=function(e){function t(e,r){return e.map(function(e,n,i){var o=r(e,n,i);return o!==e?o:t(e,r)})}var r=e(this,null,null);return r!==this?r:t(this,e)},n.prototype.filter=function(e){var t=[];return this.traverse(function(r,n,i){e(r,n,i)&&t.push(r)}),t},n.prototype.find=function(){throw new Error("Function Node.find is deprecated. Use Node.filter instead.")},n.prototype.match=function(){throw new Error("Function Node.match is deprecated. See functions Node.filter, Node.transform, Node.traverse.")},n.prototype.clone=function(){throw new Error("Cannot clone a Node interface")},n.prototype.toString=function(){return""},n.prototype.toTex=function(e){var t;if("ArrayNode"===this.type&&delete this.latexType,"object"==typeof e)"FunctionNode"===this.type&&e.hasOwnProperty(this.name)&&(t=e[this.name](this,e));else if("function"==typeof e)t=e(this,e);else if("string"==typeof e&&"ArrayNode"===this.type)this.latexType=e;else if("undefined"!=typeof e)throw new TypeError("Object or function expected as callback");return"undefined"!=typeof t?t:this._toTex(e)},n.prototype._toTex=function(){if("Node"===this.type)return"";throw new Error("_toTex not implemented for this Node")},n.prototype.getIdentifier=function(){return this.type},n.isNode=function(e){return e instanceof n},e.exports=n},function(e,t,r){e.exports={name:"e",category:"Constants",syntax:["e"],description:"Euler's number, the base of the natural logarithm. Approximately equal to 2.71828",examples:["e","e ^ 2","exp(2)","log(e)"],seealso:["exp"]}},function(e,t,r){e.exports={name:"false",category:"Constants",syntax:["false"],description:"Boolean value false",examples:["false"],seealso:["true"]}},function(e,t,r){e.exports={name:"i",category:"Constants",syntax:["i"],description:"Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.",examples:["i","i * i","sqrt(-1)"],seealso:[]}},function(e,t,r){e.exports={name:"Infinity",category:"Constants",syntax:["Infinity"],description:"Infinity, a number which is larger than the maximum number that can be handled by a floating point number.",examples:["Infinity","1 / 0"],seealso:[]}},function(e,t,r){e.exports={name:"LN2",category:"Constants",syntax:["LN2"],description:"Returns the natural logarithm of 2, approximately equal to 0.693",examples:["LN2","log(2)"],seealso:[]}},function(e,t,r){e.exports={name:"LN10",category:"Constants",syntax:["LN10"],description:"Returns the natural logarithm of 10, approximately equal to 2.302",examples:["LN10","log(10)"],seealso:[]}},function(e,t,r){e.exports={name:"LOG2E",category:"Constants",syntax:["LOG2E"],description:"Returns the base-2 logarithm of E, approximately equal to 1.442",examples:["LOG2E","log(e, 2)"],seealso:[]}},function(e,t,r){e.exports={name:"LOG10E",category:"Constants",syntax:["LOG10E"],description:"Returns the base-10 logarithm of E, approximately equal to 0.434",examples:["LOG10E","log(e, 10)"],seealso:[]}},function(e,t,r){e.exports={name:"NaN",category:"Constants",syntax:["NaN"],description:"Not a number",examples:["NaN","0 / 0"],seealso:[]}},function(e,t,r){e.exports={name:"null",category:"Constants",syntax:["null"],description:"Value null",examples:["null"],seealso:["true","false"]}},function(e,t,r){e.exports={name:"pi",category:"Constants",syntax:["pi"],description:"The number pi is a mathematical constant that is the ratio of a circle's circumference to its diameter, and is approximately equal to 3.14159",examples:["pi","sin(pi/2)"],seealso:["tau"]}},function(e,t,r){e.exports={name:"phi",category:"Constants",syntax:["phi"],description:"Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...",examples:["tau"],seealso:[]}},function(e,t,r){e.exports={name:"SQRT1_2",category:"Constants",syntax:["SQRT1_2"],description:"Returns the square root of 1/2, approximately equal to 0.707",examples:["SQRT1_2","sqrt(1/2)"],seealso:[]}},function(e,t,r){e.exports={name:"SQRT2",category:"Constants",syntax:["SQRT2"],description:"Returns the square root of 2, approximately equal to 1.414",examples:["SQRT2","sqrt(2)"],seealso:[]}},function(e,t,r){e.exports={name:"tau",category:"Constants",syntax:["tau"],description:"Tau is the ratio constant of a circle's circumference to radius, equal to 2 * pi, approximately 6.2832.",examples:["tau","2 * pi"],seealso:["pi"]}},function(e,t,r){e.exports={name:"true",category:"Constants",syntax:["true"],description:"Boolean value true",examples:["true"],seealso:["false"]}},function(e,t,r){e.exports={name:"version",category:"Constants",syntax:["version"],description:"A string with the version number of math.js",examples:["version"],seealso:[]}},function(e,t,r){var n=(r(174),r(173));t.transform=function(e){return e instanceof n?new n(e.index+1,e.min+1,e.max+1):e}},function(e,t,r){"use strict";t.isBoolean=function(e){return e instanceof Boolean||"boolean"==typeof e}},function(e,t,r){"use strict";function n(e,t,n){var i=n(r(211)),o=n(r(212)),a=function(e,t,r,n,a,s,u){for(var c=e._values,f=e._index,l=e._ptr,p=u._index,m=l[t],h=l[t+1],g=m;h>g;g++){var v=f[g];!n[v]||n[v]0;)n(l[--h],p[--g])==v&&(d=d.plus(x)),x=x.times(y);for(;g>0;)n(m,p[--g])==v&&(d=d.plus(x)),x=x.times(y);return s.config({precision:w}),0==v&&(d.s=-d.s),d}function i(e){for(var t=e.c,r=t[0]+"",n=1;n0)if(++s>c)for(s-=c;s--;u+="0");else c>s&&(u=u.slice(0,s)+"."+u.slice(s));for(var f=[0],n=0;n1&&(null==f[a+1]&&(f[a+1]=0),f[a+1]+=f[a]>>1,f[a]&=1)}return f.reverse()}function o(e,r){var n=r.precision,i=-(n+4),o=n+8-e.e,a=25-e.e,s=Math.max(1.442695*Math.log(n+2)|5,5);r.config({precision:a});var u=0,c=new r(Math.asin(e.toNumber())+"");do{var l=t.cos_sin_sec_csc(c,r,1,!1),p=f(l);l.isZero()||(l.s=c.s);var m=l.minus(e).div(p);c=c.minus(m),a=Math.min(2*a,o),r.config({precision:a})}while(2*m.e>=i&&!m.isZero()&&++u<=s);if(u==s)throw new Error("asin() failed to converge to the requested accuracy.Try with a higher precision.");return r.config({precision:n}),c.toDP(n-1)}function a(e,t){var r=e.constructor;r.config({precision:t+Math.log(t)|4});for(var n=new r(1),i=e,o=0/0,a=e.times(e),s=e,u=new r(n),c=new r(n),f=new r(n),l=3;!i.equals(o);l+=2)s=s.times(a),u=u.times(f),c=c.times(f.plus(n)),o=i,f=new r(l),i=i.plus(s.times(u).div(f.times(c)));return r.config({precision:t}),i.toDP(t-1)}function s(e){for(var t=e,r=0/0,n=e.times(e),i=e,o=!0,a=3;!t.equals(r);a+=2)i=i.times(n),r=t,o=!o,t=o?t.plus(i.div(a)):t.minus(i.div(a));return t}function u(e,t){for(var r=e.constructor.ONE,n=e,i=0/0,o=e.times(e),a=t?n:n=r,s=r,u=!0,c=t;!n.equals(i);c+=2)a=a.times(o),s=s.times(c+1).times(c+2),i=n,u=!u,n=u?n.plus(a.div(s)):n.minus(a.div(s));return n}function c(e,r,n){var i=t.pi(r+2),o=t.tau(r);if(e.abs().lte(i.toDP(e.dp())))return[e,!1];var a=e.constructor;if(e.div(i.toDP(e.dp())).toNumber()%2==0)return[new a(1^n),!0];var s=e.mod(o);return s.toDP(e.dp(),1).isZero()?[new a(1^n),!0]:(s.gt(i)&&(n?(s=s.minus(i),s.s=-s.s):s=o.minus(s)),s.constructor=a,[s,!1])}function f(e){var t=e.constructor,r=t.precision;t.config({precision:r+2});var n=t.ONE.minus(e.times(e)).sqrt();return t.config({precision:r}),n.toDP(r-1)}var l=r(350),p=r(175).isNumber,m=r(175).digits,h=r(349).memoize;t.isBigNumber=function(e){return e instanceof l},t.toBigNumber=function(e,t){return new t(m(e)>15?e+"":e)},t.e=h(function(e){var t=l.constructor({precision:e});return new t(1).exp()}),t.phi=h(function(e){var t=l.constructor({precision:e});return new t(1).plus(new t(5).sqrt()).div(2)}),t.pi=h(function(e){var t=l.constructor({precision:e+4}),r=new t(4).times(s(new t(1).div(5))).minus(s(new t(1).div(239)));return t.config({precision:e}),new t(4).times(r)}),t.tau=h(function(e){var r=t.pi(e+2),n=l.constructor({precision:e});return new n(2).times(r)}),t.and=function(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitAnd");var r=e.constructor;if(e.isNaN()||t.isNaN())return new r(0/0);if(e.isZero()||t.eq(-1)||e.eq(t))return e;if(t.isZero()||e.eq(-1))return t;if(!e.isFinite()||!t.isFinite()){if(!e.isFinite()&&!t.isFinite())return e.isNegative()==t.isNegative()?e:new r(0);if(!e.isFinite())return t.isNegative()?e:e.isNegative()?new r(0):t;if(!t.isFinite())return e.isNegative()?t:t.isNegative()?new r(0):e}return n(e,t,function(e,t){return e&t})},t.leftShift=function(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function leftShift");var r=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new r(0/0):e.isZero()||t.isZero()?e:e.isFinite()||t.isFinite()?e.times(t.lt(55)?Math.pow(2,t.toNumber())+"":new r(2).pow(t)):new r(0/0)},t.not=function(e){if(e.isFinite()&&!e.isInteger())throw new Error("Integer expected in function bitNot");var t=e.constructor,r=t.precision;t.config({precision:1e9});var e=e.plus(t.ONE);return e.s=-e.s||null,t.config({precision:r}),e},t.or=function(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitOr");var r=e.constructor;if(e.isNaN()||t.isNaN())return new r(0/0);var i=new r(-1);return e.isZero()||t.eq(i)||e.eq(t)?t:t.isZero()||e.eq(i)?e:e.isFinite()&&t.isFinite()?n(e,t,function(e,t){return e|t}):!e.isFinite()&&!e.isNegative()&&t.isNegative()||e.isNegative()&&!t.isNegative()&&!t.isFinite()?i:e.isNegative()&&t.isNegative()?e.isFinite()?e:t:e.isFinite()?t:e},t.rightArithShift=function(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function rightArithShift");var r=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new r(0/0):e.isZero()||t.isZero()?e:t.isFinite()?t.lt(55)?e.div(Math.pow(2,t.toNumber())+"").floor():e.div(new r(2).pow(t)).floor():new r(e.isNegative()?-1:e.isFinite()?0:0/0)},t.xor=function(e,r){if(e.isFinite()&&!e.isInteger()||r.isFinite()&&!r.isInteger())throw new Error("Integers expected in function bitXor");var i=e.constructor;if(e.isNaN()||r.isNaN())return new i(0/0);if(e.isZero())return r;if(r.isZero())return e;if(e.eq(r))return new i(0);var o=new i(-1);return e.eq(o)?t.not(r):r.eq(o)?t.not(e):e.isFinite()&&r.isFinite()?n(e,r,function(e,t){return e^t}):e.isFinite()||r.isFinite()?new i(e.isNegative()==r.isNegative()?1/0:-(1/0)):o},t.arccos_arcsec=function(e,r,n){var i=r.precision;if(n){if(e.abs().lt(r.ONE))throw new Error("asec() only has non-complex values for |x| >= 1.")}else if(e.abs().gt(r.ONE))throw new Error("acos() only has non-complex values for |x| <= 1.");if(e.eq(-1))return t.pi(i);r.config({precision:i+4}),n&&(e=r.ONE.div(e));var o=t.arctan_arccot(r.ONE.minus(e.times(e)).sqrt().div(e.plus(r.ONE)),r).times(2);return r.config({precision:i}),o.toDP(i-1)},t.arcsin_arccsc=function(e,r,n){if(e.isNaN())return new r(0/0);var i=r.precision,s=e.abs();if(n){if(s.lt(r.ONE))throw new Error("acsc() only has non-complex values for |x| >= 1.");r.config({precision:i+2}),e=r.ONE.div(e),r.config({precision:i}),s=e.abs()}else if(s.gt(r.ONE))throw new Error("asin() only has non-complex values for |x| <= 1.");if(s.gt(.8)){r.config({precision:i+4});var u=e.s,c=t.pi(i+4).div(2);return e=c.minus(t.arcsin_arccsc(r.ONE.minus(e.times(e)).sqrt(),r)),e.s=u,e.constructor=r,r.config({precision:i}),e.toDP(i-1)}var f=s.gt(.58);f&&(r.config({precision:i+8}),e=e.div(new r(2).sqrt().times(r.ONE.minus(e.times(e)).sqrt().plus(r.ONE).sqrt())),r.config({precision:i}));var l=60>=i||e.dp()<=Math.log(i)&&e.lt(.05)?a(e,i):o(e,r);return f?l.times(2):l},t.arctan_arccot=function(e,r,n){if(e.isNaN())return new r(0/0);if(!n&&e.isZero()||n&&!e.isFinite())return new r(0);var i=r.precision;if(!n&&!e.isFinite()||n&&e.isZero()){var o=t.pi(i+2).div(2).toDP(i-1);return o.constructor=r,o.s=e.s,o}r.config({precision:i+4}),n&&(e=r.ONE.div(e));var a=e.abs();if(a.lte(.875)){var u=s(e);return u.constructor=r,r.config({precision:i}),u.toDP(r.precision-1)}if(a.gte(1.143)){var o=t.pi(i+4).div(2),u=o.minus(s(r.ONE.div(a)));return u.s=e.s,u.constructor=r,r.config({precision:i}),u.toDP(r.precision-1)}return e=e.div(e.times(e).plus(1).sqrt()),r.config({precision:i}),t.arcsin_arccsc(e,r)},t.arctan2=function(e,r,n){var i=n.precision;if(r.isZero()){if(e.isZero())return new n(0/0);var o=t.pi(i+2).div(2).toDP(i-1);return o.constructor=n,o.s=e.s,o}n.config({precision:i+2});var a=t.arctan_arccot(e.div(r),n,!1);if(r.isNegative()){var s=t.pi(i+2);a=e.isNegative()?a.minus(s):a.plus(s)}return a.constructor=n,n.config({precision:i}),a.toDP(i-1)},t.acosh_asinh_asech_acsch=function(e,t,r,n){if(e.isNaN())return new t(0/0);if(n&&e.isZero())return new t(1/0);if(!r)if(n){if(e.isNegative()||e.gt(t.ONE))throw new Error("asech() only has non-complex values for 0 <= x <= 1.")}else if(e.lt(t.ONE))throw new Error("acosh() only has non-complex values for x >= 1.");var i=t.precision;t.config({precision:i+4});var o=new t(e);o.constructor=t,n&&(o=t.ONE.div(o));var a=r?o.times(o).plus(t.ONE):o.times(o).minus(t.ONE),s=o.plus(a.sqrt()).ln();return t.config({precision:i}),new t(s.toPrecision(i))},t.atanh_acoth=function(e,t,r){if(e.isNaN())return new t(0/0);var n=e.abs();if(n.eq(t.ONE))return new t(e.isNegative()?-(1/0):1/0);if(n.gt(t.ONE)){if(!r)throw new Error("atanh() only has non-complex values for |x| <= 1.")}else if(r)throw new Error("acoth() has complex values for |x| < 1.");if(e.isZero())return new t(0);var i=t.precision;t.config({precision:i+4});var o=new t(e);o.constructor=t,r&&(o=t.ONE.div(o));var a=t.ONE.plus(o).div(t.ONE.minus(o)).ln().div(2);return t.config({precision:i}),new t(a.toPrecision(i))},t.cos_sin_sec_csc=function(e,t,r,n){if(e.isNaN()||!e.isFinite())return new t(0/0);var i=t.precision,o=new t(e),a=o.isNegative();a&&(o.s=-o.s);var s=i+(0|Math.log(i))+3;if(t.config({precision:s}),o=c(o,s,r),o[0].constructor=t,o[1])return o=o[0],n&&o.isZero()&&(o=new t(1/0)),t.config({precision:i}),o;var f;if(o=o[0],r){f=u(o.div(3125),r),t.config({precision:Math.min(s,i+15)});for(var l=new t(5),p=new t(16),m=new t(20),h=0;5>h;++h){var g=f.times(f),v=g.times(f),d=v.times(g);f=p.times(d).minus(m.times(v)).plus(l.times(f))}a&&(f.s=-f.s)}else{var x,y;o.abs().lt(t.ONE)?(x=64,y=3):(x=256,y=4),f=u(o.div(x),r),t.config({precision:Math.min(s,i+8)});for(var w=new t(8);y>0;--y){var g=f.times(f),b=g.times(g);f=w.times(b.minus(g)).plus(t.ONE)}}return n&&(f=f.e<=-i?new t(1/0):t.ONE.div(f)),t.config({precision:i}),f.toDP(i-1)},t.tan_cot=function(e,r,n){if(e.isNaN())return new r(0/0);var i=r.precision,o=t.pi(i+2),a=o.div(2).toDP(i-1);o=o.toDP(i-1);var s=c(e,i,1)[0];if(s.abs().eq(o))return new r(1/0);r.config({precision:i+4});var u=t.cos_sin_sec_csc(s,r,1,!1),l=f(u);u=u.toDP(i),l=l.toDP(i),s.eq(e)?s.gt(a)&&(l.s=-l.s):o.minus(s.abs()).gt(a)&&(l.s=-l.s);var p=n?l.div(u):u.div(l);return r.config({precision:i}),new r(p.toPrecision(i))},t.cosh_sinh_csch_sech=function(e,t,r,n){if(e.isNaN())return new t(0/0);if(!e.isFinite())return new t(n?0:r?e:1/0);var i=t.precision;t.config({precision:i+4});var o=new t(e);return o.constructor=t,o=o.exp(),o=r?o.minus(t.ONE.div(o)):o.plus(t.ONE.div(o)),o=n?new t(2).div(o):o.div(2),t.config({precision:i}),new t(o.toPrecision(i))},t.tanh_coth=function(e,t,r){if(e.isNaN())return new t(0/0);if(!e.isFinite())return new t(e.s);var n=t.precision;t.config({precision:n+4});var i=new t(e);i.constructor=t;var o=i.exp(),a=t.ONE.div(o),s=o.minus(a);return s=r?o.plus(a).div(s):s.div(o.plus(a)),t.config({precision:n}),s.toDP(n-1)},t.format=function(e,r){if("function"==typeof r)return r(e);if(!e.isFinite())return e.isNaN()?"NaN":e.gt(0)?"Infinity":"-Infinity";var n="auto",i=void 0;switch(void 0!==r&&(r.notation&&(n=r.notation),p(r)?i=r:r.precision&&(i=r.precision)),n){case"fixed":return t.toFixed(e,i);case"exponential":return t.toExponential(e,i);case"auto":var o=.001,a=1e5;r&&r.exponential&&(void 0!==r.exponential.lower&&(o=r.exponential.lower),void 0!==r.exponential.upper&&(a=r.exponential.upper));{({toExpNeg:e.constructor.toExpNeg,toExpPos:e.constructor.toExpPos})}if(e.constructor.config({toExpNeg:Math.round(Math.log(o)/Math.LN10),toExpPos:Math.round(Math.log(a)/Math.LN10)}),e.isZero())return"0";var s,u=e.abs();return s=u.gte(o)&&u.lt(a)?e.toSignificantDigits(i).toFixed():t.toExponential(e,i),s.replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],t=arguments[4];return"."!==e?e+t:t});default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", or "fixed".')}},t.toExponential=function(e,t){return void 0!==t?e.toExponential(t-1):e.toExponential()},t.toFixed=function(e,t){return e.toFixed(t||0)}},function(e,t,r){"use strict";function n(e,t,n,o){function a(t){if(!l.hasOwnProperty(t))throw new Error("Unknown distribution "+t);var r=Array.prototype.slice.call(arguments,1),n=l[t].apply(this,r);return function(t){var r={random:function(t,r,o){var s,c,l;if(arguments.length>3)throw new i("random",arguments.length,0,3);if(1===arguments.length?f(t)?s=t:l=t:2===arguments.length?f(t)?(s=t,l=r):(c=t,l=r):(s=t,c=r,l=o),void 0===l&&(l=1),void 0===c&&(c=0),void 0!==s){var p=a(s.valueOf(),c,l,n);return s instanceof e.Matrix?u(p):p}return n(c,l)},randomInt:function(t,r,n){var s,c,l;if(arguments.length>3||arguments.length<1)throw new i("randomInt",arguments.length,1,3);if(1===arguments.length?f(t)?s=t:l=t:2===arguments.length?f(t)?(s=t,l=r):(c=t,l=r):(s=t,c=r,l=n),void 0===c&&(c=0),void 0!==s){var p=a(s.valueOf(),c,l,o);return s instanceof e.Matrix?u(p):p}return o(c,l)},pickRandom:function(t){if(1!==arguments.length)throw new i("pickRandom",arguments.length,1);if(t instanceof e.Matrix)t=t.valueOf();else if(!Array.isArray(t))throw new TypeError("Unsupported type of value in function pickRandom");if(c.size(t).length>1)throw new Error("Only one dimensional vectors supported");return t[Math.floor(Math.random()*t.length)]}},n=function(e,r){return e+t()*(r-e)},o=function(e,r){return Math.floor(e+t()*(r-e))},a=function(e,t,r,n){var i,o,s=[];if(e=e.slice(0),e.length>1)for(o=0,i=e.shift();i>o;o++)s.push(a(e,t,r,n));else for(o=0,i=e.shift();i>o;o++)s.push(n(t,r));return s};return r}(n)}var s=n(r(2)),u=n(r(75)),c=r(172),f=s.isCollection,l={uniform:function(){return Math.random},normal:function(){return function(){for(var e,t,r=-1;0>r||r>1;)e=Math.random(),t=Math.random(),r=1/6*Math.pow(-2*Math.log(e),.5)*Math.cos(2*Math.PI*t)+.5;return r}}};return a}var i=r(177);t.name="distribution",t.factory=n},function(e,t,r){"use strict";t.type=function(e){var t=typeof e;if("object"===t){if(null===e)return"null";if(e instanceof Boolean)return"boolean";if(e instanceof Number)return"number";if(e instanceof String)return"string";if(Array.isArray(e))return"array";if(e instanceof Date)return"date";if(e instanceof Function)return"function";if(e instanceof RegExp)return"regexp"}return t}},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(75)),a=n(r(213)),s=n(r(47)),u=n(r(55)),c=n(r(115)),f=n(r(355)),l=e.SparseMatrix,p=e.DenseMatrix,m=i("backwardSubstitution",{"Matrix, Array | Matrix":function(e,t){switch(e.storage()){case"dense":return h(e,t);case"sparse":return g(e,t)}},"Array, Array | Matrix":function(e,t){var r=o(e),n=m(r,t);return n.valueOf()}}),h=function(e,t){t=f(e,t);for(var r=e._size[0],n=e._size[1],i=new Array(r),o=e._data,l=n-1;l>=0;l--){var m,h=t[l]||0;if(c(h,0))m=0;else{var g=o[l][l];if(c(g,0))throw new Error("Linear system cannot be solved since matrix is singular");m=a(h,g);for(var v=l-1;v>=0;v--)t[v]=u(t[v]||0,s(m,o[v][l]))}i[l]=[m]}return new p({data:i,size:[r,1]})},g=function(e,t){t=f(e,t);var r,n,i=e._size[0],o=e._size[1],p=e._values,m=e._index,h=e._ptr,g=[],v=[],d=[];d.push(0);for(var x=o-1;x>=0;x--){var y=t[x]||0;if(!c(y,0)){var w=0,b=h[x],N=h[x+1];for(n=N-1;n>=b;n--)if(r=m[n],r===x)w=p[n];else if(x>r)break;if(c(w,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var E=a(y,w);n>=b;n--)r=m[n],t[r]=u(t[r]||0,s(E,p[n]));c(E,0)||(g.unshift(E),v.unshift(x))}}return d.push(g.length),new l({values:g,index:v,ptr:d,size:[i,1]})};return m}t.name="backwardSubstitution",t.factory=n},function(e,t,r){"use strict";function n(e,t,n,i){var o=n(r(75)),a=n(r(213)),s=n(r(47)),u=n(r(55)),c=n(r(115)),f=n(r(355)),l=e.SparseMatrix,p=e.DenseMatrix,m=i("forwardSubstitution",{"Matrix, Array | Matrix":function(e,t){switch(e.storage()){case"dense":return h(e,t);case"sparse":return g(e,t)}},"Array, Array | Matrix":function(e,t){var r=o(e),n=m(r,t);return n.valueOf()}}),h=function(e,t){t=f(e,t);for(var r=e._size[0],n=e._size[1],i=new Array(r),o=e._data,l=0;n>l;l++){var m,h=t[l]||0;if(c(h,0))m=0;else{var g=o[l][l];if(c(g,0))throw new Error("Linear system cannot be solved since matrix is singular");m=a(h,g);for(var v=l+1;r>v;v++)t[v]=u(t[v]||0,s(m,o[v][l]))}i[l]=[m]}return new p({data:i,size:[r,1]})},g=function(e,t){t=f(e,t);var r,n,i=e._size[0],o=e._size[1],p=e._values,m=e._index,h=e._ptr,g=[],v=[],d=[];d.push(0);for(var x=0;o>x;x++){var y=t[x]||0;if(!c(y,0)){var w=0,b=h[x+1];for(n=h[x];b>n;n++)if(r=m[n],r===x)w=p[n];else if(r>x)break;if(c(w,0))throw new Error("Linear system cannot be solved since matrix is singular");for(var N=a(y,w);b>n;n++)r=m[n],t[r]=u(t[r]||0,s(N,p[n]));c(N,0)||(g.push(N),v.push(x))}}return d.push(g.length),new l({values:g,index:v,ptr:d,size:[i,1]})};return m}t.name="forwardSubstitution",t.factory=n},function(e,t,r){e.exports={name:"abs",category:"Arithmetic",syntax:["abs(x)"],description:"Compute the absolute value.",examples:["abs(3.5)","abs(-4.2)"],seealso:["sign"]}},function(e,t,r){e.exports={name:"add",category:"Operators",syntax:["x + y","add(x, y)"],description:"Add two values.",examples:["a = 2.1 + 3.6","a - 3.6","3 + 2i",'"hello" + " world"',"3 cm + 2 inch"],seealso:["subtract"]}},function(e,t,r){e.exports={name:"ceil",category:"Arithmetic",syntax:["ceil(x)"],description:"Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.",examples:["ceil(3.2)","ceil(3.8)","ceil(-4.2)"],seealso:["floor","fix","round"]}},function(e,t,r){e.exports={name:"cube",category:"Arithmetic",syntax:["cube(x)"],description:"Compute the cube of a value. The cube of x is x * x * x.",examples:["cube(2)","2^3","2 * 2 * 2"],seealso:["multiply","square","pow"]}},function(e,t,r){e.exports={name:"divide",category:"Operators",syntax:["x / y","divide(x, y)"],description:"Divide two values.",examples:["a = 2 / 3","a * 3","4.5 / 2","3 + 4 / 2","(3 + 4) / 2","18 km / 4.5"],seealso:["multiply"]}},function(e,t,r){e.exports={name:"dotDivide",category:"Operators",syntax:["x ./ y","dotDivide(x, y)"],description:"Divide two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a ./ b"],seealso:["multiply","dotMultiply","divide"]}},function(e,t,r){e.exports={name:"dotMultiply",category:"Operators",syntax:["x .* y","dotMultiply(x, y)"],description:"Multiply two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a .* b"],seealso:["multiply","divide","dotDivide"]}},function(e,t,r){e.exports={name:"dotpow",category:"Operators",syntax:["x .^ y","dotpow(x, y)"],description:"Calculates the power of x to y element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","a .^ 2"],seealso:["pow"]}},function(e,t,r){e.exports={name:"exp",category:"Arithmetic",syntax:["exp(x)"],description:"Calculate the exponent of a value.",examples:["exp(1.3)","e ^ 1.3","log(exp(1.3))","x = 2.4","(exp(i*x) == cos(x) + i*sin(x)) # Euler's formula"],seealso:["pow","log"]}},function(e,t,r){e.exports={name:"fix",category:"Arithmetic",syntax:["fix(x)"],description:"Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.",examples:["fix(3.2)","fix(3.8)","fix(-4.2)","fix(-4.8)"],seealso:["ceil","floor","round"]}},function(e,t,r){e.exports={name:"floor",category:"Arithmetic",syntax:["floor(x)"],description:"Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.",examples:["floor(3.2)","floor(3.8)","floor(-4.2)"],seealso:["ceil","fix","round"]}},function(e,t,r){e.exports={name:"gcd",category:"Arithmetic",syntax:["gcd(a, b)","gcd(a, b, c, ...)"],description:"Compute the greatest common divisor.",examples:["gcd(8, 12)","gcd(-4, 6)","gcd(25, 15, -10)"],seealso:["lcm","xgcd"]}},function(e,t,r){e.exports={name:"lcm",category:"Arithmetic",syntax:["lcm(x, y)"],description:"Compute the least common multiple.",examples:["lcm(4, 6)","lcm(6, 21)","lcm(6, 21, 5)"],seealso:["gcd"]}},function(e,t,r){e.exports={name:"log",category:"Arithmetic",syntax:["log(x)","log(x, base)"],description:"Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).",examples:["log(3.5)","a = log(2.4)","exp(a)","10 ^ 4","log(10000, 10)","log(10000) / log(10)","b = log(1024, 2)","2 ^ b"],seealso:["exp","log10"]}},function(e,t,r){e.exports={name:"log10",category:"Arithmetic",syntax:["log10(x)"],description:"Compute the 10-base logarithm of a value.",examples:["log10(0.00001)","log10(10000)","10 ^ 4","log(10000) / log(10)","log(10000, 10)"],seealso:["exp","log"]}},function(e,t,r){e.exports={name:"mod",category:"Operators",syntax:["x % y","x mod y","mod(x, y)"],description:"Calculates the modulus, the remainder of an integer division.",examples:["7 % 3","11 % 2","10 mod 4","function isOdd(x) = x % 2","isOdd(2)","isOdd(3)"],seealso:["divide"]}},function(e,t,r){e.exports={name:"multiply",category:"Operators",syntax:["x * y","multiply(x, y)"],description:"multiply two values.",examples:["a = 2.1 * 3.4","a / 3.4","2 * 3 + 4","2 * (3 + 4)","3 * 2.1 km"],seealso:["divide"]}},function(e,t,r){e.exports={name:"norm",category:"Arithmetic",syntax:["norm(x)","norm(x, p)"],description:"Calculate the norm of a number, vector or matrix.",examples:["abs(-3.5)","norm(-3.5)","norm(3 - 4i))","norm([1, 2, -3], Infinity)","norm([1, 2, -3], -Infinity)","norm([3, 4], 2)","norm([[1, 2], [3, 4]], 1)","norm([[1, 2], [3, 4]], 'inf')","norm([[1, 2], [3, 4]], 'fro')"]}},function(e,t,r){e.exports={name:"nthRoot",category:"Arithmetic",syntax:["nthRoot(a)","nthRoot(a, root)"],description:'Calculate the nth root of a value. The principal nth root of a positive real number A, is the positive real solution of the equation "x^root = A".',examples:["4 ^ 3","nthRoot(64, 3)","nthRoot(9, 2)","sqrt(9)"],seealso:["sqrt","pow"]}},function(e,t,r){e.exports={name:"pow",category:"Operators",syntax:["x ^ y","pow(x, y)"],description:"Calculates the power of x to y, x^y.",examples:["2^3 = 8","2*2*2","1 + e ^ (pi * i)"],seealso:["multiply"]}},function(e,t,r){e.exports={name:"round",category:"Arithmetic",syntax:["round(x)","round(x, n)"],description:"round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.",examples:["round(3.2)","round(3.8)","round(-4.2)","round(-4.8)","round(pi, 3)","round(123.45678, 2)"],seealso:["ceil","floor","fix"]}},function(e,t,r){e.exports={name:"sign",category:"Arithmetic",syntax:["sign(x)"],description:"Compute the sign of a value. The sign of a value x is 1 when x>1, -1 when x<0, and 0 when x=0.",examples:["sign(3.5)","sign(-4.2)","sign(0)"],seealso:["abs"]}},function(e,t,r){e.exports={name:"sqrt",category:"Arithmetic",syntax:["sqrt(x)"],description:"Compute the square root value. If x = y * y, then y is the square root of x.",examples:["sqrt(25)","5 * 5","sqrt(-1)"],seealso:["square","multiply"]}},function(e,t,r){e.exports={name:"square",category:"Arithmetic",syntax:["square(x)"],description:"Compute the square of a value. The square of x is x * x.",examples:["square(3)","sqrt(9)","3^2","3 * 3"],seealso:["multiply","pow","sqrt","cube"]}},function(e,t,r){e.exports={name:"subtract",category:"Operators",syntax:["x - y","subtract(x, y)"],description:"subtract two values.",examples:["a = 5.3 - 2","a + 2","2/3 - 1/6","2 * 3 - 3","2.1 km - 500m"],seealso:["add"]}},function(e,t,r){e.exports={name:"unaryMinus",category:"Operators",syntax:["-x","unaryMinus(x)"],description:"Inverse the sign of a value. Converts booleans and strings to numbers.",examples:["-4.5","-(-5.6)",'-"22"'],seealso:["add","subtract","unaryPlus"]}},function(e,t,r){e.exports={name:"unaryPlus",category:"Operators",syntax:["+x","unaryPlus(x)"], +description:"Converts booleans and strings to numbers.",examples:["+true",'+"2"'],seealso:["add","subtract","unaryMinus"]}},function(e,t,r){e.exports={name:"xgcd",category:"Arithmetic",syntax:["xgcd(a, b)"],description:"Calculate the extended greatest common divisor for two values",examples:["xgcd(8, 12)","gcd(8, 12)","xgcd(36163, 21199)"],seealso:["gcd","lcm"]}},function(e,t,r){e.exports={name:"bitAnd",category:"Bitwise",syntax:["x & y","bitAnd(x, y)"],description:"Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0",examples:["5 & 3","bitAnd(53, 131)","[1, 12, 31] & 42"],seealso:["bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e,t,r){e.exports={name:"bitNot",category:"Bitwise",syntax:["~x","bitNot(x)"],description:"Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.",examples:["~1","~2","bitNot([2, -3, 4])"],seealso:["bitAnd","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e,t,r){e.exports={name:"bitOr",category:"Bitwise",syntax:["x | y","bitOr(x, y)"],description:"Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.",examples:["5 | 3","bitOr([1, 2, 3], 4)"],seealso:["bitAnd","bitNot","bitXor","leftShift","rightArithShift","rightLogShift"]}},function(e,t,r){e.exports={name:"bitXor",category:"Bitwise",syntax:["bitXor(x, y)"],description:"Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.",examples:["bitOr(1, 2)","bitXor([2, 3, 4], 4)"],seealso:["bitAnd","bitNot","bitOr","leftShift","rightArithShift","rightLogShift"]}},function(e,t,r){e.exports={name:"leftShift",category:"Bitwise",syntax:["x << y","leftShift(x, y)"],description:"Bitwise left logical shift of a value x by y number of bits.",examples:["4 << 1","8 >> 1"],seealso:["bitAnd","bitNot","bitOr","bitXor","rightArithShift","rightLogShift"]}},function(e,t,r){e.exports={name:"rightArithShift",category:"Bitwise",syntax:["x >> y","leftShift(x, y)"],description:"Bitwise right arithmetic shift of a value x by y number of bits.",examples:["8 >> 1","4 << 1","-12 >> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightLogShift"]}},function(e,t,r){e.exports={name:"rightLogShift",category:"Bitwise",syntax:["x >> y","leftShift(x, y)"],description:"Bitwise right logical shift of a value x by y number of bits.",examples:["8 >>> 1","4 << 1","-12 >>> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift"]}},function(e,t,r){e.exports={name:"arg",category:"Complex",syntax:["arg(x)"],description:"Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).",examples:["arg(2 + 2i)","atan2(3, 2)","arg(2 + 3i)"],seealso:["re","im","conj","abs"]}},function(e,t,r){e.exports={name:"conj",category:"Complex",syntax:["conj(x)"],description:"Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.",examples:["conj(2 + 3i)","conj(2 - 3i)","conj(-5.2i)"],seealso:["re","im","abs","arg"]}},function(e,t,r){e.exports={name:"re",category:"Complex",syntax:["re(x)"],description:"Get the real part of a complex number.",examples:["re(2 + 3i)","im(2 + 3i)","re(-5.2i)","re(2.4)"],seealso:["im","conj","abs","arg"]}},function(e,t,r){e.exports={name:"im",category:"Complex",syntax:["im(x)"],description:"Get the imaginary part of a complex number.",examples:["im(2 + 3i)","re(2 + 3i)","im(-5.2i)","im(2.4)"],seealso:["re","conj","abs","arg"]}},function(e,t,r){e.exports={name:"bignumber",category:"Type",syntax:["bignumber(x)"],description:"Create a big number from a number or string.",examples:["0.1 + 0.2","bignumber(0.1) + bignumber(0.2)",'bignumber("7.2")','bignumber("7.2e500")',"bignumber([0.1, 0.2, 0.3])"],seealso:["boolean","complex","index","matrix","string","unit"]}},function(e,t,r){e.exports={name:"boolean",category:"Type",syntax:["x","boolean(x)"],description:"Convert a string or number into a boolean.",examples:["boolean(0)","boolean(1)","boolean(3)",'boolean("true")','boolean("false")',"boolean([1, 0, 1, 1])"],seealso:["bignumber","complex","index","matrix","number","string","unit"]}},function(e,t,r){e.exports={name:"complex",category:"Type",syntax:["complex()","complex(re, im)","complex(string)"],description:"Create a complex number.",examples:["complex()","complex(2, 3)",'complex("7 - 2i")'],seealso:["bignumber","boolean","index","matrix","number","string","unit"]}},function(e,t,r){e.exports={name:"index",category:"Type",syntax:["[start]","[start:end]","[start:step:end]","[start1, start 2, ...]","[start1:end1, start2:end2, ...]","[start1:step1:end1, start2:step2:end2, ...]"],description:"Create an index to get or replace a subset of a matrix",examples:["[]","[1, 2, 3]","A = [1, 2, 3; 4, 5, 6]","A[1, :]","A[1, 2] = 50","A[0:2, 0:2] = ones(2, 2)"],seealso:["bignumber","boolean","complex","matrix,","number","range","string","unit"]}},function(e,t,r){e.exports={name:"matrix",category:"Type",syntax:["[]","[a1, b1, ...; a2, b2, ...]","matrix()","matrix([...])"],description:"Create a matrix.",examples:["[]","[1, 2, 3]","[1, 2, 3; 4, 5, 6]","matrix()","matrix([3, 4])"],seealso:["bignumber","boolean","complex","index","number","string","unit"]}},function(e,t,r){e.exports={name:"number",category:"Type",syntax:["x","number(x)"],description:"Create a number or convert a string or boolean into a number.",examples:["2","2e3","4.05","number(2)",'number("7.2")',"number(true)","number([true, false, true, true])",'number("52cm", "m")'],seealso:["bignumber","boolean","complex","index","matrix","string","unit"]}},function(e,t,r){e.exports={name:"string",category:"Type",syntax:['"text"',"string(x)"],description:"Create a string or convert a value to a string",examples:['"Hello World!"',"string(4.2)","string(3 + 2i)"],seealso:["bignumber","boolean","complex","index","matrix","number","unit"]}},function(e,t,r){e.exports={name:"unit",category:"Type",syntax:["value unit","unit(value, unit)","unit(string)"],description:"Create a unit.",examples:["5.5 mm","3 inch",'unit(7.1, "kilogram")','unit("23 deg")'],seealso:["bignumber","boolean","complex","index","matrix","number","string"]}},function(e,t,r){e.exports={name:"eval",category:"Expression",syntax:["eval(expression)","eval([expr1, expr2, expr3, ...])"],description:"Evaluate an expression or an array with expressions.",examples:['eval("2 + 3")','eval("sqrt(" + 4 + ")")'],seealso:[]}},function(e,t,r){e.exports={name:"help",category:"Expression",syntax:["help(object)","help(string)"],description:"Display documentation on a function or data type.",examples:["help(sqrt)",'help("complex")'],seealso:[]}},function(e,t,r){e.exports={name:"and",category:"Logical",syntax:["x and y","and(x, y)"],description:"Logical and. Test whether two values are both defined with a nonzero/nonempty value.",examples:["true and false","true and true","2 and 4"],seealso:["not","or","xor"]}},function(e,t,r){e.exports={name:"not",category:"Logical",syntax:["!x","not x","not(x)"],description:"Logical not. Flips the boolean value of given argument.",examples:["!true","not false","!2","!0"],seealso:["and","or","xor"]}},function(e,t,r){e.exports={name:"or",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical or. Test if at least one value is defined with a nonzero/nonempty value.",examples:["true or false","false or false","0 or 4"],seealso:["not","and","xor"]}},function(e,t,r){e.exports={name:"xor",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.",examples:["true xor false","false xor false","true xor true","0 or 4"],seealso:["not","and","or"]}},function(e,t,r){e.exports={name:"concat",category:"Matrix",syntax:["concat(A, B, C, ...)","concat(A, B, C, ..., dim)"],description:"Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.",examples:["A = [1, 2; 5, 6]","B = [3, 4; 7, 8]","concat(A, B)","concat(A, B, 1)","concat(A, B, 2)"],seealso:["det","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"cross",category:"Matrix",syntax:["cross(A, B)"],description:"Calculate the cross product for two vectors in three dimensional space.",examples:["cross([1, 1, 0], [0, 1, 1])","cross([3, -3, 1], [4, 9, 2])","cross([2, 3, 4], [5, 6, 7])"],seealso:["multiply","dot"]}},function(e,t,r){e.exports={name:"det",category:"Matrix",syntax:["det(x)"],description:"Calculate the determinant of a matrix",examples:["det([1, 2; 3, 4])","det([-2, 2, 3; -1, 1, 3; 2, 0, -1])"],seealso:["concat","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"diag",category:"Matrix",syntax:["diag(x)","diag(x, k)"],description:"Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.",examples:["diag(1:3)","diag(1:3, 1)","a = [1, 2, 3; 4, 5, 6; 7, 8, 9]","diag(a)"],seealso:["concat","det","eye","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"dot",category:"Matrix",syntax:["dot(A, B)"],description:"Calculate the dot product of two vectors. The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn",examples:["dot([2, 4, 1], [2, 2, 3])","[2, 4, 1] * [2, 2, 3]"],seealso:["multiply","cross"]}},function(e,t,r){e.exports={name:"eye",category:"Matrix",syntax:["eye(n)","eye(m, n)","eye([m, n])","eye"],description:"Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.",examples:["eye(3)","eye(3, 5)","a = [1, 2, 3; 4, 5, 6]","eye(size(a))"],seealso:["concat","det","diag","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"flatten",category:"Matrix",syntax:["flatten(x)"],description:"Flatten a multi dimensional matrix into a single dimensional matrix.",examples:["a = [1, 2, 3; 4, 5, 6]","size(a)","b = flatten(a)","size(b)"],seealso:["concat","resize","size","squeeze"]}},function(e,t,r){e.exports={name:"inv",category:"Matrix",syntax:["inv(x)"],description:"Calculate the inverse of a matrix",examples:["inv([1, 2; 3, 4])","inv(4)","1 / 4"],seealso:["concat","det","diag","eye","ones","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"ones",category:"Matrix",syntax:["ones(m)","ones(m, n)","ones(m, n, p, ...)","ones([m])","ones([m, n])","ones([m, n, p, ...])","ones"],description:"Create a matrix containing ones.",examples:["ones(3)","ones(3, 5)","ones([2,3]) * 4.5","a = [1, 2, 3; 4, 5, 6]","ones(size(a))"],seealso:["concat","det","diag","eye","inv","range","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"range",category:"Type",syntax:["start:end","start:step:end","range(start, end)","range(start, end, step)","range(string)"],description:"Create a range. Lower bound of the range is included, upper bound is excluded.",examples:["1:5","3:-1:-3","range(3, 7)","range(0, 12, 2)",'range("4:10")',"a = [1, 2, 3, 4; 5, 6, 7, 8]","a[1:2, 1:2]"],seealso:["concat","det","diag","eye","inv","ones","size","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"resize",category:"Matrix",syntax:["resize(x, size)","resize(x, size, defaultValue)"],description:"Resize a matrix.",examples:["resize([1,2,3,4,5], [3])","resize([1,2,3], [5])","resize([1,2,3], [5], -1)","resize(2, [2, 3])",'resize("hello", [8], "!")'],seealso:["size","subset","squeeze"]}},function(e,t,r){e.exports={name:"size",category:"Matrix",syntax:["size(x)"],description:"Calculate the size of a matrix.",examples:["size(2.3)",'size("hello world")',"a = [1, 2; 3, 4; 5, 6]","size(a)","size(1:6)"],seealso:["concat","det","diag","eye","inv","ones","range","squeeze","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"squeeze",category:"Matrix",syntax:["squeeze(x)"],description:"Remove inner and outer singleton dimensions from a matrix.",examples:["a = zeros(3,2,1)","size(squeeze(a))","b = zeros(1,1,3)","size(squeeze(b))"],seealso:["concat","det","diag","eye","inv","ones","range","size","subset","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"subset",category:"Matrix",syntax:["value(index)","value(index) = replacement","subset(value, [index])","subset(value, [index], replacement)"],description:"Get or set a subset of a matrix or string. Indexes are one-based. Both the ranges lower-bound and upper-bound are included.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","trace","transpose","zeros"]}},function(e,t,r){e.exports={name:"trace",category:"Matrix",syntax:["trace(A)"],description:"Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.",examples:["A = [1, 2, 3; -1, 2, 3; 2, 0, 3]","trace(A)"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","transpose","zeros"]}},function(e,t,r){e.exports={name:"transpose",category:"Matrix",syntax:["x'","transpose(x)"],description:"Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","transpose(a)"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","trace","zeros"]}},function(e,t,r){e.exports={name:"zeros",category:"Matrix",syntax:["zeros(m)","zeros(m, n)","zeros(m, n, p, ...)","zeros([m])","zeros([m, n])","zeros([m, n, p, ...])","zeros"],description:"Create a matrix containing zeros.",examples:["zeros(3)","zeros(3, 5)","a = [1, 2, 3; 4, 5, 6]","zeros(size(a))"],seealso:["concat","det","diag","eye","inv","ones","range","size","squeeze","subset","trace","transpose"]}},function(e,t,r){e.exports={name:"combinations",category:"Probability",syntax:["combinations(n, k)"],description:"Compute the number of combinations of n items taken k at a time",examples:["combinations(7, 5)"],seealso:["permutations","factorial"]}},function(e,t,r){e.exports={name:"factorial",category:"Probability",syntax:["n!","factorial(n)"],description:"Compute the factorial of a value",examples:["5!","5 * 4 * 3 * 2 * 1","3!"],seealso:["combinations","permutations","gamma"]}},function(e,t,r){e.exports={name:"gamma",category:"Probability",syntax:["gamma(n)"],description:"Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.",examples:["gamma(4)","3!","gamma(1/2)","sqrt(pi)"],seealso:["factorial"]}},function(e,t,r){e.exports={name:"permutations",category:"Probability",syntax:["permutations(n)","permutations(n, k)"],description:"Compute the number of permutations of n items taken k at a time",examples:["permutations(5)","permutations(5, 3)"],seealso:["combinations","factorial"]}},function(e,t,r){e.exports={name:"pickRandom",category:"Probability",syntax:["pickRandom(array)"],description:"Pick a random entry from a given array.",examples:["pickRandom(0:10)","pickRandom([1, 3, 1, 6])"],seealso:["random","randomInt"]}},function(e,t,r){e.exports={name:"random",category:"Probability",syntax:["random()","random(max)","random(min, max)","random(size)","random(size, max)","random(size, min, max)"],description:"Return a random number.",examples:["random()","random(10, 20)","random([2, 3])"],seealso:["pickRandom","randomInt"]}},function(e,t,r){e.exports={name:"randInt",category:"Probability",syntax:["randInt()","randInt(max)","randInt(min, max)","randInt(size)","randInt(size, max)","randInt(size, min, max)"],description:"Return a random integer number",examples:["randInt()","randInt(10, 20)","randInt([2, 3], 10)"],seealso:["pickRandom","random"]}},function(e,t,r){e.exports={name:"compare",category:"Relational",syntax:["compare(x, y)"],description:"Compare two values. Returns 1 if x is larger than y, -1 if x is smaller than y, and 0 if x and y are equal.",examples:["compare(2, 3)","compare(3, 2)","compare(2, 2)","compare(5cm, 40mm)","compare(2, [1, 2, 3])"],seealso:["equal","unequal","smaller","smallerEq","largerEq"]}},function(e,t,r){e.exports={name:"deepEqual",category:"Relational",syntax:["deepEqual(x, y)"],description:"Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.",examples:["[1,3,4] == [1,3,4]","[1,3,4] == [1,3]"],seealso:["equal","unequal","smaller","larger","smallerEq","largerEq","compare"]}},function(e,t,r){e.exports={name:"equal",category:"Relational",syntax:["x == y","equal(x, y)"],description:"Check equality of two values. Returns true if the values are equal, and false if not.",examples:["2+2 == 3","2+2 == 4","a = 3.2","b = 6-2.8","a == b","50cm == 0.5m"],seealso:["unequal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]}},function(e,t,r){e.exports={name:"larger",category:"Relational",syntax:["x > y","larger(x, y)"],description:"Check if value x is larger than y. Returns true if x is larger than y, and false if not.",examples:["2 > 3","5 > 2*2","a = 3.3","b = 6-2.8","(a > b)","(b < a)","5 cm > 2 inch"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare"]}},function(e,t,r){e.exports={name:"largerEq",category:"Relational",syntax:["x >= y","largerEq(x, y)"],description:"Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.",examples:["2 > 1+1","2 >= 1+1","a = 3.2","b = 6-2.8","(a > b)"],seealso:["equal","unequal","smallerEq","smaller","largerEq","compare"]}},function(e,t,r){e.exports={name:"smaller",category:"Relational",syntax:["x < y","smaller(x, y)"],description:"Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not.",examples:["2 < 3","5 < 2*2","a = 3.3","b = 6-2.8","(a < b)","5 cm < 2 inch"],seealso:["equal","unequal","larger","smallerEq","largerEq","compare"]}},function(e,t,r){e.exports={name:"smallerEq",category:"Relational",syntax:["x <= y","smallerEq(x, y)"],description:"Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.",examples:["2 < 1+1","2 <= 1+1","a = 3.2","b = 6-2.8","(a < b)"],seealso:["equal","unequal","larger","smaller","largerEq","compare"]}},function(e,t,r){e.exports={name:"unequal",category:"Relational",syntax:["x != y","unequal(x, y)"],description:"Check unequality of two values. Returns true if the values are unequal, and false if they are equal.",examples:["2+2 != 3","2+2 != 4","a = 3.2","b = 6-2.8","a != b","50cm != 0.5m","5 cm != 2 inch"],seealso:["equal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]}},function(e,t,r){e.exports={name:"max",category:"Statistics",syntax:["max(a, b, c, ...)","max(A)","max(A, dim)"],description:"Compute the maximum value of a list of values.",examples:["max(2, 3, 4, 1)","max([2, 3, 4, 1])","max([2, 5; 4, 3])","max([2, 5; 4, 3], 1)","max([2, 5; 4, 3], 2)","max(2.7, 7.1, -4.5, 2.0, 4.1)","min(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["mean","median","min","prod","std","sum","var"]}},function(e,t,r){e.exports={name:"mean",category:"Statistics",syntax:["mean(a, b, c, ...)","mean(A)","mean(A, dim)"],description:"Compute the arithmetic mean of a list of values.",examples:["mean(2, 3, 4, 1)","mean([2, 3, 4, 1])","mean([2, 5; 4, 3])","mean([2, 5; 4, 3], 1)","mean([2, 5; 4, 3], 2)","mean([1.0, 2.7, 3.2, 4.0])"],seealso:["max","median","min","prod","std","sum","var"]}},function(e,t,r){e.exports={name:"median",category:"Statistics",syntax:["median(a, b, c, ...)","median(A)"],description:"Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.",examples:["median(5, 2, 7)","median([3, -1, 5, 7])"],seealso:["max","mean","min","prod","std","sum","var"]}},function(e,t,r){e.exports={name:"min",category:"Statistics",syntax:["min(a, b, c, ...)","min(A)","min(A, dim)"],description:"Compute the minimum value of a list of values.",examples:["min(2, 3, 4, 1)","min([2, 3, 4, 1])","min([2, 5; 4, 3])","min([2, 5; 4, 3], 1)","min([2, 5; 4, 3], 2)","min(2.7, 7.1, -4.5, 2.0, 4.1)","max(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["max","mean","median","prod","std","sum","var"]}},function(e,t,r){e.exports={name:"prod",category:"Statistics",syntax:["prod(a, b, c, ...)","prod(A)"],description:"Compute the product of all values.",examples:["prod(2, 3, 4)","prod([2, 3, 4])","prod([2, 5; 4, 3])"],seealso:["max","mean","min","median","min","std","sum","var"]}},function(e,t,r){e.exports={name:"std",category:"Statistics",syntax:["std(a, b, c, ...)","std(A)","std(A, normalization)"],description:'Compute the standard deviation of all values, defined as std(A) = sqrt(var(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["std(2, 4, 6)","std([2, 4, 6, 8])",'std([2, 4, 6, 8], "uncorrected")','std([2, 4, 6, 8], "biased")',"std([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","sum","var"]}},function(e,t,r){e.exports={name:"sum",category:"Statistics",syntax:["sum(a, b, c, ...)","sum(A)"],description:"Compute the sum of all values.",examples:["sum(2, 3, 4, 1)","sum([2, 3, 4, 1])","sum([2, 5; 4, 3])"],seealso:["max","mean","median","min","prod","std","sum","var"]}},function(e,t,r){e.exports={name:"var",category:"Statistics",syntax:["var(a, b, c, ...)","var(A)","var(A, normalization)"],description:'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["var(2, 4, 6)","var([2, 4, 6, 8])",'var([2, 4, 6, 8], "uncorrected")','var([2, 4, 6, 8], "biased")',"var([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","std","sum"]}},function(e,t,r){e.exports={name:"acos",category:"Trigonometry",syntax:["acos(x)"],description:"Compute the inverse cosine of a value in radians.",examples:["acos(0.5)","acos(cos(2.3))"],seealso:["cos","atan","asin"]}},function(e,t,r){e.exports={name:"acosh",category:"Trigonometry",syntax:["acosh(x)"],description:"Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.",examples:["acosh(1.5)"],seealso:["cosh","asinh","atanh"]}},function(e,t,r){e.exports={name:"acot",category:"Trigonometry",syntax:["acot(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acot(0.5)","acot(cot(0.5))","acot(2)"],seealso:["cot","atan"]}},function(e,t,r){e.exports={name:"acoth",category:"Trigonometry",syntax:["acoth(x)"],description:"Calculate the hyperbolic arccotangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.",examples:["acoth(0.5)"],seealso:["acsch","asech"]}},function(e,t,r){e.exports={name:"acsc",category:"Trigonometry",syntax:["acsc(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acsc(0.5)","acsc(csc(0.5))","acsc(2)"],seealso:["csc","asin","asec"]}},function(e,t,r){e.exports={name:"acsch",category:"Trigonometry",syntax:["acsch(x)"],description:"Calculate the hyperbolic arccosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.",examples:["acsch(0.5)"],seealso:["asech","acoth"]}},function(e,t,r){e.exports={name:"asec",category:"Trigonometry",syntax:["asec(x)"],description:"Calculate the inverse secant of a value.",examples:["asec(0.5)","asec(sec(0.5))","asec(2)"],seealso:["acos","acot","acsc"]}},function(e,t,r){e.exports={name:"asech",category:"Trigonometry",syntax:["asech(x)"],description:"Calculate the inverse secant of a value.",examples:["asech(0.5)"],seealso:["acsch","acoth"]}},function(e,t,r){e.exports={name:"asin",category:"Trigonometry",syntax:["asin(x)"],description:"Compute the inverse sine of a value in radians.",examples:["asin(0.5)","asin(sin(2.3))"],seealso:["sin","acos","atan"]}},function(e,t,r){e.exports={name:"asinh",category:"Trigonometry",syntax:["asinh(x)"],description:"Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.",examples:["asinh(0.5)"],seealso:["acosh","atanh"]}},function(e,t,r){e.exports={name:"atan",category:"Trigonometry",syntax:["atan(x)"],description:"Compute the inverse tangent of a value in radians.",examples:["atan(0.5)","atan(tan(2.3))"],seealso:["tan","acos","asin"]}},function(e,t,r){e.exports={name:"atanh",category:"Trigonometry",syntax:["atanh(x)"],description:"Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.",examples:["atanh(0.5)"],seealso:["acosh","asinh"]}},function(e,t,r){e.exports={name:"atan2",category:"Trigonometry",syntax:["atan2(y, x)"],description:"Computes the principal value of the arc tangent of y/x in radians.",examples:["atan2(2, 2) / pi","angle = 60 deg in rad","x = cos(angle)","y = sin(angle)","atan2(y, x)"],seealso:["sin","cos","tan"]}},function(e,t,r){e.exports={name:"cos",category:"Trigonometry",syntax:["cos(x)"],description:"Compute the cosine of x in radians.",examples:["cos(2)","cos(pi / 4) ^ 2","cos(180 deg)","cos(60 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["acos","sin","tan"]}},function(e,t,r){e.exports={name:"cosh",category:"Trigonometry",syntax:["cosh(x)"],description:"Compute the hyperbolic cosine of x in radians.",examples:["cosh(0.5)"],seealso:["sinh","tanh","coth"]}},function(e,t,r){e.exports={name:"cot",category:"Trigonometry",syntax:["cot(x)"],description:"Compute the cotangent of x in radians. Defined as 1/tan(x)",examples:["cot(2)","1 / tan(2)"],seealso:["sec","csc","tan"]}},function(e,t,r){e.exports={name:"coth",category:"Trigonometry",syntax:["coth(x)"],description:"Compute the hyperbolic cotangent of x in radians.",examples:["coth(2)","1 / tanh(2)"],seealso:["sech","csch","tanh"]}},function(e,t,r){e.exports={name:"csc",category:"Trigonometry",syntax:["csc(x)"],description:"Compute the cosecant of x in radians. Defined as 1/sin(x)",examples:["csc(2)","1 / sin(2)"],seealso:["sec","cot","sin"]}},function(e,t,r){e.exports={name:"csch",category:"Trigonometry",syntax:["csch(x)"],description:"Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)",examples:["csch(2)","1 / sinh(2)"],seealso:["sech","coth","sinh"]}},function(e,t,r){e.exports={name:"sec",category:"Trigonometry",syntax:["sec(x)"],description:"Compute the secant of x in radians. Defined as 1/cos(x)",examples:["sec(2)","1 / cos(2)"],seealso:["cot","csc","cos"]}},function(e,t,r){e.exports={name:"sech",category:"Trigonometry",syntax:["sech(x)"],description:"Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)",examples:["sech(2)","1 / cosh(2)"],seealso:["coth","csch","cosh"]}},function(e,t,r){e.exports={name:"sin",category:"Trigonometry",syntax:["sin(x)"],description:"Compute the sine of x in radians.",examples:["sin(2)","sin(pi / 4) ^ 2","sin(90 deg)","sin(30 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["asin","cos","tan"]}},function(e,t,r){e.exports={name:"sinh",category:"Trigonometry",syntax:["sinh(x)"],description:"Compute the hyperbolic sine of x in radians.",examples:["sinh(0.5)"],seealso:["cosh","tanh"]}},function(e,t,r){e.exports={name:"tan",category:"Trigonometry",syntax:["tan(x)"],description:"Compute the tangent of x in radians.",examples:["tan(0.5)","sin(0.5) / cos(0.5)","tan(pi / 4)","tan(45 deg)"],seealso:["atan","sin","cos"]}},function(e,t,r){e.exports={name:"tanh",category:"Trigonometry",syntax:["tanh(x)"],description:"Compute the hyperbolic tangent of x in radians.",examples:["tanh(0.5)","sinh(0.5) / cosh(0.5)"],seealso:["sinh","cosh"]}},function(e,t,r){e.exports={name:"to",category:"Units",syntax:["x to unit","to(x, unit)"],description:"Change the unit of a value.",examples:["5 inch to cm","3.2kg to g","16 bytes in bits"],seealso:[]}},function(e,t,r){e.exports={name:"clone",category:"Utils",syntax:["clone(x)"],description:"Clone a variable. Creates a copy of primitive variables,and a deep copy of matrices",examples:["clone(3.5)","clone(2 - 4i)","clone(45 deg)","clone([1, 2; 3, 4])",'clone("hello world")'],seealso:[]}},function(e,t,r){e.exports={name:"map",category:"Utils",syntax:["map(x, callback)"],description:"Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array.",examples:["map([1, 2, 3], function(val) { return value * value })"],seealso:["filter","forEach"]}},function(e,t,r){e.exports={name:"filter",category:"Utils",syntax:["filter(x, test)"],description:"Filter items in a matrix.",examples:["isPositive(x) = x > 0","filter([6, -2, -1, 4, 3], isPositive)","filter([6, -2, 0, 1, 0], x != 0)"],seealso:["sort","map","forEach"]}},function(e,t,r){e.exports={name:"forEach",category:"Utils",syntax:["forEach(x, callback)"],description:"Iterates over all elements of a matrix/array, and executes the given callback function.",examples:["forEach([1, 2, 3], function(val) { console.log(val) })"],seealso:["map","sort","filter"]}},function(e,t,r){e.exports={name:"format",category:"Utils",syntax:["format(value)","format(value, precision)"],description:"Format a value of any type as string.",examples:["format(2.3)","format(3 - 4i)","format([])","format(pi, 3)"],seealso:["print"]}},function(e,t,r){e.exports={name:"import",category:"Utils",syntax:["import(string)"],description:"Import functions from a file.",examples:['import("numbers")','import("./mylib.js")'],seealso:[]}},function(e,t,r){e.exports={name:"sort",category:"Utils",syntax:["sort(x)","sort(x, compare)"],description:'Sort the items in a matrix. Compare can be a string "asc" or "desc", or a custom sort function.',examples:["sort([5, 10, 1])",'sort(["C", "B", "A", "D"])',"sortByLength(a, b) = size(a)[1] - size(b)[1]",'sort(["Langdon", "Tom", "Sara"], sortByLength)'],seealso:["map","filter","forEach"]}},function(e,t,r){e.exports={name:"typeof",category:"Utils",syntax:["typeof(x)"],description:"Get the type of a variable.",examples:["typeof(3.5)","typeof(2 - 4i)","typeof(45 deg)",'typeof("hello world")'],seealso:[]}},function(e,t,r){function n(e){return r(i(e))}function i(e){return o[e]||function(){throw new Error("Cannot find module '"+e+"'.")}()}var o={"./clone":155,"./clone.js":155,"./config":156,"./config.js":156,"./filter":157,"./filter.js":157,"./forEach":163,"./forEach.js":163,"./format":158,"./format.js":158,"./import":168,"./import.js":168,"./map":159,"./map.js":159,"./print":160,"./print.js":160,"./sort":161,"./sort.js":161,"./typeof":162,"./typeof.js":162};n.keys=function(){return Object.keys(o)},n.resolve=i,e.exports=n,n.id=346},function(e,t,r){e.exports="2.0.0-SNAPSHOT"},function(e,t,r){"use strict";function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.types=Array.prototype.splice.call(arguments,1),e?0==this.types.length?this.message="Unsupported type of argument in function "+e:this.message="Function "+e+"("+this.types.join(", ")+") not supported":this.message="Unsupported type of argument", +this.stack=(new Error).stack}n.prototype=new TypeError,n.prototype.constructor=TypeError,n.prototype.name="UnsupportedTypeError",e.exports=n},function(e,t,r){t.memoize=function(e){return function t(){"object"!=typeof t.cache&&(t.cache={});var r=JSON.stringify(arguments);return r in t.cache?t.cache[r]:t.cache[r]=e.apply(e,arguments)}}},function(e,t,r){var n;!function(i){"use strict";function o(e){for(var t,r,n=1,i=e.length,o=e[0]+"";i>n;n++){for(t=e[n]+"",r=_-t.length;r--;)t="0"+t;o+=t}for(i=o.length;48===o.charCodeAt(--i););return o.slice(0,i+1||1)}function a(e,t,r,n){var i,o,a,s,u;for(o=1,a=e[0];a>=10;a/=10,o++);return a=t-o,0>a?(a+=_,i=0):(i=Math.ceil((a+1)/_),a%=_),o=E(10,_-a),u=e[i]%o|0,null==n?3>a?(0==a?u=u/100|0:1==a&&(u=u/10|0),s=4>r&&99999==u||r>3&&49999==u||5e4==u||0==u):s=(4>r&&u+1==o||r>3&&u+1==o/2)&&(e[i+1]/o/100|0)==E(10,a-2)-1||(u==o/2||0==u)&&0==(e[i+1]/o/100|0):4>a?(0==a?u=u/1e3|0:1==a?u=u/100|0:2==a&&(u=u/10|0),s=(n||4>r)&&9999==u||!n&&r>3&&4999==u):s=((n||4>r)&&u+1==o||!n&&r>3&&u+1==o/2)&&(e[i+1]/o/1e3|0)==E(10,a-3)-1,s}function s(e,t,r){var n=e.constructor;return null==t||((x=0>t||t>8)||0!==t&&(n.errors?parseInt:parseFloat)(t)!=t)&&!p(n,"rounding mode",t,r,0)?n.rounding:0|t}function u(e,t,r,n){var i=e.constructor;return!(x=(n||0)>t||t>=z+1)&&(0===t||(i.errors?parseInt:parseFloat)(t)==t)||p(i,"argument",t,r,0)}function c(e,t){var r,n,i,s,u,c,f,l=0,p=0,m=0,h=e.constructor,v=h.ONE,d=h.rounding,x=h.precision;if(!e.c||!e.c[0]||e.e>17)return new h(e.c?e.c[0]?e.s<0?0:1/0:v:e.s?e.s<0?0:e:0/0);for(null==t?(w=!1,u=x):u=t,f=new h(.03125);e.e>-2;)e=e.times(f),m+=5;for(n=Math.log(E(2,m))/Math.LN10*2+5|0,u+=n,r=s=c=new h(v),h.precision=u;;){if(s=g(s.times(e),u,1),r=r.times(++p),f=c.plus(I(s,r,u,1)),o(f.c).slice(0,u)===o(c.c).slice(0,u)){for(i=m;i--;)c=g(c.times(c),u,1);if(null!=t)return h.precision=x,c;if(!(3>l&&a(c.c,u-n,d,l)))return g(c,h.precision=x,d,w=!0);h.precision=u+=10,r=s=f=new h(v),p=0,l++}c=f}}function f(e,t,r,n){var i,a,s=e.constructor,u=(e=new s(e)).e;if(null==t?r=0:(g(e,++t,r),r=n?t:t+e.e-u),u=e.e,i=o(e.c),1==n||2==n&&(u>=t||u<=s.toExpNeg)){for(;i.length1&&(i=i.charAt(0)+"."+i.slice(1)),i+=(0>u?"e":"e+")+u}else{if(n=i.length,0>u){for(a=r-n;++u;i="0"+i);i="0."+i}else if(++u>n){for(a=r-u,u-=n;u--;i+="0");a>0&&(i+=".")}else a=r-n,n>u?i=i.slice(0,u)+"."+i.slice(u):a>0&&(i+=".");if(a>0)for(;a--;i+="0");}return e.s<0&&e.c[0]?"-"+i:i}function l(e){var t=e.length-1,r=t*_+1;if(t=e[t]){for(;t%10==0;t/=10,r--);for(t=e[0];t>=10;t/=10,r++);}return r}function p(e,t,r,n,i){if(e.errors){var o=new Error((n||["new Decimal","cmp","div","eq","gt","gte","lt","lte","minus","mod","plus","times","toFraction","pow","random","log","sqrt","toNearest","divToInt"][b?0>b?-b:b:0>1/b?1:0])+"() "+(["number type has more than 15 significant digits","LN10 out of digits"][t]||t+([x?" out of range":" not an integer"," not a boolean or binary digit"][i]||""))+": "+r);throw o.name="Decimal Error",x=b=0,o}}function m(e,t,r){var n=new e(e.ONE);for(w=!1;1&r&&(n=n.times(t)),r>>=1,r;)t=t.times(t);return w=!0,n}function h(e,t){var r,n,i,s,u,c,f,l,m,v,d,x=1,y=10,b=e,N=b.c,E=b.constructor,M=E.ONE,A=E.rounding,_=E.precision;if(b.s<0||!N||!N[0]||!b.e&&1==N[0]&&1==N.length)return new E(N&&!N[0]?-1/0:1!=b.s?0/0:N?0:b);if(null==t?(w=!1,f=_):f=t,E.precision=f+=y,r=o(N),n=r.charAt(0),!(Math.abs(s=b.e)<15e14))return b=new E(n+"."+r.slice(1)),f+2>B.length&&p(E,1,f+2,"ln"),b=h(b,f-y).plus(new E(B.slice(0,f+2)).times(s+"")),E.precision=_,null==t?g(b,_,A,w=!0):b;for(;7>n&&1!=n||1==n&&r.charAt(1)>3;)b=b.times(e),r=o(b.c),n=r.charAt(0),x++;for(s=b.e,n>1?(b=new E("0."+r),s++):b=new E(n+"."+r.slice(1)),v=b,l=u=b=I(b.minus(M),b.plus(M),f,1),d=g(b.times(b),f,1),i=3;;){if(u=g(u.times(d),f,1),m=l.plus(I(u,new E(i),f,1)),o(m.c).slice(0,f)===o(l.c).slice(0,f)){if(l=l.times(2),0!==s&&(f+2>B.length&&p(E,1,f+2,"ln"),l=l.plus(new E(B.slice(0,f+2)).times(s+""))),l=I(l,new E(x),f,1),null!=t)return E.precision=_,l;if(!a(l.c,f-y,A,c))return g(l,E.precision=_,A,w=!0);E.precision=f+=y,m=u=b=I(v.minus(M),v.plus(M),f,1),d=g(b.times(b),f,1),i=c=1}l=m,i+=2}}function g(e,t,r,n){var i,o,a,s,u,c,f,l,p=e.constructor;e:if(null!=t){if(!(f=e.c))return e;for(i=1,s=f[0];s>=10;s/=10,i++);if(o=t-i,0>o)o+=_,a=t,u=f[l=0],c=u/E(10,i-a-1)%10|0;else if(l=Math.ceil((o+1)/_),l>=f.length){if(!n)break e;for(;f.length<=l;f.push(0));u=c=0,i=1,o%=_,a=o-_+1}else{for(u=s=f[l],i=1;s>=10;s/=10,i++);o%=_,a=o-_+i,c=0>a?0:N(u/E(10,i-a-1)%10)}if(n=n||0>t||null!=f[l+1]||(0>a?u:u%E(10,i-a-1)),n=4>r?(c||n)&&(0==r||r==(e.s<0?3:2)):c>5||5==c&&(4==r||n||6==r&&(o>0?a>0?u/E(10,i-a):0:f[l-1])%10&1||r==(e.s<0?8:7)),1>t||!f[0])return f.length=0,n?(t-=e.e+1,f[0]=E(10,t%_),e.e=-t||0):f[0]=e.e=0,e;if(0==o?(f.length=l,s=1,l--):(f.length=l+1,s=E(10,_-o),f[l]=a>0?(u/E(10,i-a)%E(10,a)|0)*s:0),n)for(;;){if(0==l){for(o=1,a=f[0];a>=10;a/=10,o++);for(a=f[0]+=s,s=1;a>=10;a/=10,s++);o!=s&&(e.e++,f[0]==A&&(f[0]=1));break}if(f[l]+=s,f[l]!=A)break;f[l--]=0,s=1}for(o=f.length;0===f[--o];f.pop());}return w&&(e.e>p.maxE?e.c=e.e=null:e.ea,!i||!o)return u==c?0:!i^r?1:-1;if(u!=c)return u>c^r?1:-1;for(a=-1,s=(u=i.length)<(c=o.length)?u:c;++ao[a]^r?1:-1;return u==c?0:u>c^r?1:-1},C.decimalPlaces=C.dp=function(){var e,t,r=null;if(e=this.c){if(r=((t=e.length-1)-N(this.e/_))*_,t=e[t])for(;t%10==0;t/=10,r--);0>r&&(r=0)}return r},C.dividedBy=C.div=function(e,t){return b=2,I(this,new this.constructor(e,t))},C.dividedToIntegerBy=C.divToInt=function(e,t){var r=this,n=r.constructor;return b=18,g(I(r,new n(e,t),0,1,1),n.precision,n.rounding)},C.equals=C.eq=function(e,t){return b=3,0===this.cmp(e,t)},C.exponential=C.exp=function(){return c(this)},C.floor=function(){return g(new this.constructor(this),this.e+1,3)},C.greaterThan=C.gt=function(e,t){return b=4,this.cmp(e,t)>0},C.greaterThanOrEqualTo=C.gte=function(e,t){return b=5,t=this.cmp(e,t),1==t||0===t},C.isFinite=function(){return!!this.c},C.isInteger=C.isInt=function(){return!!this.c&&N(this.e/_)>this.c.length-2},C.isNaN=function(){return!this.s},C.isNegative=C.isNeg=function(){return this.s<0},C.isZero=function(){return!!this.c&&0==this.c[0]},C.lessThan=C.lt=function(e,t){return b=6,this.cmp(e,t)<0},C.lessThanOrEqualTo=C.lte=function(e,t){return b=7,t=this.cmp(e,t),-1==t||0===t},C.logarithm=C.log=function(e,t){var r,n,i,s,u,c,f,l,m,v=this,d=v.constructor,x=d.precision,y=d.rounding,N=5;if(null==e)e=new d(10),r=!0;else{if(b=15,e=new d(e,t),n=e.c,e.s<0||!n||!n[0]||!e.e&&1==n[0]&&1==n.length)return new d(0/0);r=e.eq(10)}if(n=v.c,v.s<0||!n||!n[0]||!v.e&&1==n[0]&&1==n.length)return new d(n&&!n[0]?-1/0:1!=v.s?0/0:n?0:1/0);if(u=r&&(s=n[0],n.length>1||1!=s&&10!=s&&100!=s&&1e3!=s&&1e4!=s&&1e5!=s&&1e6!=s),w=!1,f=x+N,l=f+10,c=h(v,f),r?(l>B.length&&p(d,1,l,"log"),i=new d(B.slice(0,l))):i=h(e,f),m=I(c,i,f,1),a(m.c,s=x,y))do if(f+=10,c=h(v,f),r?(l=f+10,l>B.length&&p(d,1,l,"log"),i=new d(B.slice(0,l))):i=h(e,f),m=I(c,i,f,1),!u){+o(m.c).slice(s+1,s+15)+1==1e14&&(m=g(m,x+1,0));break}while(a(m.c,s+=10,y));return w=!0,g(m,x,y)},C.minus=function(e,t){var r,n,i,o,a=this,s=a.constructor,u=a.s;if(b=8,e=new s(e,t),t=e.s,!u||!t)return new s(0/0);if(u!=t)return e.s=-t,a.plus(e);var c=a.c,f=e.c,l=N(e.e/_),p=N(a.e/_),m=s.precision,h=s.rounding;if(!p||!l){if(!c||!f)return c?(e.s=-t,e):new s(f?a:0/0);if(!c[0]||!f[0])return a=f[0]?(e.s=-t,e):new s(c[0]?a:3==h?-0:0),w?g(a,m,h):a}if(c=c.slice(),n=c.length,u=p-l){for((o=0>u)?(u=-u,r=c,n=f.length):(l=p,r=f),(p=Math.ceil(m/_))>n&&(n=p),u>(n+=2)&&(u=n,r.length=1),r.reverse(),t=u;t--;r.push(0));r.reverse()}else for((o=n<(i=f.length))&&(i=n),u=t=0;i>t;t++)if(c[t]!=f[t]){o=c[t]0)for(;t--;c[i++]=0);for(p=A-1,t=f.length;t>u;){if(c[--t]=10;t/=10,u++);return e.e=u+l*_-1,w?g(e,m,h):e},C.modulo=C.mod=function(e,t){var r,n,i=this,o=i.constructor,a=o.modulo;return b=9,e=new o(e,t),t=e.s,r=!i.c||!t||e.c&&!e.c[0],r||!e.c||i.c&&!i.c[0]?r?new o(0/0):g(new o(i),o.precision,o.rounding):(w=!1,9==a?(e.s=1,n=I(i,e,0,3,1),e.s=t,n.s*=t):n=I(i,e,0,a,1),n=n.times(e),w=!0,i.minus(n))},C.naturalLogarithm=C.ln=function(){return h(this)},C.negated=C.neg=function(){var e=new this.constructor(this);return e.s=-e.s||null,g(e)},C.plus=function(e,t){var r,n=this,i=n.constructor,o=n.s;if(b=10,e=new i(e,t),t=e.s,!o||!t)return new i(0/0);if(o!=t)return e.s=-t,n.minus(e);var a=n.c,s=e.c,u=N(e.e/_),c=N(n.e/_),f=i.precision,l=i.rounding;if(!c||!u){if(!a||!s)return new i(o/0);if(!a[0]||!s[0])return n=s[0]?e:new i(a[0]?n:0*o),w?g(n,f,l):n}if(a=a.slice(),o=c-u){for(0>o?(o=-o,r=a,t=s.length):(u=c,r=s,t=a.length),(c=Math.ceil(f/_))>t&&(t=c),o>++t&&(o=t,r.length=1),r.reverse();o--;r.push(0));r.reverse()}for(a.length-s.length<0&&(r=s,s=a,a=r),o=s.length,t=0,c=A;o;a[o]%=c)t=(a[--o]=a[o]+s[o]+t)/c|0;for(t&&(a.unshift(t),++u),o=a.length;0==a[--o];a.pop());for(e.c=a,o=1,t=a[0];t>=10;t/=10,o++);return e.e=o+u*_-1,w?g(e,f,l):e},C.precision=C.sd=function(e){var t=null,r=this;return e!=t&&e!==!!e&&1!==e&&0!==e&&p(r.constructor,"argument",e,"precision",1),r.c&&(t=l(r.c),e&&r.e+1>t&&(t=r.e+1)),t},C.round=function(){var e=this,t=e.constructor;return g(new t(e),e.e+1,t.rounding)},C.squareRoot=C.sqrt=function(){var e,t,r,n,i,a,s=this,u=s.c,c=s.s,f=s.e,l=s.constructor,p=new l(.5);if(1!==c||!u||!u[0])return new l(!c||0>c&&(!u||u[0])?0/0:u?s:1/0);for(w=!1,c=Math.sqrt(+s),0==c||c==1/0?(t=o(u),(t.length+f)%2==0&&(t+="0"),c=Math.sqrt(t),f=N((f+1)/2)-(0>f||f%2),c==1/0?t="1e"+f:(t=c.toExponential(),t=t.slice(0,t.indexOf("e")+1)+f),n=new l(t)):n=new l(c.toString()),r=(f=l.precision)+3;;)if(a=n,n=p.times(a.plus(I(s,a,r+2,1))),o(a.c).slice(0,r)===(t=o(n.c)).slice(0,r)){if(t=t.slice(r-3,r+1),"9999"!=t&&(i||"4999"!=t)){(!+t||!+t.slice(1)&&"5"==t.charAt(0))&&(g(n,f+1,1),e=!n.times(n).eq(s));break}if(!i&&(g(a,f+1,0),a.times(a).eq(s))){n=a;break}r+=4,i=1}return w=!0,g(n,f,l.rounding,e)},C.times=function(e,t){var r,n,i=this,o=i.constructor,a=i.c,s=(b=11,e=new o(e,t),e.c),u=N(i.e/_),c=N(e.e/_),f=i.s;if(t=e.s,e.s=f==t?1:-1,!((u||a&&a[0])&&(c||s&&s[0])))return new o(!f||!t||a&&!a[0]&&!s||s&&!s[0]&&!a?0/0:a&&s?0*e.s:e.s/0);for(n=u+c,f=a.length,t=s.length,t>f&&(r=a,a=s,s=r,c=f,f=t,t=c),c=f+t,r=[];c--;r.push(0));for(u=t-1;u>-1;u--){for(t=0,c=f+u;c>u;)t=r[c]+s[u]*a[c-u-1]+t,r[c--]=t%A|0,t=t/A|0;r[c]=(r[c]+t)%A|0}for(t?++n:r[0]||r.shift(),c=r.length;!r[--c];r.pop());for(e.c=r,f=1,t=r[0];t>=10;t/=10,f++);return e.e=f+n*_-1,w?g(e,o.precision,o.rounding):e},C.toDecimalPlaces=C.toDP=function(e,t){var r=this;return r=new r.constructor(r),null!=e&&u(r,e,"toDP")?g(r,(0|e)+r.e+1,s(r,t,"toDP")):r},C.toExponential=function(e,t){var r=this;return r.c?f(r,null!=e&&u(r,e,"toExponential")?0|e:null,null!=e&&s(r,t,"toExponential"),1):r.toString()},C.toFixed=function(e,t){var r,n=this,i=n.constructor,o=i.toExpNeg,a=i.toExpPos;return null!=e&&(e=u(n,e,r="toFixed")?n.e+(0|e):null,t=s(n,t,r)),i.toExpNeg=-(i.toExpPos=1/0),null!=e&&n.c?(r=f(n,e,t),n.s<0&&n.c&&(n.c[0]?r.indexOf("-")<0&&(r="-"+r):r=r.replace("-",""))):r=n.toString(),i.toExpNeg=o,i.toExpPos=a,r},C.toFormat=function(e,t){var r=this;if(!r.c)return r.toString();var n,i=r.s<0,o=r.constructor.format,a=o.groupSeparator,s=+o.groupSize,u=+o.secondaryGroupSize,c=r.toFixed(e,t).split("."),f=c[0],l=c[1],p=i?f.slice(1):f,m=p.length;if(u&&(n=s,s=u,m-=u=n),s>0&&m>0){for(n=m%s||s,f=p.substr(0,n);m>n;n+=s)f+=a+p.substr(n,s);u>0&&(f+=a+p.slice(n)),i&&(f="-"+f)}return l?f+o.decimalSeparator+((u=+o.fractionGroupSize)?l.replace(new RegExp("\\d{"+u+"}\\B","g"),"$&"+o.fractionGroupSeparator):l):f},C.toFraction=function(e){var t,r,n,i,a,s,u,c,f=this,m=f.constructor,h=t=new m(m.ONE),g=s=new m(0),v=f.c,d=new m(g);if(!v)return f.toString();for(n=d.e=l(v)-f.e-1,d.c[0]=E(10,(u=n%_)<0?_+u:u),(null==e||(!(b=12,a=new m(e)).s||(x=a.cmp(h)<0||!a.c)||m.errors&&N(a.e/_)0)&&(e=n>0?d:h),w=!1,a=new m(o(v)),u=m.precision,m.precision=n=v.length*_*2;c=I(a,d,0,1,1),r=t.plus(c.times(g)),1!=r.cmp(e);)t=g,g=r,h=s.plus(c.times(r=h)),s=r,d=a.minus(c.times(r=d)),a=r;return r=I(e.minus(t),g,0,1,1),s=s.plus(r.times(h)),t=t.plus(r.times(g)),s.s=h.s=f.s,i=I(h,g,n,1).minus(f).abs().cmp(I(s,t,n,1).minus(f).abs())<1?[h+"",g+""]:[s+"",t+""],w=!0,m.precision=u,i},C.toNearest=function(e,t){var r=this,n=r.constructor;return r=new n(r),null==e?(e=new n(n.ONE),t=n.rounding):(b=17,e=new n(e),t=s(r,t,"toNearest")),e.c?r.c&&(e.c[0]?(w=!1,r=I(r,e,0,4>t?[4,5,7,8][t]:t,1).times(e),w=!0,g(r)):r.c=[r.e=0]):r.s&&(e.s&&(e.s=r.s),r=e),r},C.toNumber=function(){var e=this;return+e||(e.s?0*e.s:0/0)},C.toPower=C.pow=function(e,t){var r,n,i,s,u=this,f=u.constructor,l=u.s,p=(b=13,+(e=new f(e,t))),v=0>p?-p:p,d=f.precision,x=f.rounding;if(!u.c||!e.c||(i=!u.c[0])||!e.c[0])return new f(E(i?0*l:+u,p));if(u=new f(u),r=u.c.length,!u.e&&u.c[0]==u.s&&1==r)return u;if(t=e.c.length-1,e.e||e.c[0]!=e.s||t)if(n=N(e.e/_),i=n>=t,!i&&0>l)s=new f(0/0);else{if(i&&T>r*_*v){if(s=m(f,u,v),e.s<0)return f.ONE.div(s)}else{if(l=0>l&&1&e.c[Math.max(n,t)]?-1:1,t=E(+u,p),n=0!=t&&isFinite(t)?new f(t+"").e:N(p*(Math.log("0."+o(u.c))/Math.LN10+u.e+1)),n>f.maxE+1||n0?l/0:0);w=!1,f.rounding=u.s=1,v=Math.min(12,(n+"").length),s=c(e.times(h(u,d+v)),d),s=g(s,d+5,1),a(s.c,d,x)&&(n=d+10,s=g(c(e.times(h(u,n+v)),n),n+5,1),+o(s.c).slice(d+1,d+15)+1==1e14&&(s=g(s,d+1,0))),s.s=l,w=!0,f.rounding=x}s=g(s,d,x)}else s=g(u,d,x);return s},C.toPrecision=function(e,t){var r=this;return null!=e&&u(r,e,"toPrecision",1)&&r.c?f(r,0|--e,s(r,t,"toPrecision"),2):r.toString()},C.toSignificantDigits=C.toSD=function(e,t){var r=this,n=r.constructor;return r=new n(r),null!=e&&u(r,e,"toSD",1)?g(r,0|e,s(r,t,"toSD")):g(r,n.precision,n.rounding)},C.toString=function(e){var t,r,n,i=this,a=i.constructor,s=i.e;if(null===s)r=i.s?"Infinity":"NaN";else{if(e===t&&(s<=a.toExpNeg||s>=a.toExpPos))return f(i,null,a.rounding,1);if(r=o(i.c),0>s){for(;++s;r="0"+r);r="0."+r}else if(n=r.length,s>0)if(++s>n)for(s-=n;s--;r+="0");else n>s&&(r=r.slice(0,s)+"."+r.slice(s));else if(t=r.charAt(0),n>1)r=t+"."+r.slice(1);else if("0"==t)return t;if(null!=e)if((x=!(e>=2&&65>e))||e!=(0|e)&&a.errors)p(a,"base",e,"toString",0);else if(r=v(a,r,0|e,10,i.s),"0"==r)return r}return i.s<0?"-"+r:r},C.truncated=C.trunc=function(){return g(new this.constructor(this),this.e+1,1)},C.valueOf=C.toJSON=function(){return this.toString()},v=function(){function e(e,t,r){for(var n,i,o=[0],a=0,s=e.length;s>a;){for(i=o.length;i--;o[i]*=t);for(o[n=0]+=O.indexOf(e.charAt(a++));nr-1&&(null==o[n+1]&&(o[n+1]=0),o[n+1]+=o[n]/r|0,o[n]%=r)}return o.reverse()}return function(t,r,n,i,o){var a,s,u,c,f,l,p=r.indexOf("."),h=t.precision,g=t.rounding;for(37>i&&(r=r.toLowerCase()),p>=0&&(r=r.replace(".",""),l=new t(i),c=m(t,l,r.length-p),l.c=e(c.toFixed(),10,n),l.e=l.c.length),f=e(r,i,n),a=s=f.length;0==f[--s];f.pop());if(!f[0])return"0";if(0>p?a--:(c.c=f,c.e=a,c.s=o,c=I(c,l,h,g,0,n),f=c.c,u=c.r,a=c.e),p=f[h],s=n/2,u=u||null!=f[h+1],4>g?(null!=p||u)&&(0==g||g==(c.s<0?3:2)):p>s||p==s&&(4==g||u||6==g&&1&f[h-1]||g==(c.s<0?8:7)))for(f.length=h,--n;++f[--h]>n;)f[h]=0,h||(++a,f.unshift(1));else f.length=h;for(s=f.length;!f[--s];);for(p=0,r="";s>=p;r+=O.charAt(f[p++]));if(0>a){for(;++a;r="0"+r);r="0."+r}else if(p=r.length,++a>p)for(a-=p;a--;r+="0");else p>a&&(r=r.slice(0,a)+"."+r.slice(a));return r}}();var I=function(){function e(e,t,r){var n,i=0,o=e.length;for(e=e.slice();o--;)n=e[o]*t+i,e[o]=n%r|0,i=n/r|0;return i&&e.unshift(i),e}function t(e,t,r,n){var i,o;if(r!=n)o=r>n?1:-1;else for(i=o=0;r>i;i++)if(e[i]!=t[i]){o=e[i]>t[i]?1:-1;break}return o}function r(e,t,r,n){for(var i=0;r--;)e[r]-=i,i=e[r]1;e.shift());}return function(n,i,o,a,s,u){var c,f,l,p,m,h,v,d,x,y,w,b,E,M,O,C,S,z,T,B=n.constructor,I=n.s==i.s?1:-1,q=n.c,P=i.c;if(!(q&&q[0]&&P&&P[0]))return new B(n.s&&i.s&&(q?!P||q[0]!=P[0]:P)?q&&0==q[0]||!P?0*I:I/0:0/0);for(u?(p=1,f=n.e-i.e):(u=A,p=_,f=N(n.e/p)-N(i.e/p)),z=P.length,C=q.length,x=new B(I),y=x.c=[],l=0;P[l]==(q[l]||0);l++);if(P[l]>(q[l]||0)&&f--,null==o?(I=o=B.precision,a=B.rounding):I=s?o+(n.e-i.e)+1:o,0>I)y.push(1),m=!0;else{if(I=I/p+2|0,l=0,1==z){for(h=0,P=P[0],I++;(C>l||h)&&I--;l++)M=h*u+(q[l]||0),y[l]=M/P|0,h=M%P|0;m=h||C>l}else{for(h=u/(P[0]+1)|0,h>1&&(P=e(P,h,u),q=e(q,h,u),z=P.length,C=q.length),O=z,w=q.slice(0,z),b=w.length;z>b;w[b++]=0);T=P.slice(),T.unshift(0),S=P[0],P[1]>=u/2&&S++;do h=0,c=t(P,w,z,b),0>c?(E=w[0],z!=b&&(E=E*u+(w[1]||0)),h=E/S|0,h>1?(h>=u&&(h=u-1),v=e(P,h,u),d=v.length,b=w.length,c=t(v,w,d,b),1==c&&(h--,r(v,d>z?T:P,d,u))):(0==h&&(c=h=1),v=P.slice()),d=v.length,b>d&&v.unshift(0),r(w,v,b,u),-1==c&&(b=w.length,c=t(P,w,z,b),1>c&&(h++,r(w,b>z?T:P,b,u))),b=w.length):0===c&&(h++,w=[0]),y[l++]=h,c&&w[0]?w[b++]=q[O]||0:(w=[q[O]],b=1);while((O++=10;I/=10,l++);x.e=l+f*p-1,g(x,s?o+x.e+1:o,a,m)}return x}}();d=function(){function e(e){var t,r,n,i=this,o="config",a=i.errors?parseInt:parseFloat;return e==r||"object"!=typeof e&&!p(i,"object expected",e,o)?i:((n=e[t="precision"])!=r&&((x=1>n||n>z)||a(n)!=n?p(i,t,n,o,0):i[t]=0|n),(n=e[t="rounding"])!=r&&((x=0>n||n>8)||a(n)!=n?p(i,t,n,o,0):i[t]=0|n),(n=e[t="toExpNeg"])!=r&&((x=-S>n||n>0)||a(n)!=n?p(i,t,n,o,0):i[t]=N(n)),(n=e[t="toExpPos"])!=r&&((x=0>n||n>S)||a(n)!=n?p(i,t,n,o,0):i[t]=N(n)),(n=e[t="minE"])!=r&&((x=-S>n||n>0)||a(n)!=n?p(i,t,n,o,0):i[t]=N(n)),(n=e[t="maxE"])!=r&&((x=0>n||n>S)||a(n)!=n?p(i,t,n,o,0):i[t]=N(n)),(n=e[t="errors"])!=r&&(n===!!n||1===n||0===n?(x=b=0,i[t]=!!n):p(i,t,n,o,1)),(n=e[t="crypto"])!=r&&(n===!!n||1===n||0===n?i[t]=!(!n||!y||"object"!=typeof y):p(i,t,n,o,1)),(n=e[t="modulo"])!=r&&((x=0>n||n>9)||a(n)!=n?p(i,t,n,o,0):i[t]=0|n),(e=e[t="format"])!=r&&("object"==typeof e?i[t]=e:p(i,"format object expected",e,o)),i)}function t(e){return new this(e).exp()}function r(e){return new this(e).ln()}function n(e,t){return new this(e).log(t)}function i(e,t,r){var n,i,o=0;for("[object Array]"==M.call(t[0])&&(t=t[0]),n=new e(t[0]);++oi;)n=t[i],n>=429e7?t[i]=y.getRandomValues(new Uint32Array(1))[0]:o[i++]=n%1e7;else if(y&&y.randomBytes){for(t=y.randomBytes(r*=4);r>i;)n=t[i]+(t[i+1]<<8)+(t[i+2]<<16)+((127&t[i+3])<<24),n>=214e7?y.randomBytes(4).copy(t,i):(o.push(n%1e7),i+=4);i=r/4}else p(a,"crypto unavailable",y,"random");if(!i)for(;r>i;)o[i++]=1e7*Math.random()|0;for(r=o[--i],e%=_,r&&e&&(n=E(10,_-e),o[i]=(r/n|0)*n);0===o[i];i--)o.pop();if(0>i)o=[r=0];else{for(r=-1;0===o[0];)o.shift(),r-=_;for(i=1,n=o[0];n>=10;)n/=10,i++;_>i&&(r-=_-i)}return s.e=r,s.c=o,s}function f(e){return new this(e).sqrt()}function l(i){function u(e,t){var r=this;if(!(r instanceof u))return p(u,"Decimal called without new",e),new u(e,t);if(r.constructor=u,e instanceof u){if(null==t)return b=0,r.s=e.s,r.e=e.e,r.c=(e=e.c)?e.slice():e,r;if(10==t)return g(new u(e),u.precision,u.rounding);e+=""}return m(u,r,e,t)}return u.precision=20,u.rounding=4,u.modulo=1,u.toExpNeg=-7,u.toExpPos=21,u.minE=-S,u.maxE=S,u.errors=!0,u.crypto=!1,u.format={decimalSeparator:".",groupSeparator:",",groupSize:3,secondaryGroupSize:0,fractionGroupSeparator:" ",fractionGroupSize:0},u.prototype=C,u.ONE=new u(1),u.ROUND_UP=0,u.ROUND_DOWN=1,u.ROUND_CEIL=2,u.ROUND_FLOOR=3,u.ROUND_HALF_UP=4,u.ROUND_HALF_DOWN=5,u.ROUND_HALF_EVEN=6,u.ROUND_HALF_CEIL=7,u.ROUND_HALF_FLOOR=8,u.EUCLID=9,u.config=e,u.constructor=l,u.exp=t,u.ln=r,u.log=n,u.max=o,u.min=a,u.pow=s,u.sqrt=f,u.random=c,null!=i&&u.config(i),u}var m=function(){var e=/^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,t=String.prototype.trim||function(){return this.replace(/^\s+|\s+$/g,"")};return function(r,n,i,o){var a,s,u,c,f,l;if("string"!=typeof i&&(i=(c="number"==typeof i||"[object Number]"==M.call(i))&&0===i&&0>1/i?"-0":i+""),f=i,null==o&&e.test(i))n.s=45===i.charCodeAt(0)?(i=i.slice(1),-1):1;else{if(10==o)return g(new r(i),r.precision,r.rounding);if(i=t.call(i).replace(/^\+(?!-)/,""),n.s=45===i.charCodeAt(0)?(i=i.replace(/^-(?!-)/,""),-1):1,null!=o?o!=(0|o)&&r.errors||(x=!(o>=2&&65>o))?(p(r,"base",o,0,0),l=e.test(i)):(a="["+O.slice(0,o=0|o)+"]+",i=i.replace(/\.$/,"").replace(/^\./,"0."),(l=new RegExp("^"+a+"(?:\\."+a+")?$",37>o?"i":"").test(i))?(c&&(i.replace(/^0\.0*|\./,"").length>15&&p(r,0,f),c=!c),i=v(r,i,10,o,n.s)):"Infinity"!=i&&"NaN"!=i&&(p(r,"not a base "+o+" number",f),i="NaN")):l=e.test(i),!l)return n.c=n.e=null,"Infinity"!=i&&("NaN"!=i&&p(r,"not a number",f),n.s=null),b=0,n}for((s=i.indexOf("."))>-1&&(i=i.replace(".","")),(u=i.search(/e/i))>0?(0>s&&(s=u),s+=+i.slice(u+1),i=i.substring(0,u)):0>s&&(s=i.length),u=0;48===i.charCodeAt(u);u++);for(o=i.length;48===i.charCodeAt(--o););if(i=i.slice(u,o+1)){if(o=i.length,c&&o>15&&p(r,0,f),n.e=s=s-u-1,n.c=[],u=(s+1)%_,0>s&&(u+=_),o>u){for(u&&n.c.push(+i.slice(0,u)),o-=_;o>u;)n.c.push(+i.slice(u,u+=_));i=i.slice(u),u=_-i.length}else u-=o;for(;u--;i+="0");n.c.push(+i),w&&(n.e>r.maxE?n.c=n.e=null:n.er;r++)t.push(0);return t}n.prototype.toFixed=function(e){var t=this.roundDigits(this.exponent+1+(e||0)),r=t.coefficients,n=t.exponent+1,o=n+(e||0);return r.lengthn&&(r=i(-n+1).concat(r),n=1),e&&r.splice(n,0,0===n?"0.":"."),this.sign+r.join("")},n.prototype.toExponential=function(e){var t=e?this.roundDigits(e):this.clone(),r=t.coefficients,n=t.exponent;r.length0?"."+r.join(""):"")+"e"+(n>=0?"+":"")+n},n.prototype.toPrecision=function(e,t){var r=t&&void 0!==t.lower?t.lower:.001,n=t&&void 0!==t.upper?t.upper:1e5,o=Math.abs(Math.pow(10,this.exponent));if(r>o||o>=n)return this.toExponential(e);var a=e?this.roundDigits(e):this.clone(),s=a.coefficients,u=a.exponent;s.length0?u:0;return c=e;)r.unshift(0),t.exponent++,e++;if(r.length>e){var n=r.splice(e);if(n[0]>=5){var i=e-1;for(r[i]++;10===r[i];)r.pop(),0===i&&(r.unshift(0),t.exponent++,i++),i--,r[i]++}}return t},e.exports=n},function(e,t,r){"use strict";e.exports={end:!0}},function(e,t,r){"use strict";function n(e){for(var t=e.getIdentifier(),r=0;r>",rightLogShift:">>>",equal:"=",unequal:"\\neq",smaller:"<",larger:">",smallerEq:"\\leq",largerEq:"\\geq",bitAnd:"\\&",bitXor:"\\underline{|}",bitOr:"|",and:"\\wedge",xor:"\\veebar",or:"\\vee"};var i="\\mathrm{%name%}\\left(%*%\\right)",o={abs:"\\left|%0%\\right|",add:"\\left(%0%+%1%\\right)",ceil:"\\left\\lceil%0%\\right\\rceil",cube:"\\left(%0%\\right)^3",divide:"\\frac{%0%}{%1%}",dotDivide:"\\left(%0%"+t.operators.dotDivide+"%1%\\right)",dotMultiply:"\\left(%0%"+t.operators.dotMultiply+"%1%\\right)",dotPow:"\\left(%0%"+t.operators.dotPow+"%1%\\right)",exp:"\\exp\\left(%0%\\right)",fix:i,floor:"\\left\\lfloor%0%\\right\\rfloor",gcd:"\\gcd\\left(%*%\\right)",lcm:i,log10:"\\log_{10}\\left(%0%\\right)",log:{1:"\\ln\\left(%0%\\right)",2:"\\log_{%1%}\\left(%0%\\right)"},mod:"\\left(%0%"+t.operators.mod+"%1%\\right)",multiply:"\\left(%0%"+t.operators.multiply+"%1%\\right)",norm:{1:"\\left\\|%0%\\right\\|",2:i},nthRoot:"\\sqrt[%1%]{%0%}",pow:"\\left(%0%\\right)"+t.operators.pow+"{%1%}",round:{1:"\\left\\lfloor%0%\\right\\rceil",2:i},sign:i,sqrt:"\\sqrt{%0%}",square:"\\left(%0%\\right)^2",subtract:"\\left(%0%"+t.operators.subtract+"%1%\\right)",unaryMinus:t.operators.unaryMinus+"\\left(%0%\\right)",unaryPlus:t.operators.unaryPlus+"\\left(%0%\\right)",xgcd:i,bitAnd:"\\left(%0%"+t.operators.bitAnd+"%1%\\right)",bitOr:"\\left(%0%"+t.operators.bitOr+"%1%\\right)",bitXor:"\\left(%0%"+t.operators.bitXor+"%1%\\right)",bitNot:t.operators.bitNot+"\\left(%0%\\right)",leftShift:"\\left(%0%"+t.operators.leftShift+"%1%\\right)",rightArithShift:"\\left(%0%"+t.operators.rightArithShift+"%1%\\right)",rightLogShift:"\\left(%0%"+t.operators.rightLogShift+"%1%\\right)",arg:"\\arg\\left(%0%\\right)",conj:"\\left(%0%\\right)^*",im:"\\Im\\left\\lbrace%0%\\right\\rbrace",re:"\\Re\\left\\lbrace%0%\\right\\rbrace",bignumber:{0:"0",1:"\\left(%0%\\right)"},"boolean":i,chain:i,complex:{0:"0",1:"\\left(%0%\\right)",2:"\\left(\\left(%0%\\right)+"+t.symbols.i+"\\cdot\\left(%1%\\right)\\right)"},index:i,matrix:{0:"\\begin{bmatrix}\\end{bmatrix}",1:"\\left(%0%\\right)",2:"\\left(%0%\\right)"},number:{0:"0",1:"\\left(%0%\\right)",2:"\\left(\\left(%0%\\right)%1%\\right)"},parser:i,sparse:{0:"\\begin{bsparse}\\end{bsparse}",1:"\\left(%0%\\right)"},string:{0:'""', +1:function(e){return'"'+e.args[0].toString()+'"'}},unit:{1:"\\left(%0%\\right)",2:"\\left(\\left(%0%\\right)%1%\\right)"},compile:i,eval:i,help:i,parse:i,and:"\\left(%0%"+t.operators.and+"%1%\\right)",not:t.operators.not+"\\left(%0%\\right)",or:"\\left(%0%"+t.operators.or+"%1%\\right)",xor:"\\left(%0%"+t.operators.xor+"%1%\\right)",concat:i,cross:"\\left(%0%\\right)\\times\\left(%1%\\right)",det:"\\det\\left(%0%\\right)",diag:i,dot:"\\left(%0%\\cdot%1%\\right)",eye:i,flatten:i,inv:"\\left(%0%\\right)^{-1}",ones:i,range:i,resize:i,size:i,squeeze:i,subset:i,trace:"\\mathrm{tr}\\left(%0%\\right)",transpose:"\\left(%0%\\right)"+t.operators.transpose,zeros:i,combinations:"\\binom{%0%}{%1%}",distribution:i,factorial:"\\left(%0%\\right)"+t.operators.factorial,gamma:"\\Gamma\\left(%0%\\right)",permutations:i,pickRandom:i,randomInt:i,random:i,compare:i,deepEqual:i,equal:"\\left(%0%"+t.operators.equal+"%1%\\right)",largerEq:"\\left(%0%"+t.operators.largerEq+"%1%\\right)",larger:"\\left(%0%"+t.operators.larger+"%1%\\right)",smallerEq:"\\left(%0%"+t.operators.smallerEq+"%1%\\right)",smaller:"\\left(%0%"+t.operators.smaller+"%1%\\right)",unequal:"\\left(%0%"+t.operators.unequal+"%1%\\right)",max:"\\max\\left(%*%\\right)",mean:i,median:i,min:"\\min\\left(%*%\\right)",prod:i,std:i,sum:i,"var":"\\mathrm{Var}\\left(%*%\\right)",acosh:"\\cosh^{-1}\\left(%0%\\right)",acos:"\\cos^{-1}\\left(%0%\\right)",acoth:"\\coth^{-1}\\left(%0%\\right)",acot:"\\cot^{-1}\\left(%0%\\right)",acsch:"\\mathrm{csch}^{-1}\\left(%0%\\right)",acsc:"\\csc^{-1}\\left(%0%\\right)",asech:"\\mathrm{sech}^{-1}\\left(%0%\\right)",asec:"\\sec^{-1}\\left(%0%\\right)",asinh:"\\sinh^{-1}\\left(%0%\\right)",asin:"\\sin^{-1}\\left(%0%\\right)",atan2:"\\mathrm{atan2}\\left(%*%\\right)",atanh:"\\tanh^{-1}\\left(%0%\\right)",atan:"\\tan^{-1}\\left(%0%\\right)",cosh:"\\cosh\\left(%0%\\right)",cos:"\\cos\\left(%0%\\right)",coth:"\\coth\\left(%0%\\right)",cot:"\\cot\\left(%0%\\right)",csch:"\\mathrm{csch}\\left(%0%\\right)",csc:"\\csc\\left(%0%\\right)",sech:"\\mathrm{sech}\\left(%0%\\right)",sec:"\\sec\\left(%0%\\right)",sinh:"\\sinh\\left(%0%\\right)",sin:"\\sin\\left(%0%\\right)",tanh:"\\tanh\\left(%0%\\right)",tan:"\\tan\\left(%0%\\right)",to:"\\left(%0%"+t.operators.to+"%1%\\right)",clone:i,filter:i,forEach:i,format:i,"import":i,map:i,print:i,sort:i,"typeof":i},a={deg:"^\\circ"};t.toSymbol=function(e){if(a.hasOwnProperty(e))return a[e];if(t.symbols.hasOwnProperty(e))return t.symbols[e];if(-1!==e.indexOf("_")){var r=e.indexOf("_");return t.toSymbol(e.substring(0,r))+"_{"+t.toSymbol(e.substring(r+1))+"}"}return"\\mathrm{"+e+"}"},t.toFunction=function(e,t,r){var a=o[r],s=e.args.map(function(e){return e.toTex(t)});switch(typeof a){case"function":return a(e,t);case"string":return n(a,r,s);case"object":switch(typeof a[s.length]){case"function":return a[s.length](e,t);case"string":return n(a[s.length],r,s)}default:return n(i,r,s)}}},function(e,t,r){"use strict";function n(e,t,r,n){var i=e.Matrix,c=function(e,t){var r=e.size();if(2!==r.length)throw new RangeError("Matrix must be two dimensional (size: "+o.format(r)+")");var n=r[0],c=r[1];if(n!==c)throw new RangeError("Matrix must be square (size: "+o.format(r)+")");if(t instanceof i){var f=t.size();if(1===f.length){if(f[0]!==n)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.")}else{if(2!==f.length)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");if(f[0]!==n||1!==f[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.")}var l=new Array(n);return t.forEach(function(e,t){l[t[0]]=s.clone(e)},!0),l}if(u(t)){var p=a.size(t);if(1===p.length){if(p[0]!==n)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");return s.clone(t)}if(2===p.length){if(p[0]!==n||1!==p[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");return t.map(function(e){return s.clone(e[0])})}throw new RangeError("Dimension mismatch. Matrix columns must match vector length.")}};return c}var i=r(171),o=i.string,a=i.array,s=i.object,u=Array.isArray;t.name="substitutionValidation",t.factory=n},function(e,t,r){var n,i,o;!function(r){i=[],n=r,o="function"==typeof n?n.apply(t,i):n,!(void 0!==o&&(e.exports=o))}(function(){function e(e){var t=d.types[e];if(!t){var r;for(var n in d.types)if(d.types.hasOwnProperty(n)&&n.toLowerCase()==e.toLowerCase()){r=n;break}throw new Error('Unknown type "'+e+'"'+(r?'. Did you mean "'+r+'"?':""))}return t}function t(e,t,r,n,i){var o,a=p(n),s=i?i.split(","):null,u=s&&m(s,"any"),c={fn:e,index:r,actual:n,expected:s};o=s?t>r&&!u?"Unexpected type of argument (expected: "+s.join(" or ")+", actual: "+a+", index: "+r+")":"Too few arguments (expected: "+s.join(" or ")+", index: "+r+")":"Too many arguments (expected: "+r+", actual: "+t+")";var f=new TypeError(o);return f.data=c,f}function r(e){this.name=e||"refs",this.categories={}}function n(e,t){if("string"==typeof e){var r=e.trim(),i="..."===r.substr(0,3);if(i&&(r=r.substr(3)),""===r)this.types=["any"];else{this.types=r.split("|");for(var o=0;op)n[f]=c;else if(0===p)throw new Error('Signature "'+f+'" is defined twice')}else n[f]=c}}for(f in n)n.hasOwnProperty(f)&&o.push(n[f]);for(r=0;rr;r++)t[r]="arg"+r;return t}function f(e,n){var i=new r,o=a(n);if(0==o.length)throw new Error("No signatures provided");var f=u(o,[]),p=[],m=e||"",h=c(l(o));p.push("function "+m+"("+h.join(", ")+") {"),p.push(' "use strict";'),p.push(f.toCode(i," ")),p.push("}");var g=[i.toCode(),"return "+p.join("\n")].join("\n"),v=new Function(i.name,"createError",g),d=v(i,t);return d.signatures=s(o),d}function l(e){for(var t=0,r=0;rt&&(t=n)}return t}function p(e){for(var t in h)if(h.hasOwnProperty(t)&&"Object"!==t&&h[t](e))return t;return h.Object(e)?t:"unknown"}function m(e,t){return-1!==e.indexOf(t)}r.prototype.add=function(e,t){var r=t||"fn";this.categories[r]||(this.categories[r]=[]);var n=this.categories[r].indexOf(e);return-1==n&&(n=this.categories[r].length,this.categories[r].push(e)),r+n},r.prototype.toCode=function(){var e=[],t=this.name+".categories",r=this.categories;for(var n in r)if(r.hasOwnProperty(n))for(var i=r[n],o=0;o0},n.prototype.toString=function(e){for(var t=[],r={},n=0;nt.params.length)return 1;if(e.params.lengthr;r++)e.params[r].hasConversions()&&o++,t.params[r].hasConversions()&&a++;if(o>a)return 1;if(a>o)return-1;for(r=0;r "+o+") {"),i.push(r+" var varArgs = [];"),i.push(r+" for (var i = "+o+"; i < arguments.length; i++) {"),i.push(r+" varArgs.push(arguments[i]);"),i.push(r+" }"),i.push(this.signature.toCode(t,r+" ")),i.push(r+"}");else{for(var u=function(r,n){for(var i=new Array(r.length),o=0;o "+r+") {",t+" throw createError('', arguments.length, "+r+", arguments["+r+"]);",t+"}"].join("\n");for(var n={},i=[],o=0;o