{"version":3,"file":"vendor-mathjs-CHpGzqrm.js","sources":["../../../../node_modules/mathjs/node_modules/@babel/runtime/helpers/esm/extends.js","../../../../node_modules/mathjs/lib/esm/core/config.js","../../../../node_modules/mathjs/lib/esm/utils/is.js","../../../../node_modules/mathjs/lib/esm/utils/object.js","../../../../node_modules/mathjs/lib/esm/core/function/config.js","../../../../node_modules/mathjs/lib/esm/entry/configReadonly.js","../../../../node_modules/mathjs/lib/esm/utils/number.js","../../../../node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../../../../node_modules/mathjs/lib/esm/utils/string.js","../../../../node_modules/mathjs/lib/esm/error/DimensionError.js","../../../../node_modules/mathjs/lib/esm/error/IndexError.js","../../../../node_modules/mathjs/lib/esm/utils/array.js","../../../../node_modules/mathjs/lib/esm/utils/factory.js","../../../../node_modules/mathjs/lib/esm/utils/customs.js","../../../../node_modules/mathjs/lib/esm/utils/map.js","../../../../node_modules/mathjs/lib/esm/core/function/typed.js","../../../../node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","../../../../node_modules/mathjs/lib/esm/type/complex/Complex.js","../../../../node_modules/mathjs/lib/esm/type/fraction/Fraction.js","../../../../node_modules/mathjs/lib/esm/type/matrix/Matrix.js","../../../../node_modules/mathjs/lib/esm/utils/function.js","../../../../node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","../../../../node_modules/mathjs/lib/esm/utils/collection.js","../../../../node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../../../../node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","../../../../node_modules/mathjs/lib/esm/utils/complex.js","../../../../node_modules/mathjs/lib/esm/function/relational/compareUnits.js","../../../../node_modules/mathjs/lib/esm/function/relational/equalScalar.js","../../../../node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","../../../../node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","../../../../node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","../../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js","../../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js","../../../../node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","../../../../node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","../../../../node_modules/mathjs/lib/esm/function/complex/conj.js","../../../../node_modules/mathjs/lib/esm/utils/noop.js","../../../../node_modules/mathjs/lib/esm/function/matrix/size.js","../../../../node_modules/mathjs/lib/esm/function/matrix/dot.js","../../../../node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js"],"sourcesContent":["export default function _extends() {\n  _extends = Object.assign ? Object.assign.bind() : function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n    return target;\n  };\n  return _extends.apply(this, arguments);\n}","export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  epsilon: 1e-12,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', or 'Fraction\n  number: 'number',\n  // number of significant digits in BigNumbers\n  precision: 64,\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n};","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n//   instanceof cannot be used because that would not allow to pass data from\n//   one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n//   matches for \"fake\" instances like plain objects with a property `isUnit`.\n//   That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n//   for security reasons, so these functions are not exposed in the expression\n//   parser.\n\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n    return false;\n  }\n  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n    return true;\n  }\n  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n    return true;\n  }\n  return false;\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nexport function rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof x;\n  if (t === 'object') {\n    if (x === null) return 'null';\n    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name;\n    return 'Object'; // just in case\n  }\n\n  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber } from './is.js';\n\n/**\n * Clone an object\n *\n *     clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone(x) {\n  var type = typeof x;\n\n  // immutable primitive types\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n  if (x instanceof Date) return new Date(x.valueOf());\n  if (isBigNumber(x)) return x; // bignumbers are immutable\n  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n\n  // object\n  return mapObject(x, clone);\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject(object, callback) {\n  var clone = {};\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n  return clone;\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n  return a;\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend(a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend');\n  }\n  for (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n        if (a[prop] && a[prop].constructor === Object) {\n          deepExtend(a[prop], b[prop]);\n        } else {\n          a[prop] = b[prop];\n        }\n      } else if (Array.isArray(b[prop])) {\n        throw new TypeError('Arrays are not supported by deepExtend');\n      } else {\n        a[prop] = b[prop];\n      }\n    }\n  }\n  return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual(a, b) {\n  var prop, i, len;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  } else if (typeof a === 'function') {\n    return a === b;\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false;\n    }\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false;\n      }\n    }\n    return true;\n  } else {\n    return a === b;\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n  var flattenedObject = {};\n  _deepFlatten(nestedObject, flattenedObject);\n  return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {\n          return null;\n        }\n      });\n      return true;\n    }\n  } catch (e) {}\n  return false;\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object         Object where to add the property\n * @param {string} prop           Property name\n * @param {Function} valueResolver Function returning the property value. Called\n *                                without arguments.\n */\nexport function lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n  var _value;\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\n      }\n      return _value;\n    },\n    set: function set(value) {\n      _value = value;\n      _uninitialized = false;\n    },\n    configurable: true,\n    enumerable: true\n  });\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n  var obj = object;\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n      obj = obj[key];\n    }\n  }\n  return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)\n * - name: string (optional)\n * - path: string    A dot separated path (optional)\n * - math: boolean   If true (false by default), the math namespace is passed\n *                   as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get(object, path) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return get(object, path.split('.'));\n    } else {\n      return object[path];\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n  return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set(object, path, value) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return set(object, path.split('.'), value);\n    } else {\n      object[path] = value;\n      return object;\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n    child = child[key];\n  }\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n  return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick(object, properties, transform) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n  return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow(object, properties) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n  return copy;\n}\nexport function values(object) {\n  return Object.keys(object).map(key => object[key]);\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.indexOf('.') !== -1;\n}","import { clone, mapObject, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\n\nexport function configFactory(config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} epsilon\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config(options) {\n    if (options) {\n      var prev = mapObject(config, clone);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      deepExtend(config, options);\n      var curr = mapObject(config, clone);\n      var changes = mapObject(options, clone);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return mapObject(config, clone);\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n  // attach the config properties as readonly properties to the config function\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\n}\n\n/**\n * Validate an option\n * @param {Object} options         Object with options\n * @param {string} name            Name of the option to validate\n * @param {Array.<string>} values  Array with valid values for this option\n */\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !contains(values, options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';\n\n// create a read-only version of config\nexport var config = /* #__PURE__ */function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n  return Object.freeze(DEFAULT_CONFIG);\n};\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\n});","import { isNumber } from './is.js';\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = /* #__PURE__ */Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = /* #__PURE__ */Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = /* #__PURE__ */Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = /* #__PURE__ */Math.log1p || function (x) {\n  return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport var cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n  var negate = x < 0;\n  var result;\n  if (negate) {\n    x = -x;\n  }\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3);\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n  return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = /* #__PURE__ */Math.expm1 || function expm1(x) {\n  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n    if (n < 0) {\n      n = n + 2 ** size;\n    }\n    suffix = \"i\".concat(size);\n  }\n  var sign = '';\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'engineering'    Always use engineering notation.\n *                                          For example '123.4e+0' and '14.0e+6'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lowerExp` and `upperExp` bounds, and\n *                                          uses exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default,\n *                                          not rounding any digits.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12.071, {notation: 'fixed'})                // '12'\n *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'\n *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'\n *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  }\n\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    }\n\n    // determine precision from options\n    if (isNumber(options)) {\n      precision = options;\n    } else if (isNumber(options.precision)) {\n      precision = options.precision;\n    }\n    if (options.wordSize) {\n      wordSize = options.wordSize;\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  }\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize);\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options && options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\n  }\n  var sign = match[1];\n  var digits = match[2];\n  var exponent = parseFloat(match[4] || '0');\n  var dot = digits.indexOf('.');\n  exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n  .replace(/^0*/, function (zeros) {\n    // remove leading zeros, add their count to the exponent\n    exponent -= zeros.length;\n    return '';\n  }).replace(/0*$/, '') // remove trailing zeros\n  .split('').map(function (d) {\n    return parseInt(d);\n  });\n  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n  return {\n    sign,\n    coefficients,\n    exponent\n  };\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients;\n\n  // find nearest lower multiple of 3 for exponent\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n  if (isNumber(precision)) {\n    // add zeroes to give correct sig figs\n    while (precision > c.length || e - newExp + 1 > c.length) {\n      c.push(0);\n    }\n  } else {\n    // concatenate coefficients with necessary zeros\n    // add zeros if necessary (for example: 1e+8 -> 100e+6)\n    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  }\n\n  // find difference in exponents\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1;\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\n  }\n\n  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n  // otherwise concat with the rest of the coefficients\n  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n  return rounded.sign + str;\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined]  Optional number of decimals after the\n *                                        decimal point. null by default.\n */\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n\n  // append zeros if needed\n  var pp = p + (precision || 0);\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n  return rounded.sign + c.join('');\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n */\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent;\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n    // prepend zeros\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n    return rounded.sign + c.join('');\n  }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split       A value split with .splitNumber(value)\n * @param {number} precision  A positive integer\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n *              with rounded digits\n */\nexport function roundDigits(split, precision) {\n  // create a clone\n  var rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  };\n  var c = rounded.coefficients;\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n      while (c[i] === 10) {\n        c.pop();\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n        i--;\n        c[i]++;\n      }\n    }\n  }\n  return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n  var arr = [];\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n  return arr;\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n *   2.34 returns 3\n *   0.0034 returns 2\n *   120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits   Number of significant digits\n */\nexport function digits(value) {\n  return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n  .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n  .length;\n}\n\n/**\n * Minimum number added to one that makes the result different than one\n */\nexport var DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n\n/**\n * Compares two floating point numbers.\n * @param {number} x          First value to compare\n * @param {number} y          Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n*/\nexport function nearlyEqual(x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x === y;\n  }\n  if (x === y) {\n    return true;\n  }\n\n  // NaN\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  }\n\n  // at this point x and y should be finite\n  if (isFinite(x) && isFinite(y)) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = Math.abs(x - y);\n    if (diff < DBL_EPSILON) {\n      return true;\n    } else {\n      // use relative error\n      return diff <= Math.max(Math.abs(x), Math.abs(y)) * epsilon;\n    }\n  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n  return signx ^ signy ? -x : x;\n}","import { isInteger } from '../number.js';\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n    suffix = \"i\".concat(size);\n  }\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\n  }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lower` and `upper` bounds, and uses\n *                                          exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'\n *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'\n *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  }\n\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    }\n\n    // determine precision from options\n    if (typeof options === 'number') {\n      precision = options;\n    } else if (options.precision) {\n      precision = options.precision;\n    }\n    if (options.wordSize) {\n      wordSize = options.wordSize;\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  }\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize);\n    case 'auto':\n      {\n        // determine lower and upper bound for exponential notation.\n        // TODO: implement support for upper and lower to be BigNumbers themselves\n        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n\n        // handle special case zero\n        if (value.isZero()) return '0';\n\n        // determine whether or not to output exponential notation\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n        if (exp >= lowerExp && exp < upperExp) {\n          // normal number notation\n          str = rounded.toFixed();\n        } else {\n          // exponential notation\n          str = toExponential(value, precision);\n        }\n\n        // remove trailing zeros after the decimal point\n        return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          var digits = arguments[2];\n          var e = arguments[4];\n          return digits !== '.' ? digits + e : e;\n        });\n      }\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n  // find difference in exponents, and calculate the value without exponent\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n  if (valueStr.indexOf('e') !== -1) {\n    valueStr = valueWithoutExp.toString();\n  }\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n * @returns {string} str\n */\nexport function toExponential(value, precision) {\n  if (precision !== undefined) {\n    return value.toExponential(precision - 1); // Note the offset of one\n  } else {\n    return value.toExponential();\n  }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n *                                       decimal point. Undefined by default.\n */\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *     math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n *   syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n *   function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n *   and the result is returned.\n * - In other cases the function will loop over all object properties and\n *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n *     math.format(2/7)                // '0.2857142857142857'\n *     math.format(math.pi, 3)         // '3.14'\n *     math.format(new Complex(2, 3))  // '2 + 3i'\n *     math.format('hello')            // '\"hello\"'\n *\n * @param {*} value             Value to be stringified\n * @param {Object | number | Function} [options]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n  var result = _format(value, options);\n  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...';\n  }\n  return result;\n}\nfunction _format(value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options);\n  }\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options);\n  }\n\n  // note: we use unsafe duck-typing here to check for Fractions, this is\n  // ok here since we're only invoking toString or concatenating its values\n  if (looksLikeFraction(value)) {\n    if (!options || options.fraction !== 'decimal') {\n      // output as ratio, like '1/3'\n      return value.s * value.n + '/' + value.d;\n    } else {\n      // output as decimal, like '0.(3)'\n      return value.toString();\n    }\n  }\n  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n  if (isString(value)) {\n    return '\"' + value + '\"';\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n  if (value && typeof value === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options);\n    } else if (value && value.toString(options) !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString(options);\n    } else {\n      var entries = Object.keys(value).map(key => {\n        return '\"' + key + '\": ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n  return String(value);\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n  while (i < text.length) {\n    var c = text.charAt(i);\n    if (c === '\\\\') {\n      escaped += c;\n      i++;\n      c = text.charAt(i);\n      if (c === '' || '\"\\\\/bfnrtu'.indexOf(c) === -1) {\n        escaped += '\\\\'; // no valid escape character -> escape it\n      }\n\n      escaped += c;\n    } else if (c === '\"') {\n      escaped += '\\\\\"';\n    } else {\n      escaped += c;\n    }\n    i++;\n  }\n  return '\"' + escaped + '\"';\n}\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n  var text = String(value);\n  text = text.replace(/&/g, '&amp;').replace(/\"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');\n  return text;\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @returns {string} str\n */\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n      str += formatArray(array[i], options);\n    }\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n  return value && typeof value === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n  return x === y ? 0 : x > y ? 1 : -1;\n}","/**\n * Create a range error with the message:\n *     'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual        The actual size\n * @param {number | number[]} expected      The expected size\n * @param {string} [relation='!=']          Optional relation between actual\n *                                          and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.actual = actual;\n  this.expected = expected;\n  this.relation = relation;\n  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n  this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.index = index;\n  if (arguments.length < 3) {\n    this.min = 0;\n    this.max = min;\n  } else {\n    this.min = min;\n    this.max = max;\n  }\n  if (this.min !== undefined && this.index < this.min) {\n    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n  } else if (this.max !== undefined && this.index >= this.max) {\n    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n  } else {\n    this.message = 'Index out of range (' + this.index + ')';\n  }\n  this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","import { isInteger } from './number.js';\nimport { isNumber } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @Return {Number[]} size\n */\nexport function arraySize(x) {\n  var s = [];\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n  return s;\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @param {number} dim   Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim]);\n  }\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<');\n      }\n      _validate(array[i], size, dimNext);\n    }\n  } else {\n    // last dimension. none of the childs may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new DimensionError(size.length + 1, size.length, '>');\n      }\n    }\n  }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new DimensionError(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index    Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex(index, length) {\n  if (!isNumber(index) || !isInteger(index)) {\n    throw new TypeError('Index must be an integer (value: ' + index + ')');\n  }\n  if (index < 0 || typeof length === 'number' && index >= length) {\n    throw new IndexError(index, length);\n  }\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array} array         Array to be resized\n * @param {Array.<number>} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled in in new entries,\n *                              zero by default. Specify for example `null`,\n *                              to clearly see entries that are not explicitly\n *                              set.\n * @return {Array} array         The resized array\n */\nexport function resize(array, size, defaultValue) {\n  // TODO: add support for scalars, having size=[] ?\n\n  // check the type of the arguments\n  if (!Array.isArray(array) || !Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  }\n\n  // check whether size contains positive integers\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  });\n\n  // recursively resize the array\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n  _resize(array, size, 0, _defaultValue);\n  return array;\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array         Array to be resized\n * @param {number[]} size       Array with the size of each dimension\n * @param {number} dim          Current dimension\n * @param {*} [defaultValue]    Value to be filled in in new entries,\n *                              undefined by default.\n * @private\n */\nfunction _resize(array, size, dim, defaultValue) {\n  var i;\n  var elem;\n  var oldLen = array.length;\n  var newLen = size[dim];\n  var minLen = Math.min(oldLen, newLen);\n\n  // apply new length\n  array.length = newLen;\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1;\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n        array[i] = elem;\n      }\n      _resize(elem, size, dimNext, defaultValue);\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem;\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n\n    // remove dimensions of existing values\n    for (i = 0; i < minLen; i++) {\n      while (Array.isArray(array[i])) {\n        array[i] = array[i][0];\n      }\n    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\n  }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {Array.<number>} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n *\n * @throws {DimensionError}       If the product of the new dimension sizes does\n *                                not equal that of the old ones\n */\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var currentLength = flatArray.length;\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {Array.<number>} sizes  List of sizes for each dimension. At most on wildcard.\n * @param {number} currentLength  Number of elements in the array.\n * @throws {Error}                If more than one wildcard or unable to replace it.\n * @returns {Array.<number>}      The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n  var hasWildcard = wildCardIndex >= 0;\n  var canReplaceWildcard = currentLength % newLength === 0;\n  if (hasWildcard) {\n    if (canReplaceWildcard) {\n      processedSizes[wildCardIndex] = -currentLength / newLength;\n    } else {\n      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n    }\n  }\n  return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {Array<number>} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 1);\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {Array.<number>} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n */\n\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2;\n  // for each dimensions starting by the last one and ignoring the first one\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = [];\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    var length = tmpArray.length / size;\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2;\n  }\n  return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n  var s = size || arraySize(array);\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  }\n\n  // find the first dimension to be squeezed\n  var dims = s.length;\n  while (s[dims - 1] === 1) {\n    dims--;\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n  return array;\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n  if (dim < dims) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _squeeze(array[i], dims, next);\n    }\n  } else {\n    while (Array.isArray(array)) {\n      array = array[0];\n    }\n  }\n  return array;\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Paramter `size` will be mutated to match the new, unqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims       Desired number of dimensions of the array\n * @param {number} [outer]    Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array);\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0);\n  while (s.length < dims) {\n    s.push(1);\n  }\n  return array;\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n  if (Array.isArray(array)) {\n    var next = dim + 1;\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next);\n    }\n  } else {\n    for (var d = dim; d < dims; d++) {\n      array = [array];\n    }\n  }\n  return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array   A multi dimensional array\n * @return {Array}        The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n  var flat = [];\n  array.forEach(function callback(value) {\n    if (Array.isArray(value)) {\n      value.forEach(callback); // traverse through sub-arrays recursively\n    } else {\n      flat.push(value);\n    }\n  });\n  return flat;\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, callback);\n}\n\n/**\n * Filter values in a callback given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp(array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a  An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\n  };\n  for (var i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++;\n    } else {\n      count = 0;\n    }\n    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n  return b;\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a  An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n  return b;\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf   Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType(array, typeOf) {\n  var type; // to hold type info\n  var length = 0; // to hold length value to ensure it has consistent sizes\n\n  for (var i = 0; i < array.length; i++) {\n    var item = array[i];\n    var isArray = Array.isArray(item);\n\n    // Saving the target matrix row size\n    if (i === 0 && isArray) {\n      length = item.length;\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (isArray && item.length !== length) {\n      return undefined;\n    }\n    var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n    : typeOf(item);\n    if (type === undefined) {\n      type = itemType; // first item\n    } else if (type !== itemType) {\n      return 'mixed';\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n  return type;\n}\n\n/**\n * Return the last item from an array\n * @param array\n * @returns {*}\n */\nexport function last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n */\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Test whether an array or string contains an item\n * @param {Array | string} array\n * @param {*} item\n * @return {boolean}\n */\nexport function contains(array, item) {\n  return array.indexOf(item) !== -1;\n}","import { contains } from './array.js';\nimport { pickShallow } from './object.js';\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n *     const name = 'log'\n *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n *       // ... create the function log here and return it\n *     }\n *\n * @param {string} name           Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create       Callback function called with an object with all dependencies\n * @param {Object} [meta]         Optional object with meta information that will be attached\n *                                to the created factory function as property `meta`.\n * @returns {function}\n */\nexport function factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n  return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (contains(factory.dependencies, dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true;\n      }\n    }\n    return false;\n  }\n  var sorted = [];\n  function addFactory(factory) {\n    var index = 0;\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n    sorted.splice(index, 0, factory);\n  }\n\n  // sort regular factory functions\n  factories.filter(isFactory).forEach(addFactory);\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\n  return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name   Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","import { hasOwnProperty } from './object.js';\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty(object, prop) {\n  // only allow getting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    return object[prop];\n  }\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty(object, prop, value) {\n  // only allow setting safe properties of a plain object\n  if (isPlainObject(object) && isSafeProperty(object, prop)) {\n    object[prop] = value;\n    return value;\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\nfunction getSafeProperties(object) {\n  return Object.keys(object).filter(prop => hasOwnProperty(object, prop));\n}\nfunction hasSafeProperty(object, prop) {\n  return prop in object;\n}\n\n/**\n * Test whether a property is safe to use for an object.\n * For example .toString and .constructor are not safe\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n  if (!object || typeof object !== 'object') {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (prop in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (prop in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n */\n// TODO: merge this function into assign.js?\nfunction validateSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n}\n\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\n  }\n  // UNSAFE: ghosted\n  // e.g overridden toString\n  // Note that IE10 doesn't support __proto__ and we can't do this check there.\n  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (method in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false;\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (method in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false;\n  }\n  return true;\n}\nfunction isPlainObject(object) {\n  return typeof object === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { hasSafeProperty };\nexport { getSafeProperties };\nexport { validateSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { setSafeProperty, hasSafeProperty, getSafeProperty } from './customs.js';\nimport { isObject } from './is.js';\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n  constructor(object) {\n    this.wrappedObject = object;\n  }\n  keys() {\n    return Object.keys(this.wrappedObject);\n  }\n  get(key) {\n    return getSafeProperty(this.wrappedObject, key);\n  }\n  set(key, value) {\n    setSafeProperty(this.wrappedObject, key, value);\n    return this;\n  }\n  has(key) {\n    return hasSafeProperty(this.wrappedObject, key);\n  }\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap() {\n  return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if (isObject(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject);\n  }\n  throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  for (var key of map.keys()) {\n    var value = map.get(key);\n    setSafeProperty(object, key, value);\n  }\n  return object;\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap(object) {\n  // We can use the fast instanceof, or a slower duck typing check.\n  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n  if (!object) {\n    return false;\n  }\n  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign(map) {\n  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    objects[_key - 1] = arguments[_key];\n  }\n  for (var args of objects) {\n    if (!args) {\n      continue;\n    }\n    if (isMap(args)) {\n      for (var key of args.keys()) {\n        map.set(key, args.get(key));\n      }\n    } else if (isObject(args)) {\n      for (var _key2 of Object.keys(args)) {\n        map.set(_key2, args[_key2]);\n      }\n    }\n  }\n  return map;\n}","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n *     math.typed(name, signatures) : function\n *     math.typed(signatures) : function\n *\n * Examples:\n *\n *     // create a typed function with multiple types per argument (type union)\n *     const fn2 = typed({\n *       'number | boolean': function (b) {\n *         return 'b is a number or boolean'\n *       },\n *       'string, number | boolean': function (a, b) {\n *         return 'a is a string, b is a number or boolean'\n *       }\n *     })\n *\n *     // create a typed function with an any type argument\n *     const log = typed({\n *       'string, any': function (event, data) {\n *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n *       }\n *     })\n *\n * @param {string} [name]                          Optional name for the typed-function\n * @param {Object<string, function>} signatures   Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRelationalNode, isRegExp, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport typedFunction from 'typed-function';\nimport { digits } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { isMap } from '../../utils/map.js';\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = typedFunction.create;\n  return typedFunction;\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  var typed = _createTyped2();\n\n  // define all types. The order of the types determines in which order function\n  // arguments are type-checked (so for performance it's important to put the\n  // most used types first).\n  typed.clear();\n  typed.addTypes([{\n    name: 'number',\n    test: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: isUnit\n  },\n  // The following type matches a valid variable name, i.e., an alphanumeric\n  // string starting with an alphabetic character. It is used (at least)\n  // in the definition of the derivative() function, as the argument telling\n  // what to differentiate over must (currently) be a variable.\n  {\n    name: 'identifier',\n    test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2E]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD50-\\uDD52\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E]|\\uD838[\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF38\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2E]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD50-\\uDD52\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E]|\\uD838[\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF38\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A])*$/.test(s)\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'RelationalNode',\n    test: isRelationalNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Map',\n    test: isMap\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\n  ]);\n\n  typed.addConversions([{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      // note: conversion from number to BigNumber can fail if x has >15 digits\n      if (digits(x) > 15) {\n        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n      }\n      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.toNumber(), 0);\n    }\n  }, {\n    from: 'Fraction',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n    }\n  }, {\n    from: 'Fraction',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      var f = new Fraction(x);\n      if (f.valueOf() !== x) {\n        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n      }\n      return f;\n    }\n  }, {\n    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n    //  from: 'Fraction',\n    //  to: 'number',\n    //  convert: function (x) {\n    //    return x.valueOf()\n    //  }\n    // }, {\n    from: 'string',\n    to: 'number',\n    convert: function convert(x) {\n      var n = Number(x);\n      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      try {\n        return new BigNumber(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      try {\n        return new Fraction(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Fraction');\n      }\n    }\n  }, {\n    from: 'string',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      try {\n        return new Complex(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to Complex');\n      }\n    }\n  }, {\n    from: 'boolean',\n    to: 'number',\n    convert: function convert(x) {\n      return +x;\n    }\n  }, {\n    from: 'boolean',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }]);\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n  return typed;\n});\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    config\n  } = _ref;\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: Decimal.EUCLID\n  });\n  BigNumber.prototype = Object.create(BigNumber.prototype);\n\n  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n\n  /**\n   * Get a JSON representation of a BigNumber containing\n   * type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   */\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\n  };\n\n  /**\n   * Instantiate a BigNumber from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   * @return {BigNumber}\n   */\n  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\n  };\n  if (on) {\n    // listen for changed in the configuration, automatically apply changed precision\n    on('config', function (curr, prev) {\n      if (curr.precision !== prev.precision) {\n        BigNumber.config({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n  return BigNumber;\n}, {\n  isClass: true\n});","import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Complex, 'name', {\n    value: 'Complex'\n  });\n  Complex.prototype.constructor = Complex;\n  Complex.prototype.type = 'Complex';\n  Complex.prototype.isComplex = true;\n\n  /**\n   * Get a JSON representation of the complex number\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n   */\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\n  };\n\n  /*\n   * Return the value of the complex number in polar notation\n   * The angle phi will be set in the interval of [-pi, pi].\n   * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n   */\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\n  };\n\n  /**\n   * Get a string representation of the complex number,\n   * with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string} str\n   */\n  Complex.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options);\n\n    // round either re or im when smaller than the configured precision\n    var precision = isNumber(options) ? options : options ? options.precision : null;\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\n      }\n    }\n    if (im === 0) {\n      // real value\n      str = strRe;\n    } else if (re === 0) {\n      // purely complex value\n      if (im === 1) {\n        str = 'i';\n      } else if (im === -1) {\n        str = '-i';\n      } else {\n        str = strIm + 'i';\n      }\n    } else {\n      // complex value\n      if (im < 0) {\n        if (im === -1) {\n          str = strRe + ' - i';\n        } else {\n          str = strRe + ' - ' + strIm.substring(1) + 'i';\n        }\n      } else {\n        if (im === 1) {\n          str = strRe + ' + i';\n        } else {\n          str = strRe + ' + ' + strIm + 'i';\n        }\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Create a complex number from polar coordinates\n   *\n   * Usage:\n   *\n   *     Complex.fromPolar(r: number, phi: number) : Complex\n   *     Complex.fromPolar({r: number, phi: number}) : Complex\n   *\n   * @param {*} args...\n   * @return {Complex}\n   */\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n          if (typeof arg === 'object') {\n            return Complex(arg);\n          } else {\n            throw new TypeError('Input has to be an object with r and phi keys.');\n          }\n        }\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n          if (isNumber(r)) {\n            if (isUnit(phi) && phi.hasBase('ANGLE')) {\n              // convert unit to a number in radians\n              phi = phi.toNumber('rad');\n            }\n            if (isNumber(phi)) {\n              return new Complex({\n                r,\n                phi\n              });\n            }\n            throw new TypeError('Phi is not a number nor an angle unit.');\n          } else {\n            throw new TypeError('Radius r is not a number.');\n          }\n        }\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar');\n    }\n  };\n  Complex.prototype.valueOf = Complex.prototype.toString;\n\n  /**\n   * Create a Complex number from a JSON object\n   * @param {Object} json  A JSON Object structured as\n   *                       {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n   *                       All properties are optional, default values\n   *                       for `re` and `im` are 0.\n   * @return {Complex} Returns a new Complex number\n   */\n  Complex.fromJSON = function (json) {\n    return new Complex(json);\n  };\n\n  /**\n   * Compare two complex numbers, `a` and `b`:\n   *\n   * - Returns 1 when the real part of `a` is larger than the real part of `b`\n   * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n   * - Returns 1 when the real parts are equal\n   *   and the imaginary part of `a` is larger than the imaginary part of `b`\n   * - Returns -1 when the real parts are equal\n   *   and the imaginary part of `a` is smaller than the imaginary part of `b`\n   * - Returns 0 when both real and imaginary parts are equal.\n   *\n   * @params {Complex} a\n   * @params {Complex} b\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n    if (a.re < b.re) {\n      return -1;\n    }\n    if (a.im > b.im) {\n      return 1;\n    }\n    if (a.im < b.im) {\n      return -1;\n    }\n    return 0;\n  };\n  return Complex;\n}, {\n  isClass: true\n});","import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Fraction, 'name', {\n    value: 'Fraction'\n  });\n  Fraction.prototype.constructor = Fraction;\n  Fraction.prototype.type = 'Fraction';\n  Fraction.prototype.isFraction = true;\n\n  /**\n   * Get a JSON representation of a Fraction containing type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n   */\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\n    };\n  };\n\n  /**\n   * Instantiate a Fraction from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"Fraction\", \"n\": 3, \"d\": 8}`\n   * @return {BigNumber}\n   */\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n  return Fraction;\n}, {\n  isClass: true\n});","import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix() {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @return {string}           The storage format.\n   */\n  Matrix.prototype.storage = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke storage on a Matrix interface');\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @return {string}           The datatype.\n   */\n  Matrix.prototype.datatype = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke datatype on a Matrix interface');\n  };\n\n  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  Matrix.prototype.subset = function (index, replacement, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke subset on a Matrix interface');\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  Matrix.prototype.get = function (index) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke get on a Matrix interface');\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {Matrix} self\n   */\n  Matrix.prototype.set = function (index, value, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke set on a Matrix interface');\n  };\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  Matrix.prototype.resize = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke resize on a Matrix interface');\n  };\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  Matrix.prototype.reshape = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke reshape on a Matrix interface');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n  Matrix.prototype.clone = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke clone on a Matrix interface');\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n  Matrix.prototype.size = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke size on a Matrix interface');\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {Matrix} matrix\n   */\n  Matrix.prototype.map = function (callback, skipZeros) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke map on a Matrix interface');\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  Matrix.prototype.forEach = function (callback) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke forEach on a Matrix interface');\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  Matrix.prototype[Symbol.iterator] = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot iterate a Matrix interface');\n  };\n\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n  Matrix.prototype.toArray = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toArray on a Matrix interface');\n  };\n\n  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n  Matrix.prototype.valueOf = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke valueOf on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  Matrix.prototype.format = function (options) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke format on a Matrix interface');\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n  Matrix.prototype.toString = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toString on a Matrix interface');\n  };\n  return Matrix;\n}, {\n  isClass: true\n});","// function utils\n\nimport { lruQueue } from './lruQueue.js';\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn                     The function to be memoized.\n *                                          Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n *    A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n *    Maximum number of values that may be cached. Undefined indicates\n *    unlimited (default)\n * @return {function}                       Returns the memoized function\n */\nexport function memoize(fn) {\n  var {\n    hasher,\n    limit\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n      };\n    }\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    var hash = hasher(args);\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash);\n      return memoize.cache.values.get(hash);\n    }\n    var newVal = fn.apply(fn, args);\n    memoize.cache.values.set(hash, newVal);\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n    return newVal;\n  };\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nexport function memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var cached = memoize.cache[c];\n      if (isEqual(args, cached.args)) {\n        // TODO: move this cache entry to the top so recently used entries move up?\n        return cached.res;\n      }\n    }\n    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args,\n      res\n    });\n    return res;\n  };\n  memoize.cache = [];\n  return memoize;\n}\n\n/**\n * Find the maximum number of arguments expected by a typed function.\n * @param {function} fn   A typed function\n * @return {number} Returns the maximum number of expected arguments.\n *                  Returns -1 when no signatures where found on the function.\n */\nexport function maxArgumentCount(fn) {\n  return Object.keys(fn.signatures || {}).reduce(function (args, signature) {\n    var count = (signature.match(/,/g) || []).length + 1;\n    return Math.max(args, count);\n  }, -1);\n}","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex } from '../../utils/array.js';\nimport { format } from '../../utils/string.js';\nimport { isInteger } from '../../utils/number.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix\n  } = _ref;\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   * @enum {{ value, index: number[] }}\n   */\n  function DenseMatrix(data, datatype) {\n    if (!(this instanceof DenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = clone(data._data);\n        this._size = clone(data._size);\n        this._datatype = datatype || data._datatype;\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray();\n        this._size = data.size();\n        this._datatype = datatype || data._datatype;\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      // verify the dimensions of the array\n      validate(this._data, this._size);\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data);\n      // get the dimensions of the array\n      this._size = arraySize(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      validate(this._data, this._size);\n      // data type unknown\n      this._datatype = datatype;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n    }\n  }\n  DenseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', {\n    value: 'DenseMatrix'\n  });\n  DenseMatrix.prototype.constructor = DenseMatrix;\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf DenseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()  // retrieve storage format\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The storage format.\n   */\n  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()   // retrieve matrix datatype\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The datatype.\n   */\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof DenseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  DenseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check index\n    for (var x = 0; x < index.length; x++) {\n      validateIndex(index[x], this._size[x]);\n    }\n    var data = this._data;\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n    return data;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {DenseMatrix} self\n   */\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new DimensionError(index.length, this._size.length, '<');\n    }\n    var i, ii, indexI;\n\n    // enlarge matrix when needed\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n    _fit(this, size, defaultValue);\n\n    // traverse over the dimensions\n    var data = this._data;\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i];\n      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    validateIndex(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\n\n  /**\n   * Get a submatrix of this matrix\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index   Zero-based index\n   * @private\n   */\n  function _get(matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = index.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length);\n      }\n\n      // validate if any of the ranges in the index is out of range\n      var min = index.min();\n      var max = index.max();\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      }\n\n      // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n    }\n  }\n\n  /**\n   * Recursively get a submatrix of a multi dimensional matrix.\n   * Index is not checked for correct number or length of dimensions.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim    Current dimension\n   * @return {Array} submatrix\n   * @private\n   */\n  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        return data[i];\n      }).valueOf();\n    } else {\n      return range.map(function (i) {\n        validateIndex(i, data.length);\n        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\n    }\n  }\n\n  /**\n   * Replace a submatrix in this matrix\n   * Indexes are zero-based.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index\n   * @param {DenseMatrix | Array | *} submatrix\n   * @param {*} defaultValue          Default value, filled in on new entries when\n   *                                  the matrix is resized.\n   * @return {DenseMatrix} matrix\n   * @private\n   */\n  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // enlarge matrix when needed\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n      _fit(matrix, size, defaultValue);\n\n      // insert the sub matrix\n      var dims = iSize.length;\n      var dim = 0;\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n    return matrix;\n  }\n\n  /**\n   * Replace a submatrix of a multi dimensional matrix.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {Array} submatrix\n   * @param {number} dims   Total number of dimensions\n   * @param {number} dim\n   * @private\n   */\n  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n        data[dataIndex] = submatrix[subIndex[0]];\n      });\n    } else {\n      range.forEach(function (dataIndex, subIndex) {\n        validateIndex(dataIndex);\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n      });\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof DenseMatrix\n   * @param {number[] || Matrix} size The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue);\n  };\n  function _resize(matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      var v = matrix._data;\n      // go deep\n      while (isArray(v)) {\n        v = v[0];\n      }\n      return v;\n    }\n    // resize matrix\n    matrix._size = size.slice(0); // copy the array\n    matrix._data = resize(matrix._data, matrix._size, defaultValue);\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = reshape(m._data, size);\n    var currentLength = m._size.reduce((length, size) => length * size);\n    m._size = processSizesWildcard(size, currentLength);\n    return m;\n  };\n\n  /**\n   * Enlarge the matrix when it is smaller than given size.\n   * If the matrix is larger or equal sized, nothing is done.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix           The matrix to be resized\n   * @param {number[]} size\n   * @param {*} defaultValue          Default value, filled in on new entries.\n   * @private\n   */\n  function _fit(matrix, size, defaultValue) {\n    var\n    // copy the array\n    newSize = matrix._size.slice(0);\n    var changed = false;\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    }\n\n    // enlarge size when needed\n    for (var i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i];\n        changed = true;\n      }\n    }\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   *\n   * @return {DenseMatrix} matrix\n   */\n  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n    var args = maxArgumentCount(callback);\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        return value.map(function (child, i) {\n          return recurse(child, index.concat(i));\n        });\n      } else {\n        // invoke the callback function with the right number of arguments\n        if (args === 1) {\n          return callback(value);\n        } else if (args === 2) {\n          return callback(value, index);\n        } else {\n          // 3 or -1\n          return callback(value, index, me);\n        }\n      }\n    };\n\n    // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\n    var data = recurse(this._data, []);\n    var datatype = this._datatype !== undefined ? getArrayDataType(data, typeOf) : undefined;\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n    var recurse = function recurse(value, index) {\n      if (isArray(value)) {\n        value.forEach(function (child, i) {\n          recurse(child, index.concat(i));\n        });\n      } else {\n        callback(value, index, me);\n      }\n    };\n    recurse(this._data, []);\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = function* () {\n    var recurse = function* recurse(value, index) {\n      if (isArray(value)) {\n        for (var i = 0; i < value.length; i++) {\n          yield* recurse(value[i], index.concat(i));\n        }\n      } else {\n        yield {\n          value,\n          index\n        };\n      }\n    };\n    yield* recurse(this._data, []);\n  };\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    for (var row of data) {\n      result.push(new DenseMatrix([row], this._datatype));\n    }\n    return result;\n  };\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    var _this = this;\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _loop = function _loop(i) {\n      var col = data.map(row => [row[i]]);\n      result.push(new DenseMatrix(col, _this._datatype));\n    };\n    for (var i = 0; i < s[1]; i++) {\n      _loop(i);\n    }\n    return result;\n  };\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data);\n  };\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof DenseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options);\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data);\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n  DenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'DenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof DenseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix with the diagonal values.\n   */\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // x is a matrix get diagonal from matrix\n    var data = [];\n\n    // loop rows\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [n],\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                     The matrix size.\n   * @param {number | Matrix | Array } value The values for the diagonal.\n   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]          The default value for non-diagonal\n   * @param {string} [datatype]              The datatype for the diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // discover default value if needed\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    }\n\n    // empty array\n    var data = [];\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue);\n      // fill diagonal\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof DenseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Swap rows i and j in Dense Matrix data structure.\n   *\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   * @param {Array} data     Matrix data\n   */\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    var vi = data[i];\n    data[i] = data[j];\n    data[j] = vi;\n  };\n\n  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @return {Array} data\n   */\n  function preprocess(data) {\n    for (var i = 0, ii = data.length; i < ii; i++) {\n      var elem = data[i];\n      if (isArray(elem)) {\n        data[i] = preprocess(elem);\n      } else if (elem && elem.isMatrix === true) {\n        data[i] = preprocess(elem.valueOf());\n      }\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize } from './array.js';\nimport { _switch } from './switch.js';\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n *                    collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback     The callback method is invoked with one\n *                                parameter: the current element in the array\n */\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array = array.valueOf();\n  }\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\n    }\n  }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback   The callback is called with two parameters:\n *                              value1 and value2, which contain the current\n *                              element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap(array, callback, skipZeros) {\n  if (array && typeof array.map === 'function') {\n    // TODO: replace array.map with a for loop to improve performance\n    return array.map(function (x) {\n      return deepMap(x, callback, skipZeros);\n    });\n  } else {\n    return callback(array);\n  }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n  if (dim < 0 || dim >= size.length) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new IndexError(dim, size.length);\n  }\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback));\n  } else {\n    return _reduce(mat, dim, callback);\n  }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n      return val;\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n// TODO: document function scatter\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n\n  // vars\n  var k, k0, k1, i;\n\n  // check we need to process values (pattern matrix)\n  if (x) {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n          // function was called on current row\n          u[i] = mark;\n        } else {\n          // copy value to workspace\n          x[i] = avalues[k];\n        }\n      } else {\n        // i exists in C already\n        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);\n        // function was called on current row\n        u[i] = mark;\n      }\n    }\n  } else {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n      } else {\n        // indicate function was called on current row\n        u[i] = mark;\n      }\n    }\n  }\n}","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return expm1(x);\n}\nexpm1Number.signature = n1;\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  var r;\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber(a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers');\n  }\n  if (a === 0 || b === 0) {\n    return 0;\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  var t;\n  var prod = a * b;\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n  if (y) {\n    return Math.log(x) / Math.log(y);\n  }\n  return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n  return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n  return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n  return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\n  if (y > 0) {\n    // We don't use JavaScript's % operator here as this doesn't work\n    // correctly for x < 0 and x === 0\n    // see https://en.wikipedia.org/wiki/Modulo_operation\n    return x - y * Math.floor(x / y);\n  } else if (y === 0) {\n    return x;\n  } else {\n    // y < 0\n    // TODO: implement mod for a negative divisor\n    throw new Error('Cannot calculate mod for a negative divisor');\n  }\n}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var inv = root < 0;\n  if (inv) {\n    root = -root;\n  }\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n  var x = Math.pow(Math.abs(a), 1 / root);\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x;\n\n  // Very nice algorithm, but fails with nthRoot(-2, 3).\n  // Newton's method has some well-known problems at times:\n  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n   if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n   return inv ? 1 / x : x\n  */\n}\n\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n  var q; // quotient\n  var r; // remainder\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var lasty = 0;\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers');\n  }\n  while (b) {\n    q = Math.floor(a / b);\n    r = a - q * b;\n    t = x;\n    x = lastx - q * x;\n    lastx = t;\n    t = y;\n    y = lasty - q * y;\n    lasty = t;\n    a = b;\n    b = r;\n  }\n  var res;\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n  return res;\n}\nxgcdNumber.signature = n2;\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n  }\n  return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","/**\n * Compares two BigNumbers.\n * @param {BigNumber} x       First value to compare\n * @param {BigNumber} y       Second value to compare\n * @param {number} [epsilon]  The maximum relative difference between x and y\n *                            If epsilon is undefined or null, the function will\n *                            test whether x and y are exactly equal.\n * @return {boolean} whether the two numbers are nearly equal\n */\nexport function nearlyEqual(x, y, epsilon) {\n  // if epsilon is null or undefined, test whether x and y are exactly equal\n  if (epsilon === null || epsilon === undefined) {\n    return x.eq(y);\n  }\n\n  // use \"==\" operator, handles infinities\n  if (x.eq(y)) {\n    return true;\n  }\n\n  // NaN\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  }\n\n  // at this point x and y should be finite\n  if (x.isFinite() && y.isFinite()) {\n    // check numbers are very close, needed when comparing numbers near zero\n    var diff = x.minus(y).abs();\n    if (diff.isZero()) {\n      return true;\n    } else {\n      // use relative error\n      var max = x.constructor.max(x.abs(), y.abs());\n      return diff.lte(max.times(epsilon));\n    }\n  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}","import { nearlyEqual } from './number.js';\n\n/**\n * Test whether two complex values are equal provided a given epsilon.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x\n * @param {Complex} y\n * @param {number} epsilon\n * @returns {boolean}\n */\nexport function complexEquals(x, y, epsilon) {\n  return nearlyEqual(x.re, y.re, epsilon) && nearlyEqual(x.im, y.im, epsilon);\n}","import { factory } from '../../utils/factory.js';\nexport var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base');\n      }\n      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);\n    })\n  };\n});","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { complexEquals } from '../../utils/complex.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.epsilon);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return complexEquals(x, y, config.epsilon);\n    }\n  }, compareUnits);\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return nearlyEqual(x, y, config.epsilon);\n    }\n  });\n});","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { maxArgumentCount } from '../../utils/function.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n  /**\n   * Sparse Matrix implementation. This type implements\n   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n   * format for two-dimensional sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values;\n      this._index = data.index;\n      this._ptr = data.ptr;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype);\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');\n    } else {\n      // nothing provided\n      this._values = [];\n      this._index = [];\n      this._ptr = [0];\n      this._size = [0, 0];\n      this._datatype = datatype;\n    }\n  }\n  function _createFromMatrix(matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? clone(source._values) : undefined;\n      matrix._index = clone(source._index);\n      matrix._ptr = clone(source._ptr);\n      matrix._size = clone(source._size);\n      matrix._datatype = datatype || source._datatype;\n    } else {\n      // build from matrix data\n      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);\n    }\n  }\n  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype;\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    var rows = data.length;\n    var columns = 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      var j = 0;\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length);\n        // loop rows\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i];\n          // check row is an array\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            }\n            // check row has column\n            if (j < row.length) {\n              // value\n              var v = row[j];\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v);\n                // index\n                matrix._index.push(i);\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) {\n              columns = 1;\n            }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row);\n              // index\n              matrix._index.push(i);\n            }\n          }\n        }\n        // increment index\n        j++;\n      } while (j < columns);\n    }\n    // store number of values in ptr\n    matrix._ptr.push(matrix._index.length);\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf);\n  };\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The storage format.\n   */\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The datatype.\n   */\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Get the matrix density.\n   *\n   * Usage:\n   *     const density = matrix.density()                   // retrieve matrix density\n   *\n   * @memberof SparseMatrix\n   * @return {number}           The matrix density.\n   */\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // calculate density\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof SparseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke subset on a Pattern only matrix');\n    }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = idx.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    }\n    // validate dimensions\n    var size = idx.size();\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length);\n    }\n\n    // vars\n    var i, ii, k, kk;\n\n    // validate if any of the ranges in the index is out of range\n    var min = idx.min();\n    var max = idx.max();\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      validateIndex(min[i], matrix._size[i]);\n      validateIndex(max[i], matrix._size[i]);\n    }\n\n    // matrix arrays\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr;\n\n    // rows & columns dimensions for result matrix\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1);\n\n    // workspace & permutation vector\n    var w = [];\n    var pv = [];\n\n    // loop rows in resulting matrix\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    });\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    });\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size,\n      datatype: matrix._datatype\n    });\n  }\n  function _setsubset(matrix, index, submatrix, defaultValue) {\n    // check index\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size();\n      // use array representation\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix);\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      // set value\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // validate dimensions, index size must be one or two dimensions\n      if (iSize.length !== 1 && iSize.length !== 2) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>');\n      }\n\n      // insert the sub matrix\n      if (iSize.length === 1) {\n        // if the replacement index only has 1 dimension, go trough each one and set its value\n        var range = index.dimension(0);\n        range.forEach(function (dataIndex, subIndex) {\n          validateIndex(dataIndex);\n          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);\n        });\n      } else {\n        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n        var firstDimensionRange = index.dimension(0);\n        var secondDimensionRange = index.dimension(1);\n        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n          validateIndex(firstDataIndex);\n          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n            validateIndex(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // check i, j are valid\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[1]);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n    return 0;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} v\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be set to zero.\n   * @return {SparseMatrix} self\n   */\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype);\n    }\n\n    // check we need to resize matrix\n    if (i > rows - 1 || j > columns - 1) {\n      // resize matrix\n      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue);\n      // update rows & columns\n      rows = this._size[0];\n      columns = this._size[1];\n    }\n\n    // check i, j are valid\n    validateIndex(i, rows);\n    validateIndex(j, columns);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      // check value != 0\n      if (!eq(v, zero)) {\n        // update value\n        this._values[k] = v;\n      } else {\n        // remove value from matrix\n        _remove(k, j, this._values, this._index, this._ptr);\n      }\n    } else {\n      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr);\n      }\n    }\n    return this;\n  };\n  function _getValueIndex(i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) {\n      return bottom;\n    }\n    // loop rows [top, bottom[\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    }\n    // we did not find row\n    return top;\n  }\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1);\n    // update pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v);\n    // update row for k\n    index.splice(k, 0, i);\n    // update column pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof SparseMatrix\n   * @param {number[] | Matrix} size  The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // check sizes\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');\n      }\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n  };\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype);\n    }\n\n    // should we insert the value?\n    var ins = !eq(value, zero);\n\n    // old columns and rows\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k;\n\n    // check we need to increase columns\n    if (columns > c) {\n      // loop new columns\n      for (j = c; j < columns; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._values.length;\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value);\n            // update matrix._index\n            matrix._index.push(i);\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns);\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    }\n    // update columns\n    c = columns;\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0;\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n;\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n;\n          // pointer\n          var p = 0;\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value);\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i);\n            // increment inserts\n            n++;\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0;\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d;\n        // where matrix._values start for next column\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d;\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k];\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1);\n            // remove item from matrix._index\n            matrix._index.splice(k, 1);\n            // increase deletes\n            d++;\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length;\n    }\n    // update matrix._size\n    matrix._size[0] = rows;\n    matrix._size[1] = columns;\n    // return matrix\n    return matrix;\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} sizes          The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) {\n      throw new TypeError('Array expected');\n    }\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    }\n\n    // check sizes\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = processSizesWildcard(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1];\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    }\n\n    // matrix to reshape\n    var m = copy ? this.clone() : this;\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    }\n\n    // Convert to COO format (generate a column index)\n    var colIndex = [];\n    for (var i = 0; i < m._ptr.length; i++) {\n      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i);\n      }\n    }\n\n    // Clone the values array\n    var values = m._values.slice();\n\n    // Clone the row index array\n    var rowIndex = m._index.slice();\n\n    // Transform the (row, column) indices\n    for (var _i = 0; _i < m._index.length; _i++) {\n      var r1 = rowIndex[_i];\n      var c1 = colIndex[_i];\n      var flat = r1 * m._size[1] + c1;\n      colIndex[_i] = flat % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    }\n\n    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n    // sorting several arrays based on some other array.\n\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    }\n\n    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n    // This step is probably the most time-consuming\n    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m;\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {SparseMatrix} matrix\n   */\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke map on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // invoke callback\n    var args = maxArgumentCount(callback);\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      if (args === 1) return callback(v);\n      if (args === 2) return callback(v, [i, j]);\n      return callback(v, [i, j], me);\n    };\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\n\n  /**\n   * Create a new matrix with the results of the callback function executed on the interval\n   * [minRow..maxRow, minColumn..maxColumn].\n   */\n  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n    }\n\n    // invoke callback\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y);\n      // check value != 0\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v);\n        // index\n        index.push(x);\n      }\n    };\n    // loop columns\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = matrix._index[k];\n          // check i is in range\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn);\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        var _values = {};\n        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {\n          var value = _i5 in _values ? _values[_i5] : 0;\n          invoke(value, _i5 - minRow, j - minColumn);\n        }\n      }\n    }\n\n    // store number of values in ptr\n    ptr.push(values.length);\n    // return sparse matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    });\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *                              If false, the indices are guaranteed to be in order,\n   *                              if true, the indices can be unordered.\n   */\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke forEach on a Pattern only matrix');\n    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (var k = k0; k < k1; k++) {\n          // row index\n          var i = this._index[k];\n\n          // value @ k\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (var _i7 = 0; _i7 < rows; _i7++) {\n          var value = _i7 in values ? values[_i7] : 0;\n          callback(value, [_i7, j], me);\n        }\n      }\n    }\n  };\n\n  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = function* () {\n    if (!this._values) {\n      throw new Error('Cannot iterate a Pattern only matrix');\n    }\n    var columns = this._size[1];\n    for (var j = 0; j < columns; j++) {\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        yield {\n          value: this._values[k],\n          index: [i, j]\n        };\n      }\n    }\n  };\n\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n    // result\n    var a = [];\n    // vars\n    var i, j;\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    }\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k];\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;\n      }\n    }\n    return a;\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof SparseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // density\n    var density = this.density();\n    // rows & columns\n    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n';\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        // append value\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray());\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n  SparseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'SparseMatrix',\n      values: this._values,\n      index: this._index,\n      ptr: this._ptr,\n      size: this._size,\n      datatype: this._datatype\n    };\n  };\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof SparseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix vector with the diagonal values.\n   */\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // diagonal arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n    // initial ptr value\n    ptr[0] = 0;\n    // loop columns\n    for (var j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop x within [k0, k1[\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x];\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]);\n          // store row\n          index[values.length - 1] = i - kSub;\n          // exit loop\n          break;\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length);\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [n, 1]\n    });\n  };\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof SparseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n   *                       where mathjs is optional\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {Array} size                       The matrix size.\n   * @param {number | Array | Matrix } value   The values for the diagonal.\n   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]            The default value for non-diagonal\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if (isMatrix(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length');\n      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value.get([i]);\n      };\n    } else {\n      // define function\n      _value = function _value() {\n        // return value\n        return value;\n      };\n    }\n\n    // create arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // loop items\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length);\n      // diagonal index\n      var i = j - kSuper;\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i);\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub);\n          // add value\n          values.push(v);\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length);\n    // create SparseMatrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [rows, columns]\n    });\n  };\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    validateIndex(i, this._size[0]);\n    validateIndex(j, this._size[0]);\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);\n    // return current instance\n    return this;\n  };\n\n  /**\n   * Loop rows with data in column j.\n   *\n   * @param {number} j            Column\n   * @param {Array} values        Matrix values\n   * @param {Array} index         Matrix row indeces\n   * @param {Array} ptr           Matrix column pointers\n   * @param {Function} callback   Callback function invoked for every row in column j\n   */\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1];\n    // loop\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\n  };\n\n  /**\n   * Swap rows x and y in Sparse Matrix data structures.\n   *\n   * @param {number} x         Matrix row index 1\n   * @param {number} y         Matrix row index 2\n   * @param {number} columns   Number of columns in matrix\n   * @param {Array} values     Matrix values\n   * @param {Array} index      Matrix row indeces\n   * @param {Array} ptr        Matrix column pointers\n   */\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // find value index @ x\n      var kx = _getValueIndex(x, k0, k1, index);\n      // find value index @ x\n      var ky = _getValueIndex(y, k0, k1, index);\n      // check both rows exist in matrix\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          var v = values[kx];\n          values[kx] = values[ky];\n          values[ky] = v;\n        }\n        // next column\n        continue;\n      }\n      // check x row exist & no y row\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        var vx = values ? values[kx] : undefined;\n        // insert value @ y\n        index.splice(ky, 0, y);\n        if (values) {\n          values.splice(ky, 0, vx);\n        }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        }\n        // next column\n        continue;\n      }\n      // check y row exist & no x row\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        var vy = values ? values[ky] : undefined;\n        // insert value @ x\n        index.splice(kx, 0, x);\n        if (values) {\n          values.splice(kx, 0, vy);\n        }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n  return SparseMatrix;\n}, {\n  isClass: true\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\n  /**\n   * Create a Matrix. The function creates a new `math.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Supported storage formats are 'dense' and 'sparse'.\n   *\n   * Syntax:\n   *\n   *    math.matrix()                         // creates an empty matrix using default storage format (dense).\n   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).\n   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.\n   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.\n   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.\n   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n   *\n   * Examples:\n   *\n   *    let m = math.matrix([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, sparse\n   *\n   * @param {Array | Matrix} [data]    A multi dimensional array\n   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]        Type of the values\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function _() {\n      return _create([]);\n    },\n    string: function string(format) {\n      return _create([], format);\n    },\n    'string, string': function stringString(format, datatype) {\n      return _create([], format, datatype);\n    },\n    Array: function Array(data) {\n      return _create(data);\n    },\n    Matrix: function Matrix(data) {\n      return _create(data, data.storage());\n    },\n    'Array | Matrix, string': _create,\n    'Array | Matrix, string, string': _create\n  });\n\n  /**\n   * Create a new Matrix with given storage format\n   * @param {Array} data\n   * @param {string} [format]\n   * @param {string} [datatype]\n   * @returns {Matrix} Returns a new Matrix\n   * @private\n   */\n  function _create(data, format, datatype) {\n    // get storage format constructor\n    if (format === 'dense' || format === 'default' || format === undefined) {\n      return new DenseMatrix(data, datatype);\n    }\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype);\n    }\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.plus(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value');\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value');\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match');\n      var res = x.clone();\n      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n      res.fixPrefix = false;\n      return res;\n    })\n  });\n});","import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo11xS0s';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo11xS0s = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo11xS0s(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k];\n        // invoke callback\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nexport var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, b)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij..z,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n   */\n  return function matAlgo14xDs(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (var i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);\n      }\n    } else {\n      // iterate current level\n      for (var j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);\n      }\n    }\n    return cv;\n  }\n});","import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n    'number, number': multiplyNumber,\n    'Complex, Complex': function ComplexComplex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.times(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),\n    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    equalScalar,\n    dot\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  function _validateMatrixDimensions(size1, size2) {\n    // check left operand dimensions\n    switch (size1.length) {\n      case 1:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Vector x Vector\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');\n            }\n            break;\n          case 2:\n            // Vector x Matrix\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');\n            }\n            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\n      case 2:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Matrix x Vector\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');\n            }\n            break;\n          case 2:\n            // Matrix x Matrix\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');\n            }\n            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\n      default:\n        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');\n    }\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (N)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {number}             Scalar value\n   */\n  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n    return dot(a, b);\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Matrix         (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorMatrix(a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented');\n    }\n    return _multiplyVectorDenseMatrix(a, b);\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Dense Matrix   (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // rows & columns\n    var alength = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix columns\n    for (var j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      var sum = mf(adata[0], bdata[0][j]);\n      // loop vector\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n      c[j] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: dt\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {Matrix}             Dense Vector   (M)\n   */\n  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  });\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Matrix         (NxC)\n   *\n   * @return {Matrix}             Matrix         (MxC)\n   */\n  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix  (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             Dense Vector (M)\n   */\n  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // sum (do not initialize it with zero)\n      var sum = mf(row[0], bdata[0]);\n      // loop matrix a columns\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n      c[i] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: dt\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            DenseMatrix    (NxC)\n   *\n   * @return {Matrix}             DenseMatrix    (MxC)\n   */\n  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // initialize row array\n      c[i] = [];\n      // loop matrix b columns\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]);\n        // loop matrix a columns\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n        c[i][j] = sum;\n      }\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            SparseMatrix   (NxC)\n   *\n   * @return {Matrix}             SparseMatrix   (MxC)\n   */\n  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // validate b matrix\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    }\n    // rows & columns\n    var arows = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // indeces in column jb\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1];\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0;\n        // loop a rows\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1;\n          // C[i, jb]\n          var cij = void 0;\n          // values in b column j\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb];\n            // check value has been initialized\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]);\n              // update mark\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          }\n          // check column has been processed and value != 0\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix    (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             SparseMatrix    (M, 1)\n   */\n  function _multiplySparseMatrixVector(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype;\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // update ptr\n    cptr[0] = 0;\n    // rows in b\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib];\n      // check b[ib] != 0, avoid loops\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          var ia = aindex[ka];\n          // check value exists in current j\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true;\n            // add i to pattern of C\n            cindex.push(ia);\n            // x(ia) = A\n            x[ia] = mf(vbi, avalues[ka]);\n          } else {\n            // i exists in C already\n            x[ia] = af(x[ia], mf(vbi, avalues[ka]));\n          }\n        }\n      }\n    }\n    // copy values from x to column jb of c\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p];\n      // copy value\n      cvalues[p] = x[ic];\n    }\n    // update ptr\n    cptr[1] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: dt\n    });\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            DenseMatrix       (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixDenseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype;\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // rows in jb\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb];\n        // check b[ib, jb] != 0, avoid loops\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            var ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\n              x[ia] = mf(vbij, avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(vbij, avalues[ka]));\n            }\n          }\n        }\n      }\n      // copy values from x to column jb of c\n      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        var ic = cindex[p];\n        // copy value\n        cvalues[p] = x[ic];\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            SparseMatrix      (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixSparseMatrix(a, b) {\n    // a sparse\n    var avalues = a._values;\n    var aindex = a._index;\n    var aptr = a._ptr;\n    var adt = a._datatype;\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype;\n\n    // rows & columns\n    var arows = a._size[0];\n    var bcolumns = b._size[1];\n    // flag indicating both matrices (a & b) contain data\n    var values = avalues && bvalues;\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // workspace\n    var x = values ? [] : undefined;\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n    // variables\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib;\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // B values & index in j\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb];\n        // check we need to process values\n        if (values) {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\n              x[ia] = mf(bvalues[kb], avalues[ka]);\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));\n            }\n          }\n        } else {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n            }\n          }\n        }\n      }\n      // check we need to process matrix values (pattern matrix)\n      if (values) {\n        // copy values from x to column jb of c\n        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          var ic = cindex[p];\n          // copy value\n          cvalues[p] = x[ic];\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\n  /**\n   * Multiply two or more values, `x * y`.\n   * For matrices, the matrix product is calculated.\n   *\n   * Syntax:\n   *\n   *    math.multiply(x, y)\n   *    math.multiply(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.multiply(4, 5.2)        // returns number 20.8\n   *    math.multiply(2, 3, 4)       // returns number 24\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.multiply(a, b)          // returns Complex 5 + 14i\n   *\n   *    const c = [[1, 2], [4, 3]]\n   *    const d = [[1, 2, 3], [3, -4, 7]]\n   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]\n   *\n   *    const e = math.unit('2.1 km')\n   *    math.multiply(3, e)          // returns Unit 6.3 km\n   *\n   * See also:\n   *\n   *    divide, prod, cross, dot\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`\n   */\n  return typed(name, multiplyScalar, {\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y));\n\n      // use dense matrix implementation\n      var m = selfMM(matrix(x), matrix(y));\n      // return array or scalar\n      return isMatrix(m) ? m.valueOf() : m;\n    }),\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size();\n\n      // check dimensions\n      _validateMatrixDimensions(xsize, ysize);\n\n      // process dimensions\n      if (xsize.length === 1) {\n        // process y dimensions\n        if (ysize.length === 1) {\n          // Vector * Vector\n          return _multiplyVectorVector(x, y, xsize[0]);\n        }\n        // Vector * Matrix\n        return _multiplyVectorMatrix(x, y);\n      }\n      // process y dimensions\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      }\n      // Matrix * Matrix\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM => (x, y) => selfMM(x, matrix(y))),\n    'Array, Matrix': typed.referToSelf(self => (x, y) => {\n      // use Matrix * Matrix implementation\n      return self(matrix(x, y.storage()), y);\n    }),\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      var result = self(x, y);\n      for (var i = 0; i < rest.length; i++) {\n        result = self(result, rest[i]);\n      }\n      return result;\n    })\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Compute the complex conjugate of a complex value.\n   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.conj(x)\n   *\n   * Examples:\n   *\n   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i\n   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i\n   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i\n   *\n   * See also:\n   *\n   *    re, im, arg, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            The complex conjugate of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.conjugate(),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});","export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { noMatrix } from '../../utils/noop.js';\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix\n  } = _ref;\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                  // returns []\n   *     math.size('hello world')        // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                    // returns [2, 3]\n   *     math.size(math.range(1,6))      // returns [5]\n   *\n   * See also:\n   *\n   *     count, resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array | Matrix} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: function Matrix(x) {\n      return x.create(x.size());\n    },\n    Array: arraySize,\n    string: function string(x) {\n      return config.matrix === 'Array' ? [x.length] : matrix([x.length]);\n    },\n    'number | Complex | BigNumber | Unit | boolean | null': function numberComplexBigNumberUnitBooleanNull(x) {\n      // scalar\n      return config.matrix === 'Array' ? [] : matrix ? matrix([]) : noMatrix();\n    }\n  });\n});","import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    multiplyScalar,\n    conj,\n    size\n  } = _ref;\n  /**\n   * Calculate the dot product of two vectors. The dot product of\n   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:\n   *\n   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn\n   *\n   * Syntax:\n   *\n   *    math.dot(x, y)\n   *\n   * Examples:\n   *\n   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15\n   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15\n   *\n   * See also:\n   *\n   *    multiply, cross\n   *\n   * @param  {Array | Matrix} x     First vector\n   * @param  {Array | Matrix} y     Second vector\n   * @return {number}               Returns the dot product of `x` and `y`\n   */\n  return typed(name, {\n    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,\n    'SparseMatrix, SparseMatrix': _sparseDot\n  });\n  function _validateDim(x, y) {\n    var xSize = _size(x);\n    var ySize = _size(y);\n    var xLen, yLen;\n    if (xSize.length === 1) {\n      xLen = xSize[0];\n    } else if (xSize.length === 2 && xSize[1] === 1) {\n      xLen = xSize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');\n    }\n    if (ySize.length === 1) {\n      yLen = ySize[0];\n    } else if (ySize.length === 2 && ySize[1] === 1) {\n      yLen = ySize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');\n    }\n    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');\n    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');\n    return xLen;\n  }\n  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n    var adata = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype : undefined;\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    var aIsColumn = _size(a).length === 2;\n    var bIsColumn = _size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      var dt = adt;\n      // find signatures that matches (dt, dt)\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // both vectors 1-dimensional\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n      return c;\n    }\n\n    // a is 1-dim, b is column\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n      return _c;\n    }\n\n    // a is column, b is 1-dim\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n      return _c2;\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n      return _c3;\n    }\n  }\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values;\n\n    // TODO optimize add & mul using datatype\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n      if (I < J) {\n        i++;\n        continue;\n      }\n      if (I > J) {\n        j++;\n        continue;\n      }\n      if (I === J) {\n        c = add(c, mul(xvalues[i], yvalues[j]));\n        i++;\n        j++;\n      }\n    }\n    return c;\n  }\n\n  // TODO remove this once #1771 is fixed\n  function _size(x) {\n    return isMatrix(x) ? x.size() : size(x);\n  }\n});","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createUnaryPlus, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBignumber, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCosh, createCoth, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSparseMatrixClass, createSplitUnit, createSquare, createString, createTan, createTypeOf, createAcosh, createAcsch, createApply, createAsec, createBin, createCombinationsWithRep, createCos, createCsch, createIsNaN, createIsPrime, createRandomInt, createSech, createSinh, createSparse, createSqrt, createTanh, createUnaryMinus, createAcoth, createCot, createFraction, createIsNumeric, createMatrix, createMatrixFromFunction, createMod, createNthRoot, createNumeric, createOr, createProd, createReshape, createSize, createSmaller, createSqueeze, createSubset, createSubtract, createTo, createTranspose, createXgcd, createZeros, createAnd, createBitAnd, createBitXor, createCbrt, createCompare, createCompareText, createConcat, createCount, createCtranspose, createDiag, createDivideScalar, createDotDivide, createEqual, createFft, createFlatten, createGcd, createHasNumericValue, createHypot, createIfft, createKron, createLargerEq, createLeftShift, createLsolve, createMatrixFromColumns, createMin, createMode, createNthRoots, createOnes, createPartitionSelect, createResize, createRightArithShift, createRound, createSmallerEq, createUnequal, createUsolve, createXor, createAdd, createAtan2, createBitOr, createCatalan, createCompareNatural, createCumSum, createDeepEqual, createDiff, createDot, createEqualText, createFloor, createIdentity, createInvmod, createLarger, createLog, createLsolveAll, createMatrixFromRows, createMultiply, createQr, createRange, createRightLogShift, createSetSize, createSlu, createSum, createTrace, createUsolveAll, createAsin, createCeil, createComposition, createCross, createDet, createDistance, createDotMultiply, createFibonacciHeapClass, createFix, createImmutableDenseMatrixClass, createIndexClass, createIntersect, createLcm, createLog1p, createMax, createQuantileSeq, createRow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSort, createColumn, createIndex, createInv, createPinv, createPow, createSetDifference, createSetMultiplicity, createSpaClass, createSqrtm, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCreateUnit, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createExpm, createFaraday, createFirstRadiation, createGamma, createGravitationConstant, createHartreeEnergy, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createReducedPlanckConstant, createRydberg, createSecondRadiation, createSetSymDifference, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCoulomb, createDivide, createElectronMass, createFactorial, createGravity, createInverseConductanceQuantum, createLup, createMagneticFluxQuantum, createMolarMassC12, createMultinomial, createPermutations, createPlanckMass, createPolynomialRoot, createSetIntersect, createStirlingS2, createUnitFunction, createBellNumbers, createEigs, createFermiCoupling, createMean, createMolarVolume, createPlanckConstant, createQuantumOfCirculation, createSetUnion, createVariance, createClassicalElectronRadius, createLusolve, createMedian, createKldivergence, createMad, createStd, createGasConstant, createNorm, createRotationMatrix, createPlanckTime, createSchur, createRotate, createSylvester, createLyap } from '../factoriesAny.js';\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var _null = /* #__PURE__ */createNull({});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  BigNumber,\n  config,\n  typed\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  typed\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var lgamma = /* #__PURE__ */createLgamma({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var apply = /* #__PURE__ */createApply({\n  isInteger,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  typed\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({\n  isZero,\n  matrix,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  matrix,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  matrix,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var to = /* #__PURE__ */createTo({\n  matrix,\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var and = /* #__PURE__ */createAnd({\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  matrix,\n  typed\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var fft = /* #__PURE__ */createFft({\n  addScalar,\n  divideScalar,\n  exp,\n  i,\n  matrix,\n  multiplyScalar,\n  tau,\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  matrix,\n  typed\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  numeric,\n  smaller,\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  matrix,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var invmod = /* #__PURE__ */createInvmod({\n  BigNumber,\n  add,\n  config,\n  equal,\n  isInteger,\n  mod,\n  smaller,\n  typed,\n  xgcd\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var matrixFromRows = /* #__PURE__ */createMatrixFromRows({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  config,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  divideScalar,\n  isZero,\n  matrix,\n  multiply,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  flatten,\n  isNumeric,\n  isZero,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  equalScalar,\n  matrix,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  larger,\n  numeric,\n  typed\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  add,\n  compare,\n  multiply,\n  partitionSelect,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var pinv = /* #__PURE__ */createPinv({\n  Complex,\n  add,\n  ctranspose,\n  deepEqual,\n  divideScalar,\n  dot,\n  dotDivide,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  inv,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  map,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtract\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var polynomialRoot = /* #__PURE__ */createPolynomialRoot({\n  add,\n  cbrt,\n  divide,\n  equalScalar,\n  im,\n  isZero,\n  multiply,\n  re,\n  sqrt,\n  subtract,\n  typeOf,\n  typed,\n  unaryMinus\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  bignumber,\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  number,\n  pow,\n  subtract,\n  typed\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  column,\n  complex,\n  config,\n  cos,\n  diag,\n  divideScalar,\n  dot,\n  equal,\n  flatten,\n  im,\n  inv,\n  larger,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  multiplyScalar,\n  number,\n  qr,\n  re,\n  sin,\n  smaller,\n  sqrt,\n  subtract,\n  typed,\n  usolve,\n  usolveAll\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  apply,\n  divide,\n  isNaN,\n  multiply,\n  subtract,\n  typed\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  map,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var schur = /* #__PURE__ */createSchur({\n  identity,\n  matrix,\n  multiply,\n  norm,\n  qr,\n  subtract,\n  typed\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var sylvester = /* #__PURE__ */createSylvester({\n  abs,\n  add,\n  concat,\n  identity,\n  index,\n  lusolve,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  range,\n  schur,\n  subset,\n  subtract,\n  transpose,\n  typed\n});\nexport var lyap = /* #__PURE__ */createLyap({\n  matrix,\n  multiply,\n  sylvester,\n  transpose,\n  typed\n});"],"names":["_extends","target","i","source","key","DEFAULT_CONFIG","isNumber","x","isBigNumber","isComplex","isFraction","isUnit","isString","isArray","isMatrix","isCollection","isDenseMatrix","isSparseMatrix","isRange","isIndex","isBoolean","isResultSet","isHelp","isFunction","isDate","isRegExp","isObject","isNull","isUndefined","isAccessorNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isNode","isObjectNode","isOperatorNode","isParenthesisNode","isRangeNode","isRelationalNode","isSymbolNode","isChain","typeOf","t","clone","type","value","mapObject","object","callback","hasOwnProperty","deepStrictEqual","a","b","prop","len","property","pickShallow","properties","copy","MATRIX_OPTIONS","NUMBER_OPTIONS","config","options","isInteger","formatNumberToBase","n","base","size","prefixes","prefix","suffix","sign","format","notation","precision","wordSize","toFixed","toExponential","toEngineering","toPrecision","digits","e","splitNumber","match","exponent","dot","coefficients","zeros","d","split","rounded","roundDigits","c","newExp","missingZeros","expDiff","decimalIdx","decimals","decimalVal","str","splitValue","p","pp","first","lowerExp","upperExp","removed","length","arr","DBL_EPSILON","nearlyEqual","y","epsilon","diff","formatBigNumberToBase","BigNumberCtor","big2","exp","valueWithoutExp","valueStr","result","_format","formatNumber","formatBigNumber","looksLikeFraction","formatArray","entries","array","DimensionError","actual","expected","relation","IndexError","index","min","max","arraySize","s","_validate","dim","dimNext","child","validate","isScalar","validateIndex","resize","defaultValue","_defaultValue","_resize","elem","oldLen","newLen","minLen","reshape","sizes","flatArray","flatten","currentLength","processSizesWildcard","newLength","product","_reshape","processedSizes","WILDCARD","wildCardIndex","isMoreThanOneWildcard","hasWildcard","canReplaceWildcard","prev","curr","tmpArray","tmpArray2","sizeIndex","unsqueeze","dims","outer","_unsqueeze","ii","next","flat","getArrayDataType","item","itemType","factory","name","dependencies","create","meta","assertAndCreate","scope","deps","stripOptionalNotation","assertDependencies","allDefined","dependency","isOptionalDependency","missingDependencies","getSafeProperty","isPlainObject","isSafeProperty","isSafeMethod","setSafeProperty","hasSafeProperty","safeNativeProperties","method","safeNativeMethods","ObjectWrappingMap","isMap","_createTyped2","typedFunction","createTyped","_ref","BigNumber","Complex","DenseMatrix","Fraction","typed","throwNoBignumber","throwNoComplex","throwNoFraction","f","throwNoMatrix","matrix","args","signatures","usualError","sig","err","createBigNumberClass","on","Decimal","json","createComplexClass","im","re","strRe","strIm","arg","r","phi","createFractionClass","createMatrixClass","Matrix","data","datatype","replacement","skipZeros","maxArgumentCount","fn","signature","count","createDenseMatrixClass","preprocess","_get","_set","indexI","_fit","_getSubmatrix","last","range","submatrix","iSize","sSize","_setSubmatrix","dataIndex","subIndex","sizeArray","v","m","newSize","changed","me","recurse","row","_this","_loop","col","k","kSuper","kSub","rows","columns","_value","ms","j","vi","deepMap","n2","addNumber","multiplyNumber","complexEquals","createCompareUnits","self","createEqualScalar","compareUnits","bigNearlyEqual","_ref2","createSparseMatrixClass","equalScalar","SparseMatrix","_createFromMatrix","_createFromArray","eq","zero","_getsubset","_setsubset","idx","kk","mvalues","mindex","mptr","w","pv","values","ptr","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_getValueIndex","_remove","_insert","top","bottom","ins","k0","k1","colIndex","rowIndex","_i","r1","c1","_i2","h","_i3","_j","invoke","_map","minRow","maxRow","minColumn","maxColumn","_values","_k","_i4","_i5","_k2","_i6","_i7","_toArray","density","kx","ky","vx","vy","createMatrix","_create","createAddScalar","res","createMatAlgo11xS0s","inverse","avalues","aindex","aptr","asize","adt","dt","cf","cvalues","cindex","cptr","createMatAlgo14xDs","adata","cdata","_iterate","level","av","bv","cv","createMultiplyScalar","createMultiply","addScalar","multiplyScalar","matAlgo11xS0s","matAlgo14xDs","_validateMatrixDimensions","size1","size2","_multiplyVectorVector","_multiplyVectorMatrix","_multiplyVectorDenseMatrix","bdata","bsize","bdt","alength","bcolumns","af","mf","sum","_multiplyMatrixVector","_multiplyDenseMatrixVector","_multiplySparseMatrixVector","_multiplyMatrixMatrix","_multiplyDenseMatrixDenseMatrix","_multiplyDenseMatrixSparseMatrix","_multiplySparseMatrixDenseMatrix","_multiplySparseMatrixSparseMatrix","arows","acolumns","bvalues","bindex","bptr","jb","kb0","kb1","mark","cij","kb","ib","brows","vbi","ka0","ka1","ka","ia","p1","ic","vbij","p0","selfMM","xsize","ysize","rest","createConj","noMatrix","createSize","createDot","conj","_denseDot","_sparseDot","_validateDim","xSize","_size","ySize","xLen","yLen","N","aIsColumn","bIsColumn","add","mul","_c","_c2","_c3","xindex","xvalues","yindex","yvalues","I","J","multiply"],"mappings":"wXAAe,SAASA,IAAW,CACjC,OAAAA,GAAW,OAAO,OAAS,OAAO,OAAO,KAAI,EAAK,SAAUC,EAAQ,CAClE,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIC,EAAS,UAAUD,CAAC,EACxB,QAASE,KAAOD,EACV,OAAO,UAAU,eAAe,KAAKA,EAAQC,CAAG,IAClDH,EAAOG,CAAG,EAAID,EAAOC,CAAG,EAG7B,CACD,OAAOH,CACX,EACSD,GAAS,MAAM,KAAM,SAAS,CACvC,CCbO,IAAIK,GAAiB,CAG1B,QAAS,MAET,OAAQ,SAER,OAAQ,SAER,UAAW,GAKX,YAAa,GAGb,WAAY,IACd,ECJO,SAASC,EAASC,EAAG,CAC1B,OAAO,OAAOA,GAAM,QACtB,CACO,SAASC,GAAYD,EAAG,CAC7B,MAAI,CAACA,GAAK,OAAOA,GAAM,UAAY,OAAOA,EAAE,aAAgB,WACnD,GAELA,EAAE,cAAgB,IAAQ,OAAOA,EAAE,YAAY,WAAc,UAAYA,EAAE,YAAY,UAAU,cAAgB,IAGjH,OAAOA,EAAE,YAAY,WAAc,YAAcA,EAAE,YAAY,UAAUA,CAAC,IAAM,EAItF,CACO,SAASE,GAAUF,EAAG,CAC3B,OAAOA,GAAK,OAAOA,GAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,YAAc,IAAQ,EACtF,CACO,SAASG,GAAWH,EAAG,CAC5B,OAAOA,GAAK,OAAOA,GAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,aAAe,IAAQ,EACvF,CACO,SAASI,GAAOJ,EAAG,CACxB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACO,SAASK,GAASL,EAAG,CAC1B,OAAO,OAAOA,GAAM,QACtB,CACO,IAAIM,EAAU,MAAM,QACpB,SAASC,GAASP,EAAG,CAC1B,OAAOA,GAAKA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC3D,CAOO,SAASQ,GAAaR,EAAG,CAC9B,OAAO,MAAM,QAAQA,CAAC,GAAKO,GAASP,CAAC,CACvC,CACO,SAASS,GAAcT,EAAG,CAC/B,OAAOA,GAAKA,EAAE,eAAiBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC9E,CACO,SAASU,GAAeV,EAAG,CAChC,OAAOA,GAAKA,EAAE,gBAAkBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC/E,CACO,SAASW,GAAQX,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAASY,GAAQZ,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAASa,GAAUb,EAAG,CAC3B,OAAO,OAAOA,GAAM,SACtB,CACO,SAASc,GAAYd,EAAG,CAC7B,OAAOA,GAAKA,EAAE,YAAY,UAAU,cAAgB,IAAQ,EAC9D,CACO,SAASe,GAAOf,EAAG,CACxB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACO,SAASgB,GAAWhB,EAAG,CAC5B,OAAO,OAAOA,GAAM,UACtB,CACO,SAASiB,GAAOjB,EAAG,CACxB,OAAOA,aAAa,IACtB,CACO,SAASkB,GAASlB,EAAG,CAC1B,OAAOA,aAAa,MACtB,CACO,SAASmB,GAASnB,EAAG,CAC1B,MAAO,CAAC,EAAEA,GAAK,OAAOA,GAAM,UAAYA,EAAE,cAAgB,QAAU,CAACE,GAAUF,CAAC,GAAK,CAACG,GAAWH,CAAC,EACpG,CACO,SAASoB,GAAOpB,EAAG,CACxB,OAAOA,IAAM,IACf,CACO,SAASqB,GAAYrB,EAAG,CAC7B,OAAOA,IAAM,MACf,CACO,SAASsB,GAAetB,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAASuB,GAAYvB,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAASwB,GAAiBxB,EAAG,CAClC,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACO,SAASyB,GAAYzB,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAAS0B,GAAkB1B,EAAG,CACnC,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACO,SAAS2B,GAAe3B,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CAeO,SAAS4B,GAAyB5B,EAAG,CAC1C,OAAOA,GAAKA,EAAE,2BAA6B,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAChG,CACO,SAAS6B,GAAe7B,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAAS8B,GAAY9B,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAAS+B,GAAO/B,EAAG,CACxB,OAAOA,GAAKA,EAAE,SAAW,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAC9E,CACO,SAASgC,GAAahC,EAAG,CAC9B,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACO,SAASiC,GAAejC,EAAG,CAChC,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACO,SAASkC,GAAkBlC,EAAG,CACnC,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACO,SAASmC,GAAYnC,EAAG,CAC7B,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACO,SAASoC,GAAiBpC,EAAG,CAClC,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACO,SAASqC,GAAarC,EAAG,CAC9B,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACO,SAASsC,GAAQtC,EAAG,CACzB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACO,SAASuC,GAAOvC,EAAG,CACxB,IAAIwC,EAAI,OAAOxC,EACf,OAAIwC,IAAM,SACJxC,IAAM,KAAa,OACnBC,GAAYD,CAAC,EAAU,YACvBA,EAAE,aAAeA,EAAE,YAAY,KAAaA,EAAE,YAAY,KACvD,SAGFwC,CACT,CC3JO,SAASC,EAAMzC,EAAG,CACvB,IAAI0C,EAAO,OAAO1C,EAGlB,GAAI0C,IAAS,UAAYA,IAAS,UAAYA,IAAS,WAAa1C,IAAM,MAAQA,IAAM,OACtF,OAAOA,EAIT,GAAI,OAAOA,EAAE,OAAU,WACrB,OAAOA,EAAE,QAIX,GAAI,MAAM,QAAQA,CAAC,EACjB,OAAOA,EAAE,IAAI,SAAU2C,EAAO,CAC5B,OAAOF,EAAME,CAAK,CACxB,CAAK,EAEH,GAAI3C,aAAa,KAAM,OAAO,IAAI,KAAKA,EAAE,QAAO,CAAE,EAClD,GAAIC,GAAYD,CAAC,EAAG,OAAOA,EAC3B,GAAIA,aAAa,OAAQ,MAAM,IAAI,UAAU,gBAAkBA,CAAC,EAGhE,OAAO4C,GAAU5C,EAAGyC,CAAK,CAC3B,CAQO,SAASG,GAAUC,EAAQC,EAAU,CAC1C,IAAIL,EAAQ,CAAA,EACZ,QAAS5C,KAAOgD,EACVE,GAAeF,EAAQhD,CAAG,IAC5B4C,EAAM5C,CAAG,EAAIiD,EAASD,EAAOhD,CAAG,CAAC,GAGrC,OAAO4C,CACT,CA0DO,SAASO,GAAgBC,EAAGC,EAAG,CACpC,IAAIC,EAAMxD,EAAGyD,EACb,GAAI,MAAM,QAAQH,CAAC,EAAG,CAIpB,GAHI,CAAC,MAAM,QAAQC,CAAC,GAGhBD,EAAE,SAAWC,EAAE,OACjB,MAAO,GAET,IAAKvD,EAAI,EAAGyD,EAAMH,EAAE,OAAQtD,EAAIyD,EAAKzD,IACnC,GAAI,CAACqD,GAAgBC,EAAEtD,CAAC,EAAGuD,EAAEvD,CAAC,CAAC,EAC7B,MAAO,GAGX,MAAO,EACX,KAAS,IAAI,OAAOsD,GAAM,WACtB,OAAOA,IAAMC,EACR,GAAID,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQC,CAAC,GAAK,EAAEA,aAAa,QACrC,MAAO,GAET,IAAKC,KAAQF,EAEX,GAAI,EAAEE,KAAQD,IAAM,CAACF,GAAgBC,EAAEE,CAAI,EAAGD,EAAEC,CAAI,CAAC,EACnD,MAAO,GAGX,IAAKA,KAAQD,EAEX,GAAI,EAAEC,KAAQF,GACZ,MAAO,GAGX,MAAO,EACX,KACI,QAAOA,IAAMC,EAEjB,CAwGO,SAASH,GAAeF,EAAQQ,EAAU,CAC/C,OAAOR,GAAU,OAAO,eAAe,KAAKA,EAAQQ,CAAQ,CAC9D,CAmGO,SAASC,GAAYT,EAAQU,EAAY,CAE9C,QADIC,EAAO,CAAA,EACF7D,EAAI,EAAGA,EAAI4D,EAAW,OAAQ5D,IAAK,CAC1C,IAAIE,EAAM0D,EAAW5D,CAAC,EAClBgD,EAAQE,EAAOhD,CAAG,EAClB8C,IAAU,SACZa,EAAK3D,CAAG,EAAI8C,EAEf,CACD,OAAOa,CACT,CC1WO,IAAIC,GAAiB,CAAC,SAAU,OAAO,EACnCC,GAAiB,CAAC,SAAU,YAAa,UAAU,ECEnDC,GAAwB,SAAgBC,EAAS,CAC1D,GAAIA,EACF,MAAM,IAAI,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAuR,EAEzS,OAAO,OAAO,OAAO9D,EAAc,CACrC,EACAL,GAASkE,GAAQ7D,GAAgB,CAC/B,eAAA2D,GACA,eAAAC,EACF,CAAC,ECHM,SAASG,GAAUlB,EAAO,CAC/B,OAAI,OAAOA,GAAU,UACZ,GAEF,SAASA,CAAK,EAAIA,IAAU,KAAK,MAAMA,CAAK,EAAI,EACzD,CAwFA,SAASmB,GAAmBC,EAAGC,EAAMC,EAAM,CACzC,IAAIC,EAAW,CACb,EAAG,KACH,EAAG,KACH,GAAI,IACR,EACMC,EAASD,EAASF,CAAI,EACtBI,EAAS,GACb,GAAIH,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,CAACJ,GAAUI,CAAI,EACjB,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIF,EAAI,IAAME,EAAO,GAAK,GAAKF,EAAI,EAAE,IAAME,EAAO,IAChD,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAACJ,GAAUE,CAAC,EACd,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAI,IACNA,EAAIA,EAAI,GAAKE,GAEfG,EAAS,IAAI,OAAOH,CAAI,CACzB,CACD,IAAII,EAAO,GACX,OAAIN,EAAI,IACNA,EAAI,CAACA,EACLM,EAAO,KAEF,GAAG,OAAOA,CAAI,EAAE,OAAOF,CAAM,EAAE,OAAOJ,EAAE,SAASC,CAAI,CAAC,EAAE,OAAOI,CAAM,CAC9E,CAsFO,SAASE,GAAO3B,EAAOiB,EAAS,CACrC,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQjB,CAAK,EAItB,GAAIA,IAAU,IACZ,MAAO,WACF,GAAIA,IAAU,KACnB,MAAO,YACF,GAAI,MAAMA,CAAK,EACpB,MAAO,MAIT,IAAI4B,EAAW,OACXC,EACAC,EACJ,GAAIb,IAEEA,EAAQ,WACVW,EAAWX,EAAQ,UAIjB7D,EAAS6D,CAAO,EAClBY,EAAYZ,EACH7D,EAAS6D,EAAQ,SAAS,IACnCY,EAAYZ,EAAQ,WAElBA,EAAQ,WACVa,EAAWb,EAAQ,SACf,OAAOa,GAAa,WACtB,MAAM,IAAI,MAAM,oCAAoC,EAM1D,OAAQF,EAAQ,CACd,IAAK,QACH,OAAOG,GAAQ/B,EAAO6B,CAAS,EACjC,IAAK,cACH,OAAOG,GAAchC,EAAO6B,CAAS,EACvC,IAAK,cACH,OAAOI,GAAcjC,EAAO6B,CAAS,EACvC,IAAK,MACH,OAAOV,GAAmBnB,EAAO,EAAG8B,CAAQ,EAC9C,IAAK,MACH,OAAOX,GAAmBnB,EAAO,EAAG8B,CAAQ,EAC9C,IAAK,MACH,OAAOX,GAAmBnB,EAAO,GAAI8B,CAAQ,EAC/C,IAAK,OAEH,OAAOI,GAAYlC,EAAO6B,EAAWZ,GAAWA,CAAO,EAAE,QAAQ,sBAAuB,UAAY,CAClG,IAAIkB,EAAS,UAAU,CAAC,EACpBC,EAAI,UAAU,CAAC,EACnB,OAAOD,IAAW,IAAMA,EAASC,EAAIA,CAC7C,CAAO,EACH,QACE,MAAM,IAAI,MAAM,qBAAuBR,EAAW,kEAAuE,CAC5H,CACH,CAQO,SAASS,GAAYrC,EAAO,CAEjC,IAAIsC,EAAQ,OAAOtC,CAAK,EAAE,cAAc,MAAM,iCAAiC,EAC/E,GAAI,CAACsC,EACH,MAAM,IAAI,YAAY,kBAAoBtC,CAAK,EAEjD,IAAI0B,EAAOY,EAAM,CAAC,EACdH,EAASG,EAAM,CAAC,EAChBC,EAAW,WAAWD,EAAM,CAAC,GAAK,GAAG,EACrCE,EAAML,EAAO,QAAQ,GAAG,EAC5BI,GAAYC,IAAQ,GAAKA,EAAM,EAAIL,EAAO,OAAS,EACnD,IAAIM,EAAeN,EAAO,QAAQ,IAAK,EAAE,EACxC,QAAQ,MAAO,SAAUO,EAAO,CAE/B,OAAAH,GAAYG,EAAM,OACX,EACX,CAAG,EAAE,QAAQ,MAAO,EAAE,EACnB,MAAM,EAAE,EAAE,IAAI,SAAUC,EAAG,CAC1B,OAAO,SAASA,CAAC,CACrB,CAAG,EACD,OAAIF,EAAa,SAAW,IAC1BA,EAAa,KAAK,CAAC,EACnBF,KAEK,CACL,KAAAb,EACA,aAAAe,EACA,SAAAF,CACJ,CACA,CAOO,SAASN,GAAcjC,EAAO6B,EAAW,CAC9C,GAAI,MAAM7B,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAI4C,EAAQP,GAAYrC,CAAK,EACzB6C,EAAUC,GAAYF,EAAOf,CAAS,EACtCO,EAAIS,EAAQ,SACZE,EAAIF,EAAQ,aAGZG,EAASZ,EAAI,IAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAC/D,GAAIhF,EAASyE,CAAS,EAEpB,KAAOA,EAAYkB,EAAE,QAAUX,EAAIY,EAAS,EAAID,EAAE,QAChDA,EAAE,KAAK,CAAC,MAMV,SADIE,EAAe,KAAK,IAAIb,EAAIY,CAAM,GAAKD,EAAE,OAAS,GAC7C/F,EAAI,EAAGA,EAAIiG,EAAcjG,IAChC+F,EAAE,KAAK,CAAC,EASZ,QAJIG,EAAU,KAAK,IAAId,EAAIY,CAAM,EAC7BG,EAAa,EAGVD,EAAU,GACfC,IACAD,IAKF,IAAIE,EAAWL,EAAE,MAAMI,CAAU,EAAE,KAAK,EAAE,EACtCE,EAAajG,EAASyE,CAAS,GAAKuB,EAAS,QAAUA,EAAS,MAAM,OAAO,EAAI,IAAMA,EAAW,GAClGE,EAAMP,EAAE,MAAM,EAAGI,CAAU,EAAE,KAAK,EAAE,EAAIE,EAAa,KAAOjB,GAAK,EAAI,IAAM,IAAMY,EAAO,WAC5F,OAAOH,EAAQ,KAAOS,CACxB,CAQO,SAASvB,GAAQ/B,EAAO6B,EAAW,CACxC,GAAI,MAAM7B,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAIuD,EAAalB,GAAYrC,CAAK,EAC9B6C,EAAU,OAAOhB,GAAc,SAAWiB,GAAYS,EAAYA,EAAW,SAAW,EAAI1B,CAAS,EAAI0B,EACzGR,EAAIF,EAAQ,aACZW,EAAIX,EAAQ,SAAW,EAGvBY,EAAKD,GAAK3B,GAAa,GAC3B,OAAIkB,EAAE,OAASU,IACbV,EAAIA,EAAE,OAAOL,GAAMe,EAAKV,EAAE,MAAM,CAAC,GAI/BS,EAAI,IACNT,EAAIL,GAAM,CAACc,EAAI,CAAC,EAAE,OAAOT,CAAC,EAC1BS,EAAI,GAIFA,EAAIT,EAAE,QACRA,EAAE,OAAOS,EAAG,EAAGA,IAAM,EAAI,KAAO,GAAG,EAE9BX,EAAQ,KAAOE,EAAE,KAAK,EAAE,CACjC,CASO,SAASf,GAAchC,EAAO6B,EAAW,CAC9C,GAAI,MAAM7B,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAI4C,EAAQP,GAAYrC,CAAK,EACzB6C,EAAUhB,EAAYiB,GAAYF,EAAOf,CAAS,EAAIe,EACtDG,EAAIF,EAAQ,aACZT,EAAIS,EAAQ,SAGZE,EAAE,OAASlB,IACbkB,EAAIA,EAAE,OAAOL,GAAMb,EAAYkB,EAAE,MAAM,CAAC,GAI1C,IAAIW,EAAQX,EAAE,QACd,OAAOF,EAAQ,KAAOa,GAASX,EAAE,OAAS,EAAI,IAAMA,EAAE,KAAK,EAAE,EAAI,IAAM,KAAOX,GAAK,EAAI,IAAM,IAAMA,CACrG,CAYO,SAASF,GAAYlC,EAAO6B,EAAWZ,EAAS,CACrD,GAAI,MAAMjB,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAI2D,EAAW1C,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,GAC1E2C,EAAW3C,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,EAC1E2B,EAAQP,GAAYrC,CAAK,EACzB6C,EAAUhB,EAAYiB,GAAYF,EAAOf,CAAS,EAAIe,EAC1D,GAAIC,EAAQ,SAAWc,GAAYd,EAAQ,UAAYe,EAErD,OAAO5B,GAAchC,EAAO6B,CAAS,EAErC,IAAIkB,EAAIF,EAAQ,aACZT,EAAIS,EAAQ,SAGZE,EAAE,OAASlB,IACbkB,EAAIA,EAAE,OAAOL,GAAMb,EAAYkB,EAAE,MAAM,CAAC,GAK1CA,EAAIA,EAAE,OAAOL,GAAMN,EAAIW,EAAE,OAAS,GAAKA,EAAE,OAASlB,EAAYA,EAAYkB,EAAE,OAAS,EAAE,CAAC,EAGxFA,EAAIL,GAAM,CAACN,CAAC,EAAE,OAAOW,CAAC,EACtB,IAAIP,EAAMJ,EAAI,EAAIA,EAAI,EACtB,OAAII,EAAMO,EAAE,OAAS,GACnBA,EAAE,OAAOP,EAAM,EAAG,EAAG,GAAG,EAEnBK,EAAQ,KAAOE,EAAE,KAAK,EAAE,CAEnC,CAUO,SAASD,GAAYF,EAAOf,EAAW,CAU5C,QARIgB,EAAU,CACZ,KAAMD,EAAM,KACZ,aAAcA,EAAM,aACpB,SAAUA,EAAM,QACpB,EACMG,EAAIF,EAAQ,aAGThB,GAAa,GAClBkB,EAAE,QAAQ,CAAC,EACXF,EAAQ,WACRhB,IAEF,GAAIkB,EAAE,OAASlB,EAAW,CACxB,IAAIgC,EAAUd,EAAE,OAAOlB,EAAWkB,EAAE,OAASlB,CAAS,EACtD,GAAIgC,EAAQ,CAAC,GAAK,EAAG,CACnB,IAAI7G,EAAI6E,EAAY,EAEpB,IADAkB,EAAE/F,CAAC,IACI+F,EAAE/F,CAAC,IAAM,IACd+F,EAAE,IAAG,EACD/F,IAAM,IACR+F,EAAE,QAAQ,CAAC,EACXF,EAAQ,WACR7F,KAEFA,IACA+F,EAAE/F,CAAC,GAEN,CACF,CACD,OAAO6F,CACT,CAOA,SAASH,GAAMoB,EAAQ,CAErB,QADIC,EAAM,CAAA,EACD/G,EAAI,EAAGA,EAAI8G,EAAQ9G,IAC1B+G,EAAI,KAAK,CAAC,EAEZ,OAAOA,CACT,CAaO,SAAS5B,GAAOnC,EAAO,CAC5B,OAAOA,EAAM,cAAa,EAAG,QAAQ,OAAQ,EAAE,EAC9C,QAAQ,aAAc,EAAE,EACxB,MACH,CAKO,IAAIgE,GAAc,OAAO,SAAW,qBAWpC,SAASC,GAAY5G,EAAG6G,EAAGC,EAAS,CAEzC,GAAIA,GAAY,KACd,OAAO9G,IAAM6G,EAEf,GAAI7G,IAAM6G,EACR,MAAO,GAIT,GAAI,MAAM7G,CAAC,GAAK,MAAM6G,CAAC,EACrB,MAAO,GAIT,GAAI,SAAS7G,CAAC,GAAK,SAAS6G,CAAC,EAAG,CAE9B,IAAIE,EAAO,KAAK,IAAI/G,EAAI6G,CAAC,EACzB,OAAIE,EAAOJ,GACF,GAGAI,GAAQ,KAAK,IAAI,KAAK,IAAI/G,CAAC,EAAG,KAAK,IAAI6G,CAAC,CAAC,EAAIC,CAEvD,CAGD,MAAO,EACT,CC1kBA,SAASE,GAAsBjD,EAAGC,EAAMC,EAAM,CAC5C,IAAIgD,EAAgBlD,EAAE,YAClBmD,EAAO,IAAID,EAAc,CAAC,EAC1B7C,EAAS,GACb,GAAIH,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,CAACJ,GAAUI,CAAI,EACjB,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIF,EAAE,YAAYmD,EAAK,IAAIjD,EAAO,CAAC,EAAE,IAAI,CAAC,CAAC,GAAKF,EAAE,SAASmD,EAAK,IAAIjD,EAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EACnF,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAACF,EAAE,YACL,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAE,SAAS,CAAC,IACdA,EAAIA,EAAE,IAAImD,EAAK,IAAIjD,CAAI,CAAC,GAE1BG,EAAS,IAAI,OAAOH,CAAI,CACzB,CACD,OAAQD,EAAI,CACV,IAAK,GACH,MAAO,GAAG,OAAOD,EAAE,SAAQ,CAAE,EAAE,OAAOK,CAAM,EAC9C,IAAK,GACH,MAAO,GAAG,OAAOL,EAAE,QAAO,CAAE,EAAE,OAAOK,CAAM,EAC7C,IAAK,IACH,MAAO,GAAG,OAAOL,EAAE,cAAa,CAAE,EAAE,OAAOK,CAAM,EACnD,QACE,MAAM,IAAI,MAAM,QAAQ,OAAOJ,EAAM,iBAAiB,CAAC,CAC1D,CACH,CAmFO,SAASM,GAAO3B,EAAOiB,EAAS,CACrC,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQjB,CAAK,EAItB,GAAI,CAACA,EAAM,WACT,OAAOA,EAAM,MAAO,EAAG,MAAQA,EAAM,GAAG,CAAC,EAAI,WAAa,YAI5D,IAAI4B,EAAW,OACXC,EACAC,EACJ,GAAIb,IAAY,SAEVA,EAAQ,WACVW,EAAWX,EAAQ,UAIjB,OAAOA,GAAY,SACrBY,EAAYZ,EACHA,EAAQ,YACjBY,EAAYZ,EAAQ,WAElBA,EAAQ,WACVa,EAAWb,EAAQ,SACf,OAAOa,GAAa,WACtB,MAAM,IAAI,MAAM,oCAAoC,EAM1D,OAAQF,EAAQ,CACd,IAAK,QACH,OAAOG,GAAQ/B,EAAO6B,CAAS,EACjC,IAAK,cACH,OAAOG,GAAchC,EAAO6B,CAAS,EACvC,IAAK,cACH,OAAOI,GAAcjC,EAAO6B,CAAS,EACvC,IAAK,MACH,OAAOwC,GAAsBrE,EAAO,EAAG8B,CAAQ,EACjD,IAAK,MACH,OAAOuC,GAAsBrE,EAAO,EAAG8B,CAAQ,EACjD,IAAK,MACH,OAAOuC,GAAsBrE,EAAO,GAAI8B,CAAQ,EAClD,IAAK,OACH,CAGE,IAAI6B,EAAW1C,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,GAC1E2C,EAAW3C,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,EAG9E,GAAIjB,EAAM,SAAU,MAAO,IAG3B,IAAIsD,EACAT,EAAU7C,EAAM,oBAAoB6B,CAAS,EAC7C2C,EAAM3B,EAAQ,EAClB,OAAI2B,GAAOb,GAAYa,EAAMZ,EAE3BN,EAAMT,EAAQ,UAGdS,EAAMtB,GAAchC,EAAO6B,CAAS,EAI/ByB,EAAI,QAAQ,sBAAuB,UAAY,CACpD,IAAInB,EAAS,UAAU,CAAC,EACpBC,EAAI,UAAU,CAAC,EACnB,OAAOD,IAAW,IAAMA,EAASC,EAAIA,CAC/C,CAAS,CACF,CACH,QACE,MAAM,IAAI,MAAM,qBAAuBR,EAAW,kEAAuE,CAC5H,CACH,CAOO,SAASK,GAAcjC,EAAO6B,EAAW,CAE9C,IAAI,EAAI7B,EAAM,EACVgD,EAAS,EAAI,IAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAG3DyB,EAAkBzE,EAAM,IAAI,KAAK,IAAI,GAAI,CAACgD,CAAM,CAAC,EACjD0B,EAAWD,EAAgB,YAAY5C,CAAS,EACpD,OAAI6C,EAAS,QAAQ,GAAG,IAAM,KAC5BA,EAAWD,EAAgB,YAEtBC,EAAW,KAAO,GAAK,EAAI,IAAM,IAAM1B,EAAO,UACvD,CAUO,SAAShB,GAAchC,EAAO6B,EAAW,CAC9C,OAAIA,IAAc,OACT7B,EAAM,cAAc6B,EAAY,CAAC,EAEjC7B,EAAM,eAEjB,CAQO,SAAS+B,GAAQ/B,EAAO6B,EAAW,CACxC,OAAO7B,EAAM,QAAQ6B,CAAS,CAChC,CCrMO,SAASF,GAAO3B,EAAOiB,EAAS,CACrC,IAAI0D,EAASC,GAAQ5E,EAAOiB,CAAO,EACnC,OAAIA,GAAW,OAAOA,GAAY,UAAY,aAAcA,GAAW0D,EAAO,OAAS1D,EAAQ,SACtF0D,EAAO,UAAU,EAAG1D,EAAQ,SAAW,CAAC,EAAI,MAE9C0D,CACT,CACA,SAASC,GAAQ5E,EAAOiB,EAAS,CAC/B,GAAI,OAAOjB,GAAU,SACnB,OAAO6E,GAAa7E,EAAOiB,CAAO,EAEpC,GAAI3D,GAAY0C,CAAK,EACnB,OAAO8E,GAAgB9E,EAAOiB,CAAO,EAKvC,GAAI8D,GAAkB/E,CAAK,EACzB,MAAI,CAACiB,GAAWA,EAAQ,WAAa,UAE5BjB,EAAM,EAAIA,EAAM,EAAI,IAAMA,EAAM,EAGhCA,EAAM,WAGjB,GAAI,MAAM,QAAQA,CAAK,EACrB,OAAOgF,GAAYhF,EAAOiB,CAAO,EAEnC,GAAIvD,GAASsC,CAAK,EAChB,MAAO,IAAMA,EAAQ,IAEvB,GAAI,OAAOA,GAAU,WACnB,OAAOA,EAAM,OAAS,OAAOA,EAAM,MAAM,EAAI,WAE/C,GAAIA,GAAS,OAAOA,GAAU,SAAU,CACtC,GAAI,OAAOA,EAAM,QAAW,WAC1B,OAAOA,EAAM,OAAOiB,CAAO,EACtB,GAAIjB,GAASA,EAAM,SAASiB,CAAO,IAAM,CAAA,EAAG,WAEjD,OAAOjB,EAAM,SAASiB,CAAO,EAE7B,IAAIgE,EAAU,OAAO,KAAKjF,CAAK,EAAE,IAAI9C,GAC5B,IAAMA,EAAM,MAAQyE,GAAO3B,EAAM9C,CAAG,EAAG+D,CAAO,CACtD,EACD,MAAO,IAAMgE,EAAQ,KAAK,IAAI,EAAI,GAErC,CACD,OAAO,OAAOjF,CAAK,CACrB,CAsDA,SAASgF,GAAYE,EAAOjE,EAAS,CACnC,GAAI,MAAM,QAAQiE,CAAK,EAAG,CAGxB,QAFI5B,EAAM,IACN7C,EAAMyE,EAAM,OACPlI,EAAI,EAAGA,EAAIyD,EAAKzD,IACnBA,IAAM,IACRsG,GAAO,MAETA,GAAO0B,GAAYE,EAAMlI,CAAC,EAAGiE,CAAO,EAEtC,OAAAqC,GAAO,IACAA,CACX,KACI,QAAO3B,GAAOuD,EAAOjE,CAAO,CAEhC,CAOA,SAAS8D,GAAkB/E,EAAO,CAChC,OAAOA,GAAS,OAAOA,GAAU,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,EAC5I,CC3KO,SAASmF,EAAeC,EAAQC,EAAUC,EAAU,CACzD,GAAI,EAAE,gBAAgBH,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,OAASC,EACd,KAAK,SAAWC,EAChB,KAAK,SAAWC,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQF,CAAM,EAAI,IAAMA,EAAO,KAAK,IAAI,EAAI,IAAMA,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQC,CAAQ,EAAI,IAAMA,EAAS,KAAK,IAAI,EAAI,IAAMA,GAAY,IAC1N,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACAF,EAAe,UAAY,IAAI,WAC/BA,EAAe,UAAU,YAAc,WACvCA,EAAe,UAAU,KAAO,iBAChCA,EAAe,UAAU,iBAAmB,GCZrC,SAASI,GAAWC,EAAOC,EAAKC,EAAK,CAC1C,GAAI,EAAE,gBAAgBH,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,MAAQC,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAMC,IAEX,KAAK,IAAMA,EACX,KAAK,IAAMC,GAET,KAAK,MAAQ,QAAa,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,IAC/D,KAAK,MAAQ,QAAa,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACAH,GAAW,UAAY,IAAI,WAC3BA,GAAW,UAAU,YAAc,WACnCA,GAAW,UAAU,KAAO,aAC5BA,GAAW,UAAU,aAAe,GCrB7B,SAASI,GAAUtI,EAAG,CAE3B,QADIuI,EAAI,CAAA,EACD,MAAM,QAAQvI,CAAC,GACpBuI,EAAE,KAAKvI,EAAE,MAAM,EACfA,EAAIA,EAAE,CAAC,EAET,OAAOuI,CACT,CAWA,SAASC,GAAUX,EAAO5D,EAAMwE,EAAK,CACnC,IAAI9I,EACAyD,EAAMyE,EAAM,OAChB,GAAIzE,IAAQa,EAAKwE,CAAG,EAClB,MAAM,IAAIX,EAAe1E,EAAKa,EAAKwE,CAAG,CAAC,EAEzC,GAAIA,EAAMxE,EAAK,OAAS,EAAG,CAEzB,IAAIyE,EAAUD,EAAM,EACpB,IAAK9I,EAAI,EAAGA,EAAIyD,EAAKzD,IAAK,CACxB,IAAIgJ,EAAQd,EAAMlI,CAAC,EACnB,GAAI,CAAC,MAAM,QAAQgJ,CAAK,EACtB,MAAM,IAAIb,EAAe7D,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,EAE5DuE,GAAUX,EAAMlI,CAAC,EAAGsE,EAAMyE,CAAO,CAClC,CACL,KAEI,KAAK/I,EAAI,EAAGA,EAAIyD,EAAKzD,IACnB,GAAI,MAAM,QAAQkI,EAAMlI,CAAC,CAAC,EACxB,MAAM,IAAImI,EAAe7D,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,CAIlE,CASO,SAAS2E,GAASf,EAAO5D,EAAM,CACpC,IAAI4E,EAAW5E,EAAK,SAAW,EAC/B,GAAI4E,GAEF,GAAI,MAAM,QAAQhB,CAAK,EACrB,MAAM,IAAIC,EAAeD,EAAM,OAAQ,CAAC,OAI1CW,GAAUX,EAAO5D,EAAM,CAAC,CAE5B,CAQO,SAAS6E,EAAcX,EAAO1B,EAAQ,CAC3C,GAAI,CAAC1G,EAASoI,CAAK,GAAK,CAACtE,GAAUsE,CAAK,EACtC,MAAM,IAAI,UAAU,oCAAsCA,EAAQ,GAAG,EAEvE,GAAIA,EAAQ,GAAK,OAAO1B,GAAW,UAAY0B,GAAS1B,EACtD,MAAM,IAAIyB,GAAWC,EAAO1B,CAAM,CAEtC,CAYO,SAASsC,GAAOlB,EAAO5D,EAAM+E,EAAc,CAIhD,GAAI,CAAC,MAAM,QAAQnB,CAAK,GAAK,CAAC,MAAM,QAAQ5D,CAAI,EAC9C,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,qCAAqC,EAIvDA,EAAK,QAAQ,SAAUtB,EAAO,CAC5B,GAAI,CAAC5C,EAAS4C,CAAK,GAAK,CAACkB,GAAUlB,CAAK,GAAKA,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8D2B,GAAOL,CAAI,EAAI,GAAG,CAE1G,CAAG,EAGD,IAAIgF,EAAgBD,IAAiB,OAAYA,EAAe,EAChE,OAAAE,GAAQrB,EAAO5D,EAAM,EAAGgF,CAAa,EAC9BpB,CACT,CAWA,SAASqB,GAAQrB,EAAO5D,EAAMwE,EAAKO,EAAc,CAC/C,IAAIrJ,EACAwJ,EACAC,EAASvB,EAAM,OACfwB,EAASpF,EAAKwE,CAAG,EACjBa,EAAS,KAAK,IAAIF,EAAQC,CAAM,EAIpC,GADAxB,EAAM,OAASwB,EACXZ,EAAMxE,EAAK,OAAS,EAAG,CAEzB,IAAIyE,EAAUD,EAAM,EAGpB,IAAK9I,EAAI,EAAGA,EAAI2J,EAAQ3J,IAEtBwJ,EAAOtB,EAAMlI,CAAC,EACT,MAAM,QAAQwJ,CAAI,IACrBA,EAAO,CAACA,CAAI,EACZtB,EAAMlI,CAAC,EAAIwJ,GAEbD,GAAQC,EAAMlF,EAAMyE,EAASM,CAAY,EAI3C,IAAKrJ,EAAI2J,EAAQ3J,EAAI0J,EAAQ1J,IAE3BwJ,EAAO,CAAA,EACPtB,EAAMlI,CAAC,EAAIwJ,EAGXD,GAAQC,EAAMlF,EAAMyE,EAASM,CAAY,CAE/C,KAAS,CAIL,IAAKrJ,EAAI,EAAGA,EAAI2J,EAAQ3J,IACtB,KAAO,MAAM,QAAQkI,EAAMlI,CAAC,CAAC,GAC3BkI,EAAMlI,CAAC,EAAIkI,EAAMlI,CAAC,EAAE,CAAC,EAKzB,IAAKA,EAAI2J,EAAQ3J,EAAI0J,EAAQ1J,IAC3BkI,EAAMlI,CAAC,EAAIqJ,CAEd,CACH,CAYO,SAASO,GAAQ1B,EAAO2B,EAAO,CACpC,IAAIC,EAAYC,GAAQ7B,CAAK,EACzB8B,EAAgBF,EAAU,OAC9B,GAAI,CAAC,MAAM,QAAQ5B,CAAK,GAAK,CAAC,MAAM,QAAQ2B,CAAK,EAC/C,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAI1B,EAAe,EAAG6B,EAAe,IAAI,EAEjDH,EAAQI,GAAqBJ,EAAOG,CAAa,EACjD,IAAIE,EAAYC,GAAQN,CAAK,EAC7B,GAAIG,IAAkBE,EACpB,MAAM,IAAI/B,EAAe+B,EAAWF,EAAe,IAAI,EAEzD,GAAI,CACF,OAAOI,GAASN,EAAWD,CAAK,CACjC,OAAQzE,EAAG,CACV,MAAIA,aAAa+C,EACT,IAAIA,EAAe+B,EAAWF,EAAe,IAAI,EAEnD5E,CACP,CACH,CASO,SAAS6E,GAAqBJ,EAAOG,EAAe,CACzD,IAAIE,EAAYC,GAAQN,CAAK,EACzBQ,EAAiBR,EAAM,QACvBS,EAAW,GACXC,EAAgBV,EAAM,QAAQS,CAAQ,EACtCE,EAAwBX,EAAM,QAAQS,EAAUC,EAAgB,CAAC,GAAK,EAC1E,GAAIC,EACF,MAAM,IAAI,MAAM,iCAAiC,EAEnD,IAAIC,EAAcF,GAAiB,EAC/BG,EAAqBV,EAAgBE,IAAc,EACvD,GAAIO,EACF,GAAIC,EACFL,EAAeE,CAAa,EAAI,CAACP,EAAgBE,MAEjD,OAAM,IAAI,MAAM,qCAAuCF,EAAgB,sBAAwB,CAACE,CAAS,EAG7G,OAAOG,CACT,CAOA,SAASF,GAAQjC,EAAO,CACtB,OAAOA,EAAM,OAAO,CAACyC,EAAMC,IAASD,EAAOC,EAAM,CAAC,CACpD,CAUA,SAASR,GAASlC,EAAO2B,EAAO,CAK9B,QAHIgB,EAAW3C,EACX4C,EAEKC,EAAYlB,EAAM,OAAS,EAAGkB,EAAY,EAAGA,IAAa,CACjE,IAAIzG,EAAOuF,EAAMkB,CAAS,EAC1BD,EAAY,CAAA,EAIZ,QADIhE,EAAS+D,EAAS,OAASvG,EACtBtE,EAAI,EAAGA,EAAI8G,EAAQ9G,IAC1B8K,EAAU,KAAKD,EAAS,MAAM7K,EAAIsE,GAAOtE,EAAI,GAAKsE,CAAI,CAAC,EAGzDuG,EAAWC,CACZ,CACD,OAAOD,CACT,CAkEO,SAASG,GAAU9C,EAAO+C,EAAMC,EAAO5G,EAAM,CAClD,IAAIsE,EAAItE,GAAQqE,GAAUT,CAAK,EAG/B,GAAIgD,EACF,QAASlL,EAAI,EAAGA,EAAIkL,EAAOlL,IACzBkI,EAAQ,CAACA,CAAK,EACdU,EAAE,QAAQ,CAAC,EAMf,IADAV,EAAQiD,GAAWjD,EAAO+C,EAAM,CAAC,EAC1BrC,EAAE,OAASqC,GAChBrC,EAAE,KAAK,CAAC,EAEV,OAAOV,CACT,CAUA,SAASiD,GAAWjD,EAAO+C,EAAMnC,EAAK,CACpC,IAAI9I,EAAGoL,EACP,GAAI,MAAM,QAAQlD,CAAK,EAAG,CACxB,IAAImD,EAAOvC,EAAM,EACjB,IAAK9I,EAAI,EAAGoL,EAAKlD,EAAM,OAAQlI,EAAIoL,EAAIpL,IACrCkI,EAAMlI,CAAC,EAAImL,GAAWjD,EAAMlI,CAAC,EAAGiL,EAAMI,CAAI,CAEhD,KACI,SAAS1F,EAAImD,EAAKnD,EAAIsF,EAAMtF,IAC1BuC,EAAQ,CAACA,CAAK,EAGlB,OAAOA,CACT,CAOO,SAAS6B,GAAQ7B,EAAO,CAC7B,GAAI,CAAC,MAAM,QAAQA,CAAK,EAEtB,OAAOA,EAET,IAAIoD,EAAO,CAAA,EACX,OAAApD,EAAM,QAAQ,SAAS/E,EAASH,EAAO,CACjC,MAAM,QAAQA,CAAK,EACrBA,EAAM,QAAQG,CAAQ,EAEtBmI,EAAK,KAAKtI,CAAK,CAErB,CAAG,EACMsI,CACT,CAmHO,SAASC,GAAiBrD,EAAOtF,EAAQ,CAI9C,QAHIG,EACA+D,EAAS,EAEJ9G,EAAI,EAAGA,EAAIkI,EAAM,OAAQlI,IAAK,CACrC,IAAIwL,EAAOtD,EAAMlI,CAAC,EACdW,EAAU,MAAM,QAAQ6K,CAAI,EAQhC,GALIxL,IAAM,GAAKW,IACbmG,EAAS0E,EAAK,QAIZ7K,GAAW6K,EAAK,SAAW1E,EAC7B,OAEF,IAAI2E,EAAW9K,EAAU4K,GAAiBC,EAAM5I,CAAM,EACpDA,EAAO4I,CAAI,EACb,GAAIzI,IAAS,OACXA,EAAO0I,UACE1I,IAAS0I,EAClB,MAAO,OAIV,CACD,OAAO1I,CACT,CC7gBO,SAAS2I,EAAQC,EAAMC,EAAcC,EAAQC,EAAM,CACxD,SAASC,EAAgBC,EAAO,CAI9B,IAAIC,EAAOtI,GAAYqI,EAAOJ,EAAa,IAAIM,EAAqB,CAAC,EACrE,OAAAC,GAAmBR,EAAMC,EAAcI,CAAK,EACrCH,EAAOI,CAAI,CACnB,CACD,OAAAF,EAAgB,UAAY,GAC5BA,EAAgB,GAAKJ,EACrBI,EAAgB,aAAeH,EAAa,MAAO,EAAC,KAAI,EACpDE,IACFC,EAAgB,KAAOD,GAElBC,CACT,CAoEO,SAASI,GAAmBR,EAAMC,EAAcI,EAAO,CAC5D,IAAII,EAAaR,EAAa,OAAOS,GAAc,CAACC,GAAqBD,CAAU,CAAC,EACnF,MAAMA,GAAcL,EAAMK,CAAU,IAAM,MAAS,EACpD,GAAI,CAACD,EAAY,CACf,IAAIG,EAAsBX,EAAa,OAAOS,GAAcL,EAAMK,CAAU,IAAM,MAAS,EAG3F,MAAM,IAAI,MAAM,2BAA4B,OAAOV,EAAM,KAAM,EAAI,kCAAkC,OAAOY,EAAoB,IAAI5G,GAAK,IAAK,OAAOA,EAAG,GAAI,CAAC,EAAE,KAAK,IAAI,EAAG,GAAG,CAAC,CAChL,CACH,CACO,SAAS2G,GAAqBD,EAAY,CAC/C,OAAOA,GAAcA,EAAW,CAAC,IAAM,GACzC,CACO,SAASH,GAAsBG,EAAY,CAChD,OAAOA,GAAcA,EAAW,CAAC,IAAM,IAAMA,EAAW,MAAM,CAAC,EAAIA,CACrE,CCpHA,SAASG,GAAgBtJ,EAAQM,EAAM,CAErC,GAAIiJ,GAAcvJ,CAAM,GAAKwJ,GAAexJ,EAAQM,CAAI,EACtD,OAAON,EAAOM,CAAI,EAEpB,MAAI,OAAON,EAAOM,CAAI,GAAM,YAAcmJ,GAAazJ,EAAQM,CAAI,EAC3D,IAAI,MAAM,yBAA2BA,EAAO,iBAAiB,EAE/D,IAAI,MAAM,0BAA4BA,EAAO,GAAG,CACxD,CAYA,SAASoJ,GAAgB1J,EAAQM,EAAMR,EAAO,CAE5C,GAAIyJ,GAAcvJ,CAAM,GAAKwJ,GAAexJ,EAAQM,CAAI,EACtD,OAAAN,EAAOM,CAAI,EAAIR,EACRA,EAET,MAAM,IAAI,MAAM,0BAA4BQ,EAAO,GAAG,CACxD,CAIA,SAASqJ,GAAgB3J,EAAQM,EAAM,CACrC,OAAOA,KAAQN,CACjB,CAQA,SAASwJ,GAAexJ,EAAQM,EAAM,CACpC,MAAI,CAACN,GAAU,OAAOA,GAAW,SACxB,GAILE,GAAe0J,GAAsBtJ,CAAI,EACpC,GAIL,EAAAA,KAAQ,OAAO,WAQfA,KAAQ,SAAS,UAOvB,CAsBA,SAASmJ,GAAazJ,EAAQ6J,EAAQ,CAOpC,OANI7J,GAAW,MAAgC,OAAOA,EAAO6J,CAAM,GAAM,YAMrE3J,GAAeF,EAAQ6J,CAAM,GAAK,OAAO,gBAAkBA,KAAU,OAAO,eAAe7J,CAAM,EAC5F,GAILE,GAAe4J,GAAmBD,CAAM,EACnC,GAIL,EAAAA,KAAU,OAAO,WAQjBA,KAAU,SAAS,UAOzB,CACA,SAASN,GAAcvJ,EAAQ,CAC7B,OAAO,OAAOA,GAAW,UAAYA,GAAUA,EAAO,cAAgB,MACxE,CACA,IAAI4J,GAAuB,CACzB,OAAQ,GACR,KAAM,EACR,EACIE,GAAoB,CACtB,SAAU,GACV,QAAS,GACT,eAAgB,EAClB,ECrIO,MAAMC,EAAkB,CAC7B,YAAY/J,EAAQ,CAClB,KAAK,cAAgBA,CACtB,CACD,MAAO,CACL,OAAO,OAAO,KAAK,KAAK,aAAa,CACtC,CACD,IAAIhD,EAAK,CACP,OAAOsM,GAAgB,KAAK,cAAetM,CAAG,CAC/C,CACD,IAAIA,EAAK8C,EAAO,CACd,OAAA4J,GAAgB,KAAK,cAAe1M,EAAK8C,CAAK,EACvC,IACR,CACD,IAAI9C,EAAK,CACP,OAAO2M,GAAgB,KAAK,cAAe3M,CAAG,CAC/C,CACH,CAwDO,SAASgN,GAAMhK,EAAQ,CAG5B,OAAKA,EAGEA,aAAkB,KAAOA,aAAkB+J,IAAqB,OAAO/J,EAAO,KAAQ,YAAc,OAAOA,EAAO,KAAQ,YAAc,OAAOA,EAAO,MAAS,YAAc,OAAOA,EAAO,KAAQ,WAFjM,EAGX,CC9CA,IAAIiK,GAAgB,UAAwB,CAG1C,OAAAA,GAAgBC,GAAc,OACvBA,EACT,EACIxB,GAAe,CAAC,aAAc,WAAY,eAAgB,WAAW,EAO9DyB,GAA6B3B,EAAQ,QAASE,GAAc,SAAqB0B,EAAM,CAChG,GAAI,CACF,UAAAC,EACA,QAAAC,EACA,YAAAC,EACA,SAAAC,CACD,EAAGJ,EAIAK,EAAQR,KAKZ,OAAAQ,EAAM,MAAK,EACXA,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAMvN,CACV,EAAK,CACD,KAAM,UACN,KAAMG,EACV,EAAK,CACD,KAAM,YACN,KAAMD,EACV,EAAK,CACD,KAAM,WACN,KAAME,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACP,EAKD,CACE,KAAM,aACN,KAAMmI,GAAKlI,IAAY,+1eAA+1e,KAAKkI,CAAC,CACh4e,EAAK,CACD,KAAM,SACN,KAAMlI,EACV,EAAK,CACD,KAAM,QACN,KAAMiC,EACV,EAAK,CACD,KAAM,QACN,KAAMhC,CACV,EAAK,CACD,KAAM,SACN,KAAMC,EACV,EAAK,CACD,KAAM,cACN,KAAME,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,QACN,KAAMC,EACV,EAAK,CACD,KAAM,QACN,KAAMC,EACV,EAAK,CACD,KAAM,UACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,WACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,SACN,KAAMC,EACV,EAAK,CACD,KAAM,OACN,KAAME,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,iBACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,kBACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAME,EACV,EAAK,CACD,KAAM,yBACN,KAAMD,EACV,EAAK,CACD,KAAM,YACN,KAAME,EACV,EAAK,CACD,KAAM,OACN,KAAMC,EACV,EAAK,CACD,KAAM,aACN,KAAMC,EACV,EAAK,CACD,KAAM,eACN,KAAMC,EACV,EAAK,CACD,KAAM,kBACN,KAAMC,EACV,EAAK,CACD,KAAM,YACN,KAAMC,EACV,EAAK,CACD,KAAM,iBACN,KAAMC,EACV,EAAK,CACD,KAAM,aACN,KAAMC,EACV,EAAK,CACD,KAAM,MACN,KAAMwK,EACV,EAAK,CACD,KAAM,SACN,KAAM1L,EACP,CACH,CAAG,EAEDmM,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiBtN,EAAG,CAM3B,GALKkN,GACHK,GAAiBvN,CAAC,EAIhB8E,GAAO9E,CAAC,EAAI,GACd,MAAM,IAAI,UAAU,uFAA8FA,EAAI,uDAA4D,EAEpL,OAAO,IAAIkN,EAAUlN,CAAC,CACvB,CACL,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAKmN,GACHK,GAAexN,CAAC,EAEX,IAAImN,EAAQnN,EAAG,CAAC,CACxB,CACL,EAAK,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAKmN,GACHK,GAAexN,CAAC,EAEX,IAAImN,EAAQnN,EAAE,SAAU,EAAE,CAAC,CACnC,CACL,EAAK,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAM,IAAI,UAAU,2JAAgK,CACrL,CACL,EAAK,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAKmN,GACHK,GAAexN,CAAC,EAEX,IAAImN,EAAQnN,EAAE,QAAS,EAAE,CAAC,CAClC,CACL,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtBqN,GACHI,GAAgBzN,CAAC,EAEnB,IAAI0N,EAAI,IAAIL,EAASrN,CAAC,EACtB,GAAI0N,EAAE,QAAS,IAAK1N,EAClB,MAAM,IAAI,UAAU,mGAA0GA,EAAI,qDAA0D,EAE9L,OAAO0N,CACR,CACL,EAAK,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB1N,EAAG,CAC3B,IAAI+D,EAAI,OAAO/D,CAAC,EAChB,GAAI,MAAM+D,CAAC,EACT,MAAM,IAAI,MAAM,mBAAqB/D,EAAI,eAAe,EAE1D,OAAO+D,CACR,CACL,EAAK,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB/D,EAAG,CACtBkN,GACHK,GAAiBvN,CAAC,EAEpB,GAAI,CACF,OAAO,IAAIkN,EAAUlN,CAAC,CACvB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,gBAAgB,CAC1D,CACF,CACL,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtBqN,GACHI,GAAgBzN,CAAC,EAEnB,GAAI,CACF,OAAO,IAAIqN,EAASrN,CAAC,CACtB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,eAAe,CACzD,CACF,CACL,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CACtBmN,GACHK,GAAexN,CAAC,EAElB,GAAI,CACF,OAAO,IAAImN,EAAQnN,CAAC,CACrB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,cAAc,CACxD,CACF,CACL,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAO,CAACA,CACT,CACL,EAAK,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAKkN,GACHK,GAAiBvN,CAAC,EAEb,IAAIkN,EAAU,CAAClN,CAAC,CACxB,CACL,EAAK,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAKqN,GACHI,GAAgBzN,CAAC,EAEZ,IAAIqN,EAAS,CAACrN,CAAC,CACvB,CACL,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAO,OAAOA,CAAC,CAChB,CACL,EAAK,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiB6H,EAAO,CAC/B,OAAKuF,GACHO,KAEK,IAAIP,EAAYvF,CAAK,CAC7B,CACL,EAAK,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiB+F,EAAQ,CAChC,OAAOA,EAAO,SACf,CACF,CAAA,CAAC,EAMFN,EAAM,WAAa,CAAChC,EAAMuC,EAAMC,IAAe,CAC7C,IAAIC,EAAaT,EAAM,YAAYhC,EAAMuC,EAAMC,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAASC,EAAW,KAAK,QAAQ,GAAKF,EAAK,SAAW,GAAKrN,GAAaqN,EAAK,CAAC,CAAC,GAE7GC,EAAW,KAAKE,GAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CAAC,EAAG,CACjD,IAAIC,EAAM,IAAI,UAAU,aAAa,OAAO3C,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAA2C,EAAI,KAAOF,EAAW,KAChBE,CACP,CACD,MAAMF,CACV,EAMET,EAAM,WAAa,CAAChC,EAAMuC,EAAMC,IAAe,CAC7C,IAAIC,EAAaT,EAAM,YAAYhC,EAAMuC,EAAMC,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAASC,EAAW,KAAK,QAAQ,GAAKF,EAAK,SAAW,GAAKrN,GAAaqN,EAAK,CAAC,CAAC,GAE7GC,EAAW,KAAKE,GAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CAAC,EAAG,CACjD,IAAIC,EAAM,IAAI,UAAU,aAAa,OAAO3C,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAA2C,EAAI,KAAOF,EAAW,KAChBE,CACP,CACD,MAAMF,CACV,EACST,CACT,CAAC,EACD,SAASC,GAAiBvN,EAAG,CAC3B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,kDAAkD,CAAC,CACvG,CACA,SAASwN,GAAexN,EAAG,CACzB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,qDAAqD,CAAC,CAC1G,CACA,SAAS2N,IAAgB,CACvB,MAAM,IAAI,MAAM,qEAAuE,CACzF,CACA,SAASF,GAAgBzN,EAAG,CAC1B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,iDAAiD,CAAC,CACtG,CCvZA,IAAIsL,GAAO,YACPC,GAAe,CAAC,MAAO,QAAQ,EACxB2C,GAAsC7C,EAAQC,GAAMC,GAAc0B,GAAQ,CACnF,GAAI,CACF,GAAAkB,EACA,OAAAxK,CACD,EAAGsJ,EACAC,EAAYkB,GAAQ,MAAM,CAC5B,UAAWzK,EAAO,UAClB,OAAQyK,GAAQ,MACpB,CAAG,EACD,OAAAlB,EAAU,UAAY,OAAO,OAAOA,EAAU,SAAS,EAKvDA,EAAU,UAAU,KAAO,YAC3BA,EAAU,UAAU,YAAc,GAQlCA,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,MAAO,KAAK,SAAU,CAC5B,CACA,EAQEA,EAAU,SAAW,SAAUmB,EAAM,CACnC,OAAO,IAAInB,EAAUmB,EAAK,KAAK,CACnC,EACMF,GAEFA,EAAG,SAAU,SAAU5D,EAAMD,EAAM,CAC7BC,EAAK,YAAcD,EAAK,WAC1B4C,EAAU,OAAO,CACf,UAAW3C,EAAK,SAC1B,CAAS,CAET,CAAK,EAEI2C,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECpDG5B,GAAO,UACPC,GAAe,CAAA,EACR+C,GAAoCjD,EAAQC,GAAMC,GAAc,KAIzE,OAAO,eAAe4B,EAAS,OAAQ,CACrC,MAAO,SACX,CAAG,EACDA,EAAQ,UAAU,YAAcA,EAChCA,EAAQ,UAAU,KAAO,UACzBA,EAAQ,UAAU,UAAY,GAO9BA,EAAQ,UAAU,OAAS,UAAY,CACrC,MAAO,CACL,OAAQ,UACR,GAAI,KAAK,GACT,GAAI,KAAK,EACf,CACA,EAOEA,EAAQ,UAAU,QAAU,UAAY,CACtC,MAAO,CACL,EAAG,KAAK,IAAK,EACb,IAAK,KAAK,IAAK,CACrB,CACA,EAWEA,EAAQ,UAAU,OAAS,SAAUvJ,EAAS,CAC5C,IAAIqC,EAAM,GACNsI,EAAK,KAAK,GACVC,EAAK,KAAK,GACVC,EAAQnK,GAAO,KAAK,GAAIV,CAAO,EAC/B8K,EAAQpK,GAAO,KAAK,GAAIV,CAAO,EAG/BY,EAAYzE,EAAS6D,CAAO,EAAIA,EAAUA,EAAUA,EAAQ,UAAY,KAC5E,GAAIY,IAAc,KAAM,CACtB,IAAIsC,EAAU,KAAK,IAAI,GAAI,CAACtC,CAAS,EACjC,KAAK,IAAIgK,EAAKD,CAAE,EAAIzH,IACtB0H,EAAK,GAEH,KAAK,IAAID,EAAKC,CAAE,EAAI1H,IACtByH,EAAK,EAER,CACD,OAAIA,IAAO,EAETtI,EAAMwI,EACGD,IAAO,EAEZD,IAAO,EACTtI,EAAM,IACGsI,IAAO,GAChBtI,EAAM,KAENA,EAAMyI,EAAQ,IAIZH,EAAK,EACHA,IAAO,GACTtI,EAAMwI,EAAQ,OAEdxI,EAAMwI,EAAQ,MAAQC,EAAM,UAAU,CAAC,EAAI,IAGzCH,IAAO,EACTtI,EAAMwI,EAAQ,OAEdxI,EAAMwI,EAAQ,MAAQC,EAAQ,IAI7BzI,CACX,EAaEkH,EAAQ,UAAY,SAAUU,EAAM,CAClC,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,CACE,IAAIc,EAAM,UAAU,CAAC,EACrB,GAAI,OAAOA,GAAQ,SACjB,OAAOxB,EAAQwB,CAAG,EAElB,MAAM,IAAI,UAAU,gDAAgD,CAEvE,CACH,IAAK,GACH,CACE,IAAIC,EAAI,UAAU,CAAC,EACfC,EAAM,UAAU,CAAC,EACrB,GAAI9O,EAAS6O,CAAC,EAAG,CAKf,GAJIxO,GAAOyO,CAAG,GAAKA,EAAI,QAAQ,OAAO,IAEpCA,EAAMA,EAAI,SAAS,KAAK,GAEtB9O,EAAS8O,CAAG,EACd,OAAO,IAAI1B,EAAQ,CACjB,EAAAyB,EACA,IAAAC,CAChB,CAAe,EAEH,MAAM,IAAI,UAAU,wCAAwC,CACxE,KACY,OAAM,IAAI,UAAU,2BAA2B,CAElD,CACH,QACE,MAAM,IAAI,YAAY,iDAAiD,CAC1E,CACL,EACE1B,EAAQ,UAAU,QAAUA,EAAQ,UAAU,SAU9CA,EAAQ,SAAW,SAAUkB,EAAM,CACjC,OAAO,IAAIlB,EAAQkB,CAAI,CAC3B,EAiBElB,EAAQ,QAAU,SAAUlK,EAAGC,EAAG,CAChC,OAAID,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAELD,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAEF,CACX,EACSiK,GACN,CACD,QAAS,EACX,CAAC,EC/LG7B,GAAO,WACPC,GAAe,CAAA,EACRuD,GAAqCzD,EAAQC,GAAMC,GAAc,KAI1E,OAAO,eAAe8B,GAAU,OAAQ,CACtC,MAAO,UACX,CAAG,EACDA,GAAS,UAAU,YAAcA,GACjCA,GAAS,UAAU,KAAO,WAC1BA,GAAS,UAAU,WAAa,GAOhCA,GAAS,UAAU,OAAS,UAAY,CACtC,MAAO,CACL,OAAQ,WACR,EAAG,KAAK,EAAI,KAAK,EACjB,EAAG,KAAK,CACd,CACA,EAQEA,GAAS,SAAW,SAAUgB,EAAM,CAClC,OAAO,IAAIhB,GAASgB,CAAI,CAC5B,EACShB,IACN,CACD,QAAS,EACX,CAAC,ECvCG/B,GAAO,SACPC,GAAe,CAAA,EACRwD,GAAmC1D,EAAQC,GAAMC,GAAc,IAAM,CAuB9E,SAASyD,GAAS,CAChB,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,CAE3E,CAKD,OAAAA,EAAO,UAAU,KAAO,SACxBA,EAAO,UAAU,SAAW,GAU5BA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAUEA,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAClE,EAOEA,EAAO,UAAU,OAAS,SAAUC,EAAMC,EAAU,CAClD,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAeEF,EAAO,UAAU,OAAS,SAAU7G,EAAOgH,EAAanG,EAAc,CAEpE,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAOEgG,EAAO,UAAU,IAAM,SAAU7G,EAAO,CAEtC,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAWE6G,EAAO,UAAU,IAAM,SAAU7G,EAAOxF,EAAOqG,EAAc,CAE3D,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAcEgG,EAAO,UAAU,OAAS,SAAU/K,EAAM+E,EAAc,CAEtD,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAWEgG,EAAO,UAAU,QAAU,SAAU/K,EAAM+E,EAAc,CAEvD,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAMEgG,EAAO,UAAU,MAAQ,UAAY,CAEnC,MAAM,IAAI,MAAM,2CAA2C,CAC/D,EAMEA,EAAO,UAAU,KAAO,UAAY,CAElC,MAAM,IAAI,MAAM,0CAA0C,CAC9D,EAYEA,EAAO,UAAU,IAAM,SAAUlM,EAAUsM,EAAW,CAEpD,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAQEJ,EAAO,UAAU,QAAU,SAAUlM,EAAU,CAE7C,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAMEkM,EAAO,UAAU,OAAO,QAAQ,EAAI,UAAY,CAE9C,MAAM,IAAI,MAAM,mCAAmC,CACvD,EAMEA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAMEA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAUEA,EAAO,UAAU,OAAS,SAAUpL,EAAS,CAE3C,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAMEoL,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAClE,EACSA,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECpJM,SAASK,GAAiBC,EAAI,CACnC,OAAO,OAAO,KAAKA,EAAG,YAAc,CAAE,CAAA,EAAE,OAAO,SAAUzB,EAAM0B,EAAW,CACxE,IAAIC,GAASD,EAAU,MAAM,IAAI,GAAK,CAAE,GAAE,OAAS,EACnD,OAAO,KAAK,IAAI1B,EAAM2B,CAAK,CAC/B,EAAK,EAAE,CACP,CC1FA,IAAIlE,GAAO,cACPC,GAAe,CAAC,QAAQ,EACjBkE,GAAwCpE,EAAQC,GAAMC,GAAc0B,GAAQ,CACrF,GAAI,CACF,OAAA+B,CACD,EAAG/B,EAMJ,SAASG,EAAY6B,EAAMC,EAAU,CACnC,GAAI,EAAE,gBAAgB9B,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAI8B,GAAY,CAAC7O,GAAS6O,CAAQ,EAChC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,GAAI3O,GAAS0O,CAAI,EAEXA,EAAK,OAAS,eAEhB,KAAK,MAAQxM,EAAMwM,EAAK,KAAK,EAC7B,KAAK,MAAQxM,EAAMwM,EAAK,KAAK,EAC7B,KAAK,UAAYC,GAAYD,EAAK,YAGlC,KAAK,MAAQA,EAAK,UAClB,KAAK,MAAQA,EAAK,OAClB,KAAK,UAAYC,GAAYD,EAAK,mBAE3BA,GAAQ3O,EAAQ2O,EAAK,IAAI,GAAK3O,EAAQ2O,EAAK,IAAI,EAExD,KAAK,MAAQA,EAAK,KAClB,KAAK,MAAQA,EAAK,KAElBrG,GAAS,KAAK,MAAO,KAAK,KAAK,EAC/B,KAAK,UAAYsG,GAAYD,EAAK,iBACzB3O,EAAQ2O,CAAI,EAErB,KAAK,MAAQS,EAAWT,CAAI,EAE5B,KAAK,MAAQ3G,GAAU,KAAK,KAAK,EAEjCM,GAAS,KAAK,MAAO,KAAK,KAAK,EAE/B,KAAK,UAAYsG,MACZ,IAAID,EAET,MAAM,IAAI,UAAU,6BAA+B1M,GAAO0M,CAAI,EAAI,GAAG,EAGrE,KAAK,MAAQ,GACb,KAAK,MAAQ,CAAC,CAAC,EACf,KAAK,UAAYC,EAEpB,CACD9B,EAAY,UAAY,IAAI4B,EAK5B5B,EAAY,UAAU,kBAAoB,SAAU6B,EAAMC,EAAU,CAClE,OAAO,IAAI9B,EAAY6B,EAAMC,CAAQ,CACzC,EAKE,OAAO,eAAe9B,EAAa,OAAQ,CACzC,MAAO,aACX,CAAG,EACDA,EAAY,UAAU,YAAcA,EACpCA,EAAY,UAAU,KAAO,cAC7BA,EAAY,UAAU,cAAgB,GAWtCA,EAAY,UAAU,YAAc,UAAY,CAC9C,OAAOlC,GAAiB,KAAK,MAAO3I,EAAM,CAC9C,EAWE6K,EAAY,UAAU,QAAU,UAAY,CAC1C,MAAO,OACX,EAWEA,EAAY,UAAU,SAAW,UAAY,CAC3C,OAAO,KAAK,SAChB,EAQEA,EAAY,UAAU,OAAS,SAAU6B,EAAMC,EAAU,CACvD,OAAO,IAAI9B,EAAY6B,EAAMC,CAAQ,CACzC,EAgBE9B,EAAY,UAAU,OAAS,SAAUjF,EAAOgH,EAAanG,EAAc,CACzE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAO2G,EAAK,KAAMxH,CAAK,EAGzB,IAAK,GACL,IAAK,GACH,OAAOyH,EAAK,KAAMzH,EAAOgH,EAAanG,CAAY,EACpD,QACE,MAAM,IAAI,YAAY,2BAA2B,CACpD,CACL,EAQEoE,EAAY,UAAU,IAAM,SAAUjF,EAAO,CAC3C,GAAI,CAAC7H,EAAQ6H,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIL,EAAeK,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,QAASnI,EAAI,EAAGA,EAAImI,EAAM,OAAQnI,IAChC8I,EAAcX,EAAMnI,CAAC,EAAG,KAAK,MAAMA,CAAC,CAAC,EAGvC,QADIiP,EAAO,KAAK,MACPtP,EAAI,EAAGoL,EAAK5C,EAAM,OAAQxI,EAAIoL,EAAIpL,IAAK,CAC9C,IAAIkQ,EAAS1H,EAAMxI,CAAC,EACpBmJ,EAAc+G,EAAQZ,EAAK,MAAM,EACjCA,EAAOA,EAAKY,CAAM,CACnB,CACD,OAAOZ,CACX,EAYE7B,EAAY,UAAU,IAAM,SAAUjF,EAAOxF,EAAOqG,EAAc,CAChE,GAAI,CAAC1I,EAAQ6H,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,OAAS,KAAK,MAAM,OAC5B,MAAM,IAAIL,EAAeK,EAAM,OAAQ,KAAK,MAAM,OAAQ,GAAG,EAE/D,IAAIxI,EAAGoL,EAAI8E,EAGP5L,EAAOkE,EAAM,IAAI,SAAUxI,EAAG,CAChC,OAAOA,EAAI,CACjB,CAAK,EACDmQ,EAAK,KAAM7L,EAAM+E,CAAY,EAG7B,IAAIiG,EAAO,KAAK,MAChB,IAAKtP,EAAI,EAAGoL,EAAK5C,EAAM,OAAS,EAAGxI,EAAIoL,EAAIpL,IACzCkQ,EAAS1H,EAAMxI,CAAC,EAChBmJ,EAAc+G,EAAQZ,EAAK,MAAM,EACjCA,EAAOA,EAAKY,CAAM,EAIpB,OAAAA,EAAS1H,EAAMA,EAAM,OAAS,CAAC,EAC/BW,EAAc+G,EAAQZ,EAAK,MAAM,EACjCA,EAAKY,CAAM,EAAIlN,EACR,IACX,EASE,SAASgN,EAAK/B,EAAQzF,EAAO,CAC3B,GAAI,CAACvH,GAAQuH,CAAK,EAChB,MAAM,IAAI,UAAU,eAAe,EAErC,IAAIU,EAAWV,EAAM,WACrB,GAAIU,EAEF,OAAO+E,EAAO,IAAIzF,EAAM,IAAK,CAAA,EAG7B,IAAIlE,EAAOkE,EAAM,OACjB,GAAIlE,EAAK,SAAW2J,EAAO,MAAM,OAC/B,MAAM,IAAI9F,EAAe7D,EAAK,OAAQ2J,EAAO,MAAM,MAAM,EAM3D,QAFIxF,EAAMD,EAAM,MACZE,EAAMF,EAAM,MACPxI,EAAI,EAAGoL,EAAK6C,EAAO,MAAM,OAAQjO,EAAIoL,EAAIpL,IAChDmJ,EAAcV,EAAIzI,CAAC,EAAGiO,EAAO,MAAMjO,CAAC,CAAC,EACrCmJ,EAAcT,EAAI1I,CAAC,EAAGiO,EAAO,MAAMjO,CAAC,CAAC,EAKvC,OAAO,IAAIyN,EAAY2C,EAAcnC,EAAO,MAAOzF,EAAOlE,EAAK,OAAQ,CAAC,EAAG2J,EAAO,SAAS,CAE9F,CAaD,SAASmC,EAAcd,EAAM9G,EAAOyC,EAAMnC,EAAK,CAC7C,IAAIuH,EAAOvH,IAAQmC,EAAO,EACtBqF,EAAQ9H,EAAM,UAAUM,CAAG,EAC/B,OAAIuH,EACKC,EAAM,IAAI,SAAUtQ,EAAG,CAC5B,OAAAmJ,EAAcnJ,EAAGsP,EAAK,MAAM,EACrBA,EAAKtP,CAAC,CACrB,CAAO,EAAE,QAAO,EAEHsQ,EAAM,IAAI,SAAUtQ,EAAG,CAC5BmJ,EAAcnJ,EAAGsP,EAAK,MAAM,EAC5B,IAAItG,EAAQsG,EAAKtP,CAAC,EAClB,OAAOoQ,EAAcpH,EAAOR,EAAOyC,EAAMnC,EAAM,CAAC,CACxD,CAAO,EAAE,QAAO,CAEb,CAcD,SAASmH,EAAKhC,EAAQzF,EAAO+H,EAAWlH,EAAc,CACpD,GAAI,CAACb,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAIgI,EAAQhI,EAAM,OACdU,EAAWV,EAAM,WAGjBiI,EAOJ,GANI7P,GAAS2P,CAAS,GACpBE,EAAQF,EAAU,OAClBA,EAAYA,EAAU,WAEtBE,EAAQ9H,GAAU4H,CAAS,EAEzBrH,EAAU,CAIZ,GAAIuH,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAEvCxC,EAAO,IAAIzF,EAAM,IAAG,EAAI+H,EAAWlH,CAAY,CACrD,KAAW,CAIL,GAAImH,EAAM,OAASvC,EAAO,MAAM,OAC9B,MAAM,IAAI9F,EAAeqI,EAAM,OAAQvC,EAAO,MAAM,OAAQ,GAAG,EAEjE,GAAIwC,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIxQ,EAAI,EACJkL,EAAQ,EACLsF,EAAMxQ,CAAC,IAAM,GAAKyQ,EAAMzQ,CAAC,IAAM,GACpCA,IAEF,KAAOwQ,EAAMxQ,CAAC,IAAM,GAClBkL,IACAlL,IAIFuQ,EAAYvF,GAAUuF,EAAWC,EAAM,OAAQtF,EAAOuF,CAAK,CAC5D,CAGD,GAAI,CAACpN,GAAgBmN,EAAOC,CAAK,EAC/B,MAAM,IAAItI,EAAeqI,EAAOC,EAAO,GAAG,EAI5C,IAAInM,EAAOkE,EAAM,IAAK,EAAC,IAAI,SAAUxI,EAAG,CACtC,OAAOA,EAAI,CACnB,CAAO,EACDmQ,EAAKlC,EAAQ3J,EAAM+E,CAAY,EAG/B,IAAI4B,EAAOuF,EAAM,OACb1H,EAAM,EACV4H,EAAczC,EAAO,MAAOzF,EAAO+H,EAAWtF,EAAMnC,CAAG,CACxD,CACD,OAAOmF,CACR,CAYD,SAASyC,EAAcpB,EAAM9G,EAAO+H,EAAWtF,EAAMnC,EAAK,CACxD,IAAIuH,EAAOvH,IAAQmC,EAAO,EACtBqF,EAAQ9H,EAAM,UAAUM,CAAG,EAC3BuH,EACFC,EAAM,QAAQ,SAAUK,EAAWC,EAAU,CAC3CzH,EAAcwH,CAAS,EACvBrB,EAAKqB,CAAS,EAAIJ,EAAUK,EAAS,CAAC,CAAC,CAC/C,CAAO,EAEDN,EAAM,QAAQ,SAAUK,EAAWC,EAAU,CAC3CzH,EAAcwH,CAAS,EACvBD,EAAcpB,EAAKqB,CAAS,EAAGnI,EAAO+H,EAAUK,EAAS,CAAC,CAAC,EAAG3F,EAAMnC,EAAM,CAAC,CACnF,CAAO,CAEJ,CAeD2E,EAAY,UAAU,OAAS,SAAUnJ,EAAM+E,EAAcxF,EAAM,CAEjE,GAAI,CAAChD,GAAayD,CAAI,EACpB,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAIuM,EAAYvM,EAAK,QAAO,EAAG,IAAItB,GAC1B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CAChE,EAGG,EAAIa,EAAO,KAAK,MAAK,EAAK,KAE9B,OAAO0F,EAAQ,EAAGsH,EAAWxH,CAAY,CAC7C,EACE,SAASE,EAAQ0E,EAAQ3J,EAAM+E,EAAc,CAE3C,GAAI/E,EAAK,SAAW,EAAG,CAIrB,QAFIwM,EAAI7C,EAAO,MAERtN,EAAQmQ,CAAC,GACdA,EAAIA,EAAE,CAAC,EAET,OAAOA,CACR,CAED,OAAA7C,EAAO,MAAQ3J,EAAK,MAAM,CAAC,EAC3B2J,EAAO,MAAQ7E,GAAO6E,EAAO,MAAOA,EAAO,MAAO5E,CAAY,EAEvD4E,CACR,CAgBDR,EAAY,UAAU,QAAU,SAAUnJ,EAAMT,EAAM,CACpD,IAAIkN,EAAIlN,EAAO,KAAK,MAAK,EAAK,KAC9BkN,EAAE,MAAQnH,GAAQmH,EAAE,MAAOzM,CAAI,EAC/B,IAAI0F,EAAgB+G,EAAE,MAAM,OAAO,CAACjK,EAAQxC,IAASwC,EAASxC,CAAI,EAClE,OAAAyM,EAAE,MAAQ9G,GAAqB3F,EAAM0F,CAAa,EAC3C+G,CACX,EAWE,SAASZ,EAAKlC,EAAQ3J,EAAM+E,EAAc,CAOxC,QAJA2H,EAAU/C,EAAO,MAAM,MAAM,CAAC,EAC1BgD,EAAU,GAGPD,EAAQ,OAAS1M,EAAK,QAC3B0M,EAAQ,KAAK,CAAC,EACdC,EAAU,GAIZ,QAASjR,EAAI,EAAGoL,EAAK9G,EAAK,OAAQtE,EAAIoL,EAAIpL,IACpCsE,EAAKtE,CAAC,EAAIgR,EAAQhR,CAAC,IACrBgR,EAAQhR,CAAC,EAAIsE,EAAKtE,CAAC,EACnBiR,EAAU,IAGVA,GAEF1H,EAAQ0E,EAAQ+C,EAAS3H,CAAY,CAExC,CAODoE,EAAY,UAAU,MAAQ,UAAY,CACxC,IAAIsD,EAAI,IAAItD,EAAY,CACtB,KAAM3K,EAAM,KAAK,KAAK,EACtB,KAAMA,EAAM,KAAK,KAAK,EACtB,SAAU,KAAK,SACrB,CAAK,EACD,OAAOiO,CACX,EAOEtD,EAAY,UAAU,KAAO,UAAY,CACvC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC7B,EAYEA,EAAY,UAAU,IAAM,SAAUtK,EAAU,CAE9C,IAAI+N,EAAK,KACLhD,EAAOwB,GAAiBvM,CAAQ,EAChCgO,EAAU,SAASA,EAAQnO,EAAOwF,EAAO,CAC3C,OAAI7H,EAAQqC,CAAK,EACRA,EAAM,IAAI,SAAUgG,EAAOhJ,EAAG,CACnC,OAAOmR,EAAQnI,EAAOR,EAAM,OAAOxI,CAAC,CAAC,CAC/C,CAAS,EAGGkO,IAAS,EACJ/K,EAASH,CAAK,EACZkL,IAAS,EACX/K,EAASH,EAAOwF,CAAK,EAGrBrF,EAASH,EAAOwF,EAAO0I,CAAE,CAG1C,EAIQ5B,EAAO6B,EAAQ,KAAK,MAAO,CAAE,CAAA,EAC7B5B,EAAW,KAAK,YAAc,OAAYhE,GAAiB+D,EAAM1M,EAAM,EAAI,OAC/E,OAAO,IAAI6K,EAAY6B,EAAMC,CAAQ,CACzC,EASE9B,EAAY,UAAU,QAAU,SAAUtK,EAAU,CAElD,IAAI+N,EAAK,KACLC,EAAU,SAASA,EAAQnO,EAAOwF,EAAO,CACvC7H,EAAQqC,CAAK,EACfA,EAAM,QAAQ,SAAUgG,EAAOhJ,EAAG,CAChCmR,EAAQnI,EAAOR,EAAM,OAAOxI,CAAC,CAAC,CACxC,CAAS,EAEDmD,EAASH,EAAOwF,EAAO0I,CAAE,CAEjC,EACIC,EAAQ,KAAK,MAAO,CAAA,CAAE,CAC1B,EAME1D,EAAY,UAAU,OAAO,QAAQ,EAAI,WAAa,CACpD,IAAI0D,EAAU,SAAUA,EAAQnO,EAAOwF,EAAO,CAC5C,GAAI7H,EAAQqC,CAAK,EACf,QAAShD,EAAI,EAAGA,EAAIgD,EAAM,OAAQhD,IAChC,MAAOmR,EAAQnO,EAAMhD,CAAC,EAAGwI,EAAM,OAAOxI,CAAC,CAAC,OAG1C,KAAM,CACJ,MAAAgD,EACA,MAAAwF,CACV,CAEA,EACI,MAAO2I,EAAQ,KAAK,MAAO,CAAE,CAAA,CACjC,EAME1D,EAAY,UAAU,KAAO,UAAY,CACvC,IAAI9F,EAAS,CAAA,EACTiB,EAAI,KAAK,OACb,GAAIA,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EAElE,IAAI0G,EAAO,KAAK,MAChB,QAAS8B,KAAO9B,EACd3H,EAAO,KAAK,IAAI8F,EAAY,CAAC2D,CAAG,EAAG,KAAK,SAAS,CAAC,EAEpD,OAAOzJ,CACX,EAME8F,EAAY,UAAU,QAAU,UAAY,CAC1C,IAAI4D,EAAQ,KACR1J,EAAS,CAAA,EACTiB,EAAI,KAAK,OACb,GAAIA,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EAOlE,QALI0G,EAAO,KAAK,MACZgC,EAAQ,SAAetR,EAAG,CAC5B,IAAIuR,EAAMjC,EAAK,IAAI8B,GAAO,CAACA,EAAIpR,CAAC,CAAC,CAAC,EAClC2H,EAAO,KAAK,IAAI8F,EAAY8D,EAAKF,EAAM,SAAS,CAAC,CACvD,EACarR,EAAI,EAAGA,EAAI4I,EAAE,CAAC,EAAG5I,IACxBsR,EAAMtR,CAAC,EAET,OAAO2H,CACX,EAOE8F,EAAY,UAAU,QAAU,UAAY,CAC1C,OAAO3K,EAAM,KAAK,KAAK,CAC3B,EAOE2K,EAAY,UAAU,QAAU,UAAY,CAC1C,OAAO,KAAK,KAChB,EAWEA,EAAY,UAAU,OAAS,SAAUxJ,EAAS,CAChD,OAAOU,GAAO,KAAK,MAAOV,CAAO,CACrC,EAOEwJ,EAAY,UAAU,SAAW,UAAY,CAC3C,OAAO9I,GAAO,KAAK,KAAK,CAC5B,EAOE8I,EAAY,UAAU,OAAS,UAAY,CACzC,MAAO,CACL,OAAQ,cACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,SACrB,CACA,EAUEA,EAAY,UAAU,SAAW,SAAU+D,EAAG,CAE5C,GAAIA,GAMF,GAJIlR,GAAYkR,CAAC,IACfA,EAAIA,EAAE,YAGJ,CAACpR,EAASoR,CAAC,GAAK,CAACtN,GAAUsN,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAgBN,QAdIC,EAASD,EAAI,EAAIA,EAAI,EACrBE,EAAOF,EAAI,EAAI,CAACA,EAAI,EAGpBG,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtBxN,EAAI,KAAK,IAAIuN,EAAOD,EAAME,EAAUH,CAAM,EAG1CnC,EAAO,CAAA,EAGFtP,EAAI,EAAGA,EAAIoE,EAAGpE,IACrBsP,EAAKtP,CAAC,EAAI,KAAK,MAAMA,EAAI0R,CAAI,EAAE1R,EAAIyR,CAAM,EAI3C,OAAO,IAAIhE,EAAY,CACrB,KAAA6B,EACA,KAAM,CAAClL,CAAC,EACR,SAAU,KAAK,SACrB,CAAK,CACL,EAcEqJ,EAAY,SAAW,SAAUnJ,EAAMtB,EAAOwO,EAAGnI,EAAc,CAC7D,GAAI,CAAC1I,EAAQ2D,CAAI,EACf,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAUsE,EAAG,CAO3B,GALItI,GAAYsI,CAAC,IAEfA,EAAIA,EAAE,YAGJ,CAACxI,EAASwI,CAAC,GAAK,CAAC1E,GAAU0E,CAAC,GAAKA,EAAI,EACvC,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGG4I,GAMF,GAJIlR,GAAYkR,CAAC,IACfA,EAAIA,EAAE,YAGJ,CAACpR,EAASoR,CAAC,GAAK,CAACtN,GAAUsN,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIC,EAASD,EAAI,EAAIA,EAAI,EACrBE,EAAOF,EAAI,EAAI,CAACA,EAAI,EAGpBG,EAAOrN,EAAK,CAAC,EACbsN,EAAUtN,EAAK,CAAC,EAGhBF,EAAI,KAAK,IAAIuN,EAAOD,EAAME,EAAUH,CAAM,EAG1CI,EAGJ,GAAIlR,EAAQqC,CAAK,EAAG,CAElB,GAAIA,EAAM,SAAWoB,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CyN,EAAS,SAAgB7R,EAAG,CAE1B,OAAOgD,EAAMhD,CAAC,CACtB,CACA,SAAeY,GAASoC,CAAK,EAAG,CAE1B,IAAI8O,EAAK9O,EAAM,OAEf,GAAI8O,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAM1N,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCyN,EAAS,SAAgB7R,EAAG,CAE1B,OAAOgD,EAAM,IAAI,CAAChD,CAAC,CAAC,CAC5B,CACA,MAEM6R,EAAS,UAAkB,CAEzB,OAAO7O,CACf,EAISqG,IAEHA,EAAe/I,GAAYuR,EAAO,CAAC,CAAC,EAAIA,EAAO,CAAC,EAAE,IAAI,CAAC,EACrD,GAIJ,IAAIvC,EAAO,CAAA,EAGX,GAAIhL,EAAK,OAAS,EAAG,CAEnBgL,EAAOlG,GAAOkG,EAAMhL,EAAM+E,CAAY,EAEtC,QAAS1D,EAAI,EAAGA,EAAIvB,EAAGuB,IACrB2J,EAAK3J,EAAI+L,CAAI,EAAE/L,EAAI8L,CAAM,EAAII,EAAOlM,CAAC,CAExC,CAGD,OAAO,IAAI8H,EAAY,CACrB,KAAA6B,EACA,KAAM,CAACqC,EAAMC,CAAO,CAC1B,CAAK,CACL,EAUEnE,EAAY,SAAW,SAAUiB,EAAM,CACrC,OAAO,IAAIjB,EAAYiB,CAAI,CAC/B,EAWEjB,EAAY,UAAU,SAAW,SAAU,EAAGsE,EAAG,CAE/C,GAAI,CAAC3R,EAAS,CAAC,GAAK,CAAC8D,GAAU,CAAC,GAAK,CAAC9D,EAAS2R,CAAC,GAAK,CAAC7N,GAAU6N,CAAC,EAC/D,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,OAAA5I,EAAc,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9BA,EAAc4I,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9BtE,EAAY,UAAU,EAAGsE,EAAG,KAAK,KAAK,EAE/B,IACX,EASEtE,EAAY,UAAY,SAAU,EAAGsE,EAAGzC,EAAM,CAE5C,IAAI0C,EAAK1C,EAAK,CAAC,EACfA,EAAK,CAAC,EAAIA,EAAKyC,CAAC,EAChBzC,EAAKyC,CAAC,EAAIC,CACd,EASE,SAASjC,EAAWT,EAAM,CACxB,QAAStP,EAAI,EAAGoL,EAAKkE,EAAK,OAAQtP,EAAIoL,EAAIpL,IAAK,CAC7C,IAAIwJ,EAAO8F,EAAKtP,CAAC,EACbW,EAAQ6I,CAAI,EACd8F,EAAKtP,CAAC,EAAI+P,EAAWvG,CAAI,EAChBA,GAAQA,EAAK,WAAa,KACnC8F,EAAKtP,CAAC,EAAI+P,EAAWvG,EAAK,QAAS,CAAA,EAEtC,CACD,OAAO8F,CACR,CACD,OAAO7B,CACT,EAAG,CACD,QAAS,EACX,CAAC,ECz3BM,SAASwE,GAAQ/J,EAAO/E,EAAUsM,EAAW,CAClD,OAAIvH,GAAS,OAAOA,EAAM,KAAQ,WAEzBA,EAAM,IAAI,SAAU7H,EAAG,CAC5B,OAAO4R,GAAQ5R,EAAG8C,CAAmB,CAC3C,CAAK,EAEMA,EAAS+E,CAAK,CAEzB,CC5DA,IAAIgK,GAAK,iBAKF,SAASC,GAAU7O,EAAGC,EAAG,CAC9B,OAAOD,EAAIC,CACb,CACA4O,GAAU,UAAYD,GAKf,SAASE,GAAe9O,EAAGC,EAAG,CACnC,OAAOD,EAAIC,CACb,CACA6O,GAAe,UAAYF,GCTpB,SAASjL,GAAY5G,EAAG6G,EAAGC,EAAS,CAEzC,GAAIA,GAAY,KACd,OAAO9G,EAAE,GAAG6G,CAAC,EAIf,GAAI7G,EAAE,GAAG6G,CAAC,EACR,MAAO,GAIT,GAAI7G,EAAE,MAAK,GAAM6G,EAAE,MAAK,EACtB,MAAO,GAIT,GAAI7G,EAAE,SAAQ,GAAM6G,EAAE,SAAQ,EAAI,CAEhC,IAAIE,EAAO/G,EAAE,MAAM6G,CAAC,EAAE,IAAG,EACzB,GAAIE,EAAK,SACP,MAAO,GAGP,IAAIsB,EAAMrI,EAAE,YAAY,IAAIA,EAAE,MAAO6G,EAAE,IAAG,CAAE,EAC5C,OAAOE,EAAK,IAAIsB,EAAI,MAAMvB,CAAO,CAAC,CAErC,CAGD,MAAO,EACT,CC9BO,SAASkL,GAAchS,EAAG6G,EAAGC,EAAS,CAC3C,OAAOF,GAAY5G,EAAE,GAAI6G,EAAE,GAAIC,CAAO,GAAKF,GAAY5G,EAAE,GAAI6G,EAAE,GAAIC,CAAO,CAC5E,CCXO,IAAImL,GAAoC5G,EAAQ,eAAgB,CAAC,OAAO,EAAG4B,GAAQ,CACxF,GAAI,CACF,MAAAK,CACD,EAAGL,EACJ,MAAO,CACL,aAAcK,EAAM,YAAY4E,GAAQ,CAAClS,EAAG6G,IAAM,CAChD,GAAI,CAAC7G,EAAE,UAAU6G,CAAC,EAChB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAOyG,EAAM,KAAK4E,EAAM,CAAClS,EAAE,UAAS,EAAI6G,EAAE,UAAW,CAAA,CAAC,EAAE7G,EAAE,MAAO6G,EAAE,KAAK,CAC9E,CAAK,CACL,CACA,CAAC,ECRGyE,GAAO,cACPC,GAAe,CAAC,QAAS,QAAQ,EAC1B4G,GAAmC9G,EAAQC,GAAMC,GAAc0B,GAAQ,CAChF,GAAI,CACF,MAAAK,EACA,OAAA3J,CACD,EAAGsJ,EACAmF,EAAeH,GAAmB,CACpC,MAAA3E,CACJ,CAAG,EAUD,OAAOA,EAAMhC,GAAM,CACjB,mBAAoB,SAAwBtL,EAAG6G,EAAG,CAChD,OAAO7G,IAAM6G,CACd,EACD,iBAAkB,SAAsB7G,EAAG6G,EAAG,CAC5C,OAAOD,GAAY5G,EAAG6G,EAAGlD,EAAO,OAAO,CACxC,EACD,uBAAwB,SAA4B3D,EAAG6G,EAAG,CACxD,OAAO7G,EAAE,GAAG6G,CAAC,GAAKwL,GAAerS,EAAG6G,EAAGlD,EAAO,OAAO,CACtD,EACD,qBAAsB,SAA0B3D,EAAG6G,EAAG,CACpD,OAAO7G,EAAE,OAAO6G,CAAC,CAClB,EACD,mBAAoB,SAAwB7G,EAAG6G,EAAG,CAChD,OAAOmL,GAAchS,EAAG6G,EAAGlD,EAAO,OAAO,CAC1C,CACF,EAAEyO,CAAY,CACjB,CAAC,EACoC/G,EAAQC,GAAM,CAAC,QAAS,QAAQ,EAAGgH,GAAS,CAC/E,GAAI,CACF,MAAAhF,EACA,OAAA3J,CACD,EAAG2O,EACJ,OAAOhF,EAAMhC,GAAM,CACjB,iBAAkB,SAAsBtL,EAAG6G,EAAG,CAC5C,OAAOD,GAAY5G,EAAG6G,EAAGlD,EAAO,OAAO,CACxC,CACL,CAAG,CACH,CAAC,EC5CD,IAAI2H,GAAO,eACPC,GAAe,CAAC,QAAS,cAAe,QAAQ,EACzCgH,GAAyClH,EAAQC,GAAMC,GAAc0B,GAAQ,CACtF,GAAI,CACF,MAAAK,EACA,YAAAkF,EACA,OAAAxD,CACD,EAAG/B,EAOJ,SAASwF,EAAaxD,EAAMC,EAAU,CACpC,GAAI,EAAE,gBAAgBuD,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAIvD,GAAY,CAAC7O,GAAS6O,CAAQ,EAChC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,GAAI3O,GAAS0O,CAAI,EAEfyD,EAAkB,KAAMzD,EAAMC,CAAQ,UAC7BD,GAAQ3O,EAAQ2O,EAAK,KAAK,GAAK3O,EAAQ2O,EAAK,GAAG,GAAK3O,EAAQ2O,EAAK,IAAI,EAE9E,KAAK,QAAUA,EAAK,OACpB,KAAK,OAASA,EAAK,MACnB,KAAK,KAAOA,EAAK,IACjB,KAAK,MAAQA,EAAK,KAClB,KAAK,UAAYC,GAAYD,EAAK,iBACzB3O,EAAQ2O,CAAI,EAErB0D,EAAiB,KAAM1D,EAAMC,CAAQ,MAChC,IAAID,EAET,MAAM,IAAI,UAAU,6BAA+B1M,GAAO0M,CAAI,EAAI,GAAG,EAGrE,KAAK,QAAU,GACf,KAAK,OAAS,GACd,KAAK,KAAO,CAAC,CAAC,EACd,KAAK,MAAQ,CAAC,EAAG,CAAC,EAClB,KAAK,UAAYC,EAEpB,CACD,SAASwD,EAAkB9E,EAAQhO,EAAQsP,EAAU,CAE/CtP,EAAO,OAAS,gBAElBgO,EAAO,QAAUhO,EAAO,QAAU6C,EAAM7C,EAAO,OAAO,EAAI,OAC1DgO,EAAO,OAASnL,EAAM7C,EAAO,MAAM,EACnCgO,EAAO,KAAOnL,EAAM7C,EAAO,IAAI,EAC/BgO,EAAO,MAAQnL,EAAM7C,EAAO,KAAK,EACjCgO,EAAO,UAAYsB,GAAYtP,EAAO,WAGtC+S,EAAiB/E,EAAQhO,EAAO,QAAS,EAAEsP,GAAYtP,EAAO,SAAS,CAE1E,CACD,SAAS+S,EAAiB/E,EAAQqB,EAAMC,EAAU,CAEhDtB,EAAO,QAAU,GACjBA,EAAO,OAAS,GAChBA,EAAO,KAAO,GACdA,EAAO,UAAYsB,EAEnB,IAAIoC,EAAOrC,EAAK,OACZsC,EAAU,EAGVqB,EAAKJ,EAELK,EAAO,EASX,GARIxS,GAAS6O,CAAQ,IAEnB0D,EAAKtF,EAAM,KAAKkF,EAAa,CAACtD,EAAUA,CAAQ,CAAC,GAAKsD,EAEtDK,EAAOvF,EAAM,QAAQ,EAAG4B,CAAQ,GAI9BoC,EAAO,EAAG,CAEZ,IAAII,EAAI,EACR,EAAG,CAED9D,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErC,QAASjO,EAAI,EAAGA,EAAI2R,EAAM3R,IAAK,CAE7B,IAAIoR,EAAM9B,EAAKtP,CAAC,EAEhB,GAAIW,EAAQyQ,CAAG,GAMb,GAJIW,IAAM,GAAKH,EAAUR,EAAI,SAC3BQ,EAAUR,EAAI,QAGZW,EAAIX,EAAI,OAAQ,CAElB,IAAIN,EAAIM,EAAIW,CAAC,EAERkB,EAAGnC,EAAGoC,CAAI,IAEbjF,EAAO,QAAQ,KAAK6C,CAAC,EAErB7C,EAAO,OAAO,KAAKjO,CAAC,EAEvB,OAGG+R,IAAM,GAAKH,EAAU,IACvBA,EAAU,GAGPqB,EAAG7B,EAAK8B,CAAI,IAEfjF,EAAO,QAAQ,KAAKmD,CAAG,EAEvBnD,EAAO,OAAO,KAAKjO,CAAC,EAGzB,CAED+R,GACR,OAAeA,EAAIH,EACd,CAED3D,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErCA,EAAO,MAAQ,CAAC0D,EAAMC,CAAO,CAC9B,CACDkB,EAAa,UAAY,IAAIzD,EAK7ByD,EAAa,UAAU,mBAAqB,SAAUxD,EAAMC,EAAU,CACpE,OAAO,IAAIuD,EAAaxD,EAAMC,CAAQ,CAC1C,EAKE,OAAO,eAAeuD,EAAc,OAAQ,CAC1C,MAAO,cACX,CAAG,EACDA,EAAa,UAAU,YAAcA,EACrCA,EAAa,UAAU,KAAO,eAC9BA,EAAa,UAAU,eAAiB,GAWxCA,EAAa,UAAU,YAAc,UAAY,CAC/C,OAAOvH,GAAiB,KAAK,QAAS3I,EAAM,CAChD,EAWEkQ,EAAa,UAAU,QAAU,UAAY,CAC3C,MAAO,QACX,EAWEA,EAAa,UAAU,SAAW,UAAY,CAC5C,OAAO,KAAK,SAChB,EAQEA,EAAa,UAAU,OAAS,SAAUxD,EAAMC,EAAU,CACxD,OAAO,IAAIuD,EAAaxD,EAAMC,CAAQ,CAC1C,EAWEuD,EAAa,UAAU,QAAU,UAAY,CAE3C,IAAInB,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAE1B,OAAOD,IAAS,GAAKC,IAAY,EAAI,KAAK,OAAO,QAAUD,EAAOC,GAAW,CACjF,EAgBEkB,EAAa,UAAU,OAAS,SAAUtK,EAAOgH,EAAanG,EAAc,CAE1E,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,+CAA+C,EAIjE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAO8J,EAAW,KAAM3K,CAAK,EAG/B,IAAK,GACL,IAAK,GACH,OAAO4K,EAAW,KAAM5K,EAAOgH,EAAanG,CAAY,EAC1D,QACE,MAAM,IAAI,YAAY,2BAA2B,CACpD,CACL,EACE,SAAS8J,EAAWlF,EAAQoF,EAAK,CAE/B,GAAI,CAACpS,GAAQoS,CAAG,EACd,MAAM,IAAI,UAAU,eAAe,EAErC,IAAInK,EAAWmK,EAAI,WACnB,GAAInK,EAEF,OAAO+E,EAAO,IAAIoF,EAAI,IAAK,CAAA,EAG7B,IAAI/O,EAAO+O,EAAI,OACf,GAAI/O,EAAK,SAAW2J,EAAO,MAAM,OAC/B,MAAM,IAAI9F,EAAe7D,EAAK,OAAQ2J,EAAO,MAAM,MAAM,EAI3D,IAAIjO,EAAGoL,EAAIoG,EAAG8B,EAGV7K,EAAM4K,EAAI,MACV3K,EAAM2K,EAAI,MACd,IAAKrT,EAAI,EAAGoL,EAAK6C,EAAO,MAAM,OAAQjO,EAAIoL,EAAIpL,IAC5CmJ,EAAcV,EAAIzI,CAAC,EAAGiO,EAAO,MAAMjO,CAAC,CAAC,EACrCmJ,EAAcT,EAAI1I,CAAC,EAAGiO,EAAO,MAAMjO,CAAC,CAAC,EAIvC,IAAIuT,EAAUtF,EAAO,QACjBuF,EAASvF,EAAO,OAChBwF,EAAOxF,EAAO,KAGd0D,EAAO0B,EAAI,UAAU,CAAC,EACtBzB,EAAUyB,EAAI,UAAU,CAAC,EAGzBK,EAAI,CAAA,EACJC,EAAK,CAAA,EAGThC,EAAK,QAAQ,SAAU3R,EAAGiP,EAAG,CAE3B0E,EAAG3T,CAAC,EAAIiP,EAAE,CAAC,EAEXyE,EAAE1T,CAAC,EAAI,EACb,CAAK,EAGD,IAAI4T,EAASL,EAAU,CAAE,EAAG,OACxB/K,EAAQ,CAAA,EACRqL,EAAM,CAAA,EAGV,OAAAjC,EAAQ,QAAQ,SAAUG,EAAG,CAI3B,IAFA8B,EAAI,KAAKrL,EAAM,MAAM,EAEhBgJ,EAAIiC,EAAK1B,CAAC,EAAGuB,EAAKG,EAAK1B,EAAI,CAAC,EAAGP,EAAI8B,EAAI9B,IAE1CxR,EAAIwT,EAAOhC,CAAC,EAERkC,EAAE1T,CAAC,IAAM,KAEXwI,EAAM,KAAKmL,EAAG3T,CAAC,CAAC,EAEZ4T,GACFA,EAAO,KAAKL,EAAQ/B,CAAC,CAAC,EAIlC,CAAK,EAEDqC,EAAI,KAAKrL,EAAM,MAAM,EAGd,IAAIsK,EAAa,CACtB,OAAAc,EACA,MAAApL,EACA,IAAAqL,EACA,KAAAvP,EACA,SAAU2J,EAAO,SACvB,CAAK,CACF,CACD,SAASmF,EAAWnF,EAAQzF,EAAO+H,EAAWlH,EAAc,CAE1D,GAAI,CAACb,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAIgI,EAAQhI,EAAM,OACdU,EAAWV,EAAM,WAGjBiI,EAYJ,GAXI7P,GAAS2P,CAAS,GAEpBE,EAAQF,EAAU,OAElBA,EAAYA,EAAU,WAGtBE,EAAQ9H,GAAU4H,CAAS,EAIzBrH,EAAU,CAEZ,GAAIuH,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAGvCxC,EAAO,IAAIzF,EAAM,IAAG,EAAI+H,EAAWlH,CAAY,CACrD,KAAW,CAEL,GAAImH,EAAM,SAAW,GAAKA,EAAM,SAAW,EACzC,MAAM,IAAIrI,EAAeqI,EAAM,OAAQvC,EAAO,MAAM,OAAQ,GAAG,EAIjE,GAAIwC,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIxQ,EAAI,EACJkL,EAAQ,EACLsF,EAAMxQ,CAAC,IAAM,GAAKyQ,EAAMzQ,CAAC,IAAM,GACpCA,IAEF,KAAOwQ,EAAMxQ,CAAC,IAAM,GAClBkL,IACAlL,IAGFuQ,EAAYvF,GAAUuF,EAAWC,EAAM,OAAQtF,EAAOuF,CAAK,CAC5D,CAGD,GAAI,CAACpN,GAAgBmN,EAAOC,CAAK,EAC/B,MAAM,IAAItI,EAAeqI,EAAOC,EAAO,GAAG,EAI5C,GAAID,EAAM,SAAW,EAAG,CAEtB,IAAIF,EAAQ9H,EAAM,UAAU,CAAC,EAC7B8H,EAAM,QAAQ,SAAUK,EAAWC,EAAU,CAC3CzH,EAAcwH,CAAS,EACvB1C,EAAO,IAAI,CAAC0C,EAAW,CAAC,EAAGJ,EAAUK,EAAS,CAAC,CAAC,EAAGvH,CAAY,CACzE,CAAS,CACT,KAAa,CAEL,IAAIyK,EAAsBtL,EAAM,UAAU,CAAC,EACvCuL,EAAuBvL,EAAM,UAAU,CAAC,EAC5CsL,EAAoB,QAAQ,SAAUE,EAAgBC,EAAe,CACnE9K,EAAc6K,CAAc,EAC5BD,EAAqB,QAAQ,SAAUG,EAAiBC,EAAgB,CACtEhL,EAAc+K,CAAe,EAC7BjG,EAAO,IAAI,CAAC+F,EAAgBE,CAAe,EAAG3D,EAAU0D,EAAc,CAAC,CAAC,EAAEE,EAAe,CAAC,CAAC,EAAG9K,CAAY,CACtH,CAAW,CACX,CAAS,CACF,CACF,CACD,OAAO4E,CACR,CAQD6E,EAAa,UAAU,IAAM,SAAUtK,EAAO,CAC5C,GAAI,CAAC7H,EAAQ6H,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIL,EAAeK,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIxI,EAAIwI,EAAM,CAAC,EACXuJ,EAAIvJ,EAAM,CAAC,EAGfW,EAAcnJ,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9BmJ,EAAc4I,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9B,IAAIP,EAAI4C,EAAepU,EAAG,KAAK,KAAK+R,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIP,EAAI,KAAK,KAAKO,EAAI,CAAC,GAAK,KAAK,OAAOP,CAAC,IAAMxR,EACtC,KAAK,QAAQwR,CAAC,EAEhB,CACX,EAYEsB,EAAa,UAAU,IAAM,SAAUtK,EAAOsI,EAAGzH,EAAc,CAC7D,GAAI,CAAC1I,EAAQ6H,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIL,EAAeK,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIxI,EAAIwI,EAAM,CAAC,EACXuJ,EAAIvJ,EAAM,CAAC,EAGXmJ,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtBqB,EAAKJ,EAELK,EAAO,EACPxS,GAAS,KAAK,SAAS,IAEzBuS,EAAKtF,EAAM,KAAKkF,EAAa,CAAC,KAAK,UAAW,KAAK,SAAS,CAAC,GAAKA,EAElEK,EAAOvF,EAAM,QAAQ,EAAG,KAAK,SAAS,IAIpC3N,EAAI2R,EAAO,GAAKI,EAAIH,EAAU,KAEhCrI,EAAQ,KAAM,KAAK,IAAIvJ,EAAI,EAAG2R,CAAI,EAAG,KAAK,IAAII,EAAI,EAAGH,CAAO,EAAGvI,CAAY,EAE3EsI,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,GAIxBzI,EAAcnJ,EAAG2R,CAAI,EACrBxI,EAAc4I,EAAGH,CAAO,EAGxB,IAAIJ,EAAI4C,EAAepU,EAAG,KAAK,KAAK+R,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIP,EAAI,KAAK,KAAKO,EAAI,CAAC,GAAK,KAAK,OAAOP,CAAC,IAAMxR,EAExCiT,EAAGnC,EAAGoC,CAAI,EAKbmB,EAAQ7C,EAAGO,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAHlD,KAAK,QAAQP,CAAC,EAAIV,EAMfmC,EAAGnC,EAAGoC,CAAI,GAEboB,EAAQ9C,EAAGxR,EAAG+R,EAAGjB,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAGrD,IACX,EACE,SAASsD,EAAepU,EAAGuU,EAAKC,EAAQhM,EAAO,CAE7C,GAAIgM,EAASD,IAAQ,EACnB,OAAOC,EAGT,QAASvF,EAAIsF,EAAKtF,EAAIuF,EAAQvF,IAE5B,GAAIzG,EAAMyG,CAAC,IAAMjP,EACf,OAAOiP,EAIX,OAAOsF,CACR,CACD,SAASF,EAAQ7C,EAAGO,EAAG6B,EAAQpL,EAAOqL,EAAK,CAEzCD,EAAO,OAAOpC,EAAG,CAAC,EAClBhJ,EAAM,OAAOgJ,EAAG,CAAC,EAEjB,QAASnR,EAAI0R,EAAI,EAAG1R,EAAIwT,EAAI,OAAQxT,IAClCwT,EAAIxT,CAAC,GAER,CACD,SAASiU,EAAQ9C,EAAGxR,EAAG+R,EAAGjB,EAAG8C,EAAQpL,EAAOqL,EAAK,CAE/CD,EAAO,OAAOpC,EAAG,EAAGV,CAAC,EAErBtI,EAAM,OAAOgJ,EAAG,EAAGxR,CAAC,EAEpB,QAASK,EAAI0R,EAAI,EAAG1R,EAAIwT,EAAI,OAAQxT,IAClCwT,EAAIxT,CAAC,GAER,CAiBDyS,EAAa,UAAU,OAAS,SAAUxO,EAAM+E,EAAcxF,EAAM,CAElE,GAAI,CAAChD,GAAayD,CAAI,EACpB,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAIuM,EAAYvM,EAAK,QAAO,EAAG,IAAItB,GAC1B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CAChE,EACD,GAAI6N,EAAU,SAAW,EACvB,MAAM,IAAI,MAAM,0CAA0C,EAI5DA,EAAU,QAAQ,SAAU7N,EAAO,CACjC,GAAI,CAAC5C,EAAS4C,CAAK,GAAK,CAACkB,GAAUlB,CAAK,GAAKA,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8D2B,GAAOkM,CAAS,EAAI,GAAG,CAEjH,CAAK,EAGD,IAAIE,EAAIlN,EAAO,KAAK,MAAK,EAAK,KAE9B,OAAO0F,EAAQwH,EAAGF,EAAU,CAAC,EAAGA,EAAU,CAAC,EAAGxH,CAAY,CAC9D,EACE,SAASE,EAAQ0E,EAAQ0D,EAAMC,EAASvI,EAAc,CAEpD,IAAIrG,EAAQqG,GAAgB,EAGxB4J,EAAKJ,EAELK,EAAO,EACPxS,GAASuN,EAAO,SAAS,IAE3BgF,EAAKtF,EAAM,KAAKkF,EAAa,CAAC5E,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAK4E,EAEtEK,EAAOvF,EAAM,QAAQ,EAAGM,EAAO,SAAS,EAExCjL,EAAQ2K,EAAM,QAAQ3K,EAAOiL,EAAO,SAAS,GAI/C,IAAIwG,EAAM,CAACxB,EAAGjQ,EAAOkQ,CAAI,EAGrBjE,EAAIhB,EAAO,MAAM,CAAC,EAClBlI,EAAIkI,EAAO,MAAM,CAAC,EAClBjO,EAAG+R,EAAGP,EAGV,GAAII,EAAU7L,EAAG,CAEf,IAAKgM,EAAIhM,EAAGgM,EAAIH,EAASG,IAIvB,GAFA9D,EAAO,KAAK8D,CAAC,EAAI9D,EAAO,QAAQ,OAE5BwG,EAEF,IAAKzU,EAAI,EAAGA,EAAIiP,EAAGjP,IAEjBiO,EAAO,QAAQ,KAAKjL,CAAK,EAEzBiL,EAAO,OAAO,KAAKjO,CAAC,EAK1BiO,EAAO,KAAK2D,CAAO,EAAI3D,EAAO,QAAQ,MAC5C,MAAe2D,EAAU7L,IAEnBkI,EAAO,KAAK,OAAO2D,EAAU,EAAG7L,EAAI6L,CAAO,EAE3C3D,EAAO,QAAQ,OAAOA,EAAO,KAAK2D,CAAO,EAAG3D,EAAO,QAAQ,MAAM,EACjEA,EAAO,OAAO,OAAOA,EAAO,KAAK2D,CAAO,EAAG3D,EAAO,OAAO,MAAM,GAMjE,GAHAlI,EAAI6L,EAGAD,EAAO1C,GAET,GAAIwF,EAAK,CAEP,IAAIrQ,EAAI,EAER,IAAK2N,EAAI,EAAGA,EAAIhM,EAAGgM,IAAK,CAEtB9D,EAAO,KAAK8D,CAAC,EAAI9D,EAAO,KAAK8D,CAAC,EAAI3N,EAElCoN,EAAIvD,EAAO,KAAK8D,EAAI,CAAC,EAAI3N,EAEzB,IAAIoC,EAAI,EAER,IAAKxG,EAAIiP,EAAGjP,EAAI2R,EAAM3R,IAAKwG,IAEzByH,EAAO,QAAQ,OAAOuD,EAAIhL,EAAG,EAAGxD,CAAK,EAErCiL,EAAO,OAAO,OAAOuD,EAAIhL,EAAG,EAAGxG,CAAC,EAEhCoE,GAEH,CAED6J,EAAO,KAAKlI,CAAC,EAAIkI,EAAO,QAAQ,MACjC,UACQ0D,EAAO1C,EAAG,CAEnB,IAAItJ,EAAI,EAER,IAAKoM,EAAI,EAAGA,EAAIhM,EAAGgM,IAAK,CAEtB9D,EAAO,KAAK8D,CAAC,EAAI9D,EAAO,KAAK8D,CAAC,EAAIpM,EAElC,IAAI+O,EAAKzG,EAAO,KAAK8D,CAAC,EAClB4C,EAAK1G,EAAO,KAAK8D,EAAI,CAAC,EAAIpM,EAE9B,IAAK6L,EAAIkD,EAAIlD,EAAImD,EAAInD,IAEnBxR,EAAIiO,EAAO,OAAOuD,CAAC,EAEfxR,EAAI2R,EAAO,IAEb1D,EAAO,QAAQ,OAAOuD,EAAG,CAAC,EAE1BvD,EAAO,OAAO,OAAOuD,EAAG,CAAC,EAEzB7L,IAGL,CAEDsI,EAAO,KAAK8D,CAAC,EAAI9D,EAAO,QAAQ,MACjC,CAED,OAAAA,EAAO,MAAM,CAAC,EAAI0D,EAClB1D,EAAO,MAAM,CAAC,EAAI2D,EAEX3D,CACR,CAkBD6E,EAAa,UAAU,QAAU,SAAUjJ,EAAOhG,EAAM,CAEtD,GAAI,CAAClD,EAAQkJ,CAAK,EAChB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAI,MAAM,wDAAwD,EAI1EA,EAAM,QAAQ,SAAU7G,EAAO,CAC7B,GAAI,CAAC5C,EAAS4C,CAAK,GAAK,CAACkB,GAAUlB,CAAK,GAAKA,GAAS,IAAMA,IAAU,EACpE,MAAM,IAAI,UAAU,6DAAoE2B,GAAOkF,CAAK,EAAI,GAAG,CAEnH,CAAK,EACD,IAAIG,EAAgB,KAAK,MAAM,CAAC,EAAI,KAAK,MAAM,CAAC,EAChDH,EAAQI,GAAqBJ,EAAOG,CAAa,EACjD,IAAIE,EAAYL,EAAM,CAAC,EAAIA,EAAM,CAAC,EAGlC,GAAIG,IAAkBE,EACpB,MAAM,IAAI,MAAM,qEAAqE,EAIvF,IAAI6G,EAAIlN,EAAO,KAAK,MAAK,EAAK,KAG9B,GAAI,KAAK,MAAM,CAAC,IAAMgG,EAAM,CAAC,GAAK,KAAK,MAAM,CAAC,IAAMA,EAAM,CAAC,EACzD,OAAOkH,EAKT,QADI6D,EAAW,CAAA,EACN5U,EAAI,EAAGA,EAAI+Q,EAAE,KAAK,OAAQ/Q,IACjC,QAAS+R,EAAI,EAAGA,EAAIhB,EAAE,KAAK/Q,EAAI,CAAC,EAAI+Q,EAAE,KAAK/Q,CAAC,EAAG+R,IAC7C6C,EAAS,KAAK5U,CAAC,EAWnB,QANI4T,EAAS7C,EAAE,QAAQ,MAAK,EAGxB8D,EAAW9D,EAAE,OAAO,MAAK,EAGpB+D,EAAK,EAAGA,EAAK/D,EAAE,OAAO,OAAQ+D,IAAM,CAC3C,IAAIC,EAAKF,EAASC,CAAE,EAChBE,EAAKJ,EAASE,CAAE,EAChBxJ,EAAOyJ,EAAKhE,EAAE,MAAM,CAAC,EAAIiE,EAC7BJ,EAASE,CAAE,EAAIxJ,EAAOzB,EAAM,CAAC,EAC7BgL,EAASC,CAAE,EAAI,KAAK,MAAMxJ,EAAOzB,EAAM,CAAC,CAAC,CAC1C,CASDkH,EAAE,QAAQ,OAAS,EACnBA,EAAE,OAAO,OAAS,EAClBA,EAAE,KAAK,OAASlH,EAAM,CAAC,EAAI,EAC3BkH,EAAE,MAAQlH,EAAM,QAChB,QAASoL,EAAM,EAAGA,EAAMlE,EAAE,KAAK,OAAQkE,IACrClE,EAAE,KAAKkE,CAAG,EAAI,EAKhB,QAASC,EAAI,EAAGA,EAAItB,EAAO,OAAQsB,IAAK,CACtC,IAAIC,EAAMN,EAASK,CAAC,EAChBE,EAAKR,EAASM,CAAC,EACfpE,EAAI8C,EAAOsB,CAAC,EACZ1D,EAAI4C,EAAee,EAAKpE,EAAE,KAAKqE,CAAE,EAAGrE,EAAE,KAAKqE,EAAK,CAAC,EAAGrE,EAAE,MAAM,EAChEuD,EAAQ9C,EAAG2D,EAAKC,EAAItE,EAAGC,EAAE,QAASA,EAAE,OAAQA,EAAE,IAAI,CACnD,CAID,OAAOA,CACX,EAOE+B,EAAa,UAAU,MAAQ,UAAY,CACzC,IAAI/B,EAAI,IAAI+B,EAAa,CACvB,OAAQ,KAAK,QAAUhQ,EAAM,KAAK,OAAO,EAAI,OAC7C,MAAOA,EAAM,KAAK,MAAM,EACxB,IAAKA,EAAM,KAAK,IAAI,EACpB,KAAMA,EAAM,KAAK,KAAK,EACtB,SAAU,KAAK,SACrB,CAAK,EACD,OAAOiO,CACX,EAOE+B,EAAa,UAAU,KAAO,UAAY,CACxC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC7B,EAaEA,EAAa,UAAU,IAAM,SAAU3P,EAAUsM,EAAW,CAE1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAG9D,IAAIyB,EAAK,KAELS,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtB1D,EAAOwB,GAAiBvM,CAAQ,EAChCkS,EAAS,SAAgBvE,EAAG9Q,EAAG+R,EAAG,CAEpC,OAAI7D,IAAS,EAAU/K,EAAS2N,CAAC,EAC7B5C,IAAS,EAAU/K,EAAS2N,EAAG,CAAC9Q,EAAG+R,CAAC,CAAC,EAClC5O,EAAS2N,EAAG,CAAC9Q,EAAG+R,CAAC,EAAGb,CAAE,CACnC,EAEI,OAAOoE,EAAK,KAAM,EAAG3D,EAAO,EAAG,EAAGC,EAAU,EAAGyD,EAAQ5F,CAAS,CACpE,EAME,SAAS6F,EAAKrH,EAAQsH,EAAQC,EAAQC,EAAWC,EAAWvS,EAAUsM,EAAW,CAE/E,IAAImE,EAAS,CAAA,EACTpL,EAAQ,CAAA,EACRqL,EAAM,CAAA,EAGNZ,EAAKJ,EAELK,EAAO,EACPxS,GAASuN,EAAO,SAAS,IAE3BgF,EAAKtF,EAAM,KAAKkF,EAAa,CAAC5E,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAK4E,EAEtEK,EAAOvF,EAAM,QAAQ,EAAGM,EAAO,SAAS,GAgB1C,QAZIoH,EAAS,SAAgBvE,EAAGzQ,EAAG6G,EAAG,CAEpC4J,EAAI3N,EAAS2N,EAAGzQ,EAAG6G,CAAC,EAEf+L,EAAGnC,EAAGoC,CAAI,IAEbU,EAAO,KAAK9C,CAAC,EAEbtI,EAAM,KAAKnI,CAAC,EAEpB,EAEa0R,EAAI0D,EAAW1D,GAAK2D,EAAW3D,IAAK,CAE3C8B,EAAI,KAAKD,EAAO,MAAM,EAEtB,IAAIc,EAAKzG,EAAO,KAAK8D,CAAC,EAClB4C,EAAK1G,EAAO,KAAK8D,EAAI,CAAC,EAC1B,GAAItC,EAEF,QAAS+B,EAAIkD,EAAIlD,EAAImD,EAAInD,IAAK,CAE5B,IAAIxR,EAAIiO,EAAO,OAAOuD,CAAC,EAEnBxR,GAAKuV,GAAUvV,GAAKwV,GAEtBH,EAAOpH,EAAO,QAAQuD,CAAC,EAAGxR,EAAIuV,EAAQxD,EAAI0D,CAAS,CAEtD,KACI,CAGL,QADIE,EAAU,CAAA,EACLC,EAAKlB,EAAIkB,EAAKjB,EAAIiB,IAAM,CAC/B,IAAIC,EAAM5H,EAAO,OAAO2H,CAAE,EAC1BD,EAAQE,CAAG,EAAI5H,EAAO,QAAQ2H,CAAE,CACjC,CAID,QAASE,EAAMP,EAAQO,GAAON,EAAQM,IAAO,CAC3C,IAAI9S,EAAQ8S,KAAOH,EAAUA,EAAQG,CAAG,EAAI,EAC5CT,EAAOrS,EAAO8S,EAAMP,EAAQxD,EAAI0D,CAAS,CAC1C,CACF,CACF,CAGD,OAAA5B,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAId,EAAa,CACtB,OAAAc,EACA,MAAApL,EACA,IAAAqL,EACA,KAAM,CAAC2B,EAASD,EAAS,EAAGG,EAAYD,EAAY,CAAC,CAC3D,CAAK,CACF,CAYD3C,EAAa,UAAU,QAAU,SAAU3P,EAAUsM,EAAW,CAE9D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,gDAAgD,EAQlE,QALIyB,EAAK,KAELS,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEjBG,EAAI,EAAGA,EAAIH,EAASG,IAAK,CAEhC,IAAI2C,EAAK,KAAK,KAAK3C,CAAC,EAChB4C,EAAK,KAAK,KAAK5C,EAAI,CAAC,EACxB,GAAItC,EAEF,QAAS+B,EAAIkD,EAAIlD,EAAImD,EAAInD,IAAK,CAE5B,IAAIxR,EAAI,KAAK,OAAOwR,CAAC,EAGrBrO,EAAS,KAAK,QAAQqO,CAAC,EAAG,CAACxR,EAAG+R,CAAC,EAAGb,CAAE,CACrC,KACI,CAGL,QADI0C,EAAS,CAAA,EACJmC,EAAMrB,EAAIqB,EAAMpB,EAAIoB,IAAO,CAClC,IAAIC,EAAM,KAAK,OAAOD,CAAG,EACzBnC,EAAOoC,CAAG,EAAI,KAAK,QAAQD,CAAG,CAC/B,CAID,QAASE,EAAM,EAAGA,EAAMtE,EAAMsE,IAAO,CACnC,IAAIjT,EAAQiT,KAAOrC,EAASA,EAAOqC,CAAG,EAAI,EAC1C9S,EAASH,EAAO,CAACiT,EAAKlE,CAAC,EAAGb,CAAE,CAC7B,CACF,CACF,CACL,EAME4B,EAAa,UAAU,OAAO,QAAQ,EAAI,WAAa,CACrD,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,sCAAsC,EAGxD,QADIlB,EAAU,KAAK,MAAM,CAAC,EACjBG,EAAI,EAAGA,EAAIH,EAASG,IAG3B,QAFI2C,EAAK,KAAK,KAAK3C,CAAC,EAChB4C,EAAK,KAAK,KAAK5C,EAAI,CAAC,EACfP,EAAIkD,EAAIlD,EAAImD,EAAInD,IAAK,CAE5B,IAAIxR,EAAI,KAAK,OAAOwR,CAAC,EACrB,KAAM,CACJ,MAAO,KAAK,QAAQA,CAAC,EACrB,MAAO,CAACxR,EAAG+R,CAAC,CACtB,CACO,CAEP,EAOEe,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAOoD,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAI,CAC1E,EAOEpD,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAOoD,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAK,CAC3E,EACE,SAASA,EAAStC,EAAQpL,EAAOqL,EAAKvP,EAAMT,EAAM,CAEhD,IAAI8N,EAAOrN,EAAK,CAAC,EACbsN,EAAUtN,EAAK,CAAC,EAEhBhB,EAAI,CAAA,EAEJtD,EAAG+R,EAEP,IAAK/R,EAAI,EAAGA,EAAI2R,EAAM3R,IAEpB,IADAsD,EAAEtD,CAAC,EAAI,GACF+R,EAAI,EAAGA,EAAIH,EAASG,IACvBzO,EAAEtD,CAAC,EAAE+R,CAAC,EAAI,EAKd,IAAKA,EAAI,EAAGA,EAAIH,EAASG,IAKvB,QAHI2C,EAAKb,EAAI9B,CAAC,EACV4C,EAAKd,EAAI9B,EAAI,CAAC,EAETP,EAAIkD,EAAIlD,EAAImD,EAAInD,IAEvBxR,EAAIwI,EAAMgJ,CAAC,EAEXlO,EAAEtD,CAAC,EAAE+R,CAAC,EAAI6B,EAAS/P,EAAOf,EAAM8Q,EAAOpC,CAAC,CAAC,EAAIoC,EAAOpC,CAAC,EAAI,EAG7D,OAAOlO,CACR,CAWD,OAAAwP,EAAa,UAAU,OAAS,SAAU7O,EAAS,CASjD,QAPI0N,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtBuE,EAAU,KAAK,UAEf7P,EAAM,kBAAoB3B,GAAOgN,EAAM1N,CAAO,EAAI,MAAQU,GAAOiN,EAAS3N,CAAO,EAAI,cAAgBU,GAAOwR,EAASlS,CAAO,EAAI;AAAA,EAE3H8N,EAAI,EAAGA,EAAIH,EAASG,IAK3B,QAHI2C,EAAK,KAAK,KAAK3C,CAAC,EAChB4C,EAAK,KAAK,KAAK5C,EAAI,CAAC,EAEfP,EAAIkD,EAAIlD,EAAImD,EAAInD,IAAK,CAE5B,IAAIxR,EAAI,KAAK,OAAOwR,CAAC,EAErBlL,GAAO;AAAA,OAAY3B,GAAO3E,EAAGiE,CAAO,EAAI,KAAOU,GAAOoN,EAAG9N,CAAO,EAAI,UAAY,KAAK,QAAUU,GAAO,KAAK,QAAQ6M,CAAC,EAAGvN,CAAO,EAAI,IACnI,CAEH,OAAOqC,CACX,EAOEwM,EAAa,UAAU,SAAW,UAAY,CAC5C,OAAOnO,GAAO,KAAK,QAAO,CAAE,CAChC,EAOEmO,EAAa,UAAU,OAAS,UAAY,CAC1C,MAAO,CACL,OAAQ,eACR,OAAQ,KAAK,QACb,MAAO,KAAK,OACZ,IAAK,KAAK,KACV,KAAM,KAAK,MACX,SAAU,KAAK,SACrB,CACA,EAUEA,EAAa,UAAU,SAAW,SAAUtB,EAAG,CAE7C,GAAIA,GAMF,GAJIlR,GAAYkR,CAAC,IACfA,EAAIA,EAAE,YAGJ,CAACpR,EAASoR,CAAC,GAAK,CAACtN,GAAUsN,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIC,EAASD,EAAI,EAAIA,EAAI,EACrBE,EAAOF,EAAI,EAAI,CAACA,EAAI,EAGpBG,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtBxN,EAAI,KAAK,IAAIuN,EAAOD,EAAME,EAAUH,CAAM,EAG1CmC,EAAS,CAAA,EACTpL,EAAQ,CAAA,EACRqL,EAAM,CAAA,EAEVA,EAAI,CAAC,EAAI,EAET,QAAS9B,EAAIN,EAAQM,EAAIH,GAAWgC,EAAO,OAASxP,EAAG2N,IAKrD,QAHI2C,EAAK,KAAK,KAAK3C,CAAC,EAChB4C,EAAK,KAAK,KAAK5C,EAAI,CAAC,EAEf1R,EAAIqU,EAAIrU,EAAIsU,EAAItU,IAAK,CAE5B,IAAIL,EAAI,KAAK,OAAOK,CAAC,EAErB,GAAIL,IAAM+R,EAAIN,EAASC,EAAM,CAE3BkC,EAAO,KAAK,KAAK,QAAQvT,CAAC,CAAC,EAE3BmI,EAAMoL,EAAO,OAAS,CAAC,EAAI5T,EAAI0R,EAE/B,KACD,CACF,CAGH,OAAAmC,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAId,EAAa,CACtB,OAAAc,EACA,MAAApL,EACA,IAAAqL,EACA,KAAM,CAACzP,EAAG,CAAC,CACjB,CAAK,CACL,EAUE0O,EAAa,SAAW,SAAUpE,EAAM,CACtC,OAAO,IAAIoE,EAAapE,CAAI,CAChC,EAcEoE,EAAa,SAAW,SAAUxO,EAAMtB,EAAOwO,EAAGnI,EAAckG,EAAU,CACxE,GAAI,CAAC5O,EAAQ2D,CAAI,EACf,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAUsE,EAAG,CAO3B,GALItI,GAAYsI,CAAC,IAEfA,EAAIA,EAAE,YAGJ,CAACxI,EAASwI,CAAC,GAAK,CAAC1E,GAAU0E,CAAC,GAAKA,EAAI,EACvC,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGG4I,GAMF,GAJIlR,GAAYkR,CAAC,IACfA,EAAIA,EAAE,YAGJ,CAACpR,EAASoR,CAAC,GAAK,CAACtN,GAAUsN,CAAC,EAC9B,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAIN,IAAIyB,EAAKJ,EAELK,EAAO,EACPxS,GAAS6O,CAAQ,IAEnB0D,EAAKtF,EAAM,KAAKkF,EAAa,CAACtD,EAAUA,CAAQ,CAAC,GAAKsD,EAEtDK,EAAOvF,EAAM,QAAQ,EAAG4B,CAAQ,GAElC,IAAIkC,EAASD,EAAI,EAAIA,EAAI,EACrBE,EAAOF,EAAI,EAAI,CAACA,EAAI,EAGpBG,EAAOrN,EAAK,CAAC,EACbsN,EAAUtN,EAAK,CAAC,EAGhBF,EAAI,KAAK,IAAIuN,EAAOD,EAAME,EAAUH,CAAM,EAG1CI,EAGJ,GAAIlR,EAAQqC,CAAK,EAAG,CAElB,GAAIA,EAAM,SAAWoB,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CyN,EAAS,SAAgB7R,EAAG,CAE1B,OAAOgD,EAAMhD,CAAC,CACtB,CACA,SAAeY,GAASoC,CAAK,EAAG,CAE1B,IAAI8O,EAAK9O,EAAM,OAEf,GAAI8O,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAM1N,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCyN,EAAS,SAAgB7R,EAAG,CAE1B,OAAOgD,EAAM,IAAI,CAAChD,CAAC,CAAC,CAC5B,CACA,MAEM6R,EAAS,UAAkB,CAEzB,OAAO7O,CACf,EASI,QALI4Q,EAAS,CAAA,EACTpL,EAAQ,CAAA,EACRqL,EAAM,CAAA,EAGD9B,EAAI,EAAGA,EAAIH,EAASG,IAAK,CAEhC8B,EAAI,KAAKD,EAAO,MAAM,EAEtB,IAAI5T,EAAI+R,EAAIN,EAEZ,GAAIzR,GAAK,GAAKA,EAAIoE,EAAG,CAEnB,IAAI0M,EAAIe,EAAO7R,CAAC,EAEXiT,EAAGnC,EAAGoC,CAAI,IAEb1K,EAAM,KAAKxI,EAAI0R,CAAI,EAEnBkC,EAAO,KAAK9C,CAAC,EAEhB,CACF,CAED,OAAA+C,EAAI,KAAKD,EAAO,MAAM,EAEf,IAAId,EAAa,CACtB,OAAAc,EACA,MAAApL,EACA,IAAAqL,EACA,KAAM,CAAClC,EAAMC,CAAO,CAC1B,CAAK,CACL,EAWEkB,EAAa,UAAU,SAAW,SAAU9S,EAAG+R,EAAG,CAEhD,GAAI,CAAC3R,EAASJ,CAAC,GAAK,CAACkE,GAAUlE,CAAC,GAAK,CAACI,EAAS2R,CAAC,GAAK,CAAC7N,GAAU6N,CAAC,EAC/D,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,OAAA5I,EAAcnJ,EAAG,KAAK,MAAM,CAAC,CAAC,EAC9BmJ,EAAc4I,EAAG,KAAK,MAAM,CAAC,CAAC,EAG9Be,EAAa,UAAU9S,EAAG+R,EAAG,KAAK,MAAM,CAAC,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAEzE,IACX,EAWEe,EAAa,YAAc,SAAUf,EAAG6B,EAAQpL,EAAOqL,EAAK1Q,EAAU,CAKpE,QAHIuR,EAAKb,EAAI9B,CAAC,EACV4C,EAAKd,EAAI9B,EAAI,CAAC,EAETP,EAAIkD,EAAIlD,EAAImD,EAAInD,IAEvBrO,EAASqF,EAAMgJ,CAAC,EAAGoC,EAAOpC,CAAC,CAAC,CAElC,EAYEsB,EAAa,UAAY,SAAUzS,EAAG6G,EAAG0K,EAASgC,EAAQpL,EAAOqL,EAAK,CAEpE,QAAS9B,EAAI,EAAGA,EAAIH,EAASG,IAAK,CAEhC,IAAI2C,EAAKb,EAAI9B,CAAC,EACV4C,EAAKd,EAAI9B,EAAI,CAAC,EAEdqE,EAAKhC,EAAe/T,EAAGqU,EAAIC,EAAInM,CAAK,EAEpC6N,EAAKjC,EAAelN,EAAGwN,EAAIC,EAAInM,CAAK,EAExC,GAAI4N,EAAKzB,GAAM0B,EAAK1B,GAAMnM,EAAM4N,CAAE,IAAM/V,GAAKmI,EAAM6N,CAAE,IAAMnP,EAAG,CAE5D,GAAI0M,EAAQ,CACV,IAAI9C,EAAI8C,EAAOwC,CAAE,EACjBxC,EAAOwC,CAAE,EAAIxC,EAAOyC,CAAE,EACtBzC,EAAOyC,CAAE,EAAIvF,CACd,CAED,QACD,CAED,GAAIsF,EAAKzB,GAAMnM,EAAM4N,CAAE,IAAM/V,IAAMgW,GAAM1B,GAAMnM,EAAM6N,CAAE,IAAMnP,GAAI,CAE/D,IAAIoP,EAAK1C,EAASA,EAAOwC,CAAE,EAAI,OAE/B5N,EAAM,OAAO6N,EAAI,EAAGnP,CAAC,EACjB0M,GACFA,EAAO,OAAOyC,EAAI,EAAGC,CAAE,EAGzB9N,EAAM,OAAO6N,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCxC,GACFA,EAAO,OAAOyC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAGzC,QACD,CAED,GAAIC,EAAK1B,GAAMnM,EAAM6N,CAAE,IAAMnP,IAAMkP,GAAMzB,GAAMnM,EAAM4N,CAAE,IAAM/V,GAAI,CAE/D,IAAIkW,EAAK3C,EAASA,EAAOyC,CAAE,EAAI,OAE/B7N,EAAM,OAAO4N,EAAI,EAAG/V,CAAC,EACjBuT,GACFA,EAAO,OAAOwC,EAAI,EAAGG,CAAE,EAGzB/N,EAAM,OAAO4N,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCzC,GACFA,EAAO,OAAOwC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,CAE1C,CACF,CACL,EACSvD,CACT,EAAG,CACD,QAAS,EACX,CAAC,EC58CGnH,GAAO,SACPC,GAAe,CAAC,QAAS,SAAU,cAAe,cAAc,EACzD4K,GAA8B9K,EAAQC,GAAMC,GAAc0B,GAAQ,CAC3E,GAAI,CACF,MAAAK,EACA,OAAA0B,EACA,YAAA5B,EACA,aAAAqF,CACD,EAAGxF,EAkCJ,OAAOK,EAAMhC,GAAM,CACjB,GAAI,UAAa,CACf,OAAO8K,EAAQ,CAAA,CAAE,CAClB,EACD,OAAQ,SAAgB9R,EAAQ,CAC9B,OAAO8R,EAAQ,GAAI9R,CAAM,CAC1B,EACD,iBAAkB,SAAsBA,EAAQ4K,EAAU,CACxD,OAAOkH,EAAQ,CAAA,EAAI9R,EAAQ4K,CAAQ,CACpC,EACD,MAAO,SAAeD,EAAM,CAC1B,OAAOmH,EAAQnH,CAAI,CACpB,EACD,OAAQ,SAAgBA,EAAM,CAC5B,OAAOmH,EAAQnH,EAAMA,EAAK,QAAS,CAAA,CACpC,EACD,yBAA0BmH,EAC1B,iCAAkCA,CACtC,CAAG,EAUD,SAASA,EAAQnH,EAAM3K,EAAQ4K,EAAU,CAEvC,GAAI5K,IAAW,SAAWA,IAAW,WAAaA,IAAW,OAC3D,OAAO,IAAI8I,EAAY6B,EAAMC,CAAQ,EAEvC,GAAI5K,IAAW,SACb,OAAO,IAAImO,EAAaxD,EAAMC,CAAQ,EAExC,MAAM,IAAI,UAAU,uBAAyB,KAAK,UAAU5K,CAAM,EAAI,GAAG,CAC1E,CACH,CAAC,EC/EGgH,GAAO,YACPC,GAAe,CAAC,OAAO,EAChB8K,GAAiChL,EAAQC,GAAMC,GAAc0B,GAAQ,CAC9E,GAAI,CACF,MAAAK,CACD,EAAGL,EAaJ,OAAOK,EAAMhC,GAAM,CACjB,iBAAkBwG,GAClB,mBAAoB,SAAwB9R,EAAG6G,EAAG,CAChD,OAAO7G,EAAE,IAAI6G,CAAC,CACf,EACD,uBAAwB,SAA4B7G,EAAG6G,EAAG,CACxD,OAAO7G,EAAE,KAAK6G,CAAC,CAChB,EACD,qBAAsB,SAA0B7G,EAAG6G,EAAG,CACpD,OAAO7G,EAAE,IAAI6G,CAAC,CACf,EACD,aAAcyG,EAAM,YAAY4E,GAAQ,CAAClS,EAAG6G,IAAM,CAChD,GAAI7G,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI6G,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAAC7G,EAAE,UAAU6G,CAAC,EAAG,MAAM,IAAI,MAAM,oBAAoB,EACzD,IAAIyP,EAAMtW,EAAE,QACZ,OAAAsW,EAAI,MAAQhJ,EAAM,KAAK4E,EAAM,CAACoE,EAAI,UAAS,EAAIzP,EAAE,UAAW,CAAA,CAAC,EAAEyP,EAAI,MAAOzP,EAAE,KAAK,EACjFyP,EAAI,UAAY,GACTA,CACb,CAAK,CACL,CAAG,CACH,CAAC,EC5CGhL,GAAO,gBACPC,GAAe,CAAC,QAAS,aAAa,EAC/BgL,GAAqClL,EAAQC,GAAMC,GAAc0B,GAAQ,CAClF,GAAI,CACF,MAAAK,EACA,YAAAkF,CACD,EAAGvF,EAoBJ,OAAO,SAAuB1E,EAAGrF,EAAGJ,EAAU0T,EAAS,CAErD,IAAIC,EAAUlO,EAAE,QACZmO,EAASnO,EAAE,OACXoO,EAAOpO,EAAE,KACTqO,EAAQrO,EAAE,MACVsO,EAAMtO,EAAE,UAGZ,GAAI,CAACkO,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAInF,EAAOsF,EAAM,CAAC,EACdrF,EAAUqF,EAAM,CAAC,EAGjBE,EAEAlE,EAAKJ,EAELK,EAAO,EAEPkE,EAAKjU,EAGL,OAAO+T,GAAQ,WAEjBC,EAAKD,EAELjE,EAAKtF,EAAM,KAAKkF,EAAa,CAACsE,EAAIA,CAAE,CAAC,EAErCjE,EAAOvF,EAAM,QAAQ,EAAGwJ,CAAE,EAE1B5T,EAAIoK,EAAM,QAAQpK,EAAG4T,CAAE,EAEvBC,EAAKzJ,EAAM,KAAKxK,EAAU,CAACgU,EAAIA,CAAE,CAAC,GASpC,QALIE,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAGFxF,EAAI,EAAGA,EAAIH,EAASG,IAAK,CAEhCwF,EAAKxF,CAAC,EAAIuF,EAAO,OAEjB,QAAS5C,EAAKsC,EAAKjF,CAAC,EAAG4C,EAAKqC,EAAKjF,EAAI,CAAC,EAAGP,EAAIkD,EAAIlD,EAAImD,EAAInD,IAAK,CAE5D,IAAIxR,EAAI+W,EAAOvF,CAAC,EAEZV,EAAI+F,EAAUO,EAAG7T,EAAGuT,EAAQtF,CAAC,CAAC,EAAI4F,EAAGN,EAAQtF,CAAC,EAAGjO,CAAC,EAEjD0P,EAAGnC,EAAGoC,CAAI,IAEboE,EAAO,KAAKtX,CAAC,EACbqX,EAAQ,KAAKvG,CAAC,EAEjB,CACF,CAED,OAAAyG,EAAK3F,CAAO,EAAI0F,EAAO,OAGhB1O,EAAE,mBAAmB,CAC1B,OAAQyO,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC5F,EAAMC,CAAO,EACpB,SAAUuF,CAChB,CAAK,CACL,CACA,CAAC,ECpGGxL,GAAO,eACPC,GAAe,CAAC,OAAO,EAChB4L,GAAoC9L,EAAQC,GAAMC,GAAc0B,GAAQ,CACjF,GAAI,CACF,MAAAK,CACD,EAAGL,EAgBJ,OAAO,SAAsBhK,EAAGC,EAAGJ,EAAU0T,EAAS,CAEpD,IAAIY,EAAQnU,EAAE,MACV2T,EAAQ3T,EAAE,MACV4T,EAAM5T,EAAE,UAGR6T,EAEAC,EAAKjU,EAGL,OAAO+T,GAAQ,WAEjBC,EAAKD,EAEL3T,EAAIoK,EAAM,QAAQpK,EAAG4T,CAAE,EAEvBC,EAAKzJ,EAAM,KAAKxK,EAAU,CAACgU,EAAIA,CAAE,CAAC,GAIpC,IAAIO,EAAQT,EAAM,OAAS,EAAIU,EAASP,EAAI,EAAGH,EAAOA,EAAM,CAAC,EAAGQ,EAAOlU,EAAGsT,CAAO,EAAI,GAGrF,OAAOvT,EAAE,kBAAkB,CACzB,KAAMoU,EACN,KAAM5U,EAAMmU,CAAK,EACjB,SAAUE,CAChB,CAAK,CACL,EAGE,SAASQ,EAAS5J,EAAG6J,EAAOhP,EAAGxE,EAAGyT,EAAIC,EAAIjB,EAAS,CAEjD,IAAIkB,EAAK,CAAA,EAET,GAAIH,IAAUhP,EAAE,OAAS,EAEvB,QAAS5I,EAAI,EAAGA,EAAIoE,EAAGpE,IAErB+X,EAAG/X,CAAC,EAAI6W,EAAU9I,EAAE+J,EAAID,EAAG7X,CAAC,CAAC,EAAI+N,EAAE8J,EAAG7X,CAAC,EAAG8X,CAAE,MAI9C,SAAS/F,EAAI,EAAGA,EAAI3N,EAAG2N,IAErBgG,EAAGhG,CAAC,EAAI4F,EAAS5J,EAAG6J,EAAQ,EAAGhP,EAAGA,EAAEgP,EAAQ,CAAC,EAAGC,EAAG9F,CAAC,EAAG+F,EAAIjB,CAAO,EAGtE,OAAOkB,CACR,CACH,CAAC,ECzEGpM,GAAO,iBACPC,GAAe,CAAC,OAAO,EAChBoM,GAAsCtM,EAAQC,GAAMC,GAAc0B,GAAQ,CACnF,GAAI,CACF,MAAAK,CACD,EAAGL,EAaJ,OAAOK,EAAM,iBAAkB,CAC7B,iBAAkByE,GAClB,mBAAoB,SAAwB/R,EAAG6G,EAAG,CAChD,OAAO7G,EAAE,IAAI6G,CAAC,CACf,EACD,uBAAwB,SAA4B7G,EAAG6G,EAAG,CACxD,OAAO7G,EAAE,MAAM6G,CAAC,CACjB,EACD,qBAAsB,SAA0B7G,EAAG6G,EAAG,CACpD,OAAO7G,EAAE,IAAI6G,CAAC,CACf,EACD,gDAAiD,CAAC7G,EAAG6G,IAAMA,EAAE,SAAS7G,CAAC,EACvE,uDAAwD,CAACA,EAAG6G,IAAM7G,EAAE,SAAS6G,CAAC,CAClF,CAAG,CACH,CAAC,EC7BGyE,GAAO,WACPC,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,KAAK,EAC/EqM,GAAgCvM,EAAQC,GAAMC,GAAc0B,GAAQ,CAC7E,GAAI,CACF,MAAAK,EACA,OAAAM,EACA,UAAAiK,EACA,eAAAC,EACA,YAAAtF,EACA,IAAArN,CACD,EAAG8H,EACA8K,EAAgBxB,GAAoB,CACtC,MAAAjJ,EACA,YAAAkF,CACJ,CAAG,EACGwF,EAAeb,GAAmB,CACpC,MAAA7J,CACJ,CAAG,EACD,SAAS2K,EAA0BC,EAAOC,EAAO,CAE/C,OAAQD,EAAM,OAAM,CAClB,IAAK,GAEH,OAAQC,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yEAAyE,EAEhG,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,wDAA0DD,EAAM,CAAC,EAAI,6BAA+BC,EAAM,CAAC,EAAI,GAAG,EAEzI,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CACjH,CACD,MACF,IAAK,GAEH,OAAQA,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yDAA2DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE5I,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,2DAA6DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE9I,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CACjH,CACD,MACF,QACE,MAAM,IAAI,MAAM,+DAAiED,EAAM,OAAS,cAAc,CACjH,CACF,CAUD,SAASE,EAAsBnV,EAAGC,EAAGa,EAAG,CAEtC,GAAIA,IAAM,EACR,MAAM,IAAI,MAAM,mCAAmC,EAErD,OAAOoB,EAAIlC,EAAGC,CAAC,CAChB,CAUD,SAASmV,EAAsBpV,EAAGC,EAAG,CAEnC,GAAIA,EAAE,QAAS,IAAK,QAClB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAOoV,EAA2BrV,EAAGC,CAAC,CACvC,CAUD,SAASoV,EAA2BrV,EAAGC,EAAG,CAExC,IAAIkU,EAAQnU,EAAE,MACV2T,EAAQ3T,EAAE,MACV4T,EAAM5T,EAAE,UAERsV,EAAQrV,EAAE,MACVsV,EAAQtV,EAAE,MACVuV,EAAMvV,EAAE,UAERwV,EAAU9B,EAAM,CAAC,EACjB+B,EAAWH,EAAM,CAAC,EAGlB1B,EAEA8B,EAAKf,EAELgB,EAAKf,EAGLjB,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,GAO1C,QAHIpR,EAAI,CAAA,EAGCgM,EAAI,EAAGA,EAAIiH,EAAUjH,IAAK,CAIjC,QAFIoH,EAAMD,EAAGzB,EAAM,CAAC,EAAGmB,EAAM,CAAC,EAAE7G,CAAC,CAAC,EAEzB/R,EAAI,EAAGA,EAAI+Y,EAAS/Y,IAE3BmZ,EAAMF,EAAGE,EAAKD,EAAGzB,EAAMzX,CAAC,EAAG4Y,EAAM5Y,CAAC,EAAE+R,CAAC,CAAC,CAAC,EAEzChM,EAAEgM,CAAC,EAAIoH,CACR,CAGD,OAAO7V,EAAE,kBAAkB,CACzB,KAAMyC,EACN,KAAM,CAACiT,CAAQ,EACf,SAAU7B,CAChB,CAAK,CACF,CAUD,IAAIiC,EAAwBzL,EAAM,wBAAyB,CACzD,mBAAoB0L,EACpB,oBAAqBC,CACzB,CAAG,EAUGC,EAAwB5L,EAAM,wBAAyB,CACzD,2BAA4B6L,EAC5B,4BAA6BC,EAC7B,4BAA6BC,EAC7B,6BAA8BC,CAClC,CAAG,EAUD,SAASN,EAA2B/V,EAAGC,EAAG,CAExC,IAAIkU,EAAQnU,EAAE,MACV2T,EAAQ3T,EAAE,MACV4T,EAAM5T,EAAE,UAERsV,EAAQrV,EAAE,MACVuV,EAAMvV,EAAE,UAERqW,EAAQ3C,EAAM,CAAC,EACf4C,EAAW5C,EAAM,CAAC,EAGlBE,EAEA8B,EAAKf,EAELgB,EAAKf,EAGLjB,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,GAO1C,QAHIpR,EAAI,CAAA,EAGC/F,EAAI,EAAGA,EAAI4Z,EAAO5Z,IAAK,CAM9B,QAJIoR,EAAMqG,EAAMzX,CAAC,EAEbmZ,EAAMD,EAAG9H,EAAI,CAAC,EAAGwH,EAAM,CAAC,CAAC,EAEpB7G,EAAI,EAAGA,EAAI8H,EAAU9H,IAE5BoH,EAAMF,EAAGE,EAAKD,EAAG9H,EAAIW,CAAC,EAAG6G,EAAM7G,CAAC,CAAC,CAAC,EAEpChM,EAAE/F,CAAC,EAAImZ,CACR,CAGD,OAAO7V,EAAE,kBAAkB,CACzB,KAAMyC,EACN,KAAM,CAAC6T,CAAK,EACZ,SAAUzC,CAChB,CAAK,CACF,CAUD,SAASqC,EAAgClW,EAAGC,EAAG,CAE7C,IAAIkU,EAAQnU,EAAE,MACV2T,EAAQ3T,EAAE,MACV4T,EAAM5T,EAAE,UAERsV,EAAQrV,EAAE,MACVsV,EAAQtV,EAAE,MACVuV,EAAMvV,EAAE,UAERqW,EAAQ3C,EAAM,CAAC,EACf4C,EAAW5C,EAAM,CAAC,EAClB+B,EAAWH,EAAM,CAAC,EAGlB1B,EAEA8B,EAAKf,EAELgB,EAAKf,EAGLjB,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,GAO1C,QAHIpR,EAAI,CAAA,EAGC/F,EAAI,EAAGA,EAAI4Z,EAAO5Z,IAAK,CAE9B,IAAIoR,EAAMqG,EAAMzX,CAAC,EAEjB+F,EAAE/F,CAAC,EAAI,GAEP,QAAS+R,EAAI,EAAGA,EAAIiH,EAAUjH,IAAK,CAIjC,QAFIoH,EAAMD,EAAG9H,EAAI,CAAC,EAAGwH,EAAM,CAAC,EAAE7G,CAAC,CAAC,EAEvB1R,EAAI,EAAGA,EAAIwZ,EAAUxZ,IAE5B8Y,EAAMF,EAAGE,EAAKD,EAAG9H,EAAI/Q,CAAC,EAAGuY,EAAMvY,CAAC,EAAE0R,CAAC,CAAC,CAAC,EAEvChM,EAAE/F,CAAC,EAAE+R,CAAC,EAAIoH,CACX,CACF,CAGD,OAAO7V,EAAE,kBAAkB,CACzB,KAAMyC,EACN,KAAM,CAAC6T,EAAOZ,CAAQ,EACtB,SAAU7B,CAChB,CAAK,CACF,CAUD,SAASsC,EAAiCnW,EAAGC,EAAG,CAE9C,IAAIkU,EAAQnU,EAAE,MACV2T,EAAQ3T,EAAE,MACV4T,EAAM5T,EAAE,UAERwW,EAAUvW,EAAE,QACZwW,EAASxW,EAAE,OACXyW,EAAOzW,EAAE,KACTsV,EAAQtV,EAAE,MACVuV,EAAMvV,EAAE,UAEZ,GAAI,CAACuW,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAIF,EAAQ3C,EAAM,CAAC,EACf+B,EAAWH,EAAM,CAAC,EAGlB1B,EAEA8B,EAAKf,EAELgB,EAAKf,EAELlF,EAAKJ,EAELK,EAAO,EAGPgE,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,EACxClE,EAAKtF,EAAM,KAAKkF,EAAa,CAACsE,EAAIA,CAAE,CAAC,EAErCjE,EAAOvF,EAAM,QAAQ,EAAGwJ,CAAE,GAiB5B,QAbIE,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAEPxR,EAAIxC,EAAE,mBAAmB,CAC3B,OAAQ8T,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACqC,EAAOZ,CAAQ,EACtB,SAAU7B,CAChB,CAAK,EAGQ8C,EAAK,EAAGA,EAAKjB,EAAUiB,IAAM,CAEpC1C,EAAK0C,CAAE,EAAI3C,EAAO,OAElB,IAAI4C,EAAMF,EAAKC,CAAE,EACbE,GAAMH,EAAKC,EAAK,CAAC,EAErB,GAAIE,GAAMD,EAIR,QAFI7J,EAAO,EAEFrQ,EAAI,EAAGA,EAAI4Z,EAAO5Z,IAAK,CAM9B,QAJIoa,GAAOpa,EAAI,EAEXqa,GAAM,OAEDC,EAAKJ,EAAKI,EAAKH,GAAKG,IAAM,CAEjC,IAAIC,GAAKR,EAAOO,CAAE,EAEdjK,IAAS+J,IAEXC,GAAMnB,EAAGzB,EAAMzX,CAAC,EAAEua,EAAE,EAAGT,EAAQQ,CAAE,CAAC,EAElCjK,EAAO+J,IAGPC,GAAMpB,EAAGoB,GAAKnB,EAAGzB,EAAMzX,CAAC,EAAEua,EAAE,EAAGT,EAAQQ,CAAE,CAAC,CAAC,CAE9C,CAEGjK,IAAS+J,IAAQ,CAACnH,EAAGoH,GAAKnH,CAAI,IAEhCoE,EAAO,KAAKtX,CAAC,EACbqX,EAAQ,KAAKgD,EAAG,EAEnB,CAEJ,CAED,OAAA9C,EAAKyB,CAAQ,EAAI1B,EAAO,OAGjBvR,CACR,CAUD,SAASuT,EAA4BhW,EAAGC,EAAG,CAEzC,IAAIuT,EAAUxT,EAAE,QACZyT,EAASzT,EAAE,OACX0T,EAAO1T,EAAE,KACT4T,EAAM5T,EAAE,UAEZ,GAAI,CAACwT,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAI8B,EAAQrV,EAAE,MACVuV,EAAMvV,EAAE,UAERqW,EAAQtW,EAAE,MAAM,CAAC,EACjBkX,EAAQjX,EAAE,MAAM,CAAC,EAEjB8T,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAGPJ,EAEA8B,EAAKf,EAELgB,EAAKf,EAELlF,EAAKJ,EAELK,EAAO,EAGPgE,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,EACxClE,EAAKtF,EAAM,KAAKkF,EAAa,CAACsE,EAAIA,CAAE,CAAC,EAErCjE,EAAOvF,EAAM,QAAQ,EAAGwJ,CAAE,GAI5B,IAAI9W,EAAI,CAAA,EAEJqT,EAAI,CAAA,EAGR6D,EAAK,CAAC,EAAI,EAEV,QAASgD,EAAK,EAAGA,EAAKC,EAAOD,IAAM,CAEjC,IAAIE,EAAM7B,EAAM2B,CAAE,EAElB,GAAI,CAACtH,EAAGwH,EAAKvH,CAAI,EAEf,QAASwH,EAAM1D,EAAKuD,CAAE,EAAGI,GAAM3D,EAAKuD,EAAK,CAAC,EAAGK,EAAKF,EAAKE,EAAKD,GAAKC,IAAM,CAErE,IAAIC,EAAK9D,EAAO6D,CAAE,EAEblH,EAAEmH,CAAE,EASPxa,EAAEwa,CAAE,EAAI5B,EAAG5Y,EAAEwa,CAAE,EAAG3B,EAAGuB,EAAK3D,EAAQ8D,CAAE,CAAC,CAAC,GAPtClH,EAAEmH,CAAE,EAAI,GAERvD,EAAO,KAAKuD,CAAE,EAEdxa,EAAEwa,CAAE,EAAI3B,EAAGuB,EAAK3D,EAAQ8D,CAAE,CAAC,EAK9B,CAEJ,CAED,QAASE,GAAKxD,EAAO,OAAQ9Q,GAAI,EAAGA,GAAIsU,GAAItU,KAAK,CAE/C,IAAIuU,EAAKzD,EAAO9Q,EAAC,EAEjB6Q,EAAQ7Q,EAAC,EAAInG,EAAE0a,CAAE,CAClB,CAED,OAAAxD,EAAK,CAAC,EAAID,EAAO,OAGVhU,EAAE,mBAAmB,CAC1B,OAAQ+T,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACqC,EAAO,CAAC,EACf,SAAUzC,CAChB,CAAK,CACF,CAUD,SAASuC,EAAiCpW,EAAGC,EAAG,CAE9C,IAAIuT,EAAUxT,EAAE,QACZyT,EAASzT,EAAE,OACX0T,EAAO1T,EAAE,KACT4T,EAAM5T,EAAE,UAEZ,GAAI,CAACwT,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAI8B,EAAQrV,EAAE,MACVuV,EAAMvV,EAAE,UAERqW,EAAQtW,EAAE,MAAM,CAAC,EACjBkX,EAAQjX,EAAE,MAAM,CAAC,EACjByV,EAAWzV,EAAE,MAAM,CAAC,EAGpB4T,EAEA8B,EAAKf,EAELgB,EAAKf,EAELlF,EAAKJ,EAELK,EAAO,EAGPgE,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,EACxClE,EAAKtF,EAAM,KAAKkF,EAAa,CAACsE,EAAIA,CAAE,CAAC,EAErCjE,EAAOvF,EAAM,QAAQ,EAAGwJ,CAAE,GAsB5B,QAlBIE,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAEPxR,EAAIzC,EAAE,mBAAmB,CAC3B,OAAQ+T,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACqC,EAAOZ,CAAQ,EACtB,SAAU7B,CAChB,CAAK,EAGG9W,EAAI,CAAA,EAEJqT,EAAI,CAAA,EAGCuG,EAAK,EAAGA,EAAKjB,EAAUiB,IAAM,CAEpC1C,EAAK0C,CAAE,EAAI3C,EAAO,OAIlB,QAFI8C,GAAOH,EAAK,EAEPM,EAAK,EAAGA,EAAKC,EAAOD,IAAM,CAEjC,IAAIS,EAAOpC,EAAM2B,CAAE,EAAEN,CAAE,EAEvB,GAAI,CAAChH,EAAG+H,EAAM9H,CAAI,EAEhB,QAASwH,GAAM1D,EAAKuD,CAAE,EAAGI,GAAM3D,EAAKuD,EAAK,CAAC,EAAGK,EAAKF,GAAKE,EAAKD,GAAKC,IAAM,CAErE,IAAIC,GAAK9D,EAAO6D,CAAE,EAEdlH,EAAEmH,EAAE,IAAMT,IAEZ1G,EAAEmH,EAAE,EAAIT,GAER9C,EAAO,KAAKuD,EAAE,EAEdxa,EAAEwa,EAAE,EAAI3B,EAAG8B,EAAMlE,EAAQ8D,CAAE,CAAC,GAG5Bva,EAAEwa,EAAE,EAAI5B,EAAG5Y,EAAEwa,EAAE,EAAG3B,EAAG8B,EAAMlE,EAAQ8D,CAAE,CAAC,CAAC,CAE1C,CAEJ,CAED,QAASK,GAAK1D,EAAK0C,CAAE,EAAGa,GAAKxD,EAAO,OAAQ9Q,GAAIyU,GAAIzU,GAAIsU,GAAItU,KAAK,CAE/D,IAAIuU,GAAKzD,EAAO9Q,EAAC,EAEjB6Q,EAAQ7Q,EAAC,EAAInG,EAAE0a,EAAE,CAClB,CACF,CAED,OAAAxD,EAAKyB,CAAQ,EAAI1B,EAAO,OAGjBvR,CACR,CAUD,SAAS4T,EAAkCrW,EAAGC,EAAG,CAE/C,IAAIuT,EAAUxT,EAAE,QACZyT,EAASzT,EAAE,OACX0T,EAAO1T,EAAE,KACT4T,EAAM5T,EAAE,UAERwW,EAAUvW,EAAE,QACZwW,EAASxW,EAAE,OACXyW,EAAOzW,EAAE,KACTuV,EAAMvV,EAAE,UAGRqW,EAAQtW,EAAE,MAAM,CAAC,EACjB0V,EAAWzV,EAAE,MAAM,CAAC,EAEpBqQ,EAASkD,GAAWgD,EAGpB3C,EAEA8B,EAAKf,EAELgB,EAAKf,EAGLjB,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,WAE9CC,EAAKD,EAEL+B,EAAKtL,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACnC+B,EAAKvL,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,GAuB1C,QAnBIE,EAAUzD,EAAS,CAAE,EAAG,OACxB0D,EAAS,CAAA,EACTC,EAAO,CAAA,EAEPxR,EAAIzC,EAAE,mBAAmB,CAC3B,OAAQ+T,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACqC,EAAOZ,CAAQ,EACtB,SAAU7B,CAChB,CAAK,EAGG9W,EAAIuT,EAAS,CAAE,EAAG,OAElBF,EAAI,CAAA,EAEJkH,EAAIF,GAAKC,EAAKL,EAAIJ,GAAKC,GAAKU,EAAIN,GAE3BN,GAAK,EAAGA,GAAKjB,EAAUiB,KAAM,CAEpC1C,EAAK0C,EAAE,EAAI3C,EAAO,OAElB,IAAI8C,GAAOH,GAAK,EAEhB,IAAKC,GAAMF,EAAKC,EAAE,EAAGE,GAAMH,EAAKC,GAAK,CAAC,EAAGK,EAAKJ,GAAKI,EAAKH,GAAKG,IAI3D,GAFAC,GAAKR,EAAOO,CAAE,EAEV1G,EAEF,IAAK8G,GAAM1D,EAAKuD,EAAE,EAAGI,EAAM3D,EAAKuD,GAAK,CAAC,EAAGK,EAAKF,GAAKE,EAAKD,EAAKC,IAE3DC,EAAK9D,EAAO6D,CAAE,EAEVlH,EAAEmH,CAAE,IAAMT,IAEZ1G,EAAEmH,CAAE,EAAIT,GAER9C,EAAO,KAAKuD,CAAE,EAEdxa,EAAEwa,CAAE,EAAI3B,EAAGY,EAAQQ,CAAE,EAAGxD,EAAQ8D,CAAE,CAAC,GAGnCva,EAAEwa,CAAE,EAAI5B,EAAG5Y,EAAEwa,CAAE,EAAG3B,EAAGY,EAAQQ,CAAE,EAAGxD,EAAQ8D,CAAE,CAAC,CAAC,MAKlD,KAAKF,GAAM1D,EAAKuD,EAAE,EAAGI,EAAM3D,EAAKuD,GAAK,CAAC,EAAGK,EAAKF,GAAKE,EAAKD,EAAKC,IAE3DC,EAAK9D,EAAO6D,CAAE,EAEVlH,EAAEmH,CAAE,IAAMT,KAEZ1G,EAAEmH,CAAE,EAAIT,GAER9C,EAAO,KAAKuD,CAAE,GAMtB,GAAIjH,EAEF,QAASqH,GAAK1D,EAAK0C,EAAE,EAAGa,GAAKxD,EAAO,OAAQ9Q,GAAIyU,GAAIzU,GAAIsU,GAAItU,KAAK,CAE/D,IAAIuU,GAAKzD,EAAO9Q,EAAC,EAEjB6Q,EAAQ7Q,EAAC,EAAInG,EAAE0a,EAAE,CAClB,CAEJ,CAED,OAAAxD,EAAKyB,CAAQ,EAAI1B,EAAO,OAGjBvR,CACR,CAmCD,OAAO4H,EAAMhC,GAAMwM,EAAgB,CAGjC,eAAgBxK,EAAM,QAAQ,iBAAkBuN,GAAU,CAAC7a,EAAG6G,IAAM,CAElEoR,EAA0B3P,GAAUtI,CAAC,EAAGsI,GAAUzB,CAAC,CAAC,EAGpD,IAAI6J,EAAImK,EAAOjN,EAAO5N,CAAC,EAAG4N,EAAO/G,CAAC,CAAC,EAEnC,OAAOtG,GAASmQ,CAAC,EAAIA,EAAE,QAAO,EAAKA,CACzC,CAAK,EACD,iBAAkB,SAAsB1Q,EAAG6G,EAAG,CAE5C,IAAIiU,EAAQ9a,EAAE,OACV+a,EAAQlU,EAAE,OAMd,OAHAoR,EAA0B6C,EAAOC,CAAK,EAGlCD,EAAM,SAAW,EAEfC,EAAM,SAAW,EAEZ3C,EAAsBpY,EAAG6G,EAAGiU,EAAM,CAAC,CAAC,EAGtCzC,EAAsBrY,EAAG6G,CAAC,EAG/BkU,EAAM,SAAW,EAEZhC,EAAsB/Y,EAAG6G,CAAC,EAG5BqS,EAAsBlZ,EAAG6G,CAAC,CAClC,EACD,gBAAiByG,EAAM,QAAQ,gBAAiBuN,GAAU,CAAC7a,EAAG6G,IAAMgU,EAAO7a,EAAG4N,EAAO/G,CAAC,CAAC,CAAC,EACxF,gBAAiByG,EAAM,YAAY4E,GAAQ,CAAClS,EAAG6G,IAEtCqL,EAAKtE,EAAO5N,EAAG6G,EAAE,QAAS,CAAA,EAAGA,CAAC,CACtC,EACD,oBAAqB,SAAyB7G,EAAG6G,EAAG,CAClD,OAAOkR,EAAc/X,EAAG6G,EAAGiR,EAAgB,EAAK,CACjD,EACD,mBAAoB,SAAwB9X,EAAG6G,EAAG,CAChD,OAAOmR,EAAahY,EAAG6G,EAAGiR,EAAgB,EAAK,CAChD,EACD,oBAAqB,SAAyB9X,EAAG6G,EAAG,CAClD,OAAOkR,EAAclR,EAAG7G,EAAG8X,EAAgB,EAAI,CAChD,EACD,mBAAoB,SAAwB9X,EAAG6G,EAAG,CAChD,OAAOmR,EAAanR,EAAG7G,EAAG8X,EAAgB,EAAI,CAC/C,EACD,aAAc,SAAkB9X,EAAG6G,EAAG,CAEpC,OAAOmR,EAAapK,EAAO5N,CAAC,EAAG6G,EAAGiR,EAAgB,EAAK,EAAE,SAC1D,EACD,aAAc,SAAkB9X,EAAG6G,EAAG,CAEpC,OAAOmR,EAAapK,EAAO/G,CAAC,EAAG7G,EAAG8X,EAAgB,EAAI,EAAE,SACzD,EACD,WAAYA,EACZ,mBAAoBxK,EAAM,YAAY4E,GAAQ,CAAClS,EAAG6G,EAAGmU,IAAS,CAE5D,QADI1T,EAAS4K,EAAKlS,EAAG6G,CAAC,EACblH,EAAI,EAAGA,EAAIqb,EAAK,OAAQrb,IAC/B2H,EAAS4K,EAAK5K,EAAQ0T,EAAKrb,CAAC,CAAC,EAE/B,OAAO2H,CACb,CAAK,CACL,CAAG,CACH,CAAC,EC52BGgE,GAAO,OACPC,GAAe,CAAC,OAAO,EAChB0P,GAA4B5P,EAAQC,GAAMC,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAK,CACD,EAAGL,EA0BJ,OAAOK,EAAMhC,GAAM,CACjB,gCAAiCtL,GAAKA,EACtC,QAASA,GAAKA,EAAE,UAAW,EAC3B,iBAAkBsN,EAAM,YAAY4E,GAAQlS,GAAK4R,GAAQ5R,EAAGkS,CAAI,CAAC,CACrE,CAAG,CACH,CAAC,EChCM,SAASgJ,IAAW,CACzB,MAAM,IAAI,MAAM,sCAAsC,CACxD,CCLA,IAAI5P,GAAO,OACPC,GAAe,CAAC,QAAS,SAAU,SAAS,EACrC4P,GAA4B9P,EAAQC,GAAMC,GAAc0B,GAAQ,CACzE,GAAI,CACF,MAAAK,EACA,OAAA3J,EACA,OAAAiK,CACD,EAAGX,EAwBJ,OAAOK,EAAMhC,GAAM,CACjB,OAAQ,SAAgBtL,EAAG,CACzB,OAAOA,EAAE,OAAOA,EAAE,KAAM,CAAA,CACzB,EACD,MAAOsI,GACP,OAAQ,SAAgBtI,EAAG,CACzB,OAAO2D,EAAO,SAAW,QAAU,CAAC3D,EAAE,MAAM,EAAI4N,EAAO,CAAC5N,EAAE,MAAM,CAAC,CAClE,EACD,uDAAwD,SAA+CA,EAAG,CAExG,OAAO2D,EAAO,SAAW,QAAU,CAAE,EAAGiK,EAASA,EAAO,CAAA,CAAE,EAAIsN,IAC/D,CACL,CAAG,CACH,CAAC,EC7CG5P,GAAO,MACPC,GAAe,CAAC,QAAS,YAAa,iBAAkB,OAAQ,MAAM,EAC/D6P,GAA2B/P,EAAQC,GAAMC,GAAc0B,GAAQ,CACxE,GAAI,CACF,MAAAK,EACA,UAAAuK,EACA,eAAAC,EACA,KAAAuD,EACA,KAAApX,CACD,EAAGgJ,EAwBJ,OAAOK,EAAMhC,GAAM,CACjB,2CAA4CgQ,EAC5C,6BAA8BC,CAClC,CAAG,EACD,SAASC,EAAaxb,EAAG6G,EAAG,CAC1B,IAAI4U,EAAQC,EAAM1b,CAAC,EACf2b,EAAQD,EAAM7U,CAAC,EACf+U,EAAMC,EACV,GAAIJ,EAAM,SAAW,EACnBG,EAAOH,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CG,EAAOH,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIE,EAAM,SAAW,EACnBE,EAAOF,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CE,EAAOF,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIC,IAASC,EAAM,MAAM,IAAI,WAAW,mCAAqCD,EAAO,OAASC,EAAO,GAAG,EACvG,GAAID,IAAS,EAAG,MAAM,IAAI,WAAW,mDAAmD,EACxF,OAAOA,CACR,CACD,SAASN,EAAUrY,EAAGC,EAAG,CACvB,IAAI4Y,EAAIN,EAAavY,EAAGC,CAAC,EACrBkU,EAAQ7W,GAAS0C,CAAC,EAAIA,EAAE,MAAQA,EAChC4T,EAAMtW,GAAS0C,CAAC,EAAIA,EAAE,UAAY,OAClCsV,EAAQhY,GAAS2C,CAAC,EAAIA,EAAE,MAAQA,EAChCuV,EAAMlY,GAAS2C,CAAC,EAAIA,EAAE,UAAY,OAGlC6Y,EAAYL,EAAMzY,CAAC,EAAE,SAAW,EAChC+Y,EAAYN,EAAMxY,CAAC,EAAE,SAAW,EAChC+Y,EAAMpE,EACNqE,EAAMpE,EAGV,GAAIjB,GAAO4B,GAAO5B,IAAQ4B,GAAO,OAAO5B,GAAQ,SAAU,CACxD,IAAIC,EAAKD,EAEToF,EAAM3O,EAAM,KAAKuK,EAAW,CAACf,EAAIA,CAAE,CAAC,EACpCoF,EAAM5O,EAAM,KAAKwK,EAAgB,CAAChB,EAAIA,CAAE,CAAC,CAC1C,CAGD,GAAI,CAACiF,GAAa,CAACC,EAAW,CAE5B,QADItW,EAAIwW,EAAIb,EAAKjE,EAAM,CAAC,CAAC,EAAGmB,EAAM,CAAC,CAAC,EAC3B5Y,EAAI,EAAGA,EAAImc,EAAGnc,IACrB+F,EAAIuW,EAAIvW,EAAGwW,EAAIb,EAAKjE,EAAMzX,CAAC,CAAC,EAAG4Y,EAAM5Y,CAAC,CAAC,CAAC,EAE1C,OAAO+F,CACR,CAGD,GAAI,CAACqW,GAAaC,EAAW,CAE3B,QADIG,EAAKD,EAAIb,EAAKjE,EAAM,CAAC,CAAC,EAAGmB,EAAM,CAAC,EAAE,CAAC,CAAC,EAC/B9D,EAAK,EAAGA,EAAKqH,EAAGrH,IACvB0H,EAAKF,EAAIE,EAAID,EAAIb,EAAKjE,EAAM3C,CAAE,CAAC,EAAG8D,EAAM9D,CAAE,EAAE,CAAC,CAAC,CAAC,EAEjD,OAAO0H,CACR,CAGD,GAAIJ,GAAa,CAACC,EAAW,CAE3B,QADII,EAAMF,EAAIb,EAAKjE,EAAM,CAAC,EAAE,CAAC,CAAC,EAAGmB,EAAM,CAAC,CAAC,EAChC3D,EAAM,EAAGA,EAAMkH,EAAGlH,IACzBwH,EAAMH,EAAIG,EAAKF,EAAIb,EAAKjE,EAAMxC,CAAG,EAAE,CAAC,CAAC,EAAG2D,EAAM3D,CAAG,CAAC,CAAC,EAErD,OAAOwH,CACR,CAGD,GAAIL,GAAaC,EAAW,CAE1B,QADIK,EAAMH,EAAIb,EAAKjE,EAAM,CAAC,EAAE,CAAC,CAAC,EAAGmB,EAAM,CAAC,EAAE,CAAC,CAAC,EACnCzD,EAAM,EAAGA,EAAMgH,EAAGhH,IACzBuH,EAAMJ,EAAII,EAAKH,EAAIb,EAAKjE,EAAMtC,CAAG,EAAE,CAAC,CAAC,EAAGyD,EAAMzD,CAAG,EAAE,CAAC,CAAC,CAAC,EAExD,OAAOuH,CACR,CACF,CACD,SAASd,EAAWvb,EAAG6G,EAAG,CACxB2U,EAAaxb,EAAG6G,CAAC,EAYjB,QAXIyV,EAAStc,EAAE,OACXuc,EAAUvc,EAAE,QACZwc,EAAS3V,EAAE,OACX4V,EAAU5V,EAAE,QAGZnB,EAAI,EACJuW,EAAMpE,EACNqE,EAAMpE,EACNnY,EAAI,EACJ+R,EAAI,EACD/R,EAAI2c,EAAO,QAAU5K,EAAI8K,EAAO,QAAQ,CAC7C,IAAIE,EAAIJ,EAAO3c,CAAC,EACZgd,EAAIH,EAAO9K,CAAC,EAChB,GAAIgL,EAAIC,EAAG,CACThd,IACA,QACD,CACD,GAAI+c,EAAIC,EAAG,CACTjL,IACA,QACD,CACGgL,IAAMC,IACRjX,EAAIuW,EAAIvW,EAAGwW,EAAIK,EAAQ5c,CAAC,EAAG8c,EAAQ/K,CAAC,CAAC,CAAC,EACtC/R,IACA+R,IAEH,CACD,OAAOhM,CACR,CAGD,SAASgW,EAAM1b,EAAG,CAChB,OAAOO,GAASP,CAAC,EAAIA,EAAE,OAASiE,EAAKjE,CAAC,CACvC,CACH,CAAC,ECnJUkN,GAA2BgB,GAAqB,CACzD,OAAAvK,EACF,CAAC,EACUwJ,GAAyBmB,GAAmB,CAAA,CAAE,EAU9CjB,GAA0ByB,GAAoB,CAAA,CAAE,EAgBhDE,GAAwBD,GAAkB,CAAA,CAAE,EA0B5C3B,GAA6BqC,GAAuB,CAC7D,OAAAT,EACF,CAAC,EAkBU1B,GAAuBN,GAAY,CAC5C,UAAAE,GACA,QAAAC,GACA,YAAAC,GACA,SAAAC,EACF,CAAC,EA4BUwK,GAA2BxB,GAAgB,CACpD,MAAA/I,EACF,CAAC,EAyCU+N,GAAsBJ,GAAW,CAC1C,MAAA3N,EACF,CAAC,EAeUkF,GAA6BL,GAAkB,CACxD,OAAAxO,GACA,MAAA2J,EACF,CAAC,EA+DUwK,GAAgCH,GAAqB,CAC9D,MAAArK,EACF,CAAC,EAsCUmF,GAA8BF,GAAwB,CAC/D,OAAAvD,GACA,YAAAwD,GACA,MAAAlF,EACF,CAAC,EAkGUM,GAAwBuI,GAAa,CAC9C,YAAA/I,GACA,OAAA4B,GACA,aAAAyD,GACA,MAAAnF,EACF,CAAC,EAwCUrJ,GAAsBkX,GAAW,CAC1C,OAAAvN,GACA,OAAAjK,GACA,MAAA2J,EACF,CAAC,EA+TUnI,GAAqBiW,GAAU,CACxC,UAAAvD,GACA,KAAAwD,GACA,eAAAvD,GACA,KAAA7T,GACA,MAAAqJ,EACF,CAAC,EA6DUsP,GAA0BhF,GAAe,CAClD,UAAAC,GACA,IAAA1S,GACA,YAAAqN,GACA,OAAA5E,GACA,eAAAkK,GACA,MAAAxK,EACF,CAAC","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39]}